ppxscal/embedding_network huggingface dataset:
Origins of the APT language for automatically programmed tools
Authors: Douglas T. Ross
Venue: ACM SIGPLAN Notices (1978)

The Air Force announced today that it has a machine that can receive instruction sin English, figure out how to make whatever is wanted, and teach other machines how to make it. An Air Force general said it will enable the United States to &ldquo;build a war machine that nobody would want to tackle.&rdquo;
Simulation of the four-way and two-way stop sign controlled intersections
Authors: J. Wesley Barnes, Robert M. Crisp,  Jr.
Venue: Proceedings of the 5th conference on Winter simulation (1971)

The analytical complexity of most automobile traffic intersections strongly directs the researcher to simulation as his tool of analysis. This tool, through the General Purpose Systems Simulation language (GPSS), was used in a recent investigation of two different stop sign controlled intersections. On the basis of a comprehensive literature search, the authors feel that the simulation models reflect, as nearly as is presently possible, the &ldquo;real-life&rdquo; situations. This paper, an out-growth of that investigation, includes discussions of: (1) basic assumptions of the models, (2) empirical probability distributions employed, (3) comparisons for a selected objective function, (4) comparisons of the models with existing literature, and (5) conclusions and recommendations for further research.
Embedded implicational dependencies and their inference problem
Authors: Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

It is shown that the general inference problem for embedded implicational dependencies (EIDs) is undecidable. For the more important case of finite inference (i.e., inference for finite data bases), the problem is not even recursively enumerable (r.e.); rather, it is complete in co-r.e. These results hold even for typed EIDs without equality, as well as for (untyped) template dependencies. The case for typed template dependencies remains open. The complexity of the inference problem for full dependencies has also been characterized - it is complete in exponential time for full implicational dependencies, and even for full typed template dependencies.
A control processor for a reconfigurable array computer
Authors: R. M. Jenevein, J. C. Browne
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

The problems of resource allocation, configuration and reconfiguration and network control must be solved before reconfigurable array computers can be effectively utilized. The interconnection networks proposed for these systems vary so that there has been no common or optimal solution proposed to these problems. This paper defines and describes the objectives, design, implementation and use of a network controller for a reconfigurable array computer, the Texas Reconfigurable Array Computer (TRAC). The objectives for the network controller are defined by management of the system state, the requirements of the operating system for functionality and the interface the network presents to the operating system. These objectives may be expected to have at least some commonality across most reconfigurable network architectures. The structure of the network controller given herein may offer guidance for development of controllers for other reconfigurable network architectures.
A tri-state logic family
Authors: Stephen C. Crist
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

A philosophy for implementation of three-value logic is introduced utilizing the tri-state concept found in conventional T2L buffers. By utilizing the high impedance state as a distinct logic input as well as output, a three-valued logic family can be constructed. Circuits that realize one functionally complete set of three-valued functions are described. The circuits are basically T2L in nature, and retain many of the desirable properties of that family. One supply is required, and no level conversion circuitry is necessary to interface between the tri-state circuits and conventional binary T2L.
Simulation of multiprocessor computer with local memories
Authors: Marcel Jiřina
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

The performance of one arrangement of the multiprocessor computer with local memories is established. Namely the following influences are shown: the processing time between two accesses to main memory, the time for page transfer, and the time needed for working up each such interrupt on the degree of usage of the processors and on the throughput of the system.
HOPT: A myopic version of the STOCHOPT automatic file migration policy
Authors: Frank Olken
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

The STOCHOPT automatic file migration policy (proposed by A.J. Smith) minimizes the expected retention and recall costs of an abitrarily sized file. We consider the application of the STOCHOPT policy to a file system in which the file inter-reference time (IRT) distributions are characterized by strictly monotonically decreasing hazard rates (SDHR) (also known as decreasing failure rates, DFR). We show that in this case the STOCHOPT policy can be simply stated in terms of a scaled hazard rate, i.e., the hazard rate divided by the file size. Such decreasing failure rate distributions have been used by Smith to model empirically observed file inter-reference times.
Fault simulation of digital logic utilizing a small host machine
Authors: Robert M. McClure
Venue: Proceedings of the 9th Design Automation Workshop (1972)

This paper describes a simulation system for use in the generation of test programs for logic networks. This system was designed and implemented by Telpar, Inc. specifically for use in providing a commercial service for the generation of digital test programs. The simulator described here was originally written in the fall of 1970, and has been in constant use since. There have been more or less continuous improvements, but the basic system has remained unchanged since its original implementation.
Multiple Wielandt deflations in the numerical solution of singular integral equations of potential theory
Authors: M. S. Lynn, W. P. Timlake
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

