ppxscal/embedding_network huggingface dataset:
Improper intersection of algebraic curves
Authors: Shreeram S. Abhyankar, Srinivasan Chandrasekar, Vijaya Chandru
Venue: ACM Transactions on Graphics (TOG) (1990)

Bezout's theorem gives an upper bound on the degree of the intersection of properly intersecting algebraic varieties. In spaces of dimension higher than two, however, intersections between many algebraic varieties such as curves are improper. Bezout's theorem cannot be directly used to bound the number of points at which these curves intersect. In this paper an algebrogeometric technique is developed for obtaining an upper bound on the number of intersection points of two irreducible algebraic curves in k-dimensional space. The theorems obtained are applied to the specific case of intersecting algebraic space curves in three-dimensional space, and a number of examples are analyzed in this regard. The implications of the derived results for computer-aided geometric design are discussed.
A fresh look at combinator graph reduction
Authors: P. J. Koopman,  Jr., P. Lee
Venue: ACM SIGPLAN Notices (1989)

We present a new abstract machine for graph reduction called TIGRE. Benchmark results show that TIGRE's execution speed compares quite favorably with previous combinator-graph reduction techniques on similar hardware. Furthermore, the mapping of TIGRE onto conventional hardware is simple and efficient. Mainframe implementations of TIGRE provide performance levels exceeding those previously available on custom graph reduction hardware.
m-EVES: A tool for verifying software
Authors: D. Craigen, S. Kromodimoeljo, I. Meisels, A. Neilson, B. Pase, M. Saaltink
Venue: Proceedings of the 10th international conference on Software engineering (1988)

This paper describes the development of a new tool for formally verifying software. The tool is called m-EVES and consists of a new language, called m-Verdi, for implementing and specifying software; a new logic, which has been proven sound; and a new theorem prover, called m-NEVER, which integrates many state-of-the-art techniques drawn from the theorem proving literature. Two simple examples are used to present the fundamental ideas embodied within the system.
Artificial neural network technology
Authors: B. L. Yoon
Venue: ACM SIGSMALL/PC Notes (1989)

The Defense Advanced Research Projects Agency (DARPA) has initiated a major new program in Artificial Neural Network Technology. This technology may lead to solution of complex information processing and autonomous control problems (including problems that require real-time processing and response) that have persistently evaded solution by conventional techniques. If its promise can be realized, artificial neural network technology will provide powerful tools for a broad range of military applications, including sophisticated systems for target recognition and tracking and for real-time guidance.
Stereophonic and surface sound generation for exploratory data analysis
Authors: Stuart Smith, R. Daniel Bergeron, Georges G. Grinstein
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

The analysis and interpretation of very high dimensional data require the development and use of data presentation techniques that harness human perceptual powers. The University of Lowell's Exploratory Visualization project (Exvis) aims at designing, implementing, and evaluating perceptually-based tools for data presentation using both visual and auditory domains. This paper describes several auditory data presentation techniques, including the generation of stereophonic sound with apparent depth and sound that appears to emanate from a two-dimensional area. Both approaches can produce sound with auditory texture.
Non-interactive zero-knowledge and its applications
Authors: Manuel Blum, Paul Feldman, Silvio Micali
Venue: Proceedings of the twentieth annual ACM symposium on Theory of computing (1988)

We show that interaction in any zero-knowledge proof can be replaced by sharing a common, short, random string. We use this result to construct the first public-key cryptosystem secure against chosen ciphertext attack.
IBM 3270 full screen interactive programming without CICS
Authors: Hilton Chen, Wayne Summers
Venue: ACM SIGCSE Bulletin (1988)

During the past several decades, full screen interactive programming has become essential in data processing. However, it is impossible or difficult to teach full screen interactive programs on IBM mainframes at universities because of the enormous cost of CICS and the lack of flexibility with the MUSIC PANEL utility. This article describes our solution to the need described in [4] for an inexpensive utility which will allow COBOL programmers to do interactive programming on mainframes utilizing full screen techniques. At Southeast Missouri State University, we have addressed these problems with a utility program which facilitate full screen interactive programming. This program has been developed by Dr. Hilton C. Chen with comments and suggestions by Dr. Wayne C. Summers. The utility program is friendlier and easier to use and considerably more useful than MUSIC's PANEL. More importantly, it gives our students experience in full screen interactive programming on mainframes.
GraphTrace&mdash;understanding object-oriented systems using concurrently animated views
Authors: Michael F. Kleyn, Paul C. Gingrich
Venue: ACM SIGPLAN Notices (1988)

