A new similarity computing method based on concept similarity in Chinese text processing

The paper proposes a new text similarity computing method based on concept similarity in Chinese text processing. The new method converts text to words vector space model at first, and then splits words into a set of concepts. Through computing the inner products between concepts, it obtains the similarity between words. The new method computes the similarity of text based on the similarity of words at last. The contributions of the paper include： 1） propose a new computing formula between words; 2） propose a new text similarity computing method based on words similarity; 3） successfully use the method in the application of similarity computing of WEB news; and 4） prove the validity of the method through extensive experiments.     

Symmetric-key cryptosystem with DNA technology

DNA cryptography is a new field which has emerged with progress in the research of DNA computing. In our study, a symmetric-key cryptosystem was designed by applying a modern DNA biotechnology, microarray, into cryptographic technologies. This is referred to as DNA symmetric-key cryptosystem (DNASC). In DNASC, both encryption and decryption keys are formed by DNA probes, while its ciphertext is embedded in a specially designed DNA chip (microarray). The security of this system is mainly rooted in difficult biology processes and problems, rather than conventional computing technology, thus it is unaffected by changes from the attack of the coming quantum computer. The encryption process is a fabrication of a specially designed DNA chip and the decryption process is the DNA hybridization. In DNASC, billions of DNA probes are hybridized and identified at the same time, thus the decryption process is conducted in a massive, parallel way. The great potential in vast parallelism computation and the extraordinary information density of DNA are displayed in DNASC to some degree.     

DNA计算与DNA计算机研究进展与展望

DNA computing is a new method based on biochemical reactions and molecular biology technology.The paper first introduces the basic principle and advantages of DNA computing, and then surveys DNA computing and DNA computer, finally, points out current existing problems and future search directions of DNA computing and DNA computer.     

A New Method for Generating Conic Sections

This paper presents a difference method for computing vertices of the polygon inscribed in a conic section.It can be applied to computer graphic package or to plotter to generate conic sections.This metho is simpler and more efficient than traditional ones,and its form remains invariant under homogeneous affine transformations.The stability of the metho and its relationship with its matrix counterpart are also discussed.     

网格计算技术及应用综述

Grid computing is a new kind of distributed computing technology and computing environment ,and also an attentive hot point of information technology in the world. It launches a space for new generation internal application,due to its supporting the complicated service efficiently and useable resource in the Internet. This paper sums up the results and applications instance in the grid computing in the world during recent years ,and then analyzes emphatically the system architecture ,components ,working principle in the grid computing and some typical grid systems ,and then discusses the problems of the large scale science computing and network service in grid computing in China,and alsopoints out the future trends.     

Competent predicate abstraction in model checking

The paper presents a new approach to computing the abstract state and a maximum weight heuristic method for finding the shortest counter-example in verification of imperative programs. The strategy is incorporated in a verification system based on the counterexample-guided abstraction refinement method. The proposed method slashes both the size of the abstract state space and the number of invokes of a decision procedure. A number of benchmarks are employed to evaluate the effectiveness of the app...     

Aqueous Computing: A Survey with an Invitation to Participate

The concept of aqueous computing is presented here,first infull generality,and afterward,using an implementation in a specific enzymatic technology.Aqueous computing arose in the context of biomoloecular (DNA) computing,but the concept is independent of the specifics of its biochemical origin.Alternate technologies for realizing aqueous computing are being considered for future implementation.A solution of an instance of the Boolean satisfiability problem,(SAT),is reported here that provides a new example of an aqueous computation that has been carried out successfully.This small instance of the SAT problem is sufficiently complex to allow our current enzymatic technology to be illustrated in detail.The reader is invited to participate in the rich interdisciplinary activity required by wet lab computing.A project is suggested to the reader for determining the three-colorings of a graph.The basic operations required for this project are exhibited in the solution of the SAT example reported here.     

Reaction Graph

The paper proposes reaction graphs as graphical representations of computational objects.A reaction graph is a directed graph with all its arrows and some of its nodes labeled.Computations are modled by graph rewriting of a simple nature.The basic rewriting rules embody the essence of both the communications among processes and cut-eliminations in proofs.Calculi of graphs are ideentified to give a formal and algebraic account of reaction graphs in the spirit of process algebra.With the help of the calculi,it is demonstrated that reaction graphs capture many interesting aspects of computations.     

The Haplotyping problem: An overview of computational models and solutions

The investigation of genetic differences among humans has given evidence that mutations in DNA sequences are responsible for some genetic diseases.The most common mutation is the one that involves only a single nucleotide of the DNA sequence,which is called a single nucleotide polymorphism (SNP).As a consequence,computing a complete map of all SNPs occurring in the human populations is one of the primary goals of recent studies in human genomics.The construction of such a map requires to determine the DNA sequences that from allchromosomes.In diploid organisms like humans,each chromosome consists of two sequences called haplotypes.Distinguishing the information contained in both haplotypes when analyzing chromosome sequences poses several new computational issues which collectively form a new emergingtopic of Computational Biology known as Haplotyping.This paper is a comprehensive study of some new combinatorial approaches proposed in thisresearch area and it mainly focuses on the formulations and algorithmic solutions of some basic biological problems.Three statistical approaches are briefly discussed at the end of the paper.     

