ppxscal/embedding_network huggingface dataset:
Simulation model for a complex production/distribution network
Authors: Stuart Dean, Ralph Forsaith, George Hvidsten
Venue: Proceedings of the 5th conference on Winter simulation (1971)

The Logistics and Budgeting Simulator (LBS)model is a generalized procedure used to simulate the material flow and cost behavior of a complex, process type manufacturing and distribution system. This model is used for corporate planning studies and for evaluating budget alternatives. The model, representing the W.R. Grace and Co. fertilizer system, is structured as a network consisting of nodes and streams. Nodes represent production sites inventory locations or geographical groupings of both. Streams represent material movement between nodes. Material flows within the network are determined in a logical &ldquo;top-to-bottom&rdquo; sequence from the network output to the network input streams. Costing is then performed by a reciprocal &ldquo;bottom-to-top&rdquo; procedure. The model operates in a conversational mode using a time-shared computer system. The model is &ldquo;open-ended&rdquo; to provide the user the means to quickly modify the network structure and/or input parameters, thereby enabling top management to actively participate in the use of the system.
Office information models and the representation of 'office objects'
Authors: Simon J. Gibbs
Venue: ACM SIGOA Newsletter (1982)

Office information models are used to represent the operations and information structure of Office Information Systems. This paper determines requirements for these models by examining the functionality of Office Information Systems. The paper then discusses the representation of 'office objects' and their associated operations of filing, mailing and formatting. This representation is based upon concepts from the field of semantic data modelling.
EASY: The microcomputer-based EDUNET access system
Authors: Paul S. Heller
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

The same advances in computer hardware that have revolutionized computing now promise to make a substantial improvement in the way resources can be accessed over a network. The most significant development is the availability of powerful but low-cost microcomputers. For approximately &dollar;2,500 it is now possible to make available a microcomputer that: 1) greatly simplifies access to a given network resource, especially for the untrained, non-technical person; 2) can substantially reduce the cost of communications; and 3) provides valuable local computing services on its own, without resorting to a remote network computer. The topic of this paper is a hardware/software system that functions both as a stand-alone microcomputer system and, using special access software, as an intelligent terminal useful in accessing the large computer systems that supply services through EDUNET. The current implementation of EASy is based on a 48K AppleTM II Plus system with the &ldquo;Language Systems&rdquo; card that supports UCSD PascalTM, a Disk II floppy disk subsystem, and a communications card for network access or connection of external devices.
Panel on &ldquo;computer science graduates-industry/university gap?&rdquo; (Panel Session)
Authors: Russell M. Armstrong, Robert Benson, Peter Calingaert, Aaron Finerman, Pat McGee, D. O. Thomsen,  Jr.
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

One of the interesting aspects of the first SIGCSE Technical Symposium was the discussion generated by the question of how large a gap there was between what Computer Science Departments were offering and the expectations of industry concerning computer science graduates. There definitely seemed to exist some differences. On the one hand the university seemed to be interested in turning out well-rounded students who were as familiar with basic principles and fundamental theoretical concepts in computer science as they were with programming techniques. On the other hand industry representatives seem to feel that the students did not have enough practical knowledge and had to be retrained upon entering the business world. The topic has been debated for some time. Therefore, the organizers of this Second SIGCSE Technical Symposium decided that a panel should be organized to discuss this issue. The following abstracts represent the main theses which will be elaborated on by the four representatives from industry who were invited to give 10-15 minute papers. After the presentation of these papers, Drs. Aaron Finerman and Peter Calingaert have been allotted 10-15 minutes each to comment on the ideas and topics presented in the papers. Since both Drs. Calingaert and Finerman have worked in industry, as well as in a university, their viewpoints will hopefully tie together the central themes of the panelists. This will help focus the ensuing discussion on the one or two key points which seem to be the primary cause of the gap between what industry sees as its needs and what the university perceives as well educated computer science graduates. Following these presentations, the panelists and the audience will have an opportunity to discuss the issues raised by the panelists. This format will allow anyone interested in participating in the conference to have a chance to listen to industry's point of view on this very important matter as well as to contribute his own thoughts during the discussion session. This issue has been informally discussed for some time. This panel was organized in an attempt to give formal recognition to the problems. The dialog among university/industry representatives will hopefully open communication channels that will bridge this gap.
Instruction set processor specifications for simulation, evaluation, and synthesis
Authors: Mario R. Barbacci
Venue: Proceedings of the 16th Design Automation Conference (1979)

