ppxscal/embedding_network huggingface dataset:
SIGHT, a satellite interactive graphic terminal
Authors: W S Barlett, K J Busch, M L Flynn, R L Salmon
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

A software system for a Satellite Interactive GrapHic Terminal called SIGHT has been developed by the Computing Sciences Department of Bell Telephone Laboratories for interaction with the General Electric 635 computer. The SIGHT hardware consists of a standard off-the-shelf PDP-7 computer, DEC 340 display, and peripheral equipment manufactured by the Digital Equipment Corporation (DEC). The general-purpose software system for SIGHT, designed and programmed at Bell Laboratories, builds upon and is a logical extension of the GRAPHIC 1 technology previously created at Bell Laboratories.1 The Slave Interactive System, SIS,2 on the GE-635 allows a SIGHT console to communicate with its host computer in an environment comparable to that projected for future time-sharing systems. These facilities, SIGHT and SIS, are general purpose systems capable of supporting diverse applications demanding a high degree of man-machine interaction. As such, SIGHT/SIS with the GE-635 fills the time gap at the Laboratories between the old GRAPHIC 1/7094 and the projected GRAPHIC 2/GE-6453,4 complexes. In this regard it is appropriate to mention that the SIGHT hardware was selected primarily because it is upward compatible to GRAPHIC 2.
Classification of PCB types for cost effective solutions
Authors: Jerry T. Harvel
Venue: Proceedings of the 15th Design Automation Conference (1978)

Printed Circuit Board implementation has been described as the most expensive and time-consuming effort in the product design cycle. Experience has proven modern design automation systems are capable of significant reductions in design time. This does not say that all PCB design should be done on design automation systems. This paper addresses three classes of PCB's, and describes proven techniques for methods of classification and cost effective solutions. The oral presentation will be accompanied by visual aids (slides) of actual designs in each classification.
An approximate analysis of multiprocessor systems
Authors: Don Towsley
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

This paper presents an approximate analysis of a multiprocessor system consisting of P processors, M memory modules, and B buses. The model assumes constant memory access times, arbitrary memory access patterns, and bus contention. The solution technique aggregates all memories into a composite queue and degrades the service rates of this queue so as to include the effect of bus contention. The throughput predictions from this model are very accurate, typically within 1% of predictions made with either simulation or exact analysis.
Using complexity functions to generate normal forms for free algebra terms
Authors: Alexandru Pelin
Venue: Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium (1984)

Multisorted algebras were first introduced by Birkhoff and Lipson [1] as a generalization of the concept of universal algebra to more than one sort. An important problem for a free multisorted algebra F with a set of equations E is the word problem, i.e. the problem of determining, for any terms t and u in F if t and u fall in the same congruence class under E.
Computer graphics at a large IBM installation
Authors: Robert K. Clark
Venue: Proceedings of the 1976 annual conference (1976)

Heavily used plotter- and computer-independent graphics facilities are supported for a large IBM batch and time-sharing installation. JCL-selectable plotter drivers present a common interface to the supported graphics packages. Their selection can be made at linkedit or at execution time. Driver output can go to line printers, pen plotters, electrostatic plotters, microfilm recorders, or terminals for plotting; or driver output can go to OS datasets for later post-processing. The drivers self-initiate, their output is self-identifying, they self-terminate at either normal or abnormal job end, and they provide for automatic accounting. Extensive documentation and user support is supplied.
Simulation via implementation with applications in computer communication
Authors: Kenneth Brayer, Valerie Lafleur, Gary Simpson
Venue: Proceedings of the 15th annual symposium on Simulation (1982)

