ppxscal/embedding_network huggingface dataset:
The risch algorithms of MACSYMA and SENAC
Authors: W. C. Schou, K. A. Broughan
Venue: ACM SIGSAM Bulletin (1989)

The purpose of this paper is to report on a computer implementation of the Risch algorithm for the symbolic integration of rational functions containing nested exponential and logarithms. For the class of transcendental functions, the Risch algorithm [4] represents a practical method for symbolic integration. Because the Risch algorithm describes a decision procedure for transcendental integration it is an ideal final step in an integration package. Although the decision characteristic cannot be fully realised in a computer system, because of major algebraic problems such as factorisation, zero-equivalence and simplification, the potential advantages are considerable.
ER model clustering as an aid for user communication and documentation in database design
Authors: Toby J. Teorey, Guangping Wei, Deborah L. Bolton, John A. Koenig
Venue: Communications of the ACM (1989)

Entity-relationship clustering promotes the simplicity that is vital for fast end-user comprehension, as well as the complexity at a more detailed level to satisfy the database designer's need for extended semantic expression in the conceptual model.
NYNEX intelligent systems group
Authors: M. E. Atwood
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Wings for the mind (1989)

The Intelligent Interfaces Group is an interdisciplinary group with interests in artificial intelligence, human-computer interaction, and cognitive science. The primary mission is to provide research and development support to both the regulated and unregulated business units of NYNEX (the Regional Bell Operating Company for New York and New England). The Group was started in October 1986. The Intelligent Interfaces Group is part of the Artificial Intelligence Laboratory; other groups in this Laboratory are Expert Systems, Neural Networks and Machine Learning, and Speech Technologies.Staff members have interests in tutoring systems and tutoring strategies, the design and use of multi-modal communications systems, the evaluation of interactive systems, the development of software toolkits, and similar areas. Projects are selected to support these interests as well as have near-term practical benefits. Some projects are conducted at the request of NYNEX family units, others are initiated by staff members. All projects are funded by NYNEX.
Numerical Operations on a Relational Database
Authors: Sakti P. Ghosh
Venue: IEEE Transactions on Software Engineering (1989)

The problem is discussed of defining numerical operations on a relational database to accommodate the statistical analyses associated with a bivariate frequency table. An attempt has been made to extend Codd's relational algebra to include simple bivariate statistical operations preserving the closure of Codd's algebra. This extended algebra is applied to bivariate relational data structures needed for real-time automatic statistical quality control of a manufacturing process. Also discussed are some new category-numeric operations on relational tables.
Graphical specification of object oriented systems
Authors: Stephen Bear, Phillip Allen, Derek Coleman, Fiona Hayes
Venue: Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications (1990)

The graphical notation Objectcharts, introduced in this paper, allows a developer to precisely specify the behaviour of object classes and to reason about the behaviour of particular configurations of objects. Objectcharts combine object oriented analysis and design techniques and Harel's statecharts to give a diagrammatic specification technique for object oriented systems.
A computational model of the semantics of tense and aspect
Authors: Rebecca J. Passonneau
Venue: Computational Linguistics (1988)

The PUNDIT natural-language system processes references to situations and the intervals over which they hold using an algorithm that integrates the analysis of tense and aspect. For each tensed clause, PUNDIT processes the main verb and its grammatical categories of tense, perfect, and progressive in order to extract three complementary pieces of temporal information. The first is whether a situation has actual time associated with it. Secondly, for each situation that is presumed to take place in actual time, PUNDIT represents its temporal structure as one of three situation types: a state, process, or transition event. The temporal structures of each of these situation types consist of one or more intervals. The intervals are characterized by two features: kinesis, which pertains to their internal structure, and boundedness, which constrains the manner in which they get located in time. Thirdly, the computation of temporal location exploits the three temporal indices proposed in Reichenbach 1947: event time, speech time, and reference time. Here, however, event time is formulated as a single component of the full temporal structure of a situation in order to provide an integrated treatment of tense and aspect.
Tokenless static data flow using associative templates
Authors: T. L. Sterling, D. S. Wills, E. Y. Chan
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

