Skip to main content

previous disabled Page of 145
and
  1. No Access

    Chapter and Conference Paper

    A new routing scheme for concatenating two omega networks

    A new routing scheme for concatenating two omega networks is presented. Routing the 2log 2 N-stage concatenated network has been an open problem for decades, and no clear solution has yet been proposed. It was sh...

    Seung-Woo Seo, Tse-yun Feng in PARLE'94 Parallel Architectures and Languages Europe (1994)

  2. No Access

    Chapter and Conference Paper

    A dynamic task allocation scheme in Beneš-type nonblocking networks

    Due to the uniqueness of a path between a pair of input/output terminals in cube-type networks, conflicts in the network are the main bottleneck in the performance of a highly-parallel multiprocessor system. In o...

    Tse-yun Feng, Yanggon Kim in High-Performance Computing and Networking (1994)

  3. No Access

    Chapter and Conference Paper

    Distributed Linda tuplespace algorithms and implementations

    Linda, a general purpose coordination language, has been used to make a language parallel. Based on a logically shared tuplespace, Linda poses difficulties to be efficiently implemented on a distributed multip...

    M. D. Feng, Y. Q. Gao, C. K. Yuen in Parallel Processing: CONPAR 94 — VAPP VI (1994)

  4. No Access

    Chapter and Conference Paper

    An application of the saturated attractor analysis to three typical models

    The saturated attractor analysis, an approach proposed first in [FP] for a comprehensive study of the dynamics of the Linsker model and then successfully applied to the dynamic link model[FT1], is further deve...

    J. Feng, B. Tirozzi in From Natural to Artificial Neural Computation (1995)

  5. No Access

    Chapter and Conference Paper

    Broadcasting in hypercubes with randomly distributed Byzantine faults

    We study all-to-all broadcasting in hypercubes with randomly distributed Byzantine faults. We construct an efficient broadcasting scheme BC1-n-cube running on the n-dimensional hypercube (n-cube for short) in 2n ...

    Feng Bao, Yoshihide Igarashi, Keiko Katano in Distributed Algorithms (1995)

  6. Chapter

    A Diffusion Cell Loss Estimate for ATM with Multiclass Bursty Traffic

    We describe a diffusion approximation model for an ATM statistical multiplexer using the instantaneous return model approach (Gelenbe, 1975). Two Cell Loss Estimates are proposed for multiclass traffic. Our ai...

    Erol Gelenbe, **aowen Mang, Yutao Feng in ATM Networks (1996)

  7. No Access

    Chapter and Conference Paper

    Broadcasting in star graphs with Byzantine failures

    We study broadcasting in star graphs containing faulty nodes and/or edges of the Byzantine type. We propose a single-port broadcasting scheme that tolerates up to ⌊n−3d−1/2⌋ Byzantine failures in the n-star graph...

    Yukihiro Hamada, Aohan Mei, Feng Bao in Concurrency and Parallelism, Programming, … (1996)

  8. No Access

    Chapter and Conference Paper

    A new subgraph of minimum weight triangulations

    In this paper, two sufficient conditions for identifying a subgraph of minimum weight triangulation of a planar point set are presented. These conditions are based on local geometric properties of an identifyi...

    Cao An Wang, Francis Chin, Yin-Feng Xu in Algorithms and Computation (1996)

  9. No Access

    Chapter and Conference Paper

    Optimal time broadcasting in faulty star networks

    This paper investigates fault-tolerant broadcasting in star networks. We propose a non-adaptive single-port broadcasting scheme in the n-star network such that it tolerates n — 2 faults in the worst case and comp...

    Aohan Mei, Feng Bao, Yukihiro Hamada, Yoshihide Igarashi in Distributed Algorithms (1996)

  10. No Access

    Chapter

    NCL: A Common Language for Achieving Rule-Based Interoperability among Heterogeneous Systems

    For achieving interoperability among heterogeneous computing systems, the Object Management Group (OMG) has adapted the Common Object Request Broker Architecture (CORBA) and the use of an Interface Definition ...

    Stanley Y. W. Su, Herman Lam, Tsae-Feng Yu in Intelligent Integration of Information (1996)

  11. No Access

    Article

    A customer-to-carrier interface for trouble administration

    This paper describes a customer-to-carrier trouble administration service based on the Network Management Forum (NMF) service management concept. Implementing a trouble administration gateway for direct on-lin...

    Elizabeth D. Zeisler, Dan Bolton, Adrian Tang in Journal of Network and Systems Management (1996)

  12. No Access

    Book

  13. No Access

    Chapter and Conference Paper

    A multiplication-addition structure against differential attack

    This paper presents a multiplication-addition structure in finite field that can be used in constructing round fimction F of the Generalized DES-like iterated cipher to strengthen ability against the different...

    Feng Zhu, Bao-An Guo in Information and Communications Security (1997)

  14. No Access

    Chapter and Conference Paper

    Design and analyses of two basic protocols for use in TTP-based Key escrow

    In this paper, we study two basic protocols which are important in realizing TTP-based key escrow systems. A TTP-based key escrow system was studied in [3] under the scenario of multiple domains (e.g., countri...

    Feng Bao, Robert Deng, Yongfei Han, Albert Jeng in Information Security and Privacy (1997)

  15. No Access

    Chapter and Conference Paper

    Viewing a class of neurodynamics on parameter space

    Nearly all models in neural networks start from the assumption that the input-output characteristic is a sigmoidal function. On parameter space we present a systematic and feasible method for analyzing the who...

    Jianfeng Feng, David Brown in Biological and Artificial Computation: Fro… (1997)

  16. No Access

    Chapter and Conference Paper

    RSA-type signatures in the presence of transient faults

    In this paper, we show that the presence of transient faults can leak some secret information. We prove that only one faulty RSA-signature is needed to recover one bit of the secret key. Thereafter, we extend ...

    Marc Joye, Jean-Jacques Quisquater, Feng Bao, Robert H. Deng in Crytography and Coding (1997)

  17. No Access

    Article

    An optimal bandwidth allocation strategy for the delivery of compressed prerecorded video

    The transportation of prerecorded, compressed video data without loss of picture quality requires the network and video servers to support large fluctuations in bandwidth requirements. Fully utilizing a c...

    Wu-chi Feng, Farnam Jahanian, Stuart Sechrest in Multimedia Systems (1997)

  18. Chapter

    A Manufacturing Planning and Execution Software Integration Architecture

    Process planning and manufacturing execution are two major functions in a product development cycle. Industries require these functions to be able to plug and play with other related manufacturing applications...

    S. C. Feng, Y. Zhang in Globalization of Manufacturing in the Digi… (1998)

  19. No Access

    Chapter and Conference Paper

    Detection of Races and Control-Flow Nondeterminism

    When either of two concurrent accesses of the same data is not in its critical section, a “race condition” occurs. Previous race-detection techniques are only applicable to parallel programs without using crit...

    Mingdong Feng, Chung Kwong Yuen in Languages, Compilers, and Run-Time Systems… (1998)

  20. No Access

    Chapter and Conference Paper

    A signcryption scheme with signature directly verifiable by public key

    Signcryption, first proposed by Zheng [4, 5], is a cryptographic primitive which combines both the functions of digital signature and public key encryption in a logical single step, and with a computational co...

    Feng Bao, Robert H. Deng in Public Key Cryptography (1998)

previous disabled Page of 145