ppxscal/embedding_network huggingface dataset:
Report of the working group on interface design decisions and representation
Authors: Deborah Hix, George Casaday
Venue: ACM SIGCHI Bulletin (1990)

This is a report of working group discussion held during the "Taking Design Seriously" workshop at CHI'90 in Settle. The group participants were George Casaday, Tom Dayton, Deborah Hix, John Karat, John McGrew, and Antonio Siochi.
Systolic Super Summation with Reduced Hardware
Authors: Peter R. Cappello, Willard L. Miranker
Venue: IEEE Transactions on Computers (1992)

A systolic super summer is a cellular apparatus for summing floating-point numbers. The apparatus receives floating-point summands, converting them to fixed-point within a sieve-like cellular array. The emerging fixed-point numbers are summed in a pipelined array of long accumulators. An improved design is presented for the summer's sieve. Although the new sieve is structurally simpler and uses less hardware, the throughput per unit area is the same as that for the previously designed sieve. The new sieve's architectural regularity makes it ideal for implementation in VLSI circuit technology.
A carrier sensed multiple access protocol high data rate ring networks
Authors: E. C. Foudriat, K. Maly, C. M. Overstreet, S. Khanna, F. Paterra
Venue: ACM SIGCOMM Computer Communication Review (1991)

This paper presents a significant extension of the CSMA network access protocol. The protocol is based on the facts that, at high data rates, networks can contain multiple messages simultaneously over their span, and that in a ring, nodes needs only to detect the presence of a message arriving from the immediate up stream neighbor. When an incoming signal is detected, the node truncates the message it is presently sending instead of aborting it. The system has been named Carrier Sensed Multiple Access Ring Network, CSMA/RN.Analytical studies using three performance factors, wait or access time, service time and response or end-to-end travel time are presented. The service time is basically a function of the network rate; it changes by a factor of 4 between no load and full load. Wait time, which is zero for no load, remains small for load factors up to 70% of full load. Response time, which adds travel time while on the network to wait and service time, is mainly a function of network length, especially for longer distance networks.Simulation results are shown for CSMA/RN where messages are removed at the destination. Destination removal on an average increases network load capacity by a factor of 2, i.e., a 1 Gbps network can handle a 2 Gbps load. A wide range of local and metropolitan area network parameters including variations in message size, network length and node count are studied. In all cases performance is excellent, and message fracture usually remains less than a factor of 4. Throughput, even at overload conditions, remains high for the protocol. The nominal network rate is 1 Gbps; however, performance remains good for data rates as low as 200 Mbps. Finally, a scaling factor based upon the ratio of message to network length demonstrates that the results of this paper, and hence, the CSMA/RN protocol, are applicable to wide area networks.
DDM: A Cache-Only Memory Architecture
Authors: Erik Hagersten, Anders Landin, Seif Haridi
Venue: Computer (1992)

The Data Diffusion Machine (DDM), a cache-only memory architecture (COMA) that relies on a hierarchical network structure, is described. The key ideas behind DDM are introduced by describing a small machine, which could be a COMA on its own or a subsystem of a larger COMA, and its protocol. A large machine with hundreds of processors is also described. The DDM prototype project is discussed, and simulated performance results are presented.
Generating a grammar for statistical training
Authors: R. A. Sharman, F. Jelinek, R. Mercer
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

Parsing sentences of a Natural Language(NL) is an essential requirement for a variety of NL applications, and has been extensively studied. In particular, the sort of tasks which it would be desirable to do, include the ability to tag each word with its part-of-speech; to delineate with brackets, and label with a category name, each syntactic phrase; and to be able to adapt to different types of source material. Despite some 30 years of active research performing these tasks with a high degree of accuracy on unrestricted text is still an unsolved problem.
Competition and cooperation in analog neural networks for combinatorial optimization (abstract)
Authors: Tao Li, L. Fang
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

Error back-propagation has been used to train a multilayer perceptron to classify an individual's utterances of digits. The network has made no errors in classifying 300 new utterances, and has exhibited robust performance with gross variations in speaking style and signal-to-noise ratio. The novelty of the approach is the way in which temporal information is encoded for use by the perceptron. Specifically, the input is a pattern of decaying activations in a self-organized map of speech spectra. At uniform steps in time, the unit in the map that most accurately represents the current speech sound is fully activated. The activation of the unit subsequently decays exponentially, and at any time the level of activation of a unit indicates how recently its corresponding speech sound has occurred. One may imagine the map as a screen of luminescent elements and the speech signal as a point of light moving across the screen. The role of the network is to classify trajectories of digits on the screen. We have found that the rate of decay in the feature map is not an important factor in isolated digit recognition. Decay rate is expected to be a critical factor in training the perceptron to spot utterances of digits in fluent speech, however. Use of the digit-classifier in a &ldquo;bootstrap&rdquo; training procedure for a continuous speech recognizer is proposed.
Time-Space Optimal Parallel Merging and Sorting
Authors: Xiaojun Guan, Michael A. Langston
Venue: IEEE Transactions on Computers (1991)