Formal descriptions of digital computers have been used traditionally for pedagogical purposes [Barbacci75]. Recent developments however, illustrate that a formal computer description is highly useful in the simulation, evaluation, and synthesis of computers and other digital systems. In this paper we shall review the use of the ISP notation [Bell71, Barbacci76, Barbacci77] at Carnegie-Mellon University. The paper is organized into three sections that deal with the language, its use in the simulation and evaluation of computer architectures, and finally, its use in computer aided design. I this paper we emphasize the commonality between these seemingly disjoint application. The reader is invited to consult the specific references for additional information of any particular subject.
Simulation data structures using SIMULA 67
Authors: Jean G. Vaucher
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This paper describes the approach to the teaching of simulation at the University of Montreal. The language used is the present standard of SIMULA, sometimes referred to as SIMULA 67; however, the modelling approach is inspired from GPSS. This combination of an old and a new language has proved very fruitful. Little has so far been published on the new standard for SIMULA and it is hoped that the examples in this paper may serve as a painless introduction to simulation programming in this language.
Night in a berkeley laboratory
Authors: Austin Curwood Hoggatt
Venue: Proceedings of the 6th conference on Winter simulation (1973)

In this session we examine the impact of two large management games on the teaching and research function of two large teaching institutions, New York University and Yale University. We conclude with an examination of the development of an APL language processor which is to be the control facility for an already established man-machine laboratory for the study of human decision making in complex environments.
Local optimization in a compiler for stack-based Lisp machines
Authors: Larry M. Masinter, L. Peter Deutsch
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

We describe the local optimization phase of a compiler for translating the INTERLISP dialect of LISP into stack-architecture (0-address) instruction sets. We discuss the general organization of the compiler, and then describe the set of optimization techniques found most useful, based on empirical results gathered by compiling a large set of programs. The compiler and optimization phase are machine independent, in that they generate a stream of instructions for an abstract stack machine, which an assembler subsequently turns into the actual machine instructions. The compiler has been in successful use for several years, producing code for two different instruction sets.
Introduction to silicon compilation
Authors: J. P. Gray
Venue: Proceedings of the 16th Design Automation Conference (1979)

Inexorable progress in device scaling has given rise to obvious increases in circuit complexity. There is the conjecture that the level of complexity in hardware designs is akin to the level of complexity associated with large software systems. If this is the case, then it follows that the design methods and expertise of systems analysts could be brought to bear on the complexity problems associated with large designs in silicon. Already there is evidence that structured hardware design, analogous to structured programming, is emerging in design philosophies that emphasize wiring management and hierarchical design development with regular structures [1]. However, if the expertise of the personnel in the software world is to be applied to silicon implementations of systems then there must be mechanisms that allow their participation in the design process. This could most effectively be achieved by allowing them to write programs which, when compiled, yield code that produces manufacturing data for silicon parts. Thus, taking a macroscopic view, there is a need to provide design tools that take a completely textual description of a design and translate it to layout data.
Subset/G PL/I and the PL/I Standard
Authors: Paul W. Abrahams
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Subset/G PL/I (G for General Purpose) is a subset of full Standard PL/I. Both Subset/G PL/I and Standard PL/I are defined by standards issued by the American National Standards Institute. Subset/G evolved in the late 1970's as a result of a growing realization that full PL/I was a remarkably effective (if much maligned) language but at the same time a difficult language to implement and to teach. Subset/G was designed so as to preserve the most useful properties of PL/I while deleting features that were either little used, uneconomic to implement, or inappropriate to what we now know about good programming practice. Full Standard PL/I is a descendant of the F-level PL/I language originally developed by IBM in the early 1960's. One of the design objectives of the original language was that it should be applicable to scientific programming, commercial programming, and systems programming. Part of the original rationale for this objective was that PL/I was intended to replace Fortran, Cobol, and assembly language. But there was also another reason: the growing number of applications that spanned more than one category. Subset/G also has this design objective, although some other design objectives of early PL/I were dropped, notably the principle that any construct that could reasonably be given a meaning should be acceptable. That rationale remains a major reason why Subset/G is a significant and useful language despite the many other languages that have emerged since PL/I was first designed.
Synchronous Logic Simulator
Authors: Jay G. McKinney
Venue: Proceedings of the 4th Design Automation Conference (1967)

