ppxscal/embedding_network huggingface dataset:
Introductory course in human computer interaction
Authors: G. W. Strong
Venue: ACM SIGCHI Bulletin (1989)

This is a course outline of an undergraduate course in the Information Systems program at Drexel University. It is usually taken during the third term of the Freshman year after two introductory courses in information systems and two courses in computer programming. Since students at Drexel are required to own or have access to a Macintosh computer during their first term, they are familiar with the Macintosh interface before this course is taken.
Improving round-trip time estimates in reliable transport protocols
Authors: P. Karn, C. Partridge
Venue: Proceedings of the ACM workshop on Frontiers in computer communications technology (1987)

As a reliable, end-to-end transport protocol, the ARPA Transmission Control Protocol (TCP) uses positive acknowledgements and retransmission to guarantee delivery. TCP implementations are expected to measure and adapt to changing network propagation delays so that its retransmission behavior balances user throughput and network efficiency. However, TCP suffers from a problem we call retransmission ambiguity: when an acknowledgement arrives for a segment that has been retransmitted, there is no indication which transmission is being acknowledged. Many existing TCP implementations do not handle this problem correctly. This paper reviews the various approaches to retransmission and presents a novel and effective approach to the retransmission ambiguity problem.
Dilation d embedding of a hyper-pyramid into a hypercube
Authors: C.-T. Ho, S. L. Johnsson
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

A P(k, d) hyper-pyramid is a level structure of k Boolean cubes where the cube at level i is of dimension id, and a node at level i - 1 connects to every node in a d dimensional Boolean subcube at level i, except for the leaf level k. Hyper-pyramids contain pyramids as proper subgraphs. We show that a P(k, d) hyper-pyramid can be embedded in a Boolean cube with minimal expansion and dilation d. The congestion is bounded from above by 2d+1/d+2 and from below by 1 + &lceil;2d-d/kd+1&rceil;. For P(k, 2) hyper-pyramids we present a dilation 2 and congestion 2 embedding. As a corollary a complete n-ary tree can be embedded in a Boolean cube with dilation max(2, &lceil;log2 n&rceil;) and expansion 2k&lceil;log2 n&rceil; + 1/nk+1-1/n-1. We also discuss multiple pyramid embeddings.
Hardware/software solutions for scientfic visualization at large reserach laboratories
Authors: L. Cook, G. Bancroft, K. Hussey, J. Dragon, W. Johnston
Venue: ACM SIGGRAPH 89 Panel Proceedings (1989)

Good morning. My name is Linnea Cook from Lawrence Livermore Laboratory. This session is a panel session on hardware and software solutions for scientific visualization that are being pursued at some of the large research laboratories in the United States. This panel originated because I saw and other people at Los Alamos saw that we were pursuing different avenues of -- and quite vehemently -- pursuing different avenues of meeting our graphics needs. In Livermore in particular there was real strife for several years over graphics terminals versus graphics workstations. I thought that other people may benefit from seeing why people are pursuing some of the solutions that they are.Today there are five of us who are going to discuss a little bit about what the environment is that we work in and what we're each doing to solve the graphic needs in our environments, and also why we think our solution is the best.Each panelist is going to and make an eight to 10 minute statement to that effect. I will give each panelist a complete introduction when they get up to speak.I suppose I should tell you a little bit about who I am before we get started. My background is in math and computer science. I have a BS/MS in that, and I am currently a group leader for one of the computer science groups that supports one of our large physics divisions at Lawrence Livermore Laboratory. Part of the work we do is to support our physicists with good computer graphics and I have been leading the graphics workstation effort for my group.Our first panelist to speak is Gordon Bancroft. He is from NASA Ames and he has a BS in aeronautics. He's been at NASA for six years, and is currently task manager of workstation applications, as part of the fluid dynamics division. He's involved in the creation of applications for visualization of fluid dynamic simulation. He has been involved in some of the procurement that NASA has been doing. Gordon.
Data Dependency Graphs for Ada Programs
Authors: Louise E. Moser
Venue: IEEE Transactions on Software Engineering (1990)

A compositional method of constructing data dependency graphs for Ada programs is presented. These graphs are useful in a program development environment for analyzing data dependencies and tracking information flow within a program. Graphs for primitive program statements are combined together to form graphs for larger program units. Composition rules are described for iteration, recursion, exception handling, and tasking, as well as for simpler Ada constructs. The correctness of the construction and the practicality of the technique are discussed.
On the properties of approximate mean value analysis algorithms for queueing networks
Authors: K. R. Pattipati, M. M. Kostreva
Venue: Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1988)

