Qin Zheng

A quasi quantum secure direct communication protocol with authentication

The quantum communication is a new-style communication scheme based on quantum mechanics. It arouses much interest recently. In this paper, a novel quantum secure communication protocol is proposed. This is a quasi quantum secure direct communication protocol, since it closely unites the quantum key distribution and the classical communication. In the protocol, a key is distributed between both parties participating in communication using EPR pairs, the secret message is sent through classical public channel and the both are closely combined. The protocol applies a braid-based key agreement protocol to let both parties share a secret random number, whose size and magnitude are undecided in advance. It is used to perform all the authentications of the communication. So the communication is simplified. The security of the proposed protocol is based on the no-cloning theorem and the fact that the p-th root finding problem on braid groups is intractable even on quantum computers, as well as classical computers.

Mobile agent oriented architecture to build open mobile electronic commerce system

With the increasing number of mobile users, providing mobility and customized services has become a new trend of the development of e-commerce. These applications can collectively be termed mobile e-commerce. To allow users and developers to strategize and effectively implement mobile e-commerce, we propose a 5-level integrated architecture for mobile e-commerce based on mobile agents. Then, mobile e-commerce workflow based on the pattern of B2C is illustrated and related facilitating technologies are discussed. Finally, some key technologies of implementation are analyzed using advanced Java2 technologies.

A formal approach to distributed software architecture

Software architectures shift the focus of developers from lines-of-code to coarser-grained architectural elements and their overall interconnection structure. Architecture description languages (ADL) have been proposed as modeling notations to support architecture-based development. There are, however, many features of the distributed software which make the development methods of distributed software quite different from the traditional ways. Furthermore, the, traditional centralized ways with fixed interfaces are unable to adapt to the flexible requirements of distributed software. Our goal is to provide some solutions to these problems. In this paper, the AG (which stands for attributed grammar) is first extended to refine the characters of distributed software, and then we define a BNF expression to describe the architecture of a distributed software.

Blind adaptive distributed decorrelating detector for DS-CDMA systems

A blind adaptive distributed decorrelating detector is proposed for DS-CDMA system in both additive white Gaussian noise and fading channels in. this paper. It combines spatial diversity and decorrelating detection. The performance of decorrelating detector do not depend on the other users energies and the other users fading characteristics. The blind adaptive diversity-combining scheme based on stochastic gradient techniques is formulated using optimal likelihood ratio testing criterion, and its performance is evaluated in numerical examples, and compared with that of the other combining schemes. The proposed method is suitable for real-time implementation and can provide a significant receiver performance and system capacity gain.

An Efficient Active Bayes Classifier Using Affinity Propagation on Unlabeled Data

When the labeled data are few, exploiting amount of unlabeled data can be helpful for improve learning performance of classifier. The key issue for active learning to solve is how to select the most ”valuable” training samples to reduce labeled cost of amount of unlabeled samples. In the paper, we propose an efficient active Bayes classifier by using Affinity Propagation (AP) to select the most valuable samples on the unlabeled data sets. Firstly, the method clusters amount of unlabeled sample data by using AP algorithm. Secondly, through exemplars obtained from the results of cluster and similarity matrix, the method selects the unlabeled samples for experts to label. The method choose two kinds of most valuable instances to label: one is cluster center instance, which also called exemplar instance. Another is the instance which stays in the farthest position to the cluster center in the same cluster, that is, the sample which sets in the nearest position to the cluster boundary. The experiment results on UCI data sets demonstrate that our method is simple and more efficient compared with traditional active learning method.

Escape probability based routing for ad hoc networks

Abstract Routes in an ad hoc network may fail frequently because of node mobility. Stability therefore can be an important element in the design of routing protocols. The node escape probability is introduced to estimate the lifetime and stability of link between neighboring nodes and the escape probability based routing (EPBR) scheme to discover stable routes is proposed. Simulation results show that the EPBR can discover stable routes to reduce the number of route rediscovery, and is applicable for the situation that has highly dynamic network topology with broad area of communication.