ppxscal/embedding_network huggingface dataset:
Progress in simulation of valve train dynamics
Authors: W. C. Franke
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

The simplest model of a mechanical system dictated by a known linear equation does not always suffice when simulating a mass-spring system. However, a mechanism can be simulated on an electronic analog computer when the set of linear differential equations describing a more detailed model are known even though the non-linear effects that must now necessarily be included can not be expressed explicitly. This was the problem in developing a simulation circuit for an overhead valve train in an internal combustion engine. An adequate simulation would allow prediction of valve motion produced by a particular cam and train at various engine speeds and minimize the actual construction and testing required in valve gear design. This paper describes the development procedure and indicates the correlation obtained thus far. A sketch of an overhead valve train is given in Figure 1, and its simplest linear spring-mass equivalent system is shown in Figure 2. M is the overall effective mass, and K the overall effective stiffness of the mechanical linkage. Kv is the valve spring stiffness, and C is a viscous damping coefficient. The system equation solved by the computer is: (equation). Results of a computer run using an experimental cam shape at 5000 engine rpm are given in Figure 3. The solution for valve acceleration is found to follow the trend of the cam acceleration input function except for the superposition of damped sinusoidal waves corresponding to the natural frequency of the valve train and initiated by the opening and closing peaks of cam acceleration.
Microelectronics and printed circuits: Problems and their solutions
Authors: Louis Weinberg
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

In this paper we present solutions to a number of problems that arise in microelectronics, printed circuits, and process automation. These problems are broadly concerned with wiring and interconnection of modules, circuit layout design, and the graphic display, manipulation, and alteration of circuits. The solutions are based on a number of results obtained by the author on the characterization, coding, symmetries, and generation of planar graphs. These results are constructive in that they can be given in the form of algorithms and are thus suitable for direct computer implementation.
The interconnection problem - a tutorial
Authors: David W. Hightower
Venue: Proceedings of the 10th Design Automation Workshop (1973)

This paper represents a fairly extensive survey of the literature on the interconnection problem. The topics covered are: Pin Assignment, Layering, Ordering, Wire List Determination, Spanning Trees, Rectilinear Steiner Trees and Wire Layout. In addition, several new ideas are presented which could provide for better wire layout. Algorithms are presented in a way that makes them easy to understand and hence, to discuss and apply. Formal statement of the algorithms can be found in the references cited.
Interacting Agents in Networks: E-Auction and Emergence in E-Marketing
Authors: V. K. Murthy, E. V. Krishnamurthy
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

This paper describes how a set of agents can be used for collaboration in E-marketing and E-Auction. We have formalized an integrated model consisting of the salient features of several agent paradigms, and link it with the distributed software engineering methodology. The integrated model proposed here has the simplicity and adaptability for realisation as a distributed transaction-based paradigm for negotiation and other E-marketing problems. Also it can provide an insight into the self-organized criticality in a network of agents.
On foundations of information science: Theoretical aspects and simulation
Authors: Jack Belzer
Venue: Proceedings of the ACM '82 conference (1982)

A department of systematized knowledge as an object of study is a science. Information science is such a department concerned with all aspects of information. The knowledge deals with the operation of general laws under rigorous conditions, the results of which are reproducible. A theory is a set of interrelated constructs, definitions and propositions that present a systematic view of phenomena by specifying relations among variables, with a purpose of explaining and predicting phenomena. Theory enables one to explain and to predict. When theories exist, based on which behavior of phenomena in a particular science can be explained and predicted with accuracy, these theories form foundations for that science. Theories which withstand the tests of internal consistency, i.e., create no contradictions, are subjected to empirical tests, and are accepted by its peers, become law. In physics, Newton's law of motion and Maxwell's laws of electromagnetics set foundations for the science of physics in two of its aspects. Sometimes theories are discovered in one field which are applicable in another field. Such theories can become a base for foundations in both fields. Information and Communication Theory of Shannon is such a theory. [1]
A topologically based non-minimum distance routing algorithm
Authors: Michel T. Doreau, Luther C. Abel
Venue: Proceedings of the 15th Design Automation Conference (1978)

In this paper, a unique topologically based non-minimum distance routing algorithm is presented. It offers both maximal completion rates and minimal via usage. The algorithm is based on a topological transformation of a significant subset of the PC routing problem: A broad channel encompassing a full row of DIPs and all routes within it. This transformation eliminates the need to consider detailed path shapes during routing. The routing problem is transformed into a permutation of nets. It is coupled with a backtrack search to produce a powerful routing algorithm. The search is conducted in a planar environment.
The predicate elimination strategy in theorem proving
Authors: Raymond Reiter
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

