ppxscal/embedding_network huggingface dataset:
Applications programming course using guided design
Authors: Curtis R. Cook
Venue: Proceedings of the eighth SIGCSE technical symposium on Computer science education (1977)

This paper describes a two term junior level Applications Programming course. The goal of the course is to provide the guidance and tools a student needs in order to write medium to large sized programs and to provide the experience of working on a &ldquo;real world&rdquo; project. Topics covered during the first term are documentation, magnetic tapes, program design, testing, debugging and programming style. The second term consists entirely of student teams doing &ldquo;real world&rdquo; projects applying the concepts from the first team. Much of the first term material was presented in the form of Guided Design exercises. In Guided Design, the learning process revolves around student groups being directed towards a problem solution by a series of instruction-feedback materials prepared ahead of time by the instructor. Guided Design exercises were used to synthesize lecture and reading assignments and to do in class example programs.
A stochastic network approach to test and checkout
Authors: Lawrence J. Watters, Michael V. Vasilik
Venue: Proceedings of the fourth annual conference on Applications of simulation (1970)

This paper demonstrates the usefulness of GERT simulation for modeling and evaluating policies and processes in test and checkout. Some of the latest developments and extensions to a GERT simulation program are used to model a test plan development process, a general test and checkout process, and specific cases of the latter.
Single stuck-type fault detection in multi-valued combinational circuits
Authors: Richard Spillman
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

This paper examines the problem of detecting single stuck-type faults in multi-valued combinational circuits. The algebra employed is the generalized ternary algebra developed by Vranosic, Lee and Smith. Many of the concepts already developed for fault detection in binary circuits generalize easily to the multi-valued case. However, the special properties of multi-valued circuits complicate fault detection. Specifically, this paper introduces the concept of a partially enabled gate, K-paths in combinational circuits, and suggests a modified D-algorithm for fault detection in multi-valued circuits.
Introduction to GPSS
Authors: Thomas J. Schriber
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

Summary information about key aspects of the simulation programming language GPSS is provided. The class of problems to which GPSS applies especially well is described; commentary on the semantics and syntax of the language is offered; the learning-oriented literature for GPSS is summarized; various GPSS implementations are commented on; the time-sharing networks offering GPSS are cited; and public courses on the language are listed. Finally, the source of a tutorial introduction to the fundamental semantics and syntax of GPSS is given. Copies of this tutorial material, excluded from reproduction here because of page-count limits, will be distributed at the session and provide the basis for the session itself.
An ADA TMcompatible specification language
Authors: N. C.L. Beale, Peyton S.L. Jones
Venue: Proceedings of the ACM '81 conference (1981)

This paper describes a notation for the formal specification of software packages. The main influences are the guarded commands of Dijkstra and the Algebraic Semantics of Guttag. However, a novel operator denoted by % is introduced, which allows algorithms to be abstracted in a specification, thereby creating a true specification language rather than another higher level language. The notation, called ADL/1, is designed to be used in conjunction with ADA;tm but is equally suitable for other languages, and has been used for real time software written in Assembler and in a PASCAL-like language.
Computer program execution time and discrete clock
Authors: M. W. Chan
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

In validating a simulation model of a computer system, measurements of execution times for program modules are often required. Clocks available today for such purposes run discretely. They click at certain time intervals, some on the order of microseconds, others in milliseconds. For technical as well as economical reasons, the one we use clicks every 16.666 milliseconds. Therefore, if both the beginning and ending of the execution of a program module fall inside the 16.666 ms interval between two consecutive clicks, the execution time T will be recorded as zero. On the other hand, if the beginning of the execution occurs shortly before a click, the recorded execution time will be 16.666 ms, no matter how short the actual execution time may be, as long as it ends after the click. Based on such unreliable data, a procedure is derived to yield a reliable estimate of T.
Self-adjusting binary trees
Authors: Daniel Dominic Sleator, Robert Endre Tarjan
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