Object-Oriented programming is a powerful means of developing large complex systems. In this paper we address the need to understand the behavior of objects in order to facilitate code sharing and reusability. We describe GraphTrace, a tool we have developed that has allowed us to experiment with new ways of visualizing the dynamic behavior of object-oriented programs. Based on our experience with the GraphTrace tool we suggest that being able to present many different views of an object-oriented system and then animating these views concurrently represents a powerful means for understanding such systems.
A use of drawing surfaces in different collaborative settings
Authors: Sara A. Bly
Venue: Proceedings of the 1988 ACM conference on Computer-supported cooperative work (1988)

Two-person design sessions were studied in three different settings: face-to-face, geographically separated with an audio/video link, and a telephone-only connection. In all settings, the designers' uses of a drawing surface were noted. Many similar drawing surface activities occurred in all design settings even though the settings did not each allow for the same sharing and interaction with the drawing surfaces. Observations suggest that the process of creating drawings may be as important to the design process as the drawings themselves. These preliminary results raise issues for further study, particularly with respect to computer support for collaborative drawing surface use.
The preconditioned conjugate gradient method on the hypercube
Authors: G. Abe, K. Hane
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

A parallel algorithm for solving the elliptic partial differential equation (PDE) is described in this paper through the finite difference method (FDM) The Concurrent Preconditioned Conjugate Gradient method is developed to optimize processor load balancing. This algorithm is evaluated on a hypercube-based concurrent machine, the Intel iPSC.
Cyc: toward programs with common sense
Authors: Douglas B. Lenat, R. V. Guha, Karen Pittman, Dexter Pratt, Mary Shepherd
Venue: Communications of the ACM (1990)

Cyc is a bold attempt to assemble a massive knowledge base (on the order of 108 axioms) spanning human consensus knowledge. This article examines the need for such an undertaking and reviews the authos' efforts over the past five years to begin its construction. The methodology and history of the project are briefly discussed, followed by a more developed treatment of the current state of the representation language used (epistemological level), techniques for efficient inferencing and default reasoning (heuristic level), and the content and organization of the knowledge base.
On the Design of High-Yield Reconfigurable PLA's
Authors: Dong Sam Ha, Vijay P. Kumar
Venue: IEEE Transactions on Computers (1990)

An approach to the design of reconfigurable programmable logic arrays (RPLAs) is proposed in which diagnosis of faults and reconfiguration are performed simultaneously. The approach also takes advantage of a laser programmable interconnect to simplify the test circuitry and area overhead. The RPLA design presented makes it possible to diagnose and repair faults on bit lines, product lines, and output lines. The unrepairable area in the RPLA is kept to a minimum. Only one extra input is required for testability. A mapping process for masking out missing crosspoint faults is employed to further enhance the yield of PLAs. Experimental results on the area overhead and the yield of the proposed RPLAs are presented. The field of the proposed RPLAs is higher than that of the original PLAs.
On the power of white pebbles
Authors: Balasubramanian Kalyanasundaram, George Schnitger
Venue: Proceedings of the twentieth annual ACM symposium on Theory of computing (1988)

We construct a family (Gp | p) of directed acyclic graphs such that any black pebble strategy for Gp requires p2 pebbles whereas 3p+1 pebbles are sufficient when white pebbles are allowed.
The impact of menus and command-level feedback on learners' acquisition of data base language skills
Authors: Mary Sumner, James Benjamin
Venue: ACM SIGCSE Bulletin (1988)

The purpose of this study was to determine whether providing menus and postactive feedback of command-level syntax can facilitate the acquisition of formal language skills by novice learners. Two groups of students, one of which received training in a menu version of dBASE III Plus and the other of which received instruction in a command version, were asked to complete data base file maintenance and query tasks. Measures comparing the performance of the two groups on a post-test were completion of tasks, number of syntactical errors, and number of semantic errors. According to the results, students learning the command version of dBASE III Plus were able to accomplish more tasks successfully than students using the menu version with postactive feedback of command syntax. In addition, the group using the menu driven made more syntactic errors than the group using the command version. The difference between the number of semantic errors made by members of the two groups was not significant. The researchers made several recommendations for instruction and for further research.
Memory coherence in shared virtual memory systems
Authors: Kai Li, Paul Hudak
Venue: ACM Transactions on Computer Systems (TOCS) (1989)

The memory coherence problem in designing and implementing a shared virtual memory on loosely coupled multiprocessors is studied in depth. Two classes of algorithms, centralized and distributed, for solving the problem are presented. A prototype shared virtual memory on an Apollo ring based on these algorithms has been implemented. Both theoretical and practical results show that the memory coherence problem can indeed be solved efficiently on a loosely coupled multiprocessor.
Constructive lifting in graded structures: A unified view of Buchberger and Hensel methods
Authors: A. Miola, T. Mora
Venue: Journal of Symbolic Computation (1988)

