Skip to main content

previous disabled Page of 639
and
  1. No Access

    Chapter and Conference Paper

    MPS-an experimental multi-microprocessor based parallel system

    This paper introduces an experimental tightly-coupled multi-microprocessor system (MPS) for parallel processing. An overview of hardware architecture is given and a simple example of algorithm run on MPS is us...

    Gu Qing Zuo, An Zhong Wang in CONPAR 90 — VAPP IV (1990)

  2. No Access

    Chapter and Conference Paper

    Specifying Processes in Terms of Their Environments

    A simple approach to specification and verification of processes is suggested. Instead of process equivalence as usual in process algebra, the correctness of an implementation w.r.t a specification is determined ...

    Wang Yi in Specification and Verification of Concurrent Systems (1990)

  3. Chapter and Conference Paper

    Linear Complexity Profiles and Continued Fractions

    The linear complexity, \( \mathcal{L} \) (sn), of a sequence sn is defined as the length of the shortest linear feedba...

    Muzhong Wang in Advances in Cryptology — EUROCRYPT ’89 (1990)

  4. No Access

    Chapter and Conference Paper

    Prelude: A system for portable parallel software

    William Weihl, Eric Brewer, Adrian Colbrook in PARLE '92 Parallel Architectures and Langu… (1992)

  5. No Access

    Chapter and Conference Paper

    Choice coordination with multiple alternatives (preliminary version)

    The Choice Coordination Problem with k alternatives (k-CCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processes which causes all correct processes to a...

    David S. Greenberg, Gadi Taubenfeld, Da-Wei Wang in Distributed Algorithms (1992)

  6. Chapter and Conference Paper

    The development and testing of the identity-based conference key distribution system for the RHODOS distributed system

    In this paper, we demonstrate that it is possible to develop an authentication service as an integral part of a distributed operating system, subject to some requirements and extensions to the original Koyama-...

    Michael Wang, Andrzej Goscinski in Computer Security — ESORICS 92 (1992)

  7. No Access

    Chapter and Conference Paper

    Optimal map**s of m dimensional FFT communication to k dimensional mesh for arbitrary m and k

    The FFT communication patterns are important to not only FFT algorithms, but also many other algorithms over one or higher dimensional. The map** of m dimensional FFT communication to k dimensional mesh has pre...

    Z. George Mou, **ao**g Wang in PARLE '93 Parallel Architectures and Languages Europe (1993)

  8. No Access

    Chapter and Conference Paper

    A unified framework for multicast forwarding

    This paper examines the issues of implementation and integration in multicast. A framework for multicast forwarding is presented, which separates multicast forwarding from any associated protocols that may aff...

    Zheng Wang, Jon Crowcroft in Network and Operating System Support for D… (1994)

  9. Chapter and Conference Paper

    On the Matsumoto and Imai’s Human Identification Scheme

    At Eurocrypt'91, Matsumoto and Imai presented a human identification scheme for insecure channels, which is suitable for human ability of memorizing and processing a short secret. It prevents an in- truder fro...

    Chih-Hung Wang, Tzonelih Hwang, Jiun-Jang Tsai in Advances in Cryptology — EUROCRYPT ’95 (1995)

  10. Chapter

    D-BMAP Models for Performance Evaluation of ATM Networks

    The fixed cell size used in ATM networks naturally leads to the use of discrete-time models for performance evaluation. In this paper, we describe our work on estimating network performance based on Discrete-time...

    John A. Silvester, Nelson L. S. Fonseca in Performance Modelling and Evaluation of AT… (1995)

  11. Chapter and Conference Paper

    Uppaal in 1995

    Uppaal is a tool suite for automatic verification of safety and bounded liveness properties of real-time systems modeled as networks of timed automata [12, 9, 4], developed during the past two year...

    Johan Bengtsson, Kim G. Larsen in Tools and Algorithms for the Construction … (1996)

  12. No Access

    Chapter and Conference Paper

    The secure conferencing user agent A tool to provide secure conferencing with Mbone multimedia conferencing applications

    This report briefly describes the Secure Conferencing User Agent (SCUA), which provides secure conferencing with privacy and authentication. The SCUA was implemented using the MICE multimedia conferencing appl...

    Elfriede Hinsch, Anne Jaegemann in Interactive Distributed Multimedia Systems… (1996)

  13. No Access

    Chapter and Conference Paper

    A group-oriented (t, n) undeniable signature scheme without trusted center

    We shall propose a new group-oriented undeniable signature scheme without the assistance of any trusted center in this paper. A single group public key, instead of all public keys of individual members, is use...

    Chu-Hsing Lin, Ching-Te Wang, Chin-Chen Chang in Information Security and Privacy (1996)

  14. 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)

  15. No Access

    Chapter and Conference Paper

    A novel associative network accommodating pattern deformation

    In this paper we propose a novel associative network model which is able to associate a pattern with deformed versions of itself. The model is composed of a set of logical units (viewed as a set of marbles) and a...

    Hui Wang, David Bell in Artificial Neural Networks — ICANN'97 (1997)

  16. No Access

    Chapter and Conference Paper

    Optimal algorithms for circle partitioning

    Given a set of n points F on a circle and an integer k, we would like to find a size k subset of F such that these points are “evenly distributed” on the circle. We define two different criteria to capture the in...

    Kuo-Hui Tsai, Da-Wei Wang in Computing and Combinatorics (1997)

  17. No Access

    Chapter and Conference Paper

    Fixed topology steiner trees and spanning forests with applications in network communications

    We present pseudo-polynomial time algorithms for fixed topology Steiner tree problems with various time-delay constraints. We study the spanning forest problem with bandwidth constraint. A polynomial-time algo...

    Lusheng Wang, **aohua Jia in Computing and Combinatorics (1997)

  18. No Access

    Chapter and Conference Paper

    A new type of unsupervised growing neural network for biological sequence classification that adopts the topology of a phylogenetic tree

    We propose a new type of unsupervised growing self-organizing neural network that expands itself following the taxonomic relationships existing among the sequences being classified. The binary tree topology of...

    Joaquín Dopazo, Huaichun Wang in Biological and Artificial Computation: Fro… (1997)

  19. Chapter

    Development of an ETSI Standard for Phase-2 GSM/DCS Mobile Terminal Conformance Testing

    The European Telecommunications Standards Institute (ETSI) is responsible for the production and publication of telecommunications standards in Europe and the marketing of these standards world-wide. The ETSI ...

    Hu, Wattelet, Prof. Wang in Testing of Communicating Systems (1997)

  20. No Access

    Chapter and Conference Paper

    Interactive multimedia communications at the presentation layer

    A main feature of the next generation's computing software is supporting convenient user interactions. Interactive multimedia presentations that are executed in distributed environments raise some new computer...

    Chung-Ming Huang, Chian Wang in Interactive Distributed Multimedia Systems… (1997)

previous disabled Page of 639