ppxscal/embedding_network huggingface dataset:
Data characterization for intelligent graphics presentation
Authors: Steven F. Roth, Joe Mattis
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

An automatic presentation system is an intelligent interface component which receives information from a user or application program and designs a combination of graphics and text that effectively conveys it. It is a facility that assumes the presentation responsibilities for other programs. An important research question has been how information should be specified or described by an application program for it to be presented by an automatic presenter. This paper proposes a taxonomy of information characteristics which would need to be provided to either human or computer designers for them to create presentations reflecting the individual needs of a diverse group of users. The proposed taxonomy of characteristics defines the representational goals for intelligent interfaces which reason about graphical displays.
A practical approach to software quality assurance
Authors: B. U. Livson
Venue: ACM SIGSOFT Software Engineering Notes (1988)

This report describes a comprehensive and practical approach to software quality assurance (SQA). The emphasis is on SQA organization, management and task profile on corporate basis. The relationships between SQA and systems engineering, software developer, project office, subcontractors, customer, and independent verification, validation and testing IVV amp;T are discussed. The SQA role in software configuration management (SCM) is covered. Software engineering methods, standards and tools that contribute to software quality are described. SQA manpower qualifications and the assignments SQA is capable of fulfilling as a function of the quality and quantity of available manpower are analyzed. The paper is based on the author's experience as manager of the Israel Aircraft Industries Ltd Engineering Division SQA from 1978-1986. No project specific data is presented and the approach presented should be valid both for embedded computer systems and data processing quality assurance.
Sparse Gaussian Elimination with Controlled Fill-In on a Shared Memory Multiprocessor
Authors: G. Alaghband, H. F. Jordan
Venue: IEEE Transactions on Computers (1989)

It is shown that in sparse matrices arising from electronic circuits, it is possible to do computations on many diagonal elements simultaneously. A technique for obtaining an ordered compatible set directly from the ordered incompatible table is given. The ordering is based on the Markowitz number of the pivot candidates. This technique generates a set of compatible pivots with the property of generating few fills. A novel heuristic algorithm is presented that combines the idea of an order-compatible set with a limited binary tree search to generate several sets of compatible pivots in linear time. An elimination set for reducing the matrix is generated and selected on the basis of a minimum Markovitz sum number. The parallel pivoting technique presented is a stepwise algorithm and can be applied to any submatrix of the original matrix. Thus, it is not a preordering of the sparse matrix and is applied dynamically as the decomposition proceeds. Parameters are suggested to obtain a balance between parallelism and fill-ins. Results of applying the proposed algorithms on several large application matrices using the HEP multiprocessor are presented and analyzed.
Rapid modeling: in the design of a new PCB manufacturing system
Authors: K. R. Anderson, G. W. Diehl
Venue: Proceedings of the 21st conference on Winter simulation (1989)

The ability to quickly model the production implications of changes from marketing, sales, finance, or engineering allows manufacturing enterprises to be pro-active in building competitive advantage. The power of a rapid modeling approach that assists manufacturing system designers and planners to evaluate their factory production systems is illustrated here. The study demonstrates how various members of an interdiciplinary design and analysis team can evaluate the process capabilities before introducing new methods and machines.
CHI systems, incorporated (lab review)
Authors: Wayne Zachary
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

CHI Systems Incorporated was formed in 1985 to provide high quality research and development services and products related to Computer-Human Interaction (CHI). We focus on specialized or expert domains &mdash; environments where the typical user is highly expert in the application task being performed. Within these domains, we emphasize: cognitive analysis of the task and the expertise it requires, allocation of functions between computer and human, and design of interfaces and intelligent support tools for domain-expert system users. We design and apply advanced methodologies and design/analysis tools for each of these steps. The primary domains in which we work are aerospace, command and control, and biotechnology. CHI Systems functions as both an applied and basic research laboratory. In applied research, we develop innovative solutions to real-world problems in CHI posed by our clients. In basic research, we investigate basic problems involved in the design and analysis of interfaces for domain-expert end-users. We also emphasize formal and/or theory-based approaches. We have developed tools for: formal specification of object-oriented interfaces, simulation-based function allocation and task analysis of new interface systems, cognitive analysis and functional design of decision support systems, and cognitive task analysis of CHI in real-time multitasking environments
Extensions of GOMS analyses to expert performance requiring perception of dynamic visual and auditory information
Authors: Bonnie E. John
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

