ppxscal/embedding_network huggingface dataset:
SoundWorks: An Object-Oriented Distributed System for Digital Sound
Authors: Jonathan D. Reichbach, Richard A. Kemmerer
Venue: Computer (1992)

SoundWorks, an object-oriented distributed system that lets users interactively manipulate sound through a graphical interface, is discussed. The system handles digitally sampled sounds as well as those generated by software and digital signal processing hardware. An overview of the different types of sounds and window interfaces provided by SoundWorks and of the operations that modify these sounds is presented. The high-level architecture and the design of the SoundWorks system the protocol defined between the user interface code and client application, and the sound kernel specification that manages sounds and lines, performs operations on sounds, and interfaces to the digital hardware are described. The NEWS application programming environment, which provided the necessary primitive graphic items for a graphical window-based interface and offered an object-oriented approach for development of the SoundWorks system, is also discussed.
A Complete and Extendable Approach to Visual Recognition
Authors: Ruud M. Bolle, Andrea Califano, Rick Kjeldsen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A framework for 3D object recognition is presented. Its flexibility and extensibility are accomplished through a uniform, parallel, and modular recognition architecture. Concurrent and stacked parameter transforms reconstruct a variety of features from the input scene. At each stage, constraint satisfaction networks collect and fuse the evidence obtained through the parameter transforms, ensuring a globally consistent interpretation of the input scene and allowing for the integration of diverse types of information. The final interpretation of the scene is a small consistent subset of the many initial hypotheses about partial features, primitive features, feature assemblies, and 3D objects computed by the various parameter transforms. A complete, integrated, and implemented system that extracts planar surfaces, patches of quadrics of revolution, and planar intersection curves of these surfaces from a depth map viewing 3D objects is described. Experimental results on the recognition behavior of the system are presented.
Adapting relational optimization technology to deductive and object-oriented declarative database languages
Authors: Rosana S. G. Lanzelotte, Jean-Pierre Cheiney
Venue: Proceedings of the third international workshop on Database programming languages : bulk types persistent data: bulk types persistent data (1992)

Besides the usual task of choosing the best sequence for executing operations and their implementation, optimizers for new deductive and object-oriented declarative DB languages face the problem of deciding the best navigation through complex objects. Works on the subject adopt solutions inspired by those issued from the relational optimization technology. They usually focus on one aspect (i.e., path traversals through objects) and do not consider joins, recursion and updates in the same optimization framework. As a consequence, they fail to investigate all possible execution plans for a given input request. This work describes a comprehensive optimization approach which deals uniformly with path traversals, joins, recursion and updates. It starts from a proposed request representation model which copes with (possibly recursive) views and provides for the common representation of overlapping path expressions through objects. The input request is, then, translated to a non-navigational representation where the physical entities involved are depicted and from which execution plans are built. The approach enables the application of deterministic enumerative and randomized search strategies and contributes to enlarging the spectrum of investigated solutions when comparing to related work.
The Topology of Locales and Its Effects on Position Uncertainty
Authors: David L. Havelock
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The precision to which the position of a target in a digital image can be estimated may be analyzed by considering the possible digital representations of the target. Such an analysis leads to regions of indistinguishable target position, referred to as locales. By considering the density, distribution, and shape of these locales, the available precision can be estimated. Previously, such analyses have presumed an absence of noise in the digital image. It is shown how the noise tolerance for position estimation is affected by the topological properties of locales, such as locale connectivity, adjacency, and clustering.
A bound on the shift function in terms of the Busy Beaver function
Authors: Bryant A. Julstrom
Venue: ACM SIGACT News (1992)

The Busy Beaver function Sigma;(n) is the maximum number of 1's a halting n-state Turing machine may leave on an initially blank tape. The shift function S(n) is the maximum number of moves such a machine may make before it halts. This paper shows that S(n) lt; Sigma;(20n), then uses this result to prove that both Sigma;(n and S(n) are non-computable and their non-computability is equivalent to the undecidability of the halting problem. Demonstrations that several other functions are also non-computable apply a construction used in the proof of the bound on S(n).
Experience with formal methods in protocol development
Authors: Deepinder Sidhu, Anthony Chung, Thomas P. Blumer
Venue: ACM SIGCOMM Computer Communication Review (1991)

Communication protocols are complex software systems and key components of computer networks. They must be specified completely and implemented correctly. The development of a protocol typically involves several tedious steps. Experience has shown that the use of informal techniques in these steps of protocol development generally produces systems with errors and undesirable behaviors. Formal methods permit the development of highly reliable and easily maintainable communication protocols. This paper presents our experience with using formal methods in the specification, verification, implementation, and conformance testing of OSI protocols.
A new paradigm for speaker-independent training and speaker adaptation
Authors: Francis Kubala, Richard Schwartz
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

