ppxscal/embedding_network huggingface dataset:
Simulator-oriented fault test generator
Authors: Thomas J. Snethen
Venue: Proceedings of the 14th Design Automation Conference (1977)

The problem of generating tests for sequential logic networks has become severe with large-scale integration (LSI). Since the internal gates cannot be tested by direct measurements, it is imperative that a rigorous logic test be developed to ensure quality at the chip level. The sequential complexity of many LSI chips exceeds the practical limitations of the familiar technique of modeling sequential logic for the application of combinational logic test-generation algorithms. Although other approaches, such as pseudo-random pattern generation, have been tried with some success, the pattern count may be quite large. This paper describes a method of test pattern generation that was developed with three objectives: to generate long pattern sequences systematically when needed, to model the sequential logic accurately so that any test generated would be valid, and to focus on assumed faults such as stuck 1 and stuck 0. Also discussed are the strengths and limitations of this method and some comparative results.
Automatic information retrieval (Tutorial and Panel Discussion)
Venue: Proceedings of the ACM '81 conference (1981)

Information files of all kinds are now in common use&mdash;personnel records, parts inventories, customer account information, business correspondence, document holdings in libraries, patient records in hospitals, and so on. Information retrieval systems are designed to help analyze and describe the items stored in a file, to organize them and search among them, and finally to retrieve them in response to a user's query. Designing and using a retrieval system involves four major activities: information analysis, information organization and search, query formulation, and information retrieval and dissemination. The tutorial and panel discussion are designed to examine the current developments in the field and to point the way to the future. The emphasis in the discussion will be placed on modern on-line retrieval services, automatic indexing and abstracting and novel text matching systems.
Programming in natural language: &ldquo;NLC&rdquo; as a prototype
Authors: Bruce W. Ballard, Alan W. Biermann
Venue: Proceedings of the 1979 annual conference (1979)

The state of the art in computational linguistics has progressed to the point where it is now possible to process simple programs written in natural language. This report describes a natural language programming system called NLC which enables a computer user to type English commands into a display terminal and watch them executed on example data shown on the screen. The system is designed to process data stored in matrices or tables, and any problem which can be represented in such structures can be handled if the total storage requirements are not excessive.
Applications in the physical sciences: Clinical applications in medicine
Authors: T. D. Sterling, E. L. Saenger
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

CONTRIBUTIONS to medical sciences depend on the willingness of the research physician to use the computer as a matter-of-fact tool, just as he uses the microscope and other instruments. Where such conditions exist, contributions of some importance may be expected to emerge. At the University of Cincinnati Medical Center a computer has been used in such fashion for 5 years and one can already point to the direction in which future developments will take place. Criteria selected for our program are statistical as well as medical and serve to eliminate variables of no further interest in a consecutive search among possible multiple associations. Internal safety checks are built into the program which gauge the accuracy with which relevant associations are selected by the program. The output of the program consists of a partially written report of variables found to be associated, relevant tables, and an index of possible associations that were eliminated as unimportant together with reasons for their rejection. The basic outline of the program and its detailed application to a study of thyroid disease will be described.
Generalized finite Post algebras
Authors: J. C. Muzio, T. C. Wesselkamper
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

A generalized Post algebra is defined and discussed. It is proved that generalized Post algebras are complete whereas Post algebras, other than those based on a single totally ordered chain, are not. Techniques for the expression of arbitrary many-valued switching functions in the generalized Post algebra are described.
Compatibility: A barrier to applying technology to documentation
Authors: Stephanie Rosenbaum
Venue: Proceedings of the ACM '81 conference (1981)

This &ldquo;paper&rdquo; is a summary of the points I will raise during the SIGDOC panel on Using the New Technology at ACM '81. Because we plan a panel discussion with audience participation, I am only outlining here the subject areas I propose to discuss. Also, the problem of compatibility is not one for which there is a single &ldquo;answer&rdquo;&mdash;rather, there is a variety of approaches which have different advantages and disadvantages.
Limitations of synchronization primitives with conditional branching and global variables
Authors: R. J. Lipton
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

A formal model of the process concept is presented. This model can represent sets of processes that use the synchronization primitive PV or one of the many generalizations of PV. The study of synchronization problems is then reduced to the study of relations between sets of processes. For one relation&mdash; &ldquo;simulate&rdquo;&mdash;it is possible to show that there are differences between several synchronization primitives. These differences show that the relative &ldquo;power&rdquo; of these synchronization primitives is not the same.
A mixed-mode simulator
Authors: V. D. Agrawal, A. K. Bose, P. Kozak, H. N. Nham, E. Pacas-Skewes
Venue: Proceedings of the 17th Design Automation Conference (1980)

