ppxscal/embedding_network huggingface dataset:
One man's view of the ideal APL system
Authors: Adin D. Falkoff
Venue: ACM SIGAPL APL Quote Quad (1984)

By this time it must be clear that in principle APL can be used for programming in any field. Its algorithmic power is unquestioned, and its productivity advantage over other languages is generally conceded. Nevertheless, its use has not swept the industry. There are many reasons for this, ranging from inertia and prejudice to high cost and limited availability. In this talk I want to address the question of what I think is required of APL systems to help overcome these problems and change the situation.
APL authorization processing
Authors: JOHN R. BLANCHARD
Venue: Proceedings of seventh international conference on APL (1975)

Xerox APL used at the XCC (Xerox Computer Center) in Webster, New York. There are several APL applications, some of which serve to manipulate reasonably-sized (10 megabytes) data bases. A shortcoming of UTS (Universal Timesharing System) and the follow-on monitor, CP-V (Control Program Five) is that file access is not handled very well. The salient points of file access controls available to the user under CP-V are as follows: 1. Files may be passworded, 2.'Read' I and 'write' accounts may be specified at the time the file is created. 3. Instead of specifying read and write accounts, the file's owner may say 'ALL' or 'NONE' with the expected results. There are several problems associated with the mechanisms described above, and they are described We chose authorization files to attack this problem. This method is one which allows a user to have a large list of accessors to his files. Briefly, the implementation of authorization files is discussed in the next paragraphs.
The care and feeding of LR(k) grammars
Authors: Alfred V. Aho, Jeffrey D. Ullman
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

We consider methods of modifying LR(k) parsers [1] while preserving the ability of that parsing method to detect errors at the earliest possible point on the input. Two transformations are developed, and the methods of Korenjak [2] and DeRemer [3] are expressed in terms of these transformations. The relation between these two methods is exposed. Proofs are for the most part omitted, but can be found in [4].
An advanced tactical computer concept
Authors: Kenneth J. Thurber, Peter C. Patton, Robert C. Deward, Jon C. Strauss, Thomas W. Petschauer
Venue: ACM SIGARCH Computer Architecture News (1977)

This paper discusses the design of a real-time computer. The computer's design requirements, design decisions, and architecture are summarized. The paper discusses how the design requirements influenced the computer architecture. The system's three upward compatible addressing options (real, base, virtual) are also discussed.
A practical parallel garbage collection algorithm and its implementation
Authors: Yasushi Hibino
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

One of the major problems of list processing programs is that of garbage collection. This paper presents a new practical parallel garbage collection algorithm and its improvements, and proposes a special processor for parallel garbage collection. For the parallel garbage collection system, an urgent requirement is to reduce the the garbage collector cycle time that is defined as the total execution time for the marking and reclaiming phase. The effect of improvements discussed here reduces the garbage collector cycle time to one half of that for the original algorithm. The performance of the processor tailored for parallel garbage collection is six times faster than that of an ordinary processor, while it requires a little bit larger amount of hardware than a typical channel controller. This processor satisfies the effectiveness condition for parallelism, even if the list process node consumption rate is high, e.g. when a compiled program is executed.
Automatic diagnosis of computer faults using computer systems
Authors: Barbara A. Koalkin
Venue: Proceedings of the ACM '81 conference (1981)

This quote expresses the thoughts of most of today's big corporations. A major part of keeping the customer satisfied is ensuring that their computer systems are up and running as much as possible. Yet we all know that occasionally both hardware and software faults will occur in these systems and that service calls may be necessary. How do we cope with this situation? This session discusses three very different approaches to solving the problem of minimizing system downtime: post-fault diagnosis based on capturing the knowledge of experts (DART project), a fault-tolerant system with two or more modules and paths for each function (Tandem computer), and pre-fault predictions based on dynamic error analysis and goal monitoring (Harbinger).
Transformations on straight line programs - (Preliminary Version)
Authors: A. V. Aho, J. D. Ullman
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

We consider a program schema that models straight line intermediate level code. A complete set of equivalence preserving transformations on programs is found for the case in which programs are equivalent if and only if their output functions are identical. This result is extended to the case in which programs are deemed equivalent if their output functions can be shown equivalent under a fixed set of algebraic laws. It is also shown that in the no algebra case and in cases where certain types of algebraic identities are allowed the problem of finding optimal code under a reasonable cost function can be reduced to finding a desired sequence of topological and algebraic transformations on programs.
The behavior of Ethernet-like computer communications networks
Authors: Guy T. Almes, Edward D. Lazowska
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