This paper reports on two contributions to large vocabulary continuous speech recognition. First, we present a new paradigm for speaker-independent (SI) training of hidden Markov models (HMM), which uses a large amount of speech from a few speakers instead of the traditional practice of using a little speech from many speakers. In addition, combination of the training speakers is done by averaging the statistics of independently trained models rather than the usual pooling of all the speech data from many speakers prior to training. With only 12 training speakers for SI recognition, we achieved a 7.5% word error rate on a standard grammar and test set from the DARPA Resource Management corpus. This performance is comparable to our best condition for this test suite, using 109 training speakers.Second, we show a significant improvement for speaker adaptation (SA) using the new SI corpus and a small amount of speech from the new (target) speaker. A probabilistic spectral mapping is estimated independently for each training (reference) speaker and the target speaker. Each reference model is transformed to the space of the target speaker and combined by averaging. Using only 40 utterances from the target speaker for adaptation, the error rate dropped to 4.1% --- a 45% reduction in error compared to the SI result.
What you see is what I think you see
Authors: Randall B. Smith
Venue: ACM SIGCUE Outlook (1992)

"What you see is what I think you see" is a property that can help technology support realtime interaction between physically separated users. The WYSIWITYS property is a natural consequence of adhering to a physical world metaphor. However, WYSIWITYS can be applied to systems that are not perfect adherents to the virtual world model. SharedARK, a distributed, animated, multi-user application used primarily for testing collaborative microworlds, serves as an example of such a system. SharedARK is a networked computer-based system, but it has been supplemented with audio and video links, and the objects in the world have been given the ability to make sounds. All of these elements are used in such a way as to provide WYSIWITYS properties for SharedARK users.
An access protocol for high-speed optical LANs
Authors: Jonathan C. Lu, Leonard Kleinrock
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

In this paper a multiple access protocol is proposed for a system consisting of many high-speed bursty traffic stations via an optical passive star coupler. Each user has access over a range of wavelengths, thus resulting in a wavelength division multiplexed communication. A station has to reserve a wavelength first then transmits the data on that wavelength. The performance has been modeled and analyzed with the Equilibrium Point Analysis (EPA) technique. Numerical results show that the low delay and high throughput (larger than the electronic speed of a single user) can be achieved. The analysis also shows that the best performance is obtained when the capacities of the reservation channels and the data channels are balanced.
The cross-cultural effectiveness of CAI: some cognitive and affective factors (abstract)
Authors: David W. Valentine
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

This is a comparative study using a Computer Assisted Instruction (CAI) supplement to a college-level introductory foreign language course. The supplement was used with classes at Potsdam College (SUNY) and at the Far East Advanced School of Theology in Baguio City, Republic of the Philippines. Five areas were explored: (1) Student Background and Characteristics, (2) Cognitive Style, (3) Course Achievement, (4) Time on task, and (5) Student Attitudes. Cognitive Style was measured using Witkin's model of Field Independence/Field Dependence (FI/FD). The Asian students were more FD than the American Students. Time spent in the computer program correlated positively to FD; most affective scales correlated positively to FI. Students leaving the course with more positive feelings toward CAI were those who (1) used the computer more, (2) had higher GPA's, and (3) had lower levels of stress. The Asian students spent significantly more time with the computer than the Americans, even though they had far less access to computing equipment. Computer time was related to the student's prior experience and personal interest in the course material. Time in CAI also correlated positively with certain measures of course achievement. The study includes a detailed review of the state of computing in the geographic region.
A new lower bound construction for commutative thue systems with applications
Authors: Chee K. Yap
Venue: Journal of Symbolic Computation (1991)

For n >=1, d >= 2, we describe a commutative Thue system that has ~2n variables and O(n) rules, each rule of size d + O(1) and that counts to d^2^n in a certain technical sense. This gives a more ''efficient'' alternative to a well-known construction of Mayr and Meyer. Using this construction, we sharpen the known double-exponential lower bounds for the maximum degrees D(n, d), I(n, d), S(n, d) associated (respectively) with Grobner bases, ideal membership problem and the syzygy basis problem: D(n,d)>=S(n,d)>=d^2^^^m,I(n,d)>=d^2^^^m, where m~n/2, and n, d sufficiently large. For comparison, it was known that D(n, d) @? d^2^n and I(n, d) @? (2d)^2^n.
Performance estimation in a massively parallel system
Authors: Vishwani D. Agrawal, Srimat T. Chakradhar
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

