ppxscal/embedding_network huggingface dataset:
Reliability modeling techniques for self-repairing computer systems
Authors: W. G. Bouricius, W. C. Carter, P. R. Schneider
Venue: Proceedings of the 1969 24th national conference (1969)

This paper develops techniques for generating and using mathematical models applicable to architectural evaluation of the tradeoffs involved in designing self-repairing highly reliable computers for long missions. These systems must use standby sparing and their reliability is shown to be extremely sensitive to small variations in a new design parameter, the coverage, c, defined as the probability of system recovery given the existence of a failure. Interactive terminal calculations show c to be the single most important parameter in high-reliability system design. Changing the coverage from 1 to .98 can result in orders of magnitude change in system mission time with a specified reliability. Most techniques for increasing system reliability (e.g. adding more spares) are shown to be futile in the face of an inadequate .99 coverage. Adding checking, diagnostics, etc. to improve failure coverage is shown to be the most advantageous technique by examples of system tradeoff evaluation. This mandates extensive application of modeling techniques throughout all computer system design phases.
FORTRAN IV on videotape - an experiment in televised programmer training
Authors: Walter T. Mara
Venue: Proceedings of the 1964 19th ACM national conference (1964)

During the summer of 1963, the Computer Center of the University of California at Davis produced a televised course in FORTRAN IV programming. The series was recorded on videotape and has been used for all FORTRAN instruction taking place on campus. Preliminary evaluation of the level of attainment of students viewing the lectures indicates that the videotaped series is effective in training programmers. Since programming instruction seems well suited to the television medium, the production of additional courses should be undertaken.
Toward models for probabilistic program correctness
Authors: Joe W. Duran, John J. Wiorkowski
Venue: ACM SIGMETRICS Performance Evaluation Review (1978)

Program testing remains the major way in which program designers convince themselves of the validity of their programs. Software reliability measures based on hardware reliability concepts have been proposed, but adequate models of software reliability have not yet been developed. Investigators have recently studied formal program testing concepts, with promising results, but have not seriously considered quantitative measures of the &ldquo;degree of correctness&rdquo; of a program. We present models for determining, via testing, such probabilistic measures of program correctness as the probability that a program will run correctly on randomly chosen input data, confidence intervals on the number of errors remaining in a program, and the probability that the program has been completely tested. We also introduce a procedure for enhancing correctness estimates by quantifying the error reducing performance of the methods used to develop and debug a program.
The solution of separable queueing network models using mean value analysis
Authors: John Zahorjan, Eugene Wong
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

Because it is more intuitively understandable than the previously existing convolution algorithms, Mean Value Analysis (MVA) has gained great popularity as an exact solution technique for separable queueing networks. However, the derivations of MVA presented to date apply only to closed queueing network models. Additionally, the problem of the storage requirement of MVA has not been dealt with satisfactorily. In this paper we address both these problems, presenting MVA solutions for open and mixed load independent networks, and a storage maintenance technique that we postulate is the minimum possible of any &ldquo;reasonable&rdquo; MVA technique.
The comparison of programming languages: A linguistic approach
Authors: John B. Goodenough
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

This paper presents some results of research into the nature of computer programming languages. One purpose of this research was to develop methods for describing programming languages so that fundamental similarities (and differences) are made explicit in a form that allows languages to be compared easily. Although one must consider fundamental properties in order to make insightful comparisons of languages, it is by no means sufficient to have just a means of describing purported &ldquo;fundamental&rdquo; aspects of languages, since the fundamental nature of programming languages is, to say the least, open to question. Hence it is also necessary to have a theoretical framework that can be used to prove or disprove the existence of hypothesized fundamental aspects of programming languages. Without such a framework, findings about programming languages have the status of personal opinions that are difficult to prove right or wrong. Moreover, the use of a theoretical framework forces us to make explicit our assumptions about programming languages, and we can therefore better avoid the use of inconsistent or inappropriate assumptions. Hence, in this paper we consider how programming languages might be represented so that insightful comparisons of fundamental properties can be made, and we present the beginnings of a suitable explicit theoretical framework. My study of programming languages has been rather abstract; in particular, it has not been oriented toward practical problems of compiler design. Instead, my primary goal has been to gain insight into the nature of programming languages in order to find a principled basis for discussing, describing, and understanding similarities and differences between languages. Such insight is likely to be valuable in a practical sense. Consider for example how difficult it is to decide whether differences between programming languages represent fundamental innovations or just frills. Even if one feels intuitively that certain differences are fundamental, it is often not clear exactly why this judgment was made. And of course, it is easy to make inconsistent intuitive judgments about differences between languages because our assumptions about the nature of programming languages are usually inexplicit and ill-understood. For all of these reasons, it is important to gain a deeper understanding of programming languages and to find explicit ways of representing these understandings in a form that is susceptible of useful scientific discussion. This is the purpose behind the research reported in part here.
Experience with a modular typed language: PROTEL
Authors: P. M. Cashin, M. L. Joliat, R. F. Kamel, D. M. Lasker
Venue: Proceedings of the 5th international conference on Software engineering (1981)

