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...
详细信息
A well-known drawback in the least squares support vector machine (LS-SVM) is that the sparseness is lost. In this study, an effective pruning algorithm is developed to deal with this problem. To avoid solving the pri...
详细信息
A well-known drawback in the least squares support vector machine (LS-SVM) is that the sparseness is lost. In this study, an effective pruning algorithm is developed to deal with this problem. To avoid solving the primal set of linear equations, the bottom to the top strategy is adopted in the proposed algorithm. During the training process of the algorithm, the chunking incremental and decremental learning procedures are used alternately. A small support vector set, which can cover most of the information in the training set, can be formed adaptively. Using the support vector set, one can construct the final classifier. In order to test the validation of the proposed algorithm, it has been applied to five benchmarking UCI datasets. In order to show the relationships among the chunking size, the number of support vector machine, the training time, and the testing accuracy, different chunking sizes are tested. The experimental results show that the proposed algorithm can adaptively obtain the sparse solutions without almost losing generalization performance when the chunking size is equal to 2, and also its training speed is much faster than that of the sequential minimal optimization (SMO) algorithm. The proposed algorithm can also be applied to the least squares support vector regression machine as well as LS-SVM classifier.
In this paper an intrusion detection method based on Dynamic Growing Neural Network (DGNN) for wireless networking is presented. DGNN is based on the Hebbian learning rule and adds new neurons under certain conditions...
详细信息
Modularity and rigor are two key elements for multi-agent technology. Hong Zhu's multi-agent system (MAS) development method provides proper language facilities supporting modularity. To enhance this method with r...
详细信息
Modularity and rigor are two key elements for multi-agent technology. Hong Zhu's multi-agent system (MAS) development method provides proper language facilities supporting modularity. To enhance this method with rigor advocates a DL method to map the specification of MAS into a DL TBox. Thus, we can use the existing DL reasoners and systems to verify and validate some system's properties.
暂无评论