ppxscal/embedding_network huggingface dataset:
Social and spatial mobility and urban dynamics
Authors: Jacob Belkin
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

While the results generated by Urban Dynamics are problematic these results are less important than the fact that Forrester posed a challenge to social scientists and urban modelers alike by including phenomena that are generally omitted in urban simulations. This paper focuses on one such phenomena, social mobility, and addresses the questions of whether social mobility is sufficiently important to be included in urban simulations and whether Forrester's modeling of this phenomena is adequate. A consideration of the role of social mobility in determining the population structure in urban areas indicates that social mobility is relevant to a wide class of dynamic simulations in which the socio-economic structure of the simulated population is important. An analysis of the migration patterns generated by the Urban Dynamics model and experimentation with a modified model indicates that Forrester's formulation of the industrial and job sector of the model is incompatible with social mobility. This result is not only relevant to those seeking to refine or apply Urban Dynamics but also suggests that in general the simulation of social mobility must be complemented by simulating a changing labor market structure.
Randomized speed-ups in parallel computation
Authors: Uzi Vishkin
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

The following problem is considered: given a linked list of length n, compute the distance of each element of the linked list from the end of the list. The problem has two standard deterministic algorithms: a linear time serial algorithm, and an O((nlog n)/p + log n) time parallel algorithm using p processors. A known conjecture states that it is impossible to design an O(log n) time deterministic parallel algorithm that uses only n/log n processors. We present three randomized parallel algorithms for the problem. One of these algorithms runs almost-surely in time of O(n/p + log nlog*n) using p processors on an exclusive-read exclusive-write parallel RAM.
An approach to program verification
Authors: Raymond T. Yeh
Venue: Proceedings of the 13th Design Automation Conference (1976)

In this paper, formal semantics of program constructs are defined by predicate transformer introduced by Dijkstra [3,4]. A predicate transformer is a mapping which transforms a set of states after the execution of a program to the set of all possible states before the execution of the same program. Thus, the concept of determinism no longer has its significance in this semantic context. Rather, the focus is on the nature of the computation, and hence the concept of iteration, and not how the program iterates, becomes a dominant concern here.
Hardware support for inter-process communication and processor sharing
Authors: W. S. Ford, V. C. Hamacher
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

The abstraction of a computer system as a set of asynchronous communicating processes is an important system concept. This paper indicates how the concept could be supported at a low hardware level. A new inter-process communication mechanism called a mailbox is introduced. Examples of its use as a programming tool are given. This is followed by a description of hardware features that use this mechanism as the basis of communication between the components of a complete system. These features include processor-sharing hardware capable of handling process selection and switching with high efficiency. It is also indicated how these features can take the place of conventional input/output structures.
Implementing a polynomial factorization and GCD package
Authors: P. M. A. Moore, A. C. Norman
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

This paper describes the construction of a rational function package where the GCD and factorization routines are well integrated and consistent with each other and both use state of the art algorithms. The work represents an exercise in producing a service rather than an experimental piece of code, where portability, reliability and clear readable code are important aims in addition to the obvious desire for speed. Measurements on the initial version of our package showed that even though it was based on the best of previously published methods its performance was uneven. The causes of the more notable bottle necks and the steps we took to avoid them are explained here and illustrate how apparently very fine details of coding can sometimes have gross effects on a system's overall behaviour.
Design automation of electronics in Sweden
Authors: Höglund I., Fransson L., Almen Å A., Magnhagen B., Kjelkerud E., Thessén O.
Venue: Proceedings of the 12th Design Automation Conference (1975)

This paper describes the status of design automation of electronics in three different companies and a university in Sweden. Design automation of MOS circuits at Asea-Hafo (Ingmar H&ouml;glund) Asea-Hafo is a company, which produces high reliability semiconductor devices as integrated circuits, discrete transistors, diodes and opto electronic components. During 1974 CMOS Large scale integrated circuits has become the main product. Asea-Hafo concentrates on custom designed circuits in volumes between 10.000 and 50.000 circuits per design and year. In order to be successful in the competition between producers of MOS circuits Asea-Hafo among other things has to offer a short time of delivery of prototypes and serial produced circuits.
Redesign of the user interface involving users of a large operational real-time system
Authors: Thomas H. Martin
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

