ppxscal/embedding_network huggingface dataset:
NetGraph: an object-oriented graphical toolset for risk assessment
Authors: Serdar Uckun, Benoit Dawant, Kazuhiko Kawamura
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

This article describes NetGraph, an object-oriented toolset for risk assessment applications. There are two significant aspects of NetGraph functionality. Firstly, NetGraph is a graphical knowledge acquisition tool for risk assessment, designed for robust structuring and efficient use of domain knowledge. A component library facility in NetGraph helps the domain expert to store and easily retrieve frequently encountered objects in complex systems. Time spent in designing fault trees is significantly reduced by the help of a cut/paste facility that allows the expert to easily define new fault trees by retrieving subtrees (components) of previously defined fault trees and putting them together. A second aspect of NetGraph is fault tree analysis. Fault trees designed in NetGraph can be used by either experts or operators to analyze fault behavior and probability of complex systems. A hypertext interface is also being developed to provide efficient communication of risks to individuals.
A case study in using two-level control stores
Authors: Onat Menzilcioglu
Venue: ACM SIGMICRO Newsletter (1988)

A two-level control store can reduce storage requirements of microprograms without affecting microprogrammability, which is important for a processor programmed directly in microcode. This paper presents a case study investigating how to use a two-level control store effectively. The study is based on Warp cell, a high-performance, microprogrammable processor used in a systolic array computer called Warp. Warp cell is programmed directly in microcode by an optimizing compiler and uses wide horizontal microinstructions with over 200 bits.Two methods which can increase the effectiveness of using a two-level control store have been considered. First, control store configuration can be adjusted so that the storage of an instruction can be partitioned among microstore and one or more nanostores to maximize storage efficiency. Second, it is possible to increase storage reduction of microprograms by exploiting insignificant and symmetric fields in instructions in mapping microprograms to the control store. It has been found that the average storage reduction for Warp cell programs can be increased from 41% in a straightforward two-level control store implementation to 72% by using these methods.
Computer-Access Security Systems Using Keystroke Dynamics
Authors: S. Bleha, C. Slivinsky, B. Hussien
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

An approach to securing access to computer systems is described. By performing real-time measurements of the time durations between the keystrokes when a password is entered and using pattern-recognition algorithms, three online recognition systems were devised and tested. Two types of passwords were considered: phrases and individual names. A fixed phrase was used in the identification system. Individual names were used as a password in the verification system and in the overall recognition system. All three systems were tested and evaluated. The identification system used 10 volunteers and gave an indecision error of 1.2%. The verification system used 26 volunteers and gave an error of 8.1% in rejecting valid users and an error of 2.8% in accepting invalid users. The overall recognition system used 32 volunteers and gave an error of 3.1% in rejecting valid users and an error of 0.5% in accepting invalid users.
Automatic registration of scanning electron microscope images
Authors: F. W. M. Stentiford, T. J. Twell
Venue: Microelectronic Engineering (1988)

A pattern recognition technique is described for the automatic registration of SEM images with the CAD design data so that electron beam positions can be located precisely over circuit nodes of interest. The approach has the advantage that many of the SEM image distortions do not affect the accuracy of the pattern matching algorithm.
Visualization of supercomputer simulations in physics
Authors: V. Watson, G. Bancroft, T. Plessel, F. Merritt, P. P. Walatka
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

Recent advances in computer graphics hardware and software have resulted in major improvements in our ability to experience computer simulations of physics by viewing dynamic three-dimensional scenes representing the simulations. This paper describes the hardware and software tools and techniques in use at NASA's Numerical Aerodynamic Simulation Facility for visualization of computational fluid dynamics. The visualization process is illustrated by video tapes and stereo pictures (available from the authors). The hardware consists of high-performance graphics workstations connected to the supercomputer with high-bandwidth lines, a frame buffer connected to the supercomputer with UltraNet, a digital video recording system, and film recorders. The software permits the scientist to dynamically view the 3D scenes, to zoom into a region of interest, and to rotate his viewing position to study any region of interest in more detail. The software also provides automated animation and video recording of the scenes. The digital effects unit on the video system facilitates comparison of computer simulations with flight or wind tunnel experiments. The current environment for computer simulations of physics is compared with an &ldquo;ideal&rdquo; environment to illustrate that major improvements in tools to help the scientist experience the simulations can be made by providing for a more natural and responsive user-interface, increasing the display field of view, and increasing the rate of scene creation.
Evaluating the performance of software cache coherence
Authors: S. Owicki, A. Agarwal
Venue: ACM SIGARCH Computer Architecture News (1989)