The static data flow model of computation promises high performance from fine grained parallelism, but conventional token-driven static data flow architectures are inefficient in terms of memory bandwidth and microcycles required per operation. The associative template mechanism, a new application of associative techniques, employs specially configured content-addressable memories to provide efficient flow control for static data flow program execution. It supports static data flow semantics while exhibiting memory bandwidth and microcycle demands comparable to those of conventional uniprocessors. Associative diffusion, a second application of associative methods, provides communication between adjacent nodes of a mesh-connected network of associative-template-based processors. This mechanism achieves nearest-neighbor communication at speeds comparable to intra-node transactions by overlapping domains of associativity across boundaries between neighboring nodes. Together, associative templates and associative diffusion provide a token-free approach to static data flow computation.
Implicitly representing arrangements of lines or segments
Authors: H. Edelsbrunner, L. J. Guibas, J. Hershberger, R. Seidel, M. Sharir
Venue: Proceedings of the fourth annual symposium on Computational geometry (1988)

An arrangement of n lines (or line segments) in the plane is the partition of the plane defined by these objects. Such an arrangement consists of &Ogr;(n2) regions, called faces. In this paper we study the problem of calculating and storing arrangements implicitly, using subquadratic space and preprocessing, so that, given any query point p, we can calculate efficiently the face containing p. First, we consider the case of lines and show that with &Lgr;(n) space1 and &Lgr;(n3/2) preprocessing time, we can answer face queries in &Lgr;(&radic;n) + &Ogr;(K) time, where K is the output size. (The query time is achieved with high probability.) In the process, we solve three interesting subproblems: 1) given a set of n points, find a straight-edge spanning tree of these points such that any line intersects only a few edges of the tree, 2) given a simple polygonal path &Ggr;, form a data structure from which we can find the convex hull of any subpath of &Ggr; quickly, and 3) given a set of points, organize them so that the convex hull of their subset lying above a query line can be found quickly. Second, using random sampling, we give a trade-off between increasing space and decreasing query time. Third, we extend our structure to report faces in an arrangement of line segments in &Lgr;(n1/3) time, given &Lgr;(n4/3) space and &Lgr;(n5/3) preprocessing time. Lastly, we note that our techniques allow us to compute m faces in an arrangement of n lines in time &Lgr;(m2/3n2/3 + n), which is nearly optimal.
Defining data types in a database language
Authors: C. J. Date
Venue: ACM SIGMOD Record (1988)

The question of defining data types in a database language is examined. In order to illustrate the general ideas and make them more concrete, the specific case of adding support for dates and times to the database language SQL is considered in detail.
A distributed artificial intelligence approach to integrated engineering design
Authors: Stephen C.-Y. Lu, James B. Thompson
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

This paper reports the development of a computer-based integrated engineering design environment which facilitates design decision-making by providing a medium for increased communication and cooperation amongst product development participants. A refinement and constraint propagation model for product development is used within a distributed artificial intelligence (DAI) architecture to support the cooperative design effort. Within such an environment, product and process designers can integrate the recommendations and expertise of all product development concerns as early as possible within the design-cycle. Our prototype system, ENVIED (Environment for Integrated Engineering Design), provides a domain-independent framework for human designers, artificial intelligence systems, and traditional software systems to cooperatively perform product and process design.
A general user modelling facility
Authors: R. Kass, T. Finin
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1988)

An important component of adaptable interactive systems is the ability to model the system's users. Previous systems have relied on user models tailored to the particular needs of that system alone. This paper presents the notion of a general user model, and describes some of our research on building a general user modelling facility that could be used by a variety of applications. This work focuses on the representation, maintenance, and acquisition issues of modelling long-term beliefs of the user, and describes a general facility for accomplishing these tasks.
Multi-sensor integration on the NCUBE hypercube computer
Authors: C. W. Glover
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

This paper presents the quantitative performance results obtained from converting a large sequential Multi-Sensor Integration (MSI) program into a concurrent form, and executing the program on an NCUBE hypercube computer for several test case scenarios. Each sensor track was assigned to a different node of the hypercube where computationally intensive calculations were performed, A 4-node hypercube was found to be the optimal size for the test case scenario discussed here, where speed-up factors of 1.5 to 1.7 were obtained. A completely concurrent MSI algorithm is also presented.
Inservice education of high school computer science teachers
Authors: J. Kiper, B. Rouse, D. Troy
Venue: Proceedings of the twentieth SIGCSE technical symposium on Computer science education (1989)

