ppxscal/embedding_network huggingface dataset:
A Stereo Vision Technique Using Curve-Segments and Relaxation Matching
Authors: Nasser M. Nasrabadi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A multichannel feature-based stereo vision technique where curve segments are used as feature primitives in the matching process is described. The left image and the right image are filtered by using several Laplacian-of-Gaussian operators of different widths (channels). Curve segments are extracted by a tracking algorithm, and their centroids are obtained. At each channel, the generalized Hough transform of each curve segment in the left and the right image is evaluated. The epipolar constraint on the centroids of the curve segment and the channel size is used to limit the searching space in the right image. To resolve the ambiguity of the false targets (multiple matches), a relaxation technique is used where the initial scores of the node assignments are updated by the compatibility measures between the centroids of the curve segments. The node assignments with the highest score are chosen as the matching curve segments.
Session 2: DARPA resource management and ATIS benchmark test poster session
Authors: David S. Pallett
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

Following precedents established as early as the March 1987 DARPA Speech Recognition Workshop, previously-unreleased Benchmark Test Material was selected and released to DARPA contractors and others prior to the February 1991 meeting. Results were reported to NIST and scored using "official" scoring software and reference answers and the results were reported to the participants.
Program structure and clarity (abstract)
Authors: Ivan B. Liss, Thomas C. McMillan
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

This paper presents the results of a study which examines the effect of a program's structure on its clarity. In the study, subjects were given three programs written in a tiny algorithmic language. Each program was designed to print one of a set of strings which is determined by a regular expression encoded within the program. The syntax of the tiny algorithmic language enabled the programs to be written in such a way that the particular string which is printed is the result of a sequence of random events. A subject's understanding of the semantics of the program was tested by giving him ten strings and having him determine for each string if it could have been printed by the program. Three different versions of the tiny algorithmic language were used: A structured version in which the only branching allowed is incorporated into while loops and if..then..else statements; a structured modular version which is equivalent to the structured version except that it includes subprograms; and an unstructured version in which the only branching mechanisms are conditional and unconditional gotos. The pool of subjects, students in the tenth week of a Principles I computer science course, was divided in to three groups of approximately equal size. One group was tested using three structured programs; the second group was tested using three structured modular programs which encoded the same regular expressions as were used in the first group; the third group was tested using three unstructured programs, again encoding the same regular expressions. Subjects in each group were given ten minutes to read a small &ldquo;language manual&rdquo; on the version of the tiny algorithmic language which would be used for the test. The test was given immediately after this short introduction to the language. For each student, the time it took to complete the test was recorded.
The architecture and design of a collaborative environment for systems definition
Authors: Minder Chen, Jay F. Nunamaker
Venue: ACM SIGMIS Database (1991)

Defining systems requirements and specifications is a collaborative effort among managers, users, and systems developers. The difficulty of systems definition is caused by the human's limited cognitive capabilities, that is compounded by the complexity of group communication and coordination processes. Current system analysis methodologies are first evaluated regarding to the level of support to users. Since systems definition is a knowledge-intensive activity, the knowledge contents and structures employed in systems definition are discussed. For any large-scale system, no one person possesses all the knowledge that is needed, therefore, the authors proposed a collaborative approach to systems definition. The use of a group decision support system (GDSS) for systems definition is first described and limitations of the current GDSS are identified. The architecture and design of a collaborative computer-aided software engineering (CASE) environment, called C-CASE, is then discussed. C-CASE can be used to assist users in defining the requirements of their organization and information systems as well as to analyze the consistency and completeness of the requirements. C-CASE integrates GDSS and CASE such that users can actively participate in the requirements elicitation process. Users can use the metasystem capability of C-CASE to define domain specific systems definition languages, which are adaptable to different systems development settings. An example of using C-CASE in a collaborative environment is given. The implications C-CASE and the authors' ongoing research are also discussed.
Parallel Architectures and Algorithms for Image Component Labeling
Authors: Hussein M. Alnuweiri, Viktor K. Prasanna
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A survey and a characterization of the various parallel algorithms and architectures developed for the problem of labeling digitized images over the last two decades are presented. It is shown that four basic parallel techniques underly the various parallel algorithms for this problem. However, because most of these techniques have been developed at a theoretical level, it is still not clear which techniques are most efficient in practical terms. Parallel architectures and parallel models of computation that implement these techniques are also studied.
Approximations of general independent distributions
Authors: Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Veličkovic
Venue: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing (1992)

