ppxscal/embedding_network huggingface dataset:
Simulating warehouse layout patterns in order to improve cube utilization
Authors: Richard W. Garrett
Venue: Proceedings of the second conference on Applications of simulations (1968)

The nature of the pharmaceutical industry, with its stringent controls, forces special operating procedures throughout the manufacturing cycle. One recently adopted procedure deals with our raw materials warehouse. The basis of the space control system is this: Once a group of pallets, all with the same vendor's lot number, is stored in a sub-bay, nothing else is stored in that sub-bay until the last pallet of the original material is withdrawn. The decision variables that affect the performance of the warehouse describe the floor configuration. Of course, the program allows the floor to be laid out in many different ways in order to note the influence of the different layouts on our performance statistics. It must be pointed out that this simulation is not concerned with anything other than cube utilization; i.e., the location of products for rapid or slow retrieval is not considered. It is the purpose of the program to find the point at which the loss of usable cube taken up by aisles equals the savings realized by better cube utilization.
Some remarks on new instances and garbage collection
Authors: Péter Szöke
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

Some questions of run-time storage management for ALGOL 68 are discussed. In the first section it is shown that in many cases copying of already existing values is not necessary, in spite of the fact that the Report prescribes this. The second section gives a new approach for finding the starting points for tracing the lists of values during garbage collection. In the third section we introduce a new area (in addition to the stack and the heap) for making the garbage collection process less expensive. The fourth section describes the general memory organization: stack, heap and bubble.
The complexity of control structures and data structures
Authors: R. J. Lipton, S. C. Eisenstat, R. A. DeMillo
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

The running time or computational complexity of a sequential process is usually determined by summing weights attached to the basic operations from which the process is derived. In practice, however, the complexity is often limited by how efficiently it can access its data structures and how efficiently it can control program flow. Furthermore, it has been extensively argued [4] that certain limitations on the process sequencing mechanisms available to the programmer result in more &ldquo;efficient&rdquo; representations for the underlying processes. In this paper we will examine these issues in an attempt to assess the &ldquo;power&rdquo; of various data and control structures.
Dames an integrated systems approach to computer-aided design of electronic systems
Authors: Robert Lewis, Ronald Segal
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

Parallel with the increasing acceptance and utilization of microelectronic techniques has come a corresponding increase in the complexity of required circuits and in the number of factors to be considered when formulating and implementing a design. When one considers that many steps in the design process are repetitive, and that data gathering and documentation occupy the largest percent of the engineering time-cycle, it becomes clear that more help can and must be provided for the designer in the form of computer aids. If the full potential power of computers is to be realized in the design and production of electronic systems in tomorrow's industrial environment, an integrated systems approach must be derived. Under a study contract with the Air Force*, a concept known as &ldquo;DAMES&rdquo; (Design Automation for the Manufacture of Electronic Systems) has been developed o overcome current limitation, and provide a base for evolution and expansion to accommodate future needs. This paper describes the needs and environment for such a system, the general DAMES approach, and an initial version which could be implemented using currently available hardware and software.
The Consul/CUE interface: An integrated interactive environment
Authors: T. Kaczmarek, W. Mark, N. Sondheimer
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

Consul and CUE are two systems that combine to support an interface to interactive computer services that is integrated across a variety of interface methods. Consul is an experimental natural language interface system designed to be customized to a set of specific interactive computer services: electronic mail, personal calendar, word processing, etc. CUE is a window- and object-based run-time support environment for interactive services with a command language, pointing device and menu interface. Using the Consul/CUE interface, the user sees a single system that is capable of handling a wide variety of input in a completely uniform service environment. The success of the combined system derives from a large knowledge base formalizing facts in the interactive service environment in an artificial intelligence network structure.
Dynamic linking and environment initialization in a multi-domain process.
Authors: Philippe A. Janson
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

As part of an effort to engineer a security kernel for Multics, the dynamic linker has been removed from the domain of the security kernel. The resulting implementation of the dynamic linking function requires minimal security kernel support and is consistent with the principle of least privilege. In the course of the project, the dynamic linker was found to implement not only a linking function, but also an environment initialization function for executing procedures. This report presents an analysis of dynamic linking and environment initialization in a multi-domain process, isolating three sets of functions requiring different sets of access privileges. A design based on this decomposition of the dynamic linking and environment initialization functions is presented.
Artificial languages: Translation of compiler languages
Authors: J. J. Allen, D. P. Moore, H. P. Rogoway
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

