ppxscal/embedding_network huggingface dataset:
The CN network model
Authors: R. D. Jones, D. C. Lach, J. W. Metsos
Venue: Proceedings of the second conference on Applications of simulations (1968)

The Canadian National Railways' desire to develop a network simulation grew in recent years with the availability of large third generation computers, better data bases, and the increasing tendency of key operating people to approach railroad problems from the systems viewpoint. As the volume of CN's market expands, the mix of traffic alters, resulting in a constantly changing geographical pattern of flow. In addition, the accent on traditional standards of service for such traffic as preference and bulk loads is shifting. The individual customer's requirements for such things as the pick-up time at his siding, the delivery time at the consignee, and consistency of service, are becoming more stringent.
Fast matrix multiplication
Authors: Charles M. Fiduccia
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

This paper deals with three aspects of algebraic complexity. The first section is concerned with lower bounds on the number of operations required to compute several functions. Several theorems are presented and their proofs sketched. The second section deals with relationships among the complexities of several sets of functions. In the third section, several matrices of general interest are examined and upper bounds on the number of operations required to multiply by them are constructively derived.
A computer simulation model of driver-vehicle performance at intersections
Authors: Kenneth R. Laughery, Theodore E. Anderson, Edwin A. Kidd
Venue: Proceedings of the 1967 22nd national conference (1967)

Problems of safety and efficiency in present day highway traffic systems are receiving considerable attention. Much of this attention is being focused upon the driving task. Driving an automobile encompasses extremely complex patterns of behavior involving sensory, perceptual, decision making and response processes. Current knowledge of the effects of the variables influencing this behavior, and of their interactions, is quite limited. For many aspects of the driving task the relevant variables have not even been identified. These considerations suggest at least two approaches to the study of the driving task. First, an analytical approach is required to help identify the variables involved in automobile driving. Second, experimental studies are needed to determine the effects of specific combinations of these variables.
An introspective environment for knowledge based simulation
Authors: Venkataseshan Baskaran, Y. V. Reddy
Venue: Proceedings of the 16th conference on Winter simulation (1984)

An intelligent system is developed to help the user in building models which can disclose their operation, learn, verify and check their own operations. The knowledge necessary for this is represented using the knowledge representation language SRL and this allows the user to enter the necessary information at different levels of abstraction. In addition to automatic verification, some important debugging aids like selective tracing of any collection of model elements under different conditions are also developed.
The splitting concept applied to the OIL family of codes
Authors: W. E. Johnson
Venue: Proceedings of the SIGNUM meeting on Software for partial differential equations (1975)

The genesis of the OIL code is the original Particle-in-Cell code written by Dr. Francis Harlow at the Los Alamos Scientific Laboratory (Ref. 1). The OIL code (Ref. 2) was then developed by replacing the discrete particle mass transport by a continuum, resulting in a near infinite particle representation. The TOIL code (Ref. 3) was then developed by extending the technique to two materials.
Space plan: A user oriented package for the evaluation and the generation of spatial inter-relationships
Authors: Robert J. Krawczyk, Elliott E. Dudnik
Venue: Proceedings of the 10th Design Automation Workshop (1973)

The development and the subsequent exposure of automated space planning methodologies has grown to the point where they are now acceptable and readily available preliminary architectural design tools. This paper describes a system of computer programs which were developed in an attempt to pull together current design methodologies. In summary, the paper describes the general system and discusses the basic assumptions and concepts implemented within it. Each method presented is described and executed with the same specific design problem for the purpose of demonstration and comparison.
EXCL: A circuit extractor for IC designs
Authors: Steven P. McCormick
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper describes EXCL, an automated circuit extraction program that transforms an IC layout into a circuit representation suitable for detailed circuit simulation. The program has built-in, general extraction algorithms capable of accurate computations of interconnection resistance, internodal capacitance, ground capacitance, and transistor sizes. However, where possible, the general algorithms are replaced with simple techniques, thereby improving execution speed. A basic component of the extractor is a procedure that decomposes regions into domains appropriate for specialized or simple algorithms. The paper describes the decomposition algorithm, the extraction algorithms and discusses how they connect with the rest of EXCL.
SIGBDP (Panel Session)
Authors: James F. Hubbert, Earl C. Joseph, Walter G. Wohlgemuth
Venue: Proceedings of the 1976 annual conference (1976)

