ppxscal/embedding_network huggingface dataset:
On-line simulation of urban police patrol and dispatching
Authors: Richard C. Larson
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This paper describes a computer simulation of police patrol forces that has been implemented for resource planning in several police departments. The work is based on the simulation methodology described in Urban Police Patrol Analysis (M.I.T. Press, 1972). Accompanying the presentation will be an on-line computer demonstration of the model using a data base supplied by the Boston Police Department. The developed system is general and can be adapted to suit the needs of any police department in evaluating policies in the following areas: &bull; the allocation of preventive patrol effort and the effect of changes in patrol resources and manpower scheduling on the allocations. &bull; the design of standard or overlapping sectors. &bull; the costs and benefits of an automatic car locator system. &bull; response patterns for specialized units (e.g., police ambulances).
Direct execution of C-string compiler texts
Authors: Charles W. Bridges, Abd-Elfattah Mohamed Abd-alla
Venue: Proceedings of the 12th annual workshop on Microprogramming (1979)

High level language (HLL) computer architectures refer to those computers which are designed to accept either HLL source texts directly or intermediate texts preprocessed and prepared by HLL compilers. This paper investigates the direct execution of three C-string formats: duos, triples, and quadruples. Software simulators are developed which directly execute these C-string formats on an IBM 3033 architecture. The simulators are then executed for each of the C-string formats, testing the efficiency of each directly executed language (DEL) format for various workloads, on different mainframe architectures, and for five different HLL's. The results demonstrate that triples are the most efficient DEL format in support of most HLL texts on large-scale mainframes.
Formal development of correct algorithms: An example based on earley's recogniser
Authors: C B Jones
Venue: Issue 14 (January 1972) (1972)

This paper contains the formal development of a correct algorithm from an implicit definition of the task to be performed. Each step of the development can be accompanied by a proof of its correctness. As well as ensuring the correctness of the final program, the structured development gives considerable insight into the algorithm and possible alternatives. The example used is a simplified form of the recognition algorithm due to Earley.
APL tools for combinatorics
Authors: Eduardo Kellerman, William C. Rodgers
Venue: Proceedings of the sixth international conference on APL (1974)

This paper is a tutorial devoted to describing how to use some of the tools that APL can provide in the field of combinatorics. Emphasis will be on enumerative combinatorics. The field of combinatorics has undergone tremendous change since the advent of the electronic computer. In the past it has been generally sufficient to answer questions of the sort: &ldquo;In how many ways is it possible to ... ?&rdquo;.Now, in many cases, it is possible to generate each of the ways and to study them further (either manually or through the computer). For example, many books in combinatorics describe how to compute the number of ways a dollar can be changed, now it is a simple task to write a function to enumerate all of the ways. APL is well suited as a tool to aid in the solution of problems in combinatorics. This paper is a tutorial devoted to describing how to use some of the tools that APL provides.
National Science Foundation programs in computer science
Authors: Bruce H. Barnes, Andrew R. Molnar, Lawrence H. Oliver, Robert F. Watson
Venue: ACM SIGCSE Bulletin (1976)

This panel will discuss the various programs of the National Science Foundation dealing with Computer Science Education and Research. These include programs on basic research in computer science, research in computer science education and various programs designed to increase the quality of science education, especially where computers can plan a significant role in the educational process.
OfficeTalk-D: An experimental office information system
Authors: Clarence A. Ellis, Marc Bernal
Venue: Proceedings of the SIGOA conference on Office information systems (1982)

WHAT: Herein is described an experimental Office Information System designed and built at the Xerox Palo Alto Research Center to allow multi-computer experiments in distribution and sharing of control within an office environment. WHY: Current office systems go a long way toward aiding the individual user to transact his/her personal office work. Future office information systems need to aid tightly coupled communities of users. Thus, this investigation into communal computing systems is motivated. HOW: Using the Alto/Dorado machines, and the Cedar database and programming environment, we have devised a system which allows the flexible manipulation of electronic forms on the display screen of users and helps to coordinate and control the flow of forms between user workstations. Novel facilities implemented in the system include distributed schedulers, dispatchers, office observer workstations, alerters, a data dictionary synthesizer, change agents, and on-line office modeling, simulation and design facilities.
Array operations in MU5
Authors: P. C. Capon, R. N. Ibbett
Venue: ACM SIGPLAN Notices (1975)

In this paper the operation of the machine on code compiled for typical array operations is discussed. The performance of programs written in this straight forward way is compared with the possible gain through using hardware array orders within the MU5 framework. It is necessary to first outline the MU5 order code.
Creative personnel management for User Services
Authors: Lois J. Secrist
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

