12,474 Result(s)
-
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-...
-
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...
-
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 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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
Chapter and Conference Paper
System for screening objectionable images using Daubechies' wavelets and color histograms
This paper describes WIPETM (Wavelet Image Pornography Elimination), an algorithm capable of classifying an image as objectionable or benign. The algorithm uses a combination of Daubechies' wavelets, normalized c...
-
Chapter and Conference Paper
A matrix representation of phylogenetic trees
In this paper we begin by describing two currently used methods for evaluating phylogenetic trees, one proposed by Fitch and Margoliash [5] and the other proposed by Saitou and Nei [7]. Both methods are heuris...