The predicate elimination strategy is a complete resolution proof strategy for multi-predicate formulas. Essentially, the procedure focuses on one of the predicate symbols P, and attempts to deduce clauses independent of P by means of resolution in which only predicates in P are &ldquo;resolved away&rdquo; from parent clauses. The completeness theorem states that one can in this way, deduce an unsatisfiable P-independent set of clauses, provided the given set is unsatisfiable. The strategy is then extended to a suitable form of semantic resolution. This leads to the following strategy: in the attempt to deduce an unsatisfiable P-independent set of clauses, apply elementary resolution to &ldquo;resolve away&rdquo; predicates in P only from parent clauses, one of which has all of its predicates in P positive (negative).
Minimal multitasking operating systems for real-time controllers
Authors: Geoffrey H. Kuenning
Venue: Proceedings of the 1981 ACM SIGSMALL symposium on Small systems and SIGMOD workshop on Small database systems (1981)

In many dedicated microprocessor applications, a full-feature operating system is not required. A methodology is presented for the design of extremely minimal operating systems for such applications. The emphasis is on providing the most basic facilities quickly, without precluding later improvements and additions.
Product distribution: The transshipment problem
Authors: John B. Vinturella
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

The common-carrier distribution network for the Luzianne food product line is discussed, along with modifications under consideration. Considerations governing the design of a simulation model of the network are enumerated. The Distribution Simulator (DSIM) developed for this application is then described and early computational experience included.
IBM system/38&mdash;an IBM usability experience
Authors: David E. Peterson, J Howard Botterill
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Although advancing technology is making more and more complex systems available to the small-system user, the interface between the user and such systems cannot become correspondingly more complex. Instead, the interface must become easier to use so that more people can take advantage of the richer function. In the small business environment, in particular, it is crucial that new systems be usable by a customer's current staff and not require the addition of new and sophisticated data processing expertise. Personnel costs already comprise 45-50% of most data processing budgets (1). Much of the ease-of-use of smaller systems has been due to their limited function. The user has been able to learn to use the system interfaces because each interface involved only a few functions and the interfaces were few in number. Conversely, very large and complex systems have traditionally been programmed and managed by high powered, highly trained staffs with the resources and the sophistication to cope with complex challenges. Here too, however, the high cost and the limited availability of such people increase the need for ease-of-use breakthroughs(5).
Dynamic algebras and the nature of induction
Authors: V. R. Pratt
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

Dynamic algebras constitute the variety (equationally defined class) of models of the Segerberg axioms for propositional dynamic logic. We obtain the following results (to within inseparability). (i) In any dynamic algebra * is reflexive transitive closure. (ii) Every free dynamic algebra can be factored into finite dynamic algebras. (iii) Every finite dynamic algebra is isomorphic to a Kripke structure. (ii) and (iii) imply Parikh's completeness theorem for the Segerberg axioms. We also present an approach to treating the inductive aspect of recursion within dynamic algebras.
Dynamic restructuring in an experimental operating system
Authors: Hannes Goullon, Rainer Isle, Klaus-Peter Löhr
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

A well structured system can easily be understood and modified. Moreover, it may lend itself even to dynamic modification: under special conditions, the possibility of changing system parts while the system is running can be provided at little additional cost. Our approach to the design of dynamically modifiable systems is based on the principle of data abstraction applied to types and modules. It allows for dynamic replacement or restructuring of a module's implementation if this does not affect its specification (or if it leads to some kind of compatible specification). The fundamental principles of such "replugging" are exhibited, and the implementation of a replugging facility for an experimental operating system on a PDP-11/40E is described.
An inversion algorithm for geometric models
Authors: Martti Mäntylä
Venue: ACM SIGGRAPH Computer Graphics (1982)

Instead of storing boundary models of solids directly into a data base, it would be advantageous to map them first into a simpler form. This approach calls for a procedure called in this paper the inversion algorithm of a geometric model. We present and analyze an inversion algorithm which constructs a sequence of Euler Operators capable of creating a given boundary representation. The algorithm is completely based on the use of Euler Operators enabling us to keep the algorithm simple and to hide implementation and data structure details.
Overview and status of DoradoLisp
Authors: Richard R. Burton, L. M. Masinter, Daniel G. Bobrow, Willie Sue Haugeland, Ronald M. Kaplan, B. A. Sheil
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

