ppxscal/embedding_network huggingface dataset:
Computational complexity and numerical stability
Authors: Webb Miller
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

Limiting consideration to algorithms satisfying various numerical stability requirements may change lower bounds for computational complexity and/or make lower bounds easier to prove. We will show that, under a sufficiently strong restriction upon numerical stability, any algorithm for multiplying two n&times;n matrices using only +, &minus; and &times; requires at least n3 multiplications. We conclude with a survey of results concerning the numerical stability of several algorithms which have been considered by complexity theorists.
Microcode implemented General Modular Redundancy
Authors: F. P. Mathur, P. T. de Sousa
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

First the concepts of protective redundancy are described in the unified framework called General Modular Redundancy (GMR). GMR is a unified framework which synthesizes all the major redundancy techniques known. An alternative to an exclusively hardware implementation is by means of an extension to the Wensleyian Software Implemented Fault-Tolerance (SIFT) approach. A more attractive alternative, an implementation in microcode, is proposed and described here.
On minimal-program complexity measures
Authors: D. W. Loveland
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

Brief consideration is given to some properties of three measures of complexity based on the length of minimal descriptive programs. Although the measures explicitly deal with finite sequences, the complexity of an infinite sequence can be regarded as a function mapping each positive integer n to the complexity of the initial segment of length n. Some properties of a complexity hierarchy of infinite sequences with respect to one of the measures is considered.
DP personnel productivity - the peopleware problem
Authors: Duane C. Abbey
Venue: Proceedings of the 1979 annual conference (1979)

This presentation deals with the problem of productivity with in the data processing function from the perspective of the people involved in this type of endeavor. In discussing the area of data processing, and most of the other computer related fields, the three main areas of concern are: hardware, software and peopleware. Great strides are being made in the cost effectiveness of the hardware, the software problem is coming under close scrutiny, and it is now time to realize the criticality of the peopleware aspect. The people resources form a major asset to computer related endeavors, and we must become fully aware of the human nature of this asset not only in the organizational context, but in a broader context of the 'total' person - his/her abilities, desires, hopes, ambitions, needs, problems, etc. The approach of this presentation is to compare and contrast the organization/management viewpoint of this peopleware asset with the individual/personal viewpoint of the people involved. Included in this discussion are some of the newer tools that are in development to directly aid in productivity. The importance of these tools is their ability to enhance the individuals understanding of the problems at hand, and, as necessary, to reorient their problem solving philosophy. The key issue of change is addressed, particularly from the perspective of utilizing training and education as an instrument of change and growth. Various practices from the organizational viewpoint are presented - team structures, the performance continuum personnel practices, human resource accounting, and building an innovative climate. The responsibility of the individual is also discussed in terms of a personal individual management system. This system includes such topics as career management, personal assessment, stress management, personal goals, and vitality in terms of physical and mental health. The key issue is the ability of the cadre of technically able data processing managers to be able to reorient themselves to address the people that they are managing on a human basis instead of primarily on a technical basis.
Views on transportability of Lisp and Lisp-based systems
Authors: Richard J. Fateman
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

The availability of new large-address-space computers has provided us an opportunity to examine techniques for transferring programming systems, and in particular, Lisp systems, to new computers. We contrast two approaches: designing and building a Virtual Machine implementation of Lisp, and (re)writing the system in a &ldquo;portable&rdquo; programming language ('C'). Our conclusion is that the latter approach may very well be better.
English output of the physical examination in an automated medical record
Authors: Sara R. Jordan, Cathy J. Kreikebaum, Arthur Kretchmar
Venue: Proceedings of the 1975 annual conference (1975)

As part of the long-term project to create a medical information system for the University of Tennessee Memorial Research Center and Hospital, a computerized patient record is being developed. The physical examination portion of the medical record has been automated with software written in the MUMPS programming language. The present package allows a physician at a computer terminal to input (in a questionnaire format) physical examination findings which are then encoded into highly compressed alphanumeric strings and recorded unambiguously in a tree-structured data base. This paper describes the generation of conveniently readable output from the structures which resulted from the questionnaire. The English phrase output, rich with modifiers and multiple-level descriptors, is clear, concise and convenient to use.
The A -buffer, an antialiased hidden surface method
Authors: Loren Carpenter
Venue: ACM SIGGRAPH Computer Graphics (1984)

