ppxscal/embedding_network huggingface dataset:
Pose Determination from Line-to-Plane Correspondences: Existence Condition and Closed-Form Solutions
Authors: Homer H. Chen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

A class of pose determination problems in which the sensory data are lines and the corresponding reference data are planes is discussed. The lines considered are different from edge lines in that they are not the intersection of boundary faces of the object. The author describes a polynomial approach that does not require a priori knowledge about the object location. Closed-form solutions for orthogonal, parallel, and coplanar feature configurations of critical importance in real applications are derived. Findings concerning the necessary and sufficient conditions under which the line-to-plane pose determination problem can be solved are described.
Design and Evaluation of the Rollback Chip: Special Purpose Hardware for Time Warp
Authors: Richard M. Fujimoto, Jya-Jang Tsai, Ganesh C. Gopalakrishnan
Venue: IEEE Transactions on Computers (1992)

Existing approaches to implement state saving are not appropriate for large Time Warp programs. The authors propose a component called the rollback chip (RBC) that efficiently implements state saving. Such a component could be used in a programmable, special purpose parallel discrete event simulation engine based on Time Warp. The algorithms implemented by the rollback chip are described, as well as mechanisms that allow efficient implementation. Results of simulation studies are presented that show that the rollback chip can virtually eliminate the state saving and rollback overheads that plague current software implementations of Time Warp.
Improving Disk Performance Via Latency Reduction
Authors: Spencer W. Ng
Venue: IEEE Transactions on Computers (1991)

It is shown that in many environments the rotational latency and the rotational position sensing (RPS) miss delay are the major contributors to a disk's basic service time. A sensitivity study using a simple analytical queueing model shows that a reduction in these two components (both of which are related to the rotation of disk drives) has the greatest impact in reducing the disk's basic service time and in turn produces the greatest improvement in overall subsystem performance. While the most straightforward way to reduce latency and RPS miss penalty would be to increase the disk's rotation speed, there are some limitations to such an approach. Several alternatives to reducing latency and RPS miss penalty are proposed and explored, and their performance is analyzed using analytical queuing models.
Computing with faulty shared memory
Authors: Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld
Venue: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing (1992)

This paper addresses problems which arise in the synchronization and coordination of distributed systems which employ unreliable shared memory. We present algorithms which solve the consensus problem, and which simulate reliable shared-memory objects, despite the fact that the available memory objects (e.g. read/write registers, test-and-set registers, read-modify-write registers) may be faulty.
Latent semantic indexing is an optimal special case of multidimensional scaling
Authors: Brian T. Bartell, Garrison W. Cottrell, Richard K. Belew
Venue: Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval (1992)

Latent Semantic Indexing (LSI) is a technique for representing documents, queries, and terms as vectors in a multidimensional real-valued space. The representtions are approximations to the original term space encoding, and are found using the matrix technique of Singular Value Decomposition. In comparison Multidimensional Scaling (MDS) is a class of data analysis techniques for representing data points as points in a multidimensional real-valued space. The objects are represented so that inter-point similarities in the space match inter-object similarity information provided by the researcher. We illustrate how the document representations given by LSI are equivalent to the optimal representations found when solving a particular MDS problem in which the given inter-object similarity information is provided by the inner product similarities between the documents themselves. We further analyze a more general MDS problem in which the interdocument similarity information, although still in inner product form is arbitrary with respect to the vector space encoding of the documents.
Memory management support for tiled array organization
Authors: Gary Newman
Venue: ACM SIGARCH Computer Architecture News (1992)

Organization of two dimensional array data into sub-arrays, sometimes called tiles, has been known to provide better performance than either row or column ordering since the late 1960s. Yet the tiling of arrays is little used today. Although some image processing and graphics memory systems have provided tile access modes, tiling has never been provided in a general purpose way.A novel method is described which adds support for tiled arrays to an otherwise conventional paged memory management unit. The result is that pages contain two dimensional tiles of data rather than one dimensional strips, making tiled virtual memory transparently available to general purpose application programs. Extending this new tiling method, the same benefits are shown to support sub-arrays with three or more dimensions. Finally, the image memory management unit of the Kodak Prophecy Color Publishing System is shown as an example implementation of tiled virtual memory.
A study on speaker-adaptive speech recognition
Authors: X. D. Huang
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

