ppxscal/embedding_network huggingface dataset:
Simulation for the computer novice
Authors: Janis Church
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

Simulation is a powerful tool for production and facility planning. Unfortunately, many of the manufacturing engineers who could use simulation to their advantage have not had training in using a computer. Even the simplest languages can be quite formidable to someone without any computer experience. If the engineer turns to a programming group for support, the time required to get a working simulation model can be increased substantially. Often time constraints prohibit this approach. Another problem with this approach is the communications gap which can exist between the computer staff and the manufacturing engineer. If the programmer does not understand the manufacturing system and the engineer does not understand the computer terminology, mistakes can be made in defining the simulation model and in interpreting the simulation results. To overcome these problems, two simulation programs have been written for the manufacturing engineer who has had no training in programming. One is the Generalized Assembly Line Simulator. It was initially distributed in 1970 and is used to simulate progressive manufacturing systems. The second is the Manufacturing Simulator which was introduced in 1978. The Manufacturing Simulator is used to simulate systems with shared resources.
A design for a parser for English
Authors: Mitchell Marcus
Venue: Proceedings of the 1976 annual conference (1976)

Most current natural language understanding systems utilize parsers whose control structures are based on simulating non-deterministic machines. This paper presents a design for an implementation of a parser that attempts to operate deterministically. The discussion focuses on mechanisms that allow grammar rules to diagnose what grammatical structure should be built next at each point during the analysis process. An example grammar is presented, and a sample parse is discussed at length to illustrate these mechanisms.
Staffing user services
Authors: A. Faye Borthick
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

Staffing the User Services function of a computing center requires recruiting, training, and keeping qualified personnel while expending a fixed set of resources. These resources include not only the purely monetary ones of salaries and physical facilities but also other resources such as supervisory time. This paper addresses these activities from the viewpoint of how to plan the staffing of the User Services function given that one is prepared to delineate the objectives of the User Services group at the installation. Let us assume that User Services personnel provide most of the user contact at the installation, serving students, faculty, and staff. The contact may consist of consulting, teaching, and programming where users are dealt with directly, or it may consist of documenting, programming, and maintaining and enchancing software where users receive principally the end product, the program and its documentation. There are centainly other areas of contact, e.g., input/output assistance and remote terminal operation and which might be the responsibility of User Services due either to historical procedents or to situations in which user contact with other groups at the installation proved to be unsatisfactory and User Services was asked to help.
Simulation study of a Hospital Emergency Command System
Authors: Stephen A. Levine
Venue: Proceedings of the third conference on Applications of simulation (1969)

Hospitals vary greatly in organization, physical layout and size, staffing, and equipment. However, they share common problems when they attempt to respond effectively to the demands of clinical emergencies. This paper addresses the mathematical modeling, system analysis and design along with supportive statistical analyses utilized to define hospital response capabilities to the demands of clinical emergencies and to evaluate the potential benefit to be gained from an automated communications system known as the Hospital Emergency Command System (HECS). A computer simulation of the system operation in its actual environment has been developed for emergency situations such as cardiopulmonary arrest in any location, surgical emergencies originating in the accident ward, and civil disasters with major influxes of acutely injured persons. In addition, a parallel simulation has been developed which permits evaluation of a hospital's present emergency care response capabilities. The simulation program has been prepared in a modular manner permitting evaluation of a wide variety of hospital configurations and emergency mobilization approaches. A comparison is made of the time required to bring appropriate medical care to the patient before and after HECS is in operation.
The influence of an object-oriented language on the programming environment
Authors: Adele Goldberg
Venue: Proceedings of the 1983 computer science conference (1983)

There exists a buzzword in the user interface research community that symbolizes how the user should feel about a computer-based environment in which productive work can be carried out. The buzzword is &ldquo;friendly.&rdquo; It is a strange choice of word in that it seems to imply the existence of personal support for the user by a friend, who happens not to be made of flesh and blood, but of metal and electricity. Friends help us. Friends help us learn, help us develop positive situations, helps us understand and get out of negative situations. We like to be around them. The problem of creating a &ldquo;friendly&rdquo; programming environment centers on the kind of help the system provides, and the ease with which we can cause the effects we wish to cause. In order to support program development, help takes the form of methods for finding information, methods for accessing existing functionality, methods for describing new programs, and methods for discovering and fixing any faults in those programs. Ideas about the forms of help needed in a system define some of the functionality that ought to exist. In particular, we want to be able to help the user find out what went right, find out what went wrong, find out what can be done next, and find out something about any system component.
Computer graphics for large scale two- and three-dimensional analysis of complex geometries
Authors: Bruce Eric Brown
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

