ppxscal/embedding_network huggingface dataset:
Experiences with the goddard computing system during manned spaceflight missions
Authors: James J. Donegan, Calvin Packard, Paul Pashby
Venue: Proceedings of the 1964 19th ACM national conference (1964)

The computer field today is expanding spectacularly on many fronts. One of the important application areas is the use of the computers as the heart of large information processing systems. These applications require the design and implementation of large automatic realtime computer systems. Since these systems require the expenditure of extensive programming and hardware design efforts, it is important that we study existing systems with a view toward establishing guidelines for the development of future systems of even larger scope. The system we will discuss in this paper is the Goddard Realtime Computing System which was used to support all the National Aeronautics and Space Administration manned missions to date. It is currently being augmented to support the forthcoming Gemini Non-Rendezvous flights, and has been used to provide prime computing support for the Saturn SA-5 and SA-6 flights, the first Gemini GT-1 flight, the orbital Centaur flights to mention a few. It is the purpose of this paper to briefly summarize some of the experiences, difficulties, techniques developed, and lessons learned during the design, implementation, and operation of this system.
Using APL in an Artificial Intelligence environment: A knowledge engineering system dealing with biographical data
Authors: Georges Lee, Ruddy Lelouche, Vincent Meissonnier, Gian Piero Zarri
Venue: ACM SIGAPL APL Quote Quad (1982)

The design of a Biographical Database System is used as a means of demonstrating that APL is a suitable language in which to develop large computer systems making use of Artificial Intelligence (AI) techniques.
Integrated circuit shop simulation for capacity planning and scheduling
Authors: Dennis D. Newhart, John W. O'Leary
Venue: Proceedings of the 5th conference on Winter simulation (1971)

A large flow shop with cycling has been modeled with GASP II in an effort to study the effects of scheduling rules and capacity constraints. Consisting of multiple codes requiring 150-175 operations on 55 facilities, the shop, an integrated circuit line, was previously simulated in Fortran IV for the express purpose of determining the frequency of input messages to a shop information system. However, the Fortran IV model did not possess enough flexibility or efficiency for doing further analysis. By utilizing GASP II and its list processing techniques, shorter running times and implementations of scheduling algorithms could be achieved in a compact manner. The GASP II model is also capable of handling rework loops, yield distributions for each facility, priority assignments, and multiple channels per facility. Ultimately the model will have application for production scheduling in an on-line, real-time shop information system.
Performance of interconnection rip-up and reroute strategies
Authors: William A. Dees,  Jr., Robert J. Smith,  II
Venue: Proceedings of the 18th Design Automation Conference (1981)

Rip-up and reroute strategies can be applied following use of conventional wiring algorithms to calculate paths for residual connections failed by preceding techniques. The removal of blocking wire to allow new path runs inevitably introduces new (reroute) wiring requirements. In this paper we address the performance implications of various rates of success experienced while attempting reroutes. Using statistical approaches, we develop formulas which allow calculation of expected completion rate and computational effort for several types of rip-up and reroute algorithms. It is found that a basic router having modest completion rate behavior can be used to achieve surprisingly high completion rates, with rip-up strategies.
A general purpose data processing system simulator for satellite ground stations
Authors: William E. Priore
Venue: Proceedings of the 14th annual symposium on Simulation (1981)

The Data Processing System Simulation for Satellite Ground Stations (DPSSGS) is designed to model a general class of Automatic Data Processing Equipment (ADPE) functions for a satellite ground control station. A typical ground station might contain ten computers with associated disks and memories and must process large quantities of data in real-time. The selection of the hardware, the design of the computer system architecture and software is a prodigious task and presents a high risk in terms of the performance and cost of the final system if adequate design data is not available early in the design process. The DPSSGS is a generic model of multi-tasking computers and computer networks and provides a design tool for analyzing the many alternate computer configurations proposed in the design of a ground station. Although the impetus for the development of the DPSSGS came from the designers of ground stations, application to a wider range of data processing systems is possible. The DPSSGS was applied extensively to the design of a recent ground station.
OLLS: The On-Line Logical Simulation System
Authors: H. Robert Howie, Richard M. Tavan
Venue: Proceedings of the 8th Design Automation Workshop (1971)

The &ldquo;On-Line Logical Simulation System&rdquo; (OLLS) is a complete software package which permits a logic designer to interactively design, layout and simulate large digital systems using the IBM 2250 CRT. The user communicates with OLLS through a set of interactive displays using the light-pen, keyboard and programmed-function buttons. The major subsystems include file handling, device definition, drawing manipulation, simulation and input-output. OLLS is unique in its freedom of device definition, generality and adaptability. Its major contributions to the design process are fast, precise system documentation and accurate logic simulation.
Model formulation for fleet size determination of a university motor pool
Authors: William W. Williams, Oscar S. Fowler
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

