ppxscal/embedding_network huggingface dataset:
Decision table programming and reliability
Authors: Art Lew, Doris Tamanaha
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The language in which programs are written influence their structure, style, reliability and verifiability. In this paper, we discuss the use of decision tables as a programming language, and related reliability questions. While both good and bad programs can be written in any language, it is suggested here that decision table programming is worth more serious consideration for general purpose computing.
A system for automatic software evaluation
Authors: B. C. Hodges, J. P. Ryan
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The production of consistently executable and dependable software demands a thoughtful systematic implementation&mdash;with clear documentation at each production stage. Recognizing this, the Data Systems Laboratory, at Marshall Space Flight Center, NASA, began a research effort to help discover and institute sound engineering principles into a methodology for the production of software. The design of this methodology is based upon five principal stages of software development: 1. Feasibility: Can software be written to solve the initial problem? 2. Requirements/Design: Are software requirements and design clear, complete, traceable, and testable? 3. Coding: Is use being made of reliable high level coding practices? 4. Testing: Is testing sufficiently thorough to instill initial user confidence? 5. Maintenance: has the software and its design been explicitly documented?
A technology-relative computer-aided design system: Abstract representations, transformations, and design tradeoffs
Authors: Edward A. Snow, Daniel P. Siewiorek, Donald E. Thomas
Venue: Proceedings of the 15th Design Automation Conference (1978)

This paper discusses the approach to global optimization taken in the C-MU register-transfer level computer-aided design system, currently under development at Carnegie-Mellon University, and gives examples of its application.
Techniques for the automatic selection of data structures
Authors: James Low, Paul Rovner
Venue: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages (1976)

We are all aware of the development of increasingly sophisticated, elaborate, and expensive computer programs, particularly in the fields of artificial intelligence, data base management, and intelligent systems. The need for techniques to deal with such complexity has renewed interest in programming language research. Recent work on structured programming, intelligent compilers, automatic program generation and verification, and high-level optimization has resulted. A pattern of approach similar to that of earlier research on programming languages is emerging. The work divides naturally into two parts: the search for good linguistic tools for expressing algorithms and data, and the development of practical methods for translating these to working computer programs. Our emphasis in this paper is in the latter.
Computer science needs its laboratory
Authors: Richard H. Stark
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

A Computer Science Department is no longer a novelty in our universities. On the other hand, the place of computer science in the university, the subject matter to be taught, and the way in which the teaching is done vary widely from one institution to another and with time at any single institution. My concern here is with an aspect of curriculum and of facilities which seems to have been inadequately appreciated. The subject matter is the massive array of programs constituting the software system through which the computer is used. My contention is that we have not understood the problem of teaching software systems and are not properly equipped to teach much more than &ldquo;Some Aspects of How Our Supplier's System Works.&rdquo;
Computer center consulting on personal computers: A changing role for a large computer center
Authors: Geof Goldbogen, Jon Finke, Richard A. Park
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

A large computer center in an academic setting generally supplies much of its computer services in terms of some large timesharing facility. In recent years the availability, power, and performance of minicomputers and microcomputers have made distributive systems more attractive than a single mainframe facility. As personal computers become more important at Rensselaer Polytechnic Institute (RPI), the consulting role of the center is changing. This paper discusses some of our experiences with this changing role.
The Data Reconfiguration Service&mdash;an experiment in adaptable, process/process communication
Authors: R. H. Anderson, E. F. Harslem, J. F. Heafner, Vinton Cerf, James Madden, Robert Metcalfe, Arie Shoshani, James White, David Wood
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

Application programs require specific I/O data formats that differ from program to program. One approach recently adopted for providing resource sharing of disparate programs is to develop specific dialogs for classes of programs. Each such program must then be retrofitted with one of the standard dialog interfaces. The DRS exhibits a different view of coupling variegated processes and terminals. The DRS attempts to provide a notation for form definition tailored to some specifically needed instances of data reformatting. At the same time, the DRS keeps the notation and its underlying implementation within some utility range that is bounded on the lower end by a notation expressive enough to make the experimental service useful, and bounded on the upper end by a notation short of a general-purpose programming language.
A Family Of Pass-Oriented Attribute Grammar Evaluators
Authors: Diane Pozefsky, Mehdi Jazayeri
Venue: Proceedings of the 1978 annual conference (1978)

