ppxscal/embedding_network huggingface dataset:
Small domains spell fast strictness analysis
Authors: R. C. Sekar, Shaunak Pawagi, I. V. Ramarkrishnan
Venue: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1989)

Use of strictness analysis in parallel evaluation and optimization of lazy functional languages is well known. The first formal treatment of strictness analysis appeared in Mycroft's seminal work which however dealt only with flat domains. Unlike flat domains, strictness analysis on non-flat domains involves determining how a function transforms a demand (degree of strictness) on its output into a demand on its arguments. Solutions to this problem in its full generality require large domains and appear both complex and expensive to implement. However, only two kinds of demands arise naturally in lazy normalization of terms, viz., e-demand (normal form needed) and d-demand (root stable or head normal form needed). Based on this observation, we identify three useful forms of strictness for non-flat domains - ee, dd and de. Each of these three forms of strictness play an important role in evaluation of functional programs. Specifically, ee strictness is used for transforming call-by-need to call-by-value and dd strictness is useful in repairing violations of strong sequentiality of equational programs as well as in a critical optimization step used in rewriting implementations of such languages. We present intuitively simple methods to compute them. Our methods are computationally efficient as they are based on small domains (1 point for ee and dd and 2 points for de). They are powerful enough to extract all useful strictness information in practice and are general enough to handle functions defined by rewrite rules. We are able to reason about all user defined data types within a single framework and also handle polymorphism.
Semantic analysis in a concurrent compiler
Authors: V. Seshadri, S. Weber, D. B. Wortman, C. P. Yu, I. Small
Venue: ACM SIGPLAN Notices (1988)

Traditional compilers are usually sequential programs that serially process source programs through lexical analysis, syntax analysis, semantic analysis and code generation. The availability of multiprocessor computers has made it feasible to consider alternatives to this serial compilation process. The authors are currently engaged in a project to devise ways of structuring compilers so that they can take advantage of modern multiprocessor hardware. This paper is about the most difficult aspect of concurrent compilation: concurrent semantic analysis.
Fast hypergraph partition
Authors: A. B. Kahng
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

