Browsing by Author "Lin, WD"

Now showing 1 - 5 of 5

A general construction for nonblocking crosstalk-free photonic switching networks
(2003-08-01)
Hwang, FK
;
Lin, WD
;
應用數學系
;
Department of Applied Mathematics
The graph representation G(M) of a multistage switching network M is well known. Lea [IEEE Trans Commun 38 (1990), 529-538] observed that link-disjoint paths in M correspond to node-disjoint paths in G(M). He proposed G(M) as a network by treating nodes as crossbars to transfer the node-disjoint property to the crosstalk-free property essential for photonic networks using directional couplers as components. However, such a network has its peculiarities and is not commonly used. In this paper, we will show how to take advantage of this correspondence to construct nonblocking crosstalk-free networks using the vertical stacking method. Our construction simplifies the proofs of many existing results, as well as establishing some new results. (C) 2003 Wiley Periodicals, Inc.
A general construction for nonblocking crosstalk-free photonic switching networks
(2001)
Hwang, FK
;
Lin, WD
;
應用數學系
;
Department of Applied Mathematics
The graph representation G(M) of a multistage network M is well-known. Lea observed that link-disjoint paths in M correspond to node-disjoint paths in G(M). He proposed G(M) as a network by treating nodes as crossbars to transfer the node-disjoint property to the corsstalk-free property essential for photonic net-works using directional couplers as components. However, such a network has its peculiarities and is not the commonly used type. In this paper we use the same principle to establish the crosstalk-free property for the popular Log(2)(N,k,p) network.
Comments on "Reliability and component importance of a consecutive-k-out-of-n system" by Zuo
(2000-06-01)
Hwang, FK
;
Cui, LR
;
Chang, JC
;
Lin, WD
;
應用數學系
Zuo claimed that the comparison of Birnbaum importance between two components for a consecutive-k-out-of-n:G system is the same as that for the F-system. We show that this is not the case and give a correct relation between the two systems. (C) 2000 Elsevier Science Ltd. All rights reserved.
Necessary and sufficient conditions for rearrangeable Log(d) (N, m, p)
(2005-12-01)
Hwang, FK
;
Lin, WD
;
應用數學系
;
Department of Applied Mathematics
We extend previous results on sufficient conditions for rearrangeable Log(2) (N, m, p) networks to Log(d) (N, m, p) networks. We show that the original argument using path-intersecting graphs cannot be extended to d > 2, and we give a new argument. Further, we show our sufficient conditions are also necessary.
The incremental group testing model for gap closing in sequencing long molecules
(2003-12-01)
Hwang, FK
;
Lin, WD
;
應用數學系
;
Department of Applied Mathematics
In this paper, we propose the incremental group testing model for the gap closing problem, which assumes that we can tell the difference between the outcome of testing a subset S, and the outcome of testing Sboolean OR{x}. We also give improvements over currently best results in literature for some other models.