The A-buffer (anti-aliased, area-averaged, accumulation buffer) is a general hidden surface mechanism suited to medium scale virtual memory computers. It resolves visibility among an arbitrary collection of opaque, transparent, and intersecting objects. Using an easy to compute Fourier window (box filter), it increases the effective image resolution many times over the Z-buffer, with a moderate increase in cost. The A-buffer is incorporated into the REYES 3-D rendering system at Lucasfilm and was used successfully in the &ldquo;Genesis Demo&rdquo; sequence in Star Trek II.
The determination of digital simulation models for continuous systems by direct-search minimization
Authors: G. G. Leininger, H. R. Martens
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The representation of system characteristics by a discrete time model poses a fundamental problem in the field of digital simulation. In the majority of circumstances the problem consists of approximating a continuous time model well-defined in terms of a transfer function or state variable equation by difference equations or other forms convenient for computer processing. Examples representative of this approach are the Tustin method,1 Boxer-Thaler method,2 the Madwed-Truxal method,3 or the State Transition method.4 Equally important in the simulation field are the numerical integration methods such as the RungeKutta-Blum technique,5 the Runge-Kutta-Merson technique,6 or the Adams-Moulton technique.7 The latter class of techniques is applicable when the system equations are given in terms of first-order (linear or nonlinear) differential equations. A summary and comparison of the above techniques is given by Fryer and Schultz8 and Martens.9 The derivation of discrete analogs for continuous systems has also been discussed by Shaw.10
The PUMA project: Computer design automation in the university
Authors: Ralph Grishman
Venue: Proceedings of the ACM 1980 annual conference (1980)

We shall describe in this paper a project in the New York University Computer Science Department which over the past few years has designed and built a series of high-speed scientific computer systems. These systems have been dubbed PUMA Computers (for Processing Unit with Microprogrammed Arithmetic). A major emphasis throughout this project has been on computer-aided design, manufacture, and testing.
Computer-aided micro-analysis of programs
Authors: Jacques Cohen
Venue: Proceedings of the 4th international conference on Software engineering (1979)

An approach is described whereby one may, with the help of a computer, perform micro-analyses of programs by constructing their time-formulas. Time-formulas are symbolic formulas which express execution times as functions of variables representing the time needed to perform common, elementary operations (e.g., addition, assignment, subscripting, loop overhead). By binding the variables to numeric values corresponding to a specific machine, one can estimate program execution times without resorting to empirical tests. Some programs which have been analyzed using the suggested approach are reviewed in this paper. These include Strassen's matrix multiplication algorithm, deterministic parsers and a certain class of straight-line programs. The software tools which are desirable for performing the suggested type of analysis are also discussed. Finally, the paper outlines some of the related research problems which are worth investigating.
Concepts of a microcomputer design language
Authors: Yaohan Chu
Venue: Proceedings of the 16th Design Automation Conference (1979)

THE RAPID ADVANCE OF SEMICONDUCTOR DEVICE TECHNOLOGY MAKES THE CURRENT COMPUTER DESIGN TOOLS INADEQUATE. NEW TOOLS NEED TO BE DEVELOPED. THIS PAPER PRESENTS THE DEVELOPMENT OF A MICROCOMPUTER DESIGN LANGUAGE FOR US AS A TOOL TO MICROCOMPUTER ENGINEERS. SEVERAL UNIQUE LANGUAGE CONSTRUCTS HAVE BEEN CONCEIVED. ONE IS THE USE OF LEVEL NUMBERS TO PERMIT HIERARCHICAL DESCRIPTIONS OF A MICROCOMPUTER; IN THIS WAY, THE DESCRIPTIONS AT VARIOUS DEGREES OF DETAIL CAN BE OBTAINED. ANOTHER IS THE DESCRIPTION OF INTERCONNECTIONS AMONG THE CHIPS. A THIRD IS THE POSSIBLE PROVISION OF THREE LEVELS OF CHIP DESCRIPTIONS. A MOST IMPORTANT BENEFIT OF USING A DESIGN LANGUAGE IS THE USE OF A SIMULATOR FOR CHECKING OUT THE DESIGN. ANOTHER POSSIBLE BENEFIT IS THE USE OF A DATA BASE WHICH STORES CHIP DESCRIPTIONS. TOGETHER WITH THE SIMULATOR AND THE DATA BASE, A MICROCOMPUTER DESIGN SYSTEM COULD BE REALIZED.
An integrated analytical system for global range planning
Authors: T. E. Williamson
Venue: Proceedings of the 1967 22nd national conference (1967)

