ppxscal/embedding_network huggingface dataset:
A type system that reconciles classes and extents
Authors: Peter Buneman, Atsushi Ohori
Venue: Proceedings of the third international workshop on Database programming languages : bulk types persistent data: bulk types persistent data (1992)

We present a type system that naturally couples two different, and apparently contradictory, notions of inheritance that occur in object-oriented databases. To do this we distinguish between the type and a kind of a value: A type describes the entire structure of a value, while a kind describes only the availability of certain fields or methods. This distinction allows us to manipulate heterogeneous collections (collections of values with differing types) in a statically type-checked language. Moreover, the type system is polymorphic and types may be inferred using an extension of the technique used in ML. This means that it is easy to express general-purpose operations for the manipulation of heterogeneous collections. We believe that this system not only provides a natural approach to static type-checking in object-oriented databases; it also offers a technique for dealing with external databases in a statically typed language.
Achieving Generalized Object Recognition through Reasoning about Association of Function to Structure
Authors: Louise Stark, Kevin Bowyer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

An attempt is made to demonstrate the feasibility of defining an object category in terms of the functional properties shared by all objects in the category. This form of representation should allow much greater generality. A complete system has been implemented that takes the boundary surface description of a 3D object as its input and attempts to recognize whether the object belongs to the category 'chair' and, if so, into which subcategory if falls. This is, to the authors' knowledge, the first implemented system to explore the use of a purely function-based definition of an object category (that is, no explicit geometric or structural model) to recognize 3D objects. System competence has been evaluated on a database of over 100 objects, and the results largely agree with human interpretation of the objects.
An overview of PFL
Authors: Carol Small, Alexandra Poulovassilis
Venue: Proceedings of the third international workshop on Database programming languages : bulk types persistent data: bulk types persistent data (1992)

A new functional database language called PFL is described. PFL is a lazy functional language with a polymorphic type inference system which enforces strong static type-checking. All functions persist in a repository, and are specified by the insertion and deletion of equations. New data types can be added at any time, and the order in which types and equations are inserted is immaterial. A class of functions called selectors are used for the storage of bulk data. Selectors allow flexible, efficient access to stored data and encourage a natural and succinct programming style. We describe the type system of PFL and the definition of functions, including selectors. We then compare PFL with logic based languages, and other functional languages. Finally, we give an extended example based upon the manufacturing company parts database of [Atk87].
Octrees for faster isosurface generation
Authors: Jane Wilhelms, Allen Van Gelder
Venue: ACM Transactions on Graphics (TOG) (1992)

The large size of many volume data sets often prevents visualization algorithms from providing interactive rendering. The use of hierarchical data structures can ameliorate this problem by storing summary information to prevent useless exploration of regions of little or no current interest within the volume. This paper discusses research into the use of the octree hierarchical data structure when the regions of current interest can vary during the application, and are not known a priori. Octrees are well suited to the six-sided cell structure of many volumes. A new space-efficient design is introduced for octree representations of volumes whose resolutions are not conveniently a power of two; octrees following this design are called branch-on-need octrees (BONOs). Also, a caching method is described that essentially passes information between octree neighbors whose visitation times may be quite different, then discards it when its useful life is over. Using the application of octrees to isosurface generation as a focus, space and time comparisons for octree-based versus more traditional &ldquo;marching&rdquo; methods are presented.
Speech recognition in SRI's resource management and ATIS systems
Authors: Hy Murveit, John Butzberger, Mitch Weintraub
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

This paper describes improvements to DECIPHER, the speech recognition component in SRI's Air Travel Information Systems (ATIS) and Resource Management systems. DECIPHER is a speaker-independent continuous speech recognition system based on hidden Markov model (HMM) technology. We show significant performance improvements in DECIPHER due to (1) the addition of tied-mixture HMM modeling (2) rejection of out-of-vocabulary speech and background noise while continuing to recognize speech (3) adapting to the current speaker (4) the implementation of N-gram statistical grammars with DECIPHER. Finally we describe our performance in the February 1991 DARPA Resource Management evaluation (4.8 percent word error) and in the February 1991 DARPA-ATIS speech and SLS evaluations (95 sentences correct, 15 wrong of 140). We show that, for the ATIS evaluation, a well-conceived system integration can be relatively robust to speech recognition errors and to linguistic variability and errors.
Delivering the goods with Lisp
Authors: Richard Barber, George Imlah
Venue: Communications of the ACM (1991)

