ppxscal/embedding_network huggingface dataset:
Recursive data structures and related control mechanisms in APL
Authors: W. E. Gull, M. A. Jenkins
Venue: Proceedings of the eighth international conference on APL (1976)

A brief description of a recursive data structure extension for APL is given which allows the construction of tree-like data structures with no explicit sharing. The proposal includes new and extended primitive functions for constructing data structures and for selecting substructures and two operators which may be used to apply a function at every, node on the first level or at the leaves of a tree respectively. Examples are drawn from algebraic manipulation, computer graphics and natural language manipulation.
On the optimal evaluation of a set of bilinear forms
Authors: Roger W. Brockett, David Dobkin
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

Although general theories are beginning to emerge in the area of automata based complexity theory, there are very few general methods or even general problem formulations in the area of arithmetic complexity. In this paper we propose and defend a general model for studying bilinear multiplication in order to provide a common framework for discussing a wide class of problems. At the heart of a number of problems in minimizing the number of multiplications required to perform a calculation is a problem in matrix algebra relating to the expansion of a given set of matrices as linear combinations of rank one matrices. In this paper we make a systematic attack on this problem and derive some general results which unify and extend numerous known results. Among the new results given here to illustrate the strength of this approach is a new lower bound on the number of multiplications required for n by n matrix multiplication of 3n2-3n+1 which is independent of the subset of the reals with respect to which multiplication is regarded as free. An even sharper bound is obtained if this set is restricted to the integers.
What Employers Look For In Hiring Computer Science Graduates (Panel Discussion)
Authors: Robert F. Bartell, M. M. Irvine, Ken Rothmuller, John N. Shoosmith
Venue: Proceedings of the 1978 annual conference (1978)

The success of a Data Processing department depends upon its ability to solve problems and its ability to provide information. Therefore, candidates for the Data Processing profession should have: a. Knowledge of the business environment so that problems can be defined, b. Expertise in problem solving so that solutions can be designed, and c. Experience in computer technology so that solutions can be programmed and implemented. Of these areas, programming has always been given the most emphasis in the college curriculum. However, we may be giving too much attention to programming. While sound programming fundamentals are required in order to produce results that are reliable and correct, it must be remembered that programming is only a method for implementing solutions. Problem definition and the design of solutions are much more important than the technical aspects of programming. In the business world corporate managers are willing to exchange dollars for resolved problems. Concurrently, data processing managers are held accountable for results that are correct, solutions that address the real problem, and for solutions that do not create new problems. For these reasons, it is important for Data Processing Managers to employ people that can define problems accurately and that can design good solutions. The only way that Data Processing departments can be successful is to be of service to other departments by solving problems and by supplying correct and timely information. In this manner, our information systems will be valuable management tools rather than constant sources of aggravation.
Verifying programs by algebraic and logical reduction
Authors: Norihisa Suzuki
Venue: Proceedings of the international conference on Reliable software (1975)

Methods for verifying programs written in a higher level programming language are devised and implemented. The system can verify programs written in a subset of PASCAL, which may have data structures such as ARRAY, POINTER, and RECORD and control structures such as WHILE, REPEAT, FOR, PROCEDURE, FUNCTION and COROUTINE. The process of creation of verification conditions is an extension of the work done by lgarashi, London and Luckham (1972) which is based on the deductive theory by Hoare (1969). Verification conditions are proved using specialized simplification and proof techniques, which consist of an arithmetic simplifier, equality replacement rules, fast algorithm for simplifying formulas using propositional truth value evaluation, and a depth first proof search process. The basis of deduction mechanism used in this prover is Gentzen-type formal system. Several sorting programs including Floyd's TREESORT3 and Hoare's FIND are verified. It is shown that the resulting array is not only ordered but also a permutation of the input array This research was supported in part by the Advanced Research Projects Agency of the Office of the Secretary of Defence under contract DAHC 15-73-C-0435.
Application of a logic fault analyzer to the manufacture and maintenance of the CONTROL DATA 7600 computer
Authors: Lionel C. Bening,  Jr.
Venue: Proceedings of the 8th Design Automation Workshop (1971)

This paper describes the application of a sequential logic fault analyzer computer program to the problem of logic circuit module tests for the CONTROL DATA&reg; 7600 computer. A description of the sequential fault analyzer is provided first. Next, the software system built around this fault analyzer is outlined. The development of test sequences for 231 logic module types used in the 7600 computer is considered. Block diagrams of the test fixtures used at the manufacturing facility and to supplement field maintenance are provided and explained. Preliminary results of the application of fault analyzer developed tests are reported.
The computer animated film: A dynamic cartography
Authors: Harold Modellering
Venue: Proceedings of the ACM annual conference (1973)