As more processors are added to a parallel processing system, the speedup gain diminishes. This behavior has been observed for several synchronized iterative algorithms. In this paper, we present a new statistical model of parallel processing for evaluating the performance of such algorithms on multiprocessor systems. A task is characterized by two parameters: the number of atoms and activity. An atom is the smallest part of computation that cannot be distributed to multiple processors and all atoms of a task are assumed to be equal in computational effort. Furthermore, atoms of the task become active with a fixed probability a called the activity. The task is equally divided among processors and the computation is synchronized at periodic instances when the results can be shared. The amount of computational activity of a processor within the period between synchronizations is assumed to be a binomial random variable. The performance of the multiprocessor system is derived from the maximum order-statistic of these random variables. The theoretical performance predicted by our analysis agrees well with the reported experimental performance of logic simulation of production VLSI chips. Even when the inter-processor communication overhead is neglected, the analysis explains many observed phenomena. The speedup continues to increase with the number of processors and assumes values around a x p, where p is the number of processors. As p is increased, the speedup rapidly changes from p to a x p. When the atoms can be equally divided among the p processors, the lower bound on speedup is found to be a x p. For unequal division of atoms to processors, however, the lower bound on speedup is less than a x p. Interestingly, for very low activity, speedups significantly higher than the lower bounds are possible.
Towards understanding text with a very large vocabulary
Authors: Damaris Ayuso, R. Bobrow, Dawn MacLaughlin, Marie Meteer, Lance Ramshaw, Rich Schwartz, Ralph Weischedel
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

In order to meet the information processing demands of the next decade, natural language systems must have the capability of processing very large amounts of text, commonly called "messages", from highly diverse sources written in any of a few dozen languages. One of the key issues in building systems with this scale of competence is handling large numbers of different words and word senses. Natural language understanding systems today are typically limited to vocabularies of less than 10,000 words; tomorrow's systems will need vocabularies at least 5 times that to effectively handle the volume and diversity of messages needing to be processed.
A Theory of Multiscale, Curvature-Based Shape Representation for Planar Curves
Authors: Farzin Mokhtarian, Alan K. Mackworth
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A shape representation technique suitable for tasks that call for recognition of a noisy curve of arbitrary shape at an arbitrary scale or orientation is presented. The method rests on the describing a curve at varying levels of detail using features that are invariant with respect to transformations that do not change the shape of the curve. Three different ways of computing the representation are described. They result in three different representations: the curvature scale space image, the renormalized curvature scale space image, and the resampled curvature scale space image. The process of describing a curve at increasing levels of abstraction is referred to as the evolution or arc length evolution of that curve. Several evolution and arc length evolution properties of planar curves are discussed.
Topics in computer-aided geometric design-1990
Authors: Richard Franke
Venue: ACM SIGNUM Newsletter (1990)

The Ettore Majorana Centre for Scientific Culture (Center) was founded in 1963 to "give life to a completely new way of realizing the EAST-WEST-NORTH-SOUTH collaboration, without discrimination and above any ideological, political, or racial barrier." The Italian Ministry of Education, the Italian Ministry of University and Scientific Research, and the Sicilian Regional Government sponsor the center, located in Erice, Sicily. The center is named for an Italian theoretical unclear physicist, of whom Enrico Fermi said "... and then there are the geniuses like Galileo and Newton. Ettore Majorana was one of these."
Yet another analysis of algorithms laboratory
Authors: Ed C. Epp
Venue: ACM SIGCSE Bulletin (1992)

Laboratory assignments can reinforce material given in lecture by making it come alive in practice. A prime example is the time complexity of algorithms. However, laboratories that confirm the time complexity of algorithms can be tedious exercises that do not really challenge a student to think about the algorithms they are testing. By giving students a set of unknown executables, the laboratory becomes more of a detective problem. Students are required to apply what they know about the sort algorithms so that they can identify them.
Measurements of a distributed file system
Authors: Mary G. Baker, John H. Hartman, Michael D. Kupfer, Ken W. Shirriff, John K. Ousterhout
Venue: ACM SIGOPS Operating Systems Review (1991)

We analyzed the user-level file access patterns and caching behavior of the Sprite distributed file system. The first part of our analysis repeated a study done in 1985 of the: BSD UNIX file system. We found that file throughput has increased by a factor of 20 to an average of 8 Kbytes per second per active user over 10-minute intervals, and that the use of process migration for load sharing increased burst rates by another factor of six. Also, many more very large (multi-megabyte) files are in use today than in 1985. The second part of our analysis measured the behavior of Sprite's main-memory file caches. Client-level caches average about 7 Mbytes in size (about one-quarter to one-third of main memory) and filter out about 50% of the traffic between clients and servers. 35% of the remaining server traffic is caused by paging, even on workstations with large memories. We found that client cache consistency is needed to prevent stale data errors, but that it is not invoked often enough to degrade overall system performance.
Exception handling in object-oriented systems
Authors: Christophe Dony, Jan Purchase, Russel Winder
Venue: ACM SIGPLAN OOPS Messenger (1992)