The traditional approach to performing discrete digital simulation has been one of developing a mathematical or statistical model to represent a process, programming this model on a large scale computer, and then executing the model to obtain performance results. In this study, the authors have developed a simulation of a computer communication network by simulating the users in a central computer and implementing the remainder of the network in actual network processors. This allows for authentic measurements on physical computers and reduces costs since one buys reusable computers instead of buying computer time.
Cryptography and data security overview of panel discussion
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Cryptography is the science of secret writing. It has been used since the dawn of writing itself to conceal messages from an adversary. Throughout history, the use of cryptography has been largely confined to diplomatic and military communications. But in the last 10 years the tremendous advances in communication technology have created a serious need for cryptographic protection of private sector communications. Electronic funds transfer systems and satellite voice/digital networks are particularly vulnerable to compromise, without the use of cryptography. Recognizing the need for data protection apart from national security concerns, the National Bureau of Standards issued a call for a data encryption algorithm in 1973. During the subsequent discussions and debates, the mathematicians and computer scientists involved realized that cryptography was not an established science in the unclassified literature. They began the task of creating the foundations for this young discipline. In 1977, the NBS published the Data Encryption Standard (DES). Its use is required to protect sensitive governmental information not related to national security. Several national and international standards organizations have also adopted the DES.
Position statement&mdash;tools for design automation from a university point of view
Authors: Robert W. Dutton
Venue: Proceedings of the 18th Design Automation Conference (1981)

The purpose of this summary is to outline a selected set of responses to the questions posed for the panel discussion of Government Interest and Involvement in Design Automation Development.
The complexity of parallel evaluation of linear recurrence
Authors: L. Hyafil, H. T. Kung
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

The concept of computers such as C.mmp and ILLIAC IV is to achieve computational speed-up by performing several operations simultaneously with parallel processors. This type of computer organization is referred to as a parallel computer. In this paper, we prove upper bounds on speed-ups achievable by parallel computers for a particular problem, the solution of first order linear recurrences. We consider this problem because it is important in practice and also because it is simply stated so that we might obtain some insight into the nature of parallel computation by studying it.
What can SIGUCC do for you? (Forum)
Authors: John H. Esbin
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

ACM's Special Interest Group on University Computing Centers is concerned with the guidance and interchange of ideas to improve all types of computer center services for small to large colleges and universities. It attempts to promote discussion of mutual problems, minicomputers, networks, computer-center management, user services, and other topics of interest to its members. In recent years the formal activities of the Group have been concentrated in the publication of a Newsletter and the organization of an annual conference for computer-center management and another for user-services personnel. Do these activities meet recognized needs? In what ways could they be improved? Are there other programs which SIGUCC should undertake to meet needs in other areas? The SIGUCC officers solicit guidance from the membership on how best to serve their common interests.
A GPSS autoflow programme
Authors: Robert Greer Lavery, Edward R. Kungla
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

This paper describes a programme which accepts a GPSS source deck as input data and produces as output a block diagram of the contained GPSS model on a Calcomp plotter.
An energy storage system
Authors: Billy H. Easter
Venue: Proceedings of the second conference on Applications of simulations (1968)

Part of Oklahoma State University's program of energy storage research in the School of Electrical Engineering involves the use of unconventional energy sources such as wind and sunlight.1 This energy must be used when available or stored until needed. Since the energy supply and demand are usually independent, some type of storage is needed to act as a buffer to match the two.2 The storage system currently under study uses an electrolysis cell to convert electrical energy into hydrogen and oxygen under high pressure and stores them until they are used either in a fuel cell or in an internal combustion engine or steam turbogenerator.5,6,7 Two slightly different power system configurations are prominent in our research efforts. For small systems the design is kept simple; for the larger systems the efficiency of operation becomes important enough to warrant additional switching and control devices. The two situations to be modeled using GPSS are the simple case shown in Figure 1-(A) wherein all energy passes through storage and the more complex situation shown in Figure 1-(B) wherein a direct path exists between the generator and the load in parallel with the storage system. The objective of the simulation is both to provide design information and to provide information for the economic optimization of the systems.
Design for testability
Authors: T. W. Williams
Venue: Proceedings of the 19th Design Automation Conference (1982)

This presentation will discuss the basics of design for testability. A short review of testing is given along with some reasons why one should test. The different techniques of design for testability are discussed in detail. These include techniques which can be applied to today's technologies and techniques which have been recently introduced and will soon appear in new designs. These techniques include the three main areas of Design for Testability, 1) Ad Hoc approaches; 2) Structured approaches; and, 3) Self Test/Built-in Test approaches.
Methods of modelling digital devices for logic simulation
Authors: Eskil Kjelkerud, Owe Thessén
Venue: Proceedings of the 16th Design Automation Conference (1979)