To provide flexibility and efficiency in logic and timing verification of MOS VLSI circuits, it is desirable that various portions of a circuit can be described and simulated at appropriate levels of detail. Such a capability is provided by the Mixed-Mode Simulator described here. This simulator allows different elements of a circuit to be modeled and simulated at different levels of detail. The modeling levels are MOS transistor level, logic gate level and functional level. The simulation levels are timing, multiple delay and unit delay. The simulator is being used on production LSI chips and its performance is discussed.
Declaration and addressing of Varying Density Arrays and structures
Authors: Gerhard E. Hoernes, Garth H. Foster
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

In current higher level languages arrays are parallelepiped in N dimensions, each dimension having an index range from a lower limit to an upper limit (both must be integers), the increment between valid index values being one. By removing the restriction of limits and increments to be integers or unity, a homogenously addressed sections or regions of an array is defined. Combining several of these regions each with its own limits and increments, but with common addressing, forms an array with varying data density. These new arrays are referred to as Varying Density Arrays (VDA). All data elements of a given region are restricted to a single format and structure. The element structure and format of one region in no way restricts elements in other regions. This generalization permits uniform addressing of conventional arrays, VDAs and PL/I or COBOL structures. This paper discusses (1) the concept of a VDA, (2) extensions to PL/I declarations to allow the definition of VDAs, (3) gives examples in PL/I and APL and discusses operations of VDAs and their subarrays. The paper touches on, but does not discuss, mappings to physical storage.
On-line simulation in the OPS system
Authors: Martin Greenberger, Malcom M. Jones
Venue: Proceedings of the 1966 21st national conference (1966)

OPS is an interactive system designed for general use in a time-sharing environment. It includes an on-line capability for building models and running simulations. Simulation activities are scheduled, canceled, or rescheduled dynamically on an AGENDA either at a specified time or when a prescribed condition is met. Activities can be made to consume simulated time by means of a delay for a certain period or a wait until given conditions are satisfied. The AGENDA is a time-ordered list of conditionally and unconditionally scheduled activities. Working within the multi-purpose framework of the OPS system, the user may inspect the AGENDA or some index of performance without stopping the simulation. He can also interrupt the run to make unprogrammed inspections and alterations. Before resuming, he can roll the simulation back to an earlier state that has been preserved, or perturb it in some other manner. Reference to data and activities is symbolic.
The factory of the future and simulation: An overview
Authors: Charles H. White
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

The Factory of the Future is possible with current hardware and software technology. It may include many different components but such manufacturing complexes must be planned, designed, and operated as coordinated systems. They will be information oriented; careful planning and design is critical to the operational and financial success of such systems. System simulation is proving to be an effective tool for dealing with these large and complex systems. This paper presents an overview of this increasingly important area of application and is intended to serve as an introduction for the other papers in this session.
Finding the depth of a flow graph
Authors: Amelia C. Fong, Jeffrey D. Ullman
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

The depth of a flow graph is the maximum number of back edges in a cycle free path, where a back edge is defined by some depth-first spanning tree for the flow graph. In the case of a reducible graph, the depth is independent of the DFST chosen. We show that the computation of the depth of a reducible flow graph may be done in polynomial time. Our algorithm is 0(ne) on a flow graph of n nodes and e edges. Since e&le;2n for normal flow graphs, our algorithm is really 0(n2). While even an 0(n2) algorithm is not likely to be acceptable, it is suggestive of the possibility of a more efficient algorithm. Finally, we show that the general problem of computing the depth of an arbitrary flow graph with respect to an arbitrary DFST is NP-complete.
People shortage or people productivity a workload analysis
Authors: Theresa Carroll, Patricia Hendershot
Venue: Proceedings of the eighteenth annual computer personnel research conference (1981)