DoradoLisp is an implementation of the Interlisp programming system on a large personal computer. It has evolved from AltoLisp, an implementation on a less powerful machine. The major goal of the Dorado implementation was to eliminate the performance deficiencies of the previous system. This paper describes the current status of the system and discusses some of the issues that arose during its implementation. Among the techniques that helped us meet our performance goal were transferring much of the kernel software into Lisp, intensive use of performance measurement tools to determine the areas of worst performance, and use of the Interlisp programming environment to allow rapid and widespread improvements to the system code. The paper lists some areas in which performance was critical and offers some observations on how our experience might be useful to other implementations of Interlisp.
Hierarchical design verification for large digital systems
Authors: Tohru Sasaki, Akihiko Yamada, Toshinori Aoyama, Katsutoshi Hasegawa, Shunichi Kato, Shinichi Sato
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper describes a hierarchical design verification system, consisting of a logic verification subsystem, MIXS (1), a timing verification sybsystem, NELTAS(2), and a hierarchical data base. MIXS is a mixed level simulator, which can handle both functional and chip or gate level models with a unified simulation mechanism based on &ldquo;node&rdquo; model concept. NELTAS analizes delay time by tracing logical paths and calculating their media delay time. Both subsystems have hierarchical processing capability.
An experimental investigation of scheduling strategies for UNIX
Authors: Darwyn R. Peachey, Richard B. Bunt, Carey L. Williamson, Tim B. Brecht
Venue: ACM SIGMETRICS Performance Evaluation Review (1984)

The scheduler used in an operating system is an important factor in the performance of the system under heavy load. This paper describes the scheduling philosophy employed in the UNIX operating system and outlines the standard scheduling strategies. Modified strategies which address deficiencies in the standard strategies are described. The effectiveness of these modified strategies is assessed by means of performance experiments.
Validation of an airport simulation model
Authors: Judith F. Gilsinn
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

This paper describes the validation of an airport simulation model, called DELCAP for DELay CAPacity, the two quantities which it measures, for use in estimating the traffic rates attainable at major busy U.S. airports. The simulation model out-puts are compared to those of other models for simple cases to which both apply and to actual throughput data for several airports, with differences usually less than 6 to 8 percent.
Integrated simulation support system concepts and examples
Authors: Charles R. Standridge, A. Alan B. Pritsker, Jean O'Reilly
Venue: Proceedings of the 17th annual symposium on Simulation (1984)

New simulation software needs to provide a framework for performing entire simulation studies, to recognize that individuals who build models are typically not the individuals who perform the simulation experiments with models, and to support analysts who have only a basic level of computer technical skills. Pritsker Associates has developed a fourth generation integrated simulation support system for SLAM II which meets these objectives.
A MicroNET application
Authors: William R. Lilegdon, Joseph J. Talavage
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

MicroNET is a complete network simulation system designed specifically for microcomputers. Models of a wide variety of systems can be built, simulated, and analyzed using MicroNET's network approach. A network model is a graphical representation of a problem situation, that provides input data to the system and a means for describing the problem. Models are built by describing the problem situation graphically using MicroNET modeling symbols. These symbols are linked together and provide a graphic description of the problem situation. The MicroNET symbols translate directly into input statements that are recognized by the software. The MicroNET software uses a simulation procedure to analyze the network models. This procedure involves the generation of transactions, the processing of the transactions through the network, and the collection and reporting of statistical information. The MicroNET modeler interacts with the software through the system interface. The MicroNET system interface provides a structured approach to analyzing systems using simulation. Models are built, simulated, and analyzed interactively using this interface. MicroNET divides the tasks involved in solving problems using network modeling into three subsystems: CONTROL, DEVELOPMENT, and EXECUTION. For each subsystem MicroNET provides a corresponding set of commands that perform the required tasks. To initiate any action, the user responds to a prompt from the system by entering the command for the action desired. The CONTROL subsystem provides model management assistance. It allows models to be copied, deleted, and appended to one another. Using the CONTROL subsystem commands, the MicroNET system can be tailored to utilize additional memory and a parallel printer. The DEVELOPMENT subsystem supports the creation and modification of MicroNET network models with full editing capabilities. Commands are also included to display the contents of any MicroNET model on the screen or printer. Execution and analysis of MicroNET network models is performed using the EXECUTION subsystem. Commands are available to simulate a network model and display ongoing statistical information during model execution. Statistical reports may be prepared from this subsystem and presented at the screen or printer. To describe the MicroNET approach to analyzing systems using network models we will discuss an example application. The example system is an automated inspection area. We will briefly describe the system, discuss the transition from system to model, review the model and its outputs and discuss the performance and application of the MicroNET software.
Implementation issues II (Session Summary)
Authors: Michael S. Kenniston, Jeanne Ferrante, Peter Fritzson, John D. Johnson, Steven Krane, Karl J. Ottenstein, Polle T. Zellweger
Venue: Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging (1983)

