We give evolving algebra semantics to the Occam programming language generalizing in the process evolving algebras to the case of distributed concurrent computations. Later note: the first example of a distributed abstract state machine.
The first algebraic average-case complete problem is presented. It is arguably the simplest natural average-case complete problem to date.
An analysis scheme is presented for estimating the phoneme-level articulatory parameters to obtain best fits to natural speech. The working units of optimization are the parameters of an articulatory model (one vector per phoneme) and vectors of time and speed of transition for each parameter.…
An improved method for generating articulatory codebooks is introduced. The distance measure used for codebook access is optimized. The improvements are evaluated and compared in terms of a perceptually motivated formant distance measure. It is found that the codebooks derived from the articulatory model of…
This paper examines the evolution of the focus of user interface research and development from the first production of commercial computer systems in the 1950s through the present. The term “user interface” was not needed in the beginning, when most users were engineers and programmers;…
In this paper we report our initial efforts to make SPHINX, the CMU continuous-speech speaker-independent recognition system, robust to changes in the environment. To deal with differences in noise level and spectral tilt between close-talking and desktop microphones, we propose two novel methods based on…
A large class of classical lattice models, describing the coexistence of a finite number of stable states at low temperatures, is considered.
We can achieve significant gains in the value of computation by metareasoning about the nature or extent of base-level problem solving before executing a solution. However, resources that are irrevocably committed to metareasoning are not available for executing a solution. Thus, it is important to…
In this paper we report on the performance of the remote procedure call (RPC) implementation for the Firefly multiprocessor and analyze the implementation to account precisely for all measured latency. From the analysis and measurements, we estimate how much faster RPC could be if certain…
A general method, the tensor product representation, is defined for the connectionist representation of value/variable bindings. The technique is a formalization of the idea that a set of value/variable pairs can be represented by accumulating activity in a collection of units each of which computes…
Real-world scenes contain many interacting phenomena that lead to complex images which are difficult to interpret automatically. Part of this difficulty is due to the dichotomy of useful representations for these phenomena. Some effects are best described in the spatial domain, while others are more…
INNC 90 Paris : International Neural Network Conference, July 9-13, 1990, Palais des Congres, Paris, France.