Today many large systems exist which have had many designers, have been patched up over the years, were designed for a different type of user than current users, and were once (but no longer) state of the art. The Deep Space Network at Jet Propulsion Laboratory is such a system. In Australia, Spain, and California, operators of the system use inflexible, incompatible routines to route data to Pasadena. Worker motivation and accuracy have to remain high for the system to work. In an attempt to develop redesign guidelines, users were queried regarding their attitudes and difficulties with the system. Interface alternatives were isolated and incorporated into a prototype for assessing the impact of the alternatives on user behavior. The resulting guidelines form a user-oriented, experience-based basis for continuing system evolution.
Filing and printing services on a local-area network
Authors: P. Janson, L. Svobodova, E. Maehle
Venue: Proceedings of the eighth symposium on Data communications (1983)

This paper describes the design and implementation of filing and printing services in a distributed system based on a token-ring local-area network. The main emphasis is put on the communication aspects of the client/server scenario: roles of a client and a server in a communication protocol, and the integration of communication protocols with applications.
Finding patterns common to a set of strings (Extended Abstract)
Authors: Dana Angluin
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

We motivate, formalize, and study a computational problem in concrete inductive inference. A &ldquo;pattern&rdquo; is defined to be a concatenation of constants and variables, and the language of a pattern is defined to be the set of strings obtained by substituting constant strings for the variables. The problem we consider is, given a set of strings, find a minimal pattern language containing this set. This problem is shown to be effectively solvable in the general case and to lead to correct inference in the limit of the pattern languages. There exists a polynomial time algorithm for it in the restricted case of one-variable patterns. Inference from positive data is re-examined, and a characterization given of when it is possible for a family of recursive languages. Various collateral results about patterns and pattern languages are obtained. Section 1 is an introduction explaining the context of this work and informally describing the problem formulation. Section 2 is definitions. Section 3 is results concerning patterns and pattern languages. Section 4 concerns the abstract question of inference from positive data. Section 5 gives a polynomial time algorithm for finding minimal one-variable pattern languages compatible with a given set of strings. Section 6 contains remarks.
Coordinating concurrent access in a distributed database architecture
Authors: M. J. Stucki, J. R. Cox,  Jr., G. C. Roman, P. N. Turcu
Venue: Proceedings of the fourth workshop on Computer architecture for non-numeric processing (1978)

A distributed architecture for an interactive information system is described, and a scheme for coordinating concurrent access to its data is presented. The scheme is deadlock free and is carried out without the need for centralized control. Conflicts are detected as they occur, and competing processes are given exclusive access to the data they need.
The selection of efficient implementations for a high-level language
Authors: Elaine Kant
Venue: Proceedings of the 1977 symposium on Artificial intelligence and programming languages (1977)

This paper considers the problem of identifying an efficient set of implementations for the abstract constructs in a very high level program description. LIBRA is a system that prunes and expands a tree of partially implemented program descriptions, given a set of refinement rules for generating the tree. Several sets of rules group, order, and select refinements. The analysis of the cost of a program (or program part) at any level of refinement is maintained for cost comparisons between different refinements, for bottleneck identification, and for branch and bound search.
Steps toward better debugging tools for LISP
Authors: Henry Lieberman
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

Although contemporary Lisp systems are renown for their excellent debugging facilities, better debugging tools are still urgently needed. A basic flaw with the tools found in most implementations is that they are oriented towards inspection of specific pieces of program or data. and they offer little help in the process of localizing bugs within a large body of code. Among conventional tools, a stepper is the best aid for visualizing the operation of a procedure in such a way that a bug can be found without prior knowledge of its location. But steppers have not been popular, largely because they are often too verbose and difficult to control. In this paper, we present a new stepper for Lisp, Zstep. which integrates a stepper with a real-time full-screen text editor to display programs and data. Zstep presents evaluation of a Lisp expression by visually replacing the expression by its value, conforming to an intuitive model of evaluation as a substitution process. The control structure of Zstep allows a user to &ldquo;zoom in&rdquo; on a bug. examining the program first at a very coarse level of detail, then at increasingly finer level until the bug is located. Zstep keeps a history of evaluations, and can be run either forward or backward. Zstep borrows several techniques from the author's example-oriented programming environment. Tinker. including a novel approach to handling error conditions.
A workbench for project oriented software engineering courses
Authors: Leslie J. Waguespack,  Jr., David F. Hass
Venue: ACM SIGCSE Bulletin (1984)