The authors present a parallel merging algorithm that, on an exclusive-read exclusive-write (EREW) parallel random-access machine (PRAM) with k processors merges two sorted lists of total length n in O(n/k+log n) time and constant extra space per processor, and hence is time-space optimal for any value of k>or=n/(log n). The authors also describe how this gives rise to a stable version of the parallel merging algorithm that is similarly time-space optimal on an EREW PRAM. The authors observe that this technique for achieving stability incurs two penalties: a slightly more complicated algorithm and somewhat larger constants of proportionality. These two parallel merges naturally lead to time-space optimal parallel sorting algorithms. Extensions to sorting and open topics for future research are discussed.
Organizing software information: a concept-based approach
Authors: Matthias Jarke
Venue: ACM SIGOIS Bulletin (1992)

When developing, implementing, and maintaining large-scale information systems, many facets of knowledge become relevant. Based on experiences in ESPRIT project DAIDA, we analyze these facets and sketch a comprehensive formal model of knowledge relevant to IS development and maintenance. Such a model can be used to structure development environments, to discuss and control software projects, and to support design decisions and their tool-assisted execution in CASE environments. Based on this model, we have implemented a knowledge-based and decision-oriented software information system called ConceptBase which provides efficient management of large bases of conceptual models and tools for exploratory analysis and (group) decision-making in IS engineering.
A Linear Algorithm for Generating Random Numbers with a Given Distribution
Authors: Michael D. Vose
Venue: IEEE Transactions on Software Engineering (1991)

Let xi be a random variable over a finite set with an arbitrary probability distribution. Improvements to a fast method of generating sample values for xi in constant time are suggested. The proposed modification reduces the time required for initialization to O(n). For a simple genetic algorithm, this improvement changes an O(g n 1n n) algorithm into an O(g n) algorithm (where g is the number of generations, and n is the population size).
Visualization in network topology optimization
Authors: Hong Liu, Donald Hockney
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

The intrinsic complexity and the geometric nature of network topology optimization lends itself to visual human-computer interaction. We have applied techniques of scientific visualization to all the aspects of network design, and have designed graphical user interface which takes full advantage of human expertise in the context of automated design processes.
Content-dependent access control
Authors: Jonathan D. Moffett, Morris S. Sloman
Venue: ACM SIGOPS Operating Systems Review (1991)

Content-dependent access control, where the access decisions depend upon the value of an attribute of the object itself, is required in many applications. However problems arise in an object-based environment, because obtaining the value of an object's attribute requires an operation upon the object. We discuss the conceptual and performance implications of introducing content-dependent access control, and suggest how the problems can be avoided in some cases by using a domain-based approach to access control.
An Experimental Evaluation of Software Redundancy as a Strategy for Improving Reliability
Authors: Dave E. Eckhardt, Alper K. Caglayan, John C. Knight, Larry D. Lee, David F. McAllister Mladen A. Vouk, John J. P. Kelly
Venue: IEEE Transactions on Software Engineering (1991)

The strategy of using multiple versions of independently developed software as a means to tolerate residual software design faults is discussed. The effectiveness of multiversion software is studied by comparing estimates of the failure probabilities of these systems with the failure probabilities of single versions. The estimates are obtained under a model of dependent failures and compared with estimates obtained when failures are assumed to be independent. The experimental results are based on 20 versions of an aerospace application developed and independently validated by 60 programmers from 4 universities. Descriptions of the application and development process are given, together with an analysis of the 20 versions.
Automated Inspection of Textile Fabrics Using Textural Models
Authors: Fernand S. Cohen, Zhigang Fan, Stephane Attali
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The authors discuss the problem of textile fabric inspection using the visual textural properties of the fabric. The problem is to detect and locate the various kinds of defects that might be present in a given fabric sample based on an image of the fabric. Stochastic models are used to model the visual fabric texture. The authors use the Gaussian Markov random field to model the texture image of nondefective fabric. The inspection problem is cast as a statistical hypothesis testing problem on statistics derived from the model. The image of the fabric patch to be inspected is partitioned into nonoverlapping windows of size N*N where each window is classified as defective or nondefective based on a likelihood ratio test of size alpha . The test is recast in terms of the sufficient statistics associated with the model parameters. The sufficient statistics are easily computable for any sample. The authors generalize the test when the model parameters of the fabric are assumed to be unknown.
Fast B-spline Transforms for Continuous Image Representation and Interpolation
Authors: Michael Unser, Akram Aldroubi, Murray Eden
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

