arXiv subjects

Qiaoyan Wen

Publications and source records attributed to Qiaoyan Wen.

30 records · Page 2Linked to original sources

arXiv2012

Operations on soft sets revisited

Soft sets, as a mathematical tool for dealing with uncertainty, have recently gained considerable attention, including some successful applications in information processing, decision, demand analysis, and forecasting. To construct new soft sets from given soft sets, some operations on soft sets have been proposed. Unfortunately, such operations cannot keep all classical set-theoretic laws true for soft sets. In this paper, we redefine the intersection, complement, and difference of soft sets and investigate the algebraic properties of these operations along with a known union operation. We find that the new operation system on soft sets inherits all basic properties of operations on classical sets, which justifies our definitions.

cs.AI↗

arXiv2011

Information-theoretic measures associated with rough set approximations

Although some information-theoretic measures of uncertainty or granularity have been proposed in rough set theory, these measures are only dependent on the underlying partition and the cardinality of the universe, independent of the lower and upper approximations. It seems somewhat unreasonable since the basic idea of rough set theory aims at describing vague concepts by the lower and upper approximations. In this paper, we thus define new information-theoretic entropy and co-entropy functions associated to the partition and the approximations to measure the uncertainty and granularity of an approximation space. After introducing the novel notions of entropy and co-entropy, we then examine their properties. In particular, we discuss the relationship of co-entropies between different universes. The theoretical development is accompanied by illustrative numerical examples.

cs.AI↗

arXiv2010

A note on communicating between information systems based on including degrees

In order to study the communication between information systems, Gong and Xiao [Z. Gong and Z. Xiao, Communicating between information systems based on including degrees, International Journal of General Systems 39 (2010) 189--206] proposed the concept of general relation mappings based on including degrees. Some properties and the extension for fuzzy information systems of the general relation mappings have been investigated there. In this paper, we point out by counterexamples that several assertions (Lemma 3.1, Lemma 3.2, Theorem 4.1, and Theorem 4.3) in the aforementioned work are not true in general.

cs.AI↗

arXiv2010

Some improved results on communication between information systems

To study the communication between information systems, Wang et al. [C. Wang, C. Wu, D. Chen, Q. Hu, and C. Wu, Communicating between information systems, Information Sciences 178 (2008) 3228-3239] proposed two concepts of type-1 and type-2 consistent functions. Some properties of such functions and induced relation mappings have been investigated there. In this paper, we provide an improvement of the aforementioned work by disclosing the symmetric relationship between type-1 and type-2 consistent functions. We present more properties of consistent functions and induced relation mappings and improve upon several deficient assertions in the original work. In particular, we unify and extend type-1 and type-2 consistent functions into the so-called neighborhood-consistent functions. This provides a convenient means for studying the communication between information systems based on various neighborhoods.

cs.AI↗

arXiv2010

Homomorphisms between fuzzy information systems revisited

Recently, Wang et al. discussed the properties of fuzzy information systems under homomorphisms in the paper [C. Wang, D. Chen, L. Zhu, Homomorphisms between fuzzy information systems, Applied Mathematics Letters 22 (2009) 1045-1050], where homomorphisms are based upon the concepts of consistent functions and fuzzy relation mappings. In this paper, we classify consistent functions as predecessor-consistent and successor-consistent, and then proceed to present more properties of consistent functions. In addition, we improve some characterizations of fuzzy relation mappings provided by Wang et al.

cs.AI↗

arXiv2005

Quantum key distribution without alternative measurements and rotations

A quantum key distribution protocol based on entanglement swapping is proposed. Through choosing particles by twos from the sequence and performing Bell measurements, two communicators can detect eavesdropping and obtain the secure key. Because the two particles measured together are selected out randomly, we need neither alternative measurements nor rotations of the Bell states to obtain security.

quant-ph↗

arXiv2005

On the information-splitting essence of two types of quantum key distribution protocols

With the help of a simple quantum key distribution (QKD) scheme, we discuss the relation between BB84-type protocols and two-step-type ones. It is shown that they have the same essence, i.e., information-splitting. More specifically, the similarity between them includes (1) the carrier state is split into two parts which will be sent one by one; (2) the possible states of each quantum part are indistinguishable; (3) anyone who obtains both parts can recover the initial carrier state and then distinguish it from several possible states. This result is useful for related scheme designing and security analyzing.

quant-ph↗

arXiv2005

Comment on "A Random Quantum Key Distribution Achieved by Using Bell States"

In a recent paper [J. Opt. B: Quantum Semiclass. Opt. 5 (2003) 155-157], a quantum key distribution scheme based on entanglement swapping was proposed, which exhibited two improvements over the previous protocols. In this Comment, it is shown that the scheme has no properties as been discussed.

quant-ph↗

arXiv2005

Comment on "Quantum key distribution via quantum encryption"

In the paper [Zhang, Li and Guo, Phys. Rev. A 64, 024302 (2001)], a quantum key distribution protocol based on quantum encryption was proposed, in which the quantum key can be reused. However, it is shown that, if Eve employs a special strategy to attack, this protocol becomes insecure because of the reused quantum key. That is, Eve can elicit partial information about the key bits without being detected. Finally, a possible improvement of the Zhang-Li-Guo protocol is proposed.

quant-ph↗

arXiv2005

Comment on "Quantum secret sharing based on reusable Greenberger-Horne-Zeilinger states as secure carriers" [Phys. Rev. A 67, 044302 (2003)]

In a recent paper [S. Bagherinezhad and V. Karimipour, Phys. Rev. A 67, 044302 (2003)], a quantum secret sharing protocol based on reusable GHZ states was proposed. However, in this Comment, it is shown that this protocol is insecure if Eve employs a special strategy to attack.

quant-ph↗

arXiv2005

Comment on "Quantum key distribution for d-level systems with generalized Bell states" [Phys. Rev. A 65, 052331 (2002)]

In the paper [Phys. Rev. A 65, 052331(2002)], an entanglement-based quantum key distribution protocol for d-level systems was proposed. However, in this Comment, it is shown that this protocol is insecure for a special attack strategy.

quant-ph↗

arXiv2004

A quantum key distribution and identification protocol based on entanglement swapping

A quantum key distribution and identification protocol is proposed, which is based on entanglement swapping. Through choosing particles by twos from the sequence and performing Bell measurements, two communicators can detect eavesdropping, identify each other and obtain the secure key according to the measurement results. Because the two particles measured together are selected out randomly, we need neither alternative measurements nor rotation of the Bell states. Furthermore, less Bell measurements are needed in our protocol than in the previous similar ones.

quant-ph↗