We describe efficient constructions of small probability spaces that approximate the independent distribution for general random variables. Previous work on efficient constructions concentrate on approximations of the independent distribution for the special case of uniform boolean-valued random variables. Our results yield efficient constructions of small sets with low discrepancy in high dimensional space and have applications to derandomizing randomized algorithms.
Heisenberg Uncertainty
Authors: P. Laplante
Venue: ACM SIGSOFT Software Engineering Notes (1990)

In this paper it is suggested that the Heisenberg Uncertainty Principle, normally applied to physical systems, can be applied in analogy to certain phenomena found in software engineering. The point is illustrated with several examples.The applications of this principle in the design and testing of software is discussed. The import of this is that paradigms relating physical phenomena to software engineering may be found.
Transparency and awareness in a real-time groupware system
Authors: Michel Beaudouin-Lafon, Alain Karsenty
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

This article explores real-time groupware systems from the perspective of both the users and the designer. This exploration is carried out through the description of GroupDesign, a real-time multi-user drawing tool that we have developed. From the perspective of the users, we present a number of functionalities that we feel necessary in any real-time groupware system: Graphic Audio Echo, Localization, Identification, Age, and History. From the perspective of the designer, we demonstrate the possibility of creating a multi-user application from a single-user one, and we introduce the notion of purely replicated architecture.
PAC learning with generalized samples and an application to stochastic geometry
Authors: S. R. Kulkarni, J. N. Tsitsiklis, S. K. Mitter, O. Zeitouni
Venue: Proceedings of the fifth annual workshop on Computational learning theory (1992)

In this paper, we introduce an extension of the standard PAC learning model which allows the use of generalized samples. We view a generalized sample as a pair consisting of a functional on the concept class together with the value obtained by the functional operating on the unknown concept. It appears that this model can be applied to a number of problems in signal processing and geometric reconstruction to provide sample size bounds under a PAC criterion. We consider a specific application of the model to a problem of curve reconstruction, and discuss some connections with a result from stochastic geometry.
Abstracts of CHI'91 interactive posters and short talks
Authors: Dennis E. Egan
Venue: ACM SIGCHI Bulletin (1991)

The CHI '91 Conference held in New Orleans, April 28th May 2nd, took on the goal of including more late-breaking technical information than had been possible at previous CHI Conferences. CHI '91 scheduled a late (mid-January) deadline for authors to propose Interactive Posters or Short Talks. These formats are designed for the presentation of technical information even before it is "hot off the press" and ready to be archived as a regular paper. Posters are particularly well suited to visual displays of a variety of projects recently completed or still in progress. The Interactive Poster format encourages conversation and informal interaction between Poster authors and conferees. Short Talks, a new format for the CHI Conferences, present late-breaking information as a 10-minute talk included in the technical program.
An Introduction to Speech and Speaker Recognition
Authors: Richard D. Peacocke, Daryl H. Graf
Venue: Computer (1990)

Five approaches that can be used to control and simplify the speech recognition task are examined. They entail the use of isolated words, speaker-dependent systems, limited vocabulary size, a tightly constrained grammar, and quiet and controlled environmental conditions. The five components of a speech recognition system are described: a speech capture device, a digital signal processing module, preprocessed signal storage, reference speech patterns, and a pattern-matching algorithm. Current speech recognition systems are reviewed and categorized. Speaker recognition approaches and systems are also discussed.
A methodology for taking account of user tasks, goals and behavior for design of computerized library catalogs
Authors: N. J. Belkin
Venue: ACM SIGCHI Bulletin (1991)

Catalogs have long been the primary device by which people gain access to the contents of libraries. For most of the twentieth century, this device has been in the form of the familiar card catalog. The advent of library automation systems in the 1960s and 1970s, originally for such housekeeping tasks as acquisition and circulation control, provided the opportunity for a new form of library catalog, which is now known generically as the Online Public Access Catalog (OPAC).
A study of I/O system organizations
Authors: A. L. Narasimha Reddy
Venue: ACM SIGARCH Computer Architecture News (1992)

With the increasing processing speeds, it has become important to design powerful and efficient I/O systems. In this paper, we look at several design options in designing an I/O system and study their impact on the performance. Specifically, we use trace driven simulations to study a disk system with a nonvolatile cache. Some of the considered design parameters include the cache block size, the fetch size, the cache size and the disk access policy. We show that decoupling the fetch size and the cache block size results in significant performance improvements. A new write-back policy is presented that is shown to offer significant performance benefits. We show that optimal block size in a two-level memory hierarchy is dependent only on the latency, data rate product of the second level as previously conjectured. We also present results showing the effect of a split access operation of a disk read/write head.
Concurrent counting
Authors: Shlomo Moran, Gadi Taubenfeld, Irit Yadin
Venue: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing (1992)

