Color features are important to pictures and they are easy to ***, the features are widely used in content-based image retrieval (CBIR)[4][7].In the meantime, it lacks space *** this paper, color spaces are analyzed a...
详细信息
Color features are important to pictures and they are easy to ***, the features are widely used in content-based image retrieval (CBIR)[4][7].In the meantime, it lacks space *** this paper, color spaces are analyzed and YUV color space is *** and texture features are extracted in segmentation block, so there are space *** color, major segmentation block, a new kind of color quantization and a new Gray scale co-existing matrix's method are *** approach is described in detail and compared with other methods presented in the literature to deal with the same *** experiments are finished and show that the method in this paper is effective and efficient.
Most of real-life scheduling problems are semi online. Recently, how to solve such dynamic problems is a hot topic in the research of artificial intelligence. The semi on-line scheduling is introduced and the constrai...
详细信息
Most of real-life scheduling problems are semi online. Recently, how to solve such dynamic problems is a hot topic in the research of artificial intelligence. The semi on-line scheduling is introduced and the constraint models are analyzed and categorized. By defining the relevant concept of monotony about constraints that appear in general dynamic constraint models, a kind of constraint extending is formalized. Based on this dynamic constraint modeling, a sound dynamic constraint solving algorithm is designed to deal with the scheduling problems. Finally, an application example of semi on-line discrete resource scheduling problems is given. Experiments show that the algorithm is valid.
It is very important in the field of bioinformatics to apply computer to perform the function annotation for new sequenced bio-sequences. Based on GO database and BLAST program, a novel method for the function annotat...
详细信息
It is very important in the field of bioinformatics to apply computer to perform the function annotation for new sequenced bio-sequences. Based on GO database and BLAST program, a novel method for the function annotation of new biological sequences is presented by using the variable-precision rough set theory. The proposed method is applied to the real data in GO database to examine its effectiveness. Numerical results show that the proposed method has better precision, recall-rate and harmonic mean value compared with existing methods.
Previous methods of volume rendering are very slow and thus impractical. We present volume rendering based on marching cubes iso-surfacing and transfer function. For an iso-surface, we divide the voxels into logical c...
详细信息
Previous methods of volume rendering are very slow and thus impractical. We present volume rendering based on marching cubes iso-surfacing and transfer function. For an iso-surface, we divide the voxels into logical cubes according to a predefined threshold value, the tangent planes and normal vectors at each voxel are calculated and the normal vectors are orientated to the outside of surface based on wide first searching (WFS), and the 3D surface model is then obtained using marching cubes. Transfer function is used to specify the optical properties for volume rendering technology. We employ a 2D function. The end-user interacts with a set of direct manipulation widgets (triangles and rectangles). Each widget precisely corresponds to a different material and widgets are blended automatically to compute an overall transfer function. Compared to traditional techniques, the overall specification process takes a fraction of the time.
A new optimization method-organizational evolutionary algorithm (OEA) is proposed. Using OEA, a colony is composed of organizations, and the colony's evolution is lead by three organizational evolutionary operator...
详细信息
A new optimization method-organizational evolutionary algorithm (OEA) is proposed. Using OEA, a colony is composed of organizations, and the colony's evolution is lead by three organizational evolutionary operators: split operator, merge operator, and coordinate operator. Split operator limits the scale of the organization and makes a part of the organization goes into the next generation directly, which maintains the variety of the generation. Merge operator fully makes use of the leader's information and acts as a local search function. Coordinate operator increases the degree of adaptability by interactions between organizations. OEA is successfully applied to solve the nonlinear parameterization design problems. Experiments show that OEA performs better than original generic algorithm (GA) in this application of parameterization design.
In an open multi-agent of dynamic network environment, different mobile agents hope to carry on the communication for the problem of a certain domain. There is a need to avoid appearance of logical exception phenomeno...
详细信息
In an open multi-agent of dynamic network environment, different mobile agents hope to carry on the communication for the problem of a certain domain. There is a need to avoid appearance of logical exception phenomenon, and the term in this domain must be made to obtain consistency. A layer ontology services communication model named LOSCM is proposed in this paper. LOSCM has two primary advantages. First, it fully takes into account the factors that affect the communication, and using ontology can be represented in agent's knowledge base. Second, provided ontology does not belong to the public data source or have public ontologies, according to the concept loss degree and the concept related degree, LOSCM establishes a layering algorithm, which is able to avoid logical exception handling policies, ensure the right understanding of communication entity concept, and resolve the consistency problem of concept translation. It is shown by experiments that LOSCM is superior to other methods, and can effectively improve the communication consistency of a mobile agent system under certain conditions.
For the larger search space when learning clause in Inductive Logic Programming, we defined the clause template. Firstly, we learn the clause templates by Genetic Algorithm, and then convert it to the requisite clause...
详细信息
For the larger search space when learning clause in Inductive Logic Programming, we defined the clause template. Firstly, we learn the clause templates by Genetic Algorithm, and then convert it to the requisite clauses by combining tag matrix and information gain sampling. We designed the corresponding fitness function and genetic operators. Theoretical analysis and experiment comparison show that this algorithm can reduce the search space, improve the search efficiency and can learn recursion clause. It is an effective clause learning algorithm.
Constraint satisfaction problems (CSPs) is an important research branch in artificial intelligence. Recently, dynamic CSP is proposed as a powerful tool for solving many real-world problems on dynamic environments. As...
详细信息
Constraint satisfaction problems (CSPs) is an important research branch in artificial intelligence. Recently, dynamic CSP is proposed as a powerful tool for solving many real-world problems on dynamic environments. As a result, several algorithms to solve dynamic CSPs are presented. Among those algorithms, local change (LC) algorithm based on solution reuse strategy is a method for solving many kinds of dynamic CSPs and efficient for flexible planning. On the basis of LC algorithm which is widely used, the tabu search strategy is integrated and a mini-conflict repair based algorithm is proposed, which is called Tabu_LC. The improved algorithm considers all the conflict variables as a whole, and then solves the sub-problems with branch and bound algorithm to find the best neighbor assignment, which improves the efficiency markedly. Furthermore, the Tabu_LC algorithm is implemented in the framework of constraint solving system Ming-yue 1.0, and compared with the LC algorithm using large amount of random CSPs. The experiment indicates that the improved algorithm has overwhelmed the LC algorithm on both the efficiency and quality of solutions.
This paper proposes a novel way for the population evolution research. In the paper, it constructs the phylogenies tree of four populations using the single nucleotide polymorphism (SNP) genotype frequency of human...
详细信息
The necessary and sufficient condition for the existence of prewavelets with finite decomposition and finite reconstruction is presented. Especially when r = 1, we show that {φj(x-k) | 1 &le j &le r, k ∈ s} ...
详细信息
The necessary and sufficient condition for the existence of prewavelets with finite decomposition and finite reconstruction is presented. Especially when r = 1, we show that {φj(x-k) | 1 &le j &le r, k ∈ s} is shift-orthogonal if there exist prewavelets with finite decomposition and finite reconstruction, i.e., non-trivial prewavelets with finite decomposition and finite reconstruction does not exist. As an example, when r = 2 we construct a prewavelet with finite decomposition and finite reconstruction where the scale function is not shift-orthogonal, which demonstrate that there exist vector prewavelets with finite decomposition and finite reconstruction.
暂无评论