This paper discusses a general lifting technique for solving polynomial equations in gradedstructures A, where the solution is understood to lie in the completion A^@^ of A. It shows that the classical Hensel lifting and the main constructions related to the Buchberger algorithm for Grobner bases are both instances of this technique. So, while the setting of it is too general to allow for an effective solution of equations, this technique stresses a theoretical relation between two basic algorithms in computer algebra and could be used as a theoretical model to attack computation problems under the same viewpoint.
Performance of a Composite Attribute and Join Index
Authors: Bipen C. Desai
Venue: IEEE Transactions on Software Engineering (1989)

The use of a composite index known as the B/sub c/-tree is presented; it is based on the concept of the B/sup +/-tree and serves the dual purpose of an attribute and join index and indirectly implements the link sets. The leaf node of the B/sub c/-tree incorporates in each leaf node a reference to all tuples in the database that share common data values of a shared domain. In addition to improving the performance of the join and selection operations, the composite index facilitate the enforcement of structural integrity constraints. The author also presents the results of simulations that compare the performance of this approach with the simple join technique. The proposed approach, in the case of the simulated database, is seen to provide better performance for an average domain value size of greater than between 2 and 4 bytes.
Simulation of a Word Recognition System on Two Parallel Architectures
Authors: M. A. Yoder, L. H. Jamieson
Venue: IEEE Transactions on Computers (1989)

The use of two parallel architectures, a single-instruction-stream, multiple-data-stream (SIMD) machine and a VLSI processor array, to implement an isolated word recognition system is examined. SIMD and VLSI processor array algorithms are written for each of the components of the recognition system. The component parallel algorithms are simulated along with two complete recognition systems, one composed of SIMD algorithms and other composed of VLSI processor array algorithms. The simulations show that a SIMD machine with 100 processing elements, each based on an 8-MHz MC68000, can perform isolated word recognition over a large vocabulary in real time. The VLSI processor array simulations show that an array using 51 cells, each containing a 12-MHz Intel 8051, can recognize speech in real time over a small vocabulary. The simulation revealed certain architectural features that can enhance the overall performance of the speech system.
Modeling inheritance and genericity in object-oriented databases
Authors: C. Lécluse, P. Richard
Venue: Lecture notes in computer science on ICDT '88 (1988)

This paper formalizes inheritance and genericity in the context of object oriented databases. We present a uniform view for objects and types. We model, in the same framework, multiple inheritance and unconstrained genericity. We plan to use this model as the theoretical foundation for the O2 object-oriented database system.
VISA: A variable instruction set architecture
Authors: Alessandro De Gloria
Venue: ACM SIGARCH Computer Architecture News (1990)

This paper presents an instruction coding technique that allows to reduce the instruction width without limiting the exploitation of the machine resources. This result can be obtained by a dynamic instruction coding managed by the compiler.The technique has been applied to a VLIW-structured machine. The machine has an instruction width of 32 bits, while the number of bits needed to code all the functions the machine can perform in a cycle is 98.
Concept demonstration of the use of interactive fault diagnosis and isolation for TF30 engines
Authors: Graham F. Forsyth, Michael D. Larkin
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

Diagnosis of mechanical systems is seen as a mature role for systems incorporating those aspects of Artificial Intelligence usually referred to as &ldquo;Expert Systems&rdquo;. A project to produce a concept demonstration of an expert advisor for troubleshooting an aircraft gas turbine engine has been completed using available technology. This reinforces the impression that deployment of such systems in operational use is now possible.The task of verifying the diagnosis of such systems is still not completely solved but the concept demonstration system has been used to develop some methods of defining such verification.
Efficient circuit partitioning algorithms for parallel logic simulation
Authors: S. Patil, P. Banerjee, C. Polychronopoulos
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

General purpose parallel processing machines are increasingly being used to speed up a variety of VLSI CAD applications. This paper addresses logic simulation on parallel machines by exploiting the concurrency in the circuit being simulated (called data parallelism) as opposed to exploiting parallelism inherent in the simulation algorithm itself (called functional parallelism). The most crucial step in obtaining the maximum parallelism using data parallelism is the partitioning of circuit elements. We introduce a cost function which tries to model the simulation of a logic circuit in a parallel environment. The cost function tries to estimate the parallel run time for logic simulation given the processor assignment and the underlying multiprocessor architecture. We then present different heuristic algorithms to partition the circuit and evaluate the efficiency of these algorithms using the proposed cost function. Partitioning algorithms for both event-driven and compiled code simulation are given.
Synchronous operations as first-class values
Authors: J. H. Reppy
Venue: ACM SIGPLAN Notices (1988)

