ppxscal/embedding_network huggingface dataset:
CHI in the applied research divisions at Bellcore (lab review)
Authors: Thomas K. Landauer, Robert E. Kraut
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

Bellcore has several active research programs relevant to human-computer interaction. This talk describes research conducted in the Cognitive Science and Interpersonal Communications Research Groups. We describe their research on information retrieval and on collaboration and pay particular attention to the styles of research employed in these groups and to the way in which behavioral investigations have guided technical invention.
An integrated approach to parallel program debugging and performance analysis onlarge-scale multiprocessors
Authors: Robert J. Fowler, Thomas J. LeBlanc, John M. Mellor-Crummey
Venue: ACM SIGPLAN Notices (1989)

One of the most serious problems in the development cycle of large-scale parallel programs is the lack of tools for debugging and performance analysis. We are addressing the problem on large-scale, shared-memory multiprocessors. We have developed a dynamic, fine-grain characterization of parallel program executions based on a partial order of accesses to shared objects. This characterization forms the basis for an extensible, integrated toolkit for parallel program debugging and performance analysis. Tools in the toolkit include an interactive debugger, a graphical execution browser, performance analysis packages, and a programmable interface for user queries. Using our integrated toolkit approach, programmers can interactively analyze the behavior of parallel programs in much the same way interactive debuggers and profilers are used to analyze the behavior of sequential programs.
Optimal parallel algorithm for visibility of a simple polygon from a point
Authors: M. J. Atallah, D. Z. Chen
Venue: Proceedings of the fifth annual symposium on Computational geometry (1989)

We present a parallel algorithm for computing the visible portion of a simple polygonal chain with n vertices from a point in the plane. The algorithm runs in &Ogr;(log n) time using &Ogr;(n/ log n) processors in the CREW-PRAM computational model, and hence is asymptomatically optimal.
Professional skills assessment in programming competitions
Authors: Peter Salenieks, Jeff Naylor
Venue: ACM SIGCSE Bulletin (1988)

This paper describes the British Computer Society/British Aerospace (BAe) Programming Competition and presents the questions from the 1988 final. It discusses how their emphasis has changed from purely speed programming to a fuller assessment, under contest conditions, of the professional skills needed by practicing computer scientists.
A stepwise approach to developing software documentation
Authors: Gwen L. Stimely
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1990)

Published documentation development processes clearly explain how to break up the process into parts and which parts to do when. What they do not explain is how to merge documentation and software development so that documentation rework and catch-up are minimized. They also do not explicitly account for developing a document from one version to the next, or how to integrate multiple authors into the development process.
Solving word equations
Authors: Habib Abdulrab, Jean-Pierre Pécuchet
Venue: Journal of Symbolic Computation (1989)

Pure associative unification is equivalent to the resolution of word equations. We give a short survey of known results and algorithms in this field and describe the central algorithm of Makanin.
Tasking communication deadlocks in concurrent Ada programs
Authors: J. Cheng, K. Araki, K. Ushijima
Venue: ACM SIGAda Ada Letters (1988)

Tasking communication deadlock is one of most typical synchronization errors in concurrent Ada programs. In this article, we specify four kinds of tasking communication deadlocks, i.e., Circular-entry-calling, Dependence-blocking, Termination-blocking, and Acceptance-blocking. We also discuss briefly how to detect such deadlocks.
ALLOY: an amalgamation of expert, linguistic and statistical indexing methods
Authors: L. P. Jones, C. deBessonet, S. Kundu
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

In this paper we report progress on the development of ALLOY, a system that simplifies automatic document indexing and retrieval by combining techniques from several different approaches: expert, linguistic and statistical. The system is being designed to allow a panel of experts to create an ALLOY system for a given field by providing the necessary input that ALLOY needs to automatically index documents and to set up a convenient user interface. The input provided by the experts includes a hierarchy of concepts and an expert dictionary. The amount of information that the panel must provide for given field is considerably less than the amount required to build a complete thesaurus or knowledge base about that field.
Parallel object-space hidden surface removal
Authors: Wm. Randolph Franklin, Mohan S. Kankanhalli
Venue: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (1990)

A parallel object-space hidden surface removal algorithm for polyhedral scenes is presented. The uniform grid technique is used to achieve parallelism for the hidden line removal. A conflict-detection and back-off strategy is then used to obtain parallelism for the visible region reconstruction from the visible segments. The algorithm has been implemented on a Sequent Balance 21000 shared-memory parallel computer. An average speedup of 10 has been obtained using 15 processors.
A model for microarchitecture structure evaluation
Authors: E. S. T. Fernandes
Venue: ACM SIGMICRO Newsletter (1989)