Considering the widespread influence of Ethernet, a surprising amount of confusion exists concerning various important aspects of its design. Our objective in writing this paper is to spare future designers of local area networks the searching and speculation in which we were forced to engage. We begin by describing the policies common to Ethernet-like systems and by using an analytic model to study their behavior. We then precisely describe the mechanisms used in Ethernet itself, exploring its detailed behavior by means of a simulation model. Results from the two models, and particularly from their comparison, provide insight into the nature of low-level protocols in local area broadcast networks.
Computers and society courses and computer literacy (panel session)
Authors: William Cotterman, Gerald Engel, Ellis Horowitz
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

This panel will report on the progress and results of an NSF funded project of ACM to prepare a bibliography of materials in the area of computer impact on society and to identify objectives for computers and society and computer literacy courses. The project committee has computerized about 3000 annotated entries in the bibliography and has provided the capability of obtaining sublists according to a hierarchy of categories. In addition, course objectives for several kinds of computers and society courses have been specified.
Design of solids with free-form surfaces
Authors: Hiroaki Chiyokura, Fumihiko Kimura
Venue: ACM SIGGRAPH Computer Graphics (1983)

We propose a unified method of generating a wide range of three dimensional objects from polyhedra to solids with free-form surfaces. Modeling systems for polyhedra and systems for free-form surfaces have been developed independently in the past because of the difference in their underlying theory and practices. However, this is not desirable for a designer. So in this paper, we have shown a method in which a wide range of shapes are generated in one system by using local modifications. Local modifications are procedures used to change the shape of solids locally. The construction and the modification of three dimensional shapes by these procedures are natural and easy for a designer in many cases. The implementation of these procedures in a computer is easy and their execution does not require much time. Our method to construct a solid with free-form surfaces consists of following three phases. 1) A solid which serves as a basis of free-form shape design is generated by local modifications. Edges of this solid are straight lines but its faces are not necessarily flat planes. 2) From this model, a curve model which adequately represents the characteristics of a free-form shape is generated. 3) Surface equations interpolating over the curve model are generated. We have made a geometric modeling system MODIF. Using this system, a complicated solid with free-form surfaces can be designed easily. MODIF can generate color shaded pictures and cutter path data for making a real object model by NC machining tool.
FORTRAN data base facility
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

To ensure that the data in a data base are put to the best use possible, it is reasonable to have widely-accepted programming languages enhanced with the capability of allowing use of the data. Because so many scientific and engineering programs are written in FORTRAN, and because so much research and development comes from these programs, a group of people interested in enhancing this language with data base capabilities met in 1974 under the auspices of the Conference on Data Systems Languages (CODASYL) and formed a committee to look into such specifications for FORTRAN. This committee has been guided by two general sets of specifications, ANSI FORTRAN and the CODASYL data base reports. Discussions yielded the specific syntax of commands that take the form of a command verb generally followed by a list of parameters enclosed in parentheses. The parameters are separated by commas, as is common in FORTRAN. A nested series of parameters without parentheses is used in some commands, in the traditional FORTRAN manner. Even though twenty new statements have thus been added to FORTRAN, this method was felt to be a better approach than simply describing a series of procedure calls.
Decision support for manufacturing
Authors: Robin J. Miner, Mary E. Grant, Richard J. Mayer
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

This paper describes the development of a prototype decision support system which supports decision making in aerospace manufacturing environments. This system, referred to as ICAM Decision Support System (IDSS) Prototype 2, integrates various types of operations research models with a heavy emphasis on simulation modeling, utilizing computer graphics. This paper will discuss decision support system concepts, a series of decision support systems which will provide decision making aids to aerospace manufacturing and a particular system, IDSS Prototype 2, in detail.
Designing an interactive facility for non-programmers
Authors: H. E. Dunsmore
Venue: Proceedings of the ACM 1980 annual conference (1980)

