ppxscal/embedding_network huggingface dataset:
New directions in computing at the National Laboratories
Authors: David F. Stevens, Richard W. Watson, Paul Rotar, Arnold M. Peskin
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The National Laboratories tend to belong to the category of very large scale scientific computing installations. They are frequently operating on the frontiers of the computing art, but many of the problems they face become, all too soon, the problems faced by more conventional installations. In this session, speakers from three of the National Laboratories will address such problems as the tailor-made, &ldquo;mix-and-match&rdquo; local network, the search for very large on-line storage capacity, and technology forecasting in the Department of Energy.
An emergency medical system simulation model
Authors: James A. Fitzsimmons
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This paper presents a SIMSCRIPT simulation model designed for general use by health systems planners in evaluating existing or proposed emergency medical systems. An extensive validation of the model was performed using actual data from the San Fernando Valley area of Los Angeles. Appropriate operating procedures for use of the model are discussed. In conclusion, an application of the model in determining the desired number of ambulances for a system illustrates its usefulness in planning emergency medical systems.
New directions in the management of data processing training
Authors: Jack L. Stone
Venue: Proceedings of the 1979 annual conference (1979)

Key to the improve productivity od computer personnel is the operation of a valid, justifiable, on-going data processing training program within the DP organization. However, most of these programs are established by &ldquo;seat of the pants&rdquo; guesswork. Few DP trainers actually know how to justify DP training on an objective basis. Even in those cases where training is objectively justified, it is seldom measured and evaluated in ways that validate the benefits of that training that is delivered. This presentation, based on a series of four &ldquo;In-Depth&rdquo; articles which are co-authored with Gary Slaughter and scheduled for publication in Computerworld during the fall of 1979, first summarizes the status of data processing training as of the end of this decade. It then briefly covers the reasons for justifying DP training, how to cost justify, and how to measure and evaluate DP training effectiveness.
Riot&mdash;a simple graphical chip assembly tool
Authors: Stephen Trimberger, James Rowson
Venue: Proceedings of the 19th Design Automation Conference (1982)

Riot is a simple interactive graphical tool designed to facilitate the assembly of cells into integrated systems. Riot supplies the user with primitive operations of connection&mdash;abutment, routing and stretching&mdash;in an interactive graphic environment. The designer retains full control of the design, including the assignment of positions to instances of cells and the choice of connection mechanism. The computer takes care of the tedious and exacting implementation detail, guaranteeing that connections are made correctly. The powerful connection primitives give the user of Riot the ability to quickly assemble a custom chip from a collection of low-level cells. This document provides a discussion of the motivation for Riot and a description of the Riot chip assembly system, its capabilities and its use.
Design Automation philosophies (Position Paper)
Authors: Donald L. Peterson
Venue: Proceedings of the 16th Design Automation Conference (1979)

A collection of cogitations and philosophies concerning the not-so-technical challenges that arise in &ldquo;The Real World of Design Automation&rdquo;.
Complexity classes of partial recursive functions (Preliminary Version)
Authors: Edward L. Robertson
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

This paper studies possible extensions of the concept of complexity class of recursive functions to partial recursive functions. Many of the well-known results for total complexity classes are shown to have corresponding, though not exactly identical, statements for partial classes. In particular, with two important exceptions, all results on the presentation and decision problems of membership for the two most reasonable definitions of partial classes are the same as for total classes. The exceptions concern presentations of the complements and maximum difficulty for decision problems of the more restricted form of partial classes. The last section of this paper shows that it is not possible to have an &ldquo;Intersection Theorem&rdquo;, corresponding to the Union Theorem of McCreight and Meyer, either for complexity classes or complexity index sets.
Simulation sensitivity analysis: A frequency domain approach
Authors: Lee W. Schruben, Vincent James Cogliano
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

A procedure is presented for assessing the sensitivity of a discrete event digital simulation model to the values assumed for its input parameters. A frequency domain approach is taken where the input parameters oscillate throughout a run of the model. Parameter sensitivities are indicated by changes in the frequency spectrum of the simulation response. The spectrum can be used to identify a regression model for the simulated response surface. Several continuous parameters may be screened in a single run.
On the design and use of graphics-oriented continuous system simulation languages (CSSL)
Authors: Travis L. Herring
Venue: ACM SIGGRAPH Computer Graphics (1976)