In a shared-memory multiprocessor with private caches, cached copies of a data item must be kept consistent. This is called cache coherence. Both hardware and software coherence schemes have been proposed. Software techniques are attractive because they avoid hardware complexity and can be used with any processor-memory interconnection. This paper presents an analytical model of the performance of two software coherence schemes and, for comparison, snoopy-cache hardware. The model is validated against address traces from a bus-based multiprocessor. The behavior of the coherence schemes under various workloads is compared, and their sensitivity to variations in workload parameters is assessed. The analysis shows that the performance of software schemes is critically determined by certain parameters of the workload: the proportion of data accesses, the fraction of shared references, and the number of times a shared block is accessed before it is purged from the cache. Snoopy caches are more resilient to variations in these parameters. Thus when evaluating a software scheme as a design alternative, it is essential to consider the characteristics of the expected workload. The performance of the two software schemes with a multistage interconnection network is also evaluated, and it is determined that both scale well.
Imprecise information and uncertainty in information systems
Authors: J. M. Morrissey
Venue: ACM Transactions on Information Systems (TOIS) (1990)

Information systems exist to model, store, and retrieve all types of data. Problems arise when some of the data are missing or imprecisely known or when an attribute is not applicable to a particular object. A consistent and useful treatment of such exceptions is necessary. The approach taken here is to allow any attribute value to be a regular precise value, a string denoting that the value is missing, a string denoting that the attribute is not applicable, or an imprecise value. The imprecise values introduce uncertainty into query evaluation, since it is no longer obvious which objects should be retrieved. To handle the uncertainty, two set of objects are retrieved in response to every query: the set of objects that are known to satisfy with complete certainty and the set that possibly satisfies the query with various degrees of uncertainty. Two methods of estimating this uncertainty, based on information theory, are proposed. The measure of uncertainty is used to rank objects for presentation to a user.
Tests on parallel machines of a domain decomposition method for a composite three-dimensional structural analysis problem
Authors: F.-X. Roux
Venue: Proceedings of the 2nd international conference on Supercomputing (1988)

We report about parallel implementation on LCAP1 system and on CRAY2 supercomputer of a parallel algorithm based on a domain decomposition method with LaGrange multiplier, for solving an ill conditioned three dimensional composite structural analysis problem, with as many as one million degrees of freedom. We show that this method has very good features on both granularity and data dependency viewpoints. The tests performed prove that the choice of the local solver is very important to get an efficient global method. For the studied case, it is clear that solving the local problems with a direct method is the best solution, and we give some reasons why it will be the same for many other problems.
Polynomial evaluation with scaling
Authors: Eldon R. Hansen, Merrell L. Patrick, Richard L. C. Wang
Venue: ACM Transactions on Mathematical Software (TOMS) (1990)

To overcome difficulties in polynomial evaluation caused by overflow or unnecessary underflow, we introduce a simple scaling procedure into Horner's method.
Quo Vidas, professor
Authors: Paula Rosen
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

During the past 5 years Academic Computing Services (ACS) at the University of Colorado Boulder (UCB) has progressed through evolving support structures for faculty microcomputing. Each step was unique and timely. Each lead to the next. Each became more specialized yet met the needs of an expanding audience. Chronologically, the programs started with a broad scope and a narrow audience, then progressed to narrower scopes with broader audiences. 1983 The Faculty PC Program 1984 Microcomputer Applications Classes 1984 The PC Maintenance Center 1986 The Instructional Grant Program 1987 The DISC Center1988 Quo Vidas?
On the general motion planning problem with two degrees of freedom
Authors: L. J. Guibas, M. Sharir, S. Sifrony
Venue: Proceedings of the fourth annual symposium on Computational geometry (1988)

We show that, under reasonable assumptions, any collision-avoiding motion planning problem for a moving system with two degrees of freedom can be solved in time &Ogr;(&lgr;s(n) log2n), where n is the number of collision constraints imposed on the system, s is a fixed parameter depending e.g. on the maximum algebraic degree of these constraints, and &lgr;s(n) is the (almost linear) maximum length of (n,s) Davenport Schinzel sequences. This follows from an upper bound of &Ogr;(&lgr;s(n)) that we establish for the combinatorial complexity of a single connected component of the space of all free placements of the moving system. Although our study is motivated by motion planning, it is actually a study of topological, combinatorial, and algorithmic issues involving a single face in an arrangement of curves. Our results thus extend beyond the area of motion planning, and have applications in many other areas.
Visual system browser
Authors: E. Hudlicka
Venue: ACM SIGCHI Bulletin (1989)

