ppxscal/embedding_network huggingface dataset:
Applications of simulation in project management
Authors: John E. Hebert
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

Van Slyke introduced simulation as a method for the analysis of project networks in 1963. Since that time many new simulation procedures have been developed and/or adapted for use in project management. The purpose of this paper is to review the traditional simulation procedures that have been applied to project management and to present and discuss new developments regarding the application of simulation to project management. Specifically, this paper will include coverage of simulation as it relates to PERT networks, GERT project networks, and project control systems, i.e., the simulation of updated networks. The intent is to provide project managers with a basic understanding of the role of simulation in project network analysis and to improve both the efficiency and effectiveness of using simulation as a tool for decision analysis in project management.
Liveness properties as convergence in metric spaces
Authors: Pierpaolo Degano, Ugo Montanari
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

Four liveness properties of concurrent programs are characterized by the fact that their computations, represented as sequences of partial orderings of events, are convergent in suitable metric spaces. The corresponding topological completions do not therefore contain the infinite computations without the desired properties. The properties are: vitality (i.e. every running process will eventually produce an observable event), global and local fairness, and deadlock freedom. This approach proves fruitful since a universal scheduler is defined, which, when supplied with a particular metric, generates all and only convergent computations. Thus, this scheduler can be used to generate all and only vital, fair or deadlock free computations.
Constrained sequential-block search in simulation experimentation
Authors: William E. Biles
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This paper describes the application of sequential-block search techniques to simulation experimentation with constrained systems. Two basically different approaches are examined. One approach combines designed experiments, multiple regression, and mathematical optimization to predict a constrained optimum solution, which is then checked by further experimentation in the region of the predicted solution. A second approach employs a sequential optimum seeking-technique, such as gradient search or sequential simplex search, modified to accommodate constraints. These techniques are illustrated with a simple inventory system modeled with the GASP-II simulation language. A comparison of the effectiveness of these approaches is presented.
Problem areas and the combination of wall-units to satisfy room relation specification between rooms
Authors: Isao Oishi
Venue: Proceedings of the 9th Design Automation Workshop (1972)

Given the 5-10 year goal of a computer program to design buildings, this paper discusses a proposed outline of problem areas. These problems are considered stubborn but tractable and need be systematically resolved. A program is described which investigates the problem of combining wall-units into a wall which satisfies relation value specification between rooms. Architectural design automation has apparently progressed beyond location programs to the point at which individual researchers are investigating problem areas whose output may be a partial program rather than a complete package. The evaluation of such a project should then fall upon (1) the recognition of relevant problem areas and (2) its progress demonstrated by the program within the context of an overall, long term goal.
The use of APL primitives and function domains to produce general APL solutions to problems involving discontinuities
Authors: Warren G. Julian
Venue: Proceedings of the international conference on APL (1982)

There are many mathematical problems where discontinuities or varying boundary conditions mean that a number of different solutions can apply, depending upon the domains of particular variables. In traditional algebra these solutions are usually listed as a set of solutions with the domains of the variables stated for each solution. In programming a similar technique is involved, using branching to select the expression to be evaluated depending upon the domains of the variables involved. By using APL, both as an algebra and as aprogramming language, single expressions for many such problems can be written (general solutions) which are valid for all variable domains. These solutions are generated using APL primitives to control either the domain of a function or its result. The paper will discuss the philosophy of the method and its application in simplifying the algorithmic solutions of problems involving restricted domains and discontinuities. Examples relating to the determination of shear forces and bending moments on isostatic beams and utilisation factors (used in electric lighting design) are used to demonstrate the generation of a general solution to a problem involving both restricted domains and discontinuities.
The micro-architecture of the ECLIPSE&reg; MV/8000: Conception and implementation
Authors: Jonathan S. Blau, Charles J. Holland, David L. Keating
Venue: ACM SIGMICRO Newsletter (1980)

The microcode of the ECLIPSE MV/8000 controls the hardware to emulate an instruction set. In the MV/8000 the micro-architecture is defined and limited by the following constraints: 1) the desire to implement microcode in a limited number of locations; 2) the use of LSI technology; 3) a virtual memory architecture. This paper will attempt to show how each of these factors contributed to the micro-architecture, to describe that architecture, and to relate some of the more interesting microcoding issues.
COSMOS-a representation scheme for free-form surfaces
Authors: C. Dorai, A. K. Jain
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

