ppxscal/embedding_network huggingface dataset:
Psychometric evaluation of an after-scenario questionnaire for computer usability studies: the ASQ
Authors: James R. Lewis
Venue: ACM SIGCHI Bulletin (1991)

A three-item after-scenario questionnaire was used in three related usability tests in different areas of the United States. The studies had eight scenarios in common. After participants finished a scenario, they completed the After-Scenario Questionnaire (the ASQ). A factor analysis of the responses to the ASQ items revealed that an eight-factor solution explained 94 percent of the variability of the 24 (eight scenarios by three items per scenario) items. The varimax-rotated factor pattern showed that these eight factors were clearly associated with the eight scenarios. The benefit of this research to system designers is that this three-item questionnaire has acceptable psychometric properties of reliability, sensitivity, and concurrent validity, and may be used with confidence in other, similar usability studies.
Viewpoint Invariant Recovery of Visual Surfaces from Sparse Data
Authors: Robert L. Stevenson, Edward J. Delp
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

An algorithm for the reconstruction of visual surfaces from sparse data is proposed. An important aspect of this algorithm is that the surface estimated from the sparse data is approximately invariant with respect to rigid transformation of the surface in 3D space. The algorithm is based on casting the problem as an ill-posed inverse problem that must be stabilized using a priori information related to the image and constraint formation. To form a surface estimate that is approximately invariant with respect to viewpoint, the stabilizing information is based on invariant surface characteristics. With appropriate approximations, this results in a convex functional to minimize, which is then solved using finite element analysis. The relationship of this algorithm to several previously proposed reconstruction algorithms is discussed, and several examples that demonstrate its effectiveness in reconstructing viewpoint-invariant surface estimates are given.
Results of SIGCSE membership survey
Authors: Nell Dale
Venue: ACM SIGCSE Bulletin (1992)

SIGCSE is alive and well, as evidenced by the fact that 445 of you took the time to fill out the six-page questionnaire mailed out to the approximately 2600 SIGCSE members in early January. Those of you who were at the Technical Symposium in Kansas City heard me summarize the responses. Here is a hard copy of the results, including additional responses received after the Symposium. I will group the responses into three categories: Who are we? How do we rate current services? and Where should we be going? In closing, I will discuss comments from the free response section of the questionnaire and pose a challange to educational researchers.
What's computer ethics, anyway?
Authors: Nilakantan Nagarajan
Venue: ACM SIGSAC Review (1990)

ETHICS has, of late, become almost a buzzword, bandied around by key-note speakers, media pundits and practical politicians. We have been inundated with a born-again awareness of morality and ethical behavior in every walk of life, as an aftermath of adverse impact of numerous GATEs and SCAMs involving cover-ups and crimes committed by persons held at high pedestal of trust and responsibility in business, government and other spheres of activity.
Subquadratic zero-knowledge
Authors: Joan Boyar, Gilles Brassard, René Peralta
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

The communication complexity of zero-knowledge proof systems is improved. Let C be a Boolean circuit of size n. Previous zero-knowledge proof systems for the satisfiability of C require the use of Omega (kn) bit commitments in order to achieve a probability of undetected cheating not greater than 2/sup -k/. In the case k=n, the communication complexity of these protocols is therefore Omega (n/sup 2/) bit commitments. A zero-knowledge proof is given for achieving the same goal with only O(n/sup m/+k square root n/sup m/) bit commitments, where m=1+ epsilon /sub n/ and epsilon /sub n/ goes to zero as n goes to infinity. In the case k=n, this is O(n square root n/sup m/). Moreover, only O(k) commitments need ever be opened, which is interesting if committing to a bit is significantly less expensive than opening a commitment.
Structural Indexing: Efficient 3-D Object Recognition
Authors: Fridtjof Stein, Gérard Medioni
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The authors present an approach for the recognition of multiple 3-D object models from three 3-D scene data. The approach uses two different types of primitives for matching: small surface patches, where differential properties can be reliably computed, and lines corresponding to depth or orientation discontinuities. These are represented by splashes and 3-D curves, respectively. It is shown how both of these primitives can be encoded by a set of super segments, consisting of connected linear segments. These super segments are entered into a table and provide the essential mechanism for fast retrieval and matching. The issues of robustness and stability of the features are addressed in detail. The acquisition of the 3-D models is performed automatically by computing splashes in highly structured areas of the objects and by using boundary and surface edges for the generation of 3-D curves. The authors present results with the current system (3-D object recognition based on super segments) and discuss further extensions.
What's in a Set of Points? (Straight Line Fitting)
Authors: N. Kiryati, A. M. Bruckstein
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The problem of fitting a straight line to a planar set of points is reconsidered. A parameter space computational approach capable of fitting one or more lines to a set of points is presented. The suggested algorithm handles errors in both coordinates of the data points, even when the error variances vary between coordinates and among points and can be readily made robust to outliers. The algorithm is quite general and allows line fitting according to several useful optimality criteria to be performed within a single computational framework. It is observed that certain extensions of the Hough transform can be turned to be equivalent to well-known M estimators, thus allowing computationally efficient approximate M estimation.
Some applications of a technique of Sakoda and Sipser
Authors: B. Ravikumar
Venue: ACM SIGACT News (1990)