The Visual System Browser is a tool for viewing the static structure of a software system in terms of trees representing the procedure calls. The focus in the browser's construction was on the ease of use and the flexibility of what can be seen. These two features encourage the user to view the system in many different ways, to "browse" through its call structure by creating a series of customized system views, and thus gradually build a solid understanding of its overall organization. Typical users are experienced programmers who wish to orient themselves within an unfamiliar software system. Since the use of the browser may be occasional, we have chosen a visual, direct-manipulation style of interface, which is easier to learn and retain than a textual command interface. The browser is written in VAX LISP trade; and runs under the VMS operating system on a MicroVAX workstation. It currently browses LISP programs.
Comparing Two Functional Programming Systems
Authors: Brent Hailpern, Tien Huynh, Gyorgy Revesz
Venue: IEEE Transactions on Software Engineering (1989)

A technique is presented for comparing the performance of functional languages with different evaluation strategies running on different machines. A set of small benchmarks is used, and th execution times of these programs running in the functional language and in the implementation language of the functional system are compared. The ratio of these execution times measured how well the functional system used the resources of the underlying hardware and implementation language. Also two functional programming systems are described. One system is a graph reduction interpreter for lambda calculus. The other is a DEL-style intermediate instruction set architecture for FP. The benchmarks in FP and the performances of the two systems on these benchmarks are presented.
Generalised characteristic polynomials
Authors: John Canny
Venue: Journal of Symbolic Computation (1990)

Multipolynomial resultants provide the most efficient methods known (in terms as asymptoticcomplexity) for solving certain systems of polynomial equations or eliminating variables (Bajaj et al., 1988). The resultant of f"1, ..., f"n in K[x"1,...,x"m] will be a polynomial in m-n+1 variables which is zero when the system f"1=0 has a solution in ^m ( the algebraic closure of K). Thus the resultant defines a projection operator from ^m to ^(^m^-^n^+^1^). However, resultants are only exact conditions for homogeneous systems, and in the affine case just mentioned, the resultant may be zero even if the system has no affine solution. This is most serious when the solution set of the system of polynomials has ''excess components'' (components of dimension >m-n), which may not even be affine, since these cause the resultant to vanish identically. In this paper we describe a projection operator which is not identically zero, but which is guaranteed to vanish on all the proper (dimension=m-n) components of the system f"i=0. Thus it fills the role of a general affine projection operator or variable elimination ''black box'' which can be used for arbitrary polynomial systems. The construction is based on a generalisation of the characteristic polynomial of a linear system to polynomial systems. As a corollary, we give a single-exponential time method for finding all the isolated solution points of a system of polynomials, even in the presence of infinitely many solutions, at infinity or elsewhere.
User interface requirements for face to face groupware
Authors: Mary Elwart-Keys, David Halonen, Marjorie Horton, Robert Kass, Paul Scott
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

This paper discusses the user interface of the Capture Lab, a computer-supported meeting room that has been in operation since late 1987. One goal of the Capture Lab design is to support meetings of business people (who are often novice computer users) without requiring an additional person to serve as a computer technician or facilitator. This paper discusses the user interface features a system should have to support face to face meetings. It describes the Capture Lab and how it is used, and presents our approach to satisfying those interface requirements. Finally, we discuss a few of our observations about the Capture Lab's user interface, and how a computer-supported meeting environment affects meetings.
Bisectional Fault-Tolerant Communication Architecture for Supercomputer Systems
Authors: A. Ghafoor, T. R. Bashkow, I. Ghafoor
Venue: IEEE Transactions on Computers (1989)

A highly versatile communication architecture, the bisectional interconnection network, is proposed. These networks possess many attractive features such as small internode distances, ability to do self-routing which is easily extendible to failure conditions, and the capability of maximal fault tolerance. The proposed architecture allows optimal implementation of various logical configurations. Furthermore, the authors propose the use of a combinatorial structure, called the symmetric balanced incomplete block design (SBIBD), to partition these networks. This important property of partitioning allows the system's expansion with fault tolerance and is utilized to describe two semidistributed fault-diagnostic strategies which require remarkably low overhead and at the same time identify a large number of faulty nodes. Furthermore, based on SBIBDs, a unique approach for making the diagnostic scheme itself fault tolerant is proposed.
An interactive calculus theorem-prover for continuityproperties
Authors: Patrick Suppes, Shuzo Takahashi
Venue: Journal of Symbolic Computation (1989)

The work reported concerns the development of an interactive theorem-prover for the foundationsof the differential and integral calculus. The main tools are a resolution theorem-prover VERIFY, previously developed for interactive proofs in set theory, and the symbolic computation program REDUCE. The use of REDUCE in a theorem-proving context is described in detail. Sample proofs are given with data on computation time per step on an IBM-4381.
Knowledge representation on the connection machine
Authors: M. Evett, L. Spector, J. Hendler
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