Lisp has long had a reputation for the efficacy of its development environment. It is used in academia and by some R D groups in industry; and, compared with conventional languages, it is hardly ever used in real applications in the real world. It will always be perceived as a rather arcane esoteric language if it does not successfully leave the ivory towers and start delivering the goods where it really matters&mdash;at the sharp end in industry.
Algorithms for an optimal A search and linearizing the search in the stack decoder
Authors: Douglas B. Paul
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

The stack decoder is an attractive algorithm for controlling the acoustic and language model matching in a continuous speech recognizer. It implements a best-first tree search of the language to find the best match to both the language model and the observed speech. This paper describes a method for performing the optimal A search which guarantees to find the most likely path (recognized sentence) while extending the minimum number of stack entries. A tree search, however, is exponential in the number of words. A second algorithm is presented which linearizes the search at the cost of approximating some of the path likelihoods.
The Run-Time Efficiency of Parallel Asynchronous Algorithms
Authors: Michel Dubois, Fayé A. Briggs
Venue: IEEE Transactions on Computers (1991)

The problem studied is similar to the problems found in multiprocessor operating systems. The lockout problem in multiprocessor operating systems is a direct result of multiple processors attempting to process common data structures asynchronously. There are numerous such shared data structures. The models developed are applicable to the study of contention for software and hardware resources in multiprocessor operating systems. The authors introduce an approximate analytical model to evaluate the performance of asynchronous processes found in asynchronous algorithms, including the combined effects of software lockout on critical sections and on job queues, and of shared-memory access conflicts. Because of the strong similarities between the two effects, the same model can be used for both, leading to a uniform and elegant formulation. The models are combined to find the run-time efficiency of asynchronous iterations.
A critique of the Ada 9X mutual control mechanism (requeue) and an alternative mapping (onlywhen)
Authors: Ufuk Verün, Tzilla Elrad
Venue: ACM SIGAda Ada Letters (1992)

Protected Record (PR) is the proposed Ada 9X light-weight synchronization mechanism. We assume that the reader is familiar with the Ada 9X proposal for PR [DoD, DPW, BW]. The requeue is one of the Ada 9X mappings of the requirement for flexibility and user control over scheduling. Requeue implements the requirement for Mutual Control which is the capability to make adecision based on a relationship among the states of both parties in a rendezvous (Relationship between parameters passed in by the caller task and the state of a protected record/called task).In the August 1991 Ada 9X Mapping Rationale there is a discussion about the requeue proposal aimed at the improvement of real-time features of Ada language [MR]. We propose an alternative mapping called onlywhen barrier for the realization of Mutual Control. Our mapping seems like requiring relatively more changes in the semantics definitions and resulting in increased run-time costs, but reducing the complexity of the code substantially and ultimately making the implementation of the Mutual Control more efficient than by using the requeue. A resource allocation problem and some solutions to it utilizing requeue and private entries are presented in [MR] and also summarized in [BW]. We examine the same problem and provide alternative solutions using the onlywhen proposal.
An Efficiently Computable Metric for Comparing Polygonal Shapes
Authors: Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

A method for comparing polygons that is a metric, invariant under translation, rotation, and change of scale, reasonably easy to compute, and intuitive is presented. The method is based on the L/sub 2/ distance between the turning functions of the two polygons. It works for both convex and nonconvex polygons and runs in time O(mn log mn), where m is the number of vertices in one polygon and n is the number of vertices in the other. Some examples showing that the method produces answers that are intuitively reasonable are presented.
Using graphs to explore databases and create reports
Authors: Robert Barr
Venue: ACM SIGCHI Bulletin (1990)

In most information systems that use them, graphs "illustrate" the numbers in a crosstab- or list-style report. However, they can also be employed both to explore a database to locate wanted data, and to retrieve data from the database to create a report.
Software architecture of DiCE: a distributed collaboration environment
Authors: Mon-Song Chen, Tsipora Barzilai, Harrick M. Vin
Venue: ACM SIGCOMM Computer Communication Review (1992)

Recent advances in network technology has significantly increased the network bandwidth as well as enriched the set of network functions, enabling a rich set of computer assisted collaborations. DiCE (Distributed Collaborative Environment) is a multimedia collaboration environment that is being developed at the IBM T. J. Watson Research Center. The challenge of DiCE is to explore the advanced functionalities enabled by high speed networking and multimedia computing technologies to develop effective computer assisted systems that will significantly increase the productivity of collaborations. The main objectives of DiCE are, first, to design an efficient multimedia collaboration environment, and then to prototype the design as the base for the development of a workstation based, hub-free (fully distributed) multimedia conferencing system.
TelePICTIVE: computer-supported collaborative GUI design for designers with diverse expertise
Authors: David S. Miller, John G. Smith, Michael J. Muller
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

