ppxscal/embedding_network huggingface dataset:
The cognitive jogthrough: a fast-paced user interface evaluation procedure
Authors: David E. Rowley, David G. Rhoades
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

Walkthrough techniques have been shown to be an effective supplement to empirical testing methods for evaluating the usability of software systems [3, 4]. Unfortunately, structured walkthrough procedures tend to be time-consuming and unpopular with evaluators when used on substantial tasks. To maximize the useful information obtained from walkthroughs while minimizing the overhead of the procedure itself, a fast-paced methodology was developed and used within the constraints of a real-world product development environment. By using video recording equipment and an informal, interactive evaluation session, the &ldquo;cognitive jogthrough&rdquo; procedure revealed significant user interface problems that could then be studied using other techniques.
The architecture of a memory management unit for object-oriented systems
Authors: Alberto R. Cunha, Carlos N. Ribeiro, José A. Marques
Venue: ACM SIGARCH Computer Architecture News (1991)

We describe the rationale for the design and the architecture of a Memory Management Unit (MMU) for object-oriented systems. The CAMOES1 MMU supports arbitrary size protected objects mapped on a single virtual address space. Support for object invocations is provided in the form of an operations cache closely coupled with the addressing hardware. The MMU only executes in hardware those functions crucial for performance; other functions and, namely, the management of internal buffers and associative memories, and object management policies, are handled in software. This functional organisation is suitable for current generation processors based on RISC principles and is able to support open multi-lingual environments.
Gross motion planning&mdash;a survey
Authors: Yong K. Hwang, Narendra Ahuja
Venue: ACM Computing Surveys (CSUR) (1992)

Motion planning is one of the most important areas of robotics research. The complexity of the motion-planning problem has hindered the development of practical algorithms. This paper surveys the work on gross-motion planning, including motion planners for point robots, rigid robots, and manipulators in stationary, time-varying, constrained, and movable-object environments. The general issues in motion planning are explained. Recent approaches and their performances are briefly described, and possible future research directions are discussed.
An a Priori Approach to the Evaluation of Signature Analysis Efficiency
Authors: P. Caspi, J. Piotrowski, R. Velazco
Venue: IEEE Transactions on Computers (1991)

The authors present an evaluation of signature analysis efficiency which does not rely on assumptions about the distribution of the analyzed error sequences. This is achieved through the use of an 'a priori randomization' technique, which leads to a choice of LFSRs (linear feedback shift registers) corresponding to randomly chosen irreducible polynomials of a given degree. As it does not make use of assumptions on the error distribution, the proposed evaluation is more pessimistic than the usual ones. In particular, it takes into account the length of the analyzed sequence. However, it can be valuable when the efficiency of signature analysis has to be guaranteed, for highly dependable applications for instance.
Machine translation again?
Authors: Yorick Wilks, Jaime Carbonell, David Farwell, Eduard Hovy, Sergei Nirenburg
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

Machine translation (MT) remains the paradigm task for natural language processing (NLP) since its inception in the 1950s. Unless NLP can succeed with the central task of machine translation, it cannot be considered successful as a field. We maintain that the most profitable approach to MT at the present time is an interlingual and modular one. MT is one the precious few computational tasks falling broadly within artificial intelligence (AI) that combine a fundamental intellectual research challenge with enormous proven need. To establish the latter, one only has to note that in Japan alone the current MT requirement is for 20 billion pages a year (a market of some $66 billion a year).
Report of the design methodologies subgroup
Authors: Bob Braudes
Venue: ACM SIGCHI Bulletin (1990)

This report summarizes the work of the methodology subgroup from the "Taking Design Seriously" workshop held during the 1990 ACM SIGCHI Conference at Seattle, Washington. Due to the relatively short duration of the workshop, significant breakthroughs and discoveries were not anticipated; rather, the subgroup discussed issues which were considered important in design. There was common interest in the area of modelling tasks and task execution, and this became the major problem addressed by the subgroup. With this motivation, we looked at the various influences on determining the tasks and interaction sequences, and collectively evolved a design methodology (which is a subset of a larger development methodology not addressed by the subgroup), shown in Figure 1. Finally, we proceeded to focus in on one small part of that design methodology for detailed examination, displayed in Figure 2.
The Turing Test and the economist
Authors: Stuart C. Shapiro
Venue: ACM SIGART Bulletin (1992)

I have always thought the Turing Test a perfectly good test for AI, and I want to say briefly why.
Numerical stability of algorithms for 2D Delaunay triangulations
Authors: Steven Fortune
Venue: Proceedings of the eighth annual symposium on Computational geometry (1992)