JUST AS COMPILERS have eased the transition from one computer to another, source program translators ease the transition from one compiler to another. SIFT, the SHARE Internal FORTRAN Translator, is a FORTRAN program to translate FORTRAN II source programs into FORTRAN IV language. It is the result of a cooperative effort by several installations.
Control Separation in programming languages
Authors: Michael J. Lemon, Gary Lindstrom, Mary Lou Soffa
Venue: Proceedings of the 1977 annual conference (1977)

Control separation in a higher-level programming language (HLL) involves the factorization of that HLL's components into two distinct categories: the data-related and the control-related. The conceptual and practical utility of such a separation is examined through a case study, the Coroutine PASCAL system. The control component of an initially restricted subset of PASCAL was specified through the Control Description and Implementation Language CDIL. This definition then became the control portion of a running interpreter, with the data-related component expressed in ordinary PASCAL. Both the control description and the running interpreter were then extended, first to PASCAL with procedures, and then beyond, to Coroutine PASCAL. The resulting system has been useful as an expository tool, as a vehicle for control structure experimentation, and as a facility for empirical studies on run-time storage management strategies.
Message design&mdash;graphic display strategies for instruction
Authors: Edward E. Green
Venue: Proceedings of the 1976 annual conference (1976)

Message design is concerned with the clarity, accuracy, and conciseness of messages and their design as a visual perception. Because so many variables exist in visualized instruction studies, a single theory to predict learning efficiency and effectiveness is virtually impossible. The effect of instruction seems to be a matter of types of visuals used, methods of cueing, relevant student characteristics, methods of presentation, type of educational objectives achieved, and a whole host of sociological, psychological and environmental factors. Research in this as a behavioral science is thus more useful when it is localized to cater to specific situational requirements. A need also exists to match these with the main criteria of good message design which is a subset of instructional systems design. This article explains what message designers can do to (1) attract learner attention to displays, (2) hold their attention, and (3) provide adequate cueing devices for efficient and effective learning to take place.
Who's who in computer users and services
Authors: Richard H. Baum
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

Out there in our worlds of academia are countless numbers of individuals, groups, classes, and offices comprised of faculty, staff, and students who at one time or another may consider using or have a need to make use of computer-related services. What do they seek and need? Where will they search? And, what kinds of service will they receive? Concurrently, this reference to service suggests that there are, or ought to be, certain kinds of resources&mdash;physical facilities, equipment, and manpower&mdash;which are currently or potentially available. The paper itself is organized into five areas of need identified by us, or others (particularly Robbins, Dorn, and Skelton in Who Runs the Computer?), as being critical needs which are common to both the user and the provider of service. Within each of these areas, we focus on an observation which we think members of both groups will be willing to accept as a truism regarding computing needs and usage. Each of these observations have, in turn, led us to observe patterns of behavior for both users and providers which we describe in the form of a game.
Database sharing: A study of interference, roadblock and deadlock
Authors: J. E. Shemer, A. J. Collmeyer
Venue: Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control (1972)

It is the purpose of this paper to examine the problems of contention which arise naturally when a number of programs are granted simultaneous access to a database for the purpose of update as well as inquiry. A LOCK-UNLOCK mechanism, applied at the group (or record) level is assumed. Incremental allocation of groups is permitted; hence deadlocks are possible. Of particular interest are the frequencies of three events: 1) Interference 2) Roadblock 3) Deadlock While none of these events constitutes a threat to the integrity of the database, each is a potential contributor to degraded performance. The justification of a LOCK-UNLOCK mechanism is thus predicated on acceptably low frequencies for each of the foregoing events. To measure these frequencies, a simulation study was undertaken. The results of this study, together with a description of the simulation, are presented.
Cost effective layout digitizing and mask pen plotting of custom microelectronic devices
Authors: Robert P. Larsen
Venue: Proceedings of the 14th Design Automation Conference (1977)

This paper discusses the concepts and philosophy underlying a layout digitizing and mask pen plotting system developed by Rockwell International for custom microelectronic devices. It is a system composed of high reliability components requiring minimal maintenance. The software has been implemented to provide extremely simple methodologies enabling the device designer to perform the requisite procedures in an informal operating environment. This system has proven to be extremely cost effective in our computer-aided design environment.
Tasking in standard PL/I
Authors: M. Donald MacLaren
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