The mental image formed upon the first attempt to focus on a problem of the scope involved in systematizing the planning and scheduling functions of a space vehicle tracking range is truly overwhelming (Figure 1). Further investigation, however, while not diminishing the elephantine proportions of the problem, reveals considerable detail of importance. First, there was already at hand at the Air Force Eastern Test Range specific ADP capabilities that could be used almost directly in an integrated analytical system. Examples of such capabilities are those for trajectory and ephemerous computation, geometrical dilution of precision analysis, antenna pattern analysis, ship and aircraft scheduling routines, cost accounting data, and many others. With such assistance identified and the overall dimension of the task in view, the next step was to outline approach and methodology.
Global context recovery: A new strategy for parser recovery from syntax errors
Authors: Ajit B. Pai, Richard B. Kieburtz
Venue: Proceedings of the 1979 SIGPLAN symposium on Compiler construction (1979)

Methods for error recovery in parsing a deterministic, context-free language need not be derived by ad hoc means. When fixed, table-driven parsing algorithms are used the error recovery procedures can also make use of knowledge about the grammar for the language, derived from the parsing tables. However, at the point of detection of certain kinds of syntax errors, the knowledge of a sentential prefix already parsed, as reflected in the current state of the parsing stack, will be incorrect. Effective error recovery under such circumstances has proven to be difficult. We suggest the use of fiducial, or trustworthy symbols of a language as a key to recovery in these difficult cases. In this paper we give a characterization of such symbols in terms of properties of a grammar and give an algorithm that is capable of global context recovery under all circumstances. It has been implemented in conjunction with an LL(1) parser. We have compared it experimentally with the LR-parser recovery algorithm of Pennello and DeRemer on a test set of 126 small Pascal programs.
Architecture of a real time operating system
Authors: J. L. Pruitt, W. W. Case
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

Architecture is receiving increasing recognition as a major design factor for operating systems development which contributes to the clarity, and modifiability of the completed system. The MOSS Operating System uses an architecture based on hierarchical levels of system functions overlayed dynamically by asynchronous cooperating processes carrying out the system activities. Since efficient operation in a real time environment requires that the number of processes and process switches be kept to a minimum, the MOSS system uses processes only where a truly asynchronous activity is identified. The layers of the MOSS Operating System do not represent a hierarchical structure of virtual machine processes, but rather a hierarchy of functions used to create the processes. This paper describes the layering concepts and process concepts defining the system architecture. It also presents an overview of the specific functions and processes of the MOSS Operating System.
Documentation standards for beginning students
Authors: Richard K. Brewer
Venue: ACM SIGCUE Outlook (1976)

The importance of writing programs that are readable has finally gained preeminence in the struggle with such competing and contradictory goals as &ldquo;cuteness&rdquo; and &ldquo;optimization&rdquo; of code. As a result, a much greater stress on documentation standards is found in computer science education these days. Industry and government standards for documentation are being more widely adhered to and certain points of agreement have emerged. Some excellent books have been written that cover the subject (Van Tassel, 1974; Ledgard, 1975; Kernighan & Plauger, 1974); however it is safe to say that both the exhaustive treatment of the subject in such publications and the extremely high standards proposed probably preclude wholesale adoption by instructors of beginning level programming courses. What is proposed here is a set of common sense, scaled down documentation standards for the student in a first programming course in, say, FORTRAN, PL/I, ALGOL, or Basic. The following represents an amalgam of documentation requirements achieved as a result of teaching introductory programming to college students for nine years. The actual sources have been the literature, colleagues, and last but not least, experience. They are not intended to represent an &ldquo;only&rdquo; or &ldquo;best&rdquo; approach; the author has recently encountered other efforts in this direction that must surely be as reasonable and effective. It does represent one educator's approach; it is sufficiently scaled down so that one might reasonably expect to use it as a standard for beginning students; and it may be most useful as a contributor of components to be integrated into a more effective set of standards. The basics of documentation and readable programming include comments, meaningful variable names, labelled output, flowcharts, and clear program flow. The major components of and basic rules for each of these categories will be presented in the context of the needs and limitations of the beginning student.
MRS: A microcomputer database management system
Authors: Robert Hudyma, John Kornatowski, Ivor Ladd
Venue: Proceedings of the 1981 ACM SIGSMALL symposium on Small systems and SIGMOD workshop on Small database systems (1981)

The purpose of this paper is to discuss the development and use of microcomputer database management system and choices for design and implementation are discussed. The development of a substantial piece of software, designed for modest machines, is also discussed.
Systems programming in concurrent prolog
Authors: Ehud Shapiro
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

Concurrent Prolog [28] combines the logic programming computation model with guarded-command indeterminacy and dataflow synchronization. It will form the basis of the Kernel Language [21] of the Parallel Inference Machine [36], planned by Japan's Fifth Generation Computers Project. This paper explores the feasibility of programming such a machine solely in Concurrent Prolog (in the absence of a lower-level programming language), by implementing in it a representative collection of systems programming problems.
A model highlighting the security of operating systems
Authors: Richard W. Conn, Richard H. Yamamoto
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