Efficient algorithms for the continuous representation of a discrete signal in terms of B-splines (direct B-spline transform) and for interpolative signal reconstruction (indirect B-spline transform) with an expansion factor m are described. Expressions for the z-transforms of the sampled B-spline functions are determined and a convolution property of these kernels is established. It is shown that both the direct and indirect spline transforms involve linear operators that are space invariant and are implemented efficiently by linear filtering. Fast computational algorithms based on the recursive implementations of these filters are proposed. A B-spline interpolator can also be characterized in terms of its transfer function and its global impulse response (cardinal spline of order n). The case of the cubic spline is treated in greater detail. The present approach is compared with previous methods that are reexamined from a critical point of view. It is concluded that B-spline interpolation correctly applied does not result in a loss of image resolution and that this type of interpolation can be performed in a very efficient manner.
PSB graphs for simulating cooperative and distributed program behavior
Authors: James M. Butler, A. Yavuz Oruc
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

There are many areas of investigation where it is necessary to model the structure and behavior of distributed programs. Many models exist, though most tend to focus on some particular aspect of program behavior. For many problems, such as task mapping in real-world systems, it is necessary to coalesce all major features of distributed program structure and behavior into a single model. This paper presents a model called a Program Structure and Behavior graph which provides a basis for simulating cooperative and distributed programs. A facility which can simulate these distributed programs has been developed and tested. The paper describes this facility along with example runs.
Telecommunication research in information systems: an investigation of the literature
Authors: Dennis A. Adams, Mary C. Lacity, James R. Mullins
Venue: ACM SIGMIS Database (1991)

Telecommunications management is becoming a top priority of IS executives. Executive's concerns range from network establishment and getting connectivity to using IS for competitive advantage. In a rapidly changing environment, these executives search for guidance and insights. Unfortunately, they might find limited help from IS research. An extensive literature review of more than 9,800 articles covering over eleven years of MIS research showed that academicians have not placed the same emphasis as practitioners on telecommunications management. Furthermore, the majority of telecommunications research focuses on lower level management issues, such as installing a network, rather than using IS for competitive advantage. More research in telecommunications is needed to provide IS executives with insights on how to management the telecommunications function.
Approximation and Intractability Results for the Maximum Cut Problem and Its Variants
Authors: David J. Haglin, Shankar M. Venkatesan
Venue: IEEE Transactions on Computers (1991)

The maximum cut problem is known to be an important NP-complete problem with many applications. The authors investigate this problem (which they call the normal maximum cut problem) and a variant of it (which is referred to as the connected maximum cut problem). They show that any n-vertex e-edge graph admits a cut with at least the fraction 1/2+1/2n of its edges, thus improving the ratio 1/2+2/e known before. It is shown that it is NP-complete to decide if a given graph has a normal maximum cut with at least a fraction (1/2+ epsilon ) of its edges, where the positive constant epsilon can be taken smaller than any value chosen. The authors present an approximation algorithm for the normal maximum cut problem on any graph that runs in O((e log e+n log n)/p+log p*log n) parallel time using p(1>or=p>or=e+n) processors that guarantees a ratio of at least (1/2+1/2n), given a matching of size e/n in G. The authors take up the connected maximum cut problem and show that, unlike the normal maximum cut problem, this problem admits an infinity of instances where the fraction of the edges in the connected maximum cut is arbitrarily close to zero. They then show that the connected maximum cut problem is NP-complete even for planar graphs, in clear contrast to the normal maximum cut problem, which is solvable in polynomial time on planar graphs.
Data cache performance of supercomputer applications
Authors: David Callahan, Allan Porterfield
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

Processor speed has been increasing faster than mass memory speed. One method of matching a processor's speed to memory's is high-speed caches. This paper examines the data cache performance of a set of computationally intensive programs. Our interset in measuring cache performance arises from an interest in improving the performance of program during compilation. We observed that the data caches contained the values for between 45% and 99+% of the array accesses, depending on the cache and the program. The delays from the misses accounted for up to half of the total execution time of the program. The misses were grouped in a subset of source program references which resulted in misses on every access. Aggressive compilers should be able to improve program performance by focusing on those array accesses that result in cache misses.
An analytical model of operating system protocol processing including effects of multiprogramming
Authors: Peter B. Danzig
Venue: ACM SIGMETRICS Performance Evaluation Review (1991)