A family of pass-oriented attribute grammar evaluators is presented and some of its members explored. This family includes some evaluators that have appeared in the literature and allows the simplification of one of these. Two of the new members presented are of particular interest. The first incorporates explicit ordering of attributes belonging to the same node of the parse tree and the second is well-suited to coupling with a bottom-up parser. The family provides a framework for description and comparison of its members and has interesting applications in compiler writing systems.
On the packing of micro-operations into micro-instruction words
Authors: Graham Wood
Venue: ACM SIGMICRO Newsletter (1978)

This paper discusses the problem of packing a serially expressed straight line segment of micro-program into micro-instruction words of a particular format. It outlines and compares the methods that have been proposed to solve particular instances of the problem and describes a program written to solve the general case.
A Feature Calibration Method For Watermarking Of Document Images
Authors: Tomio Amano, Daigo Misaki
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper describes a feature calibration scheme for use in embedding and detecting watermarks in document images. Such watermarks have a variety of uses, including copyright protection, content identification, and tamper-proofing. In general, a watermark is encoded as a displacement of certain features that can be extracted from target document images. One of the technical challenges is reliable detection of the displacement when images are distorted by print-and-scan processes.We propose a calibration method that uses the difference between two features extracted from two sets of partitions arranged symmetrically. Since this method counter-balances the cumulative effects on the features of distortions added in the print-and-scan process, the displacement can be reliably detected. The feasibility of the method was investigated by using the average width of character strokes is used as a feature.
An approach to software configuration control
Authors: William Bryan, Stanley Siegel, Gary Whiteleather
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

The purpose of this paper is to discuss the process by which a system's life cycle and its associated life cycle products are managed to ensure the quality and integrity of the system. We call this process configuration control. Although many of the ideas in this paper are applicable to systems in general, the focus of this paper is on configuration control of systems with software content. It is becoming apparent to many, in both government and private industry, that the high cost of maintenance of existing computer systems may be attributed to poor configuration control early in the system's life cycle. For example, in an article entitled "A Corporate Road, Map for Systems Development in the '80s, the following claim appears,
Global methods in the flow graph approach to retargetable microcode generation
Authors: Robert A. Mueller, Joseph Varghese, Vicki H. Allan
Venue: ACM SIGMICRO Newsletter (1984)

We have reported on local retargetable microcode generation methods based on the flow graph model in previous papers. In this paper, we consider the extension of these methods to global retargetable microcode generation. This includes intermediate representations of basic blocks containing control flow directives and their construction from global program dags, resource allocation and its interaction with code generation, machine-independent semantics and procedures for global microcode generation, and global compaction. The emphasis is on issues and promising directions for research on global methods vis a vis final results and definitive answers, as it reflects the early stages of our research.
The micro actuarial calculator - a case study
Authors: F. P. Jackson, W. Heabich
Venue: Proceedings of the 1981 ACM SIGSMALL symposium on Small systems and SIGMOD workshop on Small database systems (1981)

This paper describes an attempt to implement a large but well understood program on a microcomputer. The problems encountered are a lesson to any who think that the microprocessor revolution has provided full computer facilities at bargain prices.
Digital logic simulation at the gate and functional level
Authors: Phil Wilcox
Venue: Proceedings of the 16th Design Automation Conference (1979)

Simulation, in several forms, is used extensively in present day circuit design. The various forms of simulation can be categorized in terms of level of detail offered, ranging from circuit level (transistors, capacitors, etc.) to timing level (e.g., MOTIS (1)) to logic gate level (NAND, NOR, etc.) to register transfer level. As with a microscope, increasing the resolution decreases the field of view. This 'law' imposes a constraint on the size of circuit a designer can simulate at any one level of detail, and most simulation programs are rigidly defined to operate at only one level. This leads to obvious problems, for example, when a circuit is mixed analog/digital, although some progress has been made on incorporating circuit level and gate level detail in one program(2). However, digital circuit sizes keep increasing and even now the gate level often offers too much resolution. To keep simulation costs down and to avoid overwhelming the macroscopic features of a circuit with irrelevant data another level of digital logic simulation is required. The various Hardware Description Languages(3) are too far removed from the gate level to be of much use here as they represent a very large, discrete jump from the gate level, when we would prefer a continuum of simulation resolution.
Use of virus functions to provide a virtual APL interpreter under user control
Authors: J. B. Gunn
Venue: ACM SIGAPL APL Quote Quad (1984)

