The optimization of DNA encodings based on GA/SA algorithms

The design of DNA sequence plays an important role in improving the reliability of DNA computation. Proper constrained terms that DNA sequence should satisfy are selected, and then the evaluation formulas of each DNA individual corresponding to the selected constrained terms are proposed. The heuristic improved genetic algorithm (GA)/simulated annealing (SA) algorithm is presented to solve the multi-objective optimize problem, and the DNA sequence design system is developed. Furthermore, an example is illustrated to show the efficiency of our method given here.     

A membrane evolutionary algorithm for DNA sequence design in DNA computing

DNA sequence design has a crucial role in successful DNA computation,which has been proved to be an NP-hard(non-deterministic polynomial-time hard) problem.In this paper,a membrane evolutionary algorithm is proposed for the DNA sequence design problem.The results of computer experiments are reported,in which the new algorithm is validated and out-performs certain known evolutionary algorithms for the DNA sequence design problem.     

基于杂草算法的DNA编码序列研究

在DNA自组装过程中,DNA序列的设计是影响DNA组装在可靠性和稳定性问题上的重要因素。为降低DNA组装时出现碱基错误匹配的概率,提出了一种用于DNA序列设计的入侵杂草优化(IWO)算法。采用汉明距离约束、相似度约束、连续性约束、发卡结构约束及解链温度约束建立一个多目标函数优化的数学模型,将DNA序列集设计问题抽象为带有约束条件的多目标优化问题。通过将该算法产生的编码序列和其它两种优化算法产生的序列进行对比分析,证实了该算法的有效性,并拓展了算法在离散空间中的应用。     

Multi-objective carrier chaotic evolutionary algorithm for DNA sequences design

DNA computing is a new vista of computation, which is of biochemical type. Since each piece of information is encoded in biological sequences, their design is crucial for successful DNA computation. DNA sequence design is involved with a number of design criteria, which is difficult to be solved by the traditional optimization methods. In this paper, the multi-objective carrier chaotic evolution algorithm (MCCEA) is introduced to solve the DNA sequence design problem. By merging the chaotic search base on power function carrier, a set of good DNA sequences are generated. Furthermore, the simulation results show the efficiency of our method.     

Multi-objective carrier chaotic evolutionary algorithm for DNA sequences design

DNA computing is a new vista of computation, which is of biochemical type. Since each piece of information is encoded in biological sequences, their design is crucial for successful DNA computation. DNA sequence design is involved with a number of design criteria, which is difficult to be solved by the traditional optimization methods. In this paper, the multi-objective carrier chaotic evolution algorithm (MCCEA) is introduced to solve the DNA sequence design problem. By merging the chaotic search base on power function carrier, a set of good DNA sequences are generated. Furthermore, the simulation results show the efficiency of our method.     

面向柔性装配系统的人机一体优化设计

工程设计过程可看作是一约束确定与满足过程,柔性装配系统的优化设计也是一约束优化问题。遗传算法是一种广泛应用于复杂工程技术系统设计的有效方法,但用遗传算法求解约束优化问题比较困难。在人机一体化概念的基础上,讨论了如何通过优化开始前的约束预处理、优化过程中的约束处理以及建立变异库给变异操作一个进化方向,来将以约束形式表达的领域知识融合到优化搜索过程中,从而提高了遗传算法的优化性能,并在柔性装配系统中成功地实现了人机一体优化设计。     

约束闭环系统的虚拟参考反馈校正控制

采用虚拟参考反馈校正控制方法,通过最小化由一簇输入/输出观测数据组成的L2范数的代价函数来设计控制器;对于含有椭球约束不等式条件的非线性优化问题,将目标准则函数和两约束条件转化为线性矩阵不等式形式,采用椭球优化迭代算法产生一系列体积逐渐减小的椭球序列,并最终收敛于一个最优解,同时,推导出椭球优化迭代算法所需迭代次数的一个上界;针对椭球优化迭代算法的初始化,提出一种基于凸优化理论水平集的初始椭球选取策略,采用仿真算例验证了所提出方法的有效性.结果表明：采用虚拟参考校正控制来设计闭环系统中的2个控制器时,可以得到较为准确的控制器参数估计值;采用椭球优化算法可以得到较快的收敛速度.     

A new approach based on PSO algorithm to find good computational encoding sequences

Computational encoding DNA sequence design is one of the most important steps in molecular computation. A lot of research work has been done to design reliable sequence library. A revised method based on the support system developed by Tanaka et al. is proposed here with different criteria to construct fitness function. Then we adapt particle swarm optimization (PSO) algorithm to our encoding problem. By using the new algorithm, a set of sequences with good quality is generated. The result also shows that our PSO-based approach could rapidly converge at the minimum level for an output of the simulation model. The celerity of the algorithm fits our requirements.     

A new approach based on PSO algorithm to find good computational encoding sequences

Computational encoding DNA sequence design is one of the most important steps in molecular computation. A lot of research work has been done to design reliable sequence library. A revised method based on the support system developed by Tanaka et al. is proposed here with different criteria to construct fitness function. Then we adapt particle swarm optimization (PSO) algorithm to our encoding problem. By using the new algorithm, a set of sequences with good quality is generated. The result also shows that our PSO-based approach could rapidly converge at the minimum level for an output of the simulation model. The celerity of the algorithm fits our requirements.     

邻域自适应的微分变异约束分数阶粒子群优化

分数阶粒子群算法（FOPSO）是一种具有路径记忆的改进型粒子群优化算法。在多峰约束优化问题中,针对FOPSO易于早熟和依赖于初始参数的问题,文中提出了一种邻域自适应的约束分数阶粒子群优化方法（NAFPSO）。在算法中,依据进化状态来动态调整邻域拓扑从而更新粒子位置和速度,以提高可行解的全局寻优能力和收敛速度;采用带惩罚因子的罚函数约束处理技术,迫使粒子趋向可行区域;设计了微分变异策略以增加种群多样性,增强粒子逃脱局部最优的能力。用9个约束优化基准函数实验验证了NAFPSO的有效性和收敛性能,并应用于2个约束工程设计问题,结果表明,提出的算法寻优能力强、收敛快、精度高、稳定性好,可用于有效地解决复杂的约束工程设计优化问题。     

SO(n)中定型矩阵拟合的数值梯度方法

提出求解SO（n）中定型矩阵拟合问题导出的约束优化问题的一个数值梯度算法．该方法可视为离散动力系统算法,其最大特点是能始终保持迭代点列满足约束条件．对算法的收敛性和渐近稳定性进行了理论分析,数值试验结果验证了算法的有效性和可靠性．     

凸规划内点算法在连杆机构优化设计中的应用

提出一种非线性原－对偶内点凸规划算法，并用这种优化方法解决机构优化设计问题．该算法已编写成计算机程序，并在ＩＢＭＰＣ／ＡＴ－４８６计算机上考核通过．数值实验结果和实际机构优化设计应用均显示，该算法具有所得到的解可靠（对于凸规划问题，解都是内点）、迭代次数和函数调用次数都比较少等优点．     

The parameter determination in the design of 3-D spherically symmetric FIR filters via the McClellan transformation

In the design of 3-D spherically symmetric FIR filters via the McClellan transformation, two methods are proposed to determine the transformation parameters. The first is to improve the original 3-D algorithm by exploiting the 2-D effective methods in 3-D. This method can change the constrained optimization algorithm into the unconstrained one and makes the design easier to realize. The second method is to solve the coupled equations under constrained conditions and a set of ideal parameters can be gotten. The design example shows that the two methods are all efficient and easier than the original algorithm. Supported by the National Natural Science Foundation of China Jin Xiaoying: born in 1975, Graduate student     

基于混合策略的de novo序列拼接算法构造

