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.     

中间件技术研究

文章概述了分布式计算中的中间件技术的现状,比较了分布式计算技术和传统计算技术,并简要分析了中间件技术的发展趋势。     

往复式给料机的设计和应用

详细介绍了往复式给料机的设计方法.     

云计算环境下政府信息资源开发利用研究

简述了云计算的概念及内涵,分析了云计算环境下政府信息资源开发利用的经济可行性和技术可行性,在此基础上提出了云计算环境下政府信息资源开发利用的新模式。     

温度对冷槽离子质心声子的影响

针对单声子在门操作中的特殊作用,采用松原函数的方法讨论了冷槽离子模型中温度对质心声子数的影响.结果表明,控制离子内态保持在基态的温度量级是mK,这与采用格林函数方法的计算结果一致,而单声子的控制温度在μK量级.所以在门运算过程中,主要考虑质心声子态的影响.     

基于C/S的校园网MIS应用成分的分布及应用

运用Ｃｌｉｅｎｔ／Ｓｅｒｖｅｒ计算模式并结合校园网教育管理信息系统的设计和开发中的实际情况，对应用成分分布问题作探讨．     

应用Z-80微型计算机进行气相色谱仪实时数据处理——色谱峰的定量计算

本文描述了一个色谱实时数据处理软件的算法.将一系列色谱峰的起点与终点连接起来构成基线.峰起点与终点的确定采用相继5点的斜率比较法.两个重叠峰的谷点仅当它低于其相邻两个峰起点与终点之连线时才被考虑画入基线.重叠峰的分割一般用垂线法,在小峰骑大峰的情况下用切线法.峰面积积分用龙贝格法,计算机数据处理的结果与剪纸称重法作了比较,由此证实了前者的准确性.     

有限元概率算法

本文提出了一种求解椭圆型有限元方程的新方法——有限元概率算法,应用这种方法可以在不分解总刚矩阵的情况下,求出一个或少数几个网格点上的函数值。     

P systems with array objects and array rewriting rules

Array P systems were introduced by Paun Gh. which is linking the two areas of membrane computing and picture grammars. Puzzle grammars were introduced by us for generating connected picture arrays in the two-dimensional plane, motivated by the problem of tiling the plane. On the other hand, incorporating into arrays the developmental type of generation used in the well-known biologically motivated L systems, Siromoney and Siromoney proposed a very general rectangular array generating model, called extended controlled tabled L array system (ECTLAS). In this paper we introduce two variations of the array P system, called BPG array P system and parallel array P system. The former has in the regions array objects and basic puzzle grammar rules (BPG), which are a specific kind of puzzle grammar rules. In the latter, the regions have rectangular array objects and tables of context-free rules. We examine these two types of P systems for their array generative power.     

最大匹配问题Tile自组装模型

Tile自组装模型凭借其自组装、可编程等特性在解决NP问题方面具有巨大优势.文中提出了一种求解最大匹配问题的Tile自组装新模型,该模型主要由初始配置子系统、选择子系统及检测子系统3大部分构成.新模型中首先设计Tile分子存储问题信息,其次通过Tile分子自组装操作生成最大匹配问题解空间,最后通过Tile检测分子筛选得到最大匹配问题的解.对模型从所需Tile分子种类、计算时间和计算空间3个方面进行性能分析,并通过实验模拟论证了模型的有效性和正确性.