ppxscal/embedding_network huggingface dataset:
Utility of data base management to analyze the output from complex simulations
Authors: Pamela E. Joseph, Stephen D. Roberts
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

The analysis of the outputs generated by high level simulation languages from complex systems models is often hindered by both the statistics collection capability of the simulation language and the foresight employed by the modeler in the model construction. Augmenting a simulation language (INS) with a database management system (GPLAN) is one method for alleviating the problems of data (event) inaccessibility and specific inquiry. The development of the data structure for use in filing the information generated during a simulation, the description of this structure to GPLAN via the data description language, and the use of the structure through the data manipulation language commands for storing and retrieving the information are described. The expanded capabilities for investigating the model become evident upon the description of the reports and the ease with which the reports may be expanded due to the modular design of the data base program. Also the modeler's investigation of some portion of the system or the entire system is enhanced since through the data base any piece of information that has been stored can be easily accessed. The result indicates that a data base management system can be used successfully to augment the use of simulation in the investigation of a complex system. Considerations regarding the computer execution time and storage are also presented.
A high level language extension for creating and controlling dynamic pictures
Authors: Gregory F. Pfister
Venue: ACM SIGGRAPH Computer Graphics (1976)

DALI (Display Algorithm Language Interpreter) is a special purpose high level programming language extension for the creation and control of dynamic pictures which exhibit complex static and dynamic interactions among their elements. DALI allows complex organizations of interpolated (&ldquo;smooth&rdquo;) change, discrete (&ldquo;sudden&rdquo;) change, and change to the structure of a picture to be generated in a modular way, in the sense that picture elements determine their own behavior and hence manner of change in a local manner. DALI pictures are composed of elements called picture modules. These are analogous to processes or procedural activations, and contain arbitrary event-driven procedures called daemons. Daemons, which are user-written, run under the control of scheduling rules based on the functional dependence of daemons on one another. These rules result in smooth inter-daemon (process) communication and cooperation with no implicit or explicit reference to semaphores or other synchronization primitives.
Getting into a system: External-internal task mapping analysis
Authors: Thomas P. Moran
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

A task analysis technique, called ETIT analysis, is introduced. It is based on the idea that tasks in the external world must be reformulated into the internal concepts of a computer system before the system can be used. The analysis is in the form of a mapping between sets of external tasks and internal tasks. An example analysis of several text editing systems is presented, and various properties of the systems are derived from the analysis. Further, it is shown how this analysis can be used to assess the potential transfer of knowledge from one system to another, i.e., how much knowing one system helps with learning another. Several issues are briefly discussed.
A proposed computer education curriculum for secondary school teachers
Authors: Harriet G. Taylor, James L. Poirot
Venue: ACM SIGCSE Bulletin (1984)

A 1983 study investigated the certification of high school computer science teachers. A major portion of the study was devoted to the identification of those computer science courses most appropriate for such teachers and, therefore, for certification programs. This paper presents the results of the study and proposes a computer education core curriculum based on those results.
Functional modelling for logic simulation
Authors: Peter G. Raeth, John M. Acken, Gary B. Lamont, John M. Borky
Venue: Proceedings of the 18th Design Automation Conference (1981)

As digital integrated circuits become more complex, Computer Aided Design (CAD) must support more hierarchical design methods. Top-down design is supported in logic simulators by the inclusion of functional models. The SAndia LOGic Simulator (SALOGS) has functional modelling capability but until now only as FORTRAN subroutines. The new Structural Interface to the SALOGS Language (SISL) allows the design engineer access to the functional modelling capabilities without requiring the associated programming skills. The SISL syntax is described and a sample functional model library is presented.
Interactive microprogram validation: A Prime 400 testbed facility
Authors: Phillip Crews, Laura Marie Leventhal
Venue: Proceedings of the 12th annual workshop on Microprogramming (1979)

This paper presents a solution to the problem of an inadequate microprogram testbed facility for the Prime 400 system, but more importantly, defines typical problems resulting from lack of good microprogram developement software in the university environment, and provides a model for their solution.
The device model of interaction
Authors: Ed Anson
Venue: ACM SIGGRAPH Computer Graphics (1982)

