Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 70 papers published in subject: > since this site started. |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. Robust Regional Bounding Sphere Representation for 3D Face Recognition | |||
MING Yue,RUAN Qiuqi | |||
Information Science and System Science 12 March 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A robust regional bounding sphere representation (RRBSR) is introduced to facilitate 3D face recognition. In our framework, we first segment a group of regions on each 3D facial point cloud by curvature information and facial shape characteristics. Then, the extracted regions are projected on the bounding spherical bands in order to reflect the distinctive shape information of facial different regions. Next, an orthogonal regional and global regression (ORGR) is utilized to extract the discriminant feature vectors. Experimental results based on the different 3D face databases demonstrate that balancing regional and global facial characteristics allow for the high-qualified performance. Compared with the previous popular approaches, our framework has a consistently better performance in terms of effectiveness, robustness, and universality. | |||
TO cite this article:MING Yue,RUAN Qiuqi. Robust Regional Bounding Sphere Representation for 3D Face Recognition[OL].[12 March 2012] http://en.paper.edu.cn/en_releasepaper/content/4469491 |
2. A centrality measure of complex networks based on information flow | |||
CHEN Guoqiang,WANG Yuping | |||
Information Science and System Science 03 March 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A new centrality measure for complex networks, called information flow centrality, is proposed in this paper. This centrality measure is based on the concept of the information flow in networks. It can be applicable to not only the connect networks, but also the disconnect networks. Moreover, it overcomes some disadvantages of several often used centrality measures. The performance of the proposed measure is compared with the standard centrality measures using a classic dataset and the results indicate the proposed measure performs more reasonable. | |||
TO cite this article:CHEN Guoqiang,WANG Yuping. A centrality measure of complex networks based on information flow[OL].[ 3 March 2012] http://en.paper.edu.cn/en_releasepaper/content/4468479 |
3. An Efficient Systematic Encoder for Low-rate Blaum-Roth Codes | |||
Guo Qian,Kan Haibin | |||
Information Science and System Science 19 February 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Blaum-Roth codes, i.e., Reed-Solomon(RS) codes over the polynomial rings modulo sum_{i=0}^{p-1}x^{i} over GF(q), where p is a prime, is a family of maximum distance separable(MDS) array codes, which has important applications in storage systems, such as magnetic tapes, RAID architectures and distributed file systems. Compared to EVENODD codes or other existing coding schemes used in storage systems, low-rate Blaum-Roth codes seems more applicable when the size of the storage nodes becomes large and the erasures appear frequently.In this paper, we propose a new systematic encoding procedure for Blaum-Roth codes. Our method generalizes the interpolation-based erasure-only decoder for RS codes proposed by D.J.J. Versfeld et al., which is efficient for low-rate RS codes. Later, we derive a systematic encoder from this decoder, since encoding can be implemented as a special case of decoding. Compared to the systematic encoding procedure introduced by M. Blaum and R. Roth, our encoding procedure is much more efficient for low-rate Blaum-Roth codes. | |||
TO cite this article:Guo Qian,Kan Haibin. An Efficient Systematic Encoder for Low-rate Blaum-Roth Codes[OL].[19 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4467399 |
4. On Comparisons of Expected Performance Between Two Worst-case Optimal Floating Codes in Flash Memories | |||
Guo Qian,Kan Haibin | |||
Information Science and System Science 19 February 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Floating codes are codes for multi-level flash memories that can be modeled well as Write Asymmetric Memory (WAM). There are two criteria to evaluate the optimality of floating codes, i.e., worst-case and average-case performance, and researchers have proposed various optimal floating codes in the sense of worst-case and average-case, respectively. However, little research has been focused on constructing optimal rewriting codes in the sense of both criteria. In this paper, we compare the expected performance between two worst-case optimal floating codes for two bits, i.e., the YVSW and JBB codes and show that the YVSW codes has better expected performance than the JBB one, although they are both worst-case optimal. So the YVSW codes is a better choice when we look for floating codes in the sense of both worst-case and average-case criteria. | |||
TO cite this article:Guo Qian,Kan Haibin. On Comparisons of Expected Performance Between Two Worst-case Optimal Floating Codes in Flash Memories[OL].[19 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4467372 |
5. A Globally Optimal Distributed Estimation Fusion Algorithm for Dynamical Systems withIntermittent Communications and Correlated Sensor Noises | |||
Luo Yingting,Zhu Yunmin | |||
Information Science and System Science 11 January 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Due to power and bandwidth limitationin wireless sensor network, thesensor communications to a fusion center are often intermittent. In this article, we point out that the distributed estimation fusion algorithm can be used in the discrete time linear dynamic system even if the sensor noises are cross-correlated.Compared with existing distributed fusion algorithms, the biggest advantage of this distributed fusion algorithm can be globally optimal no matter how long is the intermittent communicationperiod provided that the intermittent communications are synchronous. | |||
TO cite this article:Luo Yingting,Zhu Yunmin. A Globally Optimal Distributed Estimation Fusion Algorithm for Dynamical Systems withIntermittent Communications and Correlated Sensor Noises[OL].[11 January 2012] http://en.paper.edu.cn/en_releasepaper/content/4459095 |
6. A discrete-time recurrent neural network with global exponential stability for constrained linear variational inequalities | |||
LIU Qingshan | |||
Information Science and System Science 11 January 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, a discrete-time recurrent neural networks with global exponential stability are proposed for solving constrained linear variational inequalities problems. Compared with the existing neural networks for linear variational inequalities, the proposed neural network in this paper has lower model complexity with only one-layer structure. The global exponential stability of the neural network can be guaranteed under some mild conditions. Simulation results show the performance and characteristic of the proposed neural network. | |||
TO cite this article:LIU Qingshan. A discrete-time recurrent neural network with global exponential stability for constrained linear variational inequalities[OL].[11 January 2012] http://en.paper.edu.cn/en_releasepaper/content/4459837 |
7. Modeling and Simulation for Dynamics of Anti-HBV Infection Personalized Therapy | |||
CHEN Xiao,Min Lequan,ZHENG Yu ,YE Yongan | |||
Information Science and System Science 24 August 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper introduces a differential equation with 5 state variables to describe the anti-hepatitis B virus (HBV) infection therapy dynamics which clears chronic hepatitis B (CHB) patients' HBV without damaging patients' hepatocytes. This equation has two equilibrium points Q1 and Q2, representing infection free state and persistent infection state, respectively. This paper proves that if the basic virus reproductive number R0 of our model is less than 1, then the infection free equilibrium point Q1 is globally attractive. This result suggests that if an anti-virus infection therapy makes an infected patient's R0 < 1, then the patient will eventually recover even if infected with a large amount of virus. As an~application, we use this model to simulate the dynamics of a CHB patient's anti-HBV infection combination therapy with traditional Chinese herbal medicine (TCM), TCM plus adefovir (AD), and TCM plus entecavir (EN). Our numerical simulation results described well the patient's HBV DNA and ALT levels. Further numerical simulation showed that only for a treatment period of about 4 years will all infected hepatocytes be replaced by normal ones. | |||
TO cite this article:CHEN Xiao,Min Lequan,ZHENG Yu , et al. Modeling and Simulation for Dynamics of Anti-HBV Infection Personalized Therapy[OL].[24 August 2011] http://en.paper.edu.cn/en_releasepaper/content/4438370 |
8. Tissue P systems with cell separation: attacking the partition problem | |||
Zhang Xingyi,Wang Shuo,Niu Yunyun,Pan Linqiang | |||
Information Science and System Science 11 January 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Tissue P systems are distributed parallel and non-deterministic computing models in the framework of membrane computing, which are inspired by intercellular communication and cooperation between neurons. Recently, cell separation is introduced into tissue P systems, which enables systems to generate an exponential workspace in a polynomial time. In this work, the computational power of tissue P systems with cell separation is investigated. Specifically, a uniform family of tissue P systems with cell separation is constructed for efficiently solving a well-known NP-complete problem, the partition problem. | |||
TO cite this article:Zhang Xingyi,Wang Shuo,Niu Yunyun, et al. Tissue P systems with cell separation: attacking the partition problem[OL].[11 January 2011] http://en.paper.edu.cn/en_releasepaper/content/4405857 |
9. Missing Value Imputation in Gene Expression Data Using Histone Acetylation Information | |||
XIANG Qian | |||
Information Science and System Science 16 December 2010 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Accurate estimation of missing values in microarray data is important for the expression profile analysis. In this paper, missing value imputation is done with the aid of gene regulatory mechanism. It incorporates histone acetylation into the conventional k-nearest neighbor and local least square imputation algorithms for final prediction. The comparison results indicated that the proposed method consistently improves the widely used methods and outperforms GOimpute in terms of normalized root mean squared error(NRMSE), which is one of the existing related methods that use the functional similarity as the external information. The results demonstrated histone acetylation information may be more highly correlated with the gene expression than that of functional similarity. | |||
TO cite this article:XIANG Qian. Missing Value Imputation in Gene Expression Data Using Histone Acetylation Information[OL].[16 December 2010] http://en.paper.edu.cn/en_releasepaper/content/4398573 |
10. Quantitative Modeling Effects of Nucleosome on Transcription Factor-DNA Interactions | |||
XIANG Qian | |||
Information Science and System Science 16 December 2010 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Transcription factor-DNA interactions play a central role in transcriptional control. These bindings are stochastic processes and regulated by the nucleosomes in vivo. However, current models tend to neglect the nucleosomes and regard the binding as a set of binary cases. A computational model is presented here to address the issues. It integrates TF bindings to nucleosomal and naked DNA in a quantitative manner and results in continuous binding probabilities along the genome. The predictive ability of the model was applied to rationalize the binding data for the TFs considered, which made improvements over those models disregarding the nucleosomes. | |||
TO cite this article:XIANG Qian. Quantitative Modeling Effects of Nucleosome on Transcription Factor-DNA Interactions[OL].[16 December 2010] http://en.paper.edu.cn/en_releasepaper/content/4398561 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated