ppxscal/embedding_network huggingface dataset:
The latent damage system: a jurisprudential analysis
Authors: R. E. Susskind
Venue: Proceedings of the 2nd international conference on Artificial intelligence and law (1989)

This paper brings together the findings of two projects in the field of AI and law. The first of these was a jurisprudential inquiry into expert systems in law sometimes referred to as the Oxford Project. This work in fact originated in Glasgow University in 1981, was developed in the course of doctoral legal research at Oxford University from 1983 to 1986, and culminated in the publication of Expert Systems in Law: A Jurisprudential Inquiry (Oxford University Press, 1987) by R E Susskind. The second project was work on The Latent Damage System, the UK's first commercially available expert system in law. The development of that system has been fully documented in a case study by P N Capper and R E Susskind: Latent Damage Law &mdash; The Expert System (Butterworths , 1988), and a copy of the system itself is packaged with the book. The purpose of this paper is to examine the Latent Damage Project from the perspective of the Oxford Project &mdash; the findings and methodology of a jurisprudential inquiry into expert systems in law are used to analyse the development and operation of one of the world's first operational systems. The paper is structured in four parts. The first offers a brief overview of the Oxford and Latent Damage Projects. This is not undertaken in detail, as these projects have been documented extensively elsewhere. However, sufficient background information is given so that the paper can be read as a self-contained piece. The central arguments and findings are presented in Part Two, which lays bare the jurisprudential foundations of The Latent Damage System. It does so in terms of the theories of jurisprudence that the Oxford Project established must underlie any expert system in law. Part Three examines the extent to which the development of The Latent Damage System was conditioned by the teachings of jurisprudence. Finally, in Part Four, the users, function and scope of The Latent Damage System are pinpointed. The purpose of this paper is not to demonstrate the power of The Latent Damage System by placing it within a jurisprudential framework. The power of the system is, in fact, best illustrated by running it and assessing its utility in practice. The overriding aim of the discussion here is to consider the relevance of the findings and recommendations of a highly academic project for those whose orientation is that of building real-life, commercial, practical systems.
Identifying the gaps between education and training
Authors: Freeman L. Moore, James T. Streib
Venue: ACM SIGCSE Bulletin (1989)

This paper discusses some of the issues concerning education in the academic environment and training in the industrial work environment. Recent college graduates, &ldquo;new-hires&rdquo;, must realize as they enter the workforce, that even though they have completed four year degree programs, they are beginning at an entry-level position. They will need job specific training to make them productive software engineers from their employer's perspective. The aspects of distinguishing between education and training are discussed along with an understanding of how college prepares graduates for employment in the computer industry; specifically, the field of military software development as developed at Texas Instruments.
Perspectives on simulation using GPSS
Authors: T. J. Schriber
Venue: Proceedings of the 21st conference on Winter simulation (1989)

A broad overview of the simulation modeling language GPSS is given. The class of problems to which GPSS applies especially well is described, and. commentary on the semantics and syntax of the language is offered. Various GPSS implementations are indicated, and vendor information is given. The GPSS learning-oriented literature is reviewed, and sources comparing GPSS and other simulation languages are cited. Professional GPSS courses are listed. A GPSS model and its output are presented and discussed in an appendix. The GPSS tutorial at the 1989 Winter Simulation Conference will show how one goes about building GPSS models. Paper copies of the tutorial transparencies will be given out at the tutorial.
Supercomputer integration program at Boeing
Authors: R. B. Griffin, J. S. Kowalik, M. R. Scott
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

In the introduction, we define supercomputers as specialized machines, describe their impact on software and applications, and introduce two major supercomputing issues: visualization and communication. Section 2 discusses the main subject of the paper which is supercomputer integration programs. Section 3 describes our current experience related to the Alabama Supercomputer Network. Sections 4 and 5 are conclusions and references, respectively.
Backtrack search with isomorph rejection and consistency check
Authors: C. W. H. Lam, L. Thiel
Venue: Journal of Symbolic Computation (1989)

Performing an exhaustive backtrack search of combinatorial objects is always a dicey business. One can spend years of CPU time without finding anything. There is always the embarrassing question: ''is the program correct?'' The situation is even worse when the combinatorial object being searched for has a large symmetry group. For efficiency purposes, it is almost obligatory to use as much of the group as possible to prune isomorphic branches of the search tree. Yet, isomorph rejection is difficult to implement and is one of the major sources of errors. This paper proposes a new method of using the symmetry group, not only for isomorph rejection, but also as an independent consistency check of the correctness of the program. The number of isomorphic copies of a given solution is computed in two different ways and the results have to agree, which provides us with the independent consistency check.
On Multidimensional Arrays of Processors
Authors: M. J. Atallah
Venue: IEEE Transactions on Computers (1988)