Any interactive system can be described in terms of the devices it involves, and their interconnections. Similarly, each device can be described in terms of simpler devices and their interconnections. Such descriptions are strictly modular, and well structured. This observation allows any system to be described, at all levels, by the same language. Such descriptions have intuitive appeal for hardware as well as software components, and for process control applications as well as human-machine interaction. The Device model of interaction, as described here, can ease the job of designing user- friendly interactive systems, and can be adapted for automatic compilation. As an example, the design of an actual system component is discussed. The design is presented, at several levels, in a Pascal-like notation. It represents a module created to provide a human-machine interface via a graphic tablet, keyboard and video monitor.
Alternating semantic evaluator
Authors: Mehdi Jazayeri, Kenneth G. Walter
Venue: Proceedings of the 1975 annual conference (1975)

In order to make the use of attribute grammars practical in (automatic) compiler generation, restricted attribute grammars are introduced. A membership test is given which determines whether a given attribute grammar satisfies the required restrictions. The major advantage of the restricted attribute grammars is that they are non-circular. The given membership test can be embedded in a compiler writing system which accepts an attribute grammar as input and outputs a compiler for the associated language provided the grammar meets the restrictions. The technique is also applicable to translation grammars of [15]. It is assumed that the reader is familiar with context free grammars but not necessarily with attribute grammars.
System description for an improved information processing machine
Authors: R. S. Barton
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Control functions in computer systems have received too little attention from designers. This paper deals with aspects of sequence control, storage allocation, input-output control, and multiple processing. The design concepts lead to a machine with improved programming and operating characteristics. The search for rational bases for functional machine design is at least as important as attempts to standardize machine-independent source languages or to devise a &ldquo;universal&rdquo; language to express the arbitrary characteristics of the variations of the traditional computer.
Programmable formatting of program text: Experiences drawn from the TAMPR system
Authors: Kenneth W. Dritz
Venue: Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software (1978)

The TAMPR System originated as an approach to the problem of automating the routine modifications of Fortran source programs required to adapt them to a variety of uses or environments [1]**. Overall, the system accomplishes such modifications by applying transformations to Fortran programs at the source level. But the process differs markedly, in detail, from string-based editing or macro expansion. Three steps are involved: (1) A Fortran source program is processed by the TAMPR Recognizer, yielding essentially a parse tree called the abstract form. (2) The Transformation Interpreter applies IGT's (Intragrammatical Transformations) to the abstract form as tree operations [2]. (3) The abstract form is then reconverted to source program form by the Formatter. By ensuring that the transformations are applied only to the correct syntactic entities and only in the intended contexts, the use of the abstract form greatly simplifies establishing the reliability of the overall process.
Management information systems: Industrial production and digital computers
Authors: O. I. Franksen, M. D. Romer
Venue: Proceedings of the 1965 20th national conference (1965)

SOME OF THE MAIN problems in automating total data processing systems in industry, arise from the more complex problem areas. These areas include many of the so-called engineering design problems and also a majority of the higher level management decision processes in an industrial enterprise. These problem areas are normally dealt with by highly qualified personnel and are quite often presumed not to be automatable. The fact is that many theoretical schools are working on the development of more generalized approaches to handle these areas by means of computers. This paper suggests that the experiences from engineering design problems could be extended to a much broader class of problems including management decision processes. This broader class of problems is identified in terms of an abstract formulation of a concept of design. For a design problem, in the above sense, it is possible to state the prerequisites for obtaining a computerized solution in part or totally. When, in a specific industrial enterprise, the different problem areas are divided into elements, definable as design problems, it is possible to state the technically practicable, but not necessarily economically feasible, applications of computers in the enterprise concerned.
Automation of design for uncommitted logic array
Authors: Frank R. Ramsay
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper explains the design automation strategy developed at the Ferranti Electronics C.A.D. Centre for the Uncommitted Logic Array (U.L.A.). This strategy was to develop a modular automated design system for the single layer metallisation U.L.A.'s which automatically referred a central design document - the logic diagram. The system handles the function of auto layout and checking. It also links into the logic analysis and test schedule verification system.
Universal circuits (Preliminary Report)
Authors: Leslie G. Valiant
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