We present the Computer Science Scholar's Workbench, a tool kit written in Pascal suitable for research and teaching. It has advantages over contemporary workbenches, UNIX and INTERLISP: a host to support the tool kit costs less than &dollar;3,000, the tools are free-available in source from publications, and the tools are written in Pascal which is widely used in academic environments. We discuss a) course requirements and problems unique to project oriented software engineering classes, b) the tools we've chosen for the workbench, and c) how they may be used to ameliorate or solve many of the problems. We report our experience using the workbench and evaluate it in terms of cost, performance, portability, extensibility, and effectiveness.
Wholesale EFTS: A communications strategy
Authors: Joseph P. Mazzetti
Venue: Proceedings of the sixth symposium on Data communications (1979)

Much of the promotional hype, congressional interest, and consumerist activity surrounding Electronic Funds Transfer Systems (EFTS) has involved the retail side of banking; i.e. handling consumer transactions electronically at the teller window, through automated teller machines, and at the point of sale. Wholesale EFTS, on the other hand, deals with the electronic movement of funds and funds-related messages between banks on their own behalf and on behalf of their corporate customers.
GPSS - finding the appropriate world-view
Authors: James O. Henriksen
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

Every simulation language embodies a world-view which heavily influences approaches taken in building models in the language. In most applications for which a given language is used, the world-view of the language enforces a discipline of programming which results in models which are time- and space-efficient, reflecting the usefulness of the language and the appropriateness of language choice by the programmer. For some applications, however, the programming style encouraged by the world-view of a language can lead to programs which are time- and space-inefficient, even though the programs are natural, straightforward solutions to the problem at hand. In such cases, one may be forced to consider alternative languages or to alter one's approach in application of a given language. This paper briefly summarizes the world-view of the GPSS language and gives two examples of systems which, when modelled with conventional GPSS approaches, result in inefficient programs. For each system, two GPSS models are presented: a straightforward model which is inefficient, and a clever model which is efficient. In both cases, the clever models are easily programmed in GPSS and require only marginally more skill on the part of the programmer than do the straightforward models. Once an appropriate alternative to the obvious GPSS world-view is found, the rest is easy. A working knowledge of GPSS is required to read this paper.
Direct execution of lisp on a list_directed architecture
Authors: J. P. Sansonnet, M. Castan, C. Percebois, D. Botella, J. Perez
Venue: ACM SIGARCH Computer Architecture News (1982)

We have defined a direct-execution model dedicated to non-numerical processing which is based upon an internal representation of source programs derived from LISP. This model provides good support for both sophisticated editing (syntactical parsing, tree manipulation, pretty-printing, ...) of conventional languages and artificial intelligence languages. A high level microprogramming language (LEM) was designed to write the interpreters and the editors. A hardware processor was built and a LISP interpreter, microprogrammed in LEM, has been operational since September 1980. First, the influence of LISP on the LEM language and the architecture is discussed. At the LEM level, we will see that LISP has prompted the control constructs and the access functions to the tree-structured internal form. As for the architecture, we present the hardware implementation of a special garbage collector based upon reference counters. In turn, the machine has influenced the implementation of LISP. We present here the structure of our LISP interpreter and we give evaluation measures dealing with size, development effort, speed; they prove that programming in LEM is easy, short to debug and very concise. Moreover, the speed of our LISP interpreter confirms that the architecture is very efficient for symbolic processing.
Measurements of a VLSI design
Authors: John K. Ousterhout, David M. Ungar
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper presents data about three facets of a recently-completed VLSI design containing 45000 transistors. The first set of data describes the mask-level features of the circuit, from which it is seen that almost all features have at least one small dimension. The second set of data analyzes the hierarchical cell structure used by the designers to specify the circuit. The measurements show that composite cells have a different structure from primitive cells, and that, outside of arrays, cells are rarely re-used. The third set of data concerns the usage of an interactive layout program during the circuit's design. In spite of the circuit's size, the most frequently invoked commands were all simple.
Automatic placement algorithms for high packing density V L S I
Authors: T. Kozawa, H. Terai, T. Ishii, M. Hayase, C. Miura, Y. Ogawa, K. Kishida, N. Yamada, Y. Ohno
Venue: Proceedings of the 20th Design Automation Conference (1983)