Logic simulation programs have become a standard part1 of digital design aid systems. This paper describes a Synchronous Logic Simulator which is part of the design aid system presently being used by the BOEING Aerospace Division in Seattle, Washington. This program is currently running on an SRU 1108 computer system and is used, primarily, to aid in the development and debugging of new designs and to provide error free data for component selection and wiring programs. The first part of the paper contains a general discussion of the Synchronous Logic Simulator with emphasis on the program's capabilities and the type of data provided by the logic designer. The remaining sections describe how the simulator is organized and explain the principle algorithms utilized by the program.
Topographic information retrieval in neuropharmacology by using graphic display
Authors: Yng-shiuh Sheu, Robert George, Donald J. Jenden, Carol M. Newton
Venue: Proceedings of the 1969 24th national conference (1969)

An interactive graphics system for retrieving and displaying neuropharmacological data has been designed to facilitate the user's grasp of his data base by relating it to an appropriate anatomical rather than tabular structure. A file is maintained for the presence or absence of various reactions observed when known locations in cats' brains are injected with pharmacological agents. The user may specify experimental conditions and Boolean combinations of responses when directing retrieval from the file. The display of results is superimposed upon diagrams of sagittal and coronal sections of the brain.
Simulation of expansion alternatives for the Erika engine-block finishing facility
Authors: Edward J. Williams
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

A simulation of the Erika engine-block finishing operations at Michigan Casting Center, Flat Rock, Michigan aided Ford Motor Company management in evaluating expansion alternatives. Various problems associated with simulation-language choice, data collection, and model validation are discussed. Outcomes of the simulation for various expansion alternatives are presented.
Abstract types defined as classes of variables
Authors: D. L. Parnas, John E. Shore, David Weiss
Venue: ACM SIGMOD Record (1976)

The concept of &ldquo;type&rdquo; has been used without a precise definition in discussions about programming languages for 20 years. Before the concept of user defined data types was introduced, a definition was not necessary for discussions of specific programming languages. The meaning of the term was implicit in the small list of possible types supported by the language. There was even enough similarity between different languages so that this form of definition allowed discussions of languages in general. The need for a widely accepted definition of type became clear in discussions of languages that allow users to add to the set of possible types without altering the compiler. In such languages, the concept of type is no longer implicitly defined by the set of built-in types. A consistent language must be based on a clearer definition of the notion of type than we now have.
Collection
Authors: George Havas, Tim Nicholson
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

Collection processes have been the basis of group investigations by many people, some using hand calculation, some machine calculation. We describe a collection process which is specially efficient in the context of nilpotent quotient algorithm programs. The principles underlying our collection process are applicable in general.
A pattern generator system&mdash;hardward/software
Authors: F. E. Grace
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

This report describes an automated pattern-generating system in which input is a uniquely defined pattern (usually a printed circuit board) described in one of two ways: 1. A drawing, which does not need to be to scale. 2. A description in nonpictorial terms such as a list of line end points and land coordinates, an algorithmic statement such as &ldquo;a set of twenty 5 - mil centers thirty inches long,&rdquo; or other understandable and unique description.
An interactive graphics environment for architectural energy simulation
Authors: Jon H. Pittman, Donald P. Greenberg
Venue: ACM SIGGRAPH Computer Graphics (1982)

An interactive computer graphics system has been developed for the architecture profession which provides a &ldquo;design environment&rdquo; for the evaluation of building energy consumption. The system includes an integrated set of graphic input tools which generate the geometric and attribute data necessary for the determination of thermal load in buildings. In addition, a comprehensive set of graphical output routines has been created to allow the designer to visually interpret the results of alternative design strategies.
The relational data management system: A perspective
Authors: James Steuert, Jay Goldman
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

In this paper, the functional capabilities and economic features of the Relational Data Management System (RDMS) are discussed. RDMS is a generalized on-line data management system written in PL/1 for the Multics operating system. The basic concepts of RDMS are introduced and the similarities between the conventional file concept and the relation concept are discussed. A data-base is shown to be a set of relations. By generalizing the concept of field to be a property of the data-base, and by labeling relations with the names of their columns (fields), relations of a data-base may be implicitly linked by virtue of having a common column or field name (the dataclass name). On-line commands for operations on two such relations which yield a third result relation are illustrated. Other facilities of RDMS, such as computational, report-generation, and query-report packages are discussed. In RDMS, the relation concept is implemented as a matrix of reference numbers which refer to character string datums which are stored elsewhere in distinct dataclass files. In addition to significant storage savings, this allows a single representation-independent logical interface to the storage and access of character string data. RDMS was developed from graduate work done at M.I.T. by L. A. Kraning and A. I. Fillat in 1970 and is now being used by the administrative departments at M.I.T.
Systems aspects of The Cambridge Ring
Authors: R. M. Needham
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