An investigation is conducted of the relationship between a rectangular mesh and a square one. Asymptotically optimal algorithms are given for simulating one type by the other. The simulation results are useful since they permit designing algorithms on one network (e.g. the square mesh) in spite of the fact that the actual machine on which these algorithms will run is different (e.g. a rectangular mesh).
The pixel machine: a parallel image computer
Authors: Michael Potmesil, Eric M. Hoffert
Venue: Proceedings of the 16th annual conference on Computer graphics and interactive techniques (1989)

We describe the system architecture and the programming environment of the Pixel Machine - a parallel image computer with a distributed frame buffer.The architecture of the computer is based on an array of asynchronous MIMD nodes with parallel access to a large frame buffer. The machine consists of a pipeline of pipe nodes which execute sequential algorithms and an array of m times; n pixel nodes which execute parallel algorithms. A pixel node directly accesses every m-th pixel on every n-th scan line of an interleaved frame buffer. Each processing node is based on a high-speed, floating-point programmable processor.The programmability of the computer allows all algorithms to be implemented in software. We present the mappings of a number of geometry and image-computing algorithms onto the machine and analyze their performance.
Optimum lopsided binary trees
Authors: Sanjiv Kapoor, Edward M. Reingold
Venue: Journal of the ACM (JACM) (1989)

Binary search trees with costs &agr; and &bgr;, respectively, on the left and right edges (lopsided search trees) are considered. The exact shape, minimum worst-case cost, and minimum average cost of lopsided trees of n internal nodes are determined for nonnegative &agr; and &bgr;; the costs are both roughly logp(n + 1) where p is the unique real number in the interval (1. 2] satisfying 1/p&agr; + 1/p&bgr; = 1. Search procedures are given that come within a small additive constant of the lower bounds. Almost-optimum algorithms for the lopsided case of unbounded searching are also obtained. Some extensions to nonconstant costs are briefly sketched.
DEMOS&mdash;a PC-system for population projections for small areas
Authors: Sven Gunnar Lönn
Venue: ACM SIGAPL APL Quote Quad (1990)

DEMOS*PLUS is the name of Kommundata's system for population projections. It works together with another package called DEMOGRAFEN, (the DEMOGRAPHER) aimed for presentation of demographic data. These two systems are members of the software group &ldquo;Planning Systems&rdquo;, which are developed for social and economic planning activities in local governments. The &ldquo;Planning Systems&rdquo; are all written in APL*PLUS/PC. They are distributed with the run-time system of APL*PLUS About 80 percent of the expenditures of local governments in Sweden can be assigned to certain age classes. For example the costs of schools, day nurseries, care of old people. Hence it is very important for local authorities to have knowledges of the population and its distribution by age and housing areas. Therefore more than one hundred municipalities in Sweden are using DEMOS and DEMOGRAFEN to improve their knowledge of the population and to make population forecasts for different housing areas. The systems are also used in education in some universities. DEMOS is designed to give the maximum flexibility in making projections and is easy to use with pop-up windows and extensive on-line help. With DEMOS it is easy to make population forecasts of the whole municipality as well as population projections of selected housing areas for special purposes.
LEADER-an integrated engine behavior and design analyses based real-time fault diagnostic expert system for space shuttle main engine (SSME)
Authors: U. K. Gupta, M. Ali
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

An expert system, called LEADER, has been designed and implemented for automatic learning, detection, identification, verification and correction of anomalous propulsion system operations in real time. LEADER employs a set of sensors to monitor engine component performance, and to detect, identify and validate abnormalities with respect to varying engine dynamics and behavior. Two diagnostic approaches are adopted in the architecture of LEADER. In the first approach fault diagnosis is performed through learning and identifying engine behavior patterns. LEADER, utilizing this approach, generates few hypotheses about the possible abnormalities. These hypotheses are then validated based on the SSME design and functional knowledge. The second approach directs the processing of engine sensory data and performs reasoning based on the SSME design, functional knowledge, and the deep-level knowledge, i.e., the first principles (physics and mechanics) of SSME subsystems and components. This paper describes LEADER's architecture which integrates a design-based reasoning approach with neural network-based fault pattern matching techniques. The fault diagnosis results obtained through the analyses of SSME ground test data are presented and discussed.
Convex separable optimization is not much harder than linear optimization
Authors: D. S. Hochbaum, J. George Shanthikumar
Venue: Journal of the ACM (JACM) (1990)