This paper describes the treatment of asynchronous processing in &ldquo;Standard PL/I&rdquo; and how it is related to the &ldquo;old language&rdquo;. By &ldquo;Standard PL/I&rdquo; we mean the language being developed by American National Standards Institute Committee X3J1 and European Computer Manufacturers Association Committee TC10. Currently this language is scheduled for publication as a proposed standard in December 1973. By the &ldquo;old language&rdquo; we mean that subset of IBM's PL/I which the standards committees took as the starting point for their work. In the area of asynchronous processing, the development from old language to Standard PL/I was carried out by X3J12, the language development subcommittee of X3J1.
Direct microprogrammed execution of the intermediate text from a high-level language compiler
Authors: Francois Robert Broca, Richard E. Merwin
Venue: ACM SIGPLAN Notices (1974)

Microprogramming commonly executed operations can improve the computational speed of data processing systems. This paper describes how microprogramming may be used to execute directly the intermediate text generated by a high-level language compiler after syntactic and semantic analysis of the input source program. Direct microprogrammed execution of common forms of intermediate text - i.e.: quadruples, triples, and duos - has been simulated. A comparison is made, in terms of storage requirements and execution time, of this direct microprogrammed system scheme with the present methods which result in machine language representation and execution of the intermediate text. Direct generation of a microprogram from the high-level language statements is also examined. Timing assumptions for comparative purposes have been based on the IBM 360 MOD 50 system. Simulation and timing estimates for the microprograms have been carried out on a microprogram directed simulator which closely represents the architectural organization of the MOD 50.
An information Algebra
Authors: R. Bosak
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

The Algebra is concerned with three undefined concepts; entity, property, and value. Although these concepts are formally undefined, certain intuitive statements can be made. Data processing is the activity of maintaining and processing data to accomplish certain objectives. The data are collections of values of certain selected properties of certain selected entities. e.g. A payroll manager has many objectives of which the primary one is the payment of his employees (the entities). He selects certain properties such as employee number, name, sex, hourly payrate, and he maintains a file in which he records values of these properties for each entity.
The electronics engineer's design station
Authors: D. E. Bering
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper describes a prototype minicomputer interactive graphics system which has been developed for the capture, formatting and dissemination of electronics design information. The principal function of this system is to bring unification to the Design Automation activities at LLL, while incorporating human factors and modern tools into the electronics design process. The Electronics Engineer's Design Station (hereafter referred to as the Design Station) is a minicomputer based system at which LLL's engineers and designers sketch in schematic designs. Once a circuit is formed at the graphics display, the pertinent design information is extracted and used to produce schematic drawings, parts lists, signal lists, parts and signal cross references and assembly drawings as well as inputs to simulators, automated layout tools and fabrication devices. Current fabrication technologies supported include both Wirewrap and Printed Circuit methodologies. This system is designed to expedite the low volume, fast turnaround electronics designs which are typical of LLL's research projects. However, many of the concepts of this system address problems common throughout the electronics industry. The Design Station is now being used on a regular basis by a small number of the design engineers at LLL. Initial indications are that the Design Station has increased the utilization of other DA tools at LLL as well as reducing the elapsed time, introduced errors and documentation costs for our one-of-a-kind designs.
The design of a space efficient compiler
Authors: Michael K. Donegan
Venue: ACM SIGMINI Newsletter (1978)

Writing a compiler for a small machine with minimal software support can be quite difficult because the program is long and debugging aids are usually inadequate. In addition, the usual techniques for compiler writing tend to produce programs which are quite large when compared to, for example, a BASIC interpreter. This frustrates efforts for producing compilers on small machines. We describe a method which can be used to reduce the size of a compiler and simultaneously provide good debugging tools. The resulting compiler sacrifices little in terms of execution speed (in part because compilers on minicomputers are often I/O bound). We have used this method to write an MPL [1] compiler for a Microdata 32/S minicomputer. The compiler requires approximately 12K bytes of memory as opposed to 32K bytes required by the compiler produced by the manufacturer, and compiles at essentially the same speed. Appendix II outlines the syntax of the MPL language and is included to illustrate the size of the language being compiled. MPL is based on PL/I and is quite similar to the PL/M* [2] language developed by the INTEL Corporation. The method described here uses an interpretive language for writing the compiler. Thus the interpreter is the only machine language program written. We coded the interpreter in MPL and used a cross compiler to compile it, however, the interpreter could have been easily coded in assembly language. Figure 1 illustrates the savings of the interpretive language over machine code. The procedure IF_STAT is typical of a routine which might appear in a recursive descent compiler for MPL. The gain in space occurs because machine language instructions carry too much information content when applied to a special purpose (such as compiling). Note for example that a subroutine call for the Microdata requires 6 bytes, but all that is really needed is an opcode to indicate a call and a byte to indicate which of a few subroutines is to be called.
Discussion of branton paper
Authors: Jeanne C. Adams
Venue: Proceedings of the eleventh annual SIGCPS computer personnel research conference (1973)