We show that there is a combinational (acyclic) Boolean circuit of complexity 0(slog s), that can be made to compute any Boolean function of complexity s by setting its specially designated set of control inputs to appropriate fixed values. We investigate the construction of such &ldquo;universal circuits&rdquo; further so as to exhibit directions in which refinements of the asymptotic multiplicative constant factor in the complexity bound can be found. In this pursuit useful detailed guidance is provided by available lower bound arguments. In the final section we discuss some other problems in computational complexity that can be related directly to the graph-theoretic ideas behind our constructions. For motivation we start by illustrating some of the applications of universal circuits themselves.
A look at state and local information system efforts
Authors: Kenneth J. Dueker
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The need for State and Local Information Systems stems from intuitive feelings that decision-makers, researchers, and planners require more accessible and timely information. Yet, there is little general agreement as to the general nature of information systems. There exist many areas of emphasis&mdash;document retrieval systems, financial reporting systems, land use data systems, data relating to economic or social areas, and many others. State and Local Information Systems efforts have met with only partial success. Planners and public administrators tend to collect data in systems or data banks, which bear little relationship to the problems or decisions at hand. They have no models in mind for use of these data. Conversely, researchers and analysts collect data for a specific &ldquo;once-only&rdquo; problem or study; the data may have other potential uses, but because of the way they are collected and organized cannot serve other needs.
Automation of sheet metal design and manufacturing
Authors: David W. Currier
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper discusses operating procedures and programming for the automation of design and manufacturing of formed sheet metal parts. It's primary purpose is to examine the design procedure, programming and N/C data preparation used on an existing 3-D graphics system. The process relies on the accuracy, reliability, and speed of CAD/CAM.
On k-hulls and related problems
Authors: Richard Cole, Micha Sharir, Chee K. Yap
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

For any set X of points (in any dimension) and any k &equil; 1,2, ..., we introduce the concept of the k-hull of X. This unifies the well-known notion of 'convex hulls' with the notion of 'centers' recently introduced by F.F. Yao. The concept is intimately related to some other concepts (k-belts, k-sets) studied by Edelsbrunner, Welzl, Lov&aacute;sz, Erd&ouml;s and others. Several computational problems related to k-hulls are studied here. Some of our algorithms are of interest in themselves because of the techniques employed; in particular, the 'parametric' searching technique of Megiddo is used in a nontrivial way. We will also extend Megiddo's technique to Las Vegas algorithms. Our results have applications to a variety of problems in computational geometry: efficient computation of the 'cut' guaranteed by the classical 'Ham Sandwich theorem', faster preprocessing time for polygon retrieval, and theoretical improvements to a problem of intersecting lines and points posed by Hopcroft.
Touch-Tone input techniques: Data entry using a constrained keyboard
Authors: E. J. Desautels, S. B. Soffer
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

The problems involved in using a smaller alphabet than that naturally called for are investigated, with attention focussed on the use of 12 digit keyboards such as found on Touch-Tone (trademark reg.) telephones. The feasibility of avoiding the use of codebooks or user encodings is examined for some medical information systems, and a technique to minimize redundant inputs is described.
A comparative analysis of financial modeling languages
Authors: John M. Lewis
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

The increasing popularity of financial reporting and modeling systems, along with the myriad of opportunities in this field, has left many a prospective user asking the question: &ldquo;Where do I begin?&rdquo; The user needs guidelines for a selection process and a general comparison of alternatives available in the financial systems area. The steps of the selection process include: defining financial requirements and needs; establishing general and specific criteria; and, finally, comparing alternatives offered by vendors and their products. Using a &ldquo;new product&rdquo; problem as a means of exploring the various systems' approaches, this paper presents examples of coding so that the user can evaluate the difference in working with several types of systems. Included are programming and APL based languages, FORTRAN based systems, numerically coded systems and interpretive English language systems. The actual cost comparisons of running the new product problem on twenty-one systems concludes the paper.
TAO: A fast interpreter-centered system on LISP machine ELIS
Authors: Hiroshi G. Okuno, Ikuo Takeuchi, Nobuyasu Osato, Yasushi Hibino, Kazufumi Watanabe
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

This paper describes the design issue, implementation and performance of a Lisp called TAO for the Lisp machine ELIS. TAO is a dialect of Lisp which unifies an object-oriented programming paradigm and a logic programming paradigm with a procedural programming paradigm. Since the interpreter is implemented fully by microcode, interpreted code runs faster than most of other dedicated machines.
Coverage-Aware Proxy Placement for Dynamic Content Management over the Internet
Authors: Srivatsan Varadarajan, Raja Harinath, Jaideep Srivastava, Zhi-Li Zhang
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