This paper presents the specification and implementation of a model oriented primarily to the evaluation of the structure of microarchitectures. According to the model, target architectures are described as an oriented graph which is examined by search algorithms in order to find the minimum cost path required in the execution of a set of machine primitives. The model is very useful to determine the role of each target machine component: through the model it is possible to assess the effect of both including and removing architecture components on the overall performance of a machine being conceived. The paper shows the main aspects of the project, discusses the research potential of the model, and describes the current stage of the work.
Development of an instrument measuring user satisfaction of the human-computer interface
Authors: John P. Chin, Virginia A. Diehl, Kent L. Norman
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1988)

This study is a part of a research effort to develop the Questionnaire for User Interface Satisfaction (QUIS). Participants, 150 PC user group members, rated familiar software products. Two pairs of software categories were compared: 1) software that was liked and disliked, and 2) a standard command line system (CLS) and a menu driven application (MDA). The reliability of the questionnaire was high, Cronbach's alpha=.94. The overall reaction ratings yielded significantly higher ratings for liked software and MDA over disliked software and a CLS, respectively. Frequent and sophisticated PC users rated MDA more satisfying, powerful and flexible than CLS. Future applications of the QUIS on computers are discussed.
Simple but effective techniques for NUMA memory management
Authors: W. Bolosky, R. Fitzgerald, M. Scott
Venue: Proceedings of the twelfth ACM symposium on Operating systems principles (1989)

Multiprocessors with non-uniform memory access times introduce the problem of placing data near the processes that use them, in order to improve performance. We have implemented an automatic page placement strategy in the Mach operating system on the IBM ACE multiprocessor workstation. Our experience indicates that even very simple automatic strategies can produce nearly optimal page placement. It also suggests that the greatest leverage for further performance improvement lies in reducing false sharing, which occurs when the same page contains objects that would best be placed in different memories.
The POSTGRES Rule Manager
Authors: Michael Stonebraker, Eric N. Hanson, Spyros Potamianos
Venue: IEEE Transactions on Software Engineering (1988)

The rule subsystem that is being implemented in the POSTGRES DBMS is explained. It is novel in several ways. First, it gives users the capability of defining rules as well as data. Moreover, depending on the scope of each rule defined, optimization is handled differently. This leads to good performance both when there are many rules each of small scope and when there are a few rules each of large scope. In addition, rules provide either a forward-chaining or a backward-chaining control flow, and the system chooses the control mechanism that optimizes performance whenever possible. Priority rules can be defined, allowing a user to specify rule systems that have conflicts. This use of exceptions seems necessary in many applications. Database services such as views, protection, integrity constraints, and referential integrity can be obtained simply by applying the rules system in the appropriate way. Consequently, no special-purpose code need be included in POSTGRES to handle these tasks.
Modular Architecture for High Performance Implementation of the FRR Algorithm
Authors: K. Sapiecha, R. Jorocki
Venue: IEEE Transactions on Computers (1990)

A novel VLSI-oriented architecture to compute the discrete Fourier transform is presented. It consists of a homogeneous structure of processing elements. The structure has a performance equal to 1/t transforms per second, where t is the time needed for the execution of a single butterfly computation or the time needed for the collection of a complete vector of samples, whichever is longer. Although the system is not optimal (it achieves O(N/sup 3/ log/sup 4/ N) area*time/sup 2/ performance), the architecture is modular and makes it possible to design a system which performs FFT of any size without any extra circuitry. Moreover, the system can provide a built-in self-test and self-restructuring. The modular system is easy to integrate. Processing elements (PEs) are connected to the neighboring PEs only, and form a linear network easy to implement in two and three dimensions. The number of pins required for a chip does not depend on the number of PEs integrated on it, nor on the size of the transform. The system consists of only one type of integrated circuit with a structure irrespective of the transform size, which considerably reduces the cost of implementation.
Natural language generation from plans
Authors: Chris Mellish, Roger Evans
Venue: Computational Linguistics (1989)