This paper presents new formulations of the approximate mean value analysis (MVA) algorithms for the performance evaluation of closed product-form queueing networks. The key to the development of the algorithms is the derivation of vector nonlinear equations for the approximate network throughput. We solve this set of throughput equations using a nonlinear Gauss-Seidel type distributed algorithms, coupled with a quadratically convergent Newton's method for scalar nonlinear equations. The throughput equations have enabled us to: (a) derive bounds on the approximate throughput; (b) prove the existence, uniqueness, and convergence of the Schweitzer-Bard (S-B) approximation algorithm for a wide class of monotone, single class networks, (c) establish the existence of the S-B solution for multi-class, monotone networks, and (d) prove the asymptotic (i.e., as the number of customers of each class tends to &infin;) uniqueness of the S-B throughput solution, and the asymptotic convergence of the various versions of the distributed algorithms in multi-class networks with single server and infinite server nodes. The asymptotic convergence is established using results from convex programming and convex duality theory. Extension of our algorithms to mixed networks is straighfoward. Only multi-class results are presented in this paper.
A variable-arity procedural interface
Authors: R. Kent Dybvig, Robert Hieb
Venue: Proceedings of the 1988 ACM conference on LISP and functional programming (1988)

This paper presents a procedural interface that handles optional arguments and indefinite numbers of arguments in a convenient and efficient manner without resorting to storing the arguments in a language-dependent data structure. This interface solves many of the problems inherent in the use of lists to store indefinite numbers of arguments. Simple recursion can be used to consume such arguments without the complexity problems caused by the use of the Lisp procedure apply on argument lists. An extension that supports multiple return values is also presented.
A Class of Inherently Fault Tolerant Distributed Programs
Authors: F. B. Bastani, I.-L. Yen, I.-R. Chen
Venue: IEEE Transactions on Software Engineering (1988)

Software for industrial process-control systems, such as nuclear power plant safety control systems and robots, can be very complex because of the large number of cases that must be considered. A design approach is proposed that uses decentralized control concepts, and is based on E.W. Dijkstra's concept of self-stabilizing systems (1974). This method greatly simplifies the software, so that its correctness can be verified more easily. A simple control system is described for a simulated robot that is tolerant of partial failure of controllers and mechanisms, and permits online repair and enhancement of the control functions.
Functional computations in logic programs
Authors: Saumya K. Debray, David S. Warren
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1989)

Although the ability to simulate nondeterminism and to compute multiple solutions for a single query is a powerful and attractive feature of logic programming languages, it is expensive in both time and space. Since programs in such languages are very often functional, that is, they do not produce more than one distinct solution for a single input, this overhead is especially undesirable. This paper describes how programs may be analyzed statically to determine which literals and predicates are functional, and how the program may then be optimized using this information. Our notion of &ldquo;functionality&rdquo; subsumes the notion of &ldquo;determinacy&rdquo; that has been considered by various researchers. Our algorithm is less reliant on language features such as the cut, and thus extends more easily to parallel execution strategies, than others that have been proposed.
Architectural mechanisms to support sparse vector processing
Authors: R. N. Ibbett, T. M. Hopkins, K. I. M. McKinnon
Venue: ACM SIGARCH Computer Architecture News (1989)

We discuss the algorithmic steps involved in common sparse matrix problems, with particular emphasis on linear programming by the revised simplex method. We then propose new architectural mechanisms which are being built into an experimental machine, the Edinburgh Sparse Processor, and which enable vector instructions to operate efficiently on sparse vectors stored in compressed form. Finally, we review the use of these new mechanisms on the linear programming problem.
Randomized algorithms and pseudorandom numbers
Authors: Howard Karloff, Prabhakar Raghavan
Venue: Proceedings of the twentieth annual ACM symposium on Theory of computing (1988)

Randomized algorithms are analyzed as if unlimited amounts of perfect randomness were available, while pseudorandom number generation is usually studied from the perspective of cryptographic security. Bach recently proposed studying the interaction between pseudorandom number generators and randomized algorithms. We follow Bach's lead; we assume that a (small) random seed is available to start up a simple pseudorandom number generator which is then used for the randomized algorithm. We study randomized algorithms for (1) sorting; (2) selection; and (3) oblivious routing in networks.
Organization and performance of a two-level virtual-real cache hierarchy
Authors: W. H. Wang, J.-L. Baer, H. M. Levy
Venue: ACM SIGARCH Computer Architecture News (1989)

