ppxscal/embedding_network huggingface dataset:
The ILLIAC IV FORTRAN compiler
Authors: Robert E. Millstein, Charles A. Muntz
Venue: ACM SIGPLAN Notices (1975)

This paper provides a basic description of a FORTRAN system for the ILLIAC IV. In this context &ldquo;FORTRAN system&rdquo; means exactly what one would expect &mdash; a user familiar with a different system will find no major surprises when he uses ILLIAC FORTRAN. The language is the same &mdash; a dialect of ANSI standard FORTRAN. The processors are the same &mdash; a compiler which generates relocatable binary files from FORTRAN source text, a link editor which collects and joins separately compiled program pieces into a single module, a loader which loads and relocates a single module into ILLIAC memory, a library of functions, and an I/O subsystem which supports formatted and unformatted FORTRAN I/O.
Advances in parameter estimation from event count data
Authors: Ronald Dattero
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

In modeling a system, identifying the times at which the state of the system changes is important. In particular, the probability distributions of the interevent times (time lengths between consecutive events) of each process (such as interarrival times) are required in a simulation model. Often information characterizing the interevent times may be unavailable or difficult to obtain. On the other hand, the number of event per unit time is simple and economical to collect. In the last few years, there has been much research in stochastic modeling using point processes by a varied group of researchers. Despite this extensive and diverse research effort, little attention has been given to estimation techniques based on event count data rather than event time data. This paper discusses recent advances (in the last year) in estimation based on event count data.
Abstract data types in the Model programming language
Authors: Robert T. Johnson, James B. Morris
Venue: Proceedings of the 1976 conference on Data : Abstraction, definition and structure (1976)

The concept of an abstract data type is available in the Model programming language as a proposed improvement to current ideas of programming methodology. In structured programming the principal technique is refinement of procedures. In Model, the analogue is refinement of data types. An abstract data type consists of a data structure and an associated set of operations. The characteristics and suggested uses for this mechanism are discussed. Also presented are several examples culminating in a parallel version of the Fast Fourier Transform.
Methodology for transferring programs and data
Authors: Koichi Yamaguchi, Alan G. Merten
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

The paper presents an overview of current and proposed solutions to the problems of incompatible programs and data between dissimilar computer systems. The approaches are formalized, compared, and contrasted. Standardization, program translation, data translation, and system translation are discussed. Different approaches to data translation are compared with respect to the class of translation being performed and with respect to the operation of the translation software.
ACM SIGPLAN history of programming languages conference JOSS language summary
Authors: Charles L. Baker
Venue: ACM SIGPLAN Notices (1978)

JOSS is one of the earliest interactive, multi-user languages to become operational (the first demonstration was in 1963) and as such had a strong influence on many similar systems and languages which proliferated shortly thereafter. The system (hardware and software design and implementation) was developed by J. C. Shaw, T. O. Ellis, I. D. Nehama, A. Newell, and K. W. Uncapher at the RAND Corporation. The name is an acronym derived from: JOHNNIAC&mdash;the RAND-built Princeton-type computer named in honor of the mathematician John von Neumann; OPEN SHOP&mdash;designating operation by personnel other than those attached to the computing center; and SYSTEM&mdash;implying that JOSS is more than just a computer language. At the time of initial system hardware specification, no acceptable typewriter-based terminals were commercially available, nor was the JOHNNIAC configured to accept multi-user input/output of this type. Therefore, special equipment was designed and built at RAND to meet these needs. The user terminal was based on the IBM model B typewriter, essentially equivalent to those used by RAND secretaries at that time. A special character set was specified to provide the symbols required by the JOSS language. Control and interface of up to eight remote consoles was provided by multiple-typewriter-control-system (MTCS) hardware. The development of these JOSS hardware components overlapped the development of the JOSS language.
Numerical analysis II: On computing the exact characteristic polynomial
Authors: E. R. Hansen
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

GILLIES has described two different procedures for computing the exact characteristic polynomial of a matrix with integer elements. This paper will describe how the computational effort for these methods can be greatly reduced. Only one of these procedures shall be detailed: The extension of Gillies' other method can be made in a similar way.
A microcoded multiprocessor crossbar network communications controller
Authors: Clifford L. Hall
Venue: ACM SIGMICRO Newsletter (1984)

