检索结果-内蒙古大学图书馆

The general form of 0-1 programming problem based on DNA computing

BIOSYSTEMS 2003年第1期70卷 73-78页

作者： Yin, ZX Zhang, FY Xu, J Anhui Univ Sci & Technol Dept Math & Phys Anhui 232001 Peoples R China Huazhong Univ Sci & Technol Dept Control Sci & Engn Wuhan 430074 Peoples R China

DNA computing is a novel method of solving a class of intractable computational problems, in which the computing speeds up exponentially with the problem size. Up to now, many accomplishments have been made to improve its performance and increase its reliability. In this paper, we solved the general form of 0-1 programming problem with fluorescence labeling techniques based on surface chemistry by attempting to apply DNA computing to a programming problem. Our method has some significant advantages such as simple encoding, low cost, and short operating time. (C) 2003 Elsevier Science Ireland Ltd. All rights reserved.

关键词： DNA computing 0-1 programming problem feasible solution fluorescence labeling technique

来源：评论

学校读者我要写书评

暂无评论

Molecular Beacon Based DNA Computing Model for 0-1 programming problem

Molecular Beacon Based DNA Computing Model for 0-1 Programmi...

引用

4th International Conference on Bio-Inspired Computing

作者： Huang, Xiaohui Yin, Zhixiang Zhi, Lingying Hu, Juan Anhui Univ Sci & Technol Dept Math & Phys Huainan 232001 Anhui Peoples R China

ISBN: (纸本)9781424438655

Molecular beacons have the advantages of simple structure, high sensitivity and quick response etc.. DNA computing is a new method of simulating bio-molecular structure and computing using molecule biology technology, and creates a precedent in using bio-chemical reaction as the calculating tools. It is a novel way to solve a class of problems that are difficult to calculate NP-complete problem. In this paper the corresponding DNA computing of implicit enumeration is given using the advantages of molecular beacons based on previous studies.

关键词： Molecular Beacons DNA Computing Implicit Enumeration 0-1 programming problem

来源：评论

学校读者我要写书评

暂无评论

Molecular Beacon Based DNA Computing Model for 0-1 programming problem

Molecular Beacon Based DNA Computing Model for 0-1 Programmi...

引用

2009 Fourth International Conference on Bio-Inspired Computing:Theories and Applications(BIC-TA2009)

作者： Xiaohui Huang1,Zhixiang Yin,Lingying Zhi,Juan Hu Department of Mathematics and Physics,Anhui University of Science and Technology Huainan,Anhui(232001)China Department of Control Science and Engineering,Huazhong University of Science and Technology Wuhan,Hubei(430074)China

Molecular beacons have the advantages of simple structure,high sensitivity and quick response etc..DNA computing is a new method of simulating bio-molecular structure and computing using molecule biology technology,and creates a precedent in using bio-chemical reaction as the calculating *** is a novel way to solve a class of problems that are difficult to calculate NP-complete *** this paper the corresponding DNA computing of implicit enumeration is given using the advantages of molecular beacons based on previous studies.

关键词： Molecular Beacons DNA Computing Implicit Enumeration 0-1 programming problem

来源：评论

学校读者我要写书评

暂无评论

A surface-based DNA computing for the positive integer linear programming problem

引用

3rd International Conference on Intelligent Computing

作者： Yin, Zhi-xiang Cui, Jian-zhong Yang, Jin Anhui Univ Sci & Technol Dept Math & Phys Huainan 232001 Anhui Peoples R China Huazhong Univ Sci & Technol Dept Control Sci & Engn Wuhan 430074 Hubei Peoples R China

ISBN: (纸本)9783540741701

DNA computing is a novel method of solving a class of intractable computational problem, in which the computing speeds up exponentially with problem size. Up to now, many accomplishments have been made to improve its performance and increase its reliability. The positive integer linear programming is an NP-complete problem, in the paper, we solved the positive integer linear programming problem with fluorescence labeling techniques based on surface chemistry by attempted to apply DNA computing to programming problem. Our method has some significant advantages such as simple encoding, low cost, and short operating time.

关键词： DNA computing integer linear programming 0-1 programming problem NP-complete problem

来源：评论

学校读者我要写书评

暂无评论

Localisation algorithm with node selection under power constraint in software-defined sensor networks

引用

IET COMMUNICATIONS 2017年第13期11卷 2035-2041页

作者： Zhu, Yaping Xing, Song Zhang, Yueyue Yan, Feng Shen, Lianfeng Southeast Univ Natl Mobile Commun Res Lab Nanjing Jiangsu Peoples R China Calif State Univ Los Angeles Dept Informat Syst Los Angeles CA 90032 USA Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China