Sakoda and Sipser [Sa78] introduced a technique for constructing certain regular languages over a large alphabet and used these languages as candidates for proving lower bounds on the size increase when converting a nondeterministic finite automaton (NFA) to a deterministic one (DFA). The purpose of this note is to show that their method is quite useful in solving several problems in the theory of regular languages. In view of its intuitive appeal, we recommend it as a pedagogic aid for presenting lower bound proofs.
Electronic studio sets controlled by a computer (abstract)
Authors: Shiperu Shimoda, Masaki Hayashi, Yasuaki Kanatsugu
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

NHK has carried out research on the development of electronic studio sets for television program production employing digital video processing technology, and has progressed to their practical application. Used in place of the conventional studio sets built with ordinary construction materials, the electronic set can use a computer graphic or other electronic video image as the background scene. This background is synthesized with the foreground image filmed by the television camera, producing a realtime video image that parallels that made using an actual set. A high definition television format image is used for the background electronic set. For this reason, the newly developed digital image processor has been equipped with the high definition television frame storage capability, and the functions emulating the normal camera functions of zooming, panning and focusing are handled electronically, producing a background image synchronized with the operation of the foreground camera. The panning and tilting data from the foreground camera is detected by two rotary encoders attached to the universal head, while zooming and focusing data detection is handled by a potentiometer attached to the lens. The host computer continually gathers camera operation data and controls the digital image processor in order to produce a background video image which follows the movement of the camera. The computer can also read a new electronic studio set from magnetic disk to instantly produce changes of background scenes. Currently, NHK uses this electronic studio set in its daily broadcasts of regular news, sports news and commentary programs.
Specification of Real-Time Broadcast Networks
Authors: Pradeep Jain, Simon S. Lam
Venue: IEEE Transactions on Computers (1991)

The authors present a model for specifying real-time protocols that execute on broadcast bus networks. Protocol entities interact by sending and receiving binary signals on buses. The actual propagation of these signals is captured in the proposed model by a set of channel axioms. Protocol entities are specified by sequential programs. The semantics of a set of programming constructs, including two level wait constructs, are defined. To illustrate the model and verification method, the authors present a specification of the Expressnet protocol which was designed for collision-free access to a unidirectional bus. A scenario in which collisions can occur in the original Expressnet was discovered. To guarantee collision-freedom, a modification to the protocol is given. The modified protocol is shown to be collision-free. A bound for its access delay is also derived.
Artificial evolution for computer graphics
Authors: Karl Sims
Venue: Proceedings of the 18th annual conference on Computer graphics and interactive techniques (1991)

This paper describes how evolutionary techniques of variation and selection can be used to create complex simulated structures, textures, and motions for use in computer graphics and animation. Interactive selection, based on visual perception of procedurally generated results, allows the user to direct simulated evolutions in preferred directions. Several examples using these methods have been implemented and are described. 3D plant structures are grown using fixed sets of genetic parameters. Images, solid textures, and animations are created using mutating symbolic lisp expressions. Genotypes consisting of symbolic expressions are presented as an attempt to surpass the limitations of fixed-length genotypes with predefined expression rules. It is proposed that artificial evolution has potential as a powerful tool for achieving flexible complexity with a minimum of user input and knowledge of details.
Seamless - a latency-tolerant RISC-based multiprocessor architecture (abstract)
Authors: Samuel A. Fineberg, Thomas L. Casavant, Brent H. Pease
Venue: ACM SIGARCH Computer Architecture News (1992)