Some of the features of CSSL languages are discussed, followed by a discussion of the suitability of CSSL as a basis for an interactive graphics programming system. Features of a graphics implementation of CSSL (GCSSL) are then described. It is noted that GCSSL has applications well beyond that suggested by the fact that it is based on CSSL. Some of these applications are graphics program development, computer animated displays and movies, and the general area of scientific computing. Suggestions for future developments are mentioned.
SIGMA-CAD: Some new concepts in design of general purpose CAD systems
Authors: B. David, G. Vitry
Venue: Proceedings of the 15th Design Automation Conference (1978)

SIGMA-CAD is a general purpose CAD system based essentially on two new ideas: - construction of the PROTOTYPE of an application, which facilitates the implementation of an application by using techniques of computer assisted construction, allowing an incompletely defined system to function in simulation and thus permitting close collaboration between the builder and the future user. - adaptation of this PROTOTYPE to the final run structure defined by software - hardware - firmware facilities (choice, for example, of method of data management, structure of working station, connections with OS, use of special processors, etc...). This paper presents several concepts which permit the implementation of these ideas.
Module: An encapsulation mechanism for specifying and implementing abstract data types
Authors: Billy G. Claybrook, Marvin P. Wyckoff
Venue: Proceedings of the ACM 1980 annual conference (1980)

An encapsulation mechanism, the module, for specifying abstract data types is described. The module employs a constructive specification method for specifying abstract data types. The constructive method consists of two specifications: a logical structure specification and a semantics of operations specification. The specification and implementation of a nontrivial data type, a symboltable data type, is given and proof of implementation correctness is discussed and illustrated.
The Brown University network
Authors: Harold H. Webber
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Brown University recently completed the installation of a &dollar;1.3 million, broadband communications network which ties together 130 buildings. The network backbone consists of two 300 MHz mid-split CATV systems and is run completely underground. More than 1100 terminals, computer ports and other devices in the first sixty internally wired buildings are operating on the network. The network is meeting the need for reliable communication for data and television using commercially available components and systems. Selection and design criteria, a cost analysis of different stages of implementation, initial applications and performance of the network will be described. Like many other educational, industrial and business organizations, Brown has been confronted with an ever increasing demand for computing and information services. As early as 1977, various university planning groups began to assess our future data communication requirements and to discuss possible ways of satisfying them by means of a local network. But even the most far-reaching of these early studies failed to accurately predict the growth in computing we are now experiencing, the range of devices and services which would have to be accommodated, and the cost and problems associated with continuing to rely upon the local telephone company to meet our data communication needs.
Optimisation of global routing for the UK5000 gate array by iteration
Authors: C O Newton, P A Young
Venue: Proceedings of the 20th Design Automation Conference (1983)

A global router which has been developed for the UK5000 gate array is described. The algorithm employed treats all nets in parallel. It solves the problem set by the channels having fixed capacity by using cumulative weighting to direct connections away from regions of wiring congestion. It is shown that the convergence process is stable, that high channel utilisation can be accommodated and that the first pass of the process can be used to provide a measure of the quality of placement and of the ultimate solubility of the routing for a given circuit application.
The analysis of an improved hashing technique
Authors: Gaston Gonnet, Ian Munro
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

We discuss the problem of hashing in a full or nearly full table using open addressing. A scheme for reordering the table as new elements are added is presented. Under the assumption of having a reasonable hash function sequence, it is shown that even with a full table only about 2.13 probes will be required, on the average, to access an element. This scheme has the advantage that the expected time for adding a new element is proportional to that required to determine that an element is not in the table. Attention is then turned to the optimal reordering scheme (which is a maximum flow problem) and the minimax problem of arranging the table so as to minimize the length of the longest probe sequence to find any element. A unified algorithm is presented for both of these as well as the first method suggested. A number of simulation results are reported, the most interesting being an indication that the optimal reordering scheme will lead to an average of about 1.83 probes per search in a full table.
Evaluating logarithms in GF(2n)
Authors: Don Coppersmith
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We present a method for determining logarithms in GF(2n). Its asymptotic running time is O( exp (cn1/3log2/3n)) for a small constant c, while, by comparison, Adleman's scheme runs in time O( exp (c'n1/2log1/2n)). The ideas give a dramatic improvement even for moderate-sized fields such as GF(2127), and make (barely) possible computations in fields of size around 2400. The method is not applicable to GF(q) for a large prime q.
Throughput analysis of multiprogrammed virtual-memory computer systems
Authors: Akira Sekino
Venue: Proceedings of the 1973 ACM SIGME symposium (1973)