Five placement procedures which combine three basic algorithms are developed and incorporated to our system. Evaluation of results is presented. Compared with manual design the optimum procedure reduces block size by 6.5%. The normalized area for one transistor (NA) is defined as the measure of automatic layout performance. NA is the product of wiring pitch. Optimum NA is confirmed to be 14.9 for manual design and 13.9 for automatic layout using the optimum procedure. This system is applicable to both custom logic LSIs and masterslice LSIs and has been applied to layouts of many such devices.
Computers in pre-college education: Oregon moves forward
Authors: David Moursund
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

The computers in education field is making rapid progress. We can see this progress in the quality and number of data processing programs at the associates degree and data processing school levels, and in the bachelor's, master's, and doctorate programs at colleges and universities. We can also see large numbers of secondary schools beginning to acquire computing facilities. But we have a long way to go! To put our current progress in perspective we need merely ask: &ldquo;What percentage of students in the United States made direct instructional use of computers during the past week, how extensive was this usage, and how effectively did it contribute to the student's education?&rdquo;
Resource allocation in stochastic project networks
Authors: John M. Burt,  Jr.
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This paper is concerned with the allocation of a single type of resource in project networks (such as the PERT representation) composed of activities whose processing times are random variables. There is a continuum of alternative processing methods for each activity and corresponding costs (resource utilizations) associated with each method. The effects of these different processing methods for any given activity are represented by modifications in the probability functions of the time required to complete that activity. Over the duration of a project, the decision maker (i.e., project manager) must decide which method (i.e., probability function) should be used for processing each activity. This sequential decision making must be performed so as to minimize the expected completion time of the entire project in light of restrictions on overall resource availability. A simulation study was performed to analyze the comparative effectiveness of several decision rules for &ldquo;solving&rdquo; this problem. This paper presents the results of the initial stages of that study.
Data base abstraction
Authors: John M. Smith
Venue: ACM SIGPLAN Notices (1976)

Real-world systems modelled by data bases are often quite complex. It is essential that the data base be structured in a way which supports a users abstractions about the real-world system. The &ldquo;relation&rdquo; data type is introduced as a structuring primitive for relational data bases The relation data type has similar abstraction properties to the &ldquo;record&rdquo; data type of PASCAL. A data base defined via relation data types is structured as a hierarchy of n-ary relations. It is shown that the consistency of this hierarchic structure can be preserved during update operations by two simple rules. A top-down methodology for data base design with relation data types is developed. This methodology minimizes the number of details with which a designer must contend at one time. In particular, the methodology allows the separation of decisions concerning abstract structure from decisions concerning key identification. The separation simplifies both types of decision making for the data base designer.
A standard test language - GOAL (Ground Operations Aerospace Language)
Authors: Terry R. Mitchell
Venue: Proceedings of the 10th Design Automation Workshop (1973)

Over the past few years, a team of Kennedy Space Center Civil Service software engineers has specified a standard language for test and ground aerospace operations. The language is intended to be used for test procedure definition for all levels of Space Shuttle flight and ground support hardware from line replaceable units through integrated vehicle testing, and will support both manual and automatic testing modes. That is, the language can not only be used to specify test procedures in the shop, but can also control and manage major integrated test sequencing and launch day operations. The language is called GOAL, for Ground Operations Aerospace Language. This paper will relate the language development and describe GOAL as it was defined in March, 1973.
Computer simulation of psychologists' decision-making
Authors: Joseph C. Finney, David F. Smith, C. Dwight Auvenshine, Donald Skeeters, Gress LeMaistre, Roger Sward, Murray Tondow
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

A computer-based interpretation of the MMPI and the CPI which simulates decision-making by a psychologist is described. The program is operational and distinguishes between the recipient groups as well as the personalogical dimensions of the test taker. Outlines of two major routines are given.
Considerations in the design of office DBMS's
Authors: Peter Pin-Shan Chen
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

&ldquo;Office Automation&rdquo; has become a hot topic in recent years. There is considerable interest in developing database management systems (DBMS's) specifically for office applications. Before rushing into the bandwagon of developing office DBMS's the following factors should be considered:
Fast procedure calls
Authors: Butler W. Lampson
Venue: ACM SIGARCH Computer Architecture News (1982)

A mechanism for control transfers should handle a variety of applications (e.g., procedure calls and returns, coroutine transfers, exceptions, process switches) in a uniform way. It should also allow an implementation in which the common cases of procedure call and return are extremely fast, preferably as fast as unconditional jumps in the normal case. This paper describes such a mechanism and methods for its efficient implementation.