Algorithm of graph isomorphism with threedimensional DNA graph structures

ResearchonDNAcomputingwasinitializedin1994 ,whenAdleman[1] proposedamethodofsolvingasmallinstanceoftheHamiltonianPathproblembyalaboratoryexperimentinvolvingDNAmolecules .Later,Lipton[2 ] demonstratedhowalargeclassofNP completeproblemscouldbesolvedbyencodingtheprobleminDNAmolecules .Inparticular ,LiptonshowedonefamousNP problem ,theso called“satisfiability”problem (SAT)andsubsequentlytheotherNP problemscouldbeencodedandsolvedusingmolecules .TheadvantagesofDNAcomputingareitsmassivepa…     

Mechanism and Defense on Malicious Code

With the explosive growth of network applications, the threat of the malicious code against network security becomes increasingly serious. In this paper we explore the mechanism of the malicious code by giving an attack model of the maliciouscode, and discuss the critical techniques of implementation and prevention against the malicious code. The remaining problems and emerging trends in this area are also addressed in the paper.     

行走机器人

本文简单地回顾了行走机器人的研究概况,较详细地描述了HILARE机器人,集中讨论了研制中的一些关键问题:环境感知、决策制定、执行控制以及HILARE计划中所试验的空间建模和路径寻找技术。最后讨论了行走机器人的发展方向及其在现实中的应用。     

教学产品是怎样形成的

1在木桶里寻求答案当然．对教师来说．“产品”一词还不能象“教学结果”概念那样被普通使用。在使用这个词的时候．往往是每次不得不作准确说明．即在每一具体场合，所指的是怎样一种结果。不知是指可以用肉眼看得到的知识、技能、能力．还是指深刻的潜在的新生物——个人的思维水平和类型．世界观和视野、兴趣和认识的需要、工作厅式、积极性．热爱劳动及为教学所形成的其它各种品质。要想对不确定的结果作系统分析是件困难的事·然而对4一切创造过程来说“产品”和“产品率”的一般概念可以使思想、体系和结构更加清晰。它们开辟了由教学…     

Theoretical design for a class of chaotic stream cipher based on nonlinear coupled feedback

1.INTRODUCTION Inordertoimprovethesecurityofchaosencryption system,wecaniteratethechaossystem.Themore chaossystemiterates,themorecomplexitbecomes, andthemoresecurethecorrespondingchaosencryp tionsystembecomes.Zhouetal[1]proposedaclassof chaoticsequencegeneratorinwhichthelinearseg mentnumberincreasedwiththeiterationnumberex ponentially.Withtheincreaseoftheiterationnum ber,thesecurityofthesystemincreaseswhilethe rateofencoding/decodingdecreases.Inaddition,the phase spacegraphhassomedefe…     

非线性极限点和极限圆问题

1910年H．weyl首次提出极限点和极限圆问题，导致了上世纪非线性微分方程渐近分析研究的一些新进展。本书是关于这个研究的专著，对问题的产生、发展、扩充及主要结果和研究趋势等方面进行了论述。     

The dead-end elimination theorem and its use in protein side-chain positioning

The prediction of a protein's tertiary structure is still a considerable problem because the huge amount of possible conformational space1 makes it computationally difficult. With regard to side-chain modelling, a solution has been attempted by the grouping of side-chain conformations into representative sets of rotamers2??. Nonetheless, an exhaustive combinatorial search is still limited to carefully indentified packing units?? containing a limited number of residues. For larger systems other strategies had to be developed, such as the Monte Carlo Procedure?? and the genetic algorithm and clustering approach?. Here we present a theorem, referred to as the 'dead-end elimination' theorem, which imposes a suitable condition to identify rotamers that cannot be members of the global minimum energy conformation. Application of this theorem effectively controls the computational explosion of the rotamer combinatorial problem, thereby allowing the determination of the global minimum energy conformation of a large collection of side chains.