A GPSS simulation model was developed to investigate the behavior of a university's motor pool dispatch fleet. Data were collected and frequency distributions were constructed for request rates and trip duration times. Regression analysis was performed to formulate mileage generator(s) as a function of service time. Statistical tests were conducted to assess degree of congruence between actual system behavior and theoretical expectations. Analysis of simulated response variables indicates that the model's internal configuration reflects reality to a high degree. Results of fifteen years of simulated experience seem to suggest that reductions in fleet capacity could be effected without undue impairment of service levels.
The case for APL standards
Authors: Clark Leamann
Venue: Proceedings of the sixth international conference on APL (1974)

Partial standardization of APL systems could be achieved with @@@@@.impact on efficiency and without @@@@@ development of new features. Unless a major standardization effort begins @@@@@ we will be faced with approximately a @@@@@ viable but needlessly incompatible versions of APL. The potential benefits of standards warrant a high level of support from the APL community.
An algebra for data flow anomaly detection
Authors: Ira R. Forman
Venue: Proceedings of the 7th international conference on Software engineering (1984)

An algebra A is developed that is specialized for the detection of data flow anomalies by interpreting the regular expression for the paths in a program as an A expression. Two methods are subsequently presented that use A but do not require the explicit computation of the regular expression for the paths. One method is based on the prime program decomposition. The other is based upon the iterative algorithms of global data flow analysis. In addition the use of the algebra to get better warning messages than just the detection of anomalies is presented.
Engineering applications II: Image processing
Authors: C. W. Williams
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THREE YEARS ago IBM began work on a program&mdash;the Digital Automatic Map Compilation system&mdash;for the Geodesy, Intelligence, Mapping, Research and Development Agency. The goal was to develop a method for compiling maps for aerial photographs using digital-data processing techniques. After an initial approach directed at map compilation aspects of the problem, the application of image processing was expanded to include the processing of weather image data for more efficient transmission; Figure 1. The possibility of applying these techniques to such operations as fire control, photo interpretation, guidance, geology, and cartography has also been investigated.
Minimum spanning ellipsoids
Authors: Mark J. Post
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

The notion of a minimum spanning ellipsoid in any dimension is explained. Basic definitions and theorems provide the ideas for an algorithm to find the minimum spanning ellipsoid of a set of points, i.e., the ellipsoid of minimum volume containing the set. The run-time of the algorithm O (n2) independent of dimension, where n is the number of points.
Direct microprogrammed execution of the intermediate text from a high-level language compiler
Authors: Francois Robert Broca, Richard E. Merwin
Venue: Proceedings of the ACM annual conference (1973)

Microprogramming commonly executed operations can improve the computational speed of data processing systems. This paper describes how microprogramming may be used to execute directly the intermediate text generated by a high-level language compiler after syntactic and semantic analysis of the input source program. Direct microprogrammed execution of common forms of intermediate text - i.e.: quadruples, triples, and duos - has been simulated. A comparison is made, in terms of storage requirements and execution time, of this direct microprogrammed system scheme with the present methods which result in machine language representation and execution of the intermediate text. Direct generation of a microprogram from the high-level language statements is also examined. Timing assumptions for comparative purposes have been based on the IBM 360 MOD 50 system. Simulation and timing estimates for the microprograms have been carried out on a microprogram directed simulator which closely represents the architectural organization of the MOD 50.
Data base technology
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

A two-hour session to be held on the day preceeding the full day workshop on data bases. What is a data base and its use? Aspects to be discussed include corporate implications as well as requirements on technology arising from data bases.
Automated exploration of the design space for register transfer (RT) systems
Authors: Mario R. Barbacci, Daniel P. Siewiorek
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

A Design Automation System for the RT level of design is described. The System explores the design space by finding alternative implementations for a user given behavioral specification. The alternative solutions are obtained by transformations on a graph model. These transformations effect trade-offs between the cost of the hardware and the speed of the algorithm. Heuristic routines are used to reduce the design space by exploring only those alternatives whose characteristics approach a user given set of goals.
A resolution-based approach to the validation of internal control systems
Authors: Andrew D. Bailey,  Jr.
Venue: Proceedings of the 1979 annual conference (1979)