Four methods of modelling digital devices in a logic simulator are described. Of special interest is a functional method based on the information given in data sheets which has made it possible to easily model many types of digital devices.
Some aspects of software documentation
Authors: Enrique Arce Medina
Venue: Proceedings of the 3rd annual international conference on Systems documentation (1984)

The documentation of software systems is discussed in this paper. It describes the contents, organization and purpose - of the internal documentation and the - user's manual.
Data abstraction in SESPOOL
Authors: Glen E. Newton, J. Denbigh Starkey
Venue: Proceedings of the 1977 annual conference (1977)

SESPOOL is a Simple Extensible Systems PrOgramming Oriented Language whose design goals include easy compilation and an efficient runtime environment. SESPOOL's data definition facilities permit programmers to easily define new data types and operations on them which are appropriate for operating systems and language translators in a method which is syntactically compatible with the base language. Arrays of any data type, non-homogeneous record structures, and arbitrary homogeneous linked structures can be created. These mechanisms, together with generic procedures and simple macro substitution are illustrated in this paper by presenting an algorithm in terms of abstract data types and giving two different realizations of those data types.
Heuristic programmers and their gambling machines
Authors: Nicholas V. Findler, Heinz Klein, R. Channing Johnson, Alexander Kowal, Zachary Levine, John Menig
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Following our paper given at the IFIP Congress 71, another progres report is presented of our ongoing research efforts aimed at human decision making under uncertainty and risk. We have studied many aspects of human and machine learning processes, inductive and deductive inference making methods, how heuristic rules are formed and optimized by human players, and how similar results can be arrived at by machines. Although the investigations have been within the general framework of the game of Poker. our findings are considered to have a rather wide range of applicability. Also, the complex information processing system at hand incorporates both normative and descriptive theories of certain human behavior. Finally, the results of some empirical explorations are followed by an account of present and planned activities.
A structured design language for teaching programming
Authors: Donald R. Chand
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

A design language which facilitates the construction of structured program models is presented. Since these models demonstrate the process of composing programs, they are used for teaching a first course on programming more as a science than an art.
A random variate generation method useful in hybrid simulation/analytical modelling
Authors: J. G. Shanthikumar
Venue: Proceedings of the 16th conference on Winter simulation (1984)

In the hybrid simulation/analytic modelling using uniformization, it is required that the basic random variables involved in such modelling are uniformizable. This requires the samples for random variables of interest to be generated by the uniformization procedure. In this paper we demonstrate the use of uniformization in continuous random variate generation. Using uniformization we represent the continuous random variable of interest as the first passage time of a continuous time stochastic process associated with a Poisson process. An approach using this result is proposed to generate samples for continuous random variables. A dynamic uniformization algorithm and other extensions of the basic uniformization algorithm are also considered.
Social aspects and responsibilities (A Panel Session): Computers as generators of economic growth
Authors: A. W. Jacobson
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

POSITIVE ASPECTS of the social responsibilities of computer scientists shall be discussed in this presentation. As members of a free society it is incumbent on us to use all resources, both human and material, to strengthen the society in which we live. Responsibility begins at the center, namely the self, and broadens to include the immediate community and then our national society.
Medical care simulation: A study utilizing dynamic simulation modeling
Authors: S. H. Cohn, J. F. Brandejs
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Development and implementation of a dynamic computer-aided simulation model of the Family Practice Units Network affiliated with the University of Toronto is discussed. The medical network is conceptualized in an industrial dynamics framework, as a system of interacting flows of patients, medical staff, capital assets, information, and money. Given a patient demand for medical care, the model will process patient's allocation, hire staff, accumulate capital assets and generate expenditures. The model is used to develop an understanding of the dynamic behaviour exhibited by the different family practice teaching units, and will predict the dynamic consequences of variations in family and community health care policies.
Teaching data base concepts using APL
Authors: J. Klebanoff, F. Lochovsky, D. Tsichritzis
Venue: Proceedings of seventh international conference on APL (1975)

