ppxscal/embedding_network huggingface dataset:
An example of software quality assurance techniques used in a successful large scale software development
Authors: Paul J. Kacik
Venue: ACM SIGSOFT Software Engineering Notes (1978)

Development of the software package for the Combat Grande Air Defense System was considered by the Hughes Aircraft Company to be highly successful in that a reliable system was produced that met customer requirements and was completed within time and budget allocations - a feat not often attained in large scale software developments. Much of the success can be attributed to the software quality assurance (QA) techniques used. Some of these QA techniques are listed in Table 1 along with the phases in which they were used. This paper describes these QA techniques in some detail, as well as those aspects of the system and software development program that permitted these techniques to be used effectively. Background information is presented first which describes the system, software, organization and software configuration management. This is followed by a description of the three major phases of software development. The overall results are then presented, followed by recommended improvements and conclusions. Many of the QA techniques listed in Table 1 were used in several phases of software development. However, a particular technique is discussed only in the phase in which it was most extensively used.
Application of LISP to sequence prediction
Authors: Paul W. Abrahams
Venue: Proceedings of the first ACM symposium on Symbolic and algebraic manipulation (1966)

This paper describes a LISP program that analyzes sequences of letters and numbers. The program, which operates interactively, takes as input a sequence such as ACEGI... It produces as output the next element of the sequence, in this case K, together with a LISP program that predicts the n'th element of the sequence. The program is organized into an executive and a set of workers. The executive calls upon each worker in turn. The worker will respond if it recognizes the sequence as the kind that it knows about; since the workers may themselves call upon the executive, the recognition process is recursive. Workers exist for cyclic sequences, linear sequences, letter sequences, polynomials, interwining of sequences, sequences with predictable first differences, sequences with predictable first ratios, and standard sequences such as the primes, the squares, and the cubes. New workers can be added easily. It is concluded that the program can operate efficiently if somewhat slowly on a significantly large collection of sequences, and that the organizational scheme used has application to other kinds of pattern recognition.
Real-time packet video over satellite channels
Authors: Danny Cohen
Venue: Proceedings of the eighth symposium on Data communications (1983)

The paper describes major issues and problems in the use of packet satellite channels for real-time video images and suggests some solutions. The DARPA Wide Band Communication Network provides the testbed for this activity. The main idea in this paper is the automatic online tradeoff between the quality and the dynamics of the communicated images in order to optimally adapt to the changes of the channel performance and of the scene to be communicated. The paper discusses the problems of real-time packet video, suggests several techniques to cope with them, and describes some new approaches to the encoding of real-time video communication. The paper describes in more detail several encoding schemes based on this approach, using the 2-dimensional Discrete Cosine Transform (DCT). Section-C describes issues which are arise in the application of packet satellite channels for real-time video communication. Section-D discusses a general approach which addresses these issues. Section-E describes a general methodology for signal coding and compression, and Section-F describes a scheme for the communication of video images using DCT of the raw images in an absolute way, unlike the four differential schemes which are described in Section-G. Section-H describes a scheme which self-corrects the accumulated quantization errors introduced by the encoding and compression. Such errors are totally eliminated for static images.
A modeling methodology for sizing A computer based system in a netted environment
Authors: S. T. Becker, K. M. Rege, B. Sengupta
Venue: ACM SIGMETRICS Performance Evaluation Review (1984)

This paper describes a hybrid model, combining both analytical and simulation techniques, which was developed to study the performance of a netted computer based system. The computer based system that was modeled is the Facility Assignment and Control System (FACS). This system is presently being deployed within several Bell Operating Companies to inventory and assign central office and outside plant facilities. A key feature of the model is its ability to characterize the dynamic nature of FACS. An understanding of this dynamic nature is necessary in establishing important operational guidelines such as allowable CPU utilization, levels of multiprogramming and priority of transaction processing. In addition, the model allows the user to investigate the sensitivity of the system to a wide range of conditions. Typical study items could include the effect of various load scenarios, ability of the system to meet performance objectives, and different hardware configurations. As part of this paper, both the practical aspects of modeling a netted computer based system and the theoretical development of the hybrid model are considered.
Program documentation at wichita state university
Authors: David M. Foley
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

The main purpose of this paper is to discuss about program documentation and solutions on the problems in documentation.
A linear-time algorithm for a special case of disjoint set union
Authors: Harold N. Gabow, Robert Endre Tarjan
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