By inserting a simple statement at the beginning of an APL function, it is possible to cause the execution of a reconstructed version of the function, rather than of its original statements. This reconstruction can simulate the effect of an arbitrary change in the APL language; thus, the APL programmer can have available a private, &ldquo;virtual&rdquo; version of the interpreter We show some general- and special - purpose functions which can be used for this purpose, and give elementary examples of their application.
A time study in numerical methods programming
Authors: Glen B. Alleman, John L. Richardson
Venue: Proceedings of the sixth international conference on APL (1974)

With the digital computer firmly established as a research tool used by the scientist and engineer alike, a careful examination of some of the techniques used to solve the problems faced by the scientific user is warranted. This paper describes a test undertaken to determine the effectiveness of two different programming languages in providing solutions to numerical analysis problems found in scientific investagation. Some of the questions asked were; 1) Can APL compete with a batch processed FORTRAN job in solving common numerical analysis problems? 2) Is it useful to trade execution speed for code density or vice-versa? 3) Is APL an easier language, from the view-point of the novice user, in which to code his problem? 4) Can APL be cost effective in an environment where large &ldquo;number-crunching&rdquo; problems are an everyday event.
Use of lattice structures for reduction of simulation run time
Authors: Norman S. Matloff
Venue: Proceedings of the 16th conference on Winter simulation (1984)

The use of quasi-random numbers has been shown to produce significant reductions in simulation run time, for a given target level of accuracy. Such reductions come from the uniformity of the sampling process generated by the quasi-random numbers. In this paper, a method is proposed under which quasi-random numbers can be used to achieve even greater reductions in run time. The method applies to a large class of simulation operations, specifically those in which some time-consuming but updatable operation is performed.
Hierarchical modeling of operating system structure and behavior
Authors: William E. Riddle
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

This paper presents a scheme for the succinct modeling of computer operating systems. A software system may be viewed as a group of interdependent, asynchronously operating processes, and the scheme is oriented toward the description of the interconnections and interactions in such a representation. A concise but extensive description of a reasonably sophisticated supervisory system is presented as an example of the power of the modeling scheme. Since an integral part of the language is the ability to pass freely between rough descriptions (abstractions) of the system's organization and behavior and more detailed descriptions, models in the language can be used to advantage in gaining an understanding of the system. The language is of particular value during the design of a system, providing a tool to help the orderly evolution of the design and producing a description of the system that is significantly better than traditional documentation.
Firmware structure and architectural support for monitors, vertical migration and user microprogramming
Authors: Mamoru Maekawa, Ken Sakamura, Chiaki Ishikawa
Venue: ACM SIGARCH Computer Architecture News (1982)

This paper describes firmware and hardware support necessary for constructing easy-to-understand and high performance operating systems including language translators and interpreters. Basic principles are one-to-one correspondence between logical hierarchy and physical hierarchy, and vertical migration. Implementation of monitors in firmware and architectural support for it are discussed, and a sample system is shown. Architectural support for user microprogramming is then discussed and an example is shown. After a total system firmware structure is discussed, an experiment of vertical migration is described. It is shown that a proper selection of modules for migration is extremely important. It is suggested that the direction shown in this paper is one of future directions of computer systems.
An operating system implementation and simulation language (OASIS)
Authors: Brian W. Unger, James R. Parker
Venue: Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems (1979)

An approach to the implementation and simulation of system software for multicomputer architectures is described. OASIS, a variant of the SIMULA 67 language, provides tools for both hardware modelling and system software development. The latter includes an extensible module type with flexible intermodule access control. Hardware is characterized at the processor/memory level so that system software resource control and allocation policies can be implemented at a functional level. Concurrent module execution by multiple processors, with or without shared memory, can be simulated directly. The OASIS modules in such a simulation can closely parallel the structure of actual system software. Thus, once a design is shown viable by simulation, the implementation of actual software can be a simple translation of OASIS modules. A brief overview of OASIS features is presented followed by a simple example.
The USC chess program
Authors: Albert L. Zobrist, Fredric R. Carlson
Venue: Proceedings of the ACM annual conference (1973)

