ppxscal/embedding_network huggingface dataset:
A compilation technique for software pipelining of loops with conditional jumps
Authors: Kemal Ebcioğlu
Venue: ACM SIGMICRO Newsletter (1988)

We describe a compilation algorithm for efficient software pipelining of general inner loops, where the number of iterations and the time taken by each iteration may be unpredictable, due to arbitrary if-then-else statements and conditional exit statements within the loop. As our target machine, we assume a wide instruction word architecture that allows multi-way branching in the form of if-then-else trees, and that allows conditional register transfers depending on where the microinstruction branches to (a hardware implementation proposal for such a machine is briefly described in the paper). Our compilation algorithm, which we call the pipeline scheduling technique, produces a software-pipelined version of a given inner loop, which allows a new iteration of the loop to begin on every cycle whenever dependences and resources permit. The correctness and termination properties of the algorithm are studied in the paper.
The ergo support system: an integrated set of tools for prototyping integrated environments
Authors: Peter Lee, Frank Pfenning, Gene Rollins, William Scherlis
Venue: Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments (1989)

The Ergo Support System (ESS) is an engineering framework for experimentation and prototyping to support the application of formal methods to program development, ranging from program analysis and derivation to proof-theoretic approaches. The ESS is a growing suite of tools that are linked together by means of a set of abstract interfaces. The principal engineering challenge is the design of abstract interfaces that are semantically rich and yet flexible enough to permit experimentation with a wide variety of formally-based program and proof development paradigms and associated languages. As part of the design of ESS, several abstract interface designs have been developed that provide for more effective component integration while preserving flexibility and the potential for scaling. A benefit of the open architecture approach of ESS is the ability to mix formal and informal approaches in the same environment architecture. The ESS has already been applied in a number of formal methods experiments.
Architectural support for synchronous task communication
Authors: F. J. Burkowski, G. V. Cormack, G. D. P. Dueck
Venue: ACM SIGARCH Computer Architecture News (1989)

This paper describes the motivation for a set of intertask communication primitives, the hardware support of these primitives, the architecture used in the Sylvan project which studies these issues, and the experience gained from various experiments conducted in this area. We start by describing how these facilities have been implemented in a multiprocessor configuration that utilizes a shared backplane. This configuration represents a single node in the system. The latter part of the paper discusses a distributed multiple node system and the extension of the primitives that are used in this expanded environment. This research is funded by a strategic grant from the Natural Sciences and Engineering Research Council of Canada (Grant No. G1581).
Problem solving performance and display preference for information displays depicting numerical functions
Authors: Mary J. LaLomia, Michael D. Coovert, Eduardo Salas
Venue: ACM SIGCHI Bulletin (1988)

As the amount of information accessible via computer systems increases, so do problems associated with presenting information that can be assimilated easily and accurately. Many researchers advocate the graphical presentation of information to allow for effortless perception and organization of information. Research in many diverse areas has focused on determining effective information presentation. Educational researchers compared graphical and tabular displays in classroom settings (Rigney amp; Lutz, 1976; Washburne, 1927) and results indicate pictorial or graphical representations effectively aid problem solving performance. Statisticians contributing to this area have concentrated on design aspects of graphs and tables, and have produced manuals describing design guidelines. Research generated by statisticians (Carter, 1947;1948a;1948b) indicates that graphs enhanced performance for tasks requiring data interpolation, while tables enhanced performance for tasks requiring the reading of specific values. The major focus from the Human Factors perspective concerns general design issues, such as brightness, contrast, and color. Tullis (1981) compared tabular and graphical displays for a telephone diagnostic task and found no differences for type of display. Schutz (1961) compared line, vertical bar, and horizontal bar graphs for a trend analysis task and found subjects performed best with the line graph, followed by the vertical bar and lastly with the horizontal bar graph.
Handling Timing Errors in Distributed Programs
Authors: A. J. Gordon, R. A. Finkel
Venue: IEEE Transactions on Software Engineering (1988)

The authors describe a tool called TAP, which is defined to aid the programmer in discovering the causes of timing errors in running programs. TAP is similar to a postmortem debugger, using the history of interprocess communication to construct a timing graph, a directed graph where an edge joins node x to node y if event x directly precedes event y in time. The programmer can then use TAP to look at the graph to find the events that occurred in an unacceptable order. Because of the nondeterministic nature of distributed programs, the authors feel a history-keeping mechanism but always be active so that bugs can be dealt with as they occur. The goal is to collect enough information at run time to construct the timing graph if needed. Since it is always active, this mechanism must be efficient. The authors also describe experiments run using TAP and report the impact that TAP's history-keeping mechanism has on the running time of various distributed programs.
Temporal ontology and temporal reference
Authors: Marc Moens, Mark Steedman
Venue: Computational Linguistics (1988)

