ppxscal/embedding_network huggingface dataset:
The spineless G-machine
Authors: G. L. Burn, S. L. Peyton Jones, J. D. Robson
Venue: Proceedings of the 1988 ACM conference on LISP and functional programming (1988)

Recent developments in functional language implementations have resulted in the G-machine, a programmed graph-reduction machine. Taking this as a basis, we introduce an optimised method of performing graph reduction, which does not need to build the spine of the expression being reduced. This Spineless G-machine only updates shared expressions, and then only when they have been reduced to weak head normal form. It is thus more efficient than the standard method of performing graph reduction. We begin by outlining the philosophy and key features of the Spineless G-machine, and comparing it with the standard G-machine. Simulation results for the two machines are then presented and discussed. The Spineless G-machine is also compared with Tim, giving a series of transformations by which they can be interconverted. These open up a wide design space for abstract graph reduction machines, which was previously unknown. A full specification of the spineless machine is given in the appendix, together with compilation rules for a simple functional language.
Applications of combinatorial designs in computer science
Authors: Charles J. Colbourn, Paul C. van Oorschot
Venue: ACM Computing Surveys (CSUR) (1989)

The theory of combinatorial designs has been used in widely different areas of computation concerned with the design and analysis of both algorithms and hardware. Combinatorial designs capture a subtle balancing property that is inherent in many difficult problems and hence can provide a sophisticated tool for addressing these problems. The role of combinatorial designs in solving many problems that are basic to the field of computing is explored in this paper. Case studies of many applications of designs to computation are given; these constitute a first survey, which provides a representative sample of uses of designs. More importantly, they suggest paradigms in which designs can be used profitably in algorithm design and analysis.
Simulating neural network learning with TEST/NIL
Authors: D. E. House
Venue: ACM SIGSIM Simulation Digest (1989)

TEST/NIL is a neural network learning simulation tool. TEST (Threshold Element Simulation Tool) is both an input language compiler and a simulation environment builder. NIL is the Network Input Language. TEST/NIL was designed to investigate biologically plausible learning theories at a level lower than that of cognitive psychology and higher than that of chemical pulse transmission. The discrete event simulation technique used by TEST/NIL is designed for possible optimization via parallelism. Appendices summarize the input language and provide a programming example.
Collaborative learning in a virtual classroom: highlights of findings
Authors: Starr Roxanne Hiltz
Venue: Proceedings of the 1988 ACM conference on Computer-supported cooperative work (1988)

Software to support teaching and learning activities was added to a computer-mediated communication system to create a &ldquo;Virtual Classroom.&rdquo; Goals included improving access to and the effectiveness of college-level courses, particularly by facilitating collaborative learning. Process and outcomes were compared for sections of several courses taught in the traditional classroom, totally online, or in mixed mode. On the average, students report that the Virtual Classroom provides a better learning experience.
gIBIS: a hypertext tool for exploratory policy discussion
Authors: Jeff Conklin, Michael L. Begeman
Venue: Proceedings of the 1988 ACM conference on Computer-supported cooperative work (1988)

This paper describes an application specific hypertext system designed to facilitate the capture of early design deliberations. It implements a specific method, called Issue Based Information Systems (IBIS), which has been developed for use on large, complex design problems. The hypertext system described here, gIBIS (for graphical IBIS), makes use of color and a high speed relational database server to facilitate building and browsing typed IBIS networks. Further. gIBIS is designed to support the collaborative construction of these networks by any number of cooperating team members spread across a local area network. Early experiments suggest that the IBIS method is still incomplete, but there is a good match between the tool and method even in this experimental version.
Measuring parallel processor performance
Authors: Alan H. Karp, Horace P. Flatt
Venue: Communications of the ACM (1990)

Many metrics are used for measuring the performance of a parallel algorithm running on a parallel processor. This article introduces a new metric that has some advantages over the others. Its use is illustrated with data from the Linpack benchmark report and the winners of the Gordon Bell Award.
Optimal Three-Layer Channel Routing
Authors: Franco P. Preparata, Witold Lipski,  Jr.
Venue: IEEE Transactions on Computers (1984)

In this paper we show that any channel routing problem of density d involving only two-terminal nets can always be solved in the knock-knee mode in a channel of width equal to the density d with three conducting layers. An algorithm is described which produces in time O(n log n) (in its simplest implementation) a layout of n nets with the following properties: 1) it has minimal width d; 2) it can be realized with three layers; 3) it has at most 3n vias; 4) any two wires share at most four grid points. Without sacrificing any of the above properties (but possibly obtaining slightly longer wires), the layout algorithm can be modified to run in time ?(n).
Spreadsheet analysis and design
Authors: Boaz Ronen, Michael A Palley, Henry C. Lucas,  Jr.
Venue: Communications of the ACM (1989)