We show that two Delaunay triangulation algorithms, a diagonal-flipping algorithm and an incremental algorithm, can be implemented in approxiamte arithmetic. The two algorithms have worst-case running time O(n2) on a set of n sites. The correctness assertion is that the algorithms produce a triangulation of the set of sites so that each triangle has an &ldquo;almost empty&rdquo; circumcircle, i.e., a circumscribing pseudocircle slightly contracted from the circumcircle contains no sites in its interior.
Working with Persistent Objects: To Swizzle or Not to Swizzle
Authors: J. Eliot B. Moss
Venue: IEEE Transactions on Software Engineering (1992)

Pointer swizzling is the conversion of database objects between an external form (object identifiers) and an internal form (direct memory pointers). Swizzling is used in some object-oriented databases, persistent object stores, and persistent and database programming language implementations to speed manipulation of memory resident data. The author describes a simplifying model of application behavior, revealing those aspects where swizzling is most relevant in both benefits and costs. The model has a number of parameters, which the authors have measured for a particular instance of the Mneme persistent object store, varying the swizzling technique used. The results confirm most of the intuitive, qualitative tradeoffs, with the quantitative data showing that some performance differences between schemes are smaller than might be expected. However, there are some interesting effects that run counter to naive intuition, most of which are explained using deeper analysis of the algorithms and data structures.
A Formal Model of Program Dependences and its Implications for Software Testing, Debugging, and Maintenance
Authors: A. Podgurski, L. A. Clarke
Venue: IEEE Transactions on Software Engineering (1990)

A formal, general model of program dependences is presented and used to evaluate several dependence-based software testing, debugging, and maintenance techniques. Two generalizations of control and data flow dependence, called weak and strong syntactic dependence, are introduced and related to a concept called semantic dependence. Semantic dependence models the ability of a program statement to affect the execution behavior of other statements. It is shown that weak syntactic dependence is a necessary but not sufficient condition for semantic dependence and that strong syntactic dependence is necessary but not sufficient condition for a restricted form of semantic dependence that is finitely demonstrated. These results are used to support some proposed uses of program dependences, to controvert others, and to suggest new uses.
Proxy: an interpreter for rapid prototyping
Authors: Burt Leavenworth
Venue: ACM SIGPLAN Notices (1992)

Proxy is an interpreter for a rapid prototyping language with C/C++ like syntax based on modelling software using data structures such as sets, maps, sequences, and objects. It allows the developer to make incremental changes to a design and test them immediately."The hardest single part of building a software system is deciding precisely what to build" - Fred Brooks [3].
Tools for building asynchronous servers to support speech and audio applications
Authors: Barry Arons
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

Distributed client/server models are becoming increasingly prevalent in multimedia systems and advanced user interface design. A multimedia application, for example, may play and record audio, use speech recognition input, and use a window system for graphical I/O. The software architecture of such a system can be simplified if the application communicates to multiple servers (e.g., audio servers, recognition servers) that each manage different types of input and output. This paper describes tools for rapidly prototyping distributed asynchronous servers and applications, with an emphasis on supporting highly interactive user interfaces, temporal media, and multi-modal I/O. The Socket Manager handles low-level connection management and device I/O by supporting a callback mechanism for connection initiation, shutdown, and for reading incoming data. The Byte Stream Manager consists of an RPC compiler and run-time library that supports synchronous and asynchronous calls, with both a programmatic interface and a telnet interface that allows the server to act as a command interpreter. This paper details the tools developed for building asynchronous servers, several audio and speech servers built using these tools, and applications that exploit the features provided by the servers.
Discovery through experimentation: Art and educational computing in secondary schools
Authors: Dennis Crawley, Judy Sachter, Carol Sutton, Anna Ursyn, Jackie White
Venue: ACM SIGGRAPH Computer Graphics (1991)

Secondary schools now offer computer graphics courses which meld the disciplines of the arts and sciences. Students are demanding more than the required computer literacy courses and are challenging their teachers to incorporate graphics into their specific area(s) of interest. Many courses are offered through their art departments and with specialized courses in science and math. Cooperative learning is beneficial since facilities, equipment and resources are major impediments. Students sharing computers and teaching one another have become commonplace.This panel of secondary school educators will share their experiences with curriculum, research, administrative support and examples of student work. Each panel member brings to this endeavor enthusiasm and personal pride in their research and individual school programs.
Liveboard: a large interactive display supporting group meetings, presentations, and remote collaboration
Authors: Scott Elrod, Richard Bruce, Rich Gold, David Goldberg, Frank Halasz, William Janssen, David Lee, Kim McCall, Elin Pedersen, Ken Pier, John Tang, Brent Welch
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