How do you manage creative professionals in an academic computing environment? Believe me&mdash;creatively! Enabling User Services staff to develop skills, abilities and confidence in a rapid-fire manner in often stressful situations requires creativity. As I share with you some of what I have learned as a User Services Manager over the past decade, I will confine my comments to personnel management&mdash;but creativity applies equally well to goal-setting, budgeting of resources, and other areas User Services managers must deal with.
Real time information processing I: Techniques for multi-level programming with real time constraints
Authors: J. F. Couleur, R. R. Smith, D. L. Bahrs
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THE COMPLEXITY and response time constraints of future military data systems has prompted the development of priority interrupt equipment to supplement supervisory programs in multi-level program control. The analysis of machine time requirements for a given program set is straightforward. A detailed discussion of the analysis and a description of the interrupt control linkage will be presented.
Formal requirements for virtualizable third generation architectures
Authors: Gerald J. Popek, Robert P. Goldberg
Venue: ACM SIGOPS Operating Systems Review (1973)

Virtual machine systems have been implemented on a limited number of third generation computer systems, for example CP-67 on the IBM 360/67. The value of virtual machine techniques to ease the development of operating systems, to aid in program transferability, and to allow the concurrent running of disparate operating systems, test and diagnostic programs has been well recognized. However, from previous empirical studies, it is known that many third generation computer systems, e.g. the DEC PDP-10, cannot support a virtual machine system. In this paper, the hardware architectural requirements for virtual machine systems are discussed. First, a fairly specific definition of a virtual machine is presented which includes the aspects of efficiency, isolation, and identical behavior. A model of third generation-like computer systems is then developed. The model includes a processor with supervisor and user modes, memory that has a simple protection mechanism, and a trap facility. In this context, instruction behavior is then carefully characterized.
A computer aided land use study technique
Authors: Elliott E. Dudnik, Wayne Schachtel
Venue: Proceedings of the 11th Design Automation Workshop (1974)

This paper describes a computer-aided, decision-making technique by which the suitability of any site or area may be evaluated with respect to any type of usage or development. The method described provides the designer with the means for making judgments as to locational desirability even with limited data availability. The procedure also raises the level of decision parameter selection above the &ldquo;local&rdquo; level to include &ldquo;universal&rdquo; or &ldquo;global&rdquo; inter-relationships. The means for utilizing macro-level data and information to make micro-level decision is demonstrated. An actual case study for housing site suitability near Chicago is presented to illustrate the approach. The merits of the technique over previous approaches and the problem of designer &ldquo;judgment&rdquo; in computer-aided methods is also discussed.
A graphical approach to coset enumeration
Authors: Lucien A. Dimino
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

In 1936, J.A. Todd and H.S.M. Coxeter published a paper in which they described a technique for enumerating the cosets of a finite group given only the defining relations for the group and the generators of the subgroup written in terms of the generators of the group. This process has an interesting interpretation in terms of directed graphs. The technique seemed well adapted for use with a stored program computer and was among the first programs written for such machines in the field of finite group theory. Although the first programs enjoyed some success, their performance was not entirely satisfactory. Consequently, the algorithm has been evolving and the programs as well as the machines have become several orders of magnitude more powerful. The major evolutionary trends are described as are the primary problems involved in the design of such a program, in the hope that some enterprising reader will make some headway with these problems or perhaps provide another evolutionary advance.
SIGBIO (Panel Session) Computer systems and the quality of health care
Venue: Proceedings of the 1975 annual conference (1975)

This session will examine some of the commercially supplied computer systems designed for specific health care applications in order to determine state of the art, present capabilities, and capacity for future extensions. The applications to be discussed involve the use of the general programming language MUMPS, the PATHLAB system developed for clinical laboratories by Medlab Computer Services, the Nuclear Data MED II system for nuclear medicine, and the BD Spear system for the clinical pharmacy. Although all speakers are from general medical centers, the usefulness of such computer systems for the community hospital or clinic will be discussed. Finally, the possible extensions of such systems for data integration, cost containment, standards accountability, and archival research will consider the future environments in which health care may be delivered.
Production control system for a product line with diverse demand patterns
Authors: Aharon Gavriel Beged-Dov
Venue: Proceedings of the third conference on Applications of simulation (1969)