Computer auditing is a new and growing profession which combines a data processing expertise with the more established discipline of auditing. As with any new profession, computer auditing's role is still evolving. The panelists in this session will attempt to define this role.
Application of unilateral and graph techniques to analysis of linear circuits
Authors: Hanan Potash, Lawrence P. McNamee
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

Extensive research is currently under way in developing methods to solve a linear system of first-order differential equations, and in particular the system of equations associated with computer-oriented circuit design.1-20 The methods presented here are based upon topological and graph theory, which is a natural modeling method for networks since an electrical network is a topological arrangement of electrical components. The information pertinent to circuit analysis and synthesis can be categorized in two phases: first, the topological arrangement of circuit components, and second, the electrical relations within the components.
System development methodology or system research methodology?
Authors: Donald T. Coughlin
Venue: Proceedings of the 1981 ACM workshop/symposium on Measurement and evaluation of software quality (1981)

A future data processing historian may someday point to the 1970s as the deoade when business application systems began their adolescent growth period. We entered the 1970s with few truly on-line business systems, and many application designers did not fully appreciate the capabilities and limitation of index sequential file structures. Many of the larger companies were busy writing their own tp monitors and file handling systems, and it is very possible that more professional hours were being devoted to the development of control program software than to applications software. The last decade did provide the application programmer with new control program tools such as data base management systems and on-line terminal control software. It also generated a continuing demand for computer performance software specialists to tune application systems immediately after initial implementation. These performance tuning efforts often required substantial changes to the application system - not just program code but also basic redesign. Therefore were these really system development projects or were they system research projects?
New methods for dynamic storage allocation (Fast Fits)
Authors: C. J. Stephenson
Venue: Proceedings of the ninth ACM symposium on Operating systems principles (1983)

The classical methods for implementing dynamic storage allocation can be summarized thus First Fit and Best Fit The available blocks of storage are linked together in address order. Storage is allocated from the first available block of sufficient length, or from a block with the minimum excess length. Storage can be allocated or released in multiples of two words. In the long run, if numerous pieces of storage of more-or-less random lengths are allocated and released at more-or-less random intervals, the storage becomes fragmented, and a number of uselessly small blocks develop, particularly near the beginning of the list. Although these fragments usually comprise a small proportion of the storage (typically around 10 per cent), a lot of time can be wasted chaining through them. Buddy Methods Here the task of managing the storage is reduced in size by constraining the way in which the storage can be divided up, e.g. into blocks with lengths which are powers of 2. This eliminates chaining through long lists of uselessly small blocks; on the other hand, space is wasted in rounding up the length requested to an allowable size, and typically about 40 per cent more storage is required to satisfy the same allocations than when using First Fit or Best Fit. The methods presented in this paper are externally compatible with First Fit and Best Fit, and require roughly the same amount of storage for a given sequence of allocations. They use, however, a completely different internal data structure, one effect of which is to reduce the number of blocks that have to be visited to perform a typical allocation or release operation. These new methods exhibit roughly the same space performance as First Fit, and a time performance which falls between those of First Fit and Buddy.
Decision situations, decision processes, and decision functions: Towards a theory-based framework for decision-aid design
Authors: W. Zachary, R. Wherry, F. Glenn, J. Hopson
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Decision augmentation systems differ qualitatively from current man-computer interactive systems because they involve intelligent, complex, and largely symbiotic man-machine relationships. They thus provide the stimulus for the development of a new branch of human factors, one concerned with the human engineering of relationships between humans and intelligent, quasi-autonomous, computer-based systems. The threefold objective of the research described in this paper has therefore been to identify the human factors problems which such a framework should address, to generate the basic information around which it should be built, and to determine the general structure which it should take.
A state-of-the-art SIMD two-dimensional FFT array processor
Authors: Mehrad Yasrebi, G. J. Lipovski
Venue: ACM SIGARCH Computer Architecture News (1984)

A novel implementation of a Two-dimensional FFT array processor is given. The reasons for its superior performance is the one-to-one and onto mapping of the problem communications topology onto the interconnection network, VLSI-based implementation, a proper choice for the number system, multiple-parallelism, and the use of packet-switching as opposed to circuit switching. A performance comparison also presented.
A high performance graphics system for the CRAY-1
Authors: Robert H. Ewald, Lynn D. Maas
Venue: ACM SIGGRAPH Computer Graphics (1978)