This paper describes the architecture and microcode organization of an Interprocessor Communications Controller (ICC) for a multi-microcomputer system employing a fully parallel crossbar switch. The communications controller provides fast data transmission between seven microcomputers via nonvectored interrupts. Also, within the communications controller, programmable 16-bit down-counting timers are available to each of the microcomputers within the multi-microcomputer system.
Logic programming in APL
Authors: Robert Jernigan
Venue: ACM SIGAPL APL Quote Quad (1984)

The programming of an expert system requires a language for specifying the rules that an expert uses, a data base for storing his knowledge, and a suitable interactive system. Logic programming has been described as a way of implementing expert systems. With logic programming, rules are expressed as assertions of what is true when certain conditions are true. To be true, the assertion has to be based upon fact or upon an inference derived from facts. This paper describes an implementation of a PROLOG-like language in APL. The intent is to achieve logic programming capability while retaining the full facility of APL. PROLOG is both an extension of LISP, thereby satisfying the needs of the Artificial Intelligence community, and a language for relational databases. This implementation leans toward the relational data base approach.
Using error latch trace to obtain diagnostic information
Authors: Paul M. Almy, Jose L. Rivero
Venue: Proceedings of the 18th Design Automation Conference (1981)

An important part of the total job required for designing and building computers is the error detection and diagnostic process. This paper explains the Error Latch Trace (ELT) Program developed at the IBM Laboratory in Endicott, N.Y. It describes a process and a method for automatically obtaining diagnostic error domains from the design data base. The ELT process provides the diagnostic group a key step toward full use of Design Automation.
The cost of communication
Authors: I. Gilboa
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

The current trend in the computer industry is toward lower-priced hardware, CPU's, terminals and lower operating costs. Current operating systems require less programming staff. On the one hand we see larger computer facilities operating with fewer of the traditional &ldquo;system people&rdquo; and &ldquo;operators&rdquo;, but on the other hand we witness increases in the size of &ldquo;consulting groups&rdquo;, &ldquo;Documentation&rdquo;, or &ldquo;User Services&rdquo;. As hardware becomes more affordable and more complex, the amount and kinds of software increase. The result is that while the cost of buying and maintaining hardware has gone down, the cost of developing, acquiring and maintaining software has gone up, and keeps going up because the cost is primarily in salaries which increase steadily as the hardware depreciates. The more users, the more personnel in user services. The more languages and packages an installation supports, the less cost-efficient it becomes. In non-profit organizations, and especially in universities, the money is spent and will continue to be spent where it produces no income or savings. Because of the kind of bookkeeping and accounting done, computing figures as an institutional cost rather than as a faculty fringe benefit. If the university considers itself a research institution, then it cannot deny computer time or user services to researchers. More efficient and cost-effective user services must be developed if university computing is to remain viable.
Virtual micromachines (Whatever happened to milliprocessors)
Authors: H. Schwenk,  Jr.
Venue: Proceedings of the workshop on virtual computer systems (1973)

The main point of this note is a rather obvious one: The notion of virtual computer systems applies to many levels (macro-, micro-, nano-, pico-, etc.) of processors and associated units as well as to conventional data processing systems. Since these processors and units of whatever level all include the same basic notion of computation, we have come to use the term computational theater to represent the idea of a formally described processing system, independent of the level of processing. Self-virtualizability is not a likely property of today's microprocessors; however, the current trend toward user visible microprogramming may be expected to influence the architecture of microprocessing systems in ways that will lessen the difficulty of implementing a virtual microprocessing capability. This point is discussed below.
Properties of acyclic database schemes
Authors: Catriel Beeri, Ronald Fagin, David Maier, Alberto Mendelzon, Jeffrey Ullman, Mihalis Yannakakis
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

There is a class of database descriptions, involving one &ldquo;acyclic&rdquo; join dependency and a collection of functional dependencies, and nothing else, that appears powerful enough to describe most any real-world body of data in relational database terms. Further, this class has many desirable properties. Some properties make operations like updates and the selection of joins to implement a query over a universal relation especially easy. Other properties of interest were studied by other researchers who described the same class in radically different terms, and found desirable properties in their own contexts. It is the purpose of this paper to define the class formally, to give its important properties and the equivalences with the other classes mentioned, and to explain the importance of each property. This paper is intended to summarize the results that will appear in more detail in [FMU] and [BFMY].
The 1-2-3 routing algorithm or the single channel 2-step router on 3 interconnection layers
Authors: W. Meyns
Venue: Proceedings of the 19th Design Automation Conference (1982)