This paper describes a production control plan which may be used in a shop whose product line consists of numerous items which vary extensively in their demand pattern. The plan is capable of (a) Stabilizing production by allowing inventories to fluctuate with moderate demand fluctuations; (b) Minimizing inventories of finished goods while providing protection again serious stockout; (c) Detecting significant changes in demand patterns and revising production schedules accordingly; (d) Scheduling production economically. Employing several well-known concepts, in particular the control limits principle used in quality control, the plan considers simultaneously forecasted demand, forecast error, inventory position, and shop capacity to arrive at production decisions. For this purpose, control limits are applied to both demand and inventory, and production is stabilized with a simple production smoothing procedure. Simulation results, based on data taken from a medium size production shop, demonstrate the plan features and effectiveness. Overall, the paper emphasizes operational principles rather than theoretical concepts. However, the development clearly shows that the plan is amenable to generalized treatment.
A tourguide to the AEDCAP Roadmap
Authors: Ron Rohrer
Venue: Proceedings of the 9th Design Automation Workshop (1972)

AEDCAP is a general and flexible circuit simulation program which can be used in interactive or batch modes on IBM System/360-65 and above, computers. The &ldquo;AEDCAP Roadmap&rdquo; gives a good picture of AEDCAP use and capabilities.
Computer Usage Development Corporation
Authors: Carl H. Reynolds
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The common complaint among people who must plan for and manage the development of computer program systems is that the products are almost always finished over budget and late, and they hardly ever do what they were intended to do. This paper suggests that the aforementioned state of affairs is not only undesirable but unnecessary; that there are certain relatively simple precepts which-if managers could become convinced of them and adhere to them-can be used to avoid many of our present difficulties.
Applications of computer-drawn motion pictures to visualization and validation of airport simulations
Authors: Everett S. Joline
Venue: Proceedings of the 5th conference on Winter simulation (1971)

An airport simulation system has been developed for general use in evaluating and comparing design and operational alternatives of airport master plans. A key feature of this system is the capability for producing computer-drawn motion pictures of simulated airport operations. Experience to date has shown that these films are very effective for detecting flaws in the model, and of instilling user confidence in the model and the meaning of the statistical results.
A reliability model using markov chains for utility evaluation of computer systems onboard ships
Authors: Carsten Bøe, Tor Heimly, Tor-Christian Mathiesen
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Introduction of computers onboard ships to provide a high degree of automation necessitates calculation of computer system reliability to evaluate the utility of the system. The reliability aspect of the system is simulated by a model using Markov chains. Having defined the system state space and the transition rates, the model provides evaluation of the state probabilities. Evaluation of system utility is based on computer task values and the failure probabilities. Application of the analysis model to an existing system reveals information useful in assigning redundancy, eliminating bottle-necks and allocating spare parts.
Superconcentrators, generalizers and generalized connectors with limited depth
Authors: Danny Dolev, Cynthia Dwork, Nicholas Pippenger, Avi Wigderson
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

We show that the minimum possible size of an n-superconcentrator with depth 2k&ge;4 is &thgr;(n&lgr;(k, n)), where &lgr;(k, .) is the inverse of a certain function at the k-th level of the primitive recursive hierarchy. It follows that the minimum possible depth of an n-superconcentrator with linear size is &thgr;(&bgr;(n)), where &bgr; is the inverse of a function growing more rapidly than any primitive recursive function. Similar results hold for generalizers. We give a simple explicit construction for a (d1...dk)-generalizer with depth k and size (d1+...+dk)d1...dk. This is applied to give a simple explicit construction for a generalized n-connector with depth 2k&minus;3 and size (2d1+3d2+...+3dk&minus;1+2dk) d1...dk. These are the best explicit constructions currently available. We also show that, for each fixed k&ge;2, the minimum possible size of a generalized n-connector with depth k is &Ohgr;(n1+1/k) and 0((n log n)1+1/k).
Tab, a Program Design Language for the classroom
Authors: John T. Welch,  Jr.
Venue: ACM SIGCSE Bulletin (1976)

A Program Design Language, or PDL, is a structured and program-like format for prose descriptions of computer algorithms. Syntax rules of the PDL, while few in number and informal in comparison with those of a compiled language, do impose a needed structure on the description, making the flow of control within the algorithm and its division into logically separate parts apparent to the reader. This paper introduces a Program Design Language to be called Tab. The name is suggested by the primary principle of its design: that the grouping of statements into structures be governed by indentations to equally spaced tab positions.
Vitrail: A window manager for an office information system
Authors: Alain Wegmann
Venue: ACM SIGOA Newsletter (1984)