DNA逻辑计算模型的研究现状与展望

DNA计算因其优异的计算能力已经成为当前研究热点,DNA逻辑计算模型是DNA计算体系与运算实现的重要依托。按应用技术将现有DNA逻辑计算模型进行分类：基于链置换的DNA逻辑计算模型、基于核酶的DNA逻辑计算模型、基于G-quadruplex的DNA逻辑计算模型、基于DNA自组装的逻辑计算模型、基于其他分子技术和分子材料的DNA逻辑计算模型。首先阐述了DNA逻辑计算的研究背景和研究目的以及现阶段在生物分子检测、疾病诊断、多因素分析和生物成像等领域的应用并简述其相关概念;然后梳理各DNA逻辑计算模型的研究历史和现状,分析各类逻辑计算模型所应用的分子操控技术和分子材料以及优缺点和应用前景;最后归纳总结DNA逻辑计算领域当前研究热点和发展前景,为未来提出全新的计算方式奠定基础,为信息、医疗等领域提供更好的服务。     

基于质粒的DNA计算模型研究

论文给出了一种基于环状质粒DNA计算的新方法,这种计算质粒包含一个特殊的插入DNA序列片断,每个片断定位在匹配的限制性内切位点,通过剪切和粘贴实现计算过程。论文同时给出了生物计算模型和相关的数学描述,这种模式的计算有待进一步研究。     

浅析DNA计算及其发展状况

近年来,基于生化反应机理的DNA计算模型受到科学领域内许多不同学科领域学者们的关注。DNA计算已经形成国际科学前沿领域内研究的一个新的热点。该文主要讨论了DNA计算的原理,综述了DNA计算的特点、DNA计算模型,并指出了DNA计算研究中存在的问题,最后就DNA计算的发展前景进行了展望。     

DNA计算研究的现状与展望

最近,采用ＤＮＡ计算的可能性引起了人们的广泛兴趣。本文在简要介绍ＤＮＡ是之后,探讨了ＤＮＡ计算及其模型,并将其与遗传算法、模糊控制、神经网络、混沌系统等软件计算技术进行集成,指出了ＤＮＡ计算的优点及目前存在的问题。最后我们对它们的前景进行展望。     

基于DNA序列的计算技术

DNA计算是由生物学和计算机科学相互结合形成的交叉学科,该文将对此学科的发展进行介绍。首先介绍如何借助于处理DNA序列的方法来解决卖货郎问题,并以此表明DNA计算的可行性;再对DNA的切片重组系统和图灵机系统进行比较,以此说明用切片重组系统来实现图灵机功能的可行性,最后简单介绍待解决的问题.     

利用脱氧核酶调控基因表达的DNA计算模型研究(英文)

用于逻辑调控基因表达分子自动机的研究是DNA计算的重要研究领域．文中将脱氧核酶技术应用于DNA计算研究当中,利用脱氧核酶的特性,特别是可以作为反义药物的特点,作为构建分子自动机的主要材料,设计了调控基因H—ras表达的DNA计算模型,而且模型也可适用于其它过表达基因的调控．结合DNA计算具备的高度并行性和智能性的优点,该模型为DNA计算在基因表达调控方面的应用做了进一步探索．     

DNA并行计算中的B-树数据结构的设计与实现

DNA分子特性使得DNA计算具有极大的存储密度和高度的计算并行性。不管何种计算模型,DNA分子的选择和DNA编码都十分重要。提出了DNA计算中的B-树的数据结构设计方法。首先给出了B-树定义及其操作的形式化描述,接着介绍了本计算模型采用的3D结构DNA分子——k-arms分子结构,详细给出了一棵m阶B-树的构造步骤,最后实现了其查找、插入和删除等操作。提出了DNA分子计算的3D结构和分治策略,具有一定的可扩展性和并行性,对DNA计算的其他模型有参考价值。     

DNA计算模型的研究

DNA计算模型在DNA计算的各个研究领域中占有重要的地位,对DNA计算模型进行研究是有意义的。首先回顾了DNA计算模型的发展历史;然后从DNA的基本结构入手研究了DNA计算的机理,并对DNA计算的过程进行了详细分析,从而归纳出DNA计算模型的基本概念;再对DNA计算模型按照DNA计算的物质形态进行了分类并对每一类DNA计算模型的理论及其应用进行了详细的分析。     

关于DNA计算的基本原理与探讨

该文综述了DNA计算的原理及其当前发展的动向,DNA计算虽然刚刚兴起不久,但它是一个新的交叉学科和研究领域,有不可估量的应用潜力,文中拽出DNA计算目前研究的主要方向及应用领域。