We address the problem of representing and recognizing arbitrarily curved 3D rigid objects when: the objects may vary in shape and complexity, and no restrictive assumptions are made about the types of surfaces on the object. We propose a new and general surface representation scheme for recognizing objects with free form (sculpted) surfaces from range data. In this scheme, an object is described concisely in terms of maximal surface patches of constant shape index. These maximal patches are mapped onto the unit sphere via their orientations, and aggregated via shape spectral functions. Properties such as surface area, curvedness and connectivity that capture local and global information are also built into the representation. The scheme yields not only a meaningful and rich surface description useful for the recoverability of the object, but also a set of powerful indexing primitives for object matching. We demonstrate the generality and the effectiveness of our scheme using real range images of complex objects. We also present results on the categorization of object views based on a novel shape spectral matching technique.
The ACTION/FILES file system
Authors: John S. Fisher
Venue: Proceedings of the eighth international conference on APL (1976)

This paper describes some of the aspects of the new implementation of the ACTION/FILES system. It is a part of the ACTION/APL.SV system offered by The Computer Company, Richmond, Virginia. The discussion considers the interface between APL user and the files, as well as the internal structuring of the system database and of the system programs.
Reliable hardware-software architecture
Authors: William A. Wulf
Venue: Proceedings of the international conference on Reliable software (1975)

This paper deals with the problem of reliability in a hardware/software system. More specifically it deals with the strategy used to achieve reliability in a particular hardware/software system built by the author and his colleagues at Carnegie-Mellon University. Rather than dealing with the myriad details of the reliability aspects of this systems, the paper focuses on the design philosophy which aims at keeping the system operational even though the underlying hardware may be malfunctioning. This philosophy is essentially an extension of the 'modular' programming methodology, advocated by Parnas and others, to include dynamic error detection and recovery.
A formal definition of APL statement syntax
Authors: Everett F. Allen
Venue: Proceedings of seventh international conference on APL (1975)

The six exhibits presented in this paper define the syntax of an APL statement roughly equivalent to that found in the APLSV [1] implementation. The definition is abstract in that implementation dependencies such as trace, stop and heterogeneous output are not included. Distinguished names have been included in a generalized form. As indicated by Falkoff and Iverson [2] the syntax of operators must ultimately be regularized. The treatment given to operators in this definition tends to amplify this need. The definitions may be easily extended to formalize the operator syntax suggested by Ghandor and Mezei [3].
Computer science contributions to learning and teaching (Panel)
Venue: Proceedings of the 1971 26th annual conference (1971)

At the ACM Annual Conference in 1970 the Special Interest Group on Computer Uses in Education (SIGCUE) organized two sessions on computers in the instructional process. Recommendations for action by computer professionals were formulated and printed in the October issue of the SIGCUE Bulletin on Computer Uses in Education (v4, No. 5, pp. 26-33). Consistent with program planning for ACM 70 and 71, SIGCUE has organized a session for this year which in part should answer some of the questions raised last year. The Bulletin should again be a vehicle for supplementary statements and reporting of outcomes after the Conference.
Microprogrammed significance arithmetic with tapered floating point representation
Authors: Clement Luk
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

To automatically indicate a bound for the propagated and generated errors due to finite representation of numeric values on a computer using floating point representations, two methods are used, the &ldquo;normalized method&rdquo; and the &ldquo;unnormalized method&rdquo;. The normalized method uses a normalized representation and an index to indicate the number of significant digits. The unnormalized method retains only the significant digits. This paper reports a micro-implementation of binary significance arithmetic using the normalized method with a new floating point representation. The normalized method is chosen for two reasons: (1) as indicated by Carr [2 ] , a normalized floating point procedure always gives a better result than an unnormalized procedure, and (2) this floating point representation takes advantage of a special property of normalization to afford increased exponent range and to retain potentially an extra binary digit (bit) for values between 0 and 1 as compared against conventional floating point format.
Development of a CBMS message transfer protocol
Authors: Gerard F. Mulvenna
Venue: ACM SIGOA Newsletter (1982)

In recent years, organizations have been turning towards the use of automation equipment to effect productivity improvements in the office environment. One of the principal new methods of expediting communications in the modern office is the use of electronic mail and messaging systems. According to International Resource Development, Incorporated, the market for electronic mail and message systems and services will increase from about &dollar;1 billion in 1979 to more than &dollar;4.5 billion by 1989. By the latter date, there will be at least 50 companies with significant participation in electronic mail. The declining services and rising costs associated with postal deliveries along with the benefits of &ldquo;instant&rdquo; message delivery using electronic means, have sparked a large increase in the use of electronic mail and messaging systems by United States corporations. The growth in electronic mail can be explained by the belief that todays' businesses have to communicate far more effectively in order to compete in an increasingly complex world.
Automated verification of connection management of NBS class 4 transport protocol
Authors: Deepinder P. Sidhu>, Thomas P. Blumer
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