This paper describes research (which is in its early stages) to investigate the best way of designing an interactive problem-solving computer system for people who are not programmers. The research is empirical and involves subjects solving problems on a representative system. Features of interest (which will become experimental treatments) include the means of sign-on and sign-off, the means of communication with the non-programmer, the process of matching a user with the appropriate package, the execution of such packages, and enhancements to such packages. This paper concludes with a description of a pilot experiment using a prototype system in which subjects with written documentation and those with no documentation at all were more productive than subjects with online system documentation. No performance differences were found in the factors of information display and single vs. multiple response capabilities.
The Piecewise Data Flow architecture control flow and register management
Authors: Joseph E. Requa
Venue: ACM SIGARCH Computer Architecture News (1983)

This paper presents the hardware register management and instruction block control flow sequencing provided by the PDF block processing section of the Piecewise Data Flow machine, a proposed high performance computer architecture. Combined, these capabilities provide the maximum allowed execution overlap of instruction blocks with minimum hardware contention and high hardware utilization.
Educational preparation for support-level careers in health computing
Authors: Richard H. Austing
Venue: Proceedings of the ACM '81 conference (1981)

Computers have widespread application in health care, but training of health computer professionals at all levels is inadequate for both present and future needs. Qualified persons and appropriate programs to train them are needed. Both areas will be addressed. A taxonomy of health computing related careers will be discussed (1). Particular attention will be given to support-level careers for which a baccalaureate or master's degree program would be appropriate preparation. Types of degree programs, including a model baccalaureate curriculum in health computing (2), will be identified. Current availability of such programs and a general estimate of the amount of support personnel that will be needed in each category of the taxonomy will be given. Recommendations for utilizing available resources and model curriculum guidelines to meet these needs will be presented. The taxonomy of health computing related careers is based on the four tracks in the doctoral level curriculum published by ACM's Committee on Curriculum for Health Computing Education earlier this year. Specific careers cited for each curriculum track include the following:
Moving out: Adding a Minicomputer Link
Authors: Frances M. Blake, Robert S. Dixon
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

The Minicomputer Link Facility at the Ohio State University provides a simple and inexpensive means for linking all campus minicomputers, word processors, and terminals with recording capability to the Instruction and Research Computer Center's Amdahl 470 computer, and to each other. This article generally describes the link, including: 1) reasons for installation, 2) hardware and associated software, 3) different applications, and 4) customer education.
Simulating the impact of monetary and fiscal policy activities on the results of corporate financial decisions
Authors: Maclyn L. Clouse
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

This paper discusses a simulation model designed for use in graduate finance courses. The model illustrates that changes in the financial and economic environment of the firm will affect the results of the firm's financial decisions. The first part of the model determines the financial and economic environment of the firm, using monetary and fiscal policy variables as inputs. The second part of the model combines environment variables from the first part of the model with financial decision inputs. The environment variables and the financial decision variables interrelate to provide the output of the model the firm's earnings, the price of the firm's common stock, and the firm's incremental weighted average cost of capital. Through the use of this model, students can better understand the interrelationships between the firm's financial and economic environment and the firm's financial decisions; this understanding should lead to better, and more timely, financial decisions.
Air traffic control scheme through simulation
Authors: Jason Chiahsin Yu, Shamsul Alam Akhand
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

The objective of this study is to develop a simulation model to effectively assist in planning air traffic control operations in the terminal area. The analysis applies unique concepts to the air terminal system, employing a discrete events simulation philosophy through the proven simulation language known as GASP. In pursuing this objective, the study includes pertinent factors associated with actual air traffic operations such as multiple runway dependency, landings and take-offs, aircraft flight characteristics, interaction between approaches, traffic control standards, wave-offs, arrival and departure structures, and so forth. A systems approach has been taken in designing the model so that the components of the system and their complex interactions are represented realistically. The validation of the model indicates that the discrete event modeling philosophy can adequately simulate air terminal operations. The model is capable of providing solutions for a variety of air terminal operations. An attempt is made to indicate the applicability of the model in such system analyses as runway assignment policy, lending sequencing policy, runway capacity, sensitivity studies and economic analysis.
Microprogramming (Tutorial)
Venue: Proceedings of the 1971 26th annual conference (1971)

Microprogramming&mdash;interpreted as implementing control logic in a high speed control memory of either the read-only or read-write type&mdash;cuts across the specialties of logic design and system architecture. Microprogramming is, therefore, a promising means for designing integrated hardware/software systems. Microprogramming has also proved to be a successful pedagogical tool for teaching computer science and system architecture. In this session we will address topics fundamental to microprogramming. The session will provide 1) a tutorial overview of the basic principles of microprogramming, 2) a state-of-art survey of the current microprogrammable computers, their characteristics, problems, and limitations, and 3) a survey of sscurrent and future applications.
Verification of fairness in an implementation of monitors
Authors: Richard Alan Karp, David C. Luckham
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