It is generally accepted that it is important to involve the end users of a Graphical User Interface (GUI) in all stages of its design and development. However, traditional GUI development tools typically do not support collaborative design. TelePICTIVE is an experimental software prototype designed to allow computer-naive users to collaborate with experts at possibly remote locations in designing GUIs. TelePICTIVE is based on the PICTIVE participatory design methodology, and has been prototyped using the RENDEZVOUS system. In this paper we describe TelePICTIVE, and show how it is designed to support collaboration among a group of GUI designers with diverse levels of expertise. We also explore some of the issue that have come up during development and initial usability testing, such as how to coordinate simultaneous access to a shared design surface, and how to engage in the participatory design of GUIs using a Computer-Supported Cooperative Work (CSCW) system.
A Uniform Presentation of Confidentiality Properties
Authors: Jeremy Jacob
Venue: IEEE Transactions on Software Engineering (1991)

Security (in the sense of confidentiality) properties are properties of shared systems. A suitable model of shared systems, in which one can formally define the term security property and then proceed to catalog several security properties, is presented. The purpose is to present various information-flow properties in a manner that exposes their differences and similarities. Abstraction is the main tool, and everything that is not central to the purpose is discarded. The presentation is generic in the model of computation. The abstraction lays bare a regular structure into which many interesting information-flow properties fall. A shared system is represented by a relation. How this model lets one reason about information flow is discussed and the term information flow property is formally defined. Various information-flow properties are described. Composability and probabilistic security properties are addressed.
Time Optimal Linear Schedules for Algorithms with Uniform Dependencies
Authors: Weijia Shang, Jose A. B. Fortes
Venue: IEEE Transactions on Computers (1991)

The authors address the problem of identifying optimal linear schedules for uniform dependence algorithms so that their execution time is minimized. Procedures are proposed to solve this problem based on the mathematical solution of a nonlinear optimization problem. The complexity of these procedures is independent of the size of the algorithm. Actually, the complexity is exponential in the dimension of the index set of the algorithm, and for all practical purposes, very small due to the limited dimension of the index set of algorithms of practical interest. A particular class of algorithms for which the proposed solution is greatly simplified is considered, and the corresponding simpler organization procedure is provided.
Object-oriented programming in Ada83&mdash;genericity rehabilitated
Authors: Henry G. Baker
Venue: ACM SIGAda Ada Letters (1991)

A scheme for single-inheritance object-oriented programming in Ada83 is presented in which man y methods are determined at compile time using "generic" subprogram overloading. Unlike previous schemes for object-oriented programming in Ada83, which rely exclusively on derived types fo r inheritance, our scheme utilizes both derived types and generic units, and hence is more powerful. In particular, inheritance schemes based on derived types cannot handle the C++ concept o f "virtual function", while our scheme determines many of these methods at compile time. Our results call into question Bertrand Meyer's conclusions regarding the weakness of generic units.
A fault-tolerant implementation protocol for replicated database systems on bus local area networks
Authors: Junguk L. Kim, Heon Yeom
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

This paper proposes a new protocol for implementing a replicated database system on a bus local network. Using the broadcast capability of the bus local network, our protocol handles the database request efficiently with a small number of messages. Unlike existing schemes, our implementation protocol provides high resiliency as well as the fast response time. The system continues to service the requests as long as there is at least one site available, and, even when there is no site failure, the overall performance is better than the primary copy approach which is known to be most efficient. Simulation results are provided to compare the performance.
WHILE loops and the analogy of the single stroke engine
Authors: Jerald D. Cole
Venue: ACM SIGCSE Bulletin (1991)

Researchers have found that loop constructs, such as the WHILE (top tested) and REPEAT-UNTIL (bottom tested) in modern programming languages are problematic for a significant number of novice programming students[5]. In theory, any bottom tested loop can be implemented as a top tested loop. Unfortunately, the converse of this is not true, leading to some of the confusions experienced by beginners. To circumvent this and other problems, Taylor[7] advocates postponing the introduction of the REPEAT-UNTIL. Instead, he discriminates between two fundamental types of WHILE loops, designated the SENTINEL WHILE and the COUNTER WHILE, which are sufficient for the implementation of any loop. A key element of Taylor's pedagogical approach is the introduction of these concepts in the context of analogies. This approach is utilized in the exposition that follows.
Another view on parallel speedup
Authors: Xian-He Sun, Lionel M. Ni
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