This paper describes a recent effort at the U.S. Department of Agriculture's Washington Computer Center to assess the productivity of operations personnel in the Computer Resources Branch (CRB). Our objectives were to identify performance requirements for computer operators (GS-332) and technicians (GS-335) and to develop meaningful measurement and tracking systems to assess their productivity. This effort resulted in part from management's concern about adequate staffing, training opportunities, performance appraisal systems, and employee morale. Recommendations for data tracking, staffing and work distribution, training and career mobility, site modifications, and incentive programs have also resulted from this effort.
New approaches
Authors: F. G. Fielding
Venue: Proceedings of the SHARE design automation workshop (1964)

Somewhere in the course of the last two decades a word which conveniently describes our society today, and of this century, has almost dropped out of popular usage. Technology - which Webster defines as &ldquo;industrial science; the science of systematic knowledge of industrial arts&rdquo;. Our entire sociological structure is geared to technological advancement - not merely to maintenance of the status quo. It was estimated earlier that the approximately 250 men and women in these sessions represent some 1400 years of pure education, largely in mathematics, electronics and other areas directly related to computers - which, in themselves, represent a separate, unique industrial art. Add to these years the aggregate years of experience in the field and the mean of 6 years per man may well double - in a new, young unique industrial art. You represent here, Ladies and Gentlemen, the nucleus of one of the most significant single elements contributing to technological advancement in the world today - the element of knowledgeable computer applications.
Simulating with SIMSCRIPT
Authors: Yen W. Chao
Venue: Proceedings of the 5th conference on Winter simulation (1971)

The SIMSCRIPT programming system is especially designed to facilitate the writing of simulation programs. Digital simulations generally consist of a numerical description of &ldquo;status&rdquo;, which is modified at various points in simulated time by &ldquo;events&rdquo;. SIMSCRIPT simulations consist primarily of a collection of &ldquo;event routines&rdquo; written by the user describing how different kinds of events in a particular simulated world affect current status and cause future events. Status is described in terms of various &ldquo;entities&rdquo;, &ldquo;attributes&rdquo;, and &ldquo;sets&rdquo; as specified by the user.
Hierarchical control of robot vision by internal models
Authors: Ernest W. Kent
Venue: Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium (1984)

A robot sensory system developed for industrial robotics is described. Television frames and inputs from other sensors are interpreted by a hierarchically organized group of microprocessors. The system uses knowledge of object prototypes, and of robot action, to generate visual expectancies for each frame. At each level of the hierarchy, interpretative processes are guided by expectancy-generating modeling processes. The modeling processes are driven by a priori knowledge, by knowledge of the robot's movements, and by feedback from the interpretative processes. At the lowest level, other senses (proximity, tactile, force) are handled separately; above this level, they are integrated with vision into a multi-modal world model. At successively higher levels, the interpretative and modeling processes describe the world with successively higher order constructs, and over longer time periods. All levels of the hierarchy provide output, in parallel, to guide corresponding levels of a hierarchical robot control system.
Implementation of multilisp: Lisp on a multiprocessor
Authors: Robert H. Halstead,  Jr.
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

Multilisp is an extension of Lisp (more specifically, of the Lisp dialect Scheme [15]) with additional operators and additional semantics to deal with parallel execution. It is being implemented on the 32-processor Concert multiprocessor. The current implementation is complete enough to run the Multilisp compiler itself, and has been run on Concert prototypes including up to four processors. Novel techniques are used for task scheduling and garbage collection. The task scheduler helps control excessive resource utilization by means of an unfair scheduling policy: the garbage collector uses a multiprocessor algorithm modeled after the incremental garbage collector of Baker [2]. A companion paper [9] discusses language design issues relating to Multilisp.
Measuring computer program comprehension
Authors: John P. Boysen, Roy F. Keller
Venue: Proceedings of the eleventh SIGCSE technical symposium on Computer science education (1980)

While improved programming methodologies, better computer languages and more sophisticated programming aids have helped alleviate some problems associated with software development, a software crisis continues to exist. The software crisis continues partly because many of the suggested improvements in software development have emphasized the role of the computer, rather than the programmer, in the development process. Researchers are beginning to realize that the ultimate resolution of the software crisis will come only when we understand the human processes involved in software development. Computer program comprehension has been one of the human processes which has been studied by researchers. Two basic approaches have been used to study program comprehension. Using the first approach, an objective measure of comprehension is proposed based on the author's suppositions about the sources of complexity. A second approach used in the study of program comprehension is to empirically investigate factors which might affect comprehension. In the next section, a methodology is proposed to measure the comprehension of statements and programs. It is applied to study expression complexity in section three and selection statement complexity in section four. Implications for teaching programming are described in section five and the paper is concluded in section six.
Software tools - are we on the right track?
Authors: William E. Riddle
Venue: Proceedings of the 4th international conference on Software engineering (1979)