In this study, the authors propose an improved localisation algorithm in the software-defined sensor networks (SDSNs). This algorithm includes a node-selection strategy under the whole network power constraint, based on the software-defined networking (SDN) technique for providing the centralised control of the network. The analogous Cramer-Rao lower bound (A-CRLB) value is derived for each participating node, which represents a fundamental bound on the variance of the position estimator and is used to evaluate the contribution of each node to localisation accuracy. On the basis of A-CRLB values, the most helpful nodes for localisation are selected to maximise the sum of the nodes' contributory values to the localisation accuracy. With the global network knowledge provided by the SDN controller in the SDSN, the node-selection strategy is formulated into a 0-1 programming problem on the premise of power satisfaction of each node. Furthermore, the proposed node-selection -based localisation algorithm is applied to both noncooperative and cooperative localisation scenarios. Simulation results show that the proposed algorithms provide efficient and effective localisation schemes in SDSNs, and can improve the performance in terms of both the selection convergence speed and the localisation accuracy.

关键词： software defined networking control engineering computing wireless sensor networks sensor placement radio direction-finding improved localisation algorithm SDSN technique node-selection strategy whole network power constraint software-defined sensor networking technique A-CRLB analogous Cramer-Rao lower bound 0-1 programming problem cooperative localisation scenario

来源：评论

学校读者我要写书评

暂无评论

A DNA algorithm for solving 0-1 programming

A DNA algorithm for solving 0-1 programming

引用

7th International Conference on Machine Learning and Cybernetics

作者： Guo, Ping Liu, Li-Li Chongqing Univ Sch Comp Sci Chongqing 400044 Peoples R China

In this paper, DNA probes tagged with fluorescent label and a surface-based DNA algorithm are proposed to solve the 0-1 programming problem which inequalities' coefficients expand to arbitrary integers. The algori... 详细信息

ISBN: (纸本)9781424420957

关键词： DNA computation model surface model 0-1 programming problem bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Surface-Based Computing Model of Maximum Independent Set problem

引用

International Conference on Mechatronics and Materials Processing (ICMMP 2011)

作者： Yang, Yan Yin, Zhixiang Huazhong Univ Sci & Technol Dept Control Sci & Engn Wuhan 430074 Peoples R China Anhui Univ Sci & Technol Dept Math & Phys Huainan Peoples R China

ISBN: (纸本)9783037852385

About thirty years ago, the concept of the complexity of the problem was proposed. The most important complex class is P and NP class. Fruitful results of this concept are the existence of the so-called complex class complete problem. If the other issues of this class once solved in polynomial time, then the problem must exist polynomial time algorithms. Therefore, the complete problem is most difficult to solve, but because of their presence, we can choose any of them improved algorithm for a problem, so this kind of problem to get a good solution. DNA computing is a novel method that solving a class of intractable computational problems, in which the computing speeds up exponentially with the problem size. Up to now, many accomplishments have been made to improve its performance and increase its reliability. Maximum Independent Set problem (MIS) is a well-known NP-complete problem. Maximum Clique and Minimum Vertex Covering problem is equivalent to Maximum Independent Set problem. In this paper, we explore solving Maximum Independent Set problem by transforming it into equivalent 0-1 programming problem, and utilizing the surface computing model of that. The proposed method demonstrates universal nature of NP-complete problem.

关键词： DNA Computing 0-1 programming problem Maximum Independent Set Maximum Clique Minimum Vertex Covering

来源：评论

学校读者我要写书评

暂无评论

An application of genetic algorithm for multi-dimensional competitive facility location problem

An application of genetic algorithm for multi-dimensional co...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Uno, T Hanaoka, S Sakawa, M Hiroshima Univ Grad Sch Engn Higashihiroshima 7398527 Japan

ISBN: (纸本)0780392981

Competitive facility location problem has been studied in many literatures, which were dealt with problems considering location of some competitive facilities on at most two-dimensional space. In this study, we formulate competitive facility location problem in the situation that a new facility is located on a multi-dimensional space which has been already located several facilities. In order to find an optimal solution for the problem efficiently, first we show that one of optimal solutions is found by a combination problem, and then we use genetic algorithm with double structured strings to find approximate solution of the problem. In order to illustrate the efficiency of our proposing algorithm, results for numerical experiments are shown.

关键词： facility location competitiveness multidimensional location 0-1 programming problem genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A DNA ALGORITHM FOR SOLVING 0-1 programming

A DNA ALGORITHM FOR SOLVING 0-1 PROGRAMMING

引用

2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)

作者： PING GUO LI-LI LIU School of Computer Science Chongqing University 400044 Chongqing China

关键词： DNA computation model surface model 0-1 programming problem Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：