A particle swarm optimization (PSO)-based automatic system to determine the number of optimal band sets and corresponding bands is proposed. A simple searching criterion function, called minimum estimated abundance co...
详细信息
Frequent counting is a very so often required operation in machine learning algorithms. A typical machine learning task, learning the structure of Bayesian network （BN） based on metric scoring, is introduced as an e...
详细信息
Frequent counting is a very so often required operation in machine learning algorithms. A typical machine learning task, learning the structure of Bayesian network （BN） based on metric scoring, is introduced as an example that heavily relies on frequent counting. A fast calculation method for frequent counting enhanced with two cache layers is then presented for learning BN. The main contribution of our approach is to eliminate comparison operations for frequent counting by introducing a multi-radix number system calculation. Both mathematical analysis and empirical comparison between our method and state-of-the-art solution are conducted. The results show that our method is dominantly superior to state-of-the-art solution in solving the problem of learning BN.
As the semiconductor industry advances to nano-technology points, Network on Chip (NoC) components are becoming vulnerable to errors during the system operation. Consequently, fault-tolerant techniques for NoC are nee...
详细信息
We construct a general Verifiable Fully Homomorphic Encryption, using the existed Fully Homomorphic Encryption schemes. The main appeal of the scheme is the verifiability of Evaluate function. Its security and other p...
详细信息
Answer set programming (ASP) has become an important tool for knowledge representation and reasoning. Inconsistency processing in ASP provides a way for reasoning of inconsistent knowledge. In this paper, we present a...
详细信息
ISBN:
(纸本)9781849195379
Answer set programming (ASP) has become an important tool for knowledge representation and reasoning. Inconsistency processing in ASP provides a way for reasoning of inconsistent knowledge. In this paper, we present a minimal principle based method to process inconsistency in ASP. The method is able to ensure maximum retention of certain knowledge by removing the fewest defeasible rules preferentially. Then, we propose corresponding algorithms for simple logic programs and extended logic programs, and analyze the complexity of our method. After that, we compare this method with related work. Finally, we conclude and indicate the prospect of the further research.
A novel sliding mode control (SMC) method for indirect current controlled three-phase parallel active power filter is presented in this paper. There are two designed closed-loops in the system, one is the DC voltage c...
详细信息
YCH scheme is a multi-secret sharing scheme based on two-variable one-way function and Shamir's threshold secret sharing scheme,but the scheme does not have the property of *** paper presents a verifiable multi-se...
详细信息
YCH scheme is a multi-secret sharing scheme based on two-variable one-way function and Shamir's threshold secret sharing scheme,but the scheme does not have the property of *** paper presents a verifiable multi-secret sharing scheme based on YCH scheme,RSA cryptosystem,and Schnorr *** dose not need a secure channel and each participant chooses his secret shadow by himself,and it can defend positive attack of dealer and participants.
We introduce a new logic programming paradigm-answer set programming with uncertain facts (LPuF for short). A LPuF program is an extension of answer set programs (ASP for short). We first define the syntax of LPuF pro...
详细信息
In（k,m）-DOT~nScheme,the sender's privacy can not be guaranteed,even if the protocol itself is security,if we can not ensure that a receiver gets information from at most k *** Naor and Pinkas' s scheme,they ...
详细信息
In（k,m）-DOT~nScheme,the sender's privacy can not be guaranteed,even if the protocol itself is security,if we can not ensure that a receiver gets information from at most k *** Naor and Pinkas' s scheme,they give two solutions that are applicable for the case k>m/2,in Nikov et al.'s scheme,they avoid this problem by means of implementing a m-out-of-m access *** this paper,we put forward a settlement for arbitrary k,in which the receiver only can choose k servers to interactive and solve the problem getting the desired security.
Recommending suitable routes to taxi drivers for picking up passengers is helpful to raise their incomes and reduce the gasoline consumption. In this paper, a pick-up tree based route recommender system is proposed to...
详细信息
暂无评论