期刊：
Proceedings of 4th International Workshop on Advanced Computational Intelligence, IWACI 2011,2011年:54-58
通讯作者：
Zhou, K.(zhoukang_wh@yahoo.com.cn)
作者机构：
[Zhou, Kang; Tong, Xiaojun] School of Math and Computer, Wuhan Polytechnic University, Wuhan 430023, China;[Cheng, Zhen] College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310023, China;[Ying, Liu] School of Information Technology and Management Egineering, University of International Business and Economics, Beijing 100029, China
作者机构：
[Kang, Zhou] Wuhan Polytech Univ, Dept Math & Phys, Wuhan 430023, Peoples R China.;[Yufang, Huang; Zhen, Cheng; Jin, Xu] Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430074, Peoples R China.
会议名称：
4th International Conference on Bio-Inspired Computing
会议时间：
OCT 16-19, 2009
会议地点：
Peking Univ, Beijing, PEOPLES R CHINA
摘要：
Composition and biochemistry experiments of sticker model and the realization process of fundamental biochemical experiments are discussed. Based on separation technology and electrophoresis experiment, a new detection experiment is put forward, which can be used to detect experimental results containing various kinds of memory complex. DNA algorithm of making all spanning tree problem and its biochemical realization process are put forward, first the initial solution space of spanning subgraph is created, then all spanning trees are selected from the initial solution space. During the creating solution space of spanning subgraph, complete hybridization based on incomplete separation is First put forward, which can separate equably one tube into several tubes according to the requirement of algorithm design. The correctness and complexity of the DNA algorithm are discussed and proved. Finally, the validity and feasibility of the DNA algorithm are explained by a simulate experiment. Two kinds of biotechnology are first put forward, which are detection experiment based on separation technology and complete hybridization based on incomplete separation, and DNA algorithm of making all spanning tree problem is also first put forward.
作者机构：
[Zhou Kang; Tong Xiaojun] Wuhan Polytech Univ, Dept Math & Phys, Wuhan 430023, Peoples R China.;[Zhou Kang; Tong Xiaojun; Xu Jin] Huazhong Univ Sci & Technol, Dept Control Sci & Engineer, Wuhan 430074, Peoples R China.
通讯机构：
[Zhou Kang] W;Wuhan Polytech Univ, Dept Math & Phys, Wuhan 430023, Peoples R China.
关键词：
closed circle DNA computing model;change positive-weighted Hamilton circuit problem;group insert experiment;group delete experiment
摘要：
Chain length of closed circle DNA is equal. The same closed circle DNA's position corresponds to different recognition sequence, and the same recognition sequence corresponds to different foreign DNA segment, so closed circle DNA computing model is generalized. For change positive-weighted Hamilton circuit problem, closed circle DNA algorithm is put forward. First, three groups of DNA encoding are encoded for all arcs, and deck groups are designed for all vertices. All possible solutions are composed. Then, the feasible solutions are filtered out by using group detect experiment, and the optimization solutions are obtained by using group insert experiment and electrophoresis experiment. Finally, all optimization solutions are found by using detect experiment. Complexity of algorithm is concluded and validity of DNA algorithm is explained by an example. Three dominances of the closed circle DNA algorithm are analyzed, and characteristics and dominances of group delete experiment are discussed.
通讯机构：
[Tong, Xiao-Jun] W;[Tong, Xiao-Jun] H;Wuhan Polytech Univ, Dept Math & Phys, Wuhan 430074, Peoples R China.;Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430074, Peoples R China.
会议名称：
2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)
会议时间：
2007-08-19
会议地点：
香港
会议论文集名称：
第六届机器学习与控制论国际会议
关键词：
the structure of pan-operation;semi-group;commutative isotonic semi-ring
摘要：
Based on semi-group theory, special properties of identity element and the idempotent of pan-multiplication, the case of idempotent pan-additions are studied. Our results show the "open problem" posted by Mesiar and Rybarik in 1995 has been settled.
期刊：
Proceedings of 2006 International Conference on Machine Learning and Cybernetics, Vols 1-7,2006年:1875-1878
通讯作者：
Tong, Xiao-Jun
作者机构：
[Kang, Zhou; Tong, Xiao-Jun; Huang, Qiu-Ming] Wuhan Polytech Univ, Dept Math & Phys, Wuhan 430074, Peoples R China.
通讯机构：
[Tong, Xiao-Jun] W;Wuhan Polytech Univ, Dept Math & Phys, Wuhan 430074, Peoples R China.
会议名称：
2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)
会议时间：
2006-08-13
会议地点：
大连
会议论文集名称：
IEEE第五届机器学习与控制论国际会议
关键词：
fuzzy set;sigma-entropy;the structure of entropy of fuzzy set
摘要：
Based on special additivity of sigma-entropy and proposition of monotone function, we study the structure of a-entropy of fuzzy set. At first, we describe the structure of a-entropy. Then, with this structure in place, we derive primary propositions of sigma-entropy, and a conclusion of the entropy under l(p)-distance, that is, this entropy of fuzzy set has sigma-additivity only if p equals 1.