In the mid 1960's it became evident that the computer animated film offered great potential for developments in the field of cartography. The following example is a realization of that perception. Traffic crash coordinate data from Washtenaw County Michigan for the years 1968-1970 has been assembled and subsequently displayed in a computer generated film animation. The symbol display algorithm is written so that as a crash increases in severity of injury, the larger the symbol and the longer it is displayed. Two crash sequences are displayed: the first in chronological order from 1968-1970 by 24 hour increments, and the second for a composite week by 15 minute increments. The result is a computer animated film about 7 minutes duration.
A utilitarian approach to CAD
Authors: T. J. Thompson
Venue: Proceedings of the 19th Design Automation Conference (1982)

The benefits of using and writing software utilities are appreciated by most software engineers. However, many Computer-Aided Design (CAD) systems do not take full advantage of this technology. This could be because good utilities do not exist, because CAD developers are not aware of existing utilities, or because developers do not know what features to include and leave out when they are writing their own utilities. As with much of computer science, the art of effectively using and writing software utilities has remained just that: an art. This paper discusses the desirable features of good software utilities for CAD and describes techniques that encourage effective use of existing utilities as well as the specification and implementation of new ones. Throughout the paper, experiences from a four year development effort in Designer's Workbench (DWB) [1] are used as examples (both good and bad).
Crisis in computer education
Authors: Donald Chand
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.)
Pecan: Program development systems that support multiple views
Authors: Steven P. Reiss
Venue: Proceedings of the 7th international conference on Software engineering (1984)

This paper describes the PECAN family of program development systems. PECAN supports multiple views of the user's program. The views can be representations of the program or of the corresponding semantics. The primary program view is a syntax-directed editor. The current semantic views include expression trees, data type diagrams, flow graphs, and the symbol table. PECAN is designed to make effective use of powerful personal machines with high-resolution graphics displays and is currently implemented on APOLLO workstations.
CDC cyber 170/172 system performance evaluation
Authors: C. M. Weng, Y. H. Yaur
Venue: Proceedings of the 17th annual symposium on Simulation (1984)

A combination of simulation modeling and measurement is employed for the performance evaluation of the computer system at TSING-HUA university, especially for the bottleneck analysis. First, a simulation model is developed for the system under study, then the model is validated by means of comparing the simulated system performance and the actual system performance. Results show satisfactory agreement. Also, the model is compared with the Round-Robin queue discipline model. Finally, five experiments are implemented using different workloads to locate the system bottleneck.
Geometric constraint satisfaction for a computer/display system
Authors: M. J. Jacobs
Venue: Proceedings of the SHARE design automation project (1965)

If, in particular, the dynamics of a system of interconnected rigid bodies is determined by a series of static solutions to a set of geometric constraints, the methods described here will allow one to determine the motion of the system in a way suited for use on computer/display hardware. In other cases, i.e., those in which a time-energy analysis is required for solution, more sophisticated algorithms are necessary.
Queueing theory
Authors: Robert B. Cooper
Venue: Proceedings of the ACM '81 conference (1981)

Queueing theory has become an important subject to computer scientists because it forms the mathematical basis for research in computer system performance evaluation. (See, for example, the Special Issue, September 1978, of Computer Surveys on &ldquo;Queueing Network Models of Computer System Performance,&rdquo; and the recent conference on &ldquo;Applied Probability - Computer Science: The Interface,&rdquo; which was held in Boca Raton, Florida, in January 1981.) This tutorial will attempt to explain the elements of queueing theory so that the audience will understand (1) the kind of assumptions usually made in the construction of queueing models, (2) the kind of mathematical tools ordinarily used in queueing theory, and (3) the strengths and limitations of queueing theory in the design and analysis of computer systems. In particular, we will cover (1a) the properties of the Poisson process and the reasons for its use to describe the arrival process, (1b) the properties of the exponential distribution and the reasons for its use to describe service times, and (1c) the degree to which the solutions of queueing models are sensitive to these assumptions; (2a) the notation of standard queueing models, such as M/M/s and M/G/l, (2b) how to write and solve the birth-and-death equations that describe many queueing models, such as queueing networks, (2c) the reason for the introduction of such analytical tools as generating functions and Laplace-Stieltjes transforms, and (2d) the use of numerical analysis and simulation; (3a) examples of the successful application of queueing theory, such as telecommunications engineering and CPU scheduling algorithms and (3b) problems that are too hard for mathematical analysis.
A large scale, homogeneous, fully distributed parallel machine, I
Authors: Herbert Sullivan, T R Bashkow
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

