To obtain the optimal partition of a data set, a hybrid clustering algorithm, PKPSO, based on PSO is proposed. In the proposed PKPSO the PSO algorithm is effectively integrated with the K means algorithm. Among the po...
详细信息
To obtain the optimal partition of a data set, a hybrid clustering algorithm, PKPSO, based on PSO is proposed. In the proposed PKPSO the PSO algorithm is effectively integrated with the K means algorithm. Among the population, selected candidate solutions are further optimized to improve the accuracy by the K-means algorithm. By analyzing the algorithm, the criterions for control parameters selection are determined. Partional clustering result by the proposed PKPSO is compared with that by PSO or by K-means algorithm, and results show that the global convergent property of PKPSO is better than that of the other algorithms. The PKPSO can not only overcome the shortcoming of local minimum trapping of the K-means, but also the solution precision and algorithm stability are better than that of the other two algorithm.
An efficient collision detection method based on separating bounding volume (SBV) is proposed. The positions and shapes of SBVs are determined by the optimal separating support hyper planes of two objects. SBVs not on...
详细信息
Vehicular ad hoc networks (VANET) have many new characteristics unlike tranditional network, such as centriclessness, mobility and multi-hop transmission, which invalidate conventional key managements. The fast develo...
详细信息
Vehicular ad hoc networks (VANET) have many new characteristics unlike tranditional network, such as centriclessness, mobility and multi-hop transmission, which invalidate conventional key managements. The fast development and successful application of trusted computing technology provide a potential solution to achieve effective authentication and trust evaluation. According to the VANET with self-organization, a new authentication and trust evaluation framework was proposed based on trusted computing technology, the concepts of "trusted attribute" and "trusted grade" were introduced, and the key management architecture as well as authentication process of mobile node were explained in detail. Moreover, the potential real application of the presented framework was discussed, and the trust evaluation method and its argumentation in the presented framework were given.
A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exp...
详细信息
A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exploration and exploitation. In the clonal selection mechanism, clonal selection, hypermutation and receptor edit theories are presented to construct an evolutionary searching mechanism which is used for exploration. In the local search mechanism, a simulated annealing local search algorithm based on Nowicki and Smutnicki＇s neighborhood is presented to exploit local optima. The proposed algorithm is examined using some well-known benchmark problems. Numerical results validate the effectiveness of the proposed algorithm.
Thih paper proposed an intrusion detection system framework adapt to load characteristic under IPv6/4 environment; it uses decision-tree-based classification method, under guidance of a certain flow, creates dynamical...
详细信息
Distributed constraint optimization problem (DCOP) is a kind of optimization problem oriented to large-scale, open and dynamic network environments, which has been widely applied in many fields such as computational g...
详细信息
Distributed constraint optimization problem (DCOP) is a kind of optimization problem oriented to large-scale, open and dynamic network environments, which has been widely applied in many fields such as computational grid, multimedia networks, e-business, enterprise resource planning and so on. Besides the features such as non-linear and constraint-satisfaction which the traditional optimization problems have, DCOP has its distinct features including dynamic evolution, regional information, localized control and asynchronous updating of network states. It has become a challenge for computer scientists to find out a large-scale, parallel and intelligent solution for DCOP. So far, there have been a lot of methods for solving this problem. However, most of them are not completely decentralized and require prior knowledge such as the global structures of networks as their inputs. Unfortunately, for many applications the assumption that the global views of networks can not be obtained beforehand is not true due to their huge sizes, geographical distributions or decentralized controls. To solve this problem, a self-organizing behavior based divide and conquer algorithm is presented, in which multiple autonomous agents distributed in networks work together to solve the DCOP through a proposed self-organization mechanism. Compared with existing methods, this algorithm is completely decentralized and demonstrates good performance in both efficiency and effectiveness.
In this paper, we apply the least-square support vector machine (LS-SVM) to operon prediction of Escherichia coli (***), with different combinations of intergenic distance, gene expression data, and phylogenetic profi...
详细信息
ISBN:
(纸本)9781424440085
In this paper, we apply the least-square support vector machine (LS-SVM) to operon prediction of Escherichia coli (***), with different combinations of intergenic distance, gene expression data, and phylogenetic profile. Experimental results demonstrate that the WO pairs tend to have shorter intergenic distances, higher correlation coefficient and much stronger relation of co-envoled between phylogenetic profiles. Also, we dealt with the data sets extracted from WOs¿ and TUBs¿, processed the intergenic distances with log-energy entropy, de-noised the Pearson correlation coefficients of two genes expression data with wavelet transform, and computed the Hamming distances of two phylogenetic profiles. Then we trained LS-SVM using part of the data sets and tested the trained classifier model using the rest data sets. It shows that different combinations of features could affect the prediction results. When the combination of intergenic distance, gene expression data and phylogenetic profile is taken as the input of LS-SVM in the linear kernel type, good results can be obtained, of which the accuracy, sensitivity and specificity are 92.34%, 93.54%, and 90.73%, respectively.
In this paper an efficient copyright protection watermarking algorithm is proposed. By embedding orthogonal vector into the wavelet-tree structure of the host image, we get the watermarked image. At the same time huma...
详细信息
In this paper an efficient copyright protection watermarking algorithm is proposed. By embedding orthogonal vector into the wavelet-tree structure of the host image, we get the watermarked image. At the same time human vision system is considered to get perceptual results. We design an elaborate function for blind watermarking scheme. This function can dynamically determine the embedding position. The theory and experimental results show that our method successfully survives image processing operation, noise adding, the JPEG lossy compression and image cropping. Especially, the scheme is robust towards image sharpening and image enhancement.
Focused on a variation of the Euclidean traveling salesman problem (TSP), namely the prize-collecting traveling salesman problem with time windows (PCTSPTW), this paper presents a novel ant colony optimization solving...
详细信息
Focused on a variation of the Euclidean traveling salesman problem (TSP), namely the prize-collecting traveling salesman problem with time windows (PCTSPTW), this paper presents a novel ant colony optimization solving method. The time window constraints are considered in the computation for the probability of selection of the next city. The parameters of the algorithm are analyzed by experiments. Numerical results also show that the proposed method is effective for the PCTSPTW problem.
暂无评论