A novel authentication watermarking scheme for images is proposed in this paper, which holds accuracy location and high security at the same time. In the scheme, different keys are selected for different host data, an...
详细信息
Blurred images are caused by many factors such as defocus, motion, and atmospheric turbulence. Due to the unknown various factors that cannot be distinguished in the blurred image, it is necessary to propose a unified...
详细信息
Shuffle operation on trajectories is useful in modeling parallel composition of words and languages. In this work, a new class of P systems with shuffle operation is presented. Such a system has language-objects and s...
详细信息
DNA tile self-assembly is a promising paradigm for nanotechnology. Recently, many researches show that computation by DNA tile self-assembly maybe scalable. In this paper, we propose the algorithm for elliptic curve D...
详细信息
Randí et al. proposed a significant graphical representation for DNA sequences, which is very compact and avoids loss of information. In this paper, we build a fast algorithm for this graphical representation wit...
详细信息
The maximum clique problem has diverse applications in the field of pattern recognition, computer vision, information processing etc. The connection between self-assembly and computation has implied that the tile asse...
详细信息
Membrane systems, also called P systems, are biologically inspired theoretical models of distributed and parallel computing. Tissue P system with cell separation is a computing model in the frame work of membrane comp...
详细信息
Randí;et al. proposed a famous spectral graphical representation of DNA sequences, and claimed that it avoids loss of information. In this paper we build two mathematical models for this graphical representation ...
详细信息
Since the threshold segmentation methods can't divide the interested objects from intricate background perfectly, in this paper, we proposed a new method that combined graph theory with optimal threshold method. W...
详细信息
Since the threshold segmentation methods can't divide the interested objects from intricate background perfectly, in this paper, we proposed a new method that combined graph theory with optimal threshold method. With this method we have made a good integration of the two methods above to ensure that the segment results have smooth boundary and complete regions. Through a lot of experiments, we can draw the conclusion that the proposed method can extract the objects from intricate background perfectly and meet the need of applications.
For given graphs G1,G2, the 2-color Ramsey number R(G1,G2) is defined to be the least positive integer n such that every 2-coloring of the edges of complete graph Kn contains a copy of G1 colored with the first color ...
详细信息
For given graphs G1,G2, the 2-color Ramsey number R(G1,G2) is defined to be the least positive integer n such that every 2-coloring of the edges of complete graph Kn contains a copy of G1 colored with the first color or a copy of G2 colored with the second color. In this note, we obtained some new exact values of generalized Ramsey numbers such as cycle versus book, book versus book, complete bipartite graph versus complete bipartite graph.
暂无评论