The preliminary hardware description of CHOPP (Columbia Homogeneous Parallel Processor), a MIMD machine supporting a fully distributed host-less operating system is presented. The architecture is intended to permit implementation of machines with 105 to 106 processors. Issues of interconnection networks, throughput, and memory structure are treated.
CADES - software engineering in practice
Authors: R. W. McGuffin, A. E. Elliston, B. R. Tranter, P. N. Westmacott
Venue: Proceedings of the 4th international conference on Software engineering (1979)

This paper describes a software engineering problem - the development of a very large operating system, VME/B, the constraints placed upon its development and the objectives of the methodology and tools devised to support it (CADES). The methodology (top-down, data driven) described and the methods and mechanisms used to support the methodology are discussed in detail. The human aspects of the use of these are described and are supported by various statistics. From our experience, various lessons are drawn and the objectives are compared with achievements. In addition, the application of the techniques developed to hardware and to other software developments is described.
Evolution of a water and power demand projection model for Saudi Arabia
Authors: Alan McK. Shorb, Anthony C. Picardi
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

This paper describes a demand projection effort that evolved over the course of a larger consulting project. The description will focus on the development of a computer simulation model which projects water and power demands for the different regions of Saudi Arabia. It will also be concerned with the development of the proper client/consultant relationship necessary to make the best use of the model's results. The demand projection effort has been influenced by the interaction of many different and changing factors. Among those factors are the nature of the area being modelled, the client organization's perception of its needs, the modelers' perceptions of the problems to be addressed, and the status of the rest of the consulting project. The demand model that evolved under the influence of these factors has several unusual attributes. It is a system dynamics model which relies heavily on data collected expressly for it. The model's output is used as the input to a supply optimizing model, which determines the least-cost way to meet the projected demands. And the model's variables are distributed spatially. The client/consultant relationship has evolved under these same influences. The scope of this relationship has expanded from an emphasis on training to one on more diverse educational activities involving the client's managerial staff.
An interactive layout system of analog printed wiring boards
Authors: K. Sahara, K. Kobori, I. Nishioka
Venue: Proceedings of the 16th Design Automation Conference (1979)