In an effort to differentiate service quality, service providers have resorted to employing Content Distribution Networks (CDNs) over the Internet. CDNs deploy geographically distributed proxy servers which manage content on behalf of the service provider's servers for better performance and enhanced availability.In this paper we explore the proxy placement problem for content distribution over the Internet. Its goal is to strategically place a number of proxies in the network to optimize certaincriteria which improve performance of proxies. We motivate the various necessary factors and constraints that need to be taken into account for a good placement of proxies over the Internet which re.ect real world scenario more accurately and which we claim hitherto has not been completely addressed. We introduce a novel concept of host coverage characterizing every Autonomous Systems (AS) and use this stable, coarse grained measure as a long-term estimate of the load being serviced by the proxy system. We then pose an optimal formulation of the proxy placement problem taking into consideration all the relevant factors. We propose a couple of proxy placement algorithms that solve the above problem and analyze their behavior. Finally we present the performance of those algorithms against the optimal solution and other schemes proposed in literature. We also study the stability of the proposed algorithms through a variety of experiments.
PROUST: Knowledge-based program understanding
Authors: W. Lewis Johnson, Elliot Soloway
Venue: Proceedings of the 7th international conference on Software engineering (1984)

This paper1 describes a program called PROUST which does on- line analysis and understanding of Pascal programs written by novice programmers. PROUST takes as input a program and a non-algorithmic description of the program requirements, and finds the most likely mapping-between the requirements and the code. This mapping is in essence a reconstruction of the design and implementation steps that the programmer went through in writing the program. A knowledge base of programming plans and strategies, together with common bugs associated with them, is used in constructing this mapping. Bugs are discovered in the process of relating plans to the code; PROUST can therefore give deep explanations of program bugs by relating the buggy code to its underlying intentions.
Sensitivity of integrated voice and data networks to traffic and design variables
Authors: I. Gitman, B. Occhiogrosso, W. Hsieh
Venue: Proceedings of the sixth symposium on Data communications (1979)

This paper presents quantitative results of cost/performance studies of circuit-switching, packet-switching, and hybrid (circuit/packet) switching technologies. The results expose the cost difference for alternative realizations and usage of a given network technology.
A two asset cash flow simulation model
Authors: Richard C. Grinold, Robert M. Oliver
Venue: Proceedings of the 6th conference on Winter simulation (1973)

We present an APL PLUS simulation model of a two asset cash management system. The two assets are cash and an income producing portfolio. The model relates cash transfer policies and futures stocks of cash and income producing assets to restrictions on average and minimum balances, projections of future cash flows, the costs of cash management, and user specified objectives.
A critique of multiprocessing von Neumann style
Authors: Arvind, Robert A. Iannucci
Venue: Proceedings of the 10th annual international symposium on Computer architecture (1983)

In recent years, there have been many attempts to construct multiple-processor computer systems. The majority of these systems are based on von Neumann style uniprocessors. To exploit the parallelism in algorithms, any high performance multiprocessor system must, however, address two very basic issues-the ability to tolerate long latencies for memory requests and the ability to achieve unconstrained, yet synchronized, access to shared data. In this paper, we define these two problems, and examine the ways in which they are addressed by some of the current and past von Neumann multiprocessor projects. We then proceed to hypothesize that the problems cannot be solved in a von Neumann context. We offer the data flow model as one possible alternative, and we describe our research in this area.
GSP: A logic simulator for LSI
Authors: J. R. Armstrong, D. E. Devlin
Venue: Proceedings of the 18th Design Automation Conference (1981)

A general simulation program for LSI devices is described. The program provides functional simulation capability as well as the ability to simulate chip interface timing. Chip modeling utilizes chip input/output specifications and timing diagrams. Construction and coding of the model is a process very much akin to assembly language programming. GSP is a program suitable for the simulation of LSI devices as it allows for a manageable amount of detail in model descriptions and can simulate with an efficiency that is adequate for system validation activities.
A behavioral model and triggering modes for MVL R-flops
Authors: Michael S. Wills
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

A variety of multi-valued logic R-flop designs have been published to date, most of which were relatively ad hoc in nature, and were not based on any underlying theory of multistable behavior. Several of these designs also exhibited incorrect triggering, if proper response to intermediate signal values was required. This paper develops a multistable behavioral model and triggering mode definitions based on observations of the binary flip-flop. It uses this model, along with other observations on R-flop behavior, to design several R-flops, and to use these R-flops in counter and shift register designs.
Effective industrial finishing systems design utilizing
Authors: Sally J. Hill, Doris Klein
Venue: Proceedings of the 16th conference on Winter simulation (1984)

The use of simulation techniques in designing a fiberglass hood paint system is demonstrated. Two alternate designs are described and analyzed as to float requirements. Due to schedule considerations in maintaining job sequence, the first design was determined impractical. The results of both analyses will be presented in the conference session.