The polynomiality of nonlinear separable convex (concave) optimization problems, on linear constraints with a matrix with &ldquo;small&rdquo; subdeterminants, and the polynomiality of such integer problems, provided the inteter linear version of such problems ins polynomial, is proven. This paper presents a general-purpose algorithm for converting procedures that solves linear programming problems. The conversion is polynomial for constraint matrices with polynomially bounded subdeterminants. Among the important corollaries of the algorithm is the extension of the polynomial solvability of integer linear programming problems with totally unimodular constraint matrix, to integer-separable convex programming. An algorithm for finding a &egr;-accurate optimal continuous solution to the nonlinear problem that is polynomial in log(1/&egr;) and the input size and the largest subdeterminant of the constraint matrix is also presented. These developments are based on proximity results between the continuous and integral optimal solutions for problems with any nonlinear separable convex objective function. The practical feature of our algorithm is that is does not demand an explicit representation of the nonlinear function, only a polynomial number of function evaluations on a prespecified grid.
Automatic generation of knowledge structures
Authors: F. H. Merrem
Venue: Issue 108 (April 1989) (1989)

The Program for Regional Observing and Forecasting Services is investigating the use of expert systems in weather forecasting, using "learning systems" as models. The first model to be tested was an adaption of Quinlan's ID3 and Friedman's CART. A "heuristic" structure generated by a learning system was compared with that of a human expert. It was tentatively concluded that automatic generation methods (1) did not suffer from loss of dimensionality as do numerical methods, (2) will provide a preliminary knowledge base suitable for modification by domain experts, and (3) may provide some insight into and understanding of data sets having unknown structures.
Managing C++ libraries
Authors: J. M. Coggins, G. Bollella
Venue: ACM SIGPLAN Notices (1989)

This paper describes a scheme we have used to manage a large library written in the C++ language. The scheme imposes a directory structure, and represents dependency hierarchy in a globally accessible file we call the 'prelude' file. We also discuss the structure of the description files (makefiles) used with the UNIX options we have found to be useful in reducing the size of the library, and how to minimize recompilation time after trivial changes to the source code of the library.
Guaranteed ray intersections with implicit surfaces
Authors: D. Kalra, A. H. Barr
Venue: Proceedings of the 16th annual conference on Computer graphics and interactive techniques (1989)

In this paper, we present a robust and mathematically sound ray-intersection algorithm for implicit surfaces. The algorithm is guaranteed to numerically find the nearest intersection of the surface with a ray, and is guaranteed not to miss fine features of the surface. It does not require fine tuning or human choice of interactive parameters. Instead, it requires two upper bounds: "L" that limits the net rate of change of the implicit surface function f(x,y,z) and "G" that limits the rate of change of the gradient. We refer to an implicit surface with these rate limits as an "LG-implicit surface."Existing schemes to intersect a ray with an implicit surface have typically been guaranteed to work only for a limited set of implicit functions, such as quadric surfaces or polynomials, or else have been ad-hoc and have not been guaranteed to work. Our technique significantly extends the ability to intersect rays with implicit surfaces in a guaranteed fashion.
Fortran cubix: definition and implementation
Authors: I. G. Angus
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

An I/O facility for FORTRAN programmers is defined for use with the Crystalline Operating system and the CUBIX I/O library. All of the external I/O switches and file types of the F77 standard FORTRAN are supported from within the nodes of a Hypercube. This is expected to both ease the development of FORTRAN applications and to greatly facilitate the conversion of existing sequential programs into concurrent versions. The implementation is portable to most machines that have both a C and FORTRAN compiler. The FORTRAN compiler is not required to have the ability to parse I/O statements. The only nonportable components of this package are, the interface codes to bridge between C and FORTRAN, and the implementation of your favorite FORTRAN extensions.
Data parallel simulation using time-warp on the connection machine
Authors: M. J. Chung
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

A new data parallel simulation technique of Time-Warp on the Connection Machine is presented. Our scheme handles the rollback problem of Time-Warp efficiently, and maximizes data parallelism, where the parallelism is extracted from simultaneous evaluation of different circuit elements. Each event is assigned to one of the processors of the Connection Machine to achieve high data parallelism. A new scheme to reduce space overhead in Time-Warp is proposed.
Transputer-based parallel processing products
Authors: CORPORATE Computer System Architects
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

Computer System Architects (CSA) designs, manufactures, and sells products which use parallel processing to provide low-cost, high-compute performance to the scientific, engineering, and educational marketplace. Through its close ties with industry and university research, CSA remains on the leading edge of parallel processing technology. The company was started in 1981 as a consulting firm, offering contract design of high speed computer architectures. Contracts with companies such as Hewlett-Packard, Burroughs, and Floating Point Systems provided the internal funding for development of a family of computing products using Inmos Transputers. The transputer is a high-performance 32-bit microprocessor specifically designed to function as a component processor in a network of processors.
Functional programming with combinators
Authors: Jacek Gibert
Venue: Journal of Symbolic Computation (1987)