GOMS models of telephone toll and assistance operators (TAOS) are being constructed in an effort to provide theoretical predictions of expert performance on several dedicated workstations. This applied effort has pushed the development of GOMS modeling techniques into the area of speech input and output, and into a task where information is not always available when it is required by the TAO. This paper describes the task, heuristics for constructing the GOMS models, and parameters for making quantitative predictions of performance time.
Representation and Display of Vector Field Topology in Fluid Flow Data Sets
Authors: James L. Helman, Lambertus Hesselink
Venue: Computer (1989)

The visualization of physical processes in general and of vector fields in particular is discussed. An approach to visualizing flow topology that is based on the physics and mathematics underlying the physical phenomenon is presented. It involves determining critical points in the flow where the velocity vector vanishes. The critical points, connected by principal lines or planes, determine the topology of the flow. The complexity of the data is reduced without sacrificing the quantitative nature of the data set. By reducing the original vector field to a set of critical points and their connections, a representation of the topology of a two-dimensional vector field is much smaller than the original data set but retains with full precision the information pertinent to the flow topology is obtained. This representation can be displayed as a set of points and tangent curves or as a graph. Analysis (including algorithms), display, interaction, and implementation aspects are discussed.
Shape Description with a Space-Variant Sensor: Algorithms for Scan-Path, Fusion, and Convergence Over Multiple Scans
Authors: Y. Yeshurun, E. L. Schwartz
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

The authors discuss three algorithms related to the blending of a single scene from multiple frames acquired from a space-variant sensor. Given a series of space-variant contour-based scenes with different fixation points, they show how to fuse these into a single multiscan view, which incorporates the information present in the individual scans. They demonstrate an (attentional) algorithm which recursively examines the current knowledge of the scene in order best to choose the next fixation point in terms of focusing attention on regions of maximum boundary curvature. They discuss a simple metric for evaluating convergence over a scan path. This may be used to compare the performance of various attentional algorithms. They discuss their work in light of both machine and biological vision.
Identification of Three-Dimensional Objects Using Range Information
Authors: A. P. Reeves, R. W. Taylor
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A method for identifying unoccluded three-dimensional objects from arbitrary viewing angles is presented. The technique uses synthetically generated range data in a model-based feature vector classification scheme. Fourier descriptors and moments are used for feature vector generation from, respectively, contour imagery, and silhouette or range imagery. A method is developed for generating an exhaustive set of library views and worst-case test views that is based on a polyhedral approximation to a sphere. Analysis of the success of this approach is made with experiments on a six-airplane data set. A model of range data noise is developed, and results are presented for both ideal and noisy lower-resolution image-classification tests. The use of multiple views for object identification is discussed, and results for one-, two-, and three-view tests are presented.
Protocol validation in complex systems
Authors: C. H. West
Venue: ACM SIGCOMM Computer Communication Review (1989)

Protocol validation and verification techniques have been applied successfully for a number of years to a wide range of protocols. The increasing complexity of our communications systems requires us to examine existing techniques and make a realistic assessment of which techniques will be applicable to the complex systems of the future. We believe that validation techniques based on an exhaustive reachability analysis will not be effective. Sampling techniques, such as executing a random walk through the reachable state space, are effective in complex systems, since most protocol errors occur in many different states of the system. More than 10 years have elapsed since the first automated validation techniques were first applied to communications protocols [1,2]. In the meantime, considerable advances have been made in validation technology, but more significantly, the scale and nature of the validation problem have changed. The communications systems that we need to validate today are significantly more complex than those of ten years ago. Our methods must evolve in order to address the current challenge. This paper is concerned primarily with the nature of the validation process, and the results that we might reasonably expect to achieve when validating protocols in complex communications systems.
Fault-Tolerant Matrix Triangularizations on Systolic Arrays
Authors: F. T. Luk, H. Park
Venue: IEEE Transactions on Computers (1988)

Examines the checksum methods of Abraham et al. for LU decomposition on multiprocessor arrays. Their methods are efficient for detecting a transient error, but expensive for correcting it due to the need for a computation rollback. The authors show how to avoid the rollback by using matrix updating techniques, and they introduce new checksum methods for Gaussian elimination with pairwise pivoting and for QR decomposition on systolic arrays.
Optimal parallel algorithms for polygon and point-set problems
Authors: R. Cole, M. T. Goodrich
Venue: Proceedings of the fourth annual symposium on Computational geometry (1988)