We use the idea of self-adjusting trees to create new, simple data structures for priority queues (which we call heaps) and search trees. Unlike other efficient implementations of these data structures, self-adjusting trees have no balance condition. Instead, whenever the tree is accessed, certain adjustments take place. (In the case of heaps, the adjustment is a sequence of exchanges of children, in the case of search trees the adjustment is a sequence of rotations.) Self-adjusting trees are efficient in an amortized sense: any particular operation may be slow but any sequence of operations must be fast. Self-adjusting trees have two advantages over the corresponding balanced trees in both applications. First, they are simpler to implement because there are fewer cases in the algorithms. Second, they are more storage-efficient because no balance information needs to be stored. Furthermore, a self-adjusting search tree has the remarkable property that its running time (for any sufficiently long sequence of search operations) is within a constant factor of the running time for the same set of searches on any fixed binary tree. It follows that a self-adjusting tree is (up to a constant factor) as fast as the optimal fixed tree for a particular probability distribution of search requests, even though the distribution is unknown.
Parallel processing, special-purpose hardware, and DA applications
Authors: Gregory F. Pfister
Venue: Proceedings of the 1983 computer science conference (1983)

Continuing advances in VLSI technology are putting major pressure on Design Automation (DA) applications. To meet this pressure, special purpose hardware to perform selected DA applications has been developed and proposed. Much of the advantage of such hardware comes from exploiting the massive parallelism that is available in virtually all DA applications. However, it is impractical to construct special purpose machines to solve all, or even a significant number of these applications. Instead, DA should be viewed as a major, important application area for the new generation of less specialized parallel machines being proposed.
A predictive tool for quantifying wind erosion from coal surfaces
Authors: Mary Ann Grelinger
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

A simulation computer program is described for the quantification of particulate emissions generated by wind erosion of coal surfaces. Erosion potentials reported by Cowherd provide the basic test data correlating suspended particulate loss with wind speed. Daily fastest miles of wind, precipitation and surface disturbances are stochastically simulated. Erosion loss is shown to vary according to the probability and the amount of rainfall, the frequency of disturbance of the erodible surface and the fastest mile of wind distribution parameters.
Empirical testing of multiplicative congruential generators with modulus 231&minus;1
Authors: George S. Fishman, Louis R. Moore
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

This paper presents the results of empirically testing alternative multipliers for a multiplicative congruential generator with modulus 231&minus;1. The LLRANDOM random number package (1973) uses one of the multipliers, the simulation programming language SIMSCRIPT II uses a second and the remaining are from the 50 candidate multipliers studied by Hoaglin (1976) using the theoretical spectral and lattice tests. The battery of tests fail to detect any departures from randomness for 3 of the multipliers, even at a 0.20 significance level. This group includes the multiplier that SIMSCRIPT II employs. However, another of the 3 superior performers, 397204094, requires only 78 percent of the computing time required by the SIMSCRIPT II multiplier.
A voice response system for an office information system
Authors: Dik Lun Lee
Venue: ACM SIGOA Newsletter (1982)

One of the major activities in offices is communication. Communication involves information exchange in different kinds of media such as text, voice, pictures, and most likely, a mix of these. As such, a successful office information system must provide adequate facilities for handling these kinds of communication media. This paper discusses the design and implementation of a voice response system for OFS (Office Form System), a prototype office information system.
Measures of parallelism in alternating computation trees (Extended Abstract)
Authors: K. N. King
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

We examine three ways of restricting the size (and shape) of the accepting computation trees of alternating Turing machines. We continue study by examining bounds on the number of leaves in the tree (Section 3), the 'width' of the tree (Section 4), and the number of nodes at any level of the tree (Section 5). Each of these measures can be interpreted as a limit on the amount of parallelism permitted the computation.
Program refinement by transformation
Authors: Thomas E. Cheatham,  Jr., Glenn H. Holloway, Judy A. Townley
Venue: Proceedings of the 5th international conference on Software engineering (1981)

Program maintenance is simplified when the program to be modified can be viewed as an abstract algorithm to which clearly documented implementation decisions have been applied to produce an efficient realization. The Harvard Program Development System (PDS) [8] is a programming support environment that encourages users to take this view of programs. A user of the PDS creates transformations that incorporate implementation choices, and the system uses these transformations to refine concrete programs from their abstract counterparts. In addition to simplifying maintenance, this method supports the use of notational extensions and the development of program families. We describe the transformation facilities available to the user of the PDS, and we discuss aspects of the implementation of these facilities.
Realism, style, and design: Packing it into a constrained course
Authors: Peter Freeman
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