Our purpose is to implement clocks and, in general, counters in a shared memory environment. A concurrent counter is a counter that can be incremented and read, possibly at the same time by many processes. We study counters that achieve high level of concurrency and thus are likely to reduce memory contention; require only weak atomicity and thus are easy to implement; do not depend on the initial state of the memory and hence are more robust to memory changes; and are wait-free - one process cannot prevent another process from finishing its increment or read operations - and thus can tolerate any number of process failures. We concentrate on providing upper and lower bounds on the space complexity of the counters studied.
Independent Partitioning of Algorithms with Uniform Dependencies
Authors: Weijia Shang, Jose A. B. Fortes
Venue: IEEE Transactions on Computers (1992)

Uniform dependence algorithms with arbitrary index sets are considered, and two computationally inexpensive methods to find their independent partitions are proposed. Each method has advantages over the other one for certain kinds of applications, and they both outperform previously proposed approaches in terms of computational complexity and/or optimality. Also, lower and upper bounds are given for the cardinality of maximal independent partitions. In multiple instruction multiple data (MIMD) systems, if different blocks of an independent partition are assigned to different processors, communications between processors will be minimized to zero. This is significant because the communications usually dominate the overhead in MIMD machines.
Field research in product development
Authors: Karen H. Kvavik, Danielle Fafchamps, Sandra Jones, Shifteh Karimi
Venue: ACM SIGCHI Bulletin (1992)

Field research (also "contextual field research, user studies") involves users in product development so that their work experience may be understood by designers and developers. The points of view expressed here were first presented in a well-attended CHI '90 SIG on this user- centered approach. Overall, the notion of "culture" pervades our concerns: The corporate culture, the user's experience with computer tools, and the culture of the work setting. The design and development process within a group reflects a culture. Field research is relatively new to the industry. There is a concern about appropriate methods and techniques. A missionary's role can be a precarious one-- how does the social scientist navigate in a corporate jungle?
An optimal fault-tolerant broadcasting algorithm for a hypercube multiprocessor
Authors: Jai Eun Jang
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

In this paper we describe an optimal fault-tolerant broadcasting algorithm in the presence of n-1 faulty processors in the hypercube multiprocessor. This algorithm takes log2(N)+1 steps to broadcast the message to all other processors. Our broadcasting algorithm is a procedure by which a processor can pass a message to all other processors in the network non-redundantly.
Maintenance of geometric extrema &isin;
Authors: David Dobkin, Subhash Suri
Venue: Journal of the ACM (JACM) (1991)

Let S be a set, f: S&times;S&rarr;R+ a bivariate function, and f(x,S) the maximum value of f(x,y) over all elements y&isin;S. We say that f is decomposable with respect with the maximum if f(x,S) = max {f(x,S1),f(x,S2),&hellip;,f(x,Sk)} for any decomposition S = &mgr;i=1i=kSi. Computing the maximum (minimum) value of a decomposable function is inherent in many problems of computational geometry and robotics. In this paper, a general technique is presented for updating the maximum (minimum) value of a decomposable function as elements are inserted into and deleted from the set S. Our result holds for a semi-online model of dynamization: When an element is inserted, we are told how long it will stay. Applications of this technique include efficient algorithms for dynamically computing the diameter or closest pair of a set of points, minimum separation among a set of rectangles, smallest distance between a set of points and a set of hyperplanes, and largest or smallest area (perimeter) retangles determined by a set of points. These problems are fundamental to application areas such as robotics, VLSI masking, and optimization.
Taking design seriously: exploring techniques useful in HCI design
Authors: John Karat, Tom Dayton
Venue: ACM SIGCHI Bulletin (1990)

A workshop was held in Seattle on April 1st in conjunction with the CHI'90 conference. The call for participation in the workshop asked for position papers from individuals that described techniques found useful in some way in carrying out HCI design. For the purpose of the workshop, an intentionally broad view of what was considered as a technique was used (e.g., position papers that addressed design process, task-analysis methodologies, and skills-necessary for design, were all considered as addressing techniques). In this report we present an overview of the workshop. Additional reports of subgroup discussions, focused on some of the major themes that emerged during the day, are presented in papers by Braudes, Hix and Casaday, Carter, and Notess.
Statistical Analysis of Inherent Ambiguities in Recovering 3-D Motion from a Noisy Flow Field
Authors: Gem-Sun Jason Young, Rama Chellappa
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The inherent ambiguities in recovering 3-D motion information from a single optical flow field are studied using a statistical model. The ambiguities are quantified using the Cramer-Rao lower bound. As a special case, the performance bound for the motion of 3-D rigid planar surfaces is studied in detail. The dependence of the bound on factors such as the underlying motion, surface position, surface orientation, field of view, and density of available pixels are derived as closed-form expressions. A subset of the results support S. Adiv's (1989) analysis of the inherent ambiguities of motion parameters. For the general motion of an arbitrary surface. It is shown that the aperture problem in computing the optical flow restricts the nontrivial information about the 3-D motion to a sparse set of pixels at which both components of the flow velocity are observable. Computer simulations are used to study the dependence of the inherent ambiguities on the underlying motion, the field of view, and the number of feature points for the motion in front of a nonplanar environment.
The virtual machine
Authors: Richard M. Fujimoto
Venue: ACM SIGARCH Computer Architecture News (1991)