While there is currently a proliferation of software development tools and development support systems, they do not appear to be having an impact consonant with the expectations which led to their preparation. A recent workshop-style conference had the intent of assessing the current state-of-the-art in the area of software development tools, identifying the reasons underlying their diminished impact, and establishing directions for further advancement within the area of software development tools. The intent of this panel is to initiate discussion of these issues within the software engineering community at large by using a report upon the workshop-style conference as a focus of an open discussion.
Children and computers
Authors: John M. Morris
Venue: Proceedings of the ACM '82 conference (1982)

In this panel presentation, we explore three related issues: the competencies that children bring to computer learning, the effects of computer learning, and the more general effects of growing up in a computer-rich environment. The presentation is sponsored by the Society for Cognition and Brain Theory, an interdisciplinary study group in philosophy, psychology, linguistics, artificial intelligence, and neuroscience.
ACM investigation of self-assessment for the computing professional
Authors: Terry J. Frederick, Eric Weiss
Venue: Proceedings of the thirteenth annual SIGCPR conference (1975)

Self-assessment is a procedure based on tests covering knowledge in technical areas which allows an individual to determine his own activities for the purpose of keeping up with progress in his field. This procedure is a result of several underlying premises. Several people and organizations have been interested in a self-assessment program for the computing professional for some time. The current president of the Association for Computing Machinery, Jean Sammet, established an ACM ad hoc committee in October 1974 for the purpose of investigating the technical feasibility of self-assessment for the computing professional (see Appendix A for a list of members). This report describes the status of that committee's work along with their proposed planning.
Super-combinators a new implementation method for applicative languages
Authors: R. J. M. Hughes
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

There is a growing interest nowadays in functional programming languages and systems, and in special hardware for executing them. Many of these implementations are based on a system called graph reduction (GR), in which a program is represented as a graph which is transformed, or reduced, by the machine until it represents the desired answer. The various graph reduction implementations differ in the structure of the &ldquo;machine code&rdquo; (the program graph) and the compilation algorithms necessary to produce it from a source language. This paper describes a new implementation method using super-combinators which is apparently more efficient than its predecessors. Consideration of the new method also helps clarify the relationships between several other graph-reduction schemes. This paper is necessarily brief, but a fuller account can be found in [Hughes]. The simplest machine language we shall consider consists of constants combined by function application. This is the language of constant applicative forms (cafs). Some of the constants are basic functions.
Numerical methods for infinite Markov processes
Authors: P. J.B. King, I. Mitrani
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

The estimation of steady state probability distributions of discrete Markov processes with infinite state spaces by numerical methods is investigated. The aim is to find a method applicable to a wide class of problems with a minimum of prior analysis. A general method of numbering discrete states in infinite domains is developed and used to map the discrete state spaces of Markov processes into the positive integers, for the purpose of applying standard numerical techniques. A method based on a little used theoretical result is proposed and is compared with two other algorithms previously used for finite state space Markov processes.
Privilege Delegation and Agent-Oriented Access Control in Naplet
Authors: Cheng-Zhong Xu, Song Fu
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Access control in existing Java-based mobile agents is mostly based on code source due to limitations of early Java security architecture. That is, authorization is based on where the agent code comes from, regardless of the subject of code execution. This paper presents anagent-oriented access control strategy, by taking advantage of the latest Java subject-based security features. It allows the agents to exercise their privileges based on their own roles in distributed applications. The access control is realized by a group of additional agent-oriented permissions. They grant access control privileges to system resources and services in a flexible and secure manner. Permission implications between agents of different clone generations and from different owners are also supported.
Implementing relational views of programs
Authors: Mark A. Linton
Venue: Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments (1984)

Configurations, versions, call graphs, and slices are all examples of views, or cross-sections, of programs. To provide a powerful mechanism for defining, retrieving, and updating these views, the OMEGA programming system uses a relational database system to manage all program information. We have built a prototype implementation of the OMEGA-database system interface. This implementation includes the design of a relational schema for a Pascal-like language, a program for taking software stored as text and translating it into the database representation, and a simple, pointing-oriented user interface. Initial performance measurements indicate that response is too slow in our current environment, but that advances in database software technology and hardware should make response fast enough in the near future.