Although the importance of providing realistic educational experiences involving the design of software systems has been recognized in many undergraduate curricula, it is difficult to consistently do so. With the constraints of an existing curricula and a small amount of class time a course has been developed that provides a rich experience in software design, including the critical aspects of group work and programming and documentation style. The course, its goals, and main features are described and analyzed. Experience with the course is reported and the problem of evaluating such a course is discussed.
An algebraic theory of recursive definitions and recursive languages
Authors: Eric G. Wagner
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

This is the introductory paper in a series devoted to a general algebraic theory of &ldquo;recursive definitions&rdquo; and &ldquo;recursive languages&rdquo;. In this paper we present the fundamental concepts and theorems concerning the basic structure (basic syntax), the semantics and the combination and manipulation of &ldquo;recursive definitions&rdquo; and the closure properties of &ldquo;recursive languages&rdquo;. The development is carried out within the framework of category theory and lattice theory. To illustrate the generality of the approach and our results we show how they apply directly to the specific examples of &ldquo;recursive languages&rdquo; of (generalized) context-free grammars, Turing machines, and flowcharts.
Discrete event simulation on mini- and microcomputers: Some experiments with the Pascal language
Authors: Andrew F. Seila, Der-Fa Robert Chen
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

Currently, mini- and microcomputers are finding application in many areas of business and scientific work. However, the use of small computers for simulation studies is virtually nonexistent. In this paper, we discuss the language requirements for discrete event simulation and present the features of the Pascal language that make it a natural language to use for writing simulation programs. Finally, we discuss our experiences in developing several nontrivial simulations using Pascal.
Simulation of facility designs on a micro-computer
Authors: Gerald T. Mackulak, Neil Glenney
Venue: Proceedings of the 16th conference on Winter simulation (1984)

The design of a high technology production facility quite often hinges on the successful design of a material handling system to integrate the various automation centers. Traditionally, management has been reluctant to invest the capital necessary for high technology material handling equipment since they have no guarantee of the performance potential. Simulation of a proposed facility design, with a special emphasis on the material handling system is illustrated as a key method for evaluating the proposed design prior to the purchase of production process equipment.
Design automation trends for VLSI in the 1980s (Position Statement)
Authors: C. W. Gwyn
Venue: Proceedings of the 17th Design Automation Conference (1980)

Substantial progress was made in implementing design aids during the 1970s; however, the development of new aids must be accelerated during the 1980s to support circuit designs of VLSI complexity. New design aids-will be required because of (1) increased design complexity, (2) scarcity of design engineers, (3) need to reduce circuit design time and cost, and (4) increased emphasis in producing error-free manufacturable designs. The reduction of fabrication costs will become more important as processing equipment costs and the sophistication of individual processing steps continues to increase to support VLSI complexity circuits. These design and manufacturing problems can be solved only by increasing the use of design automation and improving the design aids. Although aids to support LSI designs have been developed and are widely available, extensions will be required to improve performance; aids in this category include: circuit analysis, logic simulation, and gate array layout aids, design rule checking, and pattern generation. New design aids for VLSI must be developed to exploit the hierarchical design approach from initial design definition through circuit synthesis, simulation, layout, and verification. The following areas require new design aids with new concepts and approaches: high-level description languages, modeling and simulation, generalized layout methods, high-level fault modeling and testing, and design methodologies for complex systems. These aids can be used to design VLSI circuits in a top-down design sequence followed by a bottom-up implementation using basic devices, cells, and modules to construct larger modules and assemblies. Because of layout restrictions and the emphasis on density, the use of gate arrays will decline. At each level in the design hierarchy, the new aids must support a design language for system specification, partitioning, synthesis, simulation, layout, and verification to refine the design in increasing detail. Although the goal will be a completely automated system, practical limitations will require designer interaction.
Multi-processor software lockout
Authors: Stuart E. Madnick
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

As the uses of computers increase, every facility eventually becomes faced with the need to increase capacity. The solutions normally used are to replace the equipment with newer and faster models or obtain additional independent systems. The latter solution, although possibly satisfactory for batch processing, is inefficient for time-sharing and other forms of &ldquo;computer utility&rdquo;. Technological forecast is beyond the scope of this paper, but present trends indicate that future general-purpose computer will be smaller and less costly, but not significantly faster.
Central government computing agency in less developed countries
Authors: Asad Khailany
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