A model of paging behavior of programs under multiprogramming and a model of dual processor multi-memory processing system with virtual memory are developed. Combining these two models, it is possible to evaluate the throughput of multiprogrammed virtual-memory computer systems realistically. Numerical results obtained by these models are then compared with the measurement data of the Multics system of M.I.T. Finally, the effect of multiprogramming and sharing upon a system's throughput is numerically evaluated.
Barriers to the practical use of simulation analysis
Authors: Harry M. Markowitz
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

Simulation techniques are used in only a small fraction of instances in which they seem applicable. This paper considers the reasons for such &ldquo;non-uses.&rdquo; In particular the paper considers simulator programming, the simulation/database interface, and two statistical topics as past, present and future limiting factors in the practical use of simulation techniques.
A methodology for parallel processing design tradeoffs
Authors: Charles H. Radoy, George P. Copeland,  Jr., G. J. Lipovski
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

A methodology is developed for determining how much parallelism is optimal if a given job stream is to be executed without multiprogramming. Qualitative design tradeoffs are inferred from the cost-performance effect of parallelism on different hardware subsystems. Measures of software parallelism are analytically related to measures of hardware performance. It is shown that an increase in hardware parallelism may be desirable even though it causes an increase in job processing cost and/or a decrease in hardware efficiency.
Simulation optimization for decision support in operating a robotic manufacturing system
Authors: C. C. Chu, J. J. Talavage
Venue: Proceedings of the 16th conference on Winter simulation (1984)

The operation of a robotic manufacturing system can be a complex task for which little experience is now available. Simulation has often been used as a means of modeling large complex systems. Optimization methods use such models to make good choices for system parameters. This paper describes a simulation-optimization approach combined with pattern recognition to develop an operating procedure for a manufacturing system which contains robots. This procedure is adaptive in the sense that it is updated on a periodic basis to account for changing shop load and pending orders.
Groups and subgroups, presentations and representations
Authors: John McKay
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

A survey of some computational techniques available to the finite group theorist and a description of several outstanding problems in which the computer may prove helpful.
Justification and financial analysis for CAD
Authors: R. E. Powell
Venue: Proceedings of the 17th Design Automation Conference (1980)

Many factors influence the capital investment decision. System costs and benefits are weighed by methods of financial analysis to determine the advisability of an investment. Capital, expense, and benefits as related to CAD are discussed and model calculations are included. An example is treated by the simple payback method and the more sophisticated methods of Net Present Value (NPV) and Internal Rate of Return (IRR). The NPV and IRR approaches include in the calculation the time value of money and provide a sounder foundation on which to base the purchase decision. It is hoped that an understanding of these techniques by technical personnel will make an optimum system purchase more likely.
A demographic simulation model for health care, educational, and urban systems planning
Authors: Philipp F. Schweizer
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This paper describes the development, application, and digital computer simulation of a demographic model suitable for long term planning. The simulation model is based on the &ldquo;cohort survival methodology&rdquo; and projects population characteristics (population numbers for each region, age group, sex, year and racial or income group) for a planning period less than or equal to twenty years. Demonstration of how the simulation model is applied to problems in Health Care, Educational and Urban Systems Planning are presented.
A cross-impact simulation of corporate susceptibility to crisis: The case for organizational reform
Authors: W. A. Thompson, C. F. Smart, I. Vertinsky
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

A simulation model of corporate crisis is described. The model depicts the interrelationships between executive attributes, the strategic posture of the corporation, and the state of organizational structure and resources. The impacts of these three clusters of variables on organizational vulnerability to crisis is studied. The simulation is then used to explore alternative organizational reform measures that attempt to reduce corporate vulnerability to crisis and improve effectiveness. The reform strategy which was found to be the most effective consisted of (1) a program to retrain executives and provide incentives to increase risk taking and reduce rigid application of standard programs, combined with (2) structural change instituting decentralization and reduction of hierarchical depth.
Evolution of a query translation system
Authors: Jyh-Sheng Ke, Shi-kuo Chang
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)

This paper presents the motivation, history, and idiosyncrasy of a query translation system. Detail of the translation process has also been described.
Trading data space for reduced time and code space in real-time garbage collection on stock hardware
Authors: Rodney A. Brooks
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