This paper describes the Liveboard, a large interactive display system. With nearly one million pixels and an accurate, multi-state, cordless pen, the Liveboard provides a basis for research on user interfaces for group meetings, presentations and remote collaboration. We describe the underlying hardware and software of the Liveboard, along with several software applications that have been developed. In describing the system, we point out the design rationale that was used to make various choices. We present the results of an informal survey of Liveboard users, and describe some of the improvements that have been made in response to user feedback. We conclude with several general observations about the use of large public interactive displays.
Testing for Coupled Cells in Random-Access Memories
Authors: J. Savir, W. H. McAnney, S. R. Vecchio
Venue: IEEE Transactions on Computers (1991)

Two test strategies for memory testing are compared for their ability to detect coupled-cell faults in an n-word-by-1-bit random access memory. In both strategies the data-in line is randomly driven. One of the two strategies uses random selection of both the address lines and the read/write control. The other strategy sequentially cycles through the address space with deterministic setting of the read/write control. The relative merit of the two strategies is measured by the average number of accesses per address needed to meet a standard test quality level.
A pilot card-based hypermedia integrated with a layered architecture-based OODB and an object-forwarding mail system
Authors: Satoshi Ichimura, Yutaka Matsushita
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

The goal of our project is to develop a PilotCard-based hypermedia which allows users to create the connecting network of links through the use of an electronic mail system. Based on the goal, we developed an underlying Object-Oriented database management system with a layered architecture to combine personal work environments and a team cooperative work environment effectively. This integration provides the basis of groupware applications.
One-Pass Parallel Thinning: Analysis, Properties, and Quantitative Evaluation
Authors: Ben K. Jang, Roland T. Chin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A one-pass parallel thinning algorithm based on a number of criteria, including connectivity, unit-width convergence, medial axis approximation, noise immunity, and efficiency, is proposed. A pipeline processing model is assumed for the development. Precise analysis of the thinning process is presented to show its properties, and proofs of skeletal connectivity and convergence are provided. The proposed algorithm is further extended to the derived-grid to attain an isotropic medial axis representation. A set of measures based on the desired properties of thinning is used for quantitative evaluation of various algorithms. Image reconstruction from connected skeletons is also discussed. Evaluation shows that the procedures compare favorably to others.
A program for computing Puiseux expansions
Authors: V. Baladi, J.-P. Guillement
Venue: ACM SIGSAM Bulletin (1990)

We describe a new Pascal implementation, due to the second author, of programs of the first author which help study singularities of plane algebraic curves. Given an algebraic plane singularity (not necessarily irreducible), represented by a two-variable polynomial (with rational coefficients), the main program uses the algorithm of Newton and Puiseux to compute the initial part of all the Puiseux expansions. All computations in algebraic extensions of the rationals are done symbolically.There is an auxiliary subprogram to compute the two-variable polynomial equation for a singularity given by finite Puiseux expansions. Some of the algebraic subprograms (manipulations of polynomials etc.) are also accessible interactively.
Bounds on the number of complete subgraphs
Authors: David C. Fisher, Jennifer Ryan
Venue: Discrete Mathematics (1992)