A technique for obtaining numerical approximations to Equation (1) will be briefly discussed. The convergence (under appropriate assumptions) of these approximations to a solution of Equation (1) has been shown elsewhere (see references 1,4). The emphasis here will be on the efficient solution of the linear algebraic systems of equations which arise from the approximating scheme. The solution of the algebraic equations will be based on Jacobi iteration, whose rate of convergence is enhanced by the use of multiple deflations of the Wielandt type 5,6,7,8,9 the key factor being that certain eigenvalues and eigenvectors are known a priori. These eigenvalues and eigenvectors may be used to obtain an equivalent system of equations. &ldquo;Equivalent&rdquo; is used to mean that the solution to the original algebraic equations may be obtained from the new system in relatively few operations. The new system has the computational advantage that the spectral radius of the appropriate iteration matrix has been considerably reduced.
A dual processor VAX 11/780
Authors: George H. Goble, Michael H. Marsh
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

This paper describes the design of a dual processor VAX 11/780 built at the Purdue University Electrical Engineering School. It covers the conversion of a standard single processor VAX 11/780 into a dual processor system. A detailed description of hardware modifications performed and a parts list are included. The dual processor VAX is currently running a modified version of the UNIX (Fourth Berkeley Distribution) operating system. Because of licensing restrictions, operating system modifications will only be covered in general. Finally some performance evaluation will be discussed along with the problems encountered.
Applications of symbolic and algebraic manipulation systems II (Paper-Panel Session)
Authors: James Griesmer
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Papers in this section will treat various applications of symbolic and algebraic manipulation systems, in which techniques for handling definite integrals are required. The session will also contain a panel discussion covering the area of definite integration.
Generalized path expressions: A high level debugging mechanism (Preliminary Draft)
Authors: Bernd Bruegge, Peter Hibbard
Venue: Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging (1983)

This paper introduces a modified version of path expressions called Path Rules which can be used as a debugging mechanism to monitor the dynamic behavior of a computation. Path rules have been implemented in a remote symbolic debugger running on the Three Rivers Computer Corporation PERQ computer under the Accent operating system.
Results of the use of a recursive function translator
Authors: Edward J. Krall
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

A recursive function interpreter was used to good effect in an undergraduate course in elementary automata theory. Although the functions were translated into combinations of Turing machines, the interpreter is not to be construed to be a Turing Table processor. The results in this paper reflect both the author's subjective judgment, and the compilation of statistics from a questionnaire given to the students. The primary effect was not the understanding of Turing machines or recursive functions but rather the enthusiasm for such study evidenced by the computer science students taking the course. The evaluation of the interpreter is an on-going process, extending even to students on the sophomore and junior level. This paper describes both the simulator and the effects of its use, as well as some general principles concerning such devices.
Compositions of n tree transducers
Authors: W. F. Ogden, W. C. Rounds
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

Top-down tree transductions, introduced as models of syntax-directed translations and transformational grammars in [12] and [11], are not closed under relational composition. However, closure under relational composition is not always needed; for example, in establishing closure properties of surface sets.(Surface sets are tree-languages obtained as ranges of transductions.) One such closure property, whether the image of a surface set under a transduction is a surface set, remained open. In this paper, we show that transductions need not preserve surface sets. In fact, we exhibit a hierarchy of tree languages obtained by successive transductions. We do not have a good proof that the hierarchy inclusions are proper, but there are strong reasons for so suspecting. As is customary in tree automata papers, we spend some effort on notation. This time, we present a list of first-order axioms for plane (ordered) trees. The Gorn-Brainerd-Doner representation of trees as prefix-closed sets of sequences ([5],[2],[3]) really is a representation in the sense that any (well-founded) abstract tree satisfying our axioms is isomorphic to a prefix-closed set. We then adopt Rosen's notation [10] for trees in subsequent definitions. In our opinion, however, a universally acceptable notation remains to be discovered.
A ldquo;non-programming&rdquo; introduction to programming concepts
Authors: E. F. Ecklund,  Jr.
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

This paper discusses introducing students to programming concepts before they study a high-level language. Algorithm specification using flowcharts, and implementation of certain algorithms on a demonstration computer programmed in decimal machine code provide a functional basis which extends by way of analogy to sound programming concepts for both high-level languages and assembler languages.
On the optimum two-dimensional allocation problem
Authors: M. J. Haims
Venue: Proceedings of the 15th Design Automation Conference (1978)