This paper describes an inservice retraining program for high school computer science teachers Since computer science teacher certification is a recent development, most of these teachers were trained in another field. This project consisted of a sequence of courses which taught the core principles of computer science to these teachers.
An APL-simulator of non-Von Neumann computer architectures
Authors: Andreas Geyer-Schulz, Johann Mitlöhner, Alfred Taudes
Venue: ACM SIGAPL APL Quote Quad (1990)

APL has a long tradition as a language for the notation of computer architectures that dates back to its use as notation of the IBM 360 system. Its powerful primitives and compactness make it an ideal tool for simulating hardware functions in order to gain insights into the functionality, the performance and the programming issues of an algorithm without the need to undergo the painstaking process of actually building the target machine and implementing the program on it. We have developed an APL2 software simulator for Non-Von Neumann computers. The basic data structure of the system is an array whose elements model a number of RAMs containing control registers, data and program code. The user can &ldquo;define&rdquo; his/her machine by specifying the communication network and communication primitives, the instruction set and its semantics, and the complexity measure. We demonstrate the use of the program system for studying various schemes for adaptive load sharing on multicomputers.
Inside risks: ghosts, mysteries and uncertainty
Authors: Peter G. Neumann
Venue: Communications of the ACM (1990)

Background: Perhaps the most frustrating of all the Risks Forum cases are those in which uncertainty and doubts remain to spook us long after the event.
An algorithm for computing the formal solutions of differential systems in the neighborhood of an irregular singular point
Authors: G. Chen
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

We discuss in this paper an algorithm for the computation of the formal solutions of differential systems in the neighborhood of an irregular singular point. In the reduction of the differential systems, we use its Arnold-Wasow's canonical form. We discuss also an algorithm for the reduction of the differential system to its Arnold-Wasow's canonical form. Then we discuss the results of a shearing transformation on this canonical form and we get the convergence of the algorithm. This paper and [3] consist of a complete study of the problem of computations of the formal solutions of differential systems in the neighborhood of a singular point (regular or irregular).
Great expectations and the reality of university computing resources
Authors: William Padilla, Barbara Rigg-Healy
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

&ldquo;My boss wants this budget set up on the computer by Friday and I don't know anything about budgets, or Lotus, or computers!&rdquo; A little over a year ago, these hysterics coming from a user were a common scene at the Information Resource Center (IRC), the end-user service branch of Computer and Information Resources and Technology (CIRT) at the University of New Mexico. Users would come in with unrealistic deadlines assigned by their bosses, who, in turn, had unrealistic expectations of both their employees' skills and computer technology in general. Often, we had the added problem of dealing with a user who was using unsupported hardware and/or software. An IRC consultant, feeling sorry for the frantic employee, would then spend hours bailing out the employee by actually (in this case) designing the spreadsheet and meeting the employee's deadline. The end result of the consultant's effort was usually mediocre because of the time constraints and because the employee did not have the necessary skills, such a accounting in this case, to work with the consultant to make full use of the technology. In the aftermath, everyone lost. The consultant wasted valuable time, the employee didn't learn anything and probably was alienated by the technology, and the boss most likely was not happy with the end product or the employee, and he/she blamed the IRC consultant for the poor results.
Welding advisory system for process selection &ldquo;WASPS&rdquo;
Authors: G. L. Lovegrove, G. J. Curtis, R. A. Farrar
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

There are a very large number of processes available to the welding engineer who must decide which is most appropriate for a particular application. The factors taken into consideration include the cost of the weld, its failure rate, base metal, dimensions, shape, location, required standard, weld joint preparation and so on. These complex parameters are interdependent and an advisory system for the process choice would be a most useful tool for the welding engineer.This paper traces the progress of research and development of such a tool, with the assistance of the Marchwood Engineering Laboratories of CEGB. The advisory expert system, WASPS, has been deliberately designed with a user-friendly interface to persuade the possibly computer-shy engineer of the validity of the advice together with the ease of running the program. The knowledge representation and inference engine of the expert system are classic in nature but the knowledge base is modular to facilitate the addition of further welding information.Finally the paper outlines the further research which is planned, including the design of an expert system shell for welding process selection and the design of an interface to a larger database.
On the relationship of congruence closureand unification
Authors: Paris C. Kanellakis, Peter Z. Revesz
Venue: Journal of Symbolic Computation (1989)