A parallel computer architecture is proposed that is based on an optimistic style of execution. Specifically, the Virtual Time Machine (VTM) detects violations of data dependence constraints at runtime, and automatically recovers from them. In order to efficiently implement this mechanism, a sophisticated, two-dimensional memory system is proposed that is addressed using both a spatial and a temporal coordinate. Initially targeted for discrete event simulation applications, the long term goal of this work is to develop a general purpose parallel computer that will support a wide range of parallel programming paradigms.This paper outlines the motivations behind the VTM architecture, the underlying computation model, a proposed implementation, and initial performance results. A recurring theme that pervades the entire paper is our contention that existing shared memory and message-base machines do not pay adequate attention to the dimension of time.
A polynomial time algorithm for the N-Queens problem
Authors: Rok Sosic, Jun Gu
Venue: ACM SIGART Bulletin (1990)

The n-queens problem is a classical combinatorial problem in the artificial intelligence (AI) area. Since the problem has a simple and regular structure, it has been widely used as a testbed to develop and benchmark new AI search problem-solving strategies. Recently, this problem has found practical applications in VLSI testing and traffic control. Due to its inherent complexity, currently even very efficient AI search algorithms developed so far can only find a solution for the n-queens problem with n up to about 100. In this paper we present a new, probabilistic local search algorithm which is based on a gradient-based heuristic. This efficient algorithm is capable of finding a solution for extremely large size n-queens problems. We give the execution statistics for this algorithm with n up to 500,000.
Integrating speech and natural-language processing
Authors: Robert Moore, Fernando Pereira, Hy Murveit
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

SRI has developed a new architecture for integrating speech and natural-language processing that applies linguistic constraints during recognition by incrementally expanding the state-transition network embodied in a unification grammar. We compare this dynamic-grammar-network (DGN) approach to its principal alternative, word-lattice parsing, presenting preliminary experimental results that suggest the DGN approach requires much less computation time than word-lattice parsing, while maintaining a very tractable recognition search space.
SID: a graphical browser
Authors: Tami L. Crawford
Venue: ACM SIGSMALL/PC Notes (1991)

Humans have powerful image processing systems which can assist in managing large amount of information. Program visualization can be used to exploit this capability to make complex systems manageable. In addition to being a tool for managing complexity, program visualization can support the maintenance of conceptual integrity, by providing a framework for viewing the program as a whole.This paper presents SID, a program visualization tool. The program view is determined by a control panel, which is accessed by the user and a knowledge based assistant called the Gue. SID is a prototype system for viewing C++ programs.
The role of workstations in the information utility: a model for user-oriented information systems
Authors: Jacob Slonim, Michael A. Bauer
Venue: ACM SIGSMALL/PC Notes (1991)

This paper describes the central role that personal workstations were foreseen to play in future generation of information systems. The particular project, the Information Utility, was meant to form the foundation for libraries of the future. The paper describes the components and layered structure of a nationwide information utility. The focal point of this information system is the personal workstation. Intimately tied to this is the local computing environment, supported by powerful microcomputers dedicated as servers in the local environment and supporting workstations. Relationships between the workstation, its local environment and regional/national environments are also described.
A FORTRAN IV to QuickBASIC translator
Authors: Rizaldo B. Caringal, Phan Minh Dung
Venue: ACM SIGPLAN Notices (1992)

This paper describes the design and implementation of an automatic translator from standard FORTRAN IV to QuickBASIC, a structured form of the programming language BASIC. The translator makes two passes on the input program before finally generating the translated program. The converter not only performs lexical, syntactic and limited forms of semantic analyses on the source program, but it also recovers from any errors encountered. It was implemented using the C programming language in the Disk Operating System (DOS) environment and was successfully ported to UNIX. Furthermore, the contingencies to cope with other dialects of the source language have been defined, and the problems encountered in the implementation process are discussed.