案例分析中的DNA计算

DNA计算是一种模拟生物分子DNA的结构并借助于分子生物技术进行计算的新方法，开创了以化学反应作为计算工具的先例，为解决NP—完全问题提供了一种全新的途径。案例分析中常用到离散数学中的逻辑演算，特别是在信息处理方面。在基于表面的DNA计算中采用了荧光标记策略，解决了案例分析中的一个问题，尝试了DNA计算在案例分析中的应用。且这种方法具有编码简单；耗材底；操作时间短；技术先进的优点。     

Circular object recognition based on shape parameters

To recognize circular objects rapidly in satellite remote sensing imagery, an approach using their geometry properties is presented. The original image is segmented to be a binary one by one dimension maximum entropy threshold algorithm and the binary image is labeled with an algorithm based on recursion technique. Then, shape parameters of all labeled regions are calculated and those regions with shape parameters satisfying certain conditions are recognized as circular objects. The algorithm is described in detail, and comparison experiments with the randomized Hough transformation (RHT) are also provided. The experimental results on synthetic images and real images show that the proposed method has the merits of fast recognition rate, high recognition efficiency and the ability of anti-noise and anti-jamming. In addition, the method performs well when some circular objects are little deformed and partly misshapen.     

房子图Hm,n,3的优美性和强协调性

定义一类新的图形——房子图Hm,n,3,设计一个算法并通过计算机给出房子图的优美标号和强协调标号,从而证明其不但是优美的而且是强协调的.     

ON A CONJECTURE OF HARMONIOUS GRAPH

Let the coronas C_n⊙K_1 be the polygons with one additional end-point for eachvertex.Thom Grace conjectured that C_n⊙K_1 are harmonious for n even.In this paper,aproof of his conjecture is given.     

C4k∪C4k∪Cm的优美性

Ｃ４ｋ∪Ｃ４ｋ的优美性已被证明，本文研究Ｃ４ｋ∪Ｃｋ∪Ｃｍ的优美性。给出了其为优美图的必要条件，同时给出了Ｃ４ｋ∪Ｃｋ∪Ｃｋ－１，Ｃ４（３ｔ＋１）∪Ｃ（ｔ＋１）∪Ｃ４（２ｔ＋１）以及Ｃ４（３ｔ＋１）∪Ｃ（３ｔ－１）∪Ｃｔ－１的优美标号。     

固相碘标记活化珠标记蛋白质研究

作者报道了利用其合成的固相碘标记活化珠碘标记蛋白质的方法和效果.考察了各种标记条件活化珠用量及粒径,pH值,温度,标记时间,体积及蛋白质对标记率的影响.结果显示,用此活化珠,碘标记条件温和,标记效率高,标记物稳定且对标记蛋白的损伤小,适用范围大.因此具有良好的应用前景.     

具有公共边的双圈图的奇优美标号及其算法

文章对于有1条公共边的一类双圈图的奇优美标号进行了研究,运用算法分析的思想设计了奇优美标号算法,得出了其奇优美标号,并证明了这类双圈图是奇优美图等结论。     

一类超边幻和图及其计算机算法

探索和研究了一类新的图类的超边幻和标号问题,给出了相应的超边幻和标号算法,并给出了严格的数学证明,从而得出这类图都是超边幻和图等结论。     

On the Gracefulness of the Digraphs n·Cm＊

A digraph D（V, E） is said to be graceful if there exists an injection f ： V（G） →{0, 1,... , ｜E｜} such that the induced function f＇ ： E（G） --~ {1, 2,… , ｜E｜} which is defined by f＇ （u, v） = [f（v） - f（u）] （rood ｜E｜＋ 1） for every directed edge （u, v） is a bijection. Here, f is called a graceful labeling （graceful numbering） of D（V, E）, while f＇ is called the induced edge＇s graceful labeling of D. In this paper we discuss the gracefulness of the digraph n- Cm and prove that n. Cm is a graceful digraph for m = 15, 17 and even     

有宵禁限制的成本最短路问题

在组合优化过程中,往往需要获得从起点到终点之间的最短路,而其所考虑的目标可能是一个与时间相关的变量,同时,对于网络中的节点往往有宵禁的限制(curfews).给出了时变条件下有软、硬宵禁限制的成本最短路模型,设计了求解时变条件下有宵禁限制的成本最短路的算法,并给出了一个应用实例.