Speaker-independent system is desirable in many applications where speaker-specific data do not exist. However, if speaker-dependent data are available, the system could be adapted to the specific speaker such that the error rate could be significantly reduced. In this paper, DARPA Resource Management task is used as the domain to investigate the performance of speaker-adaptive speech recognition. Since adaptation is based on speaker-independent systems with only limited adaptation data, a good adaptation algorithm should be consistent with the speaker-independent parameter estimation criterion, and adapt those parameters that are less sensitive to the limited training data. Two parameter sets, the codebook mean vector and the output distribution, are regarded to be most important. They are modified in the framework of maximum likelihood estimation criterion according to the characteristics of each speaker. In order to reliably estimate those parameters, output distributions are shared with each other if they exhibit certain acoustic similarity. In addition to modify these parameters, speaker normalization with neural networks is also studied in the hope that acoustic data normalization will not only rapidly adapt the system but also enhance the robustness of speaker-independent speech recognition. Preliminary results indicate that speaker differences can be well minimized. In comparison with speaker-independent speech recognition, the error rate has been reduced from 4.3% to 3.1% by only using parameter adaptation techniques, with 40 adaptation sentences for each speaker. When the number of speaker adaptation sentences is comparable to that of speaker-dependent training, speaker-adaptive recognition works better than the best speaker-dependent recognition results on the same test set, which indicates the robustness of speaker-adaptive speech recognition.
Further uses of &ldquo;scenario&rdquo;
Authors: David Reisner
Venue: ACM SIGCHI Bulletin (1992)

Robert Campbell observes a variety of different usages of the term "scenario". He identifies four types of usage and coins terms to disambiguate usage and intent: demonstration examples (description), evaluation tasks (evaluation), user tasks for design (design), and test cases (theory testing).
Distributed communications
Authors: M. Kamrad, J. Cross
Venue: ACM SIGAda Ada Letters (1990)

Communications among multiple Ada programs is a must, either as an explicit link or as an invisible link hidden beneath a distributed Ada veneer. Unisys has defined two Ada package specifications for inter-program communications, that are derived from the requirements developed at the Third International Workshop on Real-Time Ada Issues (RTAW3). Unisys is implementing these packages on several embedded real-time testbeds, both as standalone capabilities for application developers and as the communication layer supporting a distributed Ada system. These specifications are proposed as a basis for a secondary standard for inter-program communication for Ada9X. This paper describes how these specifications match the RTAW3 requirements and the motivation for their features. Some details of the specifications are interspersed throughout the text, with a full specification contained in the appendix.
Transportable Applications Environment (TAE) Plus user interface designer WorkBench
Authors: Martha R. Szczur
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

TAE Plus was built at NASA's Goddard Space Flight Center to support the building of GUI user interfaces for highly interactive applications, such as realtime processing systems and scientific analysis system. TAE Plus is designed as a productivity tool for the user interface designer. Human factor experts and user interface designers frequently do not want to have to learn the programming details of the windowing environment before they use a GUI development tool to prototype and/or develop an application's user interface. TAE Plus has been developed with this user in mind. TAE Plus is a user interface management system that supports (1) interactively constructing the visual layout of an application screen, (2) rehearsing the UI, (3) generating the application source code to manage the UI, (3) generating the application source code to manage the UI, and (4) providing run-time services to manage the UI during application execution.
Teaching empirical performance analysis of parallel programs
Authors: A. L. Fisher, T. Gross
Venue: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education (1992)

Performance is a central issue in parallel computing. In this paper, we describe our approach to teaching advanced undergraduates and graduate students about the fundamentals of measuring and analyzing the performance of programs running on a variety of parallel machines. This approach can be applied to virtually any type of parallel machine, as well as to parallel program simulators. Although performance analysis can serve many purposes, we focus on the needs of the parallel programmer: understanding the behavior of algorithms and programs, and making informed choices among them.
On efficient unsuccessful search
Authors: Lucas Chi Kwong Hui, Charles Martel
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

This paper introduces a general technique for speeding up unsuccessful search using very little extra space (2 bits per key). This technique is applicable to many data structures including linear lists, and search trees. For linear lists we get on-line algorithms for processing a sequence of successful and unsuccessful searches which are competitive with strong off-line algorithms. In a virtual memory environment our self-adjusting algorithm for multi-way search trees is competitive with an optimal static multi-way tree and will often outperform the static tree.
Automated generation of intent-based 3D Illustrations
Authors: Dorée Duncan Seligmann, Steven Feiner
Venue: Proceedings of the 18th annual conference on Computer graphics and interactive techniques (1991)