Internal control comprises the plan of organization and the methods adopted within a business to safeguard its assets, check the accuracy and reliability of its accounting data, promote operational efficiency and encourage adherance to prescribed managerial policies. When an auditor is required to render an opinion on the validity of a system of internal control, a three stage process is usually performed. First, a model of the organization's system of internal control is developed and reviewed. If the model is found to be valid, tests for compliance with the model are performed. Finally, substantive audit tests are made to produce direct evidence about account balances. This work addresses the first of these processes. A description of the internal control system is generally obtained by interviewing knowledgeable managers in the organization and producing written descriptions and/or flowcharts of the system. These descriptions are then scrutinized by the auditor to find weaknesses in the system. For large scale operations, the magnitude of detail often overwhelms the auditor. The purpose of this paper is to describe a method for validating internal control systems which is implementable on a computer.
The application of GPSS to multiphasic health evaluation clinic design
Authors: Lawrence Van Kuran, Joseph C. Mello
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

This paper discusses results of a study aimed at establishing an effective functional design and staffing pattern for multiphasic health evaluation (MHE) units - a design maximizing patient throughput, while minimizing both operational and capital cost expenditures. M.H.E. units consist of two phases - a battery of medical screening tests and a physical examination. System sizing was dependent on the number and availability of second phase nurse practicioners to complete the physical exams. A GPSS model was developed to analyze two types of Phase I MHE configurations: carrel testing and sequence testing. Patient arrivals were asssumed Poisson, and service times were modelled as deterministic (machine dependent) or exponential (staff dependent). Varying patient volumes were modelled and staffing and machine requirements were determined at each level. The study resulted in a 45 percent reduction in required square footage as well as reduced equipment needs and costs.
User services at the second level
Authors: Richard T. Close
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

The need for user services for all types of users is affirmed. Considering the small-college example of the U.S. Coast Guard Academy, long- and short-term objectives are identified and alternative plans of action are discussed. The particular problems of providing local user services to an academic community that is relying on a contract time-sharing service are examined with an aim of determing where various functions should originate. The need for at least a modest local staff is evident. The strategies now being employed at the Coast Guard Academy are viewed from present considerations and an attempt is made to extrapolate to future directions.
Eyes at the interface
Authors: Richard A. Bolt
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

There is little dispute that the main channels of intercommunication of people with the world at large are: sight, sound, and touch; and for people with other people: eye-contact, speech, gesture. Advanced human-computer interfaces increasingly implicate speech i/o, and touch or some form of manual input.
Towards ISMs for OPSs
Authors: Daniel M. Berry
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

Information structure models (ISMs) [Weg70] have been applied successfully to the study of programming languages both in their definitions [LW69, Wlk68,70,Wgb70] and in proofs of correctness and equivalence of various implementation strategies [Luc69,JH70,JL71,McG71,Bry72]. This paper examines briefly the possibility using ISMs to define operating systems (OPSs). We give a definition of the notion of ISM and indicate how to use them. Then we describe methods by which the process notion has been defined in the past in the hope that this will give some idea of the applicability of the ISM approach to the definition of OPSs.
The Yorktown Simulation Engine
Authors: Monty M. Denneau
Venue: Proceedings of the 19th Design Automation Conference (1982)

The Yorktown Simulation Engine (YSE) is a high speed special purpose parallel processor designed and built at the I.B.M. Thomas J. Watson Research Center to simulate the logical operation of large digital networks. A full YSE configuration simulates networks of up to 2,000,000 gates at a rate exceeding 3 billion gate computations per second, doing more simulation in just eight hours than an IBM 370/168 does in an entire year. This paper reviews gate-level logic simulation and describes the architecture and hardware implementation of the YSE. A companion paper by G. Pfister and E. Kronstadt discusses the YSE software.
The computer in the space planning process
Authors: Eric Teicholz
Venue: Proceedings of the 12th Design Automation Conference (1975)

The paper* discusses general approaches to using a computer for space planning problems in an architectural, urban and regional context. Programs are classified as under- and over-constrained, of the improvement- or construction-type and various techniques employed for space planning are described and illustrated. Two programs, GRASP and SETUP, are used to illustrate the space planning process. The paper concludes that there is no unique solution for space planning problems and that additional research is needed, primarily to develop a set of heuristic decision rules for internally modifying the search radius for all of the different types of space planning applications that exist.
Field performance aids for IBM GSD systems
Authors: Gary Stroebel
Venue: ACM SIGSIM Simulation Digest (1979)

