16,363 Result(s)
within
English
Computer Science
Computer Communication Networks
**mo Wang
-
Article
Some modifications of the parallel Halley iteration method and their convergence
In this paper we derive five kinds of algorithms for simultaneously finding the zeros of a complex polynomial. The convergence and the convergence rate with higher order are obtained. The algorithms are numeri...
-
Article
Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
In this paper, applying the major function method, we extend the convergence region of algorithm (2) and obtain a large computable radius estimate of safe initial disks. This result is an improvement of all re...
-
Article
Effective error estimates for the numerical solution of Fredholm integral equations
This paper describes the theoretical basis of an effective a posteriori error analysis for Fredholm integral equations of the second kind. We present error bounds from which we then derive error estimators tha...
-
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...
-
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 ...
-
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...
-
Chapter and Conference Paper
Prelude: A system for portable parallel software
-
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...
-
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-...
-
Article
Generating NURBS curves by envelopes
Nonuniform rational B-spline curves may be recursively generated by the envelope of a family of low order rational B-spline curves, and this envelope is unique. Thus rational B-spline curves can be directly de...
-
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...
-
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...
-
Article
Vector-quantization-based video codec for software-only playback on personal computers
This paper discusses a video compression and decompression method based on vector quantization (VQ) for use on general purpose computer systems without specialized hardware. After describing basic VQ coding, w...
-
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...
-
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...
-
Article
Curve interpolation with constrained length
We consider the problem of finding a curve which interpolates at given points such that (approximately) the length of the curve between each two subsequent interpolation points is equal to some given number. W...
-
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...
-
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...
-
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...
-
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...
