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.
This paper presents a fast method to construct the simplified terrain model with the multi-resolution. In this method, we adopt the normal quad-tree hierarchy to subdivide the original terrain surface into the multi- ...
详细信息
This paper presents a fast method to construct the simplified terrain model with the multi-resolution. In this method, we adopt the normal quad-tree hierarchy to subdivide the original terrain surface into the multi- resolution levels. For the sake of implementing the compressive storage and the efficient index for the elevation data, a connotative hierarchy is proposed and its corresponding index strategies are deduced. On the basis of the connotative hierarchy, we focus on resolving the crack problem of the simplified model. We firstly create the space filling curve during the simplification process to accelerate the search for the potential cracks. Afterwards, the different approaches are utilized to process the cracks in terms of the dissimilar terrain features. For this reason, we put forward an evaluation function that can selfadaptively identify the terrain feature according to the normal vector angle of the adjacent nodes in the connotative hierarchy. Consequently, there are not redundant triangles in our seamless multi-resolution terrain model. The proposed approaches are experimented on the real data and the results show that our method is relatively efficient and robust. Besides, the seamless simplified model has less number of triangles than the other common algorithm.
Community structure is an important property of network. Being able to identify communities can provide invaluable help in exploiting and understanding both social and non-social networks. Several algorithms have been...
详细信息
Community structure is an important property of network. Being able to identify communities can provide invaluable help in exploiting and understanding both social and non-social networks. Several algorithms have been developed up till now. However, all these algorithms can work well only with small or moderate networks with vertexes of order 104. Besides, all the existing algorithms are off-line and cannot work well with highly dynamic networks such as web, in which web pages are updated frequently. When an already clustered network is updated, the entire network including original and incremental parts has to be recalculated, even though only slight changes are involved. To address this problem, an incremental algorithm is proposed, which allows for mining community structure in large-scale and dynamic networks. Based on the community structure detected previously, the algorithm takes little time to reclassify the entire network including both the original and incremental parts. Furthermore, the algorithm is faster than most of the existing algorithms such as Girvan and Newman's algorithm and its improved versions. Also, the algorithm can help to visualize these community structures in network and provide a new approach to research on the evolving process of dynamic networks.
The improvement of text categorization by statistical methods can be performed from two main directions, namely the feature selection and the evaluation of characteristic weights. In this paper, we propose an enhanced...
详细信息
The improvement of text categorization by statistical methods can be performed from two main directions, namely the feature selection and the evaluation of characteristic weights. In this paper, we propose an enhanced text categorization method based on a modified mutual information algorithm and evaluation algorithm of characteristic weights which improves both aspects. The proposed method is applied to the benchmark test set Reuters-21578 Top10 to examine its effectiveness. Numerical results show that the precision, the recall and the value of F1 of the proposed method are all superior to those of existing conventional methods.
The Diameter protocol is recommended by IETF as AAA (Authentication, Authorization and Accounting) protocol criterion for the next generation network, Because the IPv6 protocol will be widely applied in the intending ...
详细信息
By means of introducing multi-auctioneer model, resources in the computational economic grid can be managed and allocated like in the auction. We research and put forward the corresponding solve schemes of three key i...
详细信息
ISBN:
(纸本)9780889866386
By means of introducing multi-auctioneer model, resources in the computational economic grid can be managed and allocated like in the auction. We research and put forward the corresponding solve schemes of three key issues of auctioneer system: preventing auctioneer from cheating, selection of auctioneer, setting of trading prices, and use computational grid modeling and simulation tools GridSim to simulate computational grid environment in the experiment which uses multiauctioneer system to manage and schedule, then we analyze the results of experiment in different conditions, and validate the feasibility of a multi-auctioneer system in computational grid.
The hardware design of the DSP-based network camera is described in this paper which includes the implementation of CCD camera, DSP, Flash, SDRAM, CPLD, and Ethernet. The program of JPEG2000has been tested on the desi...
详细信息
Most existing text classification work assumes that training data are completely labeled. In real life, some information retrieval problems can only be described as learning a binary classifier from a set of incomplet...
详细信息
暂无评论