In this paper we give parallel algorithms for a number of problems defined on polygons and point sets. All of our algorithms have optimal T(n) * P(n) products, where T(n) is the time complexity and P(n) is the number of processors used, and are for the EREW PRAM or CREW PRAM models. In addition, our algorithms provide parallel analogues to well known phenomena from sequential computational geometry, such as the fact that problems for polygons can oftentimes be solved more efficiently that point-set problems, and that one can solve nearest-neighbor problems without explicitly constructing a Voronoi diagram.
Minimizability of Random Boolean Functions
Authors: H. Fleisher, J. Giraldi, R. Phoenix, M. Tavel
Venue: IEEE Transactions on Computers (1989)

The average number of prime k-cubes and essential k-cubes in an n-variable, single-output Boolean function has already been obtained combinationally. The authors show how the same quantities can be obtained geometrically, using the theory of random clumping and take an initial step in calculating, for k-cubes in the minimized form of a function. The authors compare their results to minimizations produced by ESPRESSO and a cruder algorithm.
Comments on 'Ternary Scan Design for VLSI Testability' by M. Hu and K.C. Smith
Authors: R. F. Molyneaux, A. Albicki
Venue: IEEE Transactions on Computers (1989)

An alternative design is found to be significantly faster than the one proposed by Hu and Smith. The performance of the alternative is compared to the original. A means to buffer the signal is presented and its performance is reported. An estimate of silicon area saved versus area spent is made.
Transputers + virtual tree kernel = real speedups
Authors: D. McBurney, M. R. Sleep
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

In [9] we describe a simple virtual tree architecture intended to exploit parallelism in recursive algorithms. The architecture, called ZAPP (Zero Assignment Parallel Processor), is relatively simple to implement using transputers. Early experiments with small configurations were encouraging both with respect to relative speedups and, somewhat to our surprise as ZAPP was simulated, absolute performance. In this paper we report more recent experiments with matrix multiplication and heuristic search applications on configurations involving between 12 and 32 transputers. The results support the conjecture that real speedups are obtainable from transputers using simple ZAPP-like diffusion techniques.
General decomposition of sequential machines: relationships to state assignment
Authors: S. Devadas
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

In this paper, we present new techniques for state assignment of finite state machines based on state machine decomposition algorithms. A finite state machine can be decomposed into smaller interacting machines so as to optimize area and performance of the eventual logic implementation. A recently proposed form of decomposition, which has been shown to be superior to previous decomposition methods, involves identifying subroutines or factors in the original machine and extracting these factors to produce factored and factoring machines. Optimal state assignment corresponds to finding an optimal multiple general decomposition of a finite state machine. We present state assignment techniques targeting two-level and multi-level logic implementations based on factorization algorithms followed by state assignment algorithms. For the two-level case, we prove that one-hot encoding a non-trivially factored machine is guaranteed to produce a better result than one-hot encoding the original machine. Experimental results indicate that this technique of factorization followed by state assignment is superior to previous state assignment techniques for large sequential machines, when targeting either two-level or multi-level implementations.
Static timing analysis of dynamically sensitizable paths
Authors: S. Perremans, L. Claesen, H. De Man
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

This paper describes a new method for solving the false path problem in static timing analysis of acyclic, combinational circuits. The conditions under which a path is false are accurately defined. The fact that these conditions explicitly take into account the dynamic behaviour of the circuit, constitutes the main contribution of the paper. An algorithm for computing the longest dynamically sensitizable paths in an acyclic, combinational circuit is presented.
High powers of matrices
Authors: L. J. Dickey
Venue: ACM SIGAPL APL Quote Quad (1987)

At the conference APL87 held in Dallas, Dr. Tama Traberman referred to problems associated with Markov Processes. Her example showed a Markov matrix and gave an algorithm for finding powers of that matrix. In this paper we discuss two different ways of decreasing the amount of arithmetic necessary to arrive at the results.
Constructing the Procedure Call Multigraph
Authors: David Callahan, Alan Carle, Mary Wolcott Hall, Ken Kennedy
Venue: IEEE Transactions on Software Engineering (1990)

An algorithm for constructing a precise call multigraph for languages that permit procedure parameters, extending the method of B. Ryder for handling recursion, is presented. If it is assumed that there is a constant upper bound on the number of procedure parameters to any procedure in the program, then the algorithm is polynomial in the total number of procedures in the program.
Using raddle to design distributed systems
Authors: M. Evangelist, V. Y. Shen, I. R. Forman, M. Graf
Venue: Proceedings of the 10th international conference on Software engineering (1988)

