ppxscal/embedding_network huggingface dataset:
Simulation in the design of automated air traffic control functions
Authors: Paul D. Flanagan, Judith B. Currier, Kenneth E. Willis
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This paper describes the design and use of a simulator of some of the newly automated safety separation functions for terminal air traffic control (ATC). The program was used not only for analysis and design of these functions but also as a testbed for the logic actually implemented in the Knoxville, Tennessee terminal. Imbedded in the program is an emulator of the Goodyear Aerospace Corporation STARAN IV Associative Processor used at Knoxville. The three major ATC functions simulated are: 1) advanced mid-air conflict prediction and evaluation, 2) conflict resolution maneuver generation, and 3) automated voice advisory message generation and scheduling.
On the completeness of a generalized matching problem
Authors: David G. Kirkpatrick, Pavol Hell
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

A perfect matching in a graph H may be viewed as a collection of subgraphs of H, each of which is isomorphic to K2, whose vertex sets partition the vertex set of H. This is naturally generalized by replacing K2 by an arbitrary graph G. We show that if G contains a component with at least three vertices then this generalized matching problem is NP-complete. These generalized matchings have numerous applications including the minimization of second-order conflicts in examination scheduling.
DORA:: CAD interface to automatic diagnostics
Authors: R. W. Allen, M. M. Ervin-Willis, R. E. Tulloss
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper will discuss a family of CAD tools supporting automatic diagnosis and the usage of those tools in Western Electric Company (WECo) testing. The CAD tools described in this paper are part of a package developed at the Engineering Research Center (ERC), Princeton, New Jersey. The Diagnostic Organization and Retrieval Algorithms (DORA) System is a complex of programs which provide audited test programs and diagnostic data files from the results of LAMP (Logic Analyzer for Maintenance Planning)1 circuit simulation. DORA supports manufacturing and repair test facilities in all Divisions of Western Electric that produce circuit packs or digital custom devices. Improved engineering productivity in Bell Laboratories and Western Electric, efficient use of capital intensive test hardware, and reduced diagnostic costs are the goals of this package.
File organization for aerial photography
Authors: Thomas A. Slivinski, Vincent Y. Lum
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

This paper presents an analysis of an information storage and retrieval problem encountered in the organization of a file containing a large number of aerial photographs. In analyzing the system, the problem is first abstracted and formulated into a mathematical model so that analytical techniques can be applied. Briefly stated, the problem can be formulated as follows: a large rectangular area A containing k paths (or aerial missions) is given. Each path is composed of an arbitrary number of straight-line segments or rectangles depending on the width of a photo-strip. At a particular time, a polygonal region Q@@A is specified. Information about all parts of line segments or rectangles which lie totally within Q (as well as path information) is to be retrieved. The problem to which this paper is directed deals with the effects on retrieval of constructing a grid system for A. Assuming Q to be much smaller than A, into what sizes should A be divided so that this storage and retrieval process is most efficient. It will be assumed that the grid squares Bi of A are also rectangular.
Generated error in the solution of certain linear difference equations
Authors: Alston S. Householder
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

Consider a system of linear difference equations approximating to a differential equation, and let the elements of the vector x represent the values of the dependent variable at the grid points. The system can be written as a system of ordinary algebraic linear equations (1) (equation), where the form of the matrix A depends upon the order in which the grid points are numbered and upon the formulas of approximation to the integral or the derivative; the vector b depends upon the initial or the boundary values and upon the nonhomogeneous terms. Generally, but not necessarily, A will be made triangular for initial value problems. The adequacy of (1) for representing the differential equation will not be discussed here. Suppose one has obtained by some means, a vector x as an approximation to the true solution x of equation (1). Let (2) (equation) where (Ax) represents the machine product of A by x. The vector within the second pair of brackets can be bounded, and the bound dependsupon the machine's arithmethic and the particular routine used for computing the product.
Automatic checking of logic design structures For compliance with testability ground rules
Authors: H. C. Godoy, G. B. Franklin, P. S. Bottorff
Venue: Proceedings of the 14th Design Automation Conference (1977)

Specification of a set of design ground rules greatly simplifies the problems of testing and test generation for complex logic structures. This paper describes a fast and effective method for testing compliance of logic network designs to testability ground rules. The technique used is similar to logic simulation and may be performed as part of the design verification process. Very large designs may be checked quickly. The system provides an effective early warning tool for the logic designer and test engineer.
Considerations for computer utility pricing policies
Authors: Daniel S. Diamond, Lee L. Selwyn
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