We model the limited buffer queueing process that occurs within the UNIX operating system's protocol processing layers. Our model accounts for the effects of user process multiprogramming and preemptive, priority scheduling of interrupt, operating system, and user tasks. After developing the model, we use it to predict message loss that occurs during local area network (LAN) multicast. Our service time model can be applied to window-and rate-based stream flow control.
Shared variables
Authors: Ken Elsom
Venue: Proceedings of the fourth international workshop on Real-time Ada issues (1990)

This is a summary of the discussions which took place in the session on the sharing of variables in Ada 9X.
The VHDL validation suite
Authors: James Armstrong, Chang Cho, Sandeep Shah, Chakravarthy Kosaraju
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

A validation suite for IEEE standard VHDL is discussed along with its executive manager. Test points are generated from the VHDL LRM (Language Reference Manual) syntax diagrams and sentences. Each test in the suite contains a test header which is specially formatted and keeps information such as test point, test objective, test result, and test type. The suite executive manager is menu-driven and efficiently classifies the tests based on different criterion defined in the test header. Coverage is defined to measure how closely a VHDL tool covers the LRM and is also computed by the suite executive manager.
Artificial neural system for gene classification using a domain database
Authors: Cathy Wu, G. M. Whitson
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

Database search for molecular sequence homologies is the most direct computational approach to decipher gene sequence for protein structure and function. However, the rapid accumulation of sequence data has made the search increasingly difficult using traditional algorithms and pattern-matching software. Our approach to this problem is to develop a domain artificial neural system (ANS) for gene classification by combining a new database design with the neural network theory. A new database, consisting only of identifiable protein domain classes, should be created to reduce the size of the molecular database to be searched. Each entry of the database should contain the domain consensus sequence and other domain features, both of which can be compiled from the NBRF-PIR protein sequence database. The domain database would then be embedded in a neural network so that the search problem is replaced by a pattern recognition problem. The domain ANS would be a three-layered network implemented with the back propagation learning algorithm. The inputs to the system are: the sequence string, which is mapped onto 400 units using a hashing function; and the sequence features, which are mapped onto 36 units. The outputs of the system are identification tags for each of the domain classes. A prototype domain ANS is being developed to map the consensus sequence and sequence features of each of the 41 domains in the training sets to its domain class. Once trained, the domain ANS would allow an easy, rapid gene classification for both intra-class and inter-class protein domains.
SAMPLE: new programming technology and AI language
Authors: Andrew H. Gleibman
Venue: ACM SIGSAM Bulletin (1992)

In this paper, a new simple AI language is described, which ties up Logic Programming and Algebraic Programming concepts, and, to our mind, may take the same place in the AI languages family as Basic language --- in the conventional programming languages family.The main (and slightly unusual for programming languages) feature of this language is the most possible similarity of the constructions for writing algorithms to the data being processed. This feature provides a new programming technology: the user composes a program from data examples (building up some structure on them) rather than writing constructions on a programming language with non-trivial a priori syntax and semantics.This programming technology makes it possible to develop sophisticated expert systems by problem analysts rather than professional programmers. Many of Sample programs turn out to be the shortest possible representations of the corresponding algorithms. This feature seems to be a characteristic feature of the language.The paper contains program examples, discussion on the applicability and implementation, and description of some experiments with current implementation of the Sample language interpreter.
The Ircam Signal Processing Workstation prototyping environment
Authors: M. De Cecco, E. Lindeman, M. Puckette
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

This demo shows the prototyping environment of the Ircam Signal Processing Workstation. The environment is oriented toward rapid prototyping of DSP and Musical applications.
From under the rubble: computing and the resuscitation of Romania
Authors: Seymour E. Goodman
Venue: Communications of the ACM (1991)

How does an entire country return to life? The dictatorship of Nicolae and Elena Ceaucescu turned Romania into a political, social and economic wasteland that was vividly pictured in the world media after the overthrow of the Stalinist couple in December 1989. Their regime left the country in shambles: with an old or mangled physical plant, a currency worthless abroad and nearly worthless at home, a legacy of secret police abuses, terrible health and sanitary conditions, and a highly centralized, warped, and inefficient scientific and industrial infrastructure.
Which model of programming for LISP: sequential, functional or mixed?
Authors: C. K. Yuen
Venue: ACM SIGPLAN Notices (1991)

This article reviews models of programming applicable to Lisp, and argues that both the sequential model and the functional model have developed in directions of excessive complexity. For future developments, a mixed model based on old-style Lisp, but augmented with new parallel constructs, can provide a simpler tool for handling practical programming tasks.