This paper describes an automated intent-based approach to illustration. An illustrution is a picture that is designed to fulfill a communicative intent such as showing the location of an object or showing how an object is manipulated. An illustration is generated by implementing a set of stylistic decisions, ranging from determining the way in which an individual object is lit, to deciding the general composition of the illustration. The design of an illustration is treated as a goal-driven process within a system of constraints. The goal is to achieve communicative intent; the constraints are the illustrative techniques an illustrator can apply.We have developed IBIS (Intent-Based Illustration System), a system that puts these ideas into practice. IBIS designs illustrations using a generate-and-test approach, relying upon a rule-based system of methods and evaluators. Methods are rules that specify how to accomplish visual effects, while evaluators are rules that specify how to determine how well a visual effect is accomplished in an illustration. Examples of illustrations designed by IBIS are included.
A graphical comparison of RISC processors
Authors: Margarita Esponda, Raúl Rojas
Venue: ACM SIGARCH Computer Architecture News (1992)

A graphical approach for the comparison of RISC processors is presented in this note. Kiviat graphs summarize some of the most relevant architectural parameters of RISC designs in a more appealing manner as tables of parameters.
Pfortran: a parallel dialect of Fortran
Authors: Babak Bagheri, Terry W. Clark, L. Ridgeway Scott
Venue: ACM SIGPLAN Fortran Forum (1992)

IPfortran is a language designed to facilitate the programming of multi-process, data-parallel applications [BCS91]. Based on a message-passing paradigm, IPfortran extends Fortran with a small set of extensions. The duality of the send and receive operations is encapsulated in an infix operator (Section 2) or reducing functions (Section 3). With system-dependent message-passing pushed out of sight, code is streamlined and development time reduced. Errors in writing message-passing code are reduced by leaving the generation of the message-passing logic to the translator.
Diameter, width, closest line pair, and parametric searching
Authors: Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir
Venue: Proceedings of the eighth annual symposium on Computational geometry (1992)

We apply Megiddo's parametric searching technique to several geometric optimization problems and derive significantly improve solutions for them. We obtain, for any fixed &egr; > 0, an O(n1+&egr;) algorithm for computing the diameter of a point set in 3-space, an O(n8/5+&egr;) algorithm for computing the closest pair in a set of n lines in space. All these algorithms are deterministic. We also look at the problem of computing the k-th smallest slope formed by the lines joining n points in the plane. In 1989 Cole, Salowe, Steiger, and Szemere&acute;di gave an optimal but very complicated O(n log n) solution based on Megiddo's technique. We follow a different route and give a very simple O(n log2 n) solution which bypasses parametric searching altogether.
Using a software engineering approach to CS1: a comparative study of student performance
Authors: James R. Leonard
Venue: ACM SIGCSE Bulletin (1991)

This investigation used two groups of CS1 students. The control group was taught with a more traditional synthesis approach emphasizing language use using bottom-up explanations. The treatment group was taught with a software engineering-oriented analysis approach and emphasized topdown functional decomposition. The results indicate that a software engineering approach can produce significantly better student performance than a more traditional approach.
Abstractions for recursive pointer data structures: improving the analysis and transformation of imperative programs
Authors: Laurie J. Hendren, Joseph Hummell, Alexandru Nicolau
Venue: ACM SIGPLAN Notices (1992)

Even though impressive progress has been made in the area of optimizing and parallelizing programs with arrays, the application of similar techniques to programs with pointer data structures has remained difficult. In this paper we introduce a new approach that leads to improved analysis and transformation of programs with recursively-defined pointer data structures. We discuss how an abstract data structure description can improve program analysis by presenting an analysis approach that combines an alias analysis technique, path matrix, with information available from an ADDS declaration. Given this improved alias analysis technique, we provide a concrete example of applying a software pipelining transformation to loops involving pointer data structures.
Layout optimization by pattern modification
Authors: Ramin Hojati
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

This paper introduces a new and practical approach to several layout optimization problems. A novel two-dimensional pattern generator, in connection with a set of routing and placement transformations, is employed to efficiently solve problems ranging from Wire Crossing Minimization and Topological Via Minimization to Minimum Steiner Tree Optimization and IO Alignment. The expected running time is O(nlogn) and the space requirement is O(n), where n is the number of layout objects. The system is fully coded and tested, and excellent results in both laboratory and real-life examples have been achieved.
Quantifying the benefits of semantics
Authors: Gregory D. Speegle, Andrew L. Gordon
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

An active area of current research is the use of semantics in concurrency control. Simulations using a new concurrency control protocol, called complex two-phase locking, can quantify the benefits of using semantics within long-duration transaction systems. It is then possible to determine if the benefits gained are worth the human effort required to obtain the semantics.
Informatics in the Defense Industry
Authors: Henri Boucher
Venue: IEEE Annals of the History of Computing (1990)