The panelists were asked to address three questions. The three sections below are summaries of the ideas discussed in response to each of these questions. 1. When debugging a program, what information about that program is important for presentation to the user? What techniques can the debugger use to determine such information? While helping to develop a debugger, John Johnson had observed many programmers using it, and had noticed two distinct styles of information gathering: &bull; Many programmers began by getting fairly small amounts of information. They simply wanted an overview of the &ldquo;flow&rdquo; of the program, in order to get a general understanding of its behavior. &bull; After suspicion had been narrowed down to- a particular area within the program, the users wanted as much information as possible, formatted nicely.
Computers in small colleges
Authors: Bruce K. Alcorn
Venue: Proceedings of the annual ACM SIGUCCS symposium on The administration and management of small-college computing centers (1972)

The impact of computers upon our society is increasing almost daily. This impact, while having reached most segments of our society, is greater in some areas than in others. In the field of higher education the impact is so extensive that the larger institutions could not operate without them. While computer usage by colleges and universities for the most part started in the larger schools, the pressures for such facilities are rapidly moving down into the smaller ones. They too have computing needs in administrative data processing, in instruction about and with computers, and for some research. In fact, the possession of computing facilities is sometimes used as an element in faculty and student recruiting. Terms such as &ldquo;small&rdquo; and &ldquo;large&rdquo; are relative. When referring to colleges in such terms, the description most often refers to student enrollment; however, it can also include variables such as number of levels of degree offerings, facilities, and financial strength. Here, a small college is one whose enrollment is less than 2500 and the highest level of offering is the bachelor's degree.
CONDUIT and user services
Authors: Jim Johnson
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

From a macroscopic view, the purpose of CONDUIT is to improve undergraduate education through use of the computer. Our approach to improvement is pluralistic; that is we seek to provide instructors with alternative methods and differing perspectives for presenting theory, concepts, methodology, and information. The proposition that I wish to propose, that computer centers should play a pivotal role in the improvement of instruction, requires more justification. The CONDUIT strategy is in part based upon this proposition so it is of more than academic interest to me. Since dichotomies are easy to grasp, the proposition will be phrased, &ldquo;should computer centers or departmental units provide computer-related services?&rdquo;
A comparative study of environments for database system implementation
Authors: M. Teresa Suarez Fernandez, H. Rex Hartson
Venue: Proceedings of the first SIGMINI symposium on Small systems (1978)

Two specific environments for implementation of experimental DataBase Management Systems (DBMS) are compared, especially in light of performance measurement: IBM 370 and HP-2100A. The HP-2100A was selected for a skeletal implementation to study performance parameters further. The DBMS structure, some performance results, and several difficulties encountered are described. The HP-2100A minicomputer did provide &ldquo;hands-on&rdquo; experience and more direct control to customize disk access routines. However, there were problems with performance measurement in both environments and the expected advantages of the minicomputer were not wholly realized. A specially constructed hardware timing clock would have improved the ability to measure I/O execution times in the HP-2100A.
Panel on advances in personal information retrieval
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

At the present time the existing operational information retrieval systems are designed to serve a diverse, remotely located user population by providing on-line access in real-time to large, centrally stored data bases. With the advent of the modern minicomputer storage and retrieval, services can also be extended on an individual basis to small, personal information files of the kind normally maintained in offices or private homes. The panel will review the state-of-the-art in personal retrieval systems and make predictions for the immediate future.
Analytic and simulative approaches to an electronic referenda&mdash;system occupancy problem
Authors: Peter Parkinson
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

Consider a referenda system in which questions are broadcast to domestic television and radio receivers and a measure of audience reaction returned to the broadcast distribution center electronically. Such a system might be used to gauge the popularity of programs, commercial products, sociopolitical opinions and new ideas. The return paths might form an independent and dedicated physical network or be carried over modified existing facilities such as CATV distribution and telephony networks.