Although spreadsheet programs and microcomputers have revolutionized information processing in organizations, a significant number of serious errors have been reported through the misuse of this technology. This article discusses several different contexts for the development of spreadsheet models and presents structured design techniques for these models.
A Chinese-English microcomputer system
Authors: N. P. Archer, M. W. L. Chan, S. J. Huang, R. T. Liu
Venue: Communications of the ACM (1988)

Computing in the People's Republic of China has recently begun to gain momentum. Because of China's large population, its computing requirements are of worldwide interest. This article discusses the background of Chinese computing and the implementation of a Chinese-English microcomputer system which is now being used in several places including the PRC.
The use of multimethods and method combination in a CLOS based window interface
Authors: H. Muller, J. Rose, J. Kempf, T. Stansbury
Venue: Conference proceedings on Object-oriented programming systems, languages and applications (1989)

Solo is a portable window interface written in the Common Lisp Object System (CLOS) object-oriented programming language. Solo provides a virtual window machine which is targeted to a host window system by implementing a set of host window system specific classes and methods for Solo's host window system driver protocol. The interface presented by Solo to an application insulates it from differences in the host window system, facilitating application portability. Solo distinguishes itself from other object-oriented window systems by exploiting certain features of CLOS. CLOS method combination simplifies initialization of windows while preserving easy extensibility of the basic classes. Generic dispatch on multiple arguments, a feature unique to CLOS, allows a simpler and more flexible input event dispatching protocol. A powerful event description language simplifies the specification of keyboard and mouse events. A prototype implementation runs on the server based XII and NeWS host systems, and on the frame buffer based Lucid Window Toolkit.
Higher-order Horn clauses
Authors: Gopalan Nadathur, Dale Miller
Venue: Journal of the ACM (JACM) (1990)

A generalization of Horn clauses to a higher-order logic is described and examined as a basis for logic programming. In qualitative terms, these higher-order Horn clauses are obtained from the first-order ones by replacing first-order terms with simply typed &lgr;-terms and by permitting quantification over all occurrences of function symbols and some occurrences of predicate symbols. Several proof-theoretic results concerning these extended clauses are presented. One result shows that although the substitutions for predicate variables can be quite complex in general, the substitutions necessary in the context of higher-order Horn clauses are tightly constrained. This observation is used to show that these higher-order formulas can specify computations in a fashion similar to first-order Horn clauses. A complete theorem-proving procedure is also described for the extension. This procedure is obtained by interweaving higher-order unification with backchaining and goal reductions, and constitutes a higher-order generalization of SLD-resolution. These results have a practical realization in the higher-order logic programming language called &lgr;Prolog.
Flexible selection among objects: a framework based on fuzzy sets
Authors: P. Bosc, M. Galibourg
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

Up to now, most of the retrieving systems are founded on a Boolean selection mechanism. It appears that this way of doing is not powerful enough to deal with some applications, especially when the size (number) of the results must be controlled. In that case, some kind of flexibility is needed in query expression. In this paper, we suggest the use of a fuzzy sets based approach. The basic principles of this approach are presented and compared to more conventional solutions providing only limited extensions. Moreover, the implementation aspects related to our approach are discussed to show that reasonable performances can be expected.
Design rationale: the argument behind the artifact
Authors: A. MacLean, R. M. Young, T. P. Moran
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Wings for the mind (1989)

We assert that the product of user interface design should be not only the interface itself but also a rationale for why the interface is the way it is. We describe a representation for design based around a semi-formal notation which allows us explicitly to represent alternative design options and reasons for choosing among them. We illustrate the approach with examples from an analysis of scrolling mechanisms. We discuss the roles we expect such a representation to play in improving the coherence of designs and in communicating reasons for choices to others, whether designers, maintainers, collaborators or end users.
Multimodal response planning: an adaptive rule based approach
Authors: R. A. Gargan,  Jr., J. W. Sullivan, S. W. Tyler
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1988)

This paper describes the architecture and prototype of a system which dynamically determines how to present information to a user. The system utilizes a rule based approach to select one or more modalities for presenting information. Next the system determines one or more techniques to present the information within each of the previously selected modalities. This system also adapts to individual users providing flexibility not found in traditional presentation systems. Finally, models are used for storing knowledge about the user resulting in a system which can be easily enhanced as new data is obtained and can adapt to the needs of its users.
Image Representation by Sign Information
Authors: J. L. Sanz, T. T. Huang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