A comprehensive set of programs have been developed for analysis of complex two- and three-dimensional geometries in the Mechanical Engineering Department of the University of California's Lawrence Livermore Laboratory. State of the art finite element and hydrodynamic codes are being used for the analytical portion of the work. To assist the analytical effort, several additional codes which depend heavily on graphics have been developed. These are basically used for the pre- and post-processing of the data. Prior to running any analysis, the geometry of the body of interest must be represented in the form of small &ldquo;finite elements&rdquo;. After the analysis is run, the data must be post-processed. Both spatial and temporal data exist in the database. It is the database between the analysis codes and the post-processors which allows a wide variety of analysis codes to use the same post-processors. The temporal plotting codes produce time histories for specified quantities (i.e. temperature, pressure, velocity, stress, etc.) at various locations within the body. They may also produce cross-plots of these variables (i.e. stress vs strain at a particular position). For plotting of the spatial data two codes are used. The first is for two-dimensional geometries and the second is for three-dimensional models. For three dimensions, the Watkins' hidden surface/line processor is utilized for plots. The spatial plotters will display contour lines on vector output devices and color fringes (or gray values) on raster output devices. They both may also display deformed geometries. Further the three-dimensional code has extensive animation capabilities for movie productions. These graphics codes are used with a wide variety of analyses codes and form a very comprehensive package for the engineering analysis of two- and three-dimensional bodies.
A solution to closeness checking of non-orthogonal printed circuit board wiring
Authors: R. N. Piscatelli, P. Tingleff
Venue: Proceedings of the 13th Design Automation Conference (1976)

This paper describes a method of checking the spacing between elements (pads, etch, ground plane, etc.) on printed wiring boards. The etch paths are constrained to be straight line segments but not necessarily orthogonal ones. The process involves treating the lines representing the etch as vectors. Closeness is determined from the dot and cross products of line segment vectors.
Hardware systems in the core curriculum of a computer science ph.d. program
Authors: Douglas Clark
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

This syllabus is organized around the view of digital computer systems presented in chapter 1 of Bell and Newell the major divisions of the syllabus correspond to the major conceptual levels of design and description of digital systems, and the divisions (levels) appear in order of increasing complexity. Two things need to be said about this organization. First, while this conceptual structure of computer systems according to levels of complexity has an intrinsic formal appeal, many if not most of the references cited at any given level or sublevel of the structure do not confine themselves exclusively to material at that level. References occasionally reach up to borrow concepts from a higher level of complexity, and of course they frequently reach down to provide lower-level underpinnings for the systems they describe.
A semantic comparison of LISP and SCHEME
Authors: Steven S. Muchnick, Uwe F. Pleban
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

We review the features of some of the major dialects of LISP, show how they are reflected in denotational treatments of their semantics and draw a series of conclusions concerning semantic design of languages, program proving and optimization. We concentrate our attention on four dialects: (1) LISP 1.0 - approximating McCarthy's original design, (2) Modern LISP - approximating the major features of most current systems, (3) Funarg LISP - Modern LISP with upward and downward functional arguments, and (4) SCHEME - Steele and Sussman's lexically scoped dialect. LISP 1.0 and SCHEME are semantically tractable. In both cases it is possible to write a denotational semantics which exactly specifies the types of semantic objects being manipulated and the meaning of each valid syntactic construct. For modern LISP and Funarg LISP, on the other hand, we show that it is not possible to give a semantics which fully specifies the language and satisfies all the tenets of denotational semantics. However, we give a definition which rests on the foundational underpinnings of denotational semantics, thus guaranteeing that our semantic objects exist, and violates only the structural definition principle: that the meaning of a construct be defined in terms of the meanings of its parts. This has far-reaching significance for program proving, optimization and comprehensibility of programs.
APL and MIS: Two compatible concepts
Authors: Rolland A. Hurtubise
Venue: Proceedings of the sixth international conference on APL (1974)