The major thrust toward providing secure computing facilities has gone into the design of, or models for, new operating systems. Work directed toward securing current systems has, for the most part, taken the form of penetration attempts. Penetration efforts have led several authors to identify generic weaknesses, but grouping by weakness has not led to formal methods. An approach showing greater promise in identifying trouble spots, as well as characterizing existing operating systems in a more general sense, lies in forming graph models in which nodes are program modules or data structures, and arcs are access or shared resource synchronization paths. A given system should be capable of reduction to a graph of this sort by appropriate analysis of its load modules.
An Integrated FORTH System
Authors: Kam-Wing Ng, Wai-Yan Ma
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

An Integrated FORTH Development System is described, which differs from the usual FORTH implementation in that certain of its facilities such as the editor and the file system are integrated with the host environment. This integrated approach simplifies the implementation effort by reducing redundancies but still provides a powerful development system which is especially suitable for creating stand-alone FORTH programs.
Updating your users skills
Authors: Mary E. Sherer
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

This paper discusses about the updation of the new or more advanced features, to the users.
A generalized approach to document markup
Authors: C. F. Goldfarb
Venue: ACM SIGPLAN Notices (1981)

Text processing and word processing systems typically require users to intersperse additional information in the natural text of the document being processed. This added information, called &ldquo;markup,&rdquo; serves two purposes: 1. it separates the logical elements of the document; and 2. it specifies the processing functions to be performed on those elements.
Modeling motion blur in computer-generated images
Authors: Michael Potmesil, Indranil Chakravarty
Venue: ACM SIGGRAPH Computer Graphics (1983)

This paper describes a procedure for modeling motion blur in computer-generated images. Motion blur in photography or cinematography is caused by the motion of objects during the finite exposure time the camera shutter remains open to record the image on film. In computer graphics, the simulation of motion blur is useful both in animated sequences where the blurring tends to remove temporal aliasing effects and in static images where it portrays the illusion of speed or movement among the objects in the scene. The camera model developed for simulating motion blur is described in terms of a generalized image-formation equation. This equation describes the relationship between the object and corresponding image points in terms of the optical system-transfer function. The use of the optical system-transfer function simplifies the description of time-dependent variations of object motion that may occur during the exposure time of a camera. This approach allows us to characterize the motion of objects by a set of system-transfer functions which are derived from the path and velocity of objects in the scene and the exposure time of a camera.
StarOS, a multiprocessor operating system for the support of task forces
Authors: Anita K. Jones, Robert J. Chansler,  Jr., Ivor Durham, Karsten Schwans, Steven R. Vegdahl
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

StarOS is a message-based, object-oriented, multiprocessor operating system, specifically designed to support task forces, large collections of concurrently executing processes that cooperate to accomplish a single purpose. StarOS has been implemented at Carnegie-Mellon University for the 50 processor Cm* multi-microprocessor computer.
Installation of a commercial database management system in a university environment
Authors: Pentti A. Honkanen
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

This paper addresses the problem of using a commercial database management system (DBMS) in an academic environment for educational purposes. Prior to the decision to use a commercial DBMS, an instructional database IDBS [4] was used. The pros and cons of this decision are discussed. In addition, the problems of obtaining a commercial DBMS on an academic budget for instructional purposes, and of creating a reasonably realistic database are discussed. Finally, an evaluation of the initial quarter's use is presented. The environment for this discussion is the Georgia State University College of Business Administration Information Systems Department graduate database course. This course is offered three times a year with approximately 20 students per offering. DBMS are extensively being used in business areas [2,9,14,15]. As more DBMS are being installed, the sophistication and complexity of these systems is increasing [9,12,13]. This fact makes it imperative for the graduates in the Information Systems field to have a solid understanding of a DBMS and how it is used in a business environment. Without actual experience using a DBMS one cannot fully understand systems of such complexity. This understanding cannot be obtained from text reading and lecture. This situation is analogous to learning a programming language without actually ever using a computer.
Students as consultants: The U. S. coast guard academy's tutor program
Authors: Mary E. Sherer
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

In a Star Wars future we very well may have computers that talk and robots with emotions, but at present we do not have ThreePio to decipher what our computers are saying. That job usually falls to the consultants in the User Services sections of computer centers. Consulting is not the only service provided by User Services, but consultants are the primary interface between user and machine. It is not unusual for computing centers to hire students as consultants, but, because the U. S. Coast Guard Academy is in the unusual position of being unable to hire its students, the Academy's Computing Center was forced to come up with something different in order to provide a good part of its consulting service. The Computing Center staff and students worked together and designed what is now called &ldquo;the Tutor Program.&rdquo;