The support for modular software and the ability to perform type checking across module boundaries are becoming the mainstay of recent high level language design. This is well illustrated by languages such as MESA and the US Department of Defence's new standard language ADA. At Bell-Northern Research, PROTEL, one of the first modular typed languages, has been used since 1975 to implement a substantial software system. The experience accumulated in building this system has given us a unique perspective. It has shown that the confidence of language designers in modular typed languages is well founded. It has also revealed some pitfalls which others will undoubtedly encounter. The purpose of this paper is to share our experience by outlining the nature of the problems and our solutions to them.
An empirical study of the behavior of programs in a paging environment
Authors: L. C. Varian, E. G. Coffman
Venue: Proceedings of the first ACM symposium on Operating System Principles (1967)

This paper reports initial results from an empirical study directed at the measurement of program operating behavior in those multiprogramming systems in which programs are organized into fixed length pages. The data collected from the interpretive execution of a number of paged programs is used to describe the frequency of page faults; i.e. the frequency of those instants at which an executing program requires a page of data or instructions not in main (core) memory. These data are used also for the evaluation of two page replacement algorithms and for assessing the effects on performance of changes in the amount of storage allocated to executing programs.
Software validation and verification - a state of the art report(Panel Discussion)
Authors: Terry A. Straeter, Carlo Broglio, Marilyn Fujii, Leon Stucki, Sabina Saib, David Luckham
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

In recent years, a number of new and innovative techniques have been developed for the verification and validation of software. The panel was chosen with representatives of both users and contributors to the technology. The panelists Dr. Carlo Broglio and Marilyn Fujii are actively engaged in the V V of systems soon to be operational. Dr. Leon Stucki and Dr. Sabina Saib, in addition to having been active contributors to the current state of the V V technology, are currently applying their work to large systems under development. The final panelist, Dr. David Luckham has recently developed a formal PASCAL verifier which he is actively using on real programs. The discussion will identify those techniques currently in use on projects ranging from avionics software in strategic aircraft and missile systems to national aerospace survelillance software. Questions to be considered are how effective have techniques like static analysis, code walkthroughs, symbolic execution, structured testing, functional testing, etc., been. Panelists will then discuss the current state of the use of formal/automated V V techniques to the software requirements and design processes. Finally, the panel will consider the current and future role of formal proof techniques. The following are position papers from each of the panelists describing their recent V V activities.
A ROM random-pulse computer for classifying binary patterns
Authors: Louis R. Goke, Keith L. Doty
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

This paper presents a novel design of a non-adaptive binary pattern classifier. The structure employs random-pulse (stochastic) computing elements to realize nonlinear discriminant functions in pattern recognition. A machine design configuration illustrates how a ROM without addressing circuits stores modes and simultaneously executes parallel stochastic multiplications required in discriminant function computations&mdash;demonstrating efficient hardware utilization.
A parallel execution model of logic programs
Authors: Shinji Umeyama, Koichiro Tamura
Venue: ACM SIGARCH Computer Architecture News (1983)

A logic programming language offers several kinds of parallelism for its execution. Among these, this paper concentrates on OR-parallelism which is an alternative to the backtracking mechanism of a serial interpreter, and proposes an abstract model for OR-parallel interpretation. It consists of tokens and five kinds of function units mutually connected as a process graph. The overall processing is done by the flows of tokens among these units. We also present a mechanism for token labeling, which makes this process graph reentrant. A simulation result is given to show how efficiently the model works in terms of parallelism.
A systematic approach to the development and validation of critical software for nuclear power plants
Authors: C. V. Ramamoorthy, F. B. Bastani, J. M. Favaro, Y. R. Mok, C. W. Nam, K. Suzuki
Venue: Proceedings of the 4th international conference on Software engineering (1979)