This paper describes the design and implementation of a state-of-the-art interactive vector graphics system connected to the CRAY-1 supercomputer. The primary design goal for this graphics system is that it support large hydrodynamic computer programs used in weapons design calculations. The interactive use of these programs requires displays consisting of up to 20,000 vectors, extensive interaction tools, and high-bandwidth communication rates. The major system components selected for this project were an Evans and Sutherland Picture System 2 and a Digital Equipment Corporation (DEC) PDP-11/70 and PDP-11/34 running the UNIX operating system. This paper presents the system design goals and performance criteria. The hardware/software systems chosen for this project are reviewed, and the integration of this system into the Los Alamos Scientific Laboratory's (LASL) Integrated Computer Network (ICN) is described. This implementation involved most areas of applied computing, including computer graphics, communications, distributed processing, and computer security. The level of effort required for this implementation is described, and the results and benefits are presented. Future plans for this system are also briefly described.
Designing computer circuits with a computer
Authors: Gene H. Leichner
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

The circuit to be considered is that of a transistor flipflop as shown in Figure 1. All polarities are chosen for NPN transistors. In this analysis, the transistor re, rb, and rc, will be assumed neglibible for simplicity. It will also be assumed that (equation) where &agr; is the current gain of the transistor.
Levels of representation of programs and the architecture of universal host machines
Authors: B. Ramakrishna Rau
Venue: Proceedings of the 11th annual workshop on Microprogramming (1978)

The issue of high level language support is treated in a systematic top-down manner. Program representations are categorized into three classes with respect to a host processor: high level representations, directly interpretable representations and directly executable representations. The space of intermediate languages for high level language support is explored and it is shown that whereas the ideal intermediate language from the point of view of execution time is a directly executable one, the best candidate from the viewpoint of memory requirements is a heavily encoded directly interpretable representation. The concept of dynamic translation is advanced as a means for achieving both goals simultaneously; the program is present in the memory in a compact static representation, but its working set is maintained in a dynamic representation which minimizes execution time. The architecture and organization of a universal host machine, incorporating this strategy, is outlined and the potential performance gains due to dynamic translation are studied.
Computer Systems Planning - tools techniques
Authors: Edwin S. Herndon
Venue: Proceedings of the 1976 annual conference (1976)

Computer Systems Planning for a large general purpose computer facility is discussed in this paper. An overview of the planning process is presented which emphasizes development of a workload forecast and setting planning objectives. Integrated use of accounting data, synthetic programs, a system simulation program and a software monitor is described. Experiences in planning at Johnson Space Center are used to illustrate pivotal issues in the planning process.
On monotone formulae with restricted depth
Authors: Maria Klawe, Wolfgang J. Paul, Nicholas Pippenger, Mihalis Yannakakis
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We prove a hierarchy theorem for the representation of monotone Boolean functions by monotone formulae with restricted depth. Specifically, we show that there are functions with &pgr;k-formula of size n for which every &sgr;k-formula has size exp &ohgr;(n1/(k&minus;1)). A similar lower bound applies to concrete functions such as transitive closure and clique. We also show that any function with a formula of size n (and any depth) has a &sgr;k-formula of size exp o(n1/(k&minus;1)). Thus our hierarchy theorem is the best possible.
Some experience in building portable software
Authors: Max Stern
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

Several authors have discussed methodology for making software portable, but less has been written about the specific components of programs which are likely to be system-dependent. This paper is based on several years of successful experience in making a major software product (MARK IV) transportable among many operating systems and machines. The product is implemented in assembly language and developed on a single support system for all of the "target" systems. The specific strategies and conclusions presented here are based on more general principles, and should be more or less applicable to systems developed in higher-level languages. The system dependencies are isolated in as few modules as possible. Various techniques are used to include system-dependent code at assembly time, at installation tape creation time and at customer installation time. The system-dependent functions addressed by this paper are: program start and termination, input/output, primary storage management, interrupt control, checkpointing, module loading, overlay structures and object module format and other installation considerations.
A problem oriented graphic language
Authors: Peter M. Schwinn
Venue: Proceedings of the 1967 22nd national conference (1967)

There are several &ldquo;subroutine packages&rdquo; available today which may be used by programmers to obtain graphical output from computers. These subroutine packages are difficult for the non-programmer to use since he must write an executive program to make the appropriate calls to these subroutines to realize the desired results. There are individuals at all educational levels in most every discipline who are eager to use the computer, but who do not wish to get involved with any extensive programming. The language to be presented here is user-oriented. The formal syntactic definition of the language will be given using Backus-Naur Form. The definition will be presented in a manner which progresses from the larger syntactic units to the smaller syntactic units. Some of the semantic and pragmatic considerations which help to motivate the language will be interspersed throughout the formal definition. Finally, two illustrations will be presented to help draw the ideas together.
The dimensions of healthy maintenance
Authors: Robert S. Arnold, Donald A. Parker
Venue: Proceedings of the 6th international conference on Software engineering (1982)