A semantics of temporal categories in language and a theory of their use in defining the temporal relations between events both require a more complex structure on the domain underlying the meaning representations than is commonly assumed. This paper proposes an ontology based on such notions as causation and consequence, rather than on purely temporal primitives. A central notion in the ontology is that of an elementary event-complex called a "nucleus." A nucleus can be thought of as an association of a goal event, or "culmination," with a "preparatory process" by which it is accomplished, and a "consequent state," which ensues. Natural-language categories like aspects, futurates, adverbials, and when-clauses are argued to change the temporal/aspectual category of propositions under the control of such a nucleic knowledge representation structure. The same concept of a nucleus plays a central role in a theory of temporal reference, and of the semantics of tense, which we follow McCawley, Partee, and Isard in regarding as an anaphoric category. We claim that any manageable formalism for natural-language temporal descriptions will have to embody such an ontology, as will any usable temporal database for knowledge about events which is to be interrogated using natural language.
Stimulating change through usability testing
Authors: J. S. Dumas
Venue: ACM SIGCHI Bulletin (1989)

Usability testing is often viewed as a way to improve the usability of products. Testing can, however, have a larger, long-range influence on the way an organization develops its products. As a test specialist, you can use a usability test or set of tests to diagnose such factors as the effectiveness of product design technologies, the technical and managerial skills of the people who produce products, and how well the members of a design team are working together. To make diagnoses at this level, you must keep a focus on the underlying causes of the strengths and weaknesses of the usability of products. To have a long-range impact on the way an organization develops products, usability test specialists need to view themselves as change agents. You must involve designers in test planning and execution, and write reports that speak about the underlying causes of the problems users have with products.
A randomized parallel branch-and-bound procedure
Authors: Richard Karp, Yanjun Zhang
Venue: Proceedings of the twentieth annual ACM symposium on Theory of computing (1988)

We present a universal randomized method called Local Best-First Search for parallelizing sequential branch-and-bound algorithms. The method executes on a message-passing multiprocessor system, and requires no global data structures or complex communication protocols. We show that, uniformly on all instances, the execution time of the method is unlikely to exceed a certain inherent lower bound by more than a constant factor.
SCHEDULE: a hypercube implementation
Authors: A. L. Beguelin
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

SCHEDULE, a tool for developing portable parallel Fortran programs, was converted for use on the Ncube hypercube. Developed at Argonne National Laboratory by Dongarra and Sorensen, SCHEDULE was originally intended for a shared memory system such as the Alliant FX/8 and the Cray-2. This work extends the utility of SCHEDULE by developing a version that runs on a local memory parallel processor, the Ncube hypercube. A master/slave (host/processing array) execution model is the foundation of the hypercube SCHEDULE implementation. The host maintains a queue of processes to be run on the hypercube. Processes, which are Fortran subroutines, are automatically scheduled on the individual processors by analyzing a user supplied dependency graph for the subroutines. The host initiates all of the processes running on the nodes and services requests from the nodes. Node processes may spawn other processes but only by requesting spawns from the host.
Code Optimization for Tagged-Token Dataflow Machines
Authors: A. P. Wim Böhm, J. Sargeant
Venue: IEEE Transactions on Computers (1989)

The efficiency of dataflow code generated from a high-level language can be considerably improved by both conventional and dataflow-specific optimizations. Such techniques are used in implementing the single-assignment language SISAL on the Manchester Dataflow Machine. The quality of code generated for numeric applications can be measured in terms of the ratio of total number of instructions executed to floating-point operations: the MIPS/MFLOPS ratio. Relevant features of the general-purpose single-assignment language SISAL and the Manchester Dataflow Machine are introduced. An assessment of the initial SISAL implementation shows it to be very expensive. A range of optimizations is then described.
A Renormalization Group Approach to Image Processing Problems
Authors: Basilis Gidas
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A method for studying problems in digital image processing, based on a combination of renormalization group ideas, the Markov random-field modeling of images, and metropolis-type Monte Carlo algorithms, is presented. The method is efficiently implementable on parallel architectures, and provides a unifying procedure for performing a hierarchical, multiscale, coarse-to-fine analysis of image-processing tasks such as restoration, texture analysis, coding, motion analysis, etc. The method is formulated and applied to the restoration of degraded images. The restoration algorithm is a global-optimization algorithm applicable to other optimization problems. It generates iteratively a multilevel cascode of restored images corresponding to different levels of resolution, or scale. In the lower levels of the cascade appear the large-scale features of the image, and in the higher levels, the microscopic features of the image.
Negative Results for Equivalence Queries
Authors: Dana Angluin
Venue: Machine Learning (1990)