Much attention has been given recently to the &ldquo;linguistic&rdquo; approach to pattern recognition. The basics ingredients of this approach are a set of primitive picture parts and a grammar whose rules compose the primitive parts into a class of pictures. The basic idea of linguistic pattern recognition is to generalize string grammars to two dimensions. This requires a generalization of &ldquo;concatenation&rdquo; to two dimensions. Several applications have resulted from the definition of simple picture grammars[1-4]. This field should properly be called structural pattern recognition since its basic goal is to study the processing of the structure of pictures. From this viewpoint, one may ask whether simple grammars and the present concatenation schemes are adequate for the processing of complex scenes, or whether other approaches should be sought. These questions may be answered in the affirmative by considering the case of chess. The structure of a chessboard appears to be incredibly complex, yet humans seem to recognize familiar situations by means of structural organization of the board. Thus, chess seems to be an ideal paradigm case for complex structural pattern recognition. The USC chess program was produced from these studies. The remainder of this report will give a brief description of the chess program itself.
Automatic generation of functional logic test programs through simulation
Authors: Frank B. Cole
Venue: Proceedings of the 7th Design Automation Workshop (1970)

This paper describes the use of a logic simulation computer program to generate stimulus/response tables for a computer controlled functional logic tester. The approach has proven very successful, allowing 100 percent functional testing of complex units which were only partially tested manually. A typical unit tested required 20,000 entries to be generated for the 100 percent functional test. Approximately two man weeks were required to generate these tables by hand, the generation of the tables by computer simulation required four man days of engineering time plus 10 minutes of 1108 computer time. The simulation is now done as part of the design cycle, resulting in an even greater time saving.
Extending APL: What more can a programmer ask for?
Authors: Dragan Bozinovic
Venue: Proceedings of the international conference on APL (1982)

This paper explores certain underdeveloped parts of APL which ought to grow if APL is to qualify as implementation language for large and maintainable software systems. Following specific problems are discussed: * Integrating APL with other parts of information processing environment. &bull; Operating systems. &bull; Programs written in other languages. &bull; Data bases. * Using independently developed functions and subsystems. &bull; Problems with names. &bull; Problems with space. * Execution control of object attributes. * Communications among functions. &bull; Passing parameters. &bull; Returning values. &bull; Transferring control. * Information hiding modules. &bull; Packaging related functions. &bull; Packaging data with functions. &bull; Local functions.
Factoring polynomials over large finite fields*
Authors: E. R. Berlekamp
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

This paper reviews some of the known algorithms for factoring polynomials over finite fields and presents a new deterministic procedure for reducing the problem of factoring an arbitrary polynomial over the Galois field GF(p m) to the problem of finding the roots in GF(p) of certain other polynomials over GF(p). The amount of computation and the storage space required by these algorithms are algebraic in both the degree of the polynomial to be factored and the logarithm of the order of the finite field. Certain observations on the application of these methods to the factorization of polynomials over the rational integers are also included.
Simulation of the time-varying load on future remote-access immediate-response computer systems
Authors: H. A. Anderson,  Jr.
Venue: Proceedings of the third conference on Applications of simulation (1969)

A GPSS/360 program has been developed to model the behavior of a remote-access immediate-response computer system serving many concurrent users. Inputs to the model include characteristics of the users, the application category, the communication equipment, and the computer system. The model uses this information to determine the time-varying load imposed on the system in giving each on-line user immediate response.
On the parallel computation of local operations
Authors: Shi-Kuo Chang
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

The problem of parallel computation of local operations using five differently organized parallel processing machines (the SASD, SAPD, PASD, PAMD, and PAPD computers) is investigated. It is shown that for a special class of local operations, called window operations, there is a trade-off between computation time and machine complexity. It is also shown that for the PAMD computer, the computation time increases as the degree of disorderliness of the local operation increases. In conclusion, in the designing of special-purpose parallel processing machines, we must take into consideration the degree of disorderliness of the operations to be performed.
Exploiting the time-sharing environment
Authors: Thomas C. O'Sullivan
Venue: Proceedings of the 1967 22nd national conference (1967)

For the past two years, Raytheon Space and Information Division at Sudbury, Massachusetts has been exploiting the time-sharing environment for the benefit of its scientists and engineers. At first, a single terminal was rented and tied into a remotely located service offered by Bolt, Beranek, and Newman in Cambridge, Massachusetts. It was felt that as usage increased, additional terminals would be added to make use of the central computer. We were wrong. Before we needed a second terminal, the users required a second type of service. As the work load increased, a second terminal was added, but by then users were asking that a third type service be added.