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…     

轨道压缩映象的公共不动点定理

引入新型映象———拟压缩映象,在一定条件下,建立了一些新的公共不动点定理,这些结果改进、统一和推广文献[1]———[4]的主要结果.     

图G_i~(S*)(P,2(sum form j=1 to n)mj)的伴随多项式因式分解的图论方法及应用

通过研究图的伴随多项式的因式分解 ,给出了证明非色唯一图的一种新方法 ,并且得到了若干图簇的色等价图的结构性质     

分数Hamilton圈与分数树形图

定义有向图的分数有向Hamilton圈和分数支撑树形图，讨论分数Hamilton圈、分数旅行售货员问题和分数支撑树形图基于线性规划的等价定义及多项式时间算法。     

障碍可越路线规划的符号图方法

本文给出２—Ｄ路线规划问题在障碍可越情况下的启发式符号方法．这一方法利用推理规则在由图像信息导出的连通图知识结构上进行启发式符号Ａ搜索以对空间关系进行分析和分类，以符号描述形式给出两声间路线规划方案．     

滚齿切削图形的解析求法

本文提出了求滚齿图形的解析方法,用该方法可以方便而精确地求出各种类型滚刀的切削图形,并能在计算机上直接打印出来。它既可以用来分析各种类型滚刀的切削过程,又可以作为滚刀计算机辅助设计的一个环节,以寻求更加高效和高耐用度的滚刀齿形。     

用面扩树的方法找三次图的边三着色

本文通过分析三次图中面的奇偶性及组合情况,引出了可边三色块的概念,接着用面扩树方式给出了三次图中大量的可边三色块,在这些可边三色块中导出了三次图的一些边三色解.     

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…     

Iterative Method for Constructing Complete Complementary Sequences with Lengths of 2^mN

Complete complementary sequences are widely used in spectrum spread communications because of their ideal correlation functions. A previous method generates complete complementary sequences with lengths of N^nN （n,N ∈ Z^＋）. This paper presents a new iterative method to construct complete complementary sequences with lengths of 2^mN （m,N ∈ Z^＋）. The analysis proves that this method can produce many sequence sets that do not appear in sequence sets generated by the former method, especially shorter sequence sets. The result will certainly increase the application of complete complementary sequences in communication engineering and related fields.     

关于E~(n+1)中全臍超曲面和极小超曲面的一个注记

本文利用改进了的一般极大值原理,给出了n+1维欧氏空间E~(n+1)中利齐曲率下方有界的完备连通超曲面为全脐超曲面或极小超曲面的一个充要条件。