This paper presents a new storage representation for cons cells (and all other LISP heap data structures) which allows more time efficient LISP with real-time garbage collection on stock hardware. &ldquo;Stock hardware&rdquo; refers to common modern architectures for Von Neumann uni-processors (e.g. MC68000, IBM370, VAX, NS32032, etc.). Previous real-time garbage collection schemes have either explicitly required specially tailored hardware in order to avoid multiple order of magnitude slowdowns, or have been merely extremely unattractive for implementation on stock hardware due to the high overhead assumed by all basic LISP primitives in checking the garbage collection status of pointers handed to them as arguments. We first show that copying compacting real-time garbage collection algorithms do not always need to protect user programs from seeing uncopied data, so long as a slightly more complicated collection termination condition is used. This opens the way to adding an indirection pointer to all LISP heap objects making it unnecessary to check the garbage collection status of pointers, and so the overhead costs for most primitives reduce to the addition of a single instruction. Impure primitives, i.e. those which write into existing structures (e.g. RPLACD), have their overhead reduced by a factor of almost 2. Code density is correspondingly decreased. The cost of this scheme is increased storage size for all LISP heap objects one extra pointer per object, although for some objects (e.g. floating point numbers) this expense is already necessary in many other non real-time garbage collection algorithms.
Making control and data flow in logic programs explicit
Authors: Gert Smolka
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

New control constructs are proposed to replace Prolog's notorious cut. Totality assertions are introduced to enable a language-oriented editor to display the control structure of a procedure. Functional notation is presented as a syntactic extension. Data flow assertions are proposed to assert data flow properties and restrictions of logic procedures. Algorithms for their verification are given.
Toward the specification of programs
Authors: William J. Mein
Venue: ACM SIGCSE Bulletin (1977)

Much has been written lately on program design using a top down approach, decomposition and stepwise refinement. Most of these methodologies have been grouped under the general rubric of structured programming, see for example Computing Surveys, Vol. 6, Number 4, December 1974. Structured programming does not, however, give many insights into the general area of program specifications. As a result of lack of specifications and having a definite need to write the specifications for a system containing some forty to fifty programs, we developed a set of specifications. This set will be elaborated on more fully in section three, but first I want to elucidate some minor points.
Nova*gks, a distributed implementation of the Graphical Kernel System
Authors: Clinton N. Waggoner, Charles Tucker, Christopher J. Nelson
Venue: ACM SIGGRAPH Computer Graphics (1984)

NOVA*GKS is an implementation of the Draft International Standard Graphical Kernel System (GKS), built using a distributed architecture. The specifications for GKS present an implementor with many design tradeoff decisions. The implementors of NOVA*GKS have analyzed those tradeoffs and created a distributed design which allows users of the package to design applications which can perform efficiently on many different graphics hardware configurations.
A model for non interpreted structures of logical systems
Authors: R. Alali, C. Durante, J. J. Mercier
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper presents a model for non interpreted structures of logical systems, i.e., structures in which neither the type of transformations nor the contents of informations are specified. Systems structures are modelled by a set of Primitive Functional Entities (PFE), while informations are represented by dynamic entities called Information Flow Entity (IFE). To compensate the role of information contents, two subjectivity attributes are associated with each IFE. An application example is given to show how the above concepts are used.
Application of simulation to detail design of a telephone Directory Assistance System Computer number 68
Authors: John A. Noecker
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This paper presents results of several DAS/C system design studies and shows how simulation is used to support these studies at the detail level while simultaneously monitoring the overall design to assure meeting the system objectives. This paper is concerned with the systems analysis associated with the IRC inquiry function. The analyses of the IRC update function and the operator's job is currently under way and may be reported in the future.
The Data and Analysis Center for Software(Presentation Abstract)
Authors: Lorraine Duvall
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The Data and Analysis Center for Software (DACS) is being established at the Rome Air Development Center (RADC) to serve as a focal point for scientific and technical information on software technology. The major functions of DACS will be discussed. They are to develop and maintain a computer database of software data, establish a library containing technical reports and a lessons-learned file, identify data requirements for research efforts and present as a guideline for collecting data, analyze the data in the database and produce data and information reports, establish a current awareness program including the publication of newsletters and involvement in technical meeting to disseminate information, produce and distribute data subsets, data compendiums, state-of-the-art reports and bibliographies, and provide consultation and inquiry services. The status of the current database will also be discussed. The majority of the database consists of error data; i.e. the contents of Software Problem Reports and Software Modification Notices acquired by RADC form six large software development projects. There is information on a total of approximately 27,000 errors.