This paper describes the design and development of an integrated mini-management information system at the Ecole nationale d'administration publique of the University of Qu&eacute;bec. The system, programmed in APL, is very simple to use as the file operations are conducted in conversational mode. One highlight is the minimum amount of effort required to produce this information system.
Anintroduction to Ada
Authors: Sabina H. Saib
Venue: Proceedings of the ACM '81 conference (1981)

The most important features of Ada are covered briefly in this paper. As with many aspects of programming languages, what is most important is subjective. Therefore the subjects selected for this introduction are the result ofthe author's experience in studying the language. You may end up with a separate list after your study of the language. Ada is an attempt by the Department of Defense to introduce a single high-level language to the real-time computer world. A proliferation of programming languages are used in real-time computing. Most of them are not taught in computer science departments. A high percentage of the application areas still use assembly language. For example, in the avionics area, assembly language is used more than 50% of the time and the DoD approved language for this application, JOVIAL, is not known by most programmers who develop avionic systems.
Obsolescence and self-assessment
Authors: Paul Armer
Venue: Proceedings of the tenth annual SIGCPR conference (1972)

I want to talk to you about a problem which I believe deserves the attention of each of you as individuals and of SIGCPR as a group. You might think of it as a health problem. The disease at issue is an insidious one&mdash;many who have it are completely unaware of their illness. Many who have it refuse to admit, sometimes even to themselves, that it is serious enough to warrant attention. If unchecked, it can lead to other serious health problems, both physical and psychological. The disease I'm concerned with is obsolescence. I used to say technological obsolescence but I've since discovered social obsolescence.
The DEMOS file system
Authors: Michael L. Powell
Venue: Proceedings of the sixth ACM symposium on Operating systems principles (1977)

This paper discusses the design of the file system for DEMOS, an operating system being developed for the CRAY-1 computer at Los Alamos Scientific Laboratory. The goals to be met, in particular the performance and usability considerations, are outlined. A description is given of the user interface and the general structure of the file system and the file system routines. A simple model of program behavior is used to demonstrate the effect of buffering data by the file system routines. A disk space allocation strategy is described which will take advantage of this buffering. The last section outlines how the performance mechanisms are integrated into the file system routines.
A versatile microprogram sequencer
Authors: Vernon Coleman, Krishna Rallapalli
Venue: Proceedings of the 8th annual workshop on Microprogramming (1975)

The major function performed by a microprogram sequencer is to determine the order in which the microinstructions are fetched from the control store. It is desirable to have features such that the total amount of control storage required is minimized for any given application consistent with speed and ease of use. A sequencer is proposed which is believed to satisfy a broad range of applications. The proposed device is intended for packaging in the standard 40 pin DIP and its organization lends itself for economic fabrication using high performance semiconductor LSI technologies.
Data management in Electronic Funds Transfer Systems
Authors: Hans W. Mandt
Venue: Proceedings of the first SIGMINI symposium on Small systems (1978)

Although Electronic Funds Transfer Systems (EFTS) encompass a large group of financial transaction systems including funds transfers between major banks and transfers among the Federal Reserve Banks over their private network (FEDWIRE), the scope of this paper will be limited to the major application of EFT systems which utilize mini and microcomputers: networks of automatic banking transaction terminals.
Computing cyclic list structures
Authors: F. Lockwood Morris, Jerald S. Schwarz
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

It is argued that list structures containing cycles are useful and unobjectionable Lisp entities. If this is so, it is desirable to have a means of computing them less foreign to the equational-definition style characteristic of Lisp than are the list-structure-altering primitives rplaca and rplacd. A notion is developed of a reasonable system of mutually recursive equations, guaranteed to have a unique solution in list structures. The notion is given in terms of the computations invoked by the equations, without reference to the forms of expressions appearing in them. A variety of programming examples are presented, including a curious implementation of the Knuth-Morris-Pratt string matching algorithm. Two methods of implementing the recursive definition facility are discussed.
Simscript II.5 tutorial
Authors: E. C. Russell
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

Two modelling concepts - processes and resources - have been added to the SIMSCRIPT II.5 &ldquo;world-view.&rdquo; From a conceptualization viewpoint, it is sometimes convenient to view a system as a collection of processes. A process may be thought of as a sequence of related events separated by lapses of time, either predetermined or indefinite. Indefinite delays may be caused when conditions do not permit the process to proceed. This tutorial is intended to give an overview of modelling and programming in SIMSCRIPT II.5. Selected case studies will be used to illustrate the use of SIMSCRIPT's fundamental &ldquo;building blocks,&rdquo; first in formulating a model and then putting it in machine-readable form. The emphasis is on concepts.
Computer assisted learning using videodiscs
Authors: Richard C. Brandt, Barbara H. Knapp
Venue: Proceedings of the ACM '81 conference (1981)