Image representation by sign data in its most general context is considered for the case when f is a two-dimensional signal. The authors study conditions under which f is determined by its sign or, in other words, by its quantization to 1 bit of information. This study is carried out in two different directions. First, theoretical results are presented that set an algebraic condition under which real zero-crossings uniquely specify a band-limited image. An interesting paradigm arising in theoretical computer vision is then posed: are the zero-crossing of f convolved with a Laplacian-of-a-Gaussian at a single channel enough for unambiguously representing f? Second, the problem of the completeness of the representation when the position of the zero-crossings is known only approximately is addressed. It is shown that when sign(f) is sampled, significant ambiguities are introduced in the representation. Experimental results are presented which were obtained from an iterative algorithm devised to reconstruct real images from multiscale sign information.
The runtime environment for Scheme, a Scheme implementation on the 88000
Authors: Steven R. Vegdahl, Uwe F. Pleban
Venue: ACM SIGARCH Computer Architecture News (1989)

We are implementing a Scheme development system for the Motorola 88000. The core of the implementation is an optimizing native code compiler, together with a carefully designed runtime system. This paper describes our experiences with the 88000 as a target architecture. We focus on the design decisions concerning the runtime system, particularly with respect to data type representations, tag checking, procedure calling protocol, generic arithmetic, and the handling of continuations. We also discuss rejected design alternatives, and evaluate the strengths and weaknesses of the instruction set with respect to our constraints.
An introduction to chromatic sums
Authors: E. Kubicka, A. J. Schwenk
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

We introduce the new concept of the chromatic sum of a graph G, the smallest possible total among all proper colorings of G using natural numbers. We show that computing the chromatic sum for arbitrary graphs is an NP-complete problem. Indeed, a polynomial algorithm for the chromatic sum would be easily modified to compute the chromatic number. Even for trees the chromatic sum is far from trivial. We construct a family of trees to demonstrate that for each k, some trees need k colors to achieve the minimum sum. In fact, we prove that our family gives the smallest trees with this property. Moreover, we show that asymptotically, for each value of k, almost all trees require more than k colors. Finally, we present a linear algorithm for computing the chromatic sum of an arbitrary tree.
On teaching computer science using the three basic processes from the Denning report
Authors: D. J. Bagert,  Jr.
Venue: ACM SIGCSE Bulletin (1989)

The recently-published final report of the ACM Task Force on the Core of Computer Science, commonly called the Denning Report, describes three processes which are inherent in all areas of computer science: theory, abstraction and design. This paper describes how this concept was used to teach the quicksort to high school computer science students.
BLusseau,F.-a simulation annealing and resource location in computer networks
Authors: Floriane Blusseau
Venue: Proceedings of the 21st conference on Winter simulation (1989)

Today more and more firms use LAN (Local Area Networks), and the number of connected workstations increases quickly sometimes without any predefined policy. Moreover, numerous services are implemented, such as remote login or mailing, in order to help users in the best utilization of existing communication systems. This implies an increase of the medium load, so the local area network performance definitely deteriorates.The problem now is to find out whether excess load brought about by the addition of connected workstations on the LAN, and by using a high level service such as NFS, saturates the network. This is the aim of our work.The methodology we used relies on performance evaluation techniques, modelling queueing networks. In order to solve the model we obtained, we used discrete event simulation to give us the results we needed.
Extra group network: a cost-effective fault-tolerant multistage interconnection network
Authors: S. Wei, G. Lee
Venue: Proceedings of the 15th Annual International Symposium on Computer architecture (1988)

This paper introduces a new class of fault-tolerant multistage interconnection networks, dubbed as Extra Group Networks (EGNs). An EGN-m of size N is designed to have m + 1 unique path multistage networks of size N/m. This approach of constructing the network allows that an EGN-m can provide &ldquo;full access&rdquo; capability in the presence of multiple faults, up to m, in any stage. EGNs can also maintain the permutation capability of the unique path multistage network of size N in the presence of any single fault. We show that EGNs are most cost-effective than other previously proposed fault-tolerant multistage interconnection networks with a similar fault-tolerant capability.
The instruction parsing microarchitecture of CVAX microprocessor
Authors: David W. Archer
Venue: ACM SIGMICRO Newsletter (1988)

CVAX is a single chip, CMOS VLSI VAX microprocessor. Several microarchitectural innovations helped achieve the desired performance goal of this machine. In particular, the instruction parsing and prefetching mechanism is different from other VAX implementations. This new instruction parsing microarchitecture is discussed in this paper.
Retrospective on DACNOS
Authors: Kurt Geihs, Ulf Hollberg
Venue: Communications of the ACM (1990)