The Cambridge Ring is a local communication system developed in the Computer Laboratory of the University of Cambridge. It differs in various respects from some other local communication mechanisms such as Ethernet systems (Metcalfe Boggs, 1976), and the purpose of the present paper is to describe the way in which the properties of the ring affect the general systems aspects of its exploitation.
On designing and implementing a dental practice management game
Authors: Susumu Morito, Arnold Reisman, Hamilton Emmons, Juan Rivaud
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

This paper describes the structure of an interactive dental practice management game, with special emphasis on its design and computer implementation. The game covers a wide spectrum of management decisions in setting up and in running a dental practice. The decisions considered include practice location, the form of practice, staffing mix and salaries, and the purchasing or leasing of equipment. The game also covers major daily, monthly, and yearly decisions, including forecasting patient load, economic analysis, and scheduling of patients, workers, and operatories. As three levels of decisions (daily, monthly, yearly) are considered, the game has a multi-level structure. The program system is modularized based on this time level, and also from a functional point of view. The game is designed so that it can be used both as an educational tool and as a planning tool. The game incorporates a random mechanism to reflect random aspects of real-world. The program is written in interactive FORTRAN and is implemented at several dental schools.
Pictures with parentheses: Combining graphics and procedures in a VLSI layout tool
Authors: Robert N. Mayo, John K. Ousterhout
Venue: Proceedings of the 20th Design Automation Conference (1983)

Tile packing is a technique for VLSI module generation that uses both graphical and procedural information. A graphical editor is used to specify tiles of mask information, then procedures are written to arrange the tiles into modules. This technique combines the visual power of graphical systems with the programming power of procedural systems. Since all of the mask information is contained in the tiles, the same procedures may be used for different design rules or technologies, merely by supplying a different set of tiles. We describe the procedural and graphical interfaces, and discuss two module generators that have been built with them.
Placement of circuit modules using a graph space approach
Authors: Kunio Fukunaga, Shoichiro Yamada, Harold S. Stone, Tamotsu Kasai
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper deals with the problem of automated placement of electronic components in a circuit layout by using a graph-space approach. In this approach, the relationships of connections among modules in a given electronic circuit are represented by a hypergraph. Then by using a graph-space approach, the vertices (representing the modules) are mapped into the graph space such that the distance between vertices in the space reflects the weights (the number of wires) of edges between vertices of the original hypergraph. On the basis of this placement in graph-space, the modules are assigned to grids on the printed-circuit board so as to minimize the total wire length. Simulation results show this technique yields a better assignment than the one derived from a hand-optimized layout and from an accepted automated-design method.
Tutorial: Microcode compaction is smaller always better?
Authors: David Landskov
Venue: Proceedings of the ACM '81 conference (1981)

Microcode compaction is a technique whose time has come. Recent advances make likely the development of microprogramming language compilers that use compaction as an optimization step. This session explains and contrasts several important approaches to compaction. The listener need not have a prior knowledge of microprogramming.
Analysis of careers for Georgia youth in computer occupations, 1971-76
Authors: John L. Fulmer
Venue: Proceedings of the eleventh annual SIGCPS computer personnel research conference (1973)

The materials for this paper are based on the CAREERS FOR YOUTH SURVEY, GEORGIA, 1971-76, which was prepared under contract with the Georgia State Department of Education and published in October 1972.(1) The data were obtained by mailed questionnaires,(2) representing a probability sample of the state's 38,185 employers, varying in size from three workers to some multi-unit operations with 15,000 or more employees. The response to the mailed questionnaire was 1,893 firms which filed usable replies to the questionnaire, representing a 5% response ratio to the universe. In terms of the state's total employment of 1,429,997 employees in September 1970, the sample base period for the study, the response ratio was 27%, which reflected a relatively higher rate of returns from the larger firms, many of which fell in the multi-unit category. Estimated employment for each of the four jobs is as follows: Key-punch operator 4,695 Verifier operator 669 Digital computer operator 1,856 Programmer 2,554 Total 9,554 It is noted that the key-punch operator which is a clerical type job outstripped the other three jobs by a wide margin and accounted for 49% of total employment for the four jobs.