We consider the problem of exact identification of classes of concepts using only equivalence queries. We define a combinatorial property, approximate fingerprints, of classes of concepts and show that no class with this property can be exactly identified in polynomial time using only equivalence queries. As applications of this general theorem, we show that there is no polynomial time algorithm using only equivalence queries that exactly identifies deterministic or nondeterministic finite state acceptors, context free grammars, or disjunctive or conjunctive normal form boolean formulas.
Navigational aids and learning styles: structural optimal training for computer users
Authors: Lori A. Cohan, Sandra L. Newsome
Venue: ACM SIGCHI Bulletin (1988)

In this highly technical world, computers have become increasingly important in many phases of our lives, including the traditional office. With the influx of computers and automation, many workers previously unfamiliar with sophisticated technology must now learn how to use relatively complex computer systems. For these workers, learning a computer system may be achieved through personal (or class) instruction, reading, direct "hands-on" experience with the computer or some combination of these methods. In order to achieve effective training programs, more attention must be devoted to evaluating learning styles (e.g., active versus passive) and training (e.g., graphical versus textual descriptions).
Indexing medical reports in a multimedia environment: the RIME experimental approach
Authors: C. Berrut, Y. Chiaramella
Venue: ACM SIGIR Forum (1989)

This paper focuses on the RIME system aimed to the indexing of medical reports in a multimedia environment. This particular application is viewed as representative of a large set of still unanswered needs of large communities of users: domain experts dealing with on-line specialized documentation such as software engineers, medical specialists and so on. In this application textual information appears as an interesting media to access related pictures in the data base. After the presentation of the application and a study of the particular corpus involved we define a semantic model for the documents which is based on a Conceptual Language. Then we detail the indexing process and its various linguistic components which perform the translation of every medical report according to this semantic model.
Need of electronic tools in educational programmers and the impact in developing countries
Authors: Y. V. Subrahmanyam
Venue: Proceedings of the ACM SIGCPR conference on Management of information systems personnel (1988)

Concepts of distance education is slowly getting popular in many countries. In addition, all the production centered organisations have identified the need for continuous technical education for their employees to keep them abreast of current trends in their technological fields. There has been higher attention towards combating obsolescence in technical areas. All these issues call for quick spread of knowledge, frequent exchanges of developed technologies, more new trends in training areas, quick update of teachers about new areas etc. The best tool for all these topics is ' electronic media '. Teleconferencing, desktop publishing, videodiscs are some of the electronic tools playing major role in many countries. The present article discusses their detailed role, emphasizes their use in education and identifies the problem areas for developing countries for implementing these newer techniques.
LESTER: using paradigm cases in a Quasi-Precedential legal domain
Authors: K. A. Lambert, M. H. Grunewald
Venue: Proceedings of the 2nd international conference on Artificial intelligence and law (1989)

We are developing LESTER (Legal Expert System for Termination of Employment Review), a case-based reasoning program to advise in the area of unjust discharge from employment under collective bargaining agreements. LESTER uses paradigm cases to reason in a legal domain that is not governed by a strong concept of precedent. This paper describes the domain and gives an overview of the current version of the program.
Testing, understanding, and validating complex simulation models
Authors: J. Banks
Venue: Proceedings of the 21st conference on Winter simulation (1989)

This paper prescribes new methods for testing, understanding, and validating complex simulation models. The new methodology was developed by drawing analogies from systems in general, drawing inferences from specific systems, using statistical methods in novel ways, and by extending current validation methods.
An Evaluation of Multiple-Disk I/O Systems
Authors: A. L. Reddy, P. Banerjee
Venue: IEEE Transactions on Computers (1989)

Alternative ways of configuring an I/O subsystem with multiple disks to improve the I/O performance are considered. Specifically, the author consider disk synchronization, data declustering/disk striping, and a combination of both these approaches. They evaluate many different organizations that have not been considered before. The effects of block size and other parameters of the system are examined. Two different workloads are considered for the evaluation: a file/transaction system workload and a scientific applications workload. Through simulations it is shown that synchronized organizations perform better than other organizations at very low request rates; that there is a tradeoff in the amount of declustering/synchronization to be used in a system; and that systems with higher parallelism in reading a file perform better in a scientific workload.
Computer-Aided Software Development Process Design
Authors: C. Y. Lin, R. R. Levary
Venue: IEEE Transactions on Software Engineering (1989)