This paper describes the implementation of a window manager called 'Vitrail'. Vitrail has been designed with a highly modular and open architecture allowing activities to interface to it at various levels while favouring overall consistency in the interface that is presented by these activities to the user. The most interesting module is the outermost, which handles the user interface of the window manager and facilitates the exchange of information between the user and the various activities. In addition, it permits information exchange among the various activities themselves.
Design and implementation of a relational database on a minicomputer
Authors: Y. E. Lien
Venue: Proceedings of the 1977 annual conference (1977)

DB85, a relational database management system on a minicomputer Interdata 85, is described. It is a single user system to run on a computer with 64K bytes of memory and disk storage. The system supports a high level, relation-algebraic query language which provides facilities for users to define, create, manipulate, and interrogate the relations in the database. Emphasis in the presentation is on the query language design, physical structures of relations, and minicomputer related issues. The approach used in the implementation reflects a clear separation of the logical view and the physical representation of the database. The goal of the project is to investigate minicomputer oriented database technology and to develop a training tool for teaching database concepts.
Approximation algorithms for combinatorial problems
Authors: David S. Johnson
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

Simple, polynomial-time, heuristic algorithms for finding approximate solutions to various polynomial complete optimization problems are analyzed with respect to their worst case behavior, measured by the ratio of the worst solution value that can be chosen by the algorithm to the optimal value. For certain problems, such as a simple form of the knapsack problem and an optimization problem based on satisfiability testing, there are algorithms for which this ratio is bounded by a constant, independent of the problem size. For a number of set covering problems, simple algorithms yield worst case ratios which can grow with the log of the problem size. And for the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as 0(n&egr;), where n is the problem size and &egr;> 0 depends on the algorithm.
SIGACT (Tutorial Session)
Authors: Michael Harrison, Susan Graham, Kenneth Kennedy
Venue: Proceedings of the 1976 annual conference (1976)

This session surveys some advances in theoretical computer science and their impact on the design of programming language compilers. The emphasis is on three major areas: the analysis of program syntax, the detection of errors at compile time, and the optimization of compiled code. The tutorials presented here do not purport to summarize all the work that has been done, but they will capture its flavor and demonstrate its practical importance.
A test methodology for large logic networks
Authors: Gary H. Stange
Venue: Proceedings of the 15th Design Automation Conference (1978)

This paper analyzes a test methodology for large logic networks. In particular, it examines the effects of network sub-division on test system performance.
A simplified universal Turing machine
Authors: E. F. Moore
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

In 1936 Turing (1) defined a class of logical machines (which he called a - machines, but which are now generally called Turing machines) which he used as an aid in proving certain results in mathematical logic, and which should prove of interest in connection with the theory of control and switching systems. Given any logical operation or arithmetical computation for which complete instructions for carrying out can be supplied, it is possible to design a Turing machine which can perform this operation.
Changing user populations
Authors: Barbara B. Wolfe
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

Computing services in the form of assistance to users was first established in colleges and universities to assist professors and graduate students in writing computer programs usually in Fortran and usually to solve scientific problems. These services evolved to include non-programmers&mdash;those who were using a higher level, non-procedural language usually to solve engineering problems and social science statistical problems. As software has improved to serve a wider audience of computer users, the typical user services have expanded. Today user services addresses the needs of many people using computers to manipulate words. Services have changed to include micro or personal computers as well as mainframes. Many customers are not doing research but are merely trying to solve problems of office or personal drudgery. Administrators who are querying and preparing reports are now among our customers. Many of our customers of ten and twenty years ago are now very self-sufficient users who have incorporated computing into the curriculum and have produced computer-savvy younger faculty who are performing very sophisticated research using computers extensively themselves in the laboratory for data acquisition. These faculty are now gathering data faster than the central mainframe can process and reduce that data. Thus the character of research has changed in one generation. These changes in user populations have enormous impact for people working in computing centers providing user services. The technical level of our staff must be greater than it was ten years ago. The sophisticated researcher needs much more help than merely helping him to debug a computational Fortan program. His problems involve data acquisition in real-time, storing and sending that data, and processing it in larger and larger arrays. All users from the researcher to the novice with a simple personal computer have data communication needs and problems which are often not trivial to resolve. Administrators have problems which are often very complex and require a combination of knowledge of data base, communications, query languages, report writers, and programming not usually found in the traditional user services staffs. Graphical output is becoming a common requirement and as experience of our users increases, the simple is not sufficient. Word applications are becoming more common than numerical applications requiring a different kind of staff expertise. As the computer becomes a common tool for all students, faculty, and administrators, the skills and tasks required for user services are changing. Unless we are ready to provide the requisite services, our value to our institutions will diminish and pass away.