We discuss five issues to consider when developing computer-assisted learning materials incorporating video and we briefly describe the approach taken here using the Video-computer Courseware Implementation System. Specifically we discuss courseware effectiveness, distributed development and implementation, courseware lifetime and generic transportability, appropriate use of video and generic videodiscs, and cost considerations. Although we use videotape players for courseware validation, we use videodisc players in courses because of their greater capabilities. The primary objective of using videodiscs in education should be to create more effective courseware. Four factors contribute to effective courseware. First, it is important to carefully design the courseware so that the student will learn the material. Second, a value must be placed on the student's time. Effective courseware permits the more able student or trainee to progress rapidly but also provides the necessary help to those who need it. Third, the presentation of material generally must be modified with changes in the student or trainee population. Fourth, courseware validation and modification must be included in the development process. Validation and modification requires that videotape is used for validation of the video material before the material is moved to videodisc; student data&mdash;right, wrong, and unanticipated answers and time to answer&mdash;must be recorded automatically by the computer; and we must be able to modify the courseware using what we have learned from the evaluations.
Decomposition of multiple-valued logic functions
Authors: Jürgen Fricke
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

This paper deals with the problem of designing multiple-valued combinational functions and memory functions by complex modules. It is shown how logical functions can be described by Postian vectors or by polynomials which are based on operations of the ordinary arithmetic such as addition and multiplication. Two equations &ubarbelow; &equil; &Sbarbelow; &vbarbelow; and &ubarbelow;' &equil; &Sbarbelow; &vbarbelow;' are derived, by which all problems arising with two-level decomposition are solved. The solution to these problems is demonstrated by two examples.
Wavelet based image coding via morphological prediction of significance
Authors: S. D. Servetto, K. Ramchandran, M. T. Orchard
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

In previous work, we introduced a new image representation for the field of wavelet coefficients (dubbed MRWD), based on morphological operators. This work extends the MRWD framework, by addressing the effective design of image coding algorithms. First, we design an encoder with the goal of being optimal in the operational rate-distortion sense. Second, based on the same (morphological) techniques, we design a successively refinable version of the single rate coder. Simulation results are reported.
Vector coding techniques for high speed digital simulation
Authors: Howard E. Krohn
Venue: Proceedings of the 18th Design Automation Conference (1981)

Execution speed of event driven simulators can be enhanced by software designs that use vector coding techniques developed for scientific processing. The power of vector coding can be utilized by logic simulators running on scalar processors.
Topics in numerical mathematics (Paper Session)
Authors: Donald G.M. Anderson
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

A general paper session on recent developments in numerical analysis.
Ranking and selection in simulation
Authors: David Goldsman
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

In this article, we discuss the branch of statistics known as ranking and selection. We introduce some common ranking and selection terminology and procedures. Additional references for more complicated procedures are given. Applications to simulation are discussed.
Decision tables - an effective programming tool
Authors: Daniel F. Langenwalter
Venue: Proceedings of the first SIGMINI symposium on Small systems (1978)

The manager or owner of a small to medium size business often has strong ideas on how he wants to run his business. The &ldquo;packaged&rdquo; software to go with the mini computer that he can afford just doesn't give him the flexibility he wants. To keep the software costs down and still be able to get the desired programs, a programming method that gets the results at low cost is needed. Two companies reported reductions of 3 to 1, i.e. costs were down to one-third of the previous methods, by using decision tables to write the logic. With such substantial reductions in costs, the mini computer owner can have the tailored programs he wants with a reasonable investment. A decision table processor, MUSCL, has been developed and is implemented on mini computers. This paper shows how to write and solve decision tables as implemented. Ideally problems are solved in steps. The problem is defined clearly. Criteria or conditions are established. Then a series of actions is taken. The expression that describes the conditions and actions is a &ldquo;decision rule&rdquo;. A decision table is the structure for describing a set of decision rules. A decision table gives us a way of recording decision patterns so that we can make consistent decisions and see how to change the patterns to meet changing conditions.