An algorithm simulated sticker model for mis
作者:
Wu, Deyuan;Zhou, Kang* ;Hu, Di;Ge, Shuangqi
期刊:
Communications in Computer and Information Science ,2015年562:571-582 ISSN:1865-0929
通讯作者:
Zhou, Kang
作者机构:
[Zhou, Kang; Ge, Shuangqi; Wu, Deyuan; Hu, Di] Wuhan Polytech Univ, Sch Math & Comp, Wuhan 430023, Peoples R China.
通讯机构:
[Zhou, Kang] W;Wuhan Polytech Univ, Sch Math & Comp, Wuhan 430023, Peoples R China.
会议名称:
10th International Conference on Bio-Inspired Computing - Theories and Applications (BIC-TA)
会议时间:
SEP 25-28, 2015
会议地点:
Hefei, PEOPLES R CHINA
会议主办单位:
[Wu, Deyuan;Zhou, Kang;Hu, Di;Ge, Shuangqi] Wuhan Polytech Univ, Sch Math & Comp, Wuhan 430023, Peoples R China.
会议论文集名称:
Communications in Computer and Information Science
关键词:
DNA computing;Maximum independent set problem;Order of detecting vertex problem;Sticker model;Tube matrix
摘要:
Through analysis of properties of sticker model and maximum independent set, an algorithm simulated sticker model for maximum independent set problem (MIS) is designed, and order of detecting vertex problem is put forward. Algorithm for order of detecting vertex problem is given to simplify tube matrix. In algorithm simulated sticker model for MIS, first initial tube matrix is set;then tube matrix of all independent set is constructed;finally all maximum independent sets are figured out. The effectiveness and feasibility of algorithm simulated sticker model are explained by a simulated experiment.<br/> ©Springer-Verlag Berlin Heidelberg 2015.
语种:
英文
展开
Simulation DNA algorithm of set covering problem
作者:
Zhou, Kang* ;Chen, Jin
期刊:
Applied Mathematics & Information Sciences ,2014年8(1):139-144 ISSN:2325-0399
通讯作者:
Zhou, Kang
作者机构:
[Zhou, Kang; Chen, Jin] Wuhan Polytech Univ, Sch Math & Comp, Wuhan 430023, Peoples R China.
通讯机构:
[Zhou, Kang] W;Wuhan Polytech Univ, Sch Math & Comp, Wuhan 430023, Peoples R China.
关键词:
Batch separation operator;Electrophoresis operator;Less-than relation;Minimal element;SCP;SDA;Sticker model
摘要:
Sticker model is imitated by using set, variable length vector and biochemistry operator instead of tube, memory strand and biochemistry experiment for the first time. Batch separation operator and electrophoresis operator are first put forward based on DNA algorithm of Set Covering Problem (SCP) based on sticker model. Expression way, calculation method and basic properties of variable length vector and the two biochemistry operators are analyzed in detail according to the characteristics of sticker model. Simulation DNA algorithm (SDA) of SCP, which can find out all optimization set coverings, is designed, where all feasible set coverings are extracted by using batch separation operator and all optimization set coverings are extracted by using electrophoresis operator. Minimal element and deriving element are first introduced. And minimal element contains a large amount of deriving elements, so the set of batch separation operator can be simplified. Less-than relation is established to simplify the set of electrophoresis operator. Therefore the use of 'minimal element' and 'less-than' makes SDA of SCP more effective and practical. Time complexity of SDA of SCP is proved, and it shows that SDA of SCP is an effective algorithm to solve SCP. © 2014 NSP Natural Sciences Publishing Cor.
语种:
英文
展开
Simulation DNA algorithm
作者:
Dai, Peng;Zhou, Kang* ;Wei, Zhiwei;Hu, Di;Liu, Chun
期刊:
Communications in Computer and Information Science ,2014年472:83-87 ISSN:1865-0929
通讯作者:
Zhou, Kang
作者机构:
[Zhou, Kang; Wei, Zhiwei; Hu, Di; Dai, Peng; Liu, Chun] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
通讯机构:
[Zhou, Kang] W;Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
会议名称:
9th International Conference on Bio-Inspired Computing - Theories and Applications (BIC-TA)
会议时间:
OCT 16-19, 2014
会议地点:
Wuhan, PEOPLES R CHINA
会议主办单位:
[Dai, Peng;Zhou, Kang;Wei, Zhiwei;Hu, Di;Liu, Chun] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
会议论文集名称:
Communications in Computer and Information Science
摘要:
Satisfiability problem (SAT) is one of classical combinational problems, which is proved to be a famous NP-complete problem [1]. SAT is widely used [2], [3]. At present, research on algorithm of SAT has made significant progress [4], [5]. Among these algorithms, some are non polynomial even though they can obtain exact solution of SAT; and heuristic algorithm cannot obtain exact solution of SAT, even though it is polynomial. Therefore, it is essential to find an exact algorithm of SAT which is more practical and can effectively the control calculation time.
语种:
英文
展开
基于最长公共子序列的随机路径选择算法设计
作者:
王防修;周康
期刊:
计算机工程与设计 ,2014年35(6):2170-2173 ISSN:1000-7024
作者机构:
[王防修; 周康] 武汉轻工大学数学与计算机学院
关键词:
最长公共子序列;最优子结构;动态规划;随机路径选择;最优解
摘要:
针对传统算法只能求出一个最长公共子序列而无法求出多个最长公共子序列,设计了一种可求多个最长公共子序列的算法。简述了最长公共子序列的算法原理,描述了求最长公共子序列长度的动态规划算法,在此基础上求出一个最长公共子序列,通过对算法改进得到可求多个最长公共子序列的随机路径选择算法。该算法具有计算速度快、占用内存小、计算机易于实现等优点。其核心是寻优路径的选择,提出了寻找最优解的路径选择问题,讨论并给出了搜索多个可行解的快速算法,该算法充分利用了动态规划算法计算过程中提供的寻优方向信息得到最优路径的随机选择算法,与传统算法相比可求多个最长公共子序列。
语种:
中文
展开
ABC Algorithm for VRP
作者:
Shao, Kai;Zhou, Kang* ;Qiu, Jiang;Zhao, Juan
期刊:
Communications in Computer and Information Science ,2014年474:370-373 ISSN:1865-0929
通讯作者:
Zhou, Kang
作者机构:
[Shao, Kai; Zhou, Kang; Qiu, Jiang; Zhao, Juan] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
通讯机构:
[Zhou, Kang] W;Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
会议名称:
9th International Conference on Bio-Inspired Computing - Theories and Applications (BIC-TA)
会议时间:
OCT 16-19, 2014
会议地点:
Wuhan, PEOPLES R CHINA
会议主办单位:
[Shao, Kai;Zhou, Kang;Qiu, Jiang;Zhao, Juan] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
会议论文集名称:
Communications in Computer and Information Science
关键词:
Colony diversity;Improved ABC;Search efficiency;VRP
摘要:
Vehicle routing problem(VRP) has the same mathematical model with many combinatorial optimization problems, they are typical NP-hard problems in combinatorial optimization problem. In this paper, artificial bee colony (ABC) algorithm is applied to solve VRP. We propose a method to keep the colony diversity and improve the search efficiency of ABC. To validate the performance of ABC algorithm, we calculate the instance from standard VRP database. The results show that improved ABC can be used for VRP efficiently.<br/> ©Springer-Verlag Berlin Heidelberg 2014.
语种:
英文
展开
Public traffic network simulation system
作者:
Rong, Wen Jin;Zhou, Kang* ;Dai, Peng;Li, Song Ping;Tan, Wei
期刊:
Communications in Computer and Information Science ,2014年472:336-340 ISSN:1865-0929
通讯作者:
Zhou, Kang
作者机构:
[Zhou, Kang; Dai, Peng; Tan, Wei; Li, Song Ping; Rong, Wen Jin] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
通讯机构:
[Zhou, Kang] W;Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
会议名称:
9th International Conference on Bio-Inspired Computing - Theories and Applications (BIC-TA)
会议时间:
OCT 16-19, 2014
会议地点:
Wuhan, PEOPLES R CHINA
会议主办单位:
[Rong, Wen Jin;Zhou, Kang;Dai, Peng;Li, Song Ping;Tan, Wei] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
会议论文集名称:
Communications in Computer and Information Science
语种:
英文
展开
Shortest path problem with k-intermediate vertex constraints
作者:
Liu, Chun;Zhou, Kang*
期刊:
Communications in Computer and Information Science ,2014年472:664-668 ISSN:1865-0929
通讯作者:
Zhou, Kang
作者机构:
[Zhou, Kang; Liu, Chun] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
通讯机构:
[Zhou, Kang] W;Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
会议名称:
9th International Conference on Bio-Inspired Computing - Theories and Applications (BIC-TA)
会议时间:
OCT 16-19, 2014
会议地点:
Wuhan, PEOPLES R CHINA
会议主办单位:
[Liu, Chun;Zhou, Kang] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
会议论文集名称:
Communications in Computer and Information Science
摘要:
In urban transit network inquiry system, the optimal scheme of bus line having excessive transfers requires us to consider limiting the number of transfers when to compute the optimal scheme of bus line [1], which can come down to shortest path problem limiting the number of intermediate vertex. And support system of QoS (Quality-of-Service) is playing a more and more important role in communication network. QoS routing problem [2] is to choose transmission path meeting the requirements of QoS service to hop counts, bandwidth, latency, packet loss rate etc. and ensuring effective use of global network resources, which can come down to multi-constrained shortest path problem limiting the number of intermediate vertex. Shortest path problem limiting the number of intermediate vertex is shortest path problem with k-intermediate vertex constraints.
语种:
英文
展开
基于回溯法的Dijkstra 算法改进及仿真
作者:
王防修;周康
期刊:
计算机仿真 ,2013年30(11):352-355 ISSN:1006-9348
作者机构:
[王防修; 周康] 武汉工业学院数学与计算机学院
关键词:
最短路径;狄杰斯特拉算法;标识矩阵;回溯法;所有最短路径
摘要:
针对求有权图中任意两个顶点间的所有最短路径问题,提出了Dijkstra 算法的改进。改进算法以加权图的邻接矩阵为基础,首先求出从一个顶点到其它各顶点的最短路径长度向量,然后由邻接矩阵和最短路径长度向量构造标识矩阵,最后用回溯法搜索标识矩阵得到从始点到其它各顶点的所有最短路径。改进算法具有使用范围广、计算规模小、计算过程简化、计算机易于实现等优点。改进算法的核心是用回溯法求解所有最短路径的运算,提出了从终点到始点的回溯求解问题,并且给出了求解任意两个顶点间的所有最短路径的快速算法。改进算法充分利用了标识矩阵所提供的路径信息经过回溯搜索得到两个顶点间的所有最短路径。仿真结果表明,改进算法对于求图中任意两个顶点间的所有最短路径行之有效。
语种:
中文
展开
出栈序列生成的算法研究与设计
作者:
王防修;周康
期刊:
武汉轻工大学学报 ,2013年(1):68-71 ISSN:2095-7386
作者机构:
武汉工业学院数学与计算机学院,湖北武汉430023
关键词:
栈;出栈序列;栈操作序列;二进制字符串;算法
摘要:
介绍了栈在解决实际问题中的作用和重要性.通过提出栈序列的生成问题,说明问题的复杂性.在充分分析出栈序列的形成规律的情况下,给出了出栈序列的生成算法.由于该算法所允许入栈的元素个数有限,又对该算法进行了改进,使得改进后的算法对任意长的入栈元素都适用.测试结果表明,该算法对出栈序列的生成具有有效性.
语种:
中文
展开
通信流熵变量DDoS攻击IP回溯跟踪模型
作者:
桂兵祥;周康;周万雷
期刊:
小型微型计算机系统 ,2013年34(7):1607-1609 ISSN:1000-1220
作者机构:
[桂兵祥; 周康; 周万雷] 武汉工业学院数学与计算机学院;迪肯大学信息技术学院
关键词:
DDoS攻击;通信流;熵变量;系统建模;回溯跟踪算法
摘要:
DDoS攻击一直严重威胁着网络的安全.描述一个新的DDoS攻击源回溯跟踪机制,其与普通的包标记技术有着根本的区别,它是一种通过监控正常通信流和DDoS攻击通信流之间的信息熵值变化来判断网络是否有攻击行为.与现有的DDoS攻击回溯跟踪技术比较,该机制有很多优势:扩展性高、健壮性好、无包污染和攻击流量模式独立.在描述和分析DDoS攻击通信流熵变量特性基础上对上述跟踪机制建模,然后给出了相应的DDoS攻击检测和IP跟踪回溯算法.模拟实验研究结果表明了该机制是高效的.
语种:
中文
展开
基于二叉排序树的二叉树建立
作者:
王防修;周康
期刊:
武汉轻工大学学报 ,2013年32(3):53-57 ISSN:2095-7386
作者机构:
武汉轻工大学数学与计算机学院,湖北武汉,430023;[周康; 王防修] 武汉轻工大学
关键词:
二叉排序树;二叉树;遍历;同构;算法
摘要:
针对目前建立二叉树存在算法复杂、执行速度慢的问题,提出一种新的二叉树生成算法.主要采用二叉排序树的思想,并结合二叉树遍历的特点,通过先对中序遍历依次编号,然后按先序遍历或后序遍历的元素及编号建立二叉排序树.实验表明,该方法具有执行速度快、程序实现简单、通用性好的特点.
语种:
中文
展开
一种构建严格平衡二叉搜索树的非递归算法
作者:
王防修;周康
期刊:
武汉轻工大学学报 ,2013年(4):32-34,43 ISSN:2095-7386
作者机构:
武汉轻工大学数学与计算机学院,湖北武汉,430023;[周康; 王防修] 武汉轻工大学
关键词:
二叉搜索树;平衡二叉树;严格平衡二叉树;平衡二叉搜索树;严格平衡二叉搜索树
摘要:
针对传统算法所构造的平衡二叉搜索树并非真正平衡的二叉搜索树,设计了一种构建严格平衡二叉搜索树的非递归算法。改进后的算法具有计算速度快、占用内存小、计算机易于实现等优点。改进算法的核心是生成严格二叉搜索树的先序序列,提出了对升序序列的进行二分得到严格二叉搜索树的先序序列,讨论并给出了构建严格二叉搜索树的快速算法,该算法充分利用了栈在计算过程中提供的二分信息得到严格二叉搜索树的先序序列,该算法与传统算法相比可更快地构建严格二叉搜索树。
语种:
中文
展开
Replaceable encoding for basic variable of traffic network transportation optimization problem
作者:
Zhou, Kang;Zhu, Yule;Jin, Feng;Tao, Xin
期刊:
Advances in Intelligent Systems and Computing ,2013年212:45-53 ISSN:2194-5357
通讯作者:
Zhou, K.(zhoukang_wh@yahoo.com.cn1)
作者机构:
[Tao, Xin; Zhou, Kang; Zhu, Yule; Jin, Feng] School of Math and Computer, Wuhan Polytechnic University, 430023 Wuhan, China
通讯机构:
[Zhou, K.] S;School of Math and Computer, , 430023 Wuhan, China
关键词:
DNA computing;Group deleting experiment;Group insert experiment;TNTOP
摘要:
A linear programming problem is solved for the first time based on DNA computing model, which has important significance for research on DNA computing. According to feature of the mathematical model of traffic network transportation optimization problem (TNTOP), three groups of replaceable encoding for each basic variable are designed in the algorithm as follows: basic variable group;variable value group and c value group, which stores the information of basic variable and its value and has many groups replaceable foreign DNA corresponding to the basic variable. In the algorithm of TNTOP based on replaceable encoding for basic variable, combination operation which is used can assign or re-assign values to variables, which is composed of group insert experiment, gel electrophoresis experiment and group deleting experiment. The combination operation can test the constraint conditions and extract all optimal solutions of TNTOP. Detection experiment designed based on electrophoresis experiment can detect mixture containing many kinds of closed circle DNA sequence, and can detect out all closed circle DNA sequences or one closed circle DNA sequence of the mixture according to requirement of the algorithm. The correctness and the complexity of the DNA algorithm are proved, and a simulation example is given to explain feasibility of the DNA algorithm. ©Springer-Verlag Berlin Heidelberg 2013.<br/>
语种:
英文
展开
一种不用构造二叉树的哈夫曼编码
作者:
王防修;周康;同小军
期刊:
武汉轻工大学学报 ,2012年31(2):52-54 ISSN:2095-7386
作者机构:
武汉工业学院数学与计算机学院,湖北武汉,430023;[同小军; 周康; 王防修] 武汉工业学院
关键词:
二叉树;哈夫曼树;哈夫曼编码;算法
摘要:
针对传统哈夫曼编码算法都需要建立哈夫曼树的缺点,提出了一种不用建立哈夫曼树也可以进行哈夫曼编码的算法。该算法抛开具体的树结构,只需用一维数组模拟二叉树的创建过程求得每个符号的编码长度,然后根据编码长度为每个符号分配编码。算法分析表明,该算法需要的内存空间比传统哈夫曼编码算法要少很多。同时,算法的时间复杂度为O(n)。
语种:
中文
展开
一类交通流问题及其激波解
作者:
范丽丽;周康
期刊:
武汉轻工大学学报 ,2012年31(3):48-50 ISSN:2095-7386
作者机构:
武汉工业学院数学与计算机学院,湖北武汉,430023;[范丽丽; 周康] 武汉工业学院
关键词:
守恒律;弱解;激波;激波曲线
摘要:
讨论在1维空间R+×R上一类交通流模型的性质及其激波解存在的条件,并给出了它的一般解法和近似解法.
语种:
中文
展开
基于J2EE轻量级框架电子拍卖系统
作者:
解智;周康
期刊:
中国新技术新产品 ,2012年(5):21-23 ISSN:1673-9957
作者机构:
武汉工业学院数学与计算机学院,湖北武汉,430023;[解智; 周康] 武汉工业学院
关键词:
J2EE框架;轻量级;电子拍卖;电子商务
摘要:
本文在分析传统J2EE架构缺点的基础上,提出了基于J2EE轻量级框架设计电子拍卖系统的设计原理、功能和架构,分析了轻量级框架体系结构特点。采用MVC设计模式,整合三大框架设计的电子拍卖系统具有良好的稳定性、灵活性、松散耦合、易扩展、易维护等特点。
语种:
中文
展开
三段式粒子群算法在车辆调度问题中的应用
作者:
陈金;周康;刘鹏;邱江
期刊:
计算机工程与应用 ,2012年48(33):233-236,243 ISSN:1002-8331
作者机构:
[陈金; 周康; 刘鹏; 邱江] 武汉工业学院数学与计算机学院
关键词:
车辆调度;粒子群优化;三段式保优策略;整数编码
摘要:
针对标准粒子群算法在解决车辆调度问题上的不足,提出了一种基于整数编码的粒子群优化策略。它依据粒子群算法中粒子进化的思想,给出了三段式保优方法,重新定义了粒子进化速度和位置更新的方式。结合Floyd算法对调度模型进行了仿真验证分析。结果表明,该策略具有较好的寻优能力。
语种:
中文
展开
基于粒子群算法的罐容表标定
作者:
王防修;周康
期刊:
武汉轻工大学学报 ,2012年31(3):39-42 ISSN:2095-7386
作者机构:
武汉工业学院数学与计算机学院,湖北武汉,430023
关键词:
储油罐;标定;粒子群算法;最优解
摘要:
对储油罐的标定模型进行了详细分析,指出影响储油罐标定的两个重要参数,它们分别是倾斜角度α和偏转角度β。由于储油罐的变位不定期地发生,准确地对其变位识别是正确标定的关键。先对粒子群算法进行了一般性介绍,然后在已提供的数据的基础上,用粒子群算法计算出倾斜角度α和偏转角度β的具体值。测试表明,所建立的标定模型对已知油高的情况下能够达到比较好的标定效果。
语种:
中文
展开
Traffic network distribution based on distribution center problem and genetic algorithm
作者:
Xu, Wei;Shen, Ren-Jie;Wu, Gui-Fang;Zhou, Kang
期刊:
Proceedings of 2012 IEEE International Conference on Information Science and Technology, ICIST 2012 ,2012年:219-223
通讯作者:
Zhou, K.(zhoukang_wh@yahoo.com.cn)
作者机构:
[Xu, Wei; Wu, Gui-Fang; Zhou, Kang; Shen, Ren-Jie] School of Math and Computer, Wuhan Polytechnic University, Wuhan 430023, China
摘要:
The first traffic network distribution based on distribution center problem (TNDBDCP) is put forward, which can not be solved by traditional algorithms. In order to solve TNDBDCP, improved genetic algorithm is put forward based on the idea of global and feasible searching. In the improved genetic algorithm, chromosome is generated to use binary-encoding, and more reasonable fitness function of improved genetic algorithm is designed according to the characteristics of spanning tree and its cotree;in order to ensure the feasibility of chromosome, more succinct check function is introduced to three kinds of genetic operations of improved genetic algorithm (generation of initial population, parental crossover operation and mutation operation);three kinds of methods are used to expand searching scope of algorithm and to ensure optimality of solution, which are as follows: the strategy of preserving superior individuals is adopted, mutation operation is improved in order to enhance the randomness of the operation, crossover rate and mutation rate are further optimized. The validity and correctness of improved genetic algorithm solving MSTLCP are explained by a simulate experiment where improved genetic algorithm is implemented using C programming language. And experimental results are analyzed: selection of population size and iteration times determines the efficiency and precision of the simulate experiment. ©2012 IEEE.
语种:
英文
展开
最小生成树DNA算法
作者:
周康;李刚;谢振林;徐伟
期刊:
华中科技大学学报(自然科学版) ,2012年40(1):30-34 ISSN:1671-4512
通讯作者:
Zhou, K.(zhoukang_wh@yahoo.com.cn)
作者机构:
[李刚; 徐伟; 周康; 谢振林] School of Mathematics and Computer, Wuhan Polytechnic University, Wuhan 430023, China
通讯机构:
School of Mathematics and Computer, Wuhan Polytechnic University, China
关键词:
粘贴模型;DNA算法;最小生成树问题;分离实验;割集
摘要:
为了改进粘贴模型,提出了用生化实验实现求解割集的计算方法,并基于该方法给出了最小生成树DNA算法.首次将分离实验扩展为基于分离板的分离实验和基于电泳技术的分离实验,所提出的最小生成树DNA算法打破了DNA计算的计算模式——用求解割集的最小边的方法逐步产生最小生成树.用该方法求解割集利用了分离实验运算的高度并行性,最小生成树DNA算法的时间复杂度是线性的,从而降低了算法的时间复杂度.
语种:
中文
展开