In this paper an algorithm is presented for the single channel routing on 3 interconnection layers. First some general characteristics of routing on 3 interconnection layers are presented. Then the specifications are introduced of the routing problem on 3 interconnection layers that will be considered. Pins will be allowed to come out on both the diffusion/poly layer and the second metal layer with the routing done on both the first and second metal layer. If only the first metal layer was to be used horizontally then the routing problem could be solved by a simple left-edge channel algorithm. However the 1-2-3 algorithm presented here will solve identical problems with a smaller number of tracks and via's since it makes use of some specific characteristics of routing on 3 interconnection layers.
The ISO Reference Model of Open Systems Interconnection: A first tutorial
Authors: Leslie Jill Miller
Venue: Proceedings of the ACM '81 conference (1981)

During the 1970's computing facilities which had previously provided stand-alone processing were linked into a variety of networks under quite different geographical, technical, financial and application constraints. The effect of these independent developments was that similar services were often provided by quite different mechanisms, and interconnection became extremely difficult. Late in the 1970's a strong desire for a standard means of internetwork communication arose. It was realized that a common model of distributed data communications would be required to facilitate the development of these standards. Intensive activity was initiated by several national and international standards organizations, including the International Organization for Standardization (ISO). In 1978 the &ldquo;Reference Model of Open Systems Interconnection&rdquo; [8] was produced, and this led to the 1981 Draft International Standard 7498 &ldquo;Data Processing. Open Systems Interconnection - Basic Reference Model&rdquo; [2]. The documents assume an environment of systems which make themselves &ldquo;open&rdquo; to the exchange of data with other systems by adhering to a well-defined set of standard procedures for communication. The documents scope includes not only the basic transfer of information between such systems, but also the capability of such systems to work together in support of distributed applications.
How to make abstract ideas more concrete
Authors: Peter Kugel
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

Games that students play, either against each other or against the computer, can help to make some of the abstract ideas from the theory of computing seem more concrete and more interesting than they now appear to many students. In this paper, I describe the general structure of some games based on such theoretical constructs as the Turing machine, the context-free grammar and the like. I indicate some of the ways that such games can be &ldquo;built&rdquo; either using pencil, paper and scrap materials or using computer programs. Some experiences with the use of such games, and some of their mathematical and pedagogical implications, are discussed.
Social science computing curricula (Panel Session)
Venue: Proceedings of the 1971 26th annual conference (1971)

Instruction about computers for social scientists centrally involves how to prepare social scientists to behave differently in some manner than they would without instruction. The differences of interest can be helpfully divided into those bearing on the conduct of social science inquiry and those bearing on the social science contribution toward realizing the social benefits and minimizing the social costs of computers. We wish to act so that the intellectual capacity of the social scientists we train will be better than that of their predecessors and the net social value of computers will exceed that of other new and complex technologies. Given these purposes, it seems useful to begin with the performances we want our students to engage in and work backward to the instruction those performances require. The points noted below seem to me to be important, not exhaustive.
Improving user services through system performance data bases
Authors: Geraldine MacDonald
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

In an effort to improve service to the user and to provide improved information for facilities planning, the Academic Support Group at the SUNY-Binghamton Computer Center has been involved in the development of several significant performance data bases. Three major sources of information provide the data: 1) Machine utilization and disk-storage data 2) Computer utilization by department and course 3) Use of consulting services This paper describes the organization and collection of data for the three important areas noted above; the necessary connection between the accounting system and the utilization statistics is strongly emphasized. The important variables, their analysis through the SAS statistical package, and the method of reporting are presented for evaluation.
A survey of current microprogrammed computers
Authors: C. V. Ramamoorthy
Venue: Proceedings of the 9th Design Automation Workshop (1972)

This paper summarizes the current status of microprogrammed computers. We shall attempt only a deliberately simplified overview of the subject.
Computers in schools grades K-12 (Panel Discussion)
Authors: Jean B. Rogers
Venue: Proceedings of the ACM '81 conference (1981)

During this session, the participants will present different facets of computer use in education from kindergarten through secondary school. The unifying consideration throughout this session will be the options available for computer use in education, and the priorities that are being established for these various uses.
An interactive network of time-sharing computers
Authors: Ronald M. Rutledge, Albin L. Vareha, Lee C. Varian, Allan H. Weis, Salomon F. Seroussi, James W. Mayer, Joan F. Jaffe, Mary Anne K. Angell
Venue: Proceedings of the 1969 24th national conference (1969)

