摘要：
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)
作者机构：
[Pan, Lili; Zhong, Shaohong] Computer and Information Engineering College, Central South University of Forestry and Technology, Changsha, Hunan, 410004, China;[Li, Renfa] School of Computer and Communication, Hunan University, Changsha, Hunan, 410082, China;[Liu, Yachun] School of Mathematics and Physical Science, Nanhua University, Hengyang, Hunan, 421001, China
作者机构：
[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.