This is the story of the first sixteen years of Informatics in Defense, as seen by a man who was a spectator from inside, then actor, and devoted all his active life to informatics as experience, and to Defense Minister as duty. These years were important because nobody in France outside of the Defense had simultaneous interest in computers and the budget for research about it. Industry was not motivated, seeing no future for the computer gadget. Defense made the triggering move, and Government as a whole followed: good or bad, it's another story.
Error estimation in automatic quadrature routines
Authors: Jarle Berntsen, Terje O. Espelid
Venue: ACM Transactions on Mathematical Software (TOMS) (1991)

A new algorithm for estimating the error in quadrature approximations is presented. Based on the same integrand evaluations that we need for approximating the integral, one may, for many quadrature rules, compute a sequence of null rule approximations. These null rule approximations are then used to produce an estimate of the local error. The algorithm allows us to take advantage of the degree of precision of the basic quadrature rule. In the experiments we show that the algorithm works satisfactorily for a selection of different quadrature rules on all test families of integrals.
Tree automata, Mu-Calculus and determinacy
Authors: E. A. Emerson, C. S. Jutla
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

It is shown that the propositional mu-calculus is equivalent in expressive power to finite automata on infinite trees. Since complementation is trivial in the mu-calculus, the equivalence provides a radically simplified, alternative proof of M.O. Rabin's (1989) complementation lemma for tree automata, which is the heart of one of the deepest decidability results. It is also shown how mu-calculus can be used to establish determinacy of infinite games used in earlier proofs of complementation lemma, and certain games used in the theory of online algorithms.
Automatic data mapping for distributed-memory parallel computers
Authors: Skef Wholey
Venue: Proceedings of the 6th international conference on Supercomputing (1992)

The performance of a program on a distributed-memory parallel computer depends on the algorithms employed, the structure and speed of the machine's communication network, and the ways in which data are distributed to the processors. This paper addresses the last of these concerns, the problem of data mapping. The paper describes and evaluated a system which automatically determines efficient ways of mapping data onto processors. The system is applicable and effective across a variety of architectures. Simulation results for machine with different interconnection schemes, including linear arrays, two-dimensional meshes, and the hypercubes, and measured running times for the CM-2 show that good data mapping often improves performance by at least 20% and in some cases by more than a factor of two.
BBN ATIS system progress report&mdash;June 1990
Authors: M. Bates, R. Bobrow, S. Boisen, R. Ingria, D. Stallard
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

This paper reports recent progress on the development of the Delphi natural language component of the BBN spoken language system for the ATIS domain, focussing on the comparative evaluation performed by NIST in June, 1990.
Automated Module Testing in Prolog
Authors: Daniel M. Hoffman, Paul Strooper
Venue: IEEE Transactions on Software Engineering (1991)

Tools and techniques for writing scripts in Prolog that automatically test modules implemented in C are presented. Both the input generation and the test oracle problems are addressed, focusing on a balance between the adequacy of the test inputs and the cost of developing the output oracle. The authors investigate automated input generation according to functional testing, random testing, and a novel approach based on trace invariants. For each input generation scheme, a mechanism for generating the expected outputs has been developed. The methods are described and illustrated in detail. Script development and maintenance costs appear to be reasonable, and run-time performance appears to be acceptable.
A rule-based language with functions and sets
Authors: Serge Abiteboul, Stéphane Grumbach
Venue: ACM Transactions on Database Systems (TODS) (1991)

A logic based language for manipulating complex objects constructed using set and tuple constructors is introduced. A key feature of the COL language is the use of base and derived data functions. Under some stratification restrictions, the semantics of programs is given by a minimal and justified model that can be computed using a finite sequence of fixpoints. The language is extended using external functions and predicates. An implementation of COL in a functional language is briefly discussed.
Mental models, text interpretation, and knowledge acquisition
Authors: Ashok K. Goel, Kurt P. Eiselt
Venue: ACM SIGART Bulletin (1991)

That which is commonly known as "human intelligence" is surely the result of the interaction of a great number of cognitive abilities such as motor control, vision, learning, problem solving, and language use, just to name a few. Yet most AI researchers study these component skills in isolation, without regard to how the individual components may use the knowledge or processes commonly associated with other different components. For example, much of the AI research on problem solving has focused on knowledge-based methods for solving complex problems without regard to the perceptual or linguistic processes involved. Similarly, work on natural language understanding typically views the language understander as an entity unto itself and ignores how language is used. We believe that the artificial separation between these cognitive components that pervades AI research has led to the development of underconstrained theories of intelligence.