在对3种de novo(从头)序列拼接的基本策略进行分析的基础上,该文研究了混合策略序列拼接算法的构造过程,从而整合多个单一策略优点; 再利用形式化方法和形式化平台方面的优势,结合领域分析建模和产生式编程的方法,构造了2个基于OLC策略的算法(OLC_assembly_1,OLC_assembly_2)及1个基于DBG策略的算法(DBG_assembly),进一步组装出在(OLC+DBG)→OLC混合模式下的算法(简称ODO算法); 最后,从GenBank中选取了3个实验样本,从N50、Contigs number、Coverage等角度,比较了在3个单一策略下的算法和ODO构造算法的拼接结果,分析了coverage depth和k值的变化对拼接结果的影响.实验结果表明:该文实现的ODO算法比单一策略在序列拼接时所产生的结果在N50和Coverage等参数上均有一定的优势.     

The parameter determination in the design of 3-D spherically symmetric FIR filters via the McClellan transformation

In the design of 3-D spherically symmetric FIR filters via the McClellan transformation, two methods are proposed to determine the transformation parameters. The first is to improve the original 3-D algorithm by exploiting the 2-D effective methods in 3-D. This method can change the constrained optimization algorithm into the unconstrained one and makes the design easier to realize. The second method is to solve the coupled equations under constrained conditions and a set of ideal parameters can be gotten. The design example shows that the two methods are all efficient and easier than the original algorithm. Supported by the National Natural Science Foundation of China Jin Xiaoying: born in 1975, Graduate student     

实时异常轨迹检测方法及其应用

利用内置GPS的移动终端可以获取移动对象的运动轨迹,可用于分析移动对象的运动行为.在公共交通、医疗监护、物流运输等应用领域,移动对象的运动轨迹受路网约束且大多需要预先设定.考虑到偏离预先设定的正常轨迹可能预示着某种异常,及时准确地进行异常轨迹检测是非常必要的.从时间序列分析的角度,提出一种实时异常轨迹检测算法,在预先设...     

线性等式约束优化问题的一个信赖域方法

将ＡＢＳ算法用于求解线性等式约束的优化问题。给出一个信赖域算法；该算法中用隐式ＬＵ分解算法修正Ｈｅｓｓｅ矩阵，用对称的ＡｂＳ算法求解子问题。证明了由算法生成的序列的任意聚点满足线性等式约束优化问题最优解的必要条件。     

Approximate design of optimal tracking controller for time-delay systems

Time-delay is quite common in practical control systems. The analysis and synthesis of continuous time-delay systems are one of the most difficult mathematical problems with infinite dimensions. The research on the OTC problem for time-delay systems has m…     

基于D-tree分解的欠约束与完备约束的几何约束求解

提出了解决欠约束、完备约束的几何约束问题的D-tree分解算法.首先,提出了一种适用范围更广的处理特殊约束策略,可以将这种特殊约束与普通约束统一化,采用转化策略将欠约束的几何约束问题转化为完备约束的几何约束问题.然后,根据几何约束图中结点的度的性质给出了D-tree分解算法,相比经典算法,D-tree分解算法拥有更低算法复杂度和相同的求解域.最后,根据D-tree分解算法结果的规律性,给出了一个为基于数值的求解方法导出求解序列的策略.D-tree分解算法通过导出的求解序列将提高几何约束求解中基于数值的求解方法的求解效率.     

微球聚焦测井仪推靠系统多目标优化设计

提出了基于极板速度、加速度以及推靠系统主传动机构传动角为优化设计目标的推靠系统优化设计方法。通过推靠系统的运动分析，根据实际工况，择优选取推靠系统中极板质心处的速度、加速度，作为推靠系统传动性能的评价参数。以此期望参数与推靠极板质心点处的运动速度差值均方根，加速度差值均方根，推靠系统主传动机构传动角差值均方根最小为目标，建立推靠系统的约束多目标优化模型。采用复合形-遗传算法中群体搜索策略和群体间个体之间的信息交换方法引入复合形算法中，来求解该约束多目标优化问题。获得了与期望值逼近程度较高、机构参数合理的测井推靠系统。最后，将优化结果与原设计的微球聚焦测井仪推靠系统进行动力性能分析比对，以验证其优化方法的正确性与有效性。结果表明，优化效果明显，对推靠系统的运动平稳性以及推靠极板的传力性能都有较大改善。