This paper presents a linear-time algorithm for the special case of the disjoint set union problem in which the structure of the unions (defined by a &ldquo;union tree&rdquo;) is known in advance. The algorithm executes an intermixed sequence of m union and find operations on n elements in 0(m+n) time and 0(n) space. This is a slight but theoretically significant improvement over the fastest known algorithm for the general problem, which runs in 0(m&agr;(m+n, n)+n) time and 0(n) space, where &agr; is a functional inverse of Ackermann's function. Used as a subroutine, the algorithm gives similar improvements in the efficiency of algorithms for solving a number of other problems, including two-processor scheduling, the off-line min problem, matching on convex graphs, finding nearest common ancestors off-line, testing a flow graph for reducibility, and finding two disjoint directed spanning trees. The algorithm obtains its efficiency by combining a fast algorithm for the general problem with table look-up on small sets, and requires a random access machine for its implementation. The algorithm extends to the case in which single-node additions to the union tree are allowed. The extended algorithm is useful in finding maximum cardinality matchings on nonbipartite graphs.
Should high level languages be used to write systems software?
Authors: Dennis J. Frailey
Venue: Proceedings of the 1975 annual conference (1975)

Most of us write our programs in whatever language is most convenient for the problem at hand. Often this means, not so much that the language is well suited to the problem, but simply that it's the best suited of the choices available. Particularly with microprocessors and many minicomputers, we don't have a very wide choice of available software. Perhaps we have only an assembler or only a Basic interpreter. Those who have a choice, or who are responsible for developing compilers and other basic systems software, must determine how much money to spend and where to spend it, becoming embroiled in such questions as what high level languages, if any, should be used or how important it is to develop a good assembler versus a good high level language compiler for our systems work.
An accurate time delay model for large digital network simulation
Authors: C. Chicoix, J. Pedoussat, N. Giambiasi
Venue: Proceedings of the 13th Design Automation Conference (1976)

The authors propose a three valued model for temporal simulation of logic system. This model is well suited for analysis of hazards and high frequency rejection phenomenas. By using a new temporal model, we avoid backtracking or anticipation techniques (generally used in other models) and allow very simple implementation. The model and the mains algorithms are presented in detail in the paper and some examples including hazards are given.
The implementation of procedurally reflective languages
Authors: Jim des Rivières, Brian Cantwell Smith
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

In a procedurally reflective programming language, all programs are executed not through the agency of a primitive and inaccessible interpreter, but rather by the explicit running of a program that represents that interpreter. In the corresponding virtual machine, therefore, there are an infinite number of levels at which programs are processed, all simultaneously active. It is therefore a substantial question to show whether, and why, a reflective language is computationally tractable. We answer this question by showing how to produce an efficient implementation of a procedurally reflective language, based on the notion of a level-shifting processor. A series of general techniques, which should be applicable to reflective variants of any standard applicative or imperative programming languages, are illustrated in a complete implementation for a particular reflective LISP dialect called 3-LISP.
Statistics and computer science: Recent development in BMDP computing algorithms
Authors: G. Rex Bryce, James W. Frane, Thomas A. Ryan,  Jr., James Goodnight
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

BMDP is a comprehensive library of statistical computer programs integrated by a common English-based control language and self-documented save tiles for data and results. The major emphasis in the package is on providing software for the analysis of statistical data. Improvements and new programs are constantly being added. Some recent developments include derivative-based and derivative-free nonlinear regression routines including boundary limits and linear constraints, maximum likelihood and restricted maximum likelihood unbalanced mixed-model analysis of variance and covariance, detection and description of influential points in regression and loglinear hierarchical analysis of multiway frequency tables. BMDP is available on a wide variety of computer types including IBM, CDC, Univac 70, 90 and 1100, PDP 10, 11, 20, Honeywell, HP-3000, Burroughs 6700, ICL, Siemans, Xerox, Telefunken, Amdahl, Fujitsu, Hitachi and Riad. Constant attention to portability minimizes the effort in bringing the latest developments to all these computers.
Tentative compilation: A design for an APL compiler
Authors: Terrence C. Miller
Venue: Proceedings of the international conference on APL: part 1 (1979)

The overall design of an APL compiler which achieves significant savings of temporary storage is outlined. A graphical intermediate representation for APL expressions is described. Transformations which may be applied to this intermediate representation to select improved array access orders are presented with examples of the storage savings obtained.
Promoting ethicality in computing
Authors: A. Faye Borthick, Virginia K. Patterson
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