An implementation in Pascal by Saxena and Bredt of the Monitor construct is studied. Techniques are given for using a program verifer to analyse the conditions under which the implementation is fair (i.e. once a process is delayed it eventually will be continued). By use of a virtual data structure, fairness is represented in terms of simple properties which can be verified automatically. Examples are given illustrating how the verification can force unstated assumptions upon which the implementation depends to be made explicit, and how it can be used to study whether the implementation makes adequate use of resources. The development of techniques for analysis of such implementations is required before the correctness of high-level language operating systems such as Brinch Hansen's SOLO can be completely established.
The impact of graphics standards an American point of view (Panel Session)
Authors: Tom Wright, Theodore Reed, David Shuey, Bruce Cohen, Bradford M. Smith
Venue: ACM SIGGRAPH Computer Graphics (1982)

This panel session will consist of reports from participants in the effort to standardize computer graphics functions in America. There are two principal goals. The first is to provide status reports for the groups represented by the panelists. The second is to explain relationships between different standardization efforts.
Computer graphics moves into the business world (Panel Session)
Authors: Susan Taylor, Allan Schmidt, Paul Birkhahn, June Hament, John Quann
Venue: ACM SIGGRAPH Computer Graphics (1980)

Computer graphics has become an everyday tool for an engineer, scientist, and technician. Only within the last year or so has the business community demonstrated a real interest in computer graphics for their requirements. While the technically trained person had no difficulty accepting that a picture was worth a thousand words, the businessman often didn't trust pictures and felt more confident with his tabular data. Many of these attitudes are changing with the introduction of both hardware and software oriented towards business requirements. This panel will discuss a number of topics relating to computer graphics and business, hardware, software, system, and user attitudes.
A pattern compiler
Authors: Richard D. Jenks
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

A pattern compiler for the SCRATCHPAD system provides an efficient implementation of sets of user-defined pattern-replacement rules for symbolic mathematical computation such as tables of integrals or summation identities. Rules are compiled together, with common search paths merged and factored out and with the resulting code optimized for efficient recognition over all patterns. Matching principally involves structural comparison of expression trees and evaluation of predicates. Pattern recognizers are &ldquo;fully compiled&rdquo; if values of match variables can be determined by solving equations at compile time. Recognition times for several pattern matchers are compared.
The evolution of an interactive chemistry laboratory program
Authors: Thomas R. Dehner, Bruce E. Norcross
Venue: Proceedings of the fourth international conference on APL (1972)

During the past several years a program has been developed at SUNY-Binghamton for the introductory Chemistry laboratory which allows the student to test his laboratory results in a particular experiment against those results expected for his sample. This test is performed during the regularly scheduled laboratory period, by the student, at a terminal located adjacent to the laboratory, and permits a rapid decision to be made by the student as to whether or not he should repeat the experiment in order to obtain worthwhile data. This operation is accomplished by way of the APL program CHEMLAB1, which performs the appropriate calculations on the student's raw date. At the time the repeat-no repeat decision is made, the student does not have, or get, the results of the detailed calculations made by the computer. Should a repeat be necessary, the student has enough time to perform a duplicate experiment on his relatively simple apparatus before the end of the lab period. Should no repeat be necessary, as is the case 60-70% of the time, the student can dismantle his apparatus and proceed with the calculations at his leisure, assured that the data is capable of providing a reasonable answer. After the student has understood the concepts of the experiment, and performed the appropriate calculations, he may enter his calculated data at the terminal, and receive a tabular output which tells his how well he did on the calculations and in the experiment. These interactions of the student and the program are shown in Figures 1 and 2. This output is turned in with the student lab report, and serves as a basis for student comments on the relative success or failure of his experimental work and calculations.
Towards a standard hardware description language
Authors: Karl J. Lieberherr
Venue: Proceedings of the 21st Design Automation Conference (1984)

General requirements for hardware description languages are defined. The hardware description language Zeus is claimed to satisfy most of these requirements. Zeus is summarized and briefly compared to other hardware description languages. The expressiveness of Zeus is demonstrated on designs for music generation, comparison and unary-to-binary conversion.