We propose and analyze a two-level cache organization that provides high memory bandwidth. The first-level cache is accessed directly by virtual addresses. It is small, fast, and, without the burden of address translation, can easily be optimized to match the processor speed. The virtually-addressed cache is backed up by a large physically-addressed cache; this second-level cache provides a high hit ratio and greatly reduces memory traffic. We show how the second-level cache can be easily extended to solve the synonym problem resulting from the use of a virtually-addressed cache at the first level. Moreover, the second-level cache can be used to shield the virtually-addressed first-level cache from irrelevant cache coherence interference. Finally, simulation results show that this organization has a performance advantage over a hierarchy of physically-addressed caches in a multiprocessor environment.
An improved automatic lipreading system to enhance speech recognition
Authors: E. Petajan, B. Bischoff, D. Bodoff, N. M. Brooke
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1988)

Current acoustic speech recognition technology performs well with very small vocabularies in noise or with large vocabularies in very low noise. Accurate acoustic speech recognition in noise with vocabularies over 100 words has yet to be achieved. Humans frequently lipread the visible facial speech articulations to enhance speech recognition, especially when the acoustic signal is degraded by noise or hearing impairment. Automatic lipreading has been found to improve significantly acoustic speech recognition and could be advantageous in noisy environments such as offices, aircraft and factories. An improved version of a previously described automatic lipreading system has been developed which uses vector quantization, dynamic time warping, and a new heuristic distance measure. This paper presents visual speech recognition results from multiple speakers under optimal conditions. Results from combined acoustic and visual speech recognition are also presented which show significantly improved performance compared to the acoustic recognition system alone.
A Visual Language Compiler
Authors: Shi-Kuo Chang, Michael J. Tauber, Bing Yu
Venue: IEEE Transactions on Software Engineering (1989)

The SIL-ICON compiler is a software system for the specification, interpretation, prototyping, and generation of icon-oriented systems. The system design of the SIL-ICON compiler is presented. The icon system G, the icon dictionary ID, the operator dictionary OD, and the extended task action grammar ETAG are described. An application example to design a text editor using the Heidelberg icon set is also presented in detail.
Transformational programming: the derivation of a Prolog interpretation algorithm
Authors: M. Y. Zhu
Venue: ACM SIGPLAN Notices (1989)

In this paper we will present a case study for the transformational programming technique. The problem we intend to study is the construction of an interpreter for the logic programming language Prolog. We will start from a formal algebraic semantic definition of Prolog, through a series of transformations, step by step, reach a compact and efficient implementation written in programming language Ada. The whole development process are carried out with the support of a software development system called AUTO STAR (AUTOmatic Specification To Ada Realization).
A transient hypergraph-based model for data access
Authors: Carolyn Watters, Michael A. Shepherd
Venue: ACM Transactions on Information Systems (TOIS) (1990)

Two major methods of accessing data in current database systems are querying and browsing. The more traditional query method returns an answer set that may consist of data values (DBMS), items containing the answer (full text), or items referring the user to items containing the answer (bibliographic). Browsing within a database, as best exemplified by hypertext systems, consists of viewing a database item and linking to related items on the basis of some attribute or attribute value. A model of data access has been developed that supports both query and browse access methods. The model is based on hypergraph representation of data instances. The hyperedges and nodes are manipulated through a set of operators to compose new nodes and to instantiate new links dynamically, resulting in transient hypergraphs. These transient hypergraphs are virtual structures created in response to user queries, and lasting only as long as the query session. The model provides a framework for general data access that accommodates user-directed browsing and querying, as well as traditional models of information and data retrieval, such as the Boolean, vector space, and probabilistic models. Finally, the relational database model is shown to provide a reasonable platform for the implementation of this transient hypergraph-based model of data access.
Computational Complexity of Controllability/Observability Problems for Combinational Circuits
Authors: Hideo Fujiwara
Venue: IEEE Transactions on Computers (1990)

The computational complexity of fault detection problems and various controllability and observability problems for combinational logic circuits are analyzed. It is shown that the fault detection problem is still NP-complete for monotone circuits limited in fanout, i.e. when the number of signal lines which can out from a signal line is limited to two. It is also shown that the observability problem for unate circuits is NP-complete, but that the controllability problem for unate circuits can be solved in time complexity O(m), where m is the number of lines in a circuit. Two classes of circuits, called k-binate-bounded circuits and k-bounded circuits, are then introduced. For k-binate-bounded circuits the controllability problem is solvable in polynomial time, and for k-bounded circuits the fault detection problem is solvable in polynomial time, when k>or=log p(m) for some polynomial p(m). The class of k-bounded circuits includes many practical circuits such as decoders, adders, one-dimensional cellular arrays, and two-dimensional cellular arrays.
Segmentation of Textured Images and Gestalt Organization Using Spatial/Spatial-Frequency Representations
Authors: T. R. Reed, H. Wechsler
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

