We present the design of pService system for P2P Web services discovery supporting similarity earch with its locality-preserving feature based on modified Skip Graph. In pService, the most important property (e.g. ser...
详细信息
Quantum secret sharing (QSS) which is based on the laws of quantum mechanics, instead of mathematical assumptions can share the information unconditionally securely, according to the form of sharing information, quant...
详细信息
Quantum secret sharing (QSS) which is based on the laws of quantum mechanics, instead of mathematical assumptions can share the information unconditionally securely, according to the form of sharing information, quantum secret sharing can be divided into QSS of classical messages and QSS of quantum information, QSS of classical messages can be divided into QSS of classical messages based on entanglement and QSS of classical messages without entanglement, the representative protocols in three main branches of the quantum secret sharing schemes and its latest development were introduced, also prospect analysis of the schemes' future development was given.
Support Vector Machine (SVM) is sensitive to noises and outliers. For reducing the effect of noises and outliers, we propose a novel SVM for suppressing error function. The error function is limited to the interval of...
详细信息
ISBN:
(纸本)9780769538877
Support Vector Machine (SVM) is sensitive to noises and outliers. For reducing the effect of noises and outliers, we propose a novel SVM for suppressing error function. The error function is limited to the interval of [0, 1]. The separation hypersurface is simplified and the margin of hypersurface is widened. Experimental results show that our proposed method is able to simultaneously increase the classification efficiency and the generalization ability of the SVM.
Insider attacks is a well-known problem acknowledged as a threat as early as 1980s. The threat is attributed to legitimate users who take advantage of familiarity with the computational environment and abuse their pri...
详细信息
Message total ordering is a critical part in active replication in order to maintain consistency among members in a fault tolerant group. The paper proposes a non-blocking message total ordering protocol (NBTOP) for...
详细信息
Message total ordering is a critical part in active replication in order to maintain consistency among members in a fault tolerant group. The paper proposes a non-blocking message total ordering protocol (NBTOP) for distributed systems. Non-blocking property refers to that the members in a fault tolerant group keep on running independently without waiting for installing the same group view when a fault tolerant group evolves even when decision messages collide. NBTOP takes advantage of token ring as its logical control way. Members adopt re-requesting mechanism (RR) to obtain their lost decisions. Forward acknowledgement mechanism (FA) is put forth to solve decision collisions. The paper further proves that NBTOP satisfies the properties of total order, agreement, and termination. NBTOP is implemented, and its performance test is done. Comparing with the performance of Totem, the results show that NBTOP has a better total ordering delay. It manifests that non-blocking property helps to improve protocol efficiency.
A link analysis model for passive UHF RFID system in LOS indoor environment is developed and demonstrated. Using this model, the power received by tag and the read performance are investigated. The multipath fading an...
详细信息
Digital airborne cameras play a significant role for aerial Photogrammetry development from analog to full-digital age. Because of the gap between digital sensor performance and Photogrammetry request, digital airborn...
详细信息
To estimate the trust value in P2P networks, an autonomous trust mode based on both direct experiences and recommendations is proposed, in which the recommendation synthetic coefficients are decided by the trustor'...
详细信息
To estimate the trust value in P2P networks, an autonomous trust mode based on both direct experiences and recommendations is proposed, in which the recommendation synthetic coefficients are decided by the trustor's trust on the recommendation subscribers. Both the direct trust and the recommendation trust are attenuated with time intervals. The corresponding data structure and an iterative computational method are given.
It is essential to ensure that sensors can determine their location for wireless sensor networks. However, most of existing location discovery protocols became vulnerable in the presence of malicious attacks. So the a...
详细信息
It is essential to ensure that sensors can determine their location for wireless sensor networks. However, most of existing location discovery protocols became vulnerable in the presence of malicious attacks. So the authors presented an attack-tolerant node localization algorithm called AtLoc. In AtLoc, a least safe reference set was randomly built up according to the unbiased estimation of variance. Based on this, prediction residual of the least safe reference set was used to stepwise diagnose the remained references were abnormal or not, which significantly enhanced the resilience of localization system against attacks. Finally, the authors provided theoretical analysis and simulations to evaluate the proposed techniques.
To make the agents negotiate more efficiently in multi-lateral multi-issue negotiation in multi-agent based competitive e-commerce, an agent negotiation model in competitive environment is presented, and the Adaptive ...
详细信息
To make the agents negotiate more efficiently in multi-lateral multi-issue negotiation in multi-agent based competitive e-commerce, an agent negotiation model in competitive environment is presented, and the Adaptive Genetic Algorithm (AGA) is applied to the model to enhance the negotiation efficiency. In the experiments, two kinds of genetic algorithms are used to compare with, they are Standard Genetic Algorithm (SGA) and AGA. After 1000 times of experiments for the two kinds of agents to gain the satisfying result, SGA averagely needs negotiation of 183 runs, while the AGA averagely needs only 152 runs. The experiment results show that the AGA can gain the satisfying negotiation result more efficiently than SGA in competitive multi-lateral multi-issue negotiation.
暂无评论