This paper is a result of research conducted in the last two years to improve government Computing Systems in developing countries. Various methods were used to introduce and establish Computing Systems in developing countries without any systematic approach. However, many of the governments in these countries soon realized the need for a central agency to regulate and monitor Computing Systems and their usage. Many factors contributed to the decisions made in creating a central government computing agency.
Optimal code generation for expression trees
Authors: A. V. Aho, S. C. Johnson
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

We discuss the problem of generating code for a wide class of machines, restricting ourselves to the computation of expression trees. After defining a broad class of machines and discussing the properties of optimal programs on these machines, we derive a necessary and sufficient condition which can be used to prove the optimality of any code generation algorithm for expression trees on this class. We then present a dynamic programming algorithm which produces optimal code for any machine in the class; this algorithm runs in time which is linearly proportional to the number of vertices in an expression tree.
Corporate planning systems simulation: The Portland General Electric (PGE) experience
Authors: Wynn A. Abranovic, Lee A. Barney, Charles A. Lusky, Warren H. Winter
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

As utilities struggle to do business in a volatile regulatory climate, a number of uncertainties about costs and revenues make the task of corporate planning a difficult one. A multitude of planning models are used by PGE; they transform data into information at the operating level and they produce some byproduct information that is used as input to more aggregate planning models such as the financial model. Running these models has become an integral part of the organizational planning activities; nevertheless, problems occur in maintaining accurate and timely data files. The problem has been further aggravated by the absence of a repository for planning data that is common to the needs of several departments within divisions. A Data Base Management System (DBMS) is presented as a systematic approach to help alleviate some of the planning difficulties on the technical side; the concept of a coordinating committee is introduced as an integral part of the system but the human system receives little attention in this paper. The emphasis is on a simple and flexible approach that does not burden the user with technical details. An idea central to a DBMS is that of isolating the definition of the data structure and the user programs. Thus, the need for format specifications in user programs is eliminated for variables appearing in the data base. We have defined a few functions that enable the program users to access the data base in a simple way. The data Manipulation Language (DML) embedded in these functions is invisible to most users; however, Planning Systems is expected to be knowledgeable in both the DML and the Data Base Description Language (DBDL). The DBDL is used to define the structure of the data base, and it requires cooperation between Planning Systems and user departments. The initial data structure is specified in this paper, but the eventual structure is expected to evolve slowly over time; and, as it does, more advanced features of the DBMS may be utilized. An important aspect of this approach is that the system of planning models may undergo evolutionary changes without completely starting from scratch each time and rebuilding the entire system. As a result, less time and energy are expended on the technical system, while more of the needed emphasis can be allocated to the human system.
Rectangular meshes: Their uses and control in computer-produced architectural schemes
Authors: Gonzalo Velez
Venue: Proceedings of the 1971 26th annual conference (1971)

A procedure is described to obtain computer oriented solutions to functional organization problems in architectural design. This procedure considers both a satisfactory functional scheme and one that satisfies the dimensional constraints.
The subjective nature of programming complexity
Authors: Daniel G. McNicholl, Ken Magel
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

One of the more difficult problems confronting software engineers today is the construction of accurate predictive models of the software development process, [2],[8] and [9]. It has long been recognized that one of the most essential elements of any successful model of this process is a quantification of the complexity of software systems. During the past several years a great deal of work has been performed by researchers such as Halstead [3], McCab [5], and others in an attempt to develop metrics which adequately capture the complexity of software systems. Yet one very important aspect of software development complexity seems to have been overlooked in the rush to develop software complexity metrics, q.e. it's psychological nature. A basic tenet of our research is that the effort to develop a software system is a function of it's 'perceived' complexity; which in turn is dependent upon both the physical nature of the software system being developed and the psychological nature of the individual(s) performing the development. The immediate goal of the research reported on in this paper was to examine this dual dependency. In order to do so we collected data from two sections (same instructor) of a college sophomore - level class on PL/I which consisted of fifty-six students. During this class each student was given six written programming assignments which were relatively simple in scope.
An analytic performance model of a multiprogrammed batch-timeshared computer
Authors: John E. Neilson
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

The paper presents an analytic performance model of a multiprogrammed batch and timeshared context swapped system. The model predicts resource utilizations, batch throughput and timesharing response times as functions of the system hardware characteristics, including core size; load characteristics, differing between batch and interactive users; and the numbers of batch and interactive users. Thus, it allows one to study the effects of different hardware configurations and/or load patterns on system performance.