Rapid growth in the use of data base management systems has caused a shortage of personnel trained in data base concepts. Experience with a data base management system must be provided for students in this area. Methods for teaching data base concepts using APL are discussed. The Educational Data Base System (EDBS), an APL based data base management system, is described. The design of exercises and games to be used with EDBS is discussed. It is concluded that EDBS used with suitable exercises is an effective tool for teaching data base concepts.
Lower bounds for VLSI
Authors: Richard J. Lipton, Robert Sedgewick
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

Increased use of Very Large Scale Integration (VLSI) for the fabrication of digital circuits has led to increased interest in complexity results on the inherent VLSI difficulty of various problems. Lower bounds have been obtained for problems such as integer multiplication [1,2], matrix multiplication [7], sorting [8], and discrete Fourier transform [9], all within VLSI models similar to one originally developed by Thompson [8,9]. The lower bound results all pertain to a space-time trade-off measure that arises naturally within this model. In this paper, we extend the model and the class of functions for which non-trivial bounds can be proved. In Section 2, we give a more general model than has been proposed previously. In Section 3 we show how to reduce the derivation of lower bounds within the model to a problem in distributed computing In Section 4, we consider lower bounds for a number of predicates: n-input, l-output functions (as contrasted with the n-input, n-output functions which have been studied previously). In Section 5, we show that previous lower bound results (for n-input, n-output functions) also apply even when the model is extended to allow nondeterminism, randomness, and multiple arrivials. Finally, the full details of the results presented here will appear in the final version of this paper.
FORMPLOT&mdash;a forms design system
Authors: David V. Moffat
Venue: Proceedings of the 15th Design Automation Conference (1978)

The FORMPLOT system is a tool for developing accurate, complete data entry forms quickly and cheaply. This paper describes briefly the origins, goals, use, and implementation of FORMPLOT. The unexpected benefits resulting from the automation of forms design end the discussion.
An APL&mdash;based simulation package
Authors: Claude Boucher
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

The purpose of this paper is to introduce a package of 52 programs that can be used for the simulation of discrete event models. Those programs are written in the APL language which allows us to write and debug simulation models by taking advantage of a system that works in a conversational mode.
STAGE executive control
Authors: Marvin Lautzenheiser
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

When digital computers are used to implement solutions of extremely large problems, certain difficulties arise which are peculiar to the machine rather than the problem. Some of these difficulties are (1) storage of large, unpredictable amounts of generated data; (2) retrieval of generated data; (3) management of the computer hardware. This paper discusses in a general manner the approach used in designing the executive control package and control tables for the STAGE system. The complete STAGE system is a Simulation of a Total Atomic Global Exchange&mdash;a two-sided war involving, principally, flying objects using nuclear weapons.
Automatic generation of computer graphics languages
Authors: Gregory J. Suski
Venue: ACM SIGGRAPH Computer Graphics (1976)

This paper describes a system currently under development at Northwestern University which allows a user of a computer graphics system to generate specialized graphics programming languages which are particularly suited to a user's own needs and expertise. Termed a Language Generation System (LGS), it differs from the more traditional compiler-compiler and extensible language systems in the ease and speed of language specification and generation and also in the actual method of language specification employed. We will discuss here the motivation behind the development of LGS, some representative examples of user generated languages, and several principal areas of interest in the design and implementation of language generation systems. The paper concludes with a summary of the major topics presented and the current status of LGS.
Process plant reliability and capacity analysis
Authors: William R. Lesyna
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

Reliability and capacity analysis of large chemical process plants can be done via discrete-event simulation models. Because of the time and expense involved in building and using these models, we have built a general model which uses optimization techniques imbedded in a simulation framework. This model has been implemented as a programming system which has been used very successfully by engineers who are not trained in simulation or optimization methods. This paper will over the simulation and optimization aspects of the model and will describe how a process plant is modeled with this tool.