This paper addresses the problem of designing a system that accepts a plan structure of the sort generated by AI planning programs and produces natural language text explaining how to execute the plan. We describe a system that generates text from plans produced by the NONLIN planner (Tate 1976).The results of our system are promising, but the texts still lack much of the smoothness of human-generated text. This is partly because, although the domain of plans seems a priori to provide rich structure that a natural language generator can use, in practice a plan that is generated without the production of explanations in mind rarely contains the kinds of information that would yield an interesting natural language account. For instance, the hierarchical organization assigned to a plan is liable to reflect more a programmer's approach to generating a class of plans efficiently than the way that a human would naturally "chunk" the relevant actions. Such problems are, of course, similar to those that Swartout (1983) encountered with expert systems. In addition, AI planners have a restricted view of the world that is hard to match up with the normal semantics of natural language expressions. Thus constructs that are primitive to the planner may be only clumsily or misleadingly expressed in natural language, and the range of possible natural language constructs may be artificially limited by the shallowness of the planner's representations.
Implicit O(1) probe search
Authors: A. Fiat, M. Noar
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

Given a set of n elements from the domain 1, &hellip;, m, we investigate how to arrange them in a table of size n, so that searching for an element in the table can be done in constant time. Yao has shown that this cannot be done when the domain is sufficiently large as a function of n ([Yao]). [FNSS] have shown that this can be done when the domain is linear in the number of elements. We give a constructive solution when the domain m is polynomial in the number of elements n, and give a nonconstructive proof for m no larger than exponential in poly(n). We improve upon [Yao] and give better bounds on the maximum m for which implicit O(1) probe search can be done. We achieve our results by showing the tight relationship between hashing and certain encoding problems.
Design of partially replicated distributed database systems: an integrated methodology
Authors: R. Mukkamala, S. C. Bruell, R. K. Shultz
Venue: Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1988)

The objective of this research is to develop and integrate tools for the design of partially replicated distributed database systems. Many existing tools are inappropriate for designing large-scale distributed databases due to their large computational requirements. Our goal is to develop tools that solve the design problems reasonably quickly, typically by using heuristic algorithms that provide approximate or near-optimal solutions. In developing this design methodology, we assume that information regarding the types of user requests and their rates of arrival into the system is known a priori. The methodology assumes a general model for transaction execution. In this paper we discuss three aspects of the design methodology: the data allocation problem, the use of a static load-balancing scheme in coordination with the allocation scheme, and the design evaluation and review step. Our methodology employs iterative design techniques using performance evaluation as a means to iterate.
Policy, expections, problems. The DePauw experience with allocating workstationsto every faculty member
Authors: Jennis Pruett
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

This paper features an in-progress policy and progression of a three year program designed to put a computer station on the desk of any faculty member who needs one. It features the definitions of both &ldquo;workstation&rdquo; and &ldquo;faculty member&rdquo;, along with standardization revelations and policymaking factors. Covering the special case members and problems involved, it deals with the university as one large entity composed of small factions with individual needs. It exemplifies the solutions we arrived at and exposes areas that any center should take caution approaching. The degree of enthusiasm, progression of the participants, and results of the program are analyzed.
Efficient solution of linear diophantine equations
Authors: Michael Clausen, Albrecht Fortenbacher
Venue: Journal of Symbolic Computation (1989)

This paper presents a new method for finding complete information about the set of all nonnegative integer solutions of homogeneous and inhomogeneous linear diophantine equations. Such solutions are fundamental for associative-commutative unification. Our algorithm finds all minimal solutions as ''monotone'' paths in a graph which encodes the linear diophantine equation. This encoding makes repeated arithmetic operations obsolete and allows inexpensive tests for minimality of solutions. This graph algorithm compares favourably with the known methods, namely lexicogragraphic algorithm and completion procedure. A PASCAL implementation can be found in the Appendix.
Translation-Lookaside Buffer Consistency
Authors: Patricia J. Teller
Venue: Computer (1990)

Nine solutions to the cache consistency problem for shared-memory multiprocessors with multiple translation-lookaside buffers (TLBs) are described. A TLB's function is defined, and it is shown how TLB inconsistency arises in uniprocessor and multiprocessor architectures. The problem of TLB consistency is solved in a uniprocessor and in multiprocessors with a shared bus, virtual-address caches, and hardware cache consistency. Solutions that can be implemented in multiprocessors with more general interconnection networks and without hardware cache consistency are presented.
Signal Probabilities in AND-OR Trees
Authors: L. Lipsky, S. C. Seth
Venue: IEEE Transactions on Computers (1989)

