An increasing number of databases are becoming web accessible through form-based query interfaces, therefore, this paper proposes a novel method of filling forms on deep web data integration system, which contains thr...
详细信息
This paper studies the technique of preprocessing in constraint satisfaction problem (CSP). Firstly, we propose a notion of entirety singleton consistency (ESC) and the algorithm, and then analyze the time and space c...
详细信息
This paper studies the technique of preprocessing in constraint satisfaction problem (CSP). Firstly, we propose a notion of entirety singleton consistency (ESC) and the algorithm, and then analyze the time and space complexity and correctness. Based on this, we present a new preprocessing algorithm SAC-ESC based on ESC, and prove its correctness. Furthermore, we use the divide-conquer strategy for the algorithm to automatically adapt to domain partition of various problems. In our experiments on random CSPs, pigeon problems, N-queens problems and benchmarks, the efficiency of our algorithm SAC-ESC is 3-20 times those of the existing SAC-SDS and SAC-3.
ATP (automated theorem proving) has always been one of the most advanced areas of computer science. The traditional idea used in ATP is to try to deduce the empty clause to check satisfiability, such as resolution bas...
详细信息
ATP (automated theorem proving) has always been one of the most advanced areas of computer science. The traditional idea used in ATP is to try to deduce the empty clause to check satisfiability, such as resolution based theorem proving, which is one of the most popular methods. Extension-rule-based theorem proving is a new resolution-based theorem proving method. After a deep research work on the extension rule, a brilliant property of the rule is obtained. In this paper, the property and an algorithm which is used to decide it are proposed firstly. In addition, the algorithm's time complexity and space complexity are analyzed and proved. Based on the above work, a novel extension rule based theorem proving algorithm called NER is proposed. The NER algorithm transforms the problem which decides whether a clause set is satisfiable to a series of problems deciding whether one literal set includes another one, while the original extension algorithm transforms them to problems counting the number of maximum terms that can be expended. A number of experiments show that the NER algorithm obviously outperforms both the original extension rule based algorithm ER and the directional resolution algorithm DR. Especially, it can be improved up to two orders of magnitude.
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.
There is myriad high quality information in the Deep Web and the feasible method to access the Deep Web is through the query interface of the Deep Web. Itpsilas necessary to extract abundant attributes and semantic re...
详细信息
There is myriad high quality information in the Deep Web and the feasible method to access the Deep Web is through the query interface of the Deep Web. Itpsilas necessary to extract abundant attributes and semantic relation description from the query interface. Automatic extracting attributes from the query interface and automatically translating a query is a solvable way for addressing the current limitations in accessing Deep Web data sources. We design a framework to automatically extract the attributes and instances from the query interface using the WordNet as a kind of ontology technique to enrich the semantic description of the attributes. Each attribute is extended into a candidate attribute set in the form of a hierarchy tree. At the same time, the hierarchy tree generated by ontology describes the semantic relation of the attributes in the same query interface. We carry out our experiments in the real-world domain. The results of the experiments showed the validation of query translation framework.
Cascading failures often occur in congested networks such as the Internet. A cascading failure can be described as a three-phase process： generation, diffusion, and dissipation of the congestion. In this account, we ...
详细信息
Cascading failures often occur in congested networks such as the Internet. A cascading failure can be described as a three-phase process： generation, diffusion, and dissipation of the congestion. In this account, we present a function that represents the extent of congestion on a given node. This approach is different from existing fimctions based on betweenness centrality. By introducing the concept of ＇delay time＇, we designate an intergradation between permanent removal and nonremoval. We also construct an evaluation fimction of network efficiency, based on congestion, which measures the damage caused by cascading failures. Finally, we investigate the effects of network structure and size, delay time, processing ability and packet generation speed on congestion propagation. Also, we uncover the relationship between the cascade dynamics and some properties of the network such as structure and size.
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.
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...
详细信息
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.
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...
详细信息
暂无评论