The authors describe an intelligent tool designed to aid managers of software development projects in planning, managing, and controlling the development process of medium- to large-scale software projects. Its purpose is to reduce uncertainties in the budget, personnel, and schedule planning of software development projects. It is based on dynamic models for the software development and maintenance life-cycle process. This dynamic process is composed of a number of time-varying, interacting developmental phases, each characterized by its intended functions and requirements. System dynamics is used as a modeling methodology. The resulting software life-cycle simulator (SLICS) and the hybrid expert simulation system of which it is a subsystem are described.
A Frequency Domain Algorithm for Multiframe Detection and Estimation of Dim Targets
Authors: B. Porat, B. Friedlander
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

An algorithm for detecting moving targets by imaging sensors and estimating their trajectories is proposed. The algorithm is based on directional filtering in the frequency domain, using a bank of filters for all possible target directions. The directional filtering effectively integrates the target signal, resulting in an improved signal-to-noise ratio. Working in the frequency domain facilitates a considerable reduction in computational requirements compared to time-domain algorithms. The algorithm is described in detail, and its false alarm and detection probabilities are analyzed.
Chisel: a system for creating highly interactive screen layouts
Authors: G. Singh, M. Green
Venue: Proceedings of the 2nd annual ACM SIGGRAPH symposium on User interface software and technology (1989)

The UofA* User Interface Management System (UIMS) generates graphical user interfaces based on a high-level description of semantic commands supported by the application. A main part of the UIMS, called Chisel, generates the presentation component of interfaces. Chisel selects interaction techniques, determines their attributes, and places them on the screen of the display device. While doing so it is capable of considering device properties, end user's preferences, and interface designer's guidelines. The aim of this paper is to discuss in detail the design and implementation of Chisel.
A new twist to fractals
Authors: D. M. Doerer, C. L. Sabharwal
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

Work in the area of Fractal Geometry has generally focused on a specific facet of the discipline at the expense of other interesting features. This approach often generates more questions than answers for the general audience due to the lack of unification across all views. It appears that a common thread to relate all aspects of fractal features is missing. This paper addresses this question and presents some new and fascinating results. In addition, a method for calculating the fractal dimension of asymmetric fractals is proposed, where a symmetric fractal is a special case of an asymmetric fractal. These asymmetric fractals have variable segment lengths. Fractals designed by introducing variable length segments seem to depict more natural looking phenomena than symmetric fractals designed with uniform length segments.
The treatment of negation in logic programs for representing legislation
Authors: R. Kowalski
Venue: Proceedings of the 2nd international conference on Artificial intelligence and law (1989)

Logic programs represent knowledge in the form of implications A if B1 and &hellip; Bn, n &ge; 0 where the conclusion A is an atomic formula and each condition Bi is either an atomic formula or the negation of an atomic formula. Any variables are assumed to be universally quantified, with a scope which is the entire sentence. A negated condition &ldquo;not Ai&rdquo; is deemed to hold if the corresponding positive condition Ai can be shown to fail to hold. This interpretation of negative conditions is called negation by failure (NBF) [Cl 78]. It has the characteristic that only the positive &ldquo;if-half&rdquo; of a definition needs to be given explicity. The negative &ldquo;only-if&rdquo; half is given implicitly by NBF. The obvious problem with NBF is that it supplies the only-if halves of implications, whether or not they are intended. I shall discuss a possible solution to this problem in the context of discussing the more general problem of representing negative conclusions. I shall focus on examples taken from our formalisation of the 1981 British Nationality Act (BNA) [SSKKHC 86]. I shall argue that many negative sentences can be regarded as integrity constraints and consequently can be eliminated by transformations such as those developed by Asirelli et al [ASM 85] and Kowalski and Sadri [KS 88]. Among such sentences are ones expressing prohibitions. The interpretation of prohibitions as integrity constraints suggests a possible approach to the treatment of deontic modalities.
A parallel implementation of the cylindrical algebraic decomposition algorithm
Authors: B. D. Saunders, H. R. Lee, S. K. Abdali
Venue: Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation (1989)

In this paper, we describe a parallelization scheme for Collins' cylindrical algebraic decomposition algorithm for quantifier elimination in the theory of real closed fields. We first discuss a parallel implementation of the computer algebra system SAC2 in which a complete sequential implementation of Collins' algorithm already exists. We report some initial results on the speedup obtained, drawing on a suite of examples previously given by Arnon.