The authors consider a class of AND-OR tree circuits and study their response to random-pattern inputs as the depth of the tree is allowed to increase indefinitely. Each binary input of a circuit is independently chosen to be one (zero) with probability x (1-x). The logic of the circuit determines the probability of success (one) at the output as a monotonically increasing S-shaped function of x called the probability transfer function. The probability transfer function of an AND-OR tree is shown to have just one interior fixed point (with respect to changes in depth of the tree) in the.
Calculating approximate curve arrangements using rounded arithmetic
Authors: V. Milenkovic
Venue: Proceedings of the fifth annual symposium on Computational geometry (1989)

We present here an algorithm for the curve arrangement problem: determine how a set of planar curves subdivides the plane. This algorithm uses rounded arithmetic and generates an approximate result. It can be applied to a broad class of planar curves, and it is based on a new definition of approximate curve arrangements. This result is an important step towards the creation of practical computer programs for reasoning about algebraic curves of high degree.
Solid representation and operation using extended octrees
Authors: Pere Brunet, Isabel Navazo
Venue: ACM Transactions on Graphics (TOG) (1990)

Solid modelers must be based on reliable and fast algorithms for Boolean operations. The octree model, as well as several generalizations (polytrees, integrated polytrees, extended octrees), is specially well suited for these algorithms and can be used either as a primary or as a secondary model in solid modeling systems. This paper is concerned with a precise definition of the extended octree model that allows the representation of nonmanifold objects with planar faces and, consequently, is closed under Boolean operations on polyhedrons. Boolean nodes and nearly vertex nodes are introduced, and the model is discussed in comparison with related representations. A fast algorithm for the direct generation of the extended octree from the geometry of the base polygon in extrusion solids is presented, and its complexity is studied. Boolean operation algorithms are introduced.
Experiences in preparing a DOD-STD-2167A software design document for an Ada project
Authors: C. Meyer, S. Lindholm, J. Jensen
Venue: Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment (1989)

This paper describes our experiences in using OOD and Ada in developing a Software Design Document (SDD) in accordance with DoD-STD-2167A. The paper first provides an overview of the SDD requirements stated in 2167A. It next describes the initial objectives and assumptions under which we began the project, then discusses the problems we encountered while trying to achieve our objectives and satisfy 2167A requirements. Three different categories of problems are described: those dealing with precise definitions of terms used in 2167A; those dealing with 2167A document format requirements; and, those dealing with satisfying customer expectations. The paper then describes the specific lessons we learned during this project, and finishes with some overall conclusions.
Surface Orientation from Projective Foreshortening of Isotropic Texture Autocorrelation
Authors: L.G. Brown, H. Shvayster
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A method for determining local surface orientation from the autocorrelation function of statistically isotropic textures is introduced. It relies on the foreshortening that occurs in the image of an oriented surface, and the analogous foreshortening produced in the texture-autocorrelation function. This method assumes textural isotropy, but does not require the texture to be composed of texels or assume other texture regularities. The technique was applied to natural images of planar-textured surfaces and found to give good results. The simplicity of the method and its use of information from all parts of the image are emphasized.
How a personal document's intended use or purpose affects its classification in an office
Authors: B. Kwasnik
Venue: ACM SIGIR Forum (1989)

This paper reports on one of the findings of a larger case study that attempts to describe how people organize documents in their own offices. In that study, several dimensions along which people make classificatory decisions were identified. Of these, the use to which a document is put emerged as a strong determiner of that document's classification. The method of analysis is reviewed, and examples of different kinds of uses are presented, demonstrating that it is possible to describe a wide variety of specific instances using a closed set of descriptors. The suggestion is made that, in designing systems for organizing materials, it might be advantageous to incorporate information about contextual variables, such as use, since these seem to be particularly important in classification decisions made within personal environments.
The cognitive coprocessor architecture for interactive user interfaces
Authors: G. Robertson, S. K. Card, J. D. Mackinlay
Venue: Proceedings of the 2nd annual ACM SIGGRAPH symposium on User interface software and technology (1989)

The graphics capabilities and speed of current hardware systems allow the exploration of 3D and animation in user interfaces, while improving the degree of interaction as well. In order to fully utilize these capabilities, new software architectures must support multiple, asynchronous, interacting agents (the Multiple Agent Problem), and support smooth interactive animation (the Animation Problem). The Cognitive Coprocessor is a new user interface architecture designed to solve these two problems, while supporting highly interactive user interfaces that have 2D and 3D animations. This architecture includes 3D Rooms, a 3D analogy to the Rooms system with Rooms Buttons extended to Interactive Objects that deal with 3D, animation, and gestures. This research is being tested in the domain of Information Visualization, which uses 2D and 3D animated artifacts to represent the structure of information. A prototype, called the Information Visualizer, has been built.