We certainly need to talk about problems associated with the role of the operator in large scale, complex computer environments. The specialized role of operator has emerged as other roles have become similarly specialized in response to the increasing scale and complexity of computers themselves as well as the range and complexity of computational problems to be solved. Mr. Branton's paper discusses the need for enhancing the professional requirements for operators suggesting that more complex decisions are required in the operation of large systems. He advocates the establishment of a complete career path within operations and favors elimination of the notion that advancement for operators can be available only through entering the programming group. His justification for more pay and more professional recognition for operators is that the operator's job requires more complex decisions than before and correspondingly more training in today's large computer system. As he describes it, &ldquo;complex decisions&rdquo; seem to boil down to scheduling and resource allocation.
Middleware and Application Adaptation Requirements and Their Support in Pervasive Computing
Authors: Christian Becker, Gregor Schiele
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Pervasive computing environments are characterized by an additional heterogeneity compared to existing computing infrastructures. Devices ranging from small embedded systems to full-.edged computers are connected via spontaneously formed networks. In this paper we analyze requirements of applications and system software to cope with the dynamically changing execution environment. Based on our micro-broker-based middleware BASE a component framework for pervasive computing supporting application adaptation is proposed.
A design automation system for printed circuit board assemblies
Authors: A. Bobas, J. Valihora
Venue: Proceedings of the 14th Design Automation Conference (1977)

An interactive system of design and documentation aids called COPES' (Customer Optimized Product Engineering System) is discussed with respect to its application to printed circuit board assemblies. The COPES system features an integrated set of software including a schematic editor, a placement and routing package, report generators, a file storage facility plus simulation and testing systems. The COPES system is implemented on an IBM 370/168 and a DEC PDP 11/70 with storage tubes for interactive graphics work. The paper discusses the system concepts and operational experience in bringing the COPES system to production use. The prime emphasis in the paper is the development and application of the COPES system from a user point of view. A summary of current results is presented with an indication of future development of the system.
Some correctness principles for machine language programs and microprograms
Authors: W. D. Maurer
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

A machine-language program, or a microprogram implemented in writable control store, may modify itself. In order to prove the correctness of such a program, we must take this into account. Even if the program does not modify itself, we must prove this. Sometimes this may be done by looking at the individual instructions of the program; sometimes it must be tied in with the proof of correctness of the program. We state here, and illustrate by examples, certain principles for proving the correctness of programs and microprograms under these conditions. The principles are extensions to the standard inductive assertion method.
Simulation of spatio-temporal visual evoked EEG's
Authors: D. G. Childers, O. S. Halpeny, W. Mesa, N. W. Perry,  Jr.
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

The relationship between scalp potentials evoked by visual stimulation and neuronal functioning is examined. A neuronal population model for the electrogenesis of the evoked surface potentials is developed which relies on the hypothesis that the surface potentials may arise from a combination of excitatory post synaptic potentials (EPSPs) and inhibitory post synaptic potentials (IPSPs) firing both at different depths and at different latencies. The model can be used to determine the location (depth and radial coordinates) of the sources and the approximate size of the neuronal population giving rise to the potential. The spatio-temporal potential fields evoked by visual stimulation and monitored by an array of scalp electrodes over the occipital cortex are then discussed along with our method for displaying these fields via contour maps. The experimental data are then computer simulated via discrete spatially disparate sources whose waveform parameters are related to the underlying neuronal activity. The waveform of each of the neuronal population sources is determined and the various parameters of the waveform are related to the major characteristics of the spatio-temporal visual evoked potential fields as well as to specific features of the neuronal population. The latter includes the sequence of neuronal excitation, the amplitude of excitatory current, the depth of the neuronal population, and the period of activity of the EPSP and IPSP.