ppxscal/embedding_network huggingface dataset:
Removing the emphasis on coding in a course on software engineering
Authors: L. Rising
Venue: ACM SIGCSE Bulletin (1989)

There has been considerable interest in a one-semester course in software engineering [Bullard88, Carver87, Gibbs87]. Faculty members of departments of computer science are introducing courses that involve team projects, in an effort to provide students some experience with large programs. However, software professionals are still concerned that most computer science graduates have little understanding of what is involved in the development of large, complex systems. Too often, code alone is regarded as the primary product without proper consideration of the necessary standards and procedures of the controlling disciplines. This paper describes a course that shifted the emphasis from coding by having students perform supporting activities and maintenance on a large Ada project.
Two-directional record layout for multiple inheritance
Authors: William Pugh, Grant Weddell
Venue: Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation (1990)

Much recent work in polymorphic programming languages allows subtyping and multiple inheritance for records. In such systems, we would like to extract a field from a record with the same efficiency as if we were not making use of subtyping and multiple inheritance. Methods currently used make field extraction 3-5 times slower, which can produce a significant overall performance slowdown. We describe a record layout algorithm that allows us to assign a fixed offset to each field name. This allows field extraction to done just as quickly as in systems that do not provide multiple inheritance. Assigning fixed offsets may require us to leave gaps in some records (and waste space). However, by placing fields at both positive and negative offsets we can drastically reduce the amount of wasted space. Finding an optimal layout is NP-hard, so we propose and analyze heuristic algorithms for producing good two-direction record layouts. In a trial run, our algorithm produced a fixed layout for the instance variables of the 563 flavors of a Lisp Flavors system; this fixed layout only wastes 6% of the total space consumed by a collection of one instance of each flavor.
Semantic lock models in object-oriented distributed systems and deadlock resolution
Authors: M. Roesler, W. A. Burkhard
Venue: Proceedings of the 1988 ACM SIGMOD international conference on Management of data (1988)

We propose a distributed algorithm for detection and resolution of resource deadlocks in object-oriented distributed systems. The algorithm proposed is shown to detect and resolve all O(n1) cycles present in the worst case waits-for-graph (WFG) with n vertices by transmitting O(n3) messages of small constant size. Its average time complexity has been shown to be O(ne), where e is the number of edges in the WFG After deadlock resolution, the algorithm leaves information in the system concerning dependence relations of running transactions. This information will preclude the wasteful retransmission of messages and reduce the delay in detecting future deadlocks.
HORSE: a simulation of the horizon supercomputer
Authors: D. J. Kopetzky
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

HORSE is a program that combines the simulation of the HORIZON multiprocessor architecture with an interactive debugging environment. The models for processing elements, interconnection network, and memory modules include enough detail to allow execution time to be estimated. Debugging commands, invoked by either the user or the program, can inspect the state of computation without perturbing the sequence of future events. A program's operating system requests are processed by the debugger. HORSE currently runs on a variety of UNIX machines including the Cray-2, Convex, and Sun.
A system for the representation of theorems and proofs
Authors: M. R. Finley,  Jr., E. B. Hausen-Tropper
Venue: Issue 108 (April 1989) (1989)

In previous work, the authors (Hausen-Tropper and Finley, 1988) have developed an extension of classical frame systems using generalized interframe relationships and concepts borrowed from modal logic. Such extended frame systems, termed modal frame systems by the authors, for which a non-deterministic query paradigm was presented, were intended to provide a flexible knowledge representation mechanism that would handle effectively some of the problems arising from exceptions, conflictual information, and defaults in the encoded knowledge. In the present work, an example of a knowledge base using the full richness of the extended frame representation system is presented. The example chosen is taken from an axiomatic development of the existence of real numbers with the intention of representing theorems and their proofs in the extended frames. The intent is to bring out the "deep structure" of the proofs, which might help us to better understand the proof discovery process. Thus, a simple syntactic encoding is not sufficient, rather the choice of a deep representation is sought. With such a representation in hand, the acquisition process should be fairly straight forward. A knowledge base built up in this way will then contain a corpus of knowledge about the given field of mathematics and could be interrogated in order to display the theorems of the system, their proofs, and the interrelationships between the proofs, theorems, axioms, and definitions of the system.
A transaction logic for database specification
Authors: Xiaolei Qian, Richard Waldinger
Venue: Proceedings of the 1988 ACM SIGMOD international conference on Management of data (1988)