A series of field performance aids have been developed to assist IBM Systems Engineers evaluate the performance of System/3, System/34, and System/38 configurations. Use of those aids is appropriate at proposal time, for preinstallation design, for tuning, and for upgrade studies. This paper overviews some of the key features of these aids as they pertain to the user interface, workload characterization, and performance models.
A p-adic algorithm for univariate partial fractions
Authors: Paul S. Wang
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

Partial fractions is an important algebraic operation with many applications in applied mathematics, physics and engineering. It is also an important operation in any computer symbolic and algebraic system. Among other things, it is used in the integration algorithm.
Meeting the needs of the social science user
Authors: Judith S. Rowe
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

The needs of the social science user for computer-related services are not unique, but for a variety of reasons they are somewhat different from the needs of, say, the mathematician, the engineer or the physical scientist; certainly they tend to differ from those of that rare bird, the humanities user. Typically and succinctly, the social science user has a large amount of data and he doesn't know how to program. His data frequently require sorting, merging, logical and/or arithmetic manipulation and he desires as an end product frequency tabulations, cross-tabulations (each with appropriate statistics), correlations or regressions. There are other more sophisticated requests but these are the basic requirements.In order to meet the computing requirements of these users, Princeton, like many other academic institutions, provides separate social science-oriented services. In our case, they are offered at the Computer Center by Social Science User Services. In order to simplify this discussion a bit I propose to do the following:First, to define and explain in greater detail the needs of the social science user, indicating as I do so the ways in which those needs are met at Princeton and. Second, to present models, including the Princeton model, of the ways in which these services may be provided, discussing as I do so the advantages and disadvantages of each..
Practical applications of path pascal in systems programming
Authors: R. H. Campbell, R. B. Kolstad
Venue: Proceedings of the 1979 annual conference (1979)

This paper presents both a description of a programming language and development system suitable for writing practical asynchronous systems and several examples of its use. Path Pascal is a high level programming language which includes objects for encapsulation, processes which execute independently, pathexpressions for synchronization, and provisions for coding interrupt processes. Path Pascal allows code for synchronization and coordination of asynchronous systems to be written entirely in a high level language and is currently implemented on several computers: the CDC Cyber family, the entire PDP-11 family, the Z80 microprocessor, and the PRIME 500. Path Pascal has been used to construct model operating systems, including software to share several I/O devices and a CPU among a stream of batch Jobs.
Discussion of Reinstedt and Gibson-Nolan papers
Authors: L. Allan Wright
Venue: Proceedings of the eleventh annual SIGCPS computer personnel research conference (1973)

The Author comments on each paper separately and then point's to a surprisingly common theme found in two such apparently diverse efforts. Bob Reinstedt's paper is delightfully written for oral presentation and contains his usual humor and apt illustrations. A reference was made to the necessity of studying the changes of job content and the shifting of roles, numbers of people required, and their needs. The Gibson and Nolan paper is especially well structured in that the reader (or listener) is told what to expect, what has been finished, what is next, and so on. Such writing clarity is important in a presentation of its length.
APL/Z80: An APL interpreter for Z80 microcomputers
Authors: John E. Howland, Philip Van Cleave
Venue: ACM SIGAPL APL Quote Quad (1979)

An APL interpreter for Z80 microcomputers is described. APL/Z80 extends APL applications to the realm of low-cost personal computers. For example, APL/Z80 can be configured to run on Z80 systems with video console, 28K byte workspace, dual floppy disks for less than $6500.00. The power of such an APL system is comparable to APL on a large time sharing computer for many applications.
Programming languages for non-numeric processing&mdash;2: An introduction to the COGENT programming system
Authors: J. C. Reynolds
Venue: Proceedings of the 1965 20th national conference (1965)

THE COGENT (COmpiler and GENeralized Translator) programming system is a compiler whose input language is designed to describe symbolic or linguistic manipulation algorithms. Although the system is intended primarily for use as a compiler compiler, it is also applicable to such problem areas as algebraic manipulation, mechanical theorem-proving, and heuristic programming. In designing the system the major objective has been to unify the concept of syntax-directed compilation1 with the more general but primitive concept of recursive list-processing2. This objective is achieved by using the syntax of a language to define a mapping between strings of the language and list structures. Given such a mapping, linguistic processes become equivalent to list processes, and a list-processing language becomes a concise vehicle for describing such processes. Thus a program written in the COGENT language is a list-processing program in which the list structures normally represent phrases of one or more object languages (i.e., the input and output languages to be processed by the program), in a representation determined by the syntax of these languages. Correspondingly, the COGENT language itself contains two major constructions: productions, which define the object language syntax, and generator definitions, which define list-processing subroutines called generators.