摘要：
In this paper, we propose a theoretical scheme of many-ghost imaging in terms of Nth-order correlated thermal light. We obtain the Gaussian thin lens equations in the many-ghost imaging protocol. We show that it is possible to produce N−1 ghost images of an object at different places in a nonlocal fashion by means of a higher order correlated imaging process with an Nth-order correlated thermal source and correlation measurements. We investigate the visibility of the ghost images in the scheme and obtain the upper bounds of the visibility for the Nth-order correlated thermal-light ghost imaging. It is found that the visibility of the ghost images can be dramatically enhanced when the order of correlation becomes larger. It is pointed out that the many-ghost imaging phenomenon is an observable physical effect induced by higher order coherence or higher order correlations of optical fields.
期刊：
Proceedings 2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010,2010年:157-162
通讯作者：
Zhong, S.(shaoh_zhong@yahoo.com.cn)
作者机构：
[Lili Pan; Shaohong Zhong] Computer and Information Engineering College, Central South University of Forestry and Technology, Changsha, Hunan, 410004, China;[Renfa Li] School of Computer and Communication, Hunan University, Changsha, Hunan, 410082, China;[Yachun Liu] School of Mathematics and Physical Science, Nanhua University, Hengyang, Hunan, 421001, China
会议名称：
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)
会议时间：
September 2010
会议地点：
Changsha, China
会议论文集名称：
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)
作者机构：
[Pan, LQ] Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430074, Peoples R China.;Univ Rovira & Virgili, Res Grp Math Linguist, E-43005 Tarragona, Spain.;Nanhua Univ, Dept Math & Phys Sci, Hengyang 421001, Peoples R China.
通讯机构：
[Pan, LQ] H;Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430074, Peoples R China.
关键词：
DNA computing;NP-complete problem;coloring problem
摘要：
DNA computing has the potential to tackle computationally difficult problems that have real-world implications. The parallel search capabilities of DNA make it a valuable tool for approaching intractable computational problems, for which conventional computers have limited potentials. Up to now, many accomplishments have been achieved to improve its performance and increase its reliability. In this paper, the coloring problem has been solved by means of molecular biology techniques. The coloring problem is a well-known NP-complete problem. This work represents further evidence for the ability of DNA computing to solve NP-complete problems.
作者机构：
[Pan, LQ] Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430074, Peoples R China.;Nanhua Univ, Inst Engn & Technol, Dept Math & Phys, Hengyang 421001, Peoples R China.
通讯机构：
[Pan, LQ] H;Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430074, Peoples R China.
关键词：
DNA computing;NP-complete problem;minimal vertex cover problem
摘要：
DNA computing was proposed for solving a class of intractable computational problems, of which the computing time will grow exponentially with the problem size. Up to now, many achievements have been made to improve its performance and increase its reliability. It has been shown many times that the surface-based DNA computing technique has very low error rate, but the technique has not been widely used in the DNA computing algorithms design. In this paper, a surface-based DNA computing algorithm for minimal vertex cover problem, a problem well-known for its exponential difficulty, is introduced. This work provides further evidence for the ability of surface-based DNA computing in solving NP-complete problems.
作者机构：
[Pan, LQ] Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430074, Peoples R China.;Nahua Univ, Inst Engn & Technol, Dept Math & Phys, Hengyang 421001, Peoples R China.
通讯机构：
[Pan, LQ] H;Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430074, Peoples R China.
关键词：
DNA computing;Maximal clique problem;NP-complete problem
摘要：
The maximal clique problem is an NP (nondeterministic polynomial time)-complete problem. We present an algorithm that solves maximal clique problem within the framework of a surface-based model of computation. The time complexity of our algorithm is O(n2), and the number of kinds of short oligonucleotides needed to encode maximal clique problem is n + 3, where n is the size of the graph. In our algorithm, immobilizing DNA (deoxyribonucleic acid) strands to a solid surface reduces the possibility of error resulting from the loss of DNA strands in solution. A solution-based algorithm solving maximal clique problem has previously been proposed by Qi Ouyang et al.. In their algorithm, the number of enzyme is equal to the number of vertices of the graph, which causes the difficulty of encoding and scaling up, because the DNA sequences of restriction enzyme sites should not be present in otherwhere. Using surface-based model, we designed an algorithm for maximal clique problem, which needs only one enzyme.
期刊：
Journal of Chemical Information and Modeling,2002年42(3):524-528 ISSN：1549-9596
通讯作者：
Liu, YC
作者机构：
[Liu, YC] Nanhua Univ Hengyang, Dept Math & Phys Sci, Hunan 421001, Peoples R China.;Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430074, Peoples R China.
通讯机构：
[Liu, YC] N;Nanhua Univ Hengyang, Dept Math & Phys Sci, Hunan 421001, Peoples R China.
摘要：
The graph-theoretic parameter that bas probably received the most attention over the years is the chromatic number. As is well-Known, the coloring problem is an NP-Complete problem. In this paper, it has been solved by means of molecular biology techniques. The algorithm is highly parallel and has satisfactory fidelity. This work shows further evidence for the ability of DNA computing to solve NP-Complete problems.
期刊：
Journal of Chemical Information and Modeling,2002年42(3):529-533 ISSN：1549-9596
通讯作者：
Liu, YC
作者机构：
[Liu, YC] Nanhua Univ, Inst Engn & Technol, Dept Math & Phys Sci, Hengyang 421001, Hunan, Peoples R China.;Xinjiang Univ, Inst Math & Phys, Urumqi 830046, Xinjiang, Peoples R China.;Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430074, Hubei, Peoples R China.
通讯机构：
[Liu, YC] N;Nanhua Univ, Inst Engn & Technol, Dept Math & Phys Sci, Hengyang 421001, Hunan, Peoples R China.
关键词：
Graphical representations;Graphic methods;Mathematical models;Nucleic acids;Vectors;DNA sequences;DNA;article;chemistry;DNA sequence;DNA;Sequence Analysis, DNA
摘要：
Some 2-D and 3-D graphical representations of DNA sequences have been given by Nandy, Leong and Mogenthaler, and Randic et al., which give visual characterizations of DNA sequences. In this paper, we presented a novel graphical representation of DNA sequences by taking four special vectors in 2-D Cartesian coordinate system to represent the four nucleic acid bases in DNA sequences, so that a DNA sequence is denoted on a plane by a directed walk. It is shown that the new graphical representation of DNA sequences has lower or nondegeneracy.