Apart from the layout of digital printed wiring boards (PWB's), no specific development has yet been reported on the layout of analog PWB's which contains not only placement and routing but also artwork to generate a variety of geometric wire patterns and assembly drawings, according to specifications. In this paper, we describe an interactive artwork system for such analog PWB's, which consists mainly two programs; one is for generating wire patterns, and the other is for generating assembly drawings. This system has been in production use and has greatly contributed to the reduction of time and cost incurred in laying out wire patterns on analog PWB's.
Formalization and automated synthesis of microprograms
Authors: R. A. Mueller
Venue: ACM SIGMICRO Newsletter (1980)

The problem of automating the production of reliable micro-code is addressed. In contrast to validation and verification approaches which attempt to establish the correctness (incorrectness) of manually produced code with respect to a set of specifications, the automated synthesis approach attempts to systematically derive the code directly from the specifications. Formal representations of both microprogrammable machines and image machine instruction set requirement specifications are discussed, as is a formal semantic characterization of microprogram execution with respect to the given representations. The microprogram synthesis process is viewed as a special kind of theorem-proving process which attempts to prove the existence of a computation satisfying a requirement specification for a given machine, and when successful, extracts a corresponding microprogram directly from the proof. The NP-completeness of the problem leads to the necessity for effective heuristics, particularly when dealing with horizontal machines.
WICOP a wire integration computer program
Authors: L. Garcia
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

This paper describes the Wire Integration Computer Program, WICOP, which provides a complete wire data processing and documentation service for engineering design areas. WICOP is a flexible, large volume, high-speed data processing and documentation program capable of producing multiple output formats. The most important service provided by WICOP is to provide documents which can be used to check the design, to aid in fabrication, and to maintain a permanent record of the wiring of the hardware. The use of WICOP eliminates many of the repetitive clerical functions normally associated with the preparation of wire lists.
An attribute description of a subset of Algol 68
Authors: M. Simonet
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

Among the formalisms used for the definition of programming languages, context-free grammars are widely and satisfactorily used, but their power is limited. Augmented with attributes they can express context sensitive aspects of a language. In this paper a subset of Algol 68 is described by an attribute-grammar. This is done in a way which suggests that the attribute point of view may also help reading and writing W-grammars.
Symbolic simulation for correct machine design
Authors: William C. Carter, William H. Joyner,  Jr., Daniel Brand
Venue: Proceedings of the 16th Design Automation Conference (1979)

Program verification techniques which manipulate symbolic rather than actual values have been used successfully to find errors in implementations of computer designs. This paper describes symbolic simulation, a method similar to symbolic execution of programs, and its use in proving the correctness of machine architectures implemented in microcode. The procedure requires formal descriptions of machines at both the architectural and register transfer levels, but has been used to detect errors in implementation which often elude the standard test case approach.
High level domain definition in a relational date base system
Authors: Dennis J. McLeod
Venue: ACM SIGMOD Record (1976)

A relational data base is herein defined as a collection of normalized relations (relations in first normal form) and a collection of domains. A normalized relation may be viewed as a table, wherein each row of the table corresponds to a tuple of the relation, and the entries in a given column belong to the set of values constituting the domain underlying that column. The domains of a data base have an abstract existence apart from the data base relations. The data base also includes various types of semantic integrity rules, which specify additional properties of the data in the data base. One such type of semantic integrity rule is the domain definition. A domain definition includes the precise description of the set of values (objects) constituting the domain. In a normalized data base, all domains are sets of atomic data values. A domain definition also includes a specification of the ordering on the values in a domain, for comparability purposes. In addition, a domain definition contains a specification of the action that is to occur if an attempt is made to violate the restriction that every entry in each column of a relation must be from the underlying domain of that column. A nonprocedural language permitting the high level expression of domain definitions is defined. Language details and examples are presented, and the syntax and informal semantics of the domain definition language are given. This approach to domain definition is analyzed in terms of its impact on other aspects of data base semantic integrity. The relationship with the data base system in general is outlined. An analysis of intradomain and interdomain comparability is included. An introduction to relevant implementation issues is also presented. Emphasis is placed on a general approach to implementation and implementation techniques, rather than on a specific system.
Project PREPARE
Authors: Swen A. Larsen
Venue: Proceedings of the third annual computer personnel research conference (1965)

The title of my presentation, &ldquo;Project PREPARE,&rdquo; may be familiar to some of you as it received considerable attention in the press&mdash;indeed, there are several people in the audience who played an active role in this effort. Let me make it very clear at the outset that when I speak of training, I am concerned today with the training of technicians or sub-professionals. I am cognizant of the fact that there is little need for such a worker in the computer center which is oriented toward science and research. The need is far greater in the computer center concerned with such things as business applications.
Simulation analysis of a steelmaking facility
Authors: John E. Bolton
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

During the planning of new production facilities, many questions arise regarding the facility's capabilities and operation. When the plans involve new manufacturing technology, answers to these questions could be both important to the decision making process and difficult to obtain. Simulation can be an effective means of providing the necessary information. This paper describes a simulation model that was developed and used to evaluate the uncertainties associated with a proposed steelmaking facility. The model provided answers to questions about the facility's output capabilities and the degree to which it would interface with existing operations. Although the model was developed to answer specific planning questions, potential applications can be identified in both facility startup activities and full-scale operations.
A methodology for machine language decompilation
Authors: Barron C. Housel, Maurice H. Halstead
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Machine language decompilation is the translation of machine (assembly) language instruction sequences into statements in a high-level algebraic language such as PL/1. This process can be viewed as the inverse of compilation. Decompilation can be used as an aid for program conversion and program documentation. A general methodology for decompilation that is independent of a particular source and target language is presented. The basic approach is to map the source machine language to a high-level representation, which is relatively machine and language independent, and then translate to the chosen target language. An experimental decompiler was implemented to translate Knuth's MIXAL assembly language into PL/1.
Programming languages considered as abstract data types
Authors: J. Craig Cleaveland
Venue: Proceedings of the ACM 1980 annual conference (1980)

This paper is an investigation of programming languages from the viewpoint of abstract data types. The elements of this abstract data type are programs or program segments and the operators are the grammatical rules of the grammar. Given this framework, the paper explores the algebraic axioms needed to define this programming language abstract data type (pladt).