In this paper three models of parallel speedup are studied. They are fixed-size speedup, fixed-time speedup and memory-bounded speedup. Two sets of speedup formulations are derived for these three models. One set requires more information and gives more accurate estimation. Another set considers a simplified case and provides a clear picture of possible performance gain of parallel processing. The simplified fixed-size speedup is Amdahl's law. The simplified fixed-time speedup is Gustafson's scaled speedup. The simplified memory-bounded speedup contains both Amdahl's law and Gustafson's scaled speedup as its special cases. This study proposes a new metric for performance evaluation and leads to a better understanding of parallel processing.
Architecture and implementation of a VLIW supercomputer
Authors: Robert P. Colwell, W. Eric Hall, Chandra S. Joshi, David B. Papworth, Paul K. Rodman, James E. Tornes
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

Very-Long-Instruction-Word (VLIW) computers achieve high performance by exploiting the fine-grain parallelism present in sequential or vectorizable code. Multiflow's /200 and /300 VLIW systems yielded near-supercomputer performance by this means despite the relatively slow (65 nS) clocks. With its much faster clock period (15 nS) and architectural improvements, the new /500 system attains approximately 4-9X the performance of its predecessors. This paper describes the /500 architecture and implementation, with special attention paid to the tradeoffs involved in designing very high speed VLIWs.
Supporting collaborative software development with ConversationBuilder
Authors: Simon M. Kaplan, William J. Tolone, Alan M. Carroll, Douglas P. Bogia, Celsina Bignoli
Venue: Proceedings of the fifth ACM SIGSOFT symposium on Software development environments (1992)

In this paper we discuss the architecture of the Conversation Builder, an environment for collaborative work, and show how our framework provides a powerful basis for support of collaborative software development activities.
Calculating Dempster-Shafer Plausibility
Authors: Jeffrey A. Barnett
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

A sufficient condition for the equality of the plausibility and commonality measures of the Dempster-Shafer belief calculus is developed. When the condition is met, an efficient method to calculate relative plausibility is available. In particular, the method can be used to calculate the relative plausibility of atomic hypotheses and, therefore, it can be used to find the choice that maximizes this measure. The computation is efficient enough to make Dempster-Shafer practical in some domains where computational complexity would otherwise discourage its use.
Identifying word correspondence in parallel texts
Authors: William A. Gale, Kenneth W. Church
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

Researchers in both machine translation (e.g., Brown <i>et al</i>, 1990) and bilingual lexicography (e.g., Klavans and Tzoukermann, 1990) have recently become interested in studying <i>parallel texts</i> (also known as <i>bilingual corpora</i>), bodies of text such as the Canadian Hansards (parliamentary debates) which are available in multiple languages (such as French and English). Much of the current excitement surrounding parallel texts was initiated by Brown <i>et al.</i> (1990), who outline a self-organizing method for using these parallel texts to build a machine translation system.
Jeepers: an interface perception research tool
Authors: Suzanne Weghorst, Werner Stuetzle
Venue: ACM SIGCHI Bulletin (1991)

Jeepers is a software tool for conducting empirical studies of user perception of graphical interface features. It was developed in the context of a research program on dynamic interactive graphical techniques for data visualization and exploration. The tool was effectively applied in researching the problem of discerning point cloud highlighting patterns such as those that would be displayed in interactive data "painting". Other potential research uses for the software are discussed.
3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation
Authors: Whoi-Yul Kim, Avinash C. Kak
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The authors show how large efficiencies can be achieved in model-based 3-D vision by combining the notions of discrete relaxation and bipartite matching. The computational approach presented is capable of pruning large segments of search space-an indispensable step when the number of objects in the model library is large and when recognition of complex objects with a large number of surfaces is called for. Bipartite matching is used for quick wholesale rejection of inapplicable models and for the determination of compatibility of a scene surface with a potential model surface taking into account relational considerations. The time complexity function associated with those aspects of the procedure that are implemented via bipartite matching is provided. The algorithms do not take more than a couple of iterations, even for objects with more than 30 surfaces.
Distributed computing
Authors: Ming T. (Mike) Liu
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

A distributed computing system consists of a collection autonomous computers connected by a communication network. The motivation for such a distributed system includes resource and load sharing, reduced costs in computation and communication, higher performance and throughput, and increased reliability and availability.