A template layout problem of great interest is to determine the maximum number of two-dimensional shapes that can be cut from a sheet of stock material without having to search through all possible arrangements. An algorithm is proposed to computerize the layout of parts on a stock sheet in order to minimize waste. The method can be extended to three-dimensional shapes.
An adaptive tree pruning system: A language for programming heuristic tree searches
Authors: Edward W. Kozdrowicki
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The tree pruning system (TPS) consists of a set of commands designed for programming heuristic tree searches. This system was assembled as a pre-FORTRAN compiler similar in principle to that of FORMAC. TPS and FORTRAN IV statements are used together for writing programs. In the present implementation, each TPS command must be preceded by an asterisk (*) in the first column to distinguish it from a regular FORTRAN statement. TPS has the two-fold purpose of being a language for manipulating tree-structured data formations and also encompassing machine-learning capability.
APL as a foundation for a Marketing Planning and Analysis System
Authors: W. F. Jarvis, H W. Wobbe, H. Carim
Venue: Proceedings of the sixth international conference on APL (1974)

THIS PAPER DESCRIBES THE DEVELOPMENT OF AN INTERACTIVE MARKETING PLANNING AND ANALYSIS SYSTEM, WRITTEN COMPLETELY IN THE APL NOTATION, @@R A MAJOR, MULTI-DIVISIONAL MANUFACTURING FIRM. AS IT STANDS AT THE @@MENT, THE SYSTEM HAS APPROXIMATELY 27-MILLION BYTES OF DATA IN @@LINE STORAGE AND IS ACCESSED IN THE ORDER OF 2,000 TIMES PER MONTH @@OM FIVE CITIES ACROSS CANADA. THERE IS A DISCUSSION OF THE DATA-BASE PROBLEMS AND OPPORTUNITIES @@CING THE COMPANY, AND ITS EFFORTS TO IMPROVE THEIR @@FORMATION-PROCESSING ABILITIES OVER THE YEARS. THE SHORTCOMINGS OF @@BOL-ORIENTED BATCH PROCESSING METHODS AND COMMERCIAL TIME-SHARING @ERVICES OFFERING BASIC AND FORTRAN LANGUAGES ARE BRIEFLY DESCRIBED. @@E STEPS IN DESIGNING THE APL SYSTEM AND MAKING IT OPERATIONAL ARE @RESENTED, AS WELL AS A NON-TECHNICAL DESCRIPTION OF THE KEY @@TRIBUTES OF THE SYSTEM ITSELF. THE MAJOR POINT MADE BY THE PAPER IS THE IMPACT OF SUCH AN INTERACTIVE SYSTEM ON THE MANAGEMENT PROCESS, AND HOW SUCH AN IMPACT @AS DEMONSTRABLY MADE MORE EFFECTIVELY THROUGH USING THE APL NOTATION @HAN HAD BEEN POSSIBLE THROUGH ANY OF THE OTHER APPROACHES THAT THE COMPANY HAD TRIED.
Problem Solving using microcomputers
Authors: John Mellby, Fred Gruenberger, Terris B. Wolff
Venue: Proceedings of the ACM '82 conference (1982)

Our panelists will briefly discuss the various aspects of Problem Solving using microcomputers indicated below. This will be followed by a general discussion with audience participation, comment and questions. We hope you will participate.
An optimal solution to a wire-routing problem (preliminary version)
Authors: Martin Tompa
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

A wire-routing problem which arises commonly in the layout of circuits for very large scale integration (VLSI) is discussed. Given the coordinates of terminals u1, u2, ..., un of one component and v1, v2, ..., vn of another, the problem is to lay out n wires so that the ith wire connects ui to vi, and adjacent wires are separated at least by some fixed distance. The solution with minimum wire length is characterized, and an optimal algorithm which constructs it is presented.
The preemption capability in GPSS
Authors: Thomas J. Schriber
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

One of the important capabilities offered by the General Purpose Simulation Language (GPSS) is the preemption capability. This capability is of use in modeling many real situations in which it is necessary to interrupt an ongoing activity before it comes to completion on a natural basis, e.g., failure of equipment in a manufacturing context; completion of an input or output activity in a multiprogrammed computing system; routing of roving vehicles, such as police cruisers, to a point of crisis; or simply providing immediate service to a high-priority demand which has occurred. Preemption logic is potentially quite complicated, including as it does the need to specify how the interrupted ongoing activity is to be handled, both at the time of preemption and subsequent to that time. This tutorial will explore various aspects of the preemption topic as implemented in GPSS.
Task allocation in distributed systems: A survey of practical strategies
Authors: Camille C. Price
Venue: Proceedings of the ACM '82 conference (1982)