In a recent paper, the authors discussed verification of the connection management aspects of the NBS Class 4 transport protocol. An automated protocol development technique was used to verify a subset of the protocol with respect to the protocol properties of completeness, deadlock freeness, livelock freeness, boundedness, and termination. The analysis pointed out several error situations in which the completeness property did not hold for the protocol. This note summarizes the results of the automated analysis and also proposes some plausible solutions to the problems identified in the current specification.
A logarithmic time sort for linear size networks
Authors: John H. Reif, Leslie G. Valiant
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

We give a randomized algorithm that sorts on an N node network with constant valence in 0(log N) time. More particularly the algorithm sorts N items on an N node cube-connected cycles graph and for some constant k for all large enough &agr; it terminates within k&agr; log N time with probability at least 1&minus;N&minus;&agr;.
Interactive shape generation and spatial conflict testing
Authors: Yehuda E. Kalay
Venue: Proceedings of the 18th Design Automation Conference (1981)

A general purpose, research oriented, interactive modeling system is presented. It is based on two different coherent polyhedral shape representations: a planar graph, used for computation and data manipulation, and a relational-database for compact store and general communication with application programs. The two representations effectively partition the system shape-space into active and inactive shapes, respectively. These are explicitly interchangeable by the user, keeping the actual workspace at a manageable size. The basic functionalities provided by the system include the combination of primitive shapes into complex objects by means of spatial set operators (union, intersection and difference), their modeling by means of scaling, rotation and translation, spatial interference detection and graphical display capabilities.
ALGOL 68 and structured programming for learner-programmers
Authors: Bryan Ratcliff
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

A method is described of introducing to absolute beginners basic concepts of structured programming, including constructing programs by &ldquo;step-wise refinement&rdquo;. This is interleaved with a &ldquo;top-down&rdquo; description of a simple mini-subset of ALGOL 68, which is closely followed by the concepts of data structuring and procedurisation, as expressed in this language. Emphasis throughout is on the programming philosophy behind the approach controlling the teaching of ALGOL 68, rather than vice versa.
Computer Science at Staten Island Community College: Teaching Computer Science in an open admissions environment
Authors: Emile C. Chi, Marsha Moroh, Miriam R. Tausner
Venue: ACM SIGCSE Bulletin (1974)

Teaching Computer Science on an open admissions campus with no tuition raises two major problems: many students are poorly prepared for college-level work; the students have extremely diverse aspirations and needs. In response to this challenge, the Computer Science faculty at Staten Island Community College has evolved the teaching methods described below, which include use of a non-mathematical approach especially in lower-level courses, and a practical programming laboratory to be taken as a part of each course. In addition, a variety of new course and curriculum options have been developed.
The use of graphics processors for circuit design simulation at GTE AE Labs
Authors: J. A. Dyer, A. K. Laha, E. J. Moran, D. W. Smart
Venue: Proceedings of the 17th Design Automation Conference (1980)

Design and test engineers in some companies have resisted the use of circuit simulation programs because of the necessity of learning a special language for circuit input and of the necessity of becoming too involved in computer operations. To overcome these objections the Circuit Analysis and Simulation Group at AE Labs has designed graphics processor programs to interface between the designer and the simulation programs. This paper provides a description of the current generation of these programs.
Developmental systems and languages
Authors: A. Lindenmayer, G. Rozenberg
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

Developmental systems were introduced (Lindenmayer, 1968, 1971) in order to model morphogenetic (pattern-generating) processes in growing, multicellular, filamentous organisms. These systems were originally conceived as linear arrays of interconnected finite automata, each automaton corresponding to a living cell, with the possibility that new automata can be added to the array (cells divide) or be deleted from the array (cells die). Each cell in the array is supposed to have the same state-transition and output functions. As required by biological considerations these functions must be applied to all cells in the array simultaneously at each time step. Thus one obtains infinite sequences of arrays once the functions and the initial arrays are specified. Simplified constructs are defined (and used in this paper) by considering the states and outputs to be identical and thus omitting the output functions. Such filamentous developmental systems have been called &ldquo;Lindenmayer models&rdquo; Herman, 1969, 1970) or &ldquo;L-systems&rdquo; (Van Dalen, 1971).
Some experiments in simulating OS/360 from performance data
Authors: Leonard Bass, Thomas Santos, Michael Sheets
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