We introduce a logical formalism for the specification of the dynamic behavior of databases. The evolution of databases is characterized by both the dynamic integrity constraints which describe the properties of state transitions and the transactions whose executions lead to state transitions. Our formalism is based on a variant of first-order situational logic in which the states of computations are explicit objects. Integrity constraints and transactions are uniformly specifiable as expressions in our language. We also point out the application of the formalism to the verification and synthesis of transactions.
User cube: a taxonomy of end users
Authors: William W. Cotterman, Kuldeep Kumar
Venue: Communications of the ACM (1989)

The user cube, a precise and comprehensive graphical taxonomy designed to provide a common base for understanding and classifying end users in organizations, can be used to assess the risks associated with end-user computing.
Programming in Grenoble in the 1960s and those who Flew from the Nest
Authors: Jean P. Verjus
Venue: IEEE Annals of the History of Computing (1990)

This article summarizes the development of the Grenoble Institute of Informatics and Applied Mathematics (IMAG), created by Professor Jean Kuntzmann. Then it focuses on the Programming Team, headed by Professor Louis Bolliet. Since the 1960s, many Grenoble educated computer scientists and engineers have spread towards other university towns/campuses (the example of IRISA in Rennes is discussed) and to industry, thus contributing greatly to the diffusion of computer activities in France. After this historical outline, the author proposes some retrospective reflections on research and development in Programming Language Systems.
Area Minimization in a Three-Sided Switchbox by Sliding the Modules
Authors: M. Sarrafzadeh
Venue: IEEE Transactions on Computers (1990)

An optimal algorithm for minimizing the number of columns (width) in a three-sided switchbox, when the modules are allowed to slide, is presented. The proposed algorithm runs in O(mn+e log e) time, where m and n are the number of terminals on the top and on the bottom, and e is the total number of feasible alignments (e>or=mn). The movable-module model considered is a generalization, and a realistic version, of the (previously studied) movable-terminal model.
New communication protocols from old
Authors: Z. Bavel, J. W. Gfrzymala-Busse, Y-T. Hsia
Venue: Proceedings of the ACM workshop on Frontiers in computer communications technology (1987)

The power tier automaton (PTA) is introduced as a model of preference for representing and manipulating systems in general, computer architectures and, in particular, communication networks and their protocols. The PTA is superior to Petri nets, both in computing power (Turing machine power) and in ease and selectivity of representation. The tier automaton, a species of the PTA, is used to represent networks and protocols to a greater advantage than other existing models. Homomorphisms and reachable-domain (r.d.) homomorphisms on tier automata are introduced and used to manipulate two distinct protocols for reliable full-duplex transmission over half-duplex lines, both of whose images are the same familiar alternating-bit protocol.
A Unified Approach to the Linear Camera Calibration Problem
Authors: W. I. Grosky, L. A. Tamburino
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

The camera calibration process relates camera system measurements (pixels) to known reference points in a three-dimensional world coordinate system. The calibration process is viewed as consisting of two independent phases: the first is removing geometrical camera distortion so that rectangular calibration grids are straightened in the image plane, and the second is using a linear affine transformation as a map between the rectified camera coordinates and the geometrically projected coordinates on the image plane of known reference points. Phase one is camera-dependent, and in some systems may be unnecessary. Phase two is concerned with a generic model that includes 12 extrinsic variables and up to five intrinsic parameters. General methods handling additional constraints on the intrinsic variables in a manner consistent with explicit satisfaction of all six constraints on the orthogonal rotation matrix are presented. The use of coplanar and noncoplanar calibration points is described.
A Hardware Accelerator for Maze Routing
Authors: Y. Won, S. Sahni, Y. El-Zig
Venue: IEEE Transactions on Computers (1990)

A hardware accelerator for the maze routing problem is developed. This accelerator consists of three three-stage pipelines. Banked memory is used to avoid memory read/write conflicts and obtain maximum efficiency. The design is compared to other proposed designs. Unlike other proposed hardware solutions for this problem, this design does not require an increase in the number of processors as the problem size increases.
Test Pattern Generation for API Faults in RAM
Authors: P. de Jong A. J. van de Goor
Venue: IEEE Transactions on Computers (1988)

The algorithm for detecting pattern-sensitive faults in memories, as presented by K.K. Salnja, K. Kinoshita, is simplified. In addition, a new algorithm is presented which has a near optimal WRITE sequence.
Can REDUCE be run in parallel?
Authors: J. Fitch
Venue: Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation (1989)

In order to make a substantial improvement in the performance of algebra systems it will eventually be necessary to use a parallel execution system. This paper considers one approach to detecting parallelism, an automatic method related to compilation, and applies it to REDUCE, and to the factoriser in particular. The conclusions are preliminary, and this is only a small step on a long road.
Workstation/APSE productivity study results
Authors: D. Reifer
Venue: Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment (1989)