What characterizes &ldquo;healthy&rdquo; or &ldquo;satisfactory&rdquo; software maintenance? How can we know it when we see it? This paper gives initial answers to these questions. We first argue the need for objectively measurable maintenance performance criteria in judging the &ldquo;adequacy&rdquo; of maintenance and present a set of criteria for judging maintenance performance in a particular software environment. We then subject the criteria to a practical test by applying them in this environment. We show how applying the criteria enables an informed overall maintenance performance appraisal, locates general maintenance problems, stimulates suggestions for improving maintenance on individual projects, allows these projects' maintenance to be compared and the projects ordered for improvement, and assesses the potential effectiveness of the suggestions in new project maintenance. We also sketch how criteria application can be generalized to software development monitoring and design methodology evaluation.
A system for interactive modeling of physical curved surface objects
Authors: J. N. England
Venue: Proceedings of the 5th annual conference on Computer graphics and interactive techniques (1978)

It is often important to obtain descriptions of existing objects for computer graphics data bases. A system to aid interactive modeling (in three dimensions) of a physical object is described. The system allows a user to fit a bi-cubic parametric spline surface to an object by superimposing stereoscopic views of the computer surface with stereoscopic television views of the object. A 3-D joystick is used to manipulate surface control points while the user views the computed surface as isoparametric contours. A raster scan display polarization stereoscope is used. The left eye and right eye surface views are computed using a unique display processor designed and constructed for the evaluation of raster scan graphics techniques. The display processor consists of multiple non-pipelined concurrently operating microprogrammed modules. The computation of the two reasonably complex images (>500 vectors each) takes less than 33 msec allowing real time display at standard television rates.
The complexity of theorem-proving procedures
Authors: Stephen A. Cook
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be &ldquo;reduced&rdquo; to the problem of determining whether a given propositional formula is a tautology. Here &ldquo;reduced&rdquo; means, roughly speaking, that the first problem can be solved deterministically in polynomial time provided an oracle is available for solving the second. From this notion of reducible, polynomial degrees of difficulty are defined, and it is shown that the problem of determining tautologyhood has the same polynomial degree as the problem of determining whether the first of two given graphs is isomorphic to a subgraph of the second. Other examples are discussed. A method of measuring the complexity of proof procedures for the predicate calculus is introduced and discussed.
Structured specification of a Security Kernel
Authors: K. G. Walter, S. I. Schaen, W. F. Ogden, W. C. Rounds, D. G. Shumway, D. D. Schaeffer, K. J. Biba, F. T. Bradshaw, S. R. Ames, J. M. Gilligan
Venue: Proceedings of the international conference on Reliable software (1975)

Certifying an entire operating system to be reliable is too large a task to be practicable. Instead, we are designing a Security Kernel which will provide information security. The kernel's job is to monitor information flow in order to prevent compromise of security. Sound design is encouraged by using a technique called Structured Specification, in which successively more detailed models of the Security Kernel are developed. The initial model, M0, is an abstract description which formalizes governmental security applied to computer systems. Subsequent levels of modeling provide increasingly more detail, and gradually the models begin to resemble a particular system (Multics in this case). The second model, M1, defines a tree-structured file system, and an interagent communication system while M2 adds details concerning segmentation in a dynamic environment. It is intended that the final level of modeling will specify the primitive commands for the kernel of a Multics-like system and will enumerate precisely those assertions which must be proved about the implementation in order to establish correctness.
Guidelines for selecting a financial modeling language
Authors: Donald A. Heckerman, Ian J. Adams
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

The purpose of this paper is two-fold. First, to describe some of the different types of computer software which can be used to develop financial models, and to indicate the advantages and disadvantages of each type. Second, to suggest a set of guidelines for relating the financial modeling needs of the user to the attributes of the numerous financial modeling languages which are currently available. The discussion and guidelines are based on Ernst Ernst's experience in carrying out over 150 consulting engagements which involved the development and use of financial models, as well as Ernst Ernst's extensive survey and analysis of the some 75 financial modeling languages available from software houses, time sharing vendors, and computer manufacturers.