It is important for computing centers' users to practice ethical behavior in their computing activities. Most users act responsibly, but the few who do not have the potential for disrupting all users' work. Computing centers have the difficult role of striking a balance between securing computer systems against unauthorized access and making the systems accessible for legitimate and innovative uses. This paper describes the process of promoting ethical practices in educational computing. The process begins with recognition of the problem, namely, the lack of awareness of ethical considerations on the part of both users and computing-center staff. The lack of awareness was addressed with the publication of a computing-ethics survey in the computing-center newsletter. The results, also published in the newsletter, revealed that many users were unaware of ethical considerations and that there was a wide divergence of opinion about ethicality in a given situation. A computing center's responsibilities in promoting ethical behavior include 1) informing users of expected standards of behavior and punitive measures for gross misbehavior, 2) insuring that punitive measures are sufficient and have the support of the institution, and 3) enforcing the standards through prosecution of violators. This paper describes how these responsibilities were defined in practice, what the expected standards of behavior are, and how users are to be made aware of the standards.
Tabular representation of multivariate functions&mdash;with applications to topographic modeling
Authors: Barry W. Boehm
Venue: Proceedings of the 1967 22nd national conference (1967)

The data compression problem One of the outstanding problems confronting computer users is compact representation of functions of more than one variable. Most storage-limited computer programs devote a major part of their available memory to the representation of functions of more than one variable: e.g., equation-of-state tables in physics problems,1 optimal return functions in dynamic-programming problems,2 routing tables in communications simulations,3 tables of manpower and material in simulations of military theatre operation,4 function representation in meteorological and astronomical investigations,5 and representation of topographic information. This paper develops and analyzes tabular methods with respect to the topographic representation problem. However, the result are presented in terms of general smoothness and accuracy parameters; thus, they also apply to the other problems mentioned above.
Fault-tolerance and fault-intolerance: Complementary approaches to reliable computing
Authors: Algirdas Avižienis
Venue: Proceedings of the international conference on Reliable software (1975)

Two complementary methods wh&igrave;ch are employed in order to assure rel&igrave;able computing are fault-intolerance and fault-tolerance. Fault-intolerance depends on the el&igrave;m&igrave;nat&igrave;on of the causes of unreliability prior to the start of the computing process while fault-tolerance employs protective redunuancy during the computing process in order to detect and to correct unreliable funct&igrave;oning. A balanced allocation of reliability resources between the two methods appears to offer the best practical solution. The paper reviews current fault-tolerance practices in system architecture and discusses their relevance to software systems.
Architecture Definition Technique: Its objectives theory, process, facilities, and practice
Authors: Charles W. Bachman, Jacques Bouvard
Venue: Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control (1972)

The Architectural Definition Technique (ADT) is an approach to arriving at a complete, concise, non-ambiguous functional specification of a software or hardware system which is totally independent of packaging considerations. The Architecture Definition Process (ADP) contains six manageable steps leading to the creation and communication of the desired functional specification. Fundamental to the process and its theory, is (1) the reduction of the user visible entities into the system's state variables as represented by machine processable entity classes, attribute classes and set classes and (2) the establishment of the user interface as machine processable function definition algorithms. The Architecture Definition Facility (ADF) which supports the Architecture Definition Process is described. A case study defining the functionality of a File System is used for tutorial purposes
The binary representation of m-valued logic with applications to universal decision elements
Authors: John Loader
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

The binary representation of m-valued logic is considered and the number of unary functors available by virtue of this representation is found for certain values of m. The use of these unary functors in finding universal decision elements is investigated, two 4-place functors of 5-valued logic with the required properties are found, and the binary representation of one of them is given.
Multigrid adaptive image processing
Authors: M. Unser
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

We consider a general weighted least squares approximation problem with a membrane spline regularization term. The key parameters in this formulation are the weighting factors which provide the possibility of a spatial adaptation. We prove that the corresponding space-varying variational problem is well posed, and propose a novel multigrid computational solution. This multiresolution relaxation scheme uses three image pyramids (input data, weights, and current solution) and allows for a very efficient computation with an effective O(N) complexity, where N is the number of pixels. This general multigrid solver can be useful for a variety of image processing tasks. In particular, we propose new multigrid solutions for noise reduction in images (adaptive smoothing spline), interpolation/reconstruction of missing image data, and image segmentation using an adaptive extension of the K-means clustering algorithm.
A comparison of two network-based file servers
Authors: James G. Mitchell, Jeremy Dion
Venue: Proceedings of the eighth ACM symposium on Operating systems principles (1981)