This paper reports the outcome of a study conducted over the past three years to quantify the productivity and quality benefits resulting from the use of engineering workstations and software engineering environments on Ada projects. Improvement data from twenty firms was acquired, normalized and analyzed in an attempt to evaluate the business case aspects of these major investment decisions. These data, and the experience they encompass, are used to develop the findings, conclusions and recommendations offered relative to the acquisition of tools and workstations in the future.
Rendezvous Facilities: Concurrent C and the Ada Language
Authors: N. H. Gehani, William D. Roome
Venue: IEEE Transactions on Software Engineering (1988)

The concurrent programming facilities in both Concurrent C and the Ada language are based on the rendezvous concept. Although these facilities are similar, there are substantial differences. Facilities in Concurrent C were designed keeping in perspective the concurrent programming facilities in the Ada language and their limitations. Concurrent C facilities have also been modified as a result of experience with its initial implementations. The authors compare the concurrent programming facilities in Concurrent C and Ada and show that it is easier to write a variety of concurrent programs in Concurrent C than in Ada.
Algorithms for string searching
Authors: R. A. Baeza-Yates
Venue: ACM SIGIR Forum (1989)

We survey several algorithms for searching a string in a piece of text. We include theoretical and empirical results, as well as the actual code of each algorithm. An extensive bibliography is also included.
A gesture based user interface prototyping system
Authors: R. B. Dannenberg, D. Amon
Venue: Proceedings of the 2nd annual ACM SIGGRAPH symposium on User interface software and technology (1989)

GID, for Gestural Interface Designer, is an experimental system for prototyping gesture-based user interfaces. GID structures an interface as a collection of &ldquo;controls&rdquo;: objects that maintain an image on the display and respond to input from pointing and gesture-sensing devices. GID includes an editor for arranging controls on the screen and saving screen layouts to a file. Once an interface is created, GID provides mechanisms for routing input to the appropriate destination objects even when input arrives in parallel from several devices. GID also provides low level feature extraction and gesture representation primitives to assist in parsing gestures.
A testbed for wide area ATM research
Authors: D. L. Tnnenhouse, I. M. Leslie
Venue: ACM SIGCOMM Computer Communication Review (1989)

Asynchronous Transfer Mode (ATM) has been advocated as the basis of multiservice telecommunications in the next century. However, the public telecommunication technology of the 1990's will be ISDN, which presents a circuit switched subscriber interface. An obvious approach to building a wide area ATM network is to build it on top of primary rate ISDN. In this paper we describe the lessons learned through the design and deployment of such a network.
Stereo Correspondence by Surface Reconstruction
Authors: S. I. Olsen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

An algorithm that solves the computational stereo correspondence and the surface reconstruction is presented. The algorithm integrates the reconstruction process in the correspondence analysis by means of multipass attribute matching and disparity refinement. In the matching process, the requirement of attribute similarity is relaxed with the pass number while the requirement for agreement between the predicted and the measured disparity is tightened. Disparity discontinuities and occluded areas are detected by analyzing the partial derivatives of the reconstructed disparity surface. Results on synthetic and on real stereo image pairs are reported.
Operation scheduling in reconfigurable, multifunction pipelines
Authors: Jack Walicki, John D. Laughlin
Venue: ACM SIGMICRO Newsletter (1988)

One of the key issues in the efficient use of pipelines is the problem of pipeline scheduling. An overview of the research in pipeline scheduling is presented. The scheduling problem for multifunction, dynamically reconfigurable pipelines is studied from the point of view of retargetable microcode compilation. A modified greedy strategy using the criterion of the earliest completion time tc is presented with an example.
Neural network models in simulation: a comparison with traditional modeling approaches
Authors: P. A. Fishwick
Venue: Proceedings of the 21st conference on Winter simulation (1989)

Neural models are enjoying a resurgence in systems research primarily due to a general interest in the connectionist approach to modeling in artificial intelligence and to the availability of faster and cheaper hardware on which neural net simulations can be executed. We have experimented with using a multi-layer neural network model as a simulation model for a basic ballistics model. In an effort to evaluate the efficiency of the neural net implementation for simulation modeling, we have compared its performance with traditional methods for geometric data fitting such as linear regression and surface response methods. Both of the latter approaches are standard features in many statistical software packages. We have found that the neural net model appears to be inadequate in most respects and we hypothesize that accuracy problems arise, primarily, because the neural network model does not capture the system structure characteristic of all physical models. We discuss the experimental procedure, issues and problems, and finally consider possible future research directions.
Technology tracking of non manhattan VLSI layout
Authors: J. Waterkamp, R. Wicke, R. Brück, M. Reinhardt, G. Schrammeck
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