Synchronous message passing via channels is an interprocess communication (IPC) mechanism found in several concurrent languages, such as CSP, occam, and Amber. Such languages provide a powerful selective I/O operation, which plays a vital role in managing communication with multiple processes. Because the channel IPC mechanism is &ldquo;operation-oriented,&rdquo; only procedural abstraction techniques can be used in structuring the communication/synchronization aspects of a system. This has the unfortunate effect of restricting the use of selective I/O, which in turn limits the communication structure. We propose a new, &ldquo;value-oriented&rdquo; approach to channel-based synchronization. We make synchronous operations first-class values, called events, in much the same way that functions are first-class values in functional programming languages. Our approach allows the use of data abstraction techniques for structuring IPC. We have incorporated events into PML, a concurrent functional programming language, and have implemented run-time support for them as part of the Pegasus system.
A data model for flexible hypertext database systems
Authors: Frank WM. Tompa
Venue: ACM Transactions on Information Systems (TOIS) (1989)

Hypertext and other page-oriented databases cannot be schematized in the same manner as record-oriented databases. As a result, most hypertext databases implicitly employ a data model based on a simple, unrestricted graph. This paper presents a hypergraph model for maintaining page-oriented databases in such a way that some of the functionality traditionally provided by database schemes can be available to hypertext databases. In particular, the model formalizes identification of commonality in the structure, set-at-a-time database access, and definition of user-specific views. An efficient implementation of the model is also discussed.
Integrated concurrency analysis in a software development enviornment
Authors: M. Young, R. Taylor, K. Forester, D. Brodbeck
Venue: ACM SIGSOFT Software Engineering Notes (1989)

The inherent difficulties of analyzing concurrent software make reliance on a single technique or a single monolithic tool unsatisfactory. A better approach is to apply multiple analysis and verification techniques by coordinating the activities of a variety of small tool components. We describe how this approach has shaped the design of a set of tool components to support concurrency analysis in the Arcadia-1 software development environment. Implementation and experience with key components is described.
Differentiating Sonar Reflections from Corners and Planes by Employing an Intelligent Sensor
Authors: B. Barshan, R. Kluc
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A multitransducer, pulse/echo-ranging system is described that differentiates corner and plane reflectors by exploiting the physical properties of sound propagation. The amplitudes and ranges of reflected signals for the different transmitter and receiver pairs are processed to determine whether the reflecting object is a plane or a right-angle corner. In addition, the angle of inclination of the reflector with respect to the transducer orientation can be measured. Reflected signal amplitude and range values, as functions of inclination angle, provide the motivation for the differentiation algorithm. A system using two Polaroid transducers is described that correctly discriminates between corners and planes for inclination angles within +or-10 degrees of the transducer orientation. The two-transducer system is extended to a multitransducer array, allowing the system to operate over an extended range. An analysis comparing processing effort to estimation accuracy is performed.
Computation of Catalan's constant using Ramanujan's formula
Authors: G. J. Fee
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

We have used some formulas due to Ramanujan for the multiple precision computation of Catalan's constant C = 0.915 &middot;&middot;&middot; . The algorithm has been implemented in Maple and C has been computed to 20,000 decimal places. The resulting program is very simple yet efficient. It computes N digits of C in &Ogr;(N2) time and &Ogr;(N) space.
Human-computer interface laboratory&mdash;Virginia Polytechnic Institute and State University (lab review)
Authors: Robert C. Williges
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

A description of the staff, facilities, and research focus of the Human-Computer Interface Laboratory at Virginia Polytechnic Institute and State University is provided. Representative research projects as well as the relationship between this laboratory and the human factors engineering graduate program are also described.
ViewPoint: a troubleshooting-specific knowledge acquisition tool
Authors: J. E. Caviedes, M. K. Reed
Venue: Issue 108 (April 1989) (1989)

As knowledge bases grow in size and complexity, tools for extracting and encoding knowledge from the domain experts become critical for the success of an expert system project. Many of the available expert system tools are designed for a broad range of domains and therefore are often inadequate for building and maintaining domain-specific knowledge structures. This results from the fact that some structures may only exist implicitly or have semantics than cannot be interpreted by generic tools. On the other hand, a tool that is specific to just one application in a domain lacks useful generality. A tool should be flexible enough to be widely applicable within the domain for which it was designed. We describe our knowledge acquisition tool, ViewPoint, which achieves this flexibility by being build on top of a generic expert system architecture for the troubleshooting domain. ViewPoint allows (i) the handling of all knowledge structures present in a troubleshooting knowledge base, (ii) the viewing of many levels of detail, from the global overview of the knowledge base to the examination of a single object, and (iii) the ability to cope with the knowledge acquisition strategies used in the domain.