The power industry is becoming increasingly interested in the use of digital computers within nuclear plant protection systems in order to satisfy increased safety requirements, provide greater operating flexibility, minimize spurious forced outages, and (in conjunction with multiplexing) to meet separation requirements. However, the development and licensing of digital safety systems has been hindered to date by the difficulty of validating the software. A methodology is proposed for the development and validation of nuclear power plant safety system software which may permit a quantitative assessment of its correctness. The methodology has been applied to the development and validation of a pilot software, incorporating typical features of critical software for nuclear power plants. The development and use of automated tools and formal techniques required to support the methodology are described in the paper. The experience of applying the methodology to the initial phases of the software development process for the pilot software are discussed. Finally, the impact of the methodology on the quality of the software under development is assessed.
Performance analysis of a distributed simulation algorithm based on active logical processes
Authors: David L. Davidson, Paul F. Reynolds,  Jr.
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

The SRADS distributed simulation algorithm, which makes use of &ldquo;active logical processes&rdquo; as described elsewhere in this proceedings and in Reynolds (1982), was studied on a network of processors. Results of previous experiments (O'Hallaron 1983) indicated that SRADS could be expected to perform very well under a wide range of conditions. Our implementation was designed to study the algorithm for use in distributed logic simulation, and to provide more detailed information about the algorithm itself.
A computer model to determine pathogen transport through environmental pathways
Authors: Robert E. Sheridan,  Jr., Kathleen E. Hain, Roger L. Tyler
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

A computer program was developed to model the transport of pathogens through environmental pathways as a result of the application of treated sewage sludge. Specific sludge application cases included the use of treated sludge as a cropland fertilizer, as a soil conditioner by the general public, and as a feed supplement for ruminant animals. A comprehensive review of relevant literature sources led to the definition of environmental pathways from the point of sludge production to points of potential human contact. Along these pathways, discrete points were designated where it was desired to compute pathogen populations. In this model, each point in these pathways is treated as a mathematical state. The transfer of pathogens between these states is described by a set of ordinary differential equations derived using conservation principles, environmental parameters, and relationships developed from data obtained in the literature review. These equations are then integrated to determine the pathogen populations at each state. This computerized model has been used in several applications and has helped to assess the risks associated with certain sludge utilization and treatment practices.
The refuge relay function generator
Authors: K. B. Tuttle
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

The method of approximating an arbitrary function of one variable by a sequence of straight-line segments of suitable slopes is widely used to provide input functions for analogue computations. However, many of the mechanizations of this process are critical in adjustment, and require relatively highly trained personnel to expend considerable time in setting them up. The relay function generator here described was developed in an effort to arrive at a simple, reliable device which would accomplish this same purpose, and which could be set up in a purely routine manner by personnel without special training.
Interactive space layout: A graph theoretical approach
Authors: Julia Ruch
Venue: Proceedings of the 15th Design Automation Conference (1978)

This paper proposes an interactive programming approach to the solution of architectural space layout problems. The paper incorporates a brief discussion of some of the problems inherent in existing space layout techniques which may be overcome by the proposed approach. In the suggested computer program, the architectural plan is divided into 3 hierarchical levels of abstract representation; namely, the Graph, The Bubble Diagram, and The Schematic Plan. It is shown how the generation of alternatives at each of these levels is achieved through computer-designer interface. Finally, a representative sample of the questions which may be generated by the interactive system is set forth.
Intersections of linear context-free languages and reversal-bounded multipushdown machines (Extended Abstract)
Authors: Ronald Book, Maurice Nivat, Michael Paterson
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

The purpose of this paper is to establish the following result. Theorem 3.1. Let L be a language. The following are equivalent: (i) L is accepted by a nondeterministic multipushdown acceptor which operates in such a way that in every accepting computation each pushdown store makes at most a bounded number of reversals and which runs in linear time; (ii) L is accepted by a nondeterministic multipushdown acceptor which operates in such a way that in every accepting computation each pushdown store makes at most one reversal and which runs in real time; (iii) L is the length-preservlng homomorphie image of the intersection of some finite number of linear context-free languages; (iv) L is accepted by a nondeterministlc acceptro with three pushdown stores which operates in such a way that in every computation each pushdown store makes at most one reversal and which rmls in real time; (v) L is the length-preservlng homomorphic image of the intersection of three linear context-free languages.
Using microcomputers to teach computer science
Authors: Alfred C. Weaver
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

This paper reports the author's progress toward developing a microcomputer laboratory suitable for teaching some of the basic concepts of computer science. The rationale for this approach is presented, followed by a description of the hardware and software environment thus far developed. Finally we present two course outlines: one for an undergraduate laboratory course in computer systems and another for a graduate course in microcomputer systems design for engineers.
Binary search trees and file organization
Authors: J. Nievergelt
Venue: Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control (1972)

Binary search trees are an important technique for organizing large files, because they are efficient for both random and sequential access of records, and for modification of a file. Because of this, they have received a great deal of attention in recent years, and their properties are now better understood than those of most other file organization methods. This paper surveys the main results which have been obtained.
An approach to computer personnel evaluation
Authors: Paul D. Oyer
Venue: Proceedings of the seventh annual conference on SIGCPR (1969)

An extensive study of the capabilities and proficiency of the staff of programmers and computer systems analysts was recently conducted for a large financial company. The purpose of the study was to provide company management with a detailed analysis of the skill levels and proficiency of the current staff and to make specific recommendations for individual and group training to enable the company to achieve its computer plans and objectives. The steps taken in the course of the study were: 1. Test and interview staff. 2. Classify all staff personnel. 3. Design a Personnel Resume form. 4. Recommend a formal professional training program. 5. Estimate the EDP manpower and skill requirements needed. A specialized proficiency test was designed and used for testing staff members. The same test was used for both programmers and computer systems analysts (all had previous programming experience). The common use of the same test for both groups was intended to enable us to determine whether any programmers had learned systems analysis on their own initiative. On the basis of the test, we were able to recommend specific training and professional development courses that staff members should receive, covering over 20 subject areas. Some subject areas were strongly recommended for certain individuals or groups while others were merely suggested. Current knowledge and proficiency areas that were determined by the test and by individual interviews included programming languages, equipment knowledge, file-organization techniques, system design and implementation experience (in major applications).
Statistical multiplexing of data and encoded voice in a transparent intelligent network
Authors: M. E. Ulug, J. G. Gruber
Venue: Proceedings of the fifth symposium on Data communications (1977)

The paper describes the work done thus far in the development of a means of statistically multiplexing data and encoded voice in a transparent and intelligent network called TI-NET. A review of previous work in packetized voice transmission in a conventional packet switched network (ARPANET) has revealed problems related to large fixed and variable transmission delays. These problems result in degradations in speech quality in the form of time scale distortion and gaps due to very late or lost packets. The paper shows that TI-NET has various features which counter the above problems, and thereby make it appear very suitable for encoded voice transmission. The paper describes a software implementation of a protocol for encoded voice transmission which takes advantage of the 60 to 65% idle time in conversations (one way) so that only active periods in speech need be transmitted; this is not possible with present frame synchronous vocoders which transmit continuously. The paper describes the present experimental TI-NET which consists of two nodes (PDP11's) joined by a 9.6 kb/s link. For convenience the protocol for encoded voice transmission has been implemented in the TI-NET nodes, and the transparent transmission of data and encoded voice has been demonstrated. With regard to packetizing synchronous messages within TI-NET, a new protocol is described (and has been implemented) for padding partially filled &ldquo;minipackets&rdquo; that are likely to occur at the end of most synchronous messages. In addition, the paper discusses the features of another aspect of TI-NET, i.e. satellite extension nodes, which are used to enable both local and remote regions of high data concentration to access the subnet through 12-14 GHZ satellite links. It is shown that the advantages of accessing TI-NET by satellite extension nodes (as compared to accessing a conventional packet switched network by terrestrial facilities), include lower communication costs, greater accuracy and security, and smaller entrance delay. Finally, the paper describes an experiment in which data and encoded voice was transmitted from a TI-NET node at Carleton University, Ottawa, at 9.6 kb/s in &ldquo;multiuser&rdquo; packets, over the Hermes (CTS) satellite to NASA AMES Research Center in California, where it was looped back and returned to the same TI-NET node. The significance of the work described in the paper is that it represents an important step in the development of a transparent and intelligent public network capable of transmitting encoded voice (at 9.6 kb/s and lower rates) and data. Such a network can serve as an integrated system for data and voice and provide cost benefits to its users through savings in bandwidth of the order of 50 to 1, by statistically multiplexing data with vocoded voice.