Improvements in IC technologies make existing layout libraries obsolete. In order to reuse these layouts, adaptation to the requirements of new technologies have to take place. In this paper a system is presented that automatizes this task using a locally two dimensional compaction algorithm. The system is able to handle arbitrary geometries and arbitrary technologies (including bipolar and mixed ones).
SIS - A symbolic information management system
Authors: S. Bandyopadhyay, J. S. Devitt
Venue: Journal of Symbolic Computation (1987)

Conventional data base management systems are designed for business applications and do not provide the sort of tools required for effective management of algebraic data such as mathematical formulae. An effective information system for the science and engineering environment must capitalize on such structure. The Scientific Information System combines the facilities of data base management with those of symbolic computation using an interface very similar to Query by Example. This paper presents an overview of the system. Algebraic constraint satisfaction plays a crucial role in the overall design and is accomplished through interaction with the Maple Algebra System. SIS opens the possibility of interfacing such diverse tools as automatic query inference systems for relational databases, and algebra systems.
An event-driven model-view-controller framework for Smalltalk
Authors: Y.-P. Shan
Venue: Conference proceedings on Object-oriented programming systems, languages and applications (1989)

The Smalltalk Model-View-Controller (MVC) user interface paradigm uses polling for its input control. The polling loops consume CPU cycles even when the user is not interacting with the interface. Applications using Smalltalk as their front-end often suffer unnecessary performance loss. This paper presents a prototype event-driven MVC framework to solve these problems. A solution to the compatibility problem is also provided to allow interface objects built under both polling and event-driven mechanisms to be used by each other with no modification and no performance penalty.
INGRID: A graph invariant manipulator
Authors: Ronald D. Dutton, Robert C. Brigham, Fernando Gomez
Venue: Journal of Symbolic Computation (1989)

INGRID, a software system for assisting researchers and students of graph theory, is described. It is a partial commutative rule-based system using forward chaining, consists of approximately 1200 production rules, and is written in Berkeley Pascal on a VAX 11/780 under UNIX. INGRID has a data base of 36 graphical invariants and approximately 350 theorems symbolically relating these invariants. A set of one or more user-supplied restrictions upon the values of some invariants is propagated by INGRID, via the theorems, into intervals of possible values for other of the invariants. With the simple user interface provided by INGRID, even a graph theory novice can often discern properties of a graph that might normally require the capabilities of a well-informed expert.
Partial polymorphic type inference and higher-order unification
Authors: Frank Pfenning
Venue: Proceedings of the 1988 ACM conference on LISP and functional programming (1988)

We show that the problem of partial type inference in the nth-order polymorphic &lgr;-calculus is equivalent to nth-order unification. On the one hand, this means that partial type inference in polymorphic &lgr;-calculi of order 2 or higher is undecidable. On the other hand, higher-order unification is often tractable in practice, and our translation entails a very useful algorithm for partial type inference in the &ohgr;-order polymorphic &lgr;-calculus. We present an implementation in &lgr;Prolog in full.
The automatic indexing system AIR/PHYS - from research to applications
Authors: P. Biebricher, N. Fuhr, G. Lustig, M. Schwantner, G. Knorz
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

Since October 1985, the automatic indexing system AIR/PHYS has been used in the input production of the physics data base of the Fachinformationsentrum Karlsruhe/West Germany. The texts to be indexed are abstracts written in English. The system of descriptors is prescribed. For the application of the AIR/PHYS system a large-scale dictionary containing more than 600 000 word-descriptor relations reap. phrase-descriptor relations has been developed. Most of these relations have been obtained by means of statistical and heuristical methods. In consequence, the relation system is rather imperfect. Therefore, the indexing system needs some fault- tolerating features. An appropriate indexing approach and the corresponding structure of the AIR/PHYS system are described. Finally, the conditions of the application as well as problems of further development are discussed.
FAUST: an environment for programming parallel scientific applications
Authors: V. A. Guarna, D. Gannon,  Jr., Y. Gaur, D. Jablonowski
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

The subject of integrated programming environments for scientific computing has become very popular over the last few years. Environments such as Rn [3] are being constructed to help coordinate the disjoint activities of editing, debugging, and performance tuning typically seen in the development cycle for software for complex parallel architectures [13]. This paper overviews the Faust project at the Center for Supercomputing Research and Development at the University of Illinois. Faust is targeted at providing an integrated setting for the development of scientific applications. The overall structure of the Faust environment is presented, along with a discussion of some specific tools used to aid the applications programmer in the development of codes.