Congruence closure is a fundamental operation for symbolic computation. Unification closureis defined as its directional dual, i.e., on the same inputs but top-down as opposed to bottom-up. Unifying terms is another fundamental operation for symbolic computation and is commonly computed using unification closure. We clarify the directional duality by reducing unification closure to a special form of congruence closure. This reduction reveals a correspondence between repeated variables in terms to be unified and equalities of monadic ground terms. We then show that: (1) single equality congruence closure on a directed acyclic graph, and (2) acyclic congruence closure of a fixed number of equalities, are in the parallel complexity class NC. The directional dual unification closures in these two cases are known to be log-space complete for PTIME. As a consequence of our reductions we show that if the number of repeated variables in the input terms is fixed, then term unification can be performed in NC; this extends the known parallelizable cases of term unification. Using parallel complexity we also clarify the relationship of unification closure and the testing of deterministic finite automata for equivalence.
Hashing for Dynamic and Static Internal Tables
Authors: Ted G. Lewis, Curtis R. Cook
Venue: Computer (1988)

The authors survey the classical hashing-function approach to information retrieval and show how general hashing techniques exchange speed for memory space and flexibility in data manipulation operations such as insert, delete, and overflow. They also discuss recent developments in perfect hashing and minimal perfect hashing, which provide speed and memory compactness when the keys are known in advance.
Hypercube management in the presence of node failures
Authors: D. D. Kandlur, K. G. Shin
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

The problem of allocation and release of subcubes from a hypercube with node failures is addressed. Two algorithms are presented, both based on the Buddy allocation scheme for memory management which is also used by the AXIS operating system of the NCUBE hypercube computer. The first algorithm is a simple variation of the Buddy algorithm which permits the efficient allocation of subcubes in the presence of a single faulty node. The second algorithm, which effectively subsumes the first, tries to reduce the fragmentation caused by multiple failed nodes. It uses a relabeling scheme to group the failed nodes so that large non-faulty subcubes can be detected using the Buddy allocation scheme. The relative performance of these algorithms is studied using simulation and the proposed algorithms are shown to have a consistently better performance. Issues relating to the detection of faulty nodes on the NCUBE computer and the consequences of the relabeling on message passing are also discussed.
Best-first branch-and bound on a hypercube
Authors: E. W. Felten
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

The branch-and-bound technique is a common method for finding exact solutions to difficult problems in combinatorial optimization. This paper will discuss issues surrounding implementation of a particular branch-and-bound algorithm for the traveling-salesman problem on a hypercube multi-computer. The natural parallel algorithm is based on a number of asynchronous processes which interact through a globally shared list of unfinished work. In a distributed-memory environment we must find a non-centralized version of this shared data structure. In addition, detecting termination of the computation is tricky; an algorithm will be presented which ensures proper termination. Finally, issues affecting performance will be discussed.
Current Research in Robotics and Automation-An Intelligent Grasping System
Authors: P. Allen, P. Michelman, K. Roberts
Venue: Computer (1989)

A research project is described that focuses on building a comprehensive grasping environment capable of performing tasks such as locating moving objects and picking them up, manipulating man-made objects such as tools, and recognizing unknown objects through touch. In addition, an integrated programming environment is being designed that will allow grasping and grasping primitives within an overall robotic control and programming system that includes dextrous hands, vision sensors, and multiple-degree-of-freedom manipulators. A system overview is given, and the applications are discussed.
A mechanism for efficient debugging of parallel programs
Authors: B. P. Miller, Jong-Deok Choi
Venue: ACM SIGPLAN Notices (1988)

This paper addresses the design and implementation of an integrated debugging system for parallel programs running on shared memory multi-processors (SMMP). We describe the use of flowback analysis to provide information on causal relationships between events in a program's execution without re-executing the program for debugging. We introduce a mechanism called incremental tracing that, by using semantic analyses of the debugged program, makes the flowback analysis practical with only a small amount of trace generated during execution. We extend flowback analysis to apply to parallel programs and describe a method to detect race conditions in the interactions of the co-operating processes.
Defining educational policy on software usage in the light of copyright law
Authors: Galen B. Crow
Venue: ACM SIGCSE Bulletin (1989)

Accompanying the rapid proliferation of personal computing has been an ambivalent attitude towards the illegal copying of commercially available software. The effects of this software &ldquo;piracy&rdquo; are enormous and insidious, and academia ranks as one of the worst abusers. To understand the legitimate as well as illegitimate usage of software, one must have a clear understanding of the letter and intent of the copyright law. If academia is to purge itself of software abuses, educators and administrators must set clear and visible software policies based upon the copyright law.