The Seamless parallel system being developed at the University of Iowa ECE Department provides a method for providing latency tolerance in physically-distributed memory systems utilizing &ldquo;off-the-shelf&rdquo; RISC CPU's without incurring the overhead of multithreading. Seamless encompasses an evolutionary new programming model emphasizing data locality that views communication as data movement rather than message passing I/O. A hardware Locality Manager is added to each processing element to perform this data movement concurrently with computation.
Designing theory-based systems: a case study
Authors: John B. Smith, Marcy Lansman
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

In this paper, we discuss principles for designing and testing computer systems intended to support users' thinking as they perform open-ended or ill-defined tasks. We argue that such systems inherently and inevitably implement a model of users' cognitive behaviors. Making that model explicit can provide system developers with guidance in taking design decisions. However, both model and system must be tested and refined. We discuss these principles in relation to a case study in which our group developed a hypertext-based writing environment and then tested that system in a series of experimental studies of writers' strategies.
Wide-area collaboration
Authors: Larry Press
Venue: Communications of the ACM (1991)

Since my temperament draws me to groupware, I have read about and taught it, and tried many groupware programs. This has been interesting, but the only groupware that has really affected my work is electronic mail on wide-area networks. My &ldquo;invisible college,&rdquo; my colleagues, are not the people in the offices down the corridor, they are people on the Internet, many of whom I have never seen or spoken with.
A theory of using history for equational systems with applications
Authors: Rakesh M. Verma
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

A general theory of using a congruence closure based simplifier (CCNS) proposed by P. Chew (1980) for computing normal forms is developed, and several applications are presented. An independent set of postulates is given, and it is proved that CCNS can be used for any system that satisfies them. It is then shown that CCNS can be used for consistent convergent systems and for various kinds of priority rewrite systems. A simple translation scheme for converting priority systems into effectively nonoverlapping convergent systems is presented.
Reducing search by partitioning the word network
Authors: John Dowding
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

This paper proposes an architecture for integrating speech recognition and natural language processing to provide a spoken language understanding system. This work, done in collaboration with the MIT Spoken Language Systems Group, has enabled us to interface our Pundit natural language processing system [Dahl1987, Palmer1986, Hirschman1982, Hirschman1986, Dowding1987] and SUMMIT, the MIT speech recognition system[Zue1989, Glass1988, Seneff1985, Zue1985]. Information is passed between the two systems using the <i>Word Network</i> (or <i>Word Lattice</i>) which is a set of word-score pairs together with the start and end points for each word. The word network is organized as a directed acyclic graph, whose arcs are labeled as word-score pairs, and whose nodes are moments in time. The recognition problem is to find the best scoring grammatical sequence of words from the graph's begin-point to its end. In our experments, we analyzed word networks from the TIMIT domain and the Resource Management domain, constructed without using any language model.
Cache Invalidation Patterns in Shared-Memory Multiprocessors
Authors: Anoop Gupta, Wolf-Dietrich Weber
Venue: IEEE Transactions on Computers (1992)

The cache invalidation patterns of several parallel applications are analyzed. The results are based on multiprocessor simulations with 8, 16, and 32 processors. To provide deeper insight into the observed invalidation behavior the invalidations observed in the simulations are linked to the high-level objects causing them in the programs. To predict what the invalidation patterns would look like beyond 32 processors, a classification scheme for data objects found in parallel programs is proposed. The classification scheme provides a powerful conceptual tool to reason about the invalidation patterns of parallel applications. Results indicate that it should be possible to scale well-written parallel programs to a large number of processors without an explosion in invalidation traffic. At the same time, the invalidation patterns are such that directory-based schemes with just a few pointers per entry can be very effective. The variations in invalidation behavior with different cache line sizes are discussed. The results indicate that cache line sizes in the 32-byte range yield the lowest data and invalidation traffic.
AAPT: algorithm animator and programming toolbox
Authors: Ian Sanders, Harshila Gopal
Venue: ACM SIGCSE Bulletin (1991)

Learning to program is difficult. The focus of this research was on developing an environment (AAPT) to assist the student in learning programming at an appropriate speed without a tutor having to be available. AAPT is made up of two components, a programming toolbox and an algorithm animator and is intended for use in conjunction with formal lectures, tutorials and laboratory sessions. The approach taken here is different to other work in algorithm animation because AAPT allows the student to develop the program and see how it works in the same environment.
Design and simulation of electronic meeting systems in a DEVS-Scheme environment
Authors: V. Ramesh, Chris Hays
Venue: ACM SIGSIM Simulation Digest (1992)