There are a number of different philosophies concerning the problems of pricing the resources of a multi-access computer utility. Although some have been proposed only academically, others have actually been implemented by the various fledgling systems that have come into existence during the past few years.
A model of clocked micro-architectures for firmware engineering and design automation applications
Authors: Subrata Dasgupta
Venue: Proceedings of the 17th annual workshop on Microprogramming (1984)

An aspect common to many problems in firmware engineering is the use of a micromachine model that is, an abstract and selective view of the structure and behavior of the computer at the micro-architectural level. The success, utility and generality of a particular microprogramming language, compaction technique, or verification strategy may rest critically on the expressive power and generality of the underlying micromachine model. While a number of such models have been proposed in the past we believe that these are all, for one reason or another, in adequate. In this paper we present a new, generalized, multipurpose model of clocked micro-architectures intended to provide a uniform framework for use in both firmware engineering and design automation applications.
Numerical analysis I: Segmented minmax approximation
Authors: C. L. Lawson
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

PIECEWISE linear approximations have found application in the design of diode function generators and in the linearization of nonlinear constraints in mathematical programming. Segmented functions using polynomials of higher degree and rational forms are useful in the construction of digital computer subroutines for the generation of functions have significantly differing behavior in different subintervals. Some results on the properties of the least maximum segmented approximation problem will be reported and some solution procedures discussed.
Digital system simulation: Current status and future trends or darwin's theory of simulation
Authors: Melvin A. Breuer, Alice C. Parker
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper presents a philosophical view of the changing field of design verification. The evolution of simulation and fault simulation are briefly summarized. Current research issues in design verification are discussed. The paper concludes with a discussion of the future direction simulation will take, along with other techniques destined to compete with simulation for the design verification task.
Computer hardware description languages and their applications
Authors: W. M/ vanCleemput
Venue: Proceedings of the 16th Design Automation Conference (1979)

Although design languages have been in existence since the early 1960's, only in the last few years has there been a concerted effort to bring them into the design process as a useful tool. The major applications of design languages are: 1. Description of the behavior and/or structure of a system as a means for accurately communicating design details between designers and users. 2. As the input to a system level simulator. 3. As the input to a automatic hardware compiler. 4. As the input to a formal verification system. Several attempts have been made to integrate hardware and software design. Examples are the LOGOS system [Ro76] developed at Case Western Reserve University and the SARA system developed at the University of California at Los Angeles [Es77].
Deterministic and adaptive routing policies in packet-switched computer networks
Authors: Mario Gerla
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

Efficient routing policies are required for both design and operation of distributed, packet-switched computer networks. In the network design process, deterministic policies, which are time invariant, easy to analyze and simple to represent, are generally used. For the routing of packets in a real network, on the other hand, adaptive policies, which can adjust to traffic fluctuations and component failures are implemented. Therefore, a computer network is typically optimized with respect to a deterministic policy and then operated with an adaptive policy. In the first part of this paper the two policies are compared using analytical and simulation methods, and it is shown that, in uniform traffic situations, the flow patterns generated are very similar. This result justifies the use of deterministic policy in the design phase. In the second part of the paper, the inadequacy of traditional adaptive policies in handling particular traffic situations is pointed out. As a solution, a new centralized adaptive policy is proposed, which combines the positive features of both deterministic and adaptive routing. The feasibility of such centralized policy implementation on a real network, and its efficiency with respect to the traditional implementation is discussed.
Cognitive style, categorization, and vocational effectss on performance of REL database users
Authors: Diana Gail Egly, Keith T. Wescourt
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)