A general distributed processing model is formulated, and the problem of task allocation is defined. A survey is made of various task allocation strategies that have been proposed in recent literature. Each strategy is described briefly with respect to the particular distributed processing model for which it is designed, and its tested performance and intended applicability are discussed.
The evolution of programs: Program abstraction and instantiation
Authors: Nachum Dershowitz
Venue: Proceedings of the 5th international conference on Software engineering (1981)

Our goal is to develop techniques for abstracting a given set of concrete programs into a program schema and for instantiating a schema to satisfy concrete specifications. For example, from two programs using the binary-search method, one to compute quotients and another to compute cube-roots, an abstract schema is derived that embodies the method and that can be instantiated to solve similar new problems. We suggest the formulation of analogies as a basic tool in program abstraction. An analogy is first sought between the specifications of the given programs; this yields an abstract specification that may be instantiated to any of the given concrete specifications. The analogy is then used as a basis for transforming the existing programs into an abstract schema that represents the embedded technique. The invariant assertions and correctness proofs of the given programs are used to complete the analogy.
ADVISER&mdash;a program which advises students on courses
Authors: Eric M. Timmreck
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

A program to advise students at the University of Wisconsin concerning Computer Sciences courses has been written and experimentally used. The program is written in B5500 Algol and runs on the B5500 with remote teletypes. The goal here was to write a program which would give students good advice on courses, using criteria as similar as possible to those normally used by a human adviser. It seemed that in certain areas the program would be able to surpass the average human, such as in thoroughness in investigating the student's background and in knowledge of the content of all the courses offered by the Computer Sciences Department. Certain other areas would not be amenable to computer handling, such as the use of grapevine information concerning courses and the recognizing of human personality traits which might influence the speed at which a student is to progress. In spite of these limitations, it was believed that a program could do a good job of advising in a very large number of cases, though to be safe the student would then want a human adviser to check over and supplement the program's output.
A small contribution to editing with a syntax directed editor
Authors: Marvin V. Zelkowits
Venue: ACM SIGPLAN Notices (1984)

The simple design of a syntax directed editor has made them a popular research topic over the last few years; however, in practice little development time is spent in actually entering program text. Most of the effort is devoted to program maintenance. This means that the editor has to be able to handle changes easily - a task that most syntax editors handle poorly. This paper describes a syntax editor and outlines the features that make editing such programs practical. It includes a bottom up parser that is used in a variety of ways within the editor.
A reliability model for Markov structured software
Authors: B. Littlewood
Venue: Proceedings of the international conference on Reliable software (1975)

A system is considered in which switching takes place between sub-systems according to a continuous parameter Markov chain. Failures may occur in Poisson processes in the sub-systems, and in the transitions between sub-systems. All failure processes are independent. The overall failure process is described exactly and asymptotically for highly reliable sub-systems. An application to process-control computer software is suggested.
The problem of producing teachers with computing expertise within the school system
Authors: Annie G. Brooking
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

(This paper has been accepted for publication in the Proceedings, but the photo-ready form was not delivered in time. Copies of the paper should be available upon request at the presentation.)
Simulation of dispatching algorithms in a multiprogramming environment
Authors: N. S. Losapio, William G. Bulgren
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

CPU scheduling or dispatching in computer systems is surveyed. In order to study and evaluate a dispatching algorithm, a simulation model of a dispatching algorithm for multiprogramming operating system has been devised and programmed. Essential elements which have been included are the job environment, the computer system environment, and the user environment. The model is patterned basically after GECOS III, on the H-600 line computer. Some results of the investigation are presented, such as lengths of various queues, I/O time, processor utilization, expected time in various queues, throughput and flexibility.
How much cai is hidden in commercial software?
Authors: Helen L. Sobel
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

It is somewhat astonishing to find that a well-developed software package designed for business uses provides an extremely interesting teaching instrument with an as yet unrealized potential For many years report generating systems such as REPORTER have been extensively used as work horses in business and industry. Administrators in these areas require up-to-date information presented in an understandable, well-organized form. The business executive may need a daily, weekly, or monthly report of the sales records of the company's employees, listing for each sales representative the number of items sold in each category, the amount of income produced, the number of items returned in each category, etc. The Burroughs REPORT writER is based upon an entirely different premise which not only permits but encourages user involvement and understanding. The programs which create each REPORT are accessible, small, modular in structure, and limited to the specific options requested by the user. While it can be easily used in a non-technical manner, and need not be explored in any depth, there are no formidable barriers to a more intelligent mastery of this tool. The unique characteristic of the Burroughs REPORTER is its production of an independent COBOL program for each set of specifications entered. It