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...
详细信息
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...
详细信息
The maximum clique problem has diverse applications in the field of pattern recognition, computer vision, informationprocessing 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...
详细信息
Roadmap methods were widely used in route planning fields, both for robots and unmanned aircrafts. Traditional roadmap is constituted by connecting the vertexes of convex obstacle, which is related to the locations of...
详细信息
作者：
Yang, XinDing, Ming-YueZhou, Cheng-Ping
Huazhong Unvi. of Sci. and Tech. Image Processing and Intelligence Control Key Laboratory of Education Ministry of China Wuhan 430074 Hubei China School of Life Science and Technology
Huazhong Unvi. of Sci. and Tech. Image Processing and Intelligence Control Key Laboratory of Education Ministry of China Wuhan 430074 Hubei China
Huazhong Unvi. of Sci. and Tech. State Key Laboratory for Multi-spectral Information Processing Technologies Wuhan 430074 Hubei China
This paper focuses on route planning, especially for unmanned aircrafts in marine environment. Firstly, new heuristic information is adopted such as threat-zone, turn maneuver and forbid-zone based on voyage heuristic...
详细信息
Real-world optimization involving multiple objectives in changing environment known as dynamic multi-objective optimization (DMO) is a challenging task, especially special regions are preferred by decision maker (DM)....
详细信息
ISBN:
(纸本)9781450300728
Real-world optimization involving multiple objectives in changing environment known as dynamic multi-objective optimization (DMO) is a challenging task, especially special regions are preferred by decision maker (DM). Based on a novel preference dominance concept called sphere-dominance and the theory of artificial immune system. (AIS), a sphere-dominance preference immune-inspired algorithm (SPIA) is proposed for DMO in this paper. The main contributions of SPIA are its preference mechanism and its sampling study, which are based on the novel spheredominance and probability statistics, respectively. Besides, SPIA introduces two hypermutation strategies based on history information and Gaussian mutation, respectively. In each generation, which way to do hypermutation is automatically determined by a sampling study for accelerating the search process. Furthermore, The interactive scheme of SPIA enables DM to include his/her preference without modifying the main structure of the algorithm. The results show that SPIA can obtain a well distributed solution set efficiently converging into the DM's preferred region for DMO. Copyright 2010 ACM.
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.
The Ramsey multiplicity M(G) of a graph G is defined to be the smallest number of monochromatic copies of G in any two-coloring of edges of K R(G), where R(G) is the smallest integer n such that every graph on n verti...
详细信息
The Ramsey multiplicity M(G) of a graph G is defined to be the smallest number of monochromatic copies of G in any two-coloring of edges of K R(G), where R(G) is the smallest integer n such that every graph on n vertices either contains G or its complement contains G. With the help of computer algorithms, we obtain the exact values of Ramsey multiplicities for most of isolate-free graphs on five vertices, and establish upper bounds for a few others.
暂无评论