Twelve subjects from two job categories, sales engineers and programmer analysts, used an REL ENGLISH database to answer a set of questions. These questions were designed to require successively more complex interactions. The database contained Hewlett-Packard's Condensed Order Records, which were pertinent to the jobs of the sales engineers.All of the subjects were given a battery of cognitive tests measuring cognitive style and pattern extrapolation skills prior to using the database. They also received a brief training session on the structure of the database.Analysis of the subjects interactions with the REL ENGLISH database, particularly analysis of the errors made, showed: first, that cognitive style is significantly correlated with the number of questions successfully completed; second, that while sales engineers were able to access all levels of the hierarchy in the database, programmer analysts had significantly more difficulty accessing data from higher levels than they did with data from the same or lower levels than the standard, entry level; and third, that programmer analysts had less difficulty with the fixed-format, programming-language-like features of REL ENGLISH, while sales engineers has less difficulty with the free-format, English-like features of REL ENGLISH.These findings suggest that quasi-natural language database interfaces are appropriate for nonprogrammers who have a field-independent cognitive style and who already are domain experts in the area covered by the database.
An introduction to simulation support software
Authors: Charles R. Standridge, Steven A. Walker
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

A wide variety of simulation languages have served analysts well for conceiving models and implementing these models on a computer. However, many other activities in addition to model conception and implementation are necessary parts of performing a simulation study. Only recently have extensions to simulation languages been provided to deal with these other aspects of performing a simulation project.
Large scale computers in medical schools
Authors: D. E. Clark
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

Computers are hardly being used in medical schools at present. There appears to be a case for large scale machines, but the finance necessary is beyond normal grants. It is possible however to purchase second hand machines at very low cost, machines that can be coupled together to form a powerful reliable system. Manchester Medical School is building up such a network of machines, the combination being - PDP-8 / 1410 / 2-1401's / 7040 / 7090 / Modular 1 The same principles could be applied to a computer network for a medical school in a developing nation. Having computer power available within medical schools allows - encourages - medical staff to use this powerful tool. This is also true of both University and non University medical staff who under normal conditions do not have the opportunity to test their ideas on a computer.
An empirical evaluation of software documentation formats
Authors: Sylvia B. Sheppard, Elizabeth Kruesi, John W. Bailey
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

The success of any software development project depends in part on the quality of the communication among the individuals involved: users, designers, coders and managers. On large systems, a variety of individuals perform various tasks at different points in time. The efficiency and correctness with which later tasks are performed depends critically on the documentation supplied during previous phases of the development cycle. This paper describes a series of three experiments designed to examine the effects of documentation format on the performance of programmers on different software-related tasks.
Uniformly erasable AFL
Authors: Sheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

The purpose of this paper is to show that a number of well-known families have property (*). In particular, we prove that the family of context-free languages does indeed have this property. In addition, we show that several familiar subfamilies of the context-free languages, such as the one-counter languages, have property (*). Finally, we show that there are families satisfying (*) which are not subfamilies of the context-free languages, for we prove that any family generated from one-letter languages has property (*), thereby extending a result of [17].
Some combinatoric algorithms in APL
Authors: Norman D. Thomson
Venue: Proceedings of seventh international conference on APL (1975)

The problems of enumerating permutations, combinations and partitions and of constructing algorithms for their orderly generation have been widely discussed in the last few years. Some of the routines so far published in Fortran-type languages make the underlying algorithms appear more complicated than they really are. This paper summarises some established methods and shows how APL leads to natural and concise means both of exposition and of algorithm construction.
A comparison of sequential and associate computing of priority queues
Authors: Barry M. Landson, Robert G. Sargent
Venue: ACM SIGARCH Computer Architecture News (1977)

A comparison of priority queues on four different types of computer memories are made by ring a model to determine the total time to do comparable tasks. The four types of memories compared are random access (RAM), associate (AM), hybrid consisting of an associate memory and a random access memory (AM/RAM), and the hybrid memory with an auxiliary memory having the @@@@pability to perform Lewin's Associate algorithm @@@@], (AM/RAM/AML). The model used for the comparisons is an extension of the MIX model developed by Knuth [1]. The MIX model was extended to include the four types of memories and the instruction set expanded include @@@@ instructions for the memories added. This @@del allows direct comparisons to be made of the different architectures and different software algorithms in performing the same tasks.
The architecture of the universe network
Authors: Ian M Leslie, Roger M Needham, John W Burren, Graham C Adams
Venue: ACM SIGCOMM Computer Communication Review (1984)

The Universe Network is composed of a number of local area networks at various sites in the U. K., joined by high capacity data links. Apart from one token ring, all of the local area networks are Cambridge rings; the high capacity data links are provided by a 1 Mbit/s satellite broadcast channel. The Universe Project encompasses both the design and implementation of the network, and a program of experiments which make use of the network. One of the notable features of the network is that a host's view of communication over the network is no different from communication over a single ring; no internet protocol is used.
Experience with a high level micromachine simulator
Authors: S. Schleimer, W. J. Meyers
Venue: Proceedings of the 12th annual workshop on Microprogramming (1979)

