Browsing by Author "Ying Mingsheng"

UTSePress Research/Manakin Repository

Search UTSePress Research

Browse

My Account

Browsing by Author "Ying Mingsheng"

Sort by: Order: Results:

  • Additive Models Of Probabilistic Processes 
    Ying Mingsheng (Elsevier Science Bv, 2002)
    We propose a new model of probabilistic processes. In this model, a probability is assigned to the action of a prefix and a probability distribution is assigned to the components of a parallel composition. In addition, the ...
  • An ADL-Approach to Specifying and Analyzing Centralized-Mode Architectural Connection 
    Su Guo Xin; Ying Mingsheng; Zhang Chengqi (Springer-Verlag Berlin Heidelberg, 2010)
    A rigorous paradigm coordinating components is important in the design stage of large-scale software engineering. In this paper we propose a new Architecture Description Language, called ACDL, to represent the centralized-mode ...
  • An Algebraic Language For Distributed Quantum Computing 
    Ying Mingsheng; Feng Yuan (Institute Of Electrical And Electronics Engineers, 2009)
    NA
  • An Algebra Of Quantum Processes 
    Ying Mingsheng; Feng Yuan; Duan Runyao; Ji Zhengfeng (Association For Computing Machinery, 2009)
    NA
  • The Alternativity Measures Of Fuzzy-Sets 
    Ying Mingsheng (Elsevier Science Bv, 1990)
    NA
  • Ancilla-Assisted Discrimination Of Quantum Gates 
    Chen Jianxin; Ying Mingsheng (Rinton Press, Inc, 2008)
    The intrinsic idea of superdense coding is to find as many gates as possible such that they can be perfectly discriminated. In this paper, we consider a basic scheme of discrimination of quantum gates, called ancilla-assisted ...
  • Ancilla-assisted discrimination of quantum gates 
    Chen Jianxin; Ying Mingsheng (Rinton Press, 2008)
    The intrinsic idea of superdense coding is to find as many gates as possible such that they can be perfectly discriminated. In this paper, we consider a new scheme of discrimination of quantum gates, called ancilla-assisted ...
  • Any 2 Circle Times N Subspace Is Locally Distinguishable 
    Yu Nk; Duan Runyao; Ying Mingsheng (Amer Physical Soc, 2011)
    A subspace of a multipartite Hilbert space is said to be locally indistinguishable if any orthonormal basis of this subspace cannot be perfectly distinguished by local operations and classical communication. Previously it ...
  • Approximate Reasoning Based On Similarity 
    Biacino L; Gerla G; Ying Mingsheng (Wiley-V C H Verlag Gmbh, 2000)
    The connection between similarity logic and the theory of closure operators is examined. Indeed one proves that the consequence relation defined in [14] can be obtained by composing two closure operators and that the ...
  • Approximate Reasoning With Linguistic Modifiers 
    Ying Mingsheng; Bouchon-Meunier Bernadette (John Wiley & Sons Inc, 1998)
    We analyze the influence of some usual linguistic modifiers, such as scalar product, normalization, Bouchon-Meunier modifiers, perturbation, and (weakening and reinforcement) power, in the process of approximate reasoning ...
  • Automata Theory Based On Quantum Logic. (I) 
    Ying Mingsheng (Kluwer Academic/Plenum Publ, 2000)
    We present a basic Framework of automats theory based on quantum logic. In particular, we introduce the orthomodular lattice-valued (quantum) predicate of recognizability and establish some of its fundamental properties.
  • Automata Theory Based On Quantum Logic Ii 
    Ying Mingsheng (Kluwer Academic/Plenum Publ, 2000)
    We establish the pumping lemma in automata theory based on quantum logic under certain conditions on implication, and discuss the recognizability by the product and union of orthomodular lattice-valued (quantum) automata. ...
  • Bisimulation for Quantum Processes 
    Feng Yuan; Duan Runyao; Ying Mingsheng (ACM, 2011)
    Quantum cryptographic systems have been commercially available, with a striking advantage over classical systems that their security and ability to detect the presence of eavesdropping are provable based on the principles ...
  • Bisimulation Indexes And Their Applications 
    Ying Mingsheng (Elsevier Science Bv, 2002)
    Bisimulation expresses the equivalence of processes whose external actions are identical. Sometimes we may meet two processes which are not exactly bisimilar but more or less bisimilar in the sense that whenever a process ...
  • Boundary Effect Of Deterministic Dense Coding 
    Ji Zhengfeng; Feng Yuan; Duan Runyao; Ying Mingsheng (American Physical Soc, 2006)
    We present a rigorous proof of an interesting boundary effect of deterministic dense coding first observed by S. Mozes, J. Oppenheim, and B. Reznik [Phys. Rev. A 71, 012311 (2005)]. Namely, it is shown that d(2)-1 cannot ...
  • Catalyst-Assisted Probabilistic Entanglement Transformation 
    Feng Yuan; Duan Runyao; Ying Mingsheng (IEEE-Inst Electrical Electronics Engineers Inc, 2005)
    We are concerned with catalyst-assisted probabilistic entanglement transformations. A necessary and sufficient condition is presented under which there exist partial catalysts that can increase the maximal transforming ...
  • Characterizations Of Quantum Automata 
    Qiu Daowen; Ying Mingsheng (Elsevier Science Bv, 2004)
    We define q quantum finite automata (qQFAs) and q quantum regular grammars (qQRGs), and verify that they are exactly equivalent to those measure-once quantum finite automata (MO-QFAs) in the literature. In particular, we ...
  • Commutativity Of Quantum Weakest Preconditions 
    Ying Mingsheng; Chen J; Feng Yuan; Duan Runyao (Elsevier Science Bv, 2007)
    The notion of quantum weakest precondition was introduced by D'Hondt and P. Panangaden [E. D'Hondt, P. Panangaden, Quantum weakest preconditions, Mathematical Structures in Computer Science 16 (2006) 429-451], and they ...
  • Compactness In Fuzzifying Topology 
    Ying Mingsheng (Elsevier Science Bv, 1993)
    We introduce the concept of compactness and establish a generalization of Tychonoff's theorem in the framework of fuzzifying topology.
  • Compactness In Fuzzy Logic 
    Ying Mingsheng (Science Press, 1998)
    Compactness in Pavelka's fuzzy logic for some compact lattices of truth values is shown, and the concept of gradual compactness is introduced to establish some corresponding results in a more general setting.