Combinators are shown to provide a very suitable basis for implementations of functional and symbolic computation in computer architecture. A powerful combinator reduction system is developed which meets programmers and machine requirements for (i) efficiency of representation and execution of symbolic algorithms, and (ii) availability of algebraic manipulation needed to analyse symbolic computations. An algebraic model is constructed to provide rigorous semantics for the system. The reduction language of the system aims at exposing efficient flows of data and fine-grain parallelism, and a computer architecture, which is proposed to run the system, utilizes both sequential and parallel processing modes in order to achieve maximum efficiency of symbolic computation. Finally, an implementation of the interpreter and functional simulator for the architecture is described.
Growing discord: programming philosophy and hardware design
Authors: K. W. Neves
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

Generally, vector compiler technology has been successful in achieving reasonable peak efficiency on &ldquo;good&rdquo; code. Moreover, the community's ability to generate &ldquo;good&rdquo; vector code has improved dramatically. As we move into the era of parallelism, particularly in supercomputing, we can observe certain trends among the leaders in compiler technology. The basic techniques are extensions of strategies for vector machines, but have limited effectiveness in a parallel environment. In this paper, current techniques are examined with respect to choices or trends in hardware design. The ability for parallel compilers to be as effective on parallel machines, as they have been on vector machines is not likely. Technical reasons for this are presented. The human intervention to achieve peak optimization seems to be inevitable. The nature of automatic and non-automatic code optimization is explored.
Generators and the replicator control structure in the parallel environment of ALLOY
Authors: Thanasis Mitsolides, Malcolm Harrison
Venue: Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation (1990)

The need for searching a space of solutions appears often. Many problems, such as iteration over a dynamically created domain, can be expressed most naturally using a generate-and-process style. Serial programming languages typically support solutions of these problems by providing some form of generators or backtracking. A parallel programming language is more demanding since it needs to be able to express parallel generation and processing of elements. Failure driven computation is no longer sufficient and neither is multiple-assignment to generated values. We describe the replicator control operator used in the high level parallel programming language ALLOY. The replicator control operator provides a new view of generators which deals with these problems.
Development of a three-dimensional auditory display system
Authors: Elizabeth M. Wenzel, Frederic L. Wightman, Scott H. Foster
Venue: ACM SIGCHI Bulletin (1988)

We propose that the most powerful method of auditory cueing takes direct advantage of human perceptual capabilities, providing a dynamic, multidimensional pattern of events which conveys meaning about objects in the spatial world. Applications of such a three-dimensional auditory display involve any context in which the user's situational awareness is critical, particularly when visual cues are limited or absent. Examples include air traffic control displays, advanced teleconferencing environments, and monitoring telerobotic activities in hazardous situations.
HBA Vision Architecture: Built and Benchmarked
Authors: R. S. Wallace, M. D. Howard
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A description is given of the hierarchical bus architecture (HBA), its programming environment, and algorithmic benchmarks. For local neighborhood operations the HBA implements the Apply programming model. Apply enables the vision programmer to write image-to-image transformations without regard to the details of parallelism, looping, of boundary conditions. The HBA supports all levels of vision operations with floating-point coprocessors, sufficient memory, rapid I/O, and software tools.
Gröbner bases and primary decomposition of polynomial ideals
Authors: Patrizia Gianni, Barry Trager, Gail Zacharias
Venue: Journal of Symbolic Computation (1988)

We present an algorithm to compute the primary decomposition of any ideal in a polynomialring over a factorially closed algorithmic principal ideal domain R. This means that the ring R is a constructive PID and that we are given an algorithm to factor polynomials over fields which are finitely generated over R or residue fields of R. We show how basic ideal theoretic operations can be performed using Grobner bases and we exploit these constructions to inductively reduce the problem to zero dimensional ideals. Here we again exploit the structure of Grobner bases to directly compute the primary decomposition using polynomial factorization. We also show how the reduction process can be applied to computing radicals and testing ideals for primality.
A distributed hypercube file system
Authors: R. J. Flynn, H. Hadimioglu
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

For the hypercube, an autonomous physically interconnected file system is proposed. The resulting distributed file system consists of an I/O organization and a software interface. The system is loosely-coupled architecturally but from operating systems point of view a tightly-coupled system is formed in which interprocessor messages are handled differently from file accesses. A matrix multiplication algorithm is given to show how the distributed file system is utilized.