As part of a microcoding project, we developed a simulator that offers a relatively high level view of a micromachine. The simulator supports all out a few features of the hardware, and provides a more friendly environment for the microprogrammer. In addition, the simulator supports a number of microprogramming conventions at a level inaccessible to the hardware. The simulator was implemented in a high level language, which contributed to its timely delivery and flexibility and did not detract from its efficiency. The simulator has been used to validate all of our microcode, with considerable success. Over 98% of microcode bugs have been found during simulation. The credibility of our microcode by the time it reaches hardware has also improved the detection and correction of hardware bugs.
The global storage needs of a subcomputation
Authors: Jean-Claude Raoult, Ravi Sethi
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

A defining characteristic of &ldquo;functional&rdquo; specifications is the absence of assignments: updates of tables and data structures are expressed by giving the relationship between the new and old values. An obvious implementation allocates separate space for new and old values and may consume a lot of storage. However, even when updates of attributes like symbol tables are expressed functionally, we would like to avoid making copies of the symbol table during attribute evaluation. In other words, if possible, the implementation should have a single global copy of the table that is updated using assignments. Since the value of the global copy changes during computation, the order of evaluation has to be chosen carefully. In this paper, we partition attributes into classes, the problem being to determine if there exists an evaluation order that allows each class to share a global storage area. The solution extends to handle symbol tables for block structured languages. More precisely, consider a directed acyclic graph D in which vertices represent attribute values to be computed. Associated with each vertex is a label indicating the storage area to be shared by the vertex. Storage used during the evaluation of D is studied by playing a pebble game on D with the following steps: (1) pebble (i.e. place a pebble) on a source; (2) pebble a vertex if all its successors have pebbles (a pebble may be moved to the vertex from one of its successors); (3) pick up a pebble. Each vertex must be pebbled exactly once. The use of global storage is formalized by defining single pebblings, in which at most one of the vertices with a given label has a pebble at any time. The results also apply to a form of pebbling, called chain pebbling, that allows symbol tables for block structured languages to be studied.
On the comparison between single and multiple processor systems
Authors: E. G. Coffman,  Jr., Kimming So
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

We study the comparison between an m-processor (multiprocessor) system and a single-processor system whose processor is m times as fast as any in the multiprocessor system. The expected superiority of the single-processor system is measured in terms of mean and maximum flow times, using both combinatorial and probabilistic models.
Testing large software with automated software evaluation systems
Authors: C. V. Ramamoorthy, S. F. Ho
Venue: Proceedings of the international conference on Reliable software (1975)

In the past few years, research has been actively carried out in an attempt to improve the quality and reliability of large scale software systems. Although progress has been made on the formal proof of program correctness, proving large scale software systems correct by formal proof is still many years away. Automated software tools have been found to be valuable in improving software reliability and attacking the high cost of software systems. This paper attempts to describe some main features of automated software tools and some software evaluation systems that are currently available.
Panel on information and public policy
Authors: John L Gentile, Robert kling, Terry C. Kuch, Kenneth Laudon, Daniel McCracken, Allen Westin, Anthony Wasserman
Venue: Proceedings of the 1975 annual conference (1975)

Computing professionals have been immersed predominantly in problems of how to acquire, formulate, and retrieve information with some vague notion that someone, somewhere, sometime is going to use that information to better frame suitable policy. This assumes of course a rational universe in which strategies are based on outcomes of observations and guided by criteria which optimize something reasonable&mdash;such as health, income, production, power, or what have you. We may be waking up now to the realization that the technical problem has a much broader scope than first envisioned. The technical problem may have to also include a demonstration that information can be used to formulate rational policy in the first place and how to do it.
Direct execution of APL on an IBM/370
Authors: A. Hassitt, L. E. Lyon
Venue: Proceedings of seventh international conference on APL (1975)

In an earlier paper (1), we described the implementation of an APL machine on an IBM/360 model 25. we required that the APL system should not need a dedicated machine, but should run under a conventional operating system. This paper describes the microprogrammed part of APL/CMS and how it relates to the rest of the system; the APL/CMS User's Manual (2) describes the complete system.