In order to improve the performance of estimating the fundamental matrix, a key problem arising in stereo vision, a novel method based on stripe constraints is presented. In contrast to traditional methods based on al...In order to improve the performance of estimating the fundamental matrix, a key problem arising in stereo vision, a novel method based on stripe constraints is presented. In contrast to traditional methods based on algebraic least-square algorithms, the proposed approach aims to minimize a cost function that is derived from the minimum radius of the Hough transform. In a structured-light system with a particular stripe code pattern, there are linear constraints that the points with the same code are on the same surface. Using the Hough transform, the pixels with the same code map to the Hough space, and the radius of the intersections can be defined as the evaluation function in the optimization progress. The global optimum solution of the fundamental matrix can be estimated using a Levenberg- Marquardt optimization iterative process based on the Hough transform radius. Results illustrate the validity of this algorithm, and prove that this method can obtain good performance with high efficiency.展开更多
Group distance coding is suitable for secret communication covered by printed documents. However there is no effective method against it. The study found that the hiding method will make group distances of text lines ...Group distance coding is suitable for secret communication covered by printed documents. However there is no effective method against it. The study found that the hiding method will make group distances of text lines coverage on specified values, and make variances of group distances among N-Window text lines become small. Inspired by the discovery, the research brings out a Support Vector Machine （SVM） based steganalysis algorithm. To avoid the disturbance of large difference among words length from same line, the research only reserves samples whose occurrence-frequencies are ± 10dB of the maximum frequency. The results show that the correct rate of the SVM classifier is higher than 90%.展开更多
We consider an iterative phase synchronization scheme based on maximum a posteriori probability algorithm.In classical approaches,the phase noise estimation model considers one sample per symbol at the channel and rec...We consider an iterative phase synchronization scheme based on maximum a posteriori probability algorithm.In classical approaches,the phase noise estimation model considers one sample per symbol at the channel and receiver.However,information theoretic studies suggested use of more than one sample per symbol at the channel and receiver for achieving higher performance.In this article,a soft-information aided iterative receiver is derived,which uses off-the-shelf blocks for detection and demodulation by keeping the complexity of the receiver acceptable.We consider here two samples per symbols at the channel and receiver in a pragmatic paradigm.It is shown that phase noise estimation can be significantly improved at the expense of modest processing overhead.Simulation results are presented for low-density parity check coded quadrature amplitude modulations.Our results show a significant performance improvement for strong phase noise values compared to classical receiver approaches.展开更多
The famous F5 algorithm for computing Grobner basis was presented by Faugere in 2002. The original version of F5 is given in programming codes, so it is a bit difficult to understand. In this paper, the F5 algorithm i...The famous F5 algorithm for computing Grobner basis was presented by Faugere in 2002. The original version of F5 is given in programming codes, so it is a bit difficult to understand. In this paper, the F5 algorithm is simplified as F5B in a Buchberger＇s style such that it is easy to understand and implement. In order to describe F5B, we introduce F5-reduction, which keeps the signature of labeled polynomials unchanged after reduction. The equivalence between F5 and F5B is also shown. At last, some versions of the F5 algorithm are illustrated.展开更多
SubceUular localization is pivotal for RNAs and proteins to implement biological functions. The localization diversity of protein interactions has been studied as a crucial feature of proteins, considering that the pr...SubceUular localization is pivotal for RNAs and proteins to implement biological functions. The localization diversity of protein interactions has been studied as a crucial feature of proteins, considering that the protein-protein interactions take place in vari- ous subceltutar locations. Nevertheless, the localization diversity of non-coding RNA （ncRNA） target proteins has not been sys- tematically studied, especially its characteristics in cancers. In this study, we provide a new algorithm, non-coding RNA target localization coefficient （ncTALENT）, to quantify the target localization diversity of ncRNAs based on the ncRNA-protein interaction and protein subcellular localization data. ncTALENT can be used to calculate the target localization coefficient of ncRNAs and measure how diversely their targets are distributed among the subcellular locations in various scenarios. We focus our study on long non-coding RNAs （IncRNAs）, and our observations reveal that the target localization diversity is a primary characteristic of IncRNAs in different biotypes. Moreover, we found that IncRNAs in multiple cancers, differentially expressed cancer IncRNAs, and IncRNAs with multiple cancer target proteins are prone to have high target localization diversity. Furthermore, the analysis of gastric cancer helps us to obtain a better understanding that the target localization diversity of IncRNAs is an important feature closely related to clinical prognosis. Overall, we systematically studied the target localization diversity of the IncRNAs and uncovered its association with cancer.展开更多
The complete sequence of the mitochondrial genome of the Japanese snapping shrimp Alpheus japonicus Miers （Crustacea： Decapoda： Caridea） is presented here. A comparative analysis based on the currently available m...The complete sequence of the mitochondrial genome of the Japanese snapping shrimp Alpheus japonicus Miers （Crustacea： Decapoda： Caridea） is presented here. A comparative analysis based on the currently available mitochondrial genomic data re- vealed many previously unknown characteristics of the mitochondrial genomes of caridean shrimps. The A. japonicus mito- chondrial genome is 16487 bp long and contains the typical set of 37 metazoan genes. The gene arrangements in the mito- chondrial genomes of four previously studied carideans （Macrobrachium rosenbergii, M. nipponense, M. lanchesteri and Halocaridina rubra） were found to be identical to the pancrustacean ground pattern; thus, it was considered that gene rear- rangements probably did not occur in the suborder Caridea. In the present study, a translocation of the trnE gene involving in- version was found in Alpheus mitochondrial genomes. This phenomenon has not been reported in any other crustacean mito- chondrial genome that has been studied so far; however, the translocation of one transfer RNA gene （trnP or trnT） was report- ed in the mitochondrial genome of Exopalaemon carinicauda. When the ratios of the nonsynonymous and synonymous sub- stitutions rates （Ka/Ks） for the 13 protein coding genes from two Alpheus species （A. japonicus and A. distinguendus） and three Macrobrachium species （M. rosenbergii, M. nipponense, M. lanchesteri） were calculated, the KaIKs values for all the protein coding genes in Alpheus and Macrobrachium mitochondrial genomes were found to be less than 1 （between 0.0048 and 0.2057）, indicating that a strong purification selection had occurred. The phylogenetic tree that was constructed based on the mitochondrial protein coding genes in the genomes of nine related species indicated that Palaemonidae and Alpheidae formed a monophyly and shared a statistically significant relationship, （Palaemonidae＋Alpheidae）＋Atyidae, at the family level.展开更多
文摘In order to improve the performance of estimating the fundamental matrix, a key problem arising in stereo vision, a novel method based on stripe constraints is presented. In contrast to traditional methods based on algebraic least-square algorithms, the proposed approach aims to minimize a cost function that is derived from the minimum radius of the Hough transform. In a structured-light system with a particular stripe code pattern, there are linear constraints that the points with the same code are on the same surface. Using the Hough transform, the pixels with the same code map to the Hough space, and the radius of the intersections can be defined as the evaluation function in the optimization progress. The global optimum solution of the fundamental matrix can be estimated using a Levenberg- Marquardt optimization iterative process based on the Hough transform radius. Results illustrate the validity of this algorithm, and prove that this method can obtain good performance with high efficiency.
基金the National Natural Science Foundation of China under Grant No.61170269,No.61170272,No.61202082,No.61003285,and the Fundamental Research Funds for the Central Universities under Grant No.BUPT2013RC0308,No.BUPT2013RC0311
文摘Group distance coding is suitable for secret communication covered by printed documents. However there is no effective method against it. The study found that the hiding method will make group distances of text lines coverage on specified values, and make variances of group distances among N-Window text lines become small. Inspired by the discovery, the research brings out a Support Vector Machine （SVM） based steganalysis algorithm. To avoid the disturbance of large difference among words length from same line, the research only reserves samples whose occurrence-frequencies are ± 10dB of the maximum frequency. The results show that the correct rate of the SVM classifier is higher than 90%.
文摘We consider an iterative phase synchronization scheme based on maximum a posteriori probability algorithm.In classical approaches,the phase noise estimation model considers one sample per symbol at the channel and receiver.However,information theoretic studies suggested use of more than one sample per symbol at the channel and receiver for achieving higher performance.In this article,a soft-information aided iterative receiver is derived,which uses off-the-shelf blocks for detection and demodulation by keeping the complexity of the receiver acceptable.We consider here two samples per symbols at the channel and receiver in a pragmatic paradigm.It is shown that phase noise estimation can be significantly improved at the expense of modest processing overhead.Simulation results are presented for low-density parity check coded quadrature amplitude modulations.Our results show a significant performance improvement for strong phase noise values compared to classical receiver approaches.
文摘The famous F5 algorithm for computing Grobner basis was presented by Faugere in 2002. The original version of F5 is given in programming codes, so it is a bit difficult to understand. In this paper, the F5 algorithm is simplified as F5B in a Buchberger＇s style such that it is easy to understand and implement. In order to describe F5B, we introduce F5-reduction, which keeps the signature of labeled polynomials unchanged after reduction. The equivalence between F5 and F5B is also shown. At last, some versions of the F5 algorithm are illustrated.
文摘SubceUular localization is pivotal for RNAs and proteins to implement biological functions. The localization diversity of protein interactions has been studied as a crucial feature of proteins, considering that the protein-protein interactions take place in vari- ous subceltutar locations. Nevertheless, the localization diversity of non-coding RNA （ncRNA） target proteins has not been sys- tematically studied, especially its characteristics in cancers. In this study, we provide a new algorithm, non-coding RNA target localization coefficient （ncTALENT）, to quantify the target localization diversity of ncRNAs based on the ncRNA-protein interaction and protein subcellular localization data. ncTALENT can be used to calculate the target localization coefficient of ncRNAs and measure how diversely their targets are distributed among the subcellular locations in various scenarios. We focus our study on long non-coding RNAs （IncRNAs）, and our observations reveal that the target localization diversity is a primary characteristic of IncRNAs in different biotypes. Moreover, we found that IncRNAs in multiple cancers, differentially expressed cancer IncRNAs, and IncRNAs with multiple cancer target proteins are prone to have high target localization diversity. Furthermore, the analysis of gastric cancer helps us to obtain a better understanding that the target localization diversity of IncRNAs is an important feature closely related to clinical prognosis. Overall, we systematically studied the target localization diversity of the IncRNAs and uncovered its association with cancer.
基金supported by the National Natural Science Foundation of China (Grant Nos. 40906067 and 31172054)Special Funds From the Central Finance to Support the Development of Local Universities(Grant No. CXTD04)+1 种基金the China Postdoctoral Science Foundation Funded Project (Grant No. 2012M510054)the Jiangsu Key Laboratory of Marine Biotechnology (Grant Nos. 2009HS12 and 2009HS13)
文摘The complete sequence of the mitochondrial genome of the Japanese snapping shrimp Alpheus japonicus Miers （Crustacea： Decapoda： Caridea） is presented here. A comparative analysis based on the currently available mitochondrial genomic data re- vealed many previously unknown characteristics of the mitochondrial genomes of caridean shrimps. The A. japonicus mito- chondrial genome is 16487 bp long and contains the typical set of 37 metazoan genes. The gene arrangements in the mito- chondrial genomes of four previously studied carideans （Macrobrachium rosenbergii, M. nipponense, M. lanchesteri and Halocaridina rubra） were found to be identical to the pancrustacean ground pattern; thus, it was considered that gene rear- rangements probably did not occur in the suborder Caridea. In the present study, a translocation of the trnE gene involving in- version was found in Alpheus mitochondrial genomes. This phenomenon has not been reported in any other crustacean mito- chondrial genome that has been studied so far; however, the translocation of one transfer RNA gene （trnP or trnT） was report- ed in the mitochondrial genome of Exopalaemon carinicauda. When the ratios of the nonsynonymous and synonymous sub- stitutions rates （Ka/Ks） for the 13 protein coding genes from two Alpheus species （A. japonicus and A. distinguendus） and three Macrobrachium species （M. rosenbergii, M. nipponense, M. lanchesteri） were calculated, the KaIKs values for all the protein coding genes in Alpheus and Macrobrachium mitochondrial genomes were found to be less than 1 （between 0.0048 and 0.2057）, indicating that a strong purification selection had occurred. The phylogenetic tree that was constructed based on the mitochondrial protein coding genes in the genomes of nine related species indicated that Palaemonidae and Alpheidae formed a monophyly and shared a statistically significant relationship, （Palaemonidae＋Alpheidae）＋Atyidae, at the family level.