A primary motivation for the development of the Connection Machine (CM) was to create a vehicle for artificial intelligence research. The original design was largely based upon Fahlman's NETL machine [Fah79], the primary purpose of which was to effect large semantic networks, a paradigm of artificial intelligence. To date, however, only a small amount of AI research is being conducted on the CM. Discounting neural net and computer vision research, the amount is miniscule. The lack of AI tools for the CM is a primary cause for this dearth of research. AI researchers proposing to use the CM must first develop the necessary AI tools before beginning work on their projects. For example, there are no existing inference systems, knowledge representation packages, expert system toolkits, etc. PARKA, a pseudo-acronym for &ldquo;Parallel Knowledge Representation and Association&rdquo;, was developed as the prototype of one such tool: a knowledge representation system modeled on a frame-based representation language (FDL) [Tou87] paradigm.
A knowledge-based user interface management system
Authors: J. Foley, C. Gibbs, S. Kovacevic
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1988)

A knowledge base which defines a user-computer interface is described. The knowledge base serves as input to a user interface management system, which implements the user interface. However, the knowledge base represents user interface design knowledge at a level of abstraction higher than is typical of user interface management systems. In particular, it represents objects, actions, attributes of objects, an object class hierarchy, and pre- and post-conditions on the actions. The knowledge base can be algorithmically transformed into a number of functionally equivalent interfaces, each of which is slightly different from the original interface. The transformed interface definition can be input to the UIMS, providing a way to quickly experiment with a family of related interfaces.
On the general false path problem in timing analysis
Authors: D. H. Du, S. H. Yen, S. Ghanta
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

The false path problem is often referred to as the problem of detecting the longest sensitizable path (A path which is not a false path is a sensitizable path). The term &ldquo;false path&rdquo; is not clearly defined. In this paper, we first give a clear and precise definition of a false path. Then the general false path problem is formulated. The general false path problem is to detect whether a given path (not necessarily the longest one) is a false path. We present an efficient algorithm for solving the general false path problem. We also propose another algorithm which generates all the possible sensitizable paths with the delays greater than a given threshold T. The efficiency and effectiveness of the proposed algorithm are demonstrated by the experimental results. Index Terms: Timing Verification, Logic Simulation, VLSI circuit, Timing Analysis, False path, Graph Theory.
The new generation of computer literacy
Authors: J. Paul Myers,  Jr.
Venue: Proceedings of the twentieth SIGCSE technical symposium on Computer science education (1989)

A tremendous mismatch is developing between two of the most critical components of any computer literacy course: the textbooks and the students. We are encountering a &ldquo;new generation&rdquo; of students (literally as well as figuratively!) who are much better acquainted with computer usage than their earlier counterparts. Yet many textbooks with increasing emphasis in those same computer tools continue to appear. There are signs of a coming change in that a few authors and publishers apparently are becoming aware of the need for innovations in texts for non-scientists. These textbooks open the door for a new orientation to principles in the teaching of computer literacy.
On the computation of generalized standard bases
Authors: Michela Brundu, Fabio Rossi
Venue: Journal of Symbolic Computation (1988)

In the context of graded structures, we give algorithms to compute generalized standard basesof a given module and of the associated modules of syzygies, generalizing known results and applying them to some computational problems
Machine Characterization Based on an Abstract High-Level Language Machine
Authors: R. H. Saavedra-Barrera, A. J. Smith, E. Miya
Venue: IEEE Transactions on Computers (1989)

Measurements are presented for a large number of machines ranging from small workstations to supercomputers. The authors combine these measurements into groups of parameters which relate to specific aspects of the machine implementation, and use these groups to provide overall machine characterizations. The authors also define the concept of pershapes, which represent the level of performance of a machine for different types of computation. A metric based on pershapes is introduced that provides a quantitative way of measuring how similar two machines are in terms of their performance distributions. The metric is related to the extent to which pairs of machines have varying relative performance levels depending on which benchmark is used.
Tuning the rank-n update in a wavefront solver for peak performance
Authors: M. A. Johnson, S. Chang
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

The wavefront solver is a type of linear equation solver that is suitable for solving the system of linear equations that arises in many finite-element applications. A new version of the wavefront solver was recently introduced into the ANSYS&reg; program that uses a rank-n update. The rank-n update has properties that allow it to make very efficient use of a hierarchical memory structure. In addition, the rank-n update can exploit both vector and parallel processing to increase its performance. We discuss several general techniques for tuning the rank-n update, using the IBM ES/3090 VF as an example of a computer that incorporates hierarchical memory and vector and parallel processing capabilities. We then report the performance of the tuned rank-n update, both in isolation and in the context of ANSYS jobs.