Browsing by Author "Hsu, LY"
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Item type:Item, Generalized honeycomb torus(2003-05-31) ;Cho, HJ ;Hsu, LY ;運輸與物流管理系 註:原交通所+運管所Department of Transportation and Logistics ManagementStojmenovic introduced three different honeycomb tori by adding wraparound edges on honeycomb meshes, namely honeycomb rectangular torus, honeycomb rhombic torus, and honeycomb hexagonal torus. These honeycomb tori have been recognized as an attractive alternative to existing torus interconnection networks in parallel and distributed applications. In this paper, we propose generalized honeycomb tori. The three different honeycomb tori proposed by Stojmenovic are proved to be special cases of our proposed generalized honeycomb tori. We also discuss the Hamiltonian property of some generalized honeycomb tori. (C) 2003 Published by Elsevier Science B.V.Item type:Item, Quantum secret sharing using product states(2005-02-01) ;Hsu, LY ;Li, CM ;電子物理學系Department of ElectrophysicsThis study proposes quantum secret sharing protocols using product states. The first two protocols adopt the quantum key distribution protocol using product states [Guo Phys. Rev. A 64, 042301 (2001)]. In these two protocols, the sender does not reveal any information about the qutrits until confirming that each receiver has received a qutrit. This study also considers the security and some possible eavesdropping strategies. In the third proposed protocol, three-level Bell states are exploited for qutrit preparation via nonlocality swapping.Item type:Item, Ring embedding in faulty honeycomb rectangular torus(2002-12-16) ;Cho, HJ ;Hsu, LY ;運輸與物流管理系 註:原交通所+運管所Department of Transportation and Logistics ManagementAssume that m and n are positive even integers with n greater than or equal to 4. The honeycomb rectangular torus HReT(m,n) is recognized as another attractive alternative to existing torus interconnection networks in parallel and distributed applications. It is known that any HReT(m, n) is a 3-regular bipartite graph. We prove that any HReT(m, n) - e is hamiltonian for any edge e is an element of E(HReT(m, n)). Moreover, any HReT(m, n) - F is hamiltonian for any F = {a, b} with a is an element of A and b is an element of B where A and B are the bipartition of HReT(m, n), if n greater than or equal to 6 or m = 2. (C) 2002 Elsevier Science B.V. All rights reserved.