In recent years there has been increased interest in the area of electronic support for group work. Several systems have emerged from research in this area and are commonly called as Group Decision Support Systems, Computer Supported Collaborative Work Systems, Electronic Meeting Systems (EMS), etc. [Huber, 1984, Kraemer and King, 1988, Dennis et. al, 1988]. The University of Arizona's Groupsystems software is one such system [Dennis et. al., 1988]. Fig. 1 shows the conceptual representation of a meeting room running the software.
Automating judgmental decisions using neural networks: a model for processing business loan applications
Authors: Rajeshwar Prasad Srivastava
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

This paper presents a neural network model that simulates a business loan officer. The network is trained by showing financial ratios, past credit ratings, and loan records of a mixed sample of defaulted and non-defaulted companies. Once it is trained, it recommends to grant or deny a loan. The model uses human judgment of an expert as well as mathematical analysis of financial ratios. It includes into consideration the relative importance of different inputs, and the degree of belief in human judgments. An approach is shown, which allows an &ldquo;explanation&rdquo; for the decisions made. The results show that a neural network can be a valuable tool in simulating human decision-making.
Workspaces: an architecture for editing collections of objects
Authors: Dan R. Olsen,  Jr., Thomas G. McNeill, David C. Mitchell
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

Many tools create new user interfaces by compositing them out of smaller pieces. This usually leads to variations on the dialog box to edit a single composite object. Workspaces are a model for compositing together various editors to manipulate sets of objects and their attributes. The workspace components communicate in terms of a selected set and the attributes possessed by objects in that set. This model has been implemented as part of the Sushi UIMS.
Improved acoustic modeling for continuous speech recognition
Authors: C.-H. Lee, E. Giachin, L. R. Rabiner, R. Pieraccini, A. E. Rosenberg
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

We report on some recent improvements to an HMM-based, continuous speech recognition system which is being developed at AT amp;T Bell Laboratories. These advances, which include the incorporation of inter-word, context-dependent units and an improved feature analysis, lead to a recognition system which achieve better than 95% word accuracy for speaker independent recognition of the 1000-word, DARPA resource management task using the standard word-pair grammar (with a perplexity of about 60). It will be shown that the incorporation of inter-word units into training results in better acoustic models of word juncture coarticulation and gives a 20% reduction in error rate. The effect of an improved set of spectral and log energy features is to further reduce word error rate by about 30%. We also found that the spectral vectors, corresponding to the same speech unit, behave differently statistically, depending on whether they are at word boundaries or within a word. The results suggest that intra-word and inter-word units should be modeled independently, even when they appear in the same context. Using a set of sub-word units which included variants for intra-word and inter-word, context-dependent phones, an additional decrease of about 10% in word error rate resulted.
The Induction of Dynamical Recognizers
Authors: Jordan B. Pollack
Venue: Machine Learning (1991)

A higher order recurrent neural network architecture learns to recognize and generate languages after being &ldquo;trained&rdquo; on categorized exemplars. Studying these networks from the perspective of dynamical systems yields two interesting discoveries: First, a longitudinal examination of the learning process illustrates a new form of mechanical inference: Induction by phase transition. A small weight adjustment causes a &ldquo;bifurcation&rdquo; in the limit behavior of the network. This phase transition corresponds to the onset of the network's capacity for generalizing to arbitrary-length strings. Second, a study of the automata resulting from the acquisition of previously published training sets indicates that while the architecture is not guaranteed to find a minimal finite automaton consistent with the given exemplars, which is an NP-Hard problem, the architecture does appear capable of generating non-regular languages by exploiting fractal and chaotic dynamics. I end the paper with a hypothesis relating linguistic generative capacity to the behavioral regimes of non-linear dynamical systems.
On Three-Dimensional Surface Reconstruction Methods
Authors: Ruud M. Bolle, Baba C. Vemuri
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

A survey is presented of some of the surface reconstruction methods that can be found in the literature; the focus is on a small, recent, and important subset of the published reconstruction techniques. The techniques are classified based on the surface representation used, implicit versus explicit functions. A study is made of the important aspects of the surface reconstruction techniques. One aspect is the viewpoint invariance of the methods. This is an important property if object recognition is the ultimate objective. The robustness of the various methods is examined. It is determined whether the parameter estimates are biased, and the sensitivity to obscuration is addressed. The latter two aspects are particularly important for fitting functions in the implicit form. A detailed description is given of a parametric reconstruction method for three-dimensional object surfaces that involves numeric grid generation techniques and variational principle formulations. This technique is invariant to rigid motion in dimensional space.