This paper describes the design and implementation of an experimental interactive time-sharing network of computers created as a joint effort by Carnegie-Mellon University (CMU), Princeton University and the Research Division of IBM. The motivation behind the creation, the functional capabilities, and applications of the network are some of the key points addressed. Design philosophy and major implementation considerations are thoroughly explored. At present, all network nodes are IBM 360 Model 67's operating under TSS. Some of the plans for future expansion and inclusion of other systems and machines into the network are discussed.
SIGN - Simulation to Investigate Generalized Networks
Authors: Isadore L. Goldhirsh
Venue: Proceedings of the second conference on Applications of simulations (1968)

SIGN is a computer program package developed by AUERBACH Corporation for studying, by discrete simulation, large-scale complex generalized information and transportation networks. SIGN is driven by a network applications language called SIGNAL whose commands enable a user to automatically synthesize networks, compose networks from a data base of established components, compute optimal network routes, generate traffic distributions of mixed transport vehicle and cargo types, and pass traffic through the network in time-step sequence under programmed (SIGNAL) monitorship and control. SIGN will perform queueing, timing, loading, and other analyses associated with network performance, including transport vehicle scheduling, traffic pool placement, node placement, link utilization, and network cost effectiveness.
An algebraic model of information structure and information processing
Authors: Isamu Kobayashi
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

This paper intends to clarify logical and physical information structures and essential operations in the data processing on them. Basic terminologies are due to Information Algebra originally proposed by CODASYL Language Structure Group in 1961, however, several new concepts have been introduced to ease the discussion from the software implementation point of view. The paper is included in internal research memorandom titled &ldquo;Data Base Management Systems - a Theory and a Practice,&rdquo; RM-008 of Nippon Univac Sogo Kenkyusho, Inc., in which the proposal for constructing generalized data base management system and description of an experimental system FORIMS are also given.
Multinational capital budgeting: A simulation model
Authors: André Fourcans, Thomas J. Hindelang
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The rapid growth of multinational corporations has hastened the need for the development of robust models to handle the increased risk and complexity. Particularly in capital budgeting, careful analysis and adequate reflection of the critical variables are essential. The great number of relevant variables, their significant interrelationships, and the high degree of uncertainty render mathematical models highly complex or infeasible to solve. To overcome these shortcomings, a &ldquo;Hertz-type&rdquo; simulation model is formulated for the multinational firm. The important international variables&mdash;foreign exchange rates, foreign tax methodology, host government controls, and other social, economic, and political factors&mdash;are reflected in the model. A two stage approach is utilized: first, investment projects are analyzed by the subsidiary and if they pass this first screening they are proposed for the parent's consideration; second, the parent evaluates the attractiveness of projects from its point of view and ranks proposals for acceptance considering all global opportunities. The model is designed so that sensitivity analysis can be easily performed.
Casting curved shadows on curved surfaces
Authors: Lance Williams
Venue: ACM SIGGRAPH Computer Graphics (1978)

Shadowing has historically been used to increase the intelligibility of scenes in electron microscopy and aerial survey. Various methods have been published for the determination of shadows in computer synthesized scenes. The display of shadows may make the shape and relative position of objects in such scenes more comprehensible; it is a technique lending vividness and realism to computer animation. To date, algorithms for the determination of shadows have been restricted to scenes constructed of planar polygons. A simple algorithm is described which utilizes Z-buffer visible surface computation to display shadows cast by objects modelled of smooth surface patches. The method can be applied to all environments, in fact, for which visible surfaces can be computed. The cost of determining the shadows associated with each light source is roughly twice the cost of rendering the scene without shadows, plus a fixed transformation overhead which depends on the image resolution. No extra entities are added to the scene description in the shadowing process. This comprehensive algorithm, which permits curved shadows to be cast on curved surfaces, is contrasted with a less costly method for casting the shadows of the environment on a single ground plane. In order to attain good results, the discrete nature of the visible-surface computations must be treated with care. The effects of dither, interpolation, and geometric quantization at different stages of the shadowing algorithm are examined. The special problems posed by self-shadowing surfaces are described.
Computer generation of series and rational function solutions to partial differential initial value problems
Authors: F. C. Gey, M. B. Lesser
Venue: Proceedings of the 1969 24th national conference (1969)

Series and rational function approximations provide a viable alternative to finite-difference methods in the solution of partial differential initial-value problems. Large-scale symbolic algebra manipulation systems can be used to generate such approximations for a very general class of problems. The use of operator derivatives keeps the method from being limited to ordinary power series. The procedure is applied to the nonlinear Burgers' equation ut + u &times; ux &equil; uxx, with periodic initial condition u(x, 0) &equil; sin(x), and the results are compared to an asymptotic expansion and a finite difference solution.