Heterogeneity of hardware and software is a fact in most distributed computing environments. The DACNOS prototype is a network operating system that enables resource sharing in such environments. It extends the local operating systems without interfering with existing programs. It provides comprehensive system level support for distributed applications.
Bounding delay on a multifarious token ring network
Authors: S. S. Gaitonde, Doug Jacobson, A. V. Pohm
Venue: Communications of the ACM (1990)

Interest in integrating voice and data on local computer networks has been building in recent years. Subsequently, much research has been devoted to various techniques that are implementable on existing networks using current standards. This exposition discusses the design issues in implementing a document retrieval system on a token ring network.
Computing the structure of finite algebras
Authors: Lajos Rónyai
Venue: Journal of Symbolic Computation (1990)

In this paper we address some algorithmic problems related to computations in finite-dimensional associative algebras over finite fields. Our starting point is the structure theory of finite-dimensional associative algebras. This theory determines, mostly in a nonconstructive way, the building blocks of these algebras. Our aim is to give polynomial time algorithms to find these building blocks, the radical and the simple direct summands of the radical-free part. The radical algorithm is based on a new, tractable characterisation of the radical. The algorithm for decomposition of semisimple algebras into simple ideals involves (and generalises) factoring polynomials over the ground field. Next, we study the problem of finding zero divisors in finite algebras. We show that thisproblem is in the same complexity class as the problem of factoring polynomials over finte fields. Applications include a polynomial time Las Vegas method to find a common invariant subspace of a set of linear transformations as well as an explicit isomorphism between a given finite simple algebra and a full matrix algebra over a finite field.
DATAPLEX: an access to heterogeneous distributed databases
Authors: Chin-Wan Chung
Venue: Communications of the ACM (1990)

Diverse database management systems are used in large organizations. The heterogeneous distributed database system (DDS) can provide a flexible intergration of diverse databases for users and applications. This is because it allows for retrieval and update of distributed data under different data systems giving the illusion of accessing a single centralized database system.
Designing real-time, decision support computer-human interaction
Authors: William E. Hefley
Venue: ACM SIGCHI Bulletin (1988)

Many complex software-intensive systems are being developed today. When developing complex systems, operations and support development must form a third complementary component of system development, along with hardware and software development. This paper proposes four key components of operations and support development which are needed for successful design of real-time, decision support computer-human interaction.
A delivery system for REDUCE
Authors: J. Fitch
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

A non-LISP delivery system for REDUCE is described and compared with other implementations of REDUCE for speed and size, as well as ease of porting. The mechanism for this delivery system is direct compilation of the REDUCE sources into ANSI C, which is then compiled and linked together with some support code for arithmetic and space administration. The resulting system is compared with a number of other implementations of true REDUCE, and is shown to be similar in size, but faster. The time to port the system is measured in hours. Also considered are the difficulties in this method of delivering LISP code, and an assessment of the loss of flexibility.
A Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution
Authors: Alokdhar N. Choudhary, Walter H. Kohler, John A. Stankovic, Don Towsley
Venue: IEEE Transactions on Software Engineering (1989)

A modified, priority-based probe algorithm for deadlock detection and resolution in distributed database system is presented. Various examples are used to show that the original priority-based algorithm, presented by M.K. Sinha and N. Natarajan (1985), either fails to detect deadlocks or reports deadlocks that do not exist in many situations. A modified algorithm that eliminates these problems is proposed. The algorithm has been tested through simulation and appears to be errorfree. The performance of the modified algorithm is briefly discussed.
I/S attitudes: toward theoretical and definitional clarity
Authors: Dale Goodhue
Venue: ACM SIGMIS Database (1988)

There has long been a recognized need to measure the "success" or efficacy of information systems and the implementation process. Various constructs related to success have been suggested such as user attitudes, use, performance, and value. The attitude construct has received a great deal of attention for both theoretical and operational reasons. This paper focuses on the need for a convincing theoretical model linking systems or policies and user attitudes on the one hand, and user attitude and performance or value on the other. Using job satisfaction research as a reference discipline for understanding the relationship between attitudes and performance, a model of I/S attitudes, beliefs, and performance is developed. This model suggests that performance is affected by the correspondence or "fit" between the task requirements and the functionality of the I/S environment. In addition a distinction between beliefs and attitudes is recommended. While satisfaction might be best determined by measuring attitudes, the correspondence between task and functionality is best determined by measuring beliefs. The implications of this model for future research are discussed.