This paper compares two working file servers in terms of their design goals, implementation issues, performance, and service experience. One server, the Xerox Distributed File System (XDFS) [10], was built at the Xerox Palo Alto Research Center; the other, the Cambridge File Server (CFS) [2, 3, 4], was built at the Cambridge University Computer Laboratory. Both file servers support concurrent random access to files over a network, and each offers an atomic transaction mechanism covering modifications to files.
The current state of proving programs correct
Authors: Ralph L. London
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

Presented are successful efforts in proving that computer programs are correct. Included are (i) the methods used, (ii) the wide class of programs (including systems programs) that have been proved, and (iii) implemented computer systems for demonstrating correctness. There is also a partially annotated bibliography.
Automatic generation of diagnostic programs for TOSBAC - 5400/150
Authors: Akira Miyoshi
Venue: Proceedings of the 10th Design Automation Workshop (1973)

Because the computer is playing an increasing important role in the community, its availability has become an essential and inherent factor. The availability of a computer is defined by the formula: availability &equil; 100&times;MTBF/(MTBF + MTTR) (%) where MTBF &equil; mean time between failures MTTR &equil; mean time to repair. The techniques for components such as MSI, LSI and IC and for manufacturing have drastically improved the MTBF during the relatively short history of the computer. However, no special systematic care has been taken to improve the MTTR, except the introduction of testing programs which verify functional operations of computer units. When a testing program encounters an irregular operation, it is not an easy task for a maintainer to find a failing component. As a matter of fact, much training is needed in this area for maintainers and customer engineers. Recently, a hardware-oriented fault diagnostic program was developed for medium-and large-scale computers. The main purpose of this program is to localize a failing component within some replaceable components. The diagnostic program is generated automatically, with considerations given to the logical or functional behavior of the computer components. This paper describes some phases of the fault diagnostic program for TOSBAC - 5400/150. The TOSBAC - 5400/150 is a microprogrammed computer with self-diagnosis capabilities. The design goal is to limit MTTR to less than 30 minutes and the diagnostic resolution is within three chips. The replaceable unit is an IC chip. The test pattern generator (TPG) was developed to generate the fault diagnostic program. The TPG is a total program system which comprises the logic extractor, the test generator, the test evaluator, the fault dictionary builder and the test editor. The test editor is the interface program of the TPG and the diagnostic hardware of the TOSBAC - 5400/150. (See Figure 1 for a schematic view of the TPG). Replacement of a part of the test editor makes it possible to generate a fault diagnostic program for a microprogrammable processor other than the TOSBAC - 5400/150.
A structural model of continuous transformation of handwritten characters
Authors: H. Nishida
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

An essential problem in handwriting recognition is how to cope with complex shape deformation, and therefore, the modeling of the deformation and its metamorphosis (transformation of an instance of a class into an instance of the other class via continuous transformation) is a key to breaking through the difficulties in handwriting recognition. Based on the structural feature extraction and description by Nishida (1995), we present a model for structural deformation with simple, local operations that preserve the global structure of the shape. Furthermore, we present an experimental approach to the analysis of metamorphosis of character shapes based on the structural deformation model.
An integrated design for testability and automatic test pattern generation system: An overview
Authors: Erwin Trischler
Venue: Proceedings of the 21st Design Automation Conference (1984)

A general overview on an Integrated Design for Testability and Automatic Test Pattern Generation System (IDAS) is given. The major components of IDAS include: heuristic controllability/observability (C/O) analysis, prediction of testing costs, tools for evaluation, display and improvement of testability, and C/O guided automatic test pattern generator. The IDAS system includes also the logic and concurrent fault simulator CADAT. A brief description of major components with a scenario how to use IDAS is given. Future research activities are discussed.
The reduction of a discrete event simulation to a Markov chain
Authors: Andrew S. Noetzel, Elaine J. Weyuker
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

An event-driven, time-based stochastic simulation model may be modified in a straightforward manner to satisfy the axioms of a discrete-state, continuous-time Markov chain. The method requires casting the probability distribution of each random variable representing a time interval of the process into the form of a series of exponentially-distributed stages. An algorithm for this transformation has been developed. The technique is demonstrated via a simple example of a computer system simulation. The Markov chain representation of the simulation can be solved numerically, providing an independent verification of the logic of the simulation.