The 1970s saw the development of exception handling systems dedicated to procedural programming (Goodenough, 1975; Ichbiah, 1979; Liskov amp; Snyder, 1979; Mitchell, Maybury amp; Sweet, 1979). Such tools and the associated mechanisms were designed to enhance software reliability, reusability, readability and debugging. The 1980s saw the emergence of object-oriented technology which brought to programmers a new way of thinking about and designing their programs, as well as some new tools to make the programs more modular and reusable.
Layout synthesis of MOS digital cells
Authors: Antun Domic
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

Synthesis has been used to generate layouts for MOS circuits having a wide range of complexity, from a few to thousands of transistors. Until recently, automatic layout was confined to cell based approaches using a library of pre-laid out cells, such as standard cells or sea-of-gates primitives. The direct use of arbitrary cells, or the quick generation of new library items, is now receiving increased attention. This paper presents an overview of the main issues specific to the cell generation of MOS digital circuits.
Redundant CORDIC Methods with a Constant Scale Factor for Sine and Cosine Computation
Authors: Naofumi Takagi, Tohru Asada, Shuzo Yajima
Venue: IEEE Transactions on Computers (1991)

Proposes two redundant CORDIC (coordinate rotation digital computer) methods with a constant scale factor for sine and cosine computation, called the double rotation method and the correcting rotation method. In both methods, the CORDIC is accelerated by the use of a redundant binary number representation, as in the previously proposed redundant CORDIC. In the proposed methods, since the number of rotation-extensions performed for each angle is a constant, the scale factor is a constant independent of the operand. Hence, one does not need to calculate the scale factor during the computation, and can make a more efficient sine and cosine generator than that based on the previous redundant CORDIC.
Cache Memories for Data Flow Machines
Authors: Masaru Takesue
Venue: IEEE Transactions on Computers (1992)

Cache memories for dataflow machines are presented, and, in particular, four design principles for reducing the working set size of dataflow caches are introduced. They are (1) controlling the number of active state processes, (2) optimizing instruction addresses, (3) using a block-structured operand matching/waiting memory, and (4) making deterministic replacements. Based on these principles, instruction and operand caches are organized. A bypass control is also devised that enables cache block replacement to overlap with normal cache access. Miss ratio and performance of the caches are evaluated on a register transfer level simulator of a dataflow machine. The results show that the instruction cache of 1 k words and the operand cache of 2 k words achieve sufficiently low miss ratios. The bypass control compensates for the bandwidth of a narrow swapping channel to the extent that about eight dataflow processors with the caches can be integrated in an LSI chip.
Discrepancy and &egr; approximations for bounded VC-dimension
Authors: Jiří Matoušek, Emo Welzl, Lorenz Wernisch
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

Let (X, R) be a set system on an n-point set X. For a two-coloring on X, its discrepancy is defined as the maximum number by which the occurrences of the two colors differ in any set in R. It is shown that if for any m-point subset Y contained in X the number of distinct subsets induced by R on Y is bounded by O(m/sup d/) for a fixed integer d is a coloring with discrepancy bounded by O(n/sup 1/2-1/2d/ (log n)/sup 1+1/2d/). Also, if any subcollection of m sets of R partitions the points into at most O(m/sup d/) classes, then there is a coloring with discrepancy at most O(n/sup 1/2-1/2d/ n). These bounds imply improved upper bounds on the size of in -approximations for (X, R). All of the bounds are tight up to polylogarithmic factors in the worst case. The results allow the generalization of several results of J. Beck (1984) bounding the discrepancy in certain geometric settings to the case when the discrepancy is taken relative to an arbitrary measure.
The entropy reduction engine: integrating planning, scheduling, and control
Authors: Mark Drummond, John Bresina, Smadar Kedar
Venue: ACM SIGART Bulletin (1991)

This paper describes the Entropy Reduction Engine, an architecture for the integration of planning, scheduling, and control. The architecture is motivated, presented, and analyzed in terms of its different components; namely, problem reduction, temporal projection, and situated control rule execution. Experience with this architecture has motivated the recent integration of learning, and this paper also describes the learning methods and their impact on architecture performance.
Talk and Draw: Bundling Speech and Graphics
Authors: Mark W. Salisbury, Joseph H. Hendrickson, Terence L. Lammers, Caroline Fu, Scott A. Moody
Venue: Computer (1990)

A description is given of a workstation with integrated graphical and voice I/O (input/output), to improve the man-machine interface (MMI) of the Airborne Warning and Control System (AWACS). Incremental prototype development is used to improve the MMI for AWACS. Operator tasks were analyzed to identify functions that would be better performed with voice I/O, and a 70-word vocabulary and corresponding grammar were developed for an ITT VRS-1280 speech recognizer. Responses for a DEC Talker speech synthesizer were also developed. The system architecture for integrating voice and graphical input in the AWACS interface prototype and its implementation are described and development issues are examined. Future developments are considered.