Parallel association rules mining has been improved the efficiency of data mining, and meanwhile concerned with the privacy preserving problem. A simple and effective method of parallel association rules mining which ...
详细信息
Parallel association rules mining has been improved the efficiency of data mining, and meanwhile concerned with the privacy preserving problem. A simple and effective method of parallel association rules mining which based on privacy protection----parallel association rules mining algorithm with privacy preserving (PARMA-P) has been introduced in this paper. It could achieve effective concealment of frequent item-set and then the association rules by the means of using imported hash assignment strategy in frequent item sets of FP sub tree could be protected. It has been used in HRM of an enterprise and experiments show that the algorithm can be simple and effective in protection of data privacy.
A new escrow mechanism for personal security keys on IBE was proposed. This mechanism constructed a security trust system composed of private key generator, key management center, and user security component to set up...
详细信息
A new escrow mechanism for personal security keys on IBE was proposed. This mechanism constructed a security trust system composed of private key generator, key management center, and user security component to set up a personal security key escrow model, thus providing identity validation, confidentiality and integrality check for the application, backup, recovery, and renewal of the escrowed keys. The mechanism, taking advantage of the IBE, simplified the process of authentication and encryption, mede it possible for users to complete independently the escrow of personal security keys. Therefore, it is more practical than traditional key escrow schemes.
Detecting the boundaries of protein domains is an important and challenging task in both experimental and computational structural biology. In this paper, a promising method for detecting the domain structure of a pro...
详细信息
Detecting the boundaries of protein domains is an important and challenging task in both experimental and computational structural biology. In this paper, a promising method for detecting the domain structure of a protein from sequence information alone is presented. The method is based on analyzing multiple sequence alignments derived from a database search. Multiple measures are defined to quantify the domain information content of each position along the sequence. Then they are combined into a single predictor using support vector machine. What is more important, the domain detection is first taken as an imbal- anced data learning problem. A novel undersampling method is proposed on distance-based maximal entropy in the feature space of Support Vector Machine (SVM). The overall precision is about 80%. Simulation results demonstrate that the method can help not only in predicting the complete 3D structure of a protein but also in the machine learning system on general im- balanced datasets.
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.
Both Content analysis and link, analysis have its advantages in measuring relationships among documents. In this paper. we propose a new method to combine these two methods to compute the similarity of research papers...
详细信息
ISBN:
(纸本)9783540881919
Both Content analysis and link, analysis have its advantages in measuring relationships among documents. In this paper. we propose a new method to combine these two methods to compute the similarity of research papers so that we can do clustering of these papers more accurately. In order to improve the efficiency of similarity calculation, we develop a strategy to deal with the relationship graph separately, without affecting the accuracy. We also design an approach to assign different weights to different links to the papers, which can enhance the accuracy of similarity calculation. The experimental results conducted oil ACM data Set show that our new algorithm. S-SimRank, outperforms other algorithms.
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...
详细信息
Full-text indices are data structures that can be used to find any substring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman c...
详细信息
Full-text indices are data structures that can be used to find any substring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman code to the wavelet tree of a string T[1. . .n]. Compared with Huffman code based wavelet tree, the memory space used to represent the shape of wavelet tree is not needed. In case of large alphabet, this part of memory is not negligible. The operations of wavelet tree are also simpler and more efficient due to the canonical Huffman code. Based on the resulting structure, the multi-key rank and select functions can be performed using at most nH0 + jRj(lglgn + lgn lgjRj)+O(nH0) bits and in O(H0) time for average cases, where H0 is the zeroth order empirical entropy of T. In the end, we present an efficient construction algorithm for this index, which is on-line and linear.
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.
According to the security features of WiMAX-based wireless communication network, a fresh new wireless communication authentication protocol called WCAP was advanced and designed adopting the dual-key authentication s...
详细信息
We present a novel object localization approach based on the Global Structure Constraint model (GSC) and Optimal Algorithm. In GSC, Objects are described as constellations of points satisfied with their specific globa...
详细信息
暂无评论