Let G be a graph with a clique number w. For 1jw, let kj be the number of complete subgraphs on j nodes. We show that . This is exact for complete balanced w-partite graphs and gives Turan theorem when j = 1. A coronally is w (8k329k23+3k316k32+9k23)/(4k3218k23. This new bound on the clique number supercedes an earlier bound from Turan's theorem.
Increased Memory Performance During Vector Accesses Through the Use of Linear Address Transformations
Authors: D. T. Harper,  III
Venue: IEEE Transactions on Computers (1992)

A technique to analyze transformation matrices is presented. This technique is based on decomposing complex transformations into elementary transformations. When combined with a factorization of the access stride into two components, one a power of 2 and the other relatively prime to 2, the technique leads to an algorithmic synthesis of a CF (conflict free) storage scheme. Additionally, because the address to storage location mapping arithmetic is performed modulo 2, the time required to transform an address to its corresponding storage location is smaller and the hardware cost is lower than if schemes based on row rotation were used.
Leader election in complete networks
Authors: Gurdip Singh
Venue: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing (1992)

This paper presents protocols for leader election in complete networks. The protocols are message optimal and their time complexities are a significant improvement over currently known protocols for this problem. For asynchronous complete networks with sense of direction, we propose a protocol which requires O(N) messages and O(log N) time. For asynchronous complete network without sense of direction, we show that &Ohgr;(N/log N) is a lower bound on the time complexity of any message optimal election protocol and we present a family of protocols which requires O(Nk) messages and O(N/k) time, log N &le; k &le; N. Our results also improve the time complexity of several other related problems such as spanning tree construction, computing a global function, etc.
Task-analytic approach to the automated design of graphic presentations
Authors: Stephen M. Casner
Venue: ACM Transactions on Graphics (TOG) (1991)

BOZ is an automated graphic design and presentation tool that designs graphics based on an analysis of the task for which a graphic is intended to support. When designing a graphic, BOZ aims to optimize two ways in which graphics help expedite human performance of information-processing tasks: (1) allowing users to substitute simple perceptual inferences in place of more demanding logical inferences, and (2) streamlining users' search for needed information. BOZ analyzes a logical description of a task to be performed by a human user and designs a provably equivalent perceptual task by substituting perceptual inferences in place of logical inferences in the task description. BOZ then designs and renders an accompanying graphic that encodes and structures data such that performance of each perceptual inference is supported and visual search is minimized. BOZ produces a graphic along with a perceptual procedure describing how to use the graphic to complete the task. A key feature of BOZ's approach is that it is able to design different presentations of the same information customized to the requirements of different tasks. BOZ is used to design graphic presentations of airline schedule information to support five different airline reservation tasks. Reaction time studies done with real users for one task and graphic show that the BOZ-designed graphic significantly reduces users' performance time to the task. Regression analyses link the observed efficiency savings to BOZ's two key design principles: perceptual inference substitutions and pruning of visual search.
ClearBoard: a seamless medium for shared drawing and conversation with eye contact
Authors: Hiroshi Ishii, Minoru Kobayashi
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

This paper introduces a novel shared drawing medium called ClearBoard. It realizes (1) a seamless shared drawing space and (2) eye contact to support realtime and remote collaboration by two users. We devised the key metaphor: &ldquo;talking through and drawing on a transparent glass window&rdquo; to design ClearBoard. A prototype of ClearBoard is implemented based on the &ldquo;Drafter-Mirror&rdquo; architecture. This paper first reviews previous work on shared drawing support to clarify the design goals. We then examine three methaphors that fulfill these goals. The design requirements and the two possible system architectures of ClearBoard are described. Finally, some findings gained through the experimental use of the prototype, including the feature of &ldquo;gaze awareness&rdquo;, are discussed.
A unified approach to the decomposition and re-decomposition of sequential machines
Authors: Pranav Ashar, Srinivas Devadas, A. Richard Newton
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

We present a unified framework and associated algorithms for the optimal decomposition and re-decomposition of sequential machines. This framework allows for a uniform treatment of arbitrary decomposition topologies operating at the State Transition Graph (STG) level, while targeting a cost function that is close to the eventual logic implementation. Previous work has targeted specific decomposition topologies via the formulation of decomposition as implicant covering with associated constraints. It is shown that this formulation can be used to target arbitrary desired topologies merely by customizing the constraints during implicant covering. It is shown how this work relates to preserved partitions and covers traditionally used in parallel and cascade decomposition, and how this formulation establishes the relationship between state assignment and FSM decomposition. In many cases, an initial decomposition is specified as a starting point. Attempting to flatten a set of interacting circuits into a single lumped STG in order to modify the decomposition structure could require astronomical amounts of CPU time and memory. Memory and CPU time efficient re-decomposition algorithms that operate on distributed-style specifications and which are more global than those presented in the past have been developed. These algorithms have been implemented in the sequential logic synthesis system, FLAMES, that is being developed at UCB/MIT.
Supply-chain management at Rowntree: critical success factors for APL
Authors: Adrian Smith
Venue: ACM SIGAPL APL Quote Quad (1991)

APL has been in use at Rowntree Mackintosh since late 1978; during this time it has developed from an initial application to "little local systems" to play a vital role in the supply-chain management of the company. APL systems are now deeply embedded in all stages of company operations, from recipe modelling to the scheduling of raw materials, from five-year planning to detailed shift-by-shift production scheduling.This paper sets out to explain the critical success factors which encouraged the directors of Rowntree Mackintosh to entrust such a vital part of their business operations to an obscure Greek language which executes backwards.
A method for (recruiting) methods: facilitating human factors input to system design
Authors: K. Y. Lim, J. B. Long
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

The paper proposes that some current problems in recruiting human factors methods to system design might be alleviated by means of a structured human factors design framework. The explicit stage-wise design scope of such a framework would support the assignment of appropriate human factors methods to specific system design needs. As an illustration, the design framework of an in-house structured human factors methodology is reviewed followed by the assignment of a set of existing human factors methods against its design stages. Subsequent steps to develop the assigned methods into a similar methodology are then described. The potential of such a methodology for facilitating human factors input is discussed.