The generic issue of clustering/grouping is addressed. Recent research, both in computer and human vision, suggests the use of joint spatial/spatial-frequency (s/sf) representations. The spectrogram, the difference of Gaussians representation, the Gabor representation, and the Wigner distribution are discussed and compared. It is noted that the Wigner distribution gives superior joint resolution. Experimental results in the area of texture segmentation and Gestalt grouping using the Wigner distribution are presented, proving the feasibility of using s/sf representations for low-level (early, preattentive) vision.
Using data partitioning to implement a parallel assembler
Authors: Howard P. Katseff
Venue: ACM SIGPLAN Notices (1988)

A technique for implementing algorithms on a multiprocessor computer system is data partitioning, in which input data for a problem is partitioned among many processors that cooperate to solve the problem. This paper demonstrates that data partitioning is a good method for implementing an assembler on a message-passing multiprocessor system: it yields a speedup exceeding a factor of 6 with eight processors. We compare several alternative methods for distributing program text and sharing global information among the processors executing the assembler: operations that are important for a variety of applications implemented with data partitioning.
REDUSA: module generation by automatic elimination of superfluous blocks in regular structures
Authors: I. Vandweerd, K. Croes, L. Rijnders, P. Six, H. De Man
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

This paper presents a new approach to module generation. It is based on the observation that a function, realized by a module instance (e.g. a 16-bit multiplier) when restricted to a sub-function, can be realized by a reduction of the instance to a sub-instance (e.g. a 8-bit multiplier). This reduction is performed automatically by REDUSA. It offers important advantages in both the construction and verification aspects of module generators.
A Bivariate Autoregressive Technique for Analysis and Classification of Planar Shapes
Authors: M. Das, M. J. Paulik, N. K. Loh
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A bivariate autoregressive model is introduced for the analysis and classification of closed planar shapes. The boundary coordinate sequence of a digitized binary image is sampled to produce a polygonal approximation to an object's shape. This circular sample sequence is then represented by a vector autoregressive difference equation which models the individual Cartesian coordinate sequences as well as coordinate interdependencies. Several classification features which are functions or transformations of the estimated coefficient matrices and the associated residual error covariance matrices are developed. These features are shown to be invariant to object transformations such as translation, rotation, and scaling. Laboratory experiments involving object sets representative of industrial shapes are presented. Superior classification results are demonstrated.
Dependence analysis for pointer variables
Authors: S. Horwitz, P. Pfeiffer, T. Reps
Venue: ACM SIGPLAN Notices (1989)

Our concern is how to determine data dependencies between program constructs in programming languages with pointer variables. We are particularly interested in computing data dependencies for languages that manipulate heap-allocated storage, such as Lisp and Pascal. We have defined a family of algorithms that compute safe approximations to the flow, output, and anti-dependencies of a program written in such a language. Our algorithms account for destructive updates to fields of a structure and thus are not limited to the cases where all structures are trees or acyclic graphs; they are applicable to programs that build cyclic structures. Our technique extends an analysis method described by Jones and Muchnick that determines an approximation to the actual layouts of memory that can arise at each program point during execution. We extend the domain used in their abstract interpretation so that the (abstract) memory locations are labeled by the program points that set their contents. Data dependencies are then determined from these memory layouts according to the component labels found along the access paths that must be traversed during execution to evaluate the program's statements and predicates. For structured programming constructs, the technique can be extended to distinguish between loop-carried and loop-independent dependencies, as well as to determine lower bounds on minimum distances for loop-carried dependencies.
The data model is the heart of interface design
Authors: R. Akscyn, E. Yoder, D. McCracken
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1988)

For the past six years, we have been developing a commercial hypermedia system (KMS) based on our previous research with the ZOG system at Carnegie Mellon University. Our experience with ZOG and KMS has convinced us that the data model underlying an interactive system is more important than the user interface in shaping the overall system. In this paper, we show how the KMS data model has influenced important aspects of the user interface. In particular, we show how the properties of KMS frames&mdash;their spatial nature, breadth-first view, homogeneity, small size, etc.&mdash;affect the nature of the KMS user interface.