We describe our linguistic tool, Raddle, and its use in designing distributed systems. Raddle coordinates concurrent processes with the n-party interaction, a new high-level communication primitive. Another important feature of Raddle is the team, which encapsulates communicating processes. We discuss our efforts towards developing a complete methodology for using Raddle and briefly describe our software toolset.
A concurrent neural network algorithm for the traveling salesman problem
Authors: N. Toomarian
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

A binary neuromorphic data structure is used to encode the N &mdash; city Traveling Salesman Problem (TSP). In this representation the computational complexity, in terms of number of neurons, is reduced from Hopfield and Tank's &Ogr;(N2) to &Ogr;(N log2 N). A continuous synchronous neural network algorithm in conjunction with the LaGrange multiplier, is used to solve the problem. The algorithm has been implemented on the NCUBE hypercube multiprocessor. This algorithm converges faster and has a higher probability to reach a valid tour than previously available results.
A visual representation for knowledge structures
Authors: M. Travers
Venue: Proceedings of the second annual ACM conference on Hypertext (1989)

Knowledge-based systems often represent their knowledge as a network of interrelated units. Such networks are commonly presented to the user as a diagram of nodes connected by lines. These diagrams have provided a powerful visual metaphor for knowledge representation. However, their complexity can easily become unmanageable as the knowledge base (KB) grows. This paper describes an alternate visual representation for navigating knowledge structures, based on a virtual museum metaphor. This representation uses nested boxes rather than linked nodes to represent relations. The intricate structure of the knowledge base is conveyed by a combination of position, size, color, and font cues, MUE (Museum Unit Editor) was implemented using this representation to provide a graphic front end for the Cyc knowledge base.
The implementation of an algorithm in Macsyma: computing the formal solutions of differential systems in the neighborhood of regular singular point
Authors: G. Chen, I. Gil
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

We discuss in this paper the problems arised in the implementation in Macsyma of a direct algorithm for computing the formal solutions of differential systems in the neighborhood of regular singular point. The differential system to be considered is of the form xh dy/dx = A(x) y (1) with A(x) = A0 + A1 + &hellip; is an n by n matrices of formal series. This paper deals with system of the form (1) with h = 1. Another paper [3] has considered the systems with h > 1. So these two papers give complete consideration of systems in the form (1) in a neighborhood of both regular and irregular singular point without reducing the systems to super-irreducible forms, i.e. without knowing (for h > 1) a singular point is regular or irregular. The first step in the algorithm is to transform the leading matrix A0 to its Jordan form, for which we can use the algorithm in [1][11] that computes at first the Frobenius form and then reduces it to its Jordan form. The reduction from the Frobenius matrix to its Jordan matrix is based on a theorem in Wilkinson [13] which reduces each companion matrix to its Jordan matrix. One of the important aspects is that we don't compute the eigenvalues of the matrix but just keep them as the roots of some corresponding polynomials, i.e. they are looked as algebraic numbers. One simple case in the computations is that when the eigenvalues of the leading matrix A0 have no integer differences, which is called the generic case. The formal solutions of the differential system can be obtained by solving a linear system of the form A X - X B = C with A and B in Jordan form. The implementation of this resolution is immediate. Hence this gives the fundamental system of formal solutions wanted. For the general case, we should determine at first the integer differences of the eigenvalues of the matrix A0. A classical method is applied and implemented in Macsyma for our situation. Then we search for some transformations to reduce the differential system to the generic case. Then an interesting question arised: how to compute the Jordan normal form of the new leading matrix whose entries are rational functions of the eigenvalues which are algebraic numbers. We have studied these problems and proposed two algorithms for two different cases. These algorithms are implemented in Macsyma.
What to do when there's too much information
Authors: M. Lesk
Venue: Proceedings of the second annual ACM conference on Hypertext (1989)

Hypertext systems with small units of text are likely to drown the user with information, in the same way that online catalogs or bibliographic retrieval systems often do. Experiments with a catalog of 800,000 book citations have shown two useful ways of dealing with the &ldquo;too many hits&rdquo; problem. One is a display of phrases containing the excessively frequent words; another is a display of titles by hierarchical category. The same techniques should apply to other text-based retrieval systems. In general, interactive solutions seem more promising than attempts to do detailed query analysis and get things right the first time.