We present a new &Ogr;(n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are &Ogr;(n2 log n). Our approach is based on the intersection graph G dual to the input hypergraph. Paths in G are used to construct partial bipartitions which can be completed optimally. The method is provably good and, in particular, obtains optimum results for &ldquo;difficult&rdquo; inputs, i.e., hypergraphs with smaller than expected minimum cutsize. Computational results for a wide range of inputs are also discussed.
Data functions, datalog and negation
Authors: Serge Abiteboul Richard Hull
Venue: Proceedings of the 1988 ACM SIGMOD international conference on Management of data (1988)

Datalog is extended to incorporate single-valued &ldquo;data functions&rdquo;, which correspond to attributes in semantic models, and which may be base (user-specified) or derived (computed). Both conventional and stratified datalog are considered. Under the extension, a datalog program may not be consistent, because a derived function symbol may evaluate to something which is not a function. Consistency is shown to be undecidable, and is decidable in a number of restricted cases. A syntactic restriction, panwise consistency, is shown to guarantee consistency. The framework developed here can also be used to incorporate single-valued data functions into the Complex Object Language (COL), which supports deductive capabilities, complex database objects, and set-valued data functions. There is a natural correspondence between the extended datalog introduced here, and the usual datalog with functional dependencies. For families &PHgr; and &Ggr; of dependencies and a family of datalog programs &Lgr;, the &PHgr;-&Ggr; implication problem for &Lgr; asks, given sets F &sube; &PHgr; and G &sube; &Ggr; and a program P in &Lgr;, whether for all inputs I, I @@@@ F implies P(I) @@@@ G. The FD-FD implication problem is undecidable for datalog, and the TGD-EGD implication problem is decidable for stratified datalog. Also, the &Oslash;-MVD problem is undecidable (and hence also the MVD-preservation problem).
An ASIC methodology for mixed analog-digital simulation
Authors: M. Rumsey, J. Sackett
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

Behavioral descriptions of analog circuits simulate faster than transistor level descriptions. In ASIC and system level simulations they allow total system verification of larger designs than would be possible at transistor level. A system known as AMP simplifies the modeling task by offering a mechanism to develop models via parameterized building blocks. An additional benefit is that the resulting models are compatible with a model linker which can interface the analog models to a purely digital logic simulator.
Lazy evaluation and the logic variable
Authors: K. Pingali
Venue: Proceedings of the 2nd international conference on Supercomputing (1988)

Functional languages can be enriched with logic variables to provide new computational features such as incremental construction of data structures. In this paper, we present a novel application for logic variables that highlights their importance: we argue that they are essential for explicating the process of demand propagation in lazy evaluation of functional programs. There are two applications of this result. First, it provides a 'RISC' approach to lazy evaluation that has several advantages over implementations based on literal graph reduction. Second, it suggests new strictness analysis algorithms in which logic variables play an important role.
Teaching simulation with Pascal_SIM
Authors: R. M. O'Keefe, R. M. Davies
Venue: Proceedings of the 21st conference on Winter simulation (1989)

Pascal_SIM is a tool kit for producing simulations in Pascal, developed specifically for teaching discrete event simulation. We have gained considerable experience with Pascal_SIM, and have produced a text called Simulation Modelling with Pascal (published by Prentice Hall International) that is based upon these routines. This tutorial is an introduction to using Pascal and Pasca_SIM as a basis for teaching simulation.
Integrated support for project management
Authors: D. Dixon
Venue: Proceedings of the 10th international conference on Software engineering (1988)

Conventional `off-line` project management tools are being overtaken by integrated project support environments which are capable of imposing more direct control over project activities. Such environments can lead to a more systematic approach to planning, monitoring and controlling software development. This paper describes the facilities offered by ISTAR For integrated support of project management.
The bookmark and the compass: orientation tools for hypertext users
Authors: Mark Bernstein
Venue: ACM SIGOIS Bulletin (1988)

The power of hypertext stems chiefly from the complex networks of conceptual links which hypertext documents can render explicit. This paper describes an array of orientation tools which help readers to choose a course through a complex information network without undue confusion or discomfort, while retaining the excitement and spontaneity users often experience when exploring complex information environments.
Contributions to teaching object-oriented design and programming
Authors: K. J. Lieberherr, A. J. Riel
Venue: Conference proceedings on Object-oriented programming systems, languages and applications (1989)

We provide a formal agenda for teaching the object-oriented paradigm in a programming language independent manner, and a tool which supports our teaching approach. Our proposal for a comprehensive study of the subject includes an ordered set of objectives designed to guide the uninitiated user from zero knowledge about object-oriented programming through class definitions, inheritance, subtyping, and the parameterization of classes. This set of graded objectives provides both a useful metric for gauging a student's progress, and a facility through which users can begin their studies at a level commensurate with their experience.
The trap as a control flow mechanism
Authors: J. A. Chandross, H. V. Jagadish, A. Asthana
Venue: Proceedings of the 21st annual workshop on Microprogramming and microarchitecture (1988)

In this paper we show how traditional hardware trap handlers can be generalized into an efficient vehicle for conditional branches. These ideas are being used in a VLSI processor under design. Conditional branches are often a major bottleneck in scheduling microinstructions on a horizontally microcoded machine. Several tests and conditional branches are frequently ready for scheduling simultaneously, but only one test and branch is possible in a given cycle. The trap facility is traditionally treated as an interrupt scheme for the notification of exceptional conditions. In this paper we study how the role of the trap mechanism may be expanded to include the parallel evaluation of arbitrary user-specified tests, and the concomitant performance benefits.
Algorithms for Image Component Labeling on SIMD Mesh-Connected Computers
Authors: R. E. Cypher, J. L. C. Sanz, L. Snyder
Venue: IEEE Transactions on Computers (1990)

Two parallel algorithms are presented for the problem of labeling the connected components of a binary image. The machine model is an SIMD two-dimensional mesh-connected computer consisting of an N*N array of processing elements, each containing a single pixel of an N*N image. Both new algorithms use a local shrinking operation defined by S. Levialdi (1972) and have time complexities of O(N log N) bit operations, making them the fastest local algorithms for the problem. Compared to other approaches with similar or better asymptotic time complexities, this local approach greatly simplifies the algorithms and reduces the constants of proportionality by nearly two orders of magnitude, making them the first practical algorithms for the problem. The two algorithms differ in the amount of memory required per processing element; the first uses O(N) bits, while the second uses a novel compression scheme to reduce the requirement to O(log N) bits.
Operational knowledge acquisition problems for air traffic expert controller
Authors: A. J. Kornecki
Venue: Issue 108 (April 1989) (1989)

Air Traffic Control System (ATC) is a service of the Federal Aviation Administration to accomplish a safe and expeditious flow of the air traffic in the National Airspace System. To assist in AT controller training and to improve the future ATCS operation there is a need to design a computer program that would imitate the decision process of an experienced controller. Such a program, given a set of data describing a current traffic situation, would first analyze, recognize, and process the data to generate a set of facts constituting the bases for the controller's action. Then, using an available ATC operational knowledge base, the program would generate an appropriate controller action. We can differentiate two types of actions. The first type of actions reflect the final controller decision. The second type are actions initializing a request to acquire more data to solve the problem.
An optimal linked list prefix algorithms on a local memory computer
Authors: Y. Han
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

We present a deterministic parallel algorithm for the linked list prefix problem. It computes linked list prefix for an input list of n elements in time O(n/p+logn) on a local memory PRAM model using p processors and p shared memory cells. We also show that a maximal matching for a linked list can be computed in O(logG(n)) time with n processors and n shared cells.
A Graphical Data Manipulation Language for an Extended Entity-Relationship Model
Authors: Bogdan Czejdo, Ramez Elmasri, Marek Rusinkiewicz, David W. Embley
Venue: Computer (1990)

A user can formulate database queries and updates graphically, by manipulating schema diagrams. The authors based the graphical data manipulation interface on the entity-relationship (ER) model because of its widespread use and increasing popularity. They use an extended ER model incorporating various forms of generalization and specialization, including subset, union and partition relationships. They call their model the extended conceptual entity-relationship or ECER model. A comparison with other graphical entity-relationship interfaces is included.
Process design of oil and gas production facilities using expert systems
Authors: Hafez Aghili, George Montgomery, Al Amlani, Jatin Shah
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

An expert system known as the Automated Project Design System (APDS&trade;) has been developed to assist process and facilities engineers in performing preliminary feasibility studies, optimization studies, and provide the basic information required for the initiation of the detailed design for offshore oil and gas production facilities. Given the feedstock and product specifications, the expert system produces a preliminary process flow diagram showing all major pieces of equipment and determines all utility system requirements. Rigorous material and energy balance calculations are done via an interface to a conventional process simulator. All of the required equipment is sized and an estimated cost for each item is produced. An overall cost estimate for the production facility is also produced. Various reports, drawings, and equipment datasheets are generated to summarize the final results. The system is extremely flexible and allows the user to easily change input parameters, to customize equipment sizes and costs and to produce customized reports containing whatever information is desired. APDS&trade; runs on Symbolics 3600 series computers. APDS&trade; uses Intellicorp's Knowledge Engineering Environment (KEE&trade;) expert system development shell and makes extensive use of Symbolics ZetaLisp and Common Lisp. The system also uses Hyprotech's Hysim&trade; process simulator to perform process calculations. It runs on a PCAT computer which is linked to the Symbolics computer.
An extensible rule-based language with complex objects and data-functions
Authors: Serge Abiteboul, Stephane Grumbach, Agnès Voisard, Emmanuel Waller
Venue: Proceedings of the second international workshop on Database programming languages (1989)

A rule-based database language for complex objects is studied. An algebraic evaluation of rules based on range-restriction conditions is presented. The inference of variable types is considered. The language is extended using external functions and predicates that are defined in a host programming language. The impact of this extension on the power of the language is investigated. Finally, a toy implementation of the language and future extensions are described.
Improved Techniques for Estimating Signal Probabilities
Authors: Balakrishnan Krishnamurthy, Ioannis G. Tollis
Venue: IEEE Transactions on Computers (1989)

The problem is presented in the context of some recent theoretical advances on a related problem, called random satisfiability. These recent results indicate the theoretical limitations inherent in the problem of computing signal probabilities. Such limitations exist even if one uses Monte Carlo techniques for estimating signal probabilities. Theoretical results indicate that any practical method devised to compute signal probabilities would have to be evaluated purely on an empirical basis. An improved algorithm is offered for estimating the signal probabilities that takes into account the first-order effects of reconvergent input leads. It is demonstrated that this algorithm is linear in the product of the size of the network and the number of inputs. Empirical evidence is given indicating the improved performance obtained using this method over the straightforward probability computations. The results are very good, and the algorithm is very fast and easy to implement.
Nested historical relations
Authors: A. U. Tansel, L. Garnett
Venue: ACM SIGMOD Record (1989)

The paper extends nested relations for managing temporal variation of complex objects. It combines the research in temporal databases and nested relations for nontraditional database applications. The basic modelling construct is a temporal atom as an attribute value. A temporal atom consists of two components, a value and temporal set which is a set of times denoting the validity period of the value. We define algebra operations for nested historical relations. Data redundancy in nested historical relations is also discussed and criteria for well-structured nested relations are established.
On the Fractal Dimension of Computer Programs and its Application to the Prediction of the Cache Miss Ratio
Authors: Dominique Thiébaut
Venue: IEEE Transactions on Computers (1989)

Fractal geometry is proposed as a powerful measure of program behavior, and its application to the prediction of the miss ratio of programs in fully associative caches is presented. Programs are modeled as one-dimensional fractal random-walks. The fractal cache model is based on the parameterization of a program trace by a small number of constants, one of which is the fractal dimension of the program. The model is validated by trace-driven simulations of several program traces. With this model, it is possible to read the trace of a program once, and then predict the behavior of the miss ratio curve of that program in fully associative caches of varying sizes.
Proposal for a &ldquo;C virus&rdquo; database
Authors: D. Guinier
Venue: ACM SIGSAC Review (1989)

The need for a better knowledge of Self-Reproducing Programs (SRP's) alias "viruses", Worms, Trojan horses and other destructive things leads us to propose the establishment of a special database relative to them as suggested in the paper entitled "Biological versus Computer Viruses, A better understanding for a better defense".Such a C-VIRUS database will be useful to notify, describe and store new or known entities in a standard format and will help to discover the means of countering new risks?
Distributed scientific video movie making
Authors: W. E. Johnston, D. E. Hall, J. Hang, M. Rible, D. Robertson
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

We describe a versatile, low cost, video movie making system for generating and displaying scientific graphics from remote supercomputers. The system makes video movies by single frame animation from the output of time dependent, numerical simulations typically done on supercomputers. The system uses extensive data compression to permit its use over wide area, as well as local area networks. The system demonstrates an easily used, elementary visualization capability for time dependent data in a heterogeneous, distributed computing environment.
Higher-order abstract syntax
Authors: F. Pfenning, C. Elliot
Venue: ACM SIGPLAN Notices (1988)

We describe motivation, design, use, and implementation of higher-order abstract syntax as a central representation for programs, formulas, rules, and other syntactic objects in program manipulation and other formal systems where matching and substitution or unification are central operations. Higher-order abstract syntax incorporates name binding information in a uniform and language generic way. Thus it acts as a powerful link integrating diverse tools in such formal environments. We have implemented higher-order abstract syntax, a supporting matching and unification algorithm, and some clients in Common Lisp in the framework of the Ergo project at Carnegie Mellon University.
The Program of a Large Computation Center
Authors: John H. Curtiss
Venue: IEEE Annals of the History of Computing (1989)

There has been a considerable amount of discussion among members of the computing fraternity regarding the administration of computing: the selection of the program of a computation center, the right way to run the laboratory, and the area of responsibility for the validity of results. There are some computer laboratory directors, for example, who hold that the responsibilities of a computing extend only to the correct performance of arithmetic operations, and that the adequacy of the mathematical formulation of problems and suitability of the choice of numerical methods rest squarely on the shoulders of the client. Others admit that mathematical assistance to clients is desirable, but insist that the mathematicians' place is not in the machine room, which is to be considered sacred territory accessible only to a few chosen acolytes, mainly engineers.
Software Size Estimation of Object-Oriented Systems
Authors: Luiz A. Laranjeira
Venue: IEEE Transactions on Software Engineering (1990)

The strengths and weaknesses of existing size estimation techniques are discussed. The nature of software size estimation is considered. The proposed method takes advantage of a characteristic of object-oriented systems, the natural correspondence between specification and implementation, in order to enable users to come up with better size estimates at early stages of the software development cycle. Through a statistical approach the method also provides a confidence interval for the derived size estimates. The relation between the presented software sizing model and project cost estimation is also considered.
Efficient placement of audio data on optical disks for real-time applications
Authors: Clement Yu, Wei Sun, Dina Bitton, Qi Yang, Richard Bruno, John Tullis
Venue: Communications of the ACM (1989)

Optical disks are among the most promising secondary storage devices for data-intensive applications and database management systems. A means of optimizing the storage capacity of optical disks is presented here.
The Extra Stage Gamma Network
Authors: K. Y. Lee, W. Hegazy
Venue: IEEE Transactions on Computers (1988)

The augmented data manipulator (ADM), inverse augmented data manipulator (IADM), and the gamma network are based on the plus-minus-2/sup i/ connection patterns. In such a network, there exists multiple paths to connect a source S to a destination D except when S=D. The number of paths for (S,D) is a function of the tag value (D-S) modulo N, and the size of the network N. It is shown that by adding an extra stage to the PM2I interconnection network, multiple paths are provided for all the tag values including 0. The extra stage can be any stage out of n=log/sub 2/N stages of the original network. The analyses on the distribution of the number of paths for various tag values are performed for n possible choices of the extra stage. It is shown that the extra stage of 0, +1, -1 connection patterns gives the most uniform distribution, and also results in a 1-fault tolerant interconnection network.