Recent work has indicated that the time a program spends in memory is the primary determinant of the turnaround of the program. We constructed a simulation model of our OS/360 system, using as input performance data gathered by a software monitor, and experimented with differing models of the operating system, program behavior, and hardware configurations to determine an appropriate trade-off between the complexity of models used and the accuracy of the simulation. We constructed a fairly simple model which simulated, from resource requirements of programs, the time a collection of programs resided in memory to within 10% accuracy for the actual completion time of the various programs. The data gathered gave, between any two sample points, the central processor time spent processing on interrupts, on various system tasks, on various problem program tasks and on the large time-sharing task which runs in our system. It also gave the number and total duration of the input-output requests from each task to each device. This data was sampled every time a program was introduced into memory or terminated and left memory. The simulators we constructed had components for the operating system (in various levels of detail), problem program behavior (we tested various distributions of processor burst time and input-output time) and also a component for the input-output configuration (we tested various models of channels and devices with associated queueing). The test of the accuracy of the simulation was how well it compared with the times taken by the actual programs. The results yielded insight into the nature of program behavior as well as how programs interact with the operating system.
Cascade realization 3-input 3-output conservative logic circuits &mdash; application of three-valued logic to two-valued logic &mdash;
Authors: Tsutomu Sasao, Kozo Kinoshita
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

A conservative logic element (CLE) is a multiple-output logic element whose weight of an input vector is equal to that of the corresponding output vector, and is a generalized model of magnetic bubble logic elements, etc. Arbitrary 3-input 3-output conservative logic circuits (3-3 CLC's) are realized by cascade connections of 3-input 3-output CLE's called &ldquo;primitives&rdquo;. It is shown that the necessary and sufficient number of different primitives to realize an arbitrary 3-3 CLC is three in the case when the crossovers of lines are permitted. The method of realizations is similar to that of three-valued one-variable two-output logic functions.
MICOS: A microprogrammed hierarchical operating system nucleus and its performance comparison
Authors: Walter H. Burkhardt, Helmut E. Maier
Venue: Proceedings of the 11th annual workshop on Microprogramming (1978)

Modern operating systems (OS) spend often more than half of the total CPU-time for overhead. Microprogramming of systems components offers an attractive means for a reduction. However, previous investigators have found only small increases in efficiency by microprogrammed OS-functions, whenever analyzed in detail. They have implemented a total OS in microcode or designed new powerful machine instructions for single systems functions, but without important changes to the hardware architecture or the OS-structure. A special structure of the present system has been adopted for the comparison of the performance of the different implementation modes for the functions in the OS-nucleus.
Design of a time-sharing system allowing interactive graphics
Authors: G. B. Anderson, K. R. Bertran, R. W. Conn, K. O. Malmquist, R. E. Millstein, S. Tokubo
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

For the past several years various investigators at Lawrence Radiation Laboratory, Livermore have been conducting studies in computer graphics and man-machine interaction. These studies have included aids to numerical analysis,1,2 photographic input and picture processing,3,4 and computer-aided circuit design.5 Each of these problems required&mdash;initially at least&mdash;a rather high degree of interaction between computer and investigator. To date these and similar experiments are conducted on one of two computers (medium and small in size) dedicated from time to time to this use. The demand for graphic study time on these computers has grown to the point where it has seemed advisable to implement a time-sharing system. The purpose of any time-sharing system is to give the processing and storage resources of a computing complex the appearance of being the unique property of each of its users. This paper will outline the software specifications for a system designed to facilitate the sharing of modest computing resources among a number of users at graphic terminals&mdash;each terminal consisting of a CRT display with keyboard, function buttons, and light pen input. There are a number of considerations in the structure of any time-sharing system which are independent of that system's ultimate use. Many of these considerations have been explored by other investigators and a few will be informally reviewed to provide a tutorial basis for the solutions described. (Those concerning memory allocation, e.g., were carefully considered Dennis.6) The derived system is similar to U.C. Berkeley's project Genie7,8 in its gross structure with a file design closer to MIT's Multics,9 or UC LRL, Livermore's Octopus.10 TM Its uniqueness derives from the manner in which it schedules processes, handles shared files, permits virtual memory overlaying, and allocates storage for terminal displays.