ppxscal/embedding_network huggingface dataset:
A system of computer aids for designing logic circuit tests
Authors: Mark J. Flomenhoft
Venue: Proceedings of the 7th Design Automation Workshop (1970)

A system of computer programs which aid in generating and validating logic circuit tests is described. Easy to use and available on a time-share computer, the system includes: 1) a preprocessor that translates a logic topology from a simple input language to binary (machine readable) form and determines indistinguishable fault sets, 2) an automatic test sequence generator for combinational circuits, and 3) a fault simulator for asynchronous sequential circuits. The faults considered are those causing any single wire branch to be fixed at logic 0 or fixed at logic 1. Wires which fan-out are simulated with independent faults on each fan-out branch as well as with faults common to all the fan-outs. Gates are simulated with unit delay and are allowed three possible logic values&mdash;0, 1 and &ldquo;don't know&rdquo;. &ldquo;Don't know&rdquo; is the starting value on every gate, representing the uncertainty of internal states when power is applied to a circuit. &ldquo;Don't know&rdquo; is also used to settle critical races and oscillations.
Many-valued propositional intuitionism
Authors: Charles G. Morgan
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

The semantics for intuitionistic logic is based on &ldquo;proof&rdquo; rather than on &ldquo;truth&rdquo;. Since we frequently classify proofs in various ways, we are naturally motivated to consider many-valued theories of intuitionism. In this paper we provide a general syntactic and semantic theory for many-valued propositional intuitionism, where the values intuitively refer to types of proofs. Soundness and completeness results are presented, and it is shown that the many-valued theory is a conservative extension of the usual intuitionistic propositional calculus.
A policy analysis for logistical support of multiple U.S. army contigency requirements
Authors: Thomas D. Clark,  Jr., George C. Prueits, Robert L. Smith
Venue: Proceedings of the 16th conference on Winter simulation (1984)

An analysis of policy options for management of logical support of U.S. Army combat operations in limited conflicts (contingencies) is contained in this paper. Development and testing of a SLAN simulation model are discussed and a method of analyzing policy options presented. Results indicate that support can be enhanced through development of an improved priority system for supply allocation, development of supply centers in other than the Untitled States, and through use of systematic diversion policies.
The Tangible File System
Authors: Alexandros Karypidis, Spyros Lalis
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

The "tangible file system" is a document management and access infrastructure for the ubiquitous computing era. It provides a transparent user interface which takes advantage of physical user actions for the purpose of directory management, data sharing and document location tracking. This is achieved by digitally augmenting both documents and documentcontainers to detect the location of physical information and to trigger corresponding update actions in the electronic world. The system is built using the Datlet [9] architecture to allow any tool-objects' to be applied to data-objects', thereby enabling an even more natural user interaction based on affordances.
A cooperative approach to software development by application engineers and software engineers
Authors: Keiji Uemura, Miki Ohori
Venue: Proceedings of the 7th international conference on Software engineering (1984)

We have tried a new project management approach for the development of engineering application software systems. The key factor of this new approach is the introduction of the role of &ldquo;Interpreter&rdquo; who sits in between application engineers and programmers and handles all of the communication problems among them. Our major objectives were: (1) To release application engineers from unfamiliar programming tasks as much as possible. (2) And to increase the productivity of a small group of technical staffs. Experiments upon real projects resulted in much greater improvement of productivity and quality than we had expected. And also the morale of team members was improved. This paper describes the results of these experiments and the characteristics of this new development approach in comparison with the traditional one.
TRACE&mdash;III: An implicit programming system for inductive data analysis
Authors: Alvin S. Cooperband, William H. Moore,  Jr., Robert J. Meeker, Gerald H. Shure
Venue: Proceedings of the 1971 26th annual conference (1971)

A previous on-line data analysis system has been generalized and extended on a Digital Equipment PDP-10 computer into an implicit programming system utilizing a special-purpose programming language aimed at behavioral scientists with little or no data processing background who desire to perform special-purpose data analyses or examine their data from an inductive as well as a deductive stance. Central to this new system is a comprehensive data management subsystem that retrieves data from a data base according to implicit associations among data units; that updates the data base with the results of data manipulations in a way that preserves associations among existing data units and establishes such associations with new data units; and that relieves the user of all responsibility for database and file management.
Fast hardware random number generator for the Tausworthe sequence
Authors: Meir Barel
Venue: Proceedings of the 16th annual symposium on Simulation (1983)

Many simulation programs require m-dimensional uniformly distributed random numbers. A linear recurrence modulo two generator, based on N-bits and producing L-bit numbers (L &le; N), according to Tausworthe theory, may yield a sequence of m-tuples uniformly distributed in m &equil; (N/L) dimensions. When using software computing algorithms on a binary computer, for large N (e.g. N &equil; 159), the generation speed is for many purposes too slow. To overcome this disadvantage we present a new concept of a hardware random number generator, to give the Tausworthe sequence with high generation speed independent of the number of bits per word N. For a 32-bit data word computer we have performed statistical tests on three generators, two of them gave good results.
Mechanisms for comparing chess programs
Authors: T. A. Marsland, P. G. Rushton
Venue: Proceedings of the ACM annual conference (1973)

The scientific utility of computer chess tournaments is questioned and two alternative means of comparing chess programs are examined. Regardless of the programming language employed or the background load on the host machine, a means is provided for measuring the efficiency of chess algorithms.
Phoan: An intelligent system for distributed control synthesis
Authors: John DeTreville
Venue: ACM SIGPLAN Notices (1984)

Phoan is an experimental system for the specification and synthesis of control software over suitably restricted domains; its initial application domain is control software for distributed telephone systems. Phoan provides the developer with an example-based specification language, which it translates into an internal representation language based on rules and constraints. Phoan reasons at the representation level to ensure that the system definition is coherent and consistent with independent models of the target domain. Phoan synthesizes the final control structures and their associated protocols by transformation from the internal representation. The implementation of Phoan is currently in progress.
A SAINT model of the AN/TSQ-73 Guided Missle Air Defense System
Authors: David B. Wortman, Alonzo F. Hixson,  III, Charles C. Jorgensen
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

With the development of increasingly complex weapons systems, the Army community has become sensitive to the need for accurate assessment of the human performance components of such systems. Because human operators are integrally tied to a dynamically changing weapons environment, it is becoming increasingly difficult to assess overall system performance without considering the human element. As a result, a computer simulation model of the AN/TSQ-73 Guided Missile Air Defense System operator/repairman was developed to demonstrate the capability to estimate human and other system performance measures using digital simulation. SAINT, a combined discrete/continuous network simulation language, was used as the vehicle for developing the model. This paper describes the SAINT network simulation model of the AN/TSQ-73 system in which the operator/repairman monitors targets and controls the assignment of fire units through the use of a visual (CRT) display of flight paths and parameters.
A systolic (VLSI) array using RNS for digital signal processing applications
Authors: M. A. Bayoumi, G. A. Jullien, W. C. Miller
Venue: Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium (1984)

A high speed one-dimensional systolic array is proposed for implementing finite impulse response (FIR) digital filters.The structure is completely pipelined, that is, the throughput rate (bits/sec.) is independent of the filter length.Residue Number System (RNS) is used for implementing the mathematical operations.RNS has a parallel nature where the arithmetic operations are performed independently for each modulus which enhances the system speed.VLSI is used as a fabrication medium which supports the modular implementation.The building block unit is a multi-look-up table module which has two possible configurations.The area-time complexity of an FIR structure is analyzed based on an RNS computational model.
Programs for verifying circuit connectivity of mos/lsi mask artwork
Authors: Makoto Takashima, Takashi Mitsuhashi, Toshiaki Chiba, Kenji Yoshida
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes three programs which perform connectivity rule check, logic gate recognition for logic simulation and circuit connectivity comparison. These programs have been developed for verifying circuit connectivity extracted from mask artwork. Powerful algorithms are used in these programs, including a heuristic graph comparison algorithm, to realize highly practical verification aids. Through the combined use of these programs, more cost-effective verification is possible.
Operational measurements on a high performance ring
Authors: R. L. Gordon
Venue: Proceedings of the Computer Network Performance Symposium (1982)

Application and system software architecture can greatly influence the operational statistics of a local network. The implementation of a transparent file system on top of a high bandwidth local network has resulted in generating a high degree of file traffic over the local network whose characteristics are largely fixed and repeatable. These statistics will be presented along with arguments for and against designing mechanisms that optimize specifically for that class of traffic.
Resource allocation in rectangular CC-banyans
Authors: Eli Opper, Miroslaw Malek, G. Jack Lipovski
Venue: ACM SIGARCH Computer Architecture News (1983)

A resource allocation problem in a reconfigurable multicomputer architecture based on rectangular CC-banyan multistage interconnection network with arbitrary fanout and arbitrary number of levels is studied. Four commonly used problem structures such as ring, pipeline, broadcast and macropipeline are introduced and the mapping problem of these structures on the system model which is camparable to the resource allocation problem, is discussed. Analytic solutions to several mapping questions are presented and a new fault diagnosis method based on the solution to the problem of mapping the ring structure is given.
A language orientation for the discrete event modeling of application programs and operating systems
Authors: Leo J. Cohen
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

Discrete event simulation of computer programs, particularly operating system programs, has until recently been an elusive objective of computer performance simulation. However, out of my own experience and my observations of the efforts of others, I have come to believe that the most direct approach to achieving such a simulation capability is essentially linguistic. I consider these subjects to be basic to any appreciation of the necessary aspects of a linguistic capability, and with these concepts in hand, I then turn to discussion of an explicit language orientation. This is broken down into two major categories, the first for representing the logic of a program and the second for representing the loads that this logic imposes on the system.
Almost alike programs
Authors: Robert N. Chanon
Venue: Proceedings of the 1966 21st national conference (1966)

As a part of the introductory computation course at Carnegie Tech, each student is asked to debug algorithms for solving several problems using the ALGOL translator on the CDC G-21 computer system. When the student feels that he has a correctly running program, he hands it in, and then the entire batch of programs submitted for the problem is run with different data than was available for the debugging runs. The results of this run are then returned to the recitation instructors who grade the programs and return them to the students. Unfortunately, very little is known about the ways in which S205 students write their programs, i.e., the &ldquo;programming technique&rdquo; they use in their programs. We have no way of knowing how many students use for statements and procedures in their programs rather than simple loops and code repetitions, without explicitly examining each program. Clearly, information of this sort would be useful to the instructor both as an aid to his teaching, and as an aid to composing the TEACH problems. The aim of this project has been to gather information of this sort, in particular with respect to &ldquo;similarities&rdquo; between ALGOL programs. The entire batch of programs submitted for each problem has been taken and analyzed on the basis of each program's general structure. A by-product of this analysis has been a program which can find very similar programs. Such programs might be the result of cheating. This has always been a problem, especially if the class is large. It is very easy for a student to duplicate someone else's deck and about as easy just to change the physical appearance of the program or a few of its identifiers. Clearly a program of this sort would be a valuable time-saver for the Computation Center.
Every user is not amiable
Authors: David Dearth
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

In the last few years attempts have been made to communicate more effectively with those who use computer services. It is apparent that the hexadecimal jargon and acronyms of the computer professional confuse many users and efforts have been initiated to provide clear, instructive oral and written communication. This particular task requires someone who is relationship or people oriented and who possesses skills and training in areas such as verbal and nonverbal communication, technical writing and psychology as well as computer science. The ideas expressed in this paper were derived from a talk given by Dick Gottlieb of IBM at SHARE 48. The information contained in this paper is not intended to be a factual description of behavior classification. Rather, it is intended to be a somewhat entertaining talk designed to get people to think about the other person.
The CAP filing system
Authors: R. M. Needham, A. D. Birrell
Venue: ACM SIGOPS Operating Systems Review (1977)

The filing system for the CAP is based on the idea of preservation of capabilities: if a program has been able to obtain some capability then it has an absolute right to preserve it for subsequent use. The pursuit of this principle, using capability-oriented mechanisms in preference to access control lists, has led to a filing system in which a preserved capability may be retrieved from different directories to achieve different access statuses, in which the significance of a text name depends on the directory to which it is presented, and in which filing system 'privilege' is expressed by possession of directory capabilities.
A computer program for discovering and proving recognition rules for Backus Normal Form grammars
Authors: Ralph L. London
Venue: Proceedings of the 1964 19th ACM national conference (1964)

This paper is based upon a running computer program which will discover rules for the recognition of grammatical strings when given a simple Backus Normal Form (BNF) grammar [10]. The program attempts to prove that these rules are both necessary and sufficient to characterize grammatical strings. The main mathematical techniques that are mechanized are induction and case analysis. In addition, the program is capable of producing counter-examples. There are two reasons for writing this program. First, we are interested in constructing efficient recognizers for simple BNF grammars. Second, the task of proving that a proposed recognizer is indeed a recognizer is sufficiently complex and difficult to make it a convenient area for proving theorems by machines, especially theorems whose proofs may use fairly involved case analysis.
APL curvilinear regression and associated problems
Authors: M. P. Racite, S. R. Dickstein
Venue: Proceedings of the international conference on APL (1984)

This paper describes an APL program package for fitting data to a useful set of precoded nonlinear curves. The user need not understand the details of the internal algorithms. Graduated help levels are provided by the interactive programs. Regression methods, and treatment of the related nonlinear normal equations, APL DOMAIN errors, and matrix singularity problems are discussed. For modified forms of exponential or power expressions, where the resulting normal equations are nonlinear, a novel iterative-search and least-squares combination solution method is presented.
Scheduling of tasks for distributed processors
Authors: Ravi Mehrotra, Sarosh N. Talukdar
Venue: ACM SIGARCH Computer Architecture News (1984)

The paper describes a technique for estimating the minimum execution time of an algorithm or a mix of algorithms on a distributed processing system. Bottlenecks that would have to be removed to further reduce the execution time are identified. The main applications are for the high level design of special purpose distributed processing systems. The distributed systems are modelled by P, a set of nonidentical processors and R, a set of resources that the processors can use. The algorithms are modelled by T, an ordered set of tasks. The problem of optimally assigning the processors to the tasks while meeting the resource constraints is NP-complete. However, a heuristic using maximum weighted matchings on graphs has been devised that is extremely fast and comes reasonably close to the optimal solutions.
Computer system design description
Authors: Yaohan Chu
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes language constructs for creating a very high-level language as a tool for computer system design. In order to describe the complexity of a computer system, this language permits descriptions in a heirarchical manner at different levels of system detail and at various cross-sections of system structure. It allows descriptions of system hardware, system software, and the interactions between system hardware and software.
Computer-assisted telephone interviewing in the survey research process (Panel Discussion)
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

Research on human populations often involves the use of survey methods for information collection. A recent innovation in the methods available has been the use of computer-assisted telephone interviewing (CATI). The computer may be utilized for such tasks as work scheduling for the interviewers, respondent selection through random digit dialing, presentation of question text on the screen of the interviewer's terminal, dynamic modification of question text to insert respondent's name or other &ldquo;personal touches,&rdquo; checking of data validity, branching around irrelevant questions based on prior responses, and many other aids to the operation of the process. The members of this panel are all actively engaged in using CATI. They will be discussing the impact, both good and bad, these systems have on the people involved. The reactions of interviewers to these systems, such as appreciation of the work aids provided or anger at being forced to do things as the machine demands, will be considered. The survey respondent may be effected, changing the willingness to respond or the quality of information obtained. The supervisors and researchers using CATI may find themselves able to do data collections that are better quality, do them sooner, and have them lower in cost, but may also find much time being devoted to unexpected problems and greater demand for rigorous project management. In short, these CATI systems are having important consequences for everyone involved. The panel members will be reviewing what is currently known about these human factors and how the design of these computing systems may evolve as a result.
Functional geometry
Authors: Peter Henderson
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

A method of describing pictures is introduced. The equations, which describe the appearance of a picture, also form a purely functional program which can be used to compute the set of lines necessary to plot the picture on a graphical device. The method is illustrated by using it to describe the structure of one of the woodcuts of Maurits Escher.
Scope of the OIS/OA project
Authors: D. D. Lombardi
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

WHY is Xerox Computer Services working on Office Automation? First, because our national financial picture has seen ever increasing inflation. The cost of almost everything has increased dramatically, including the cost of doing business. A large part of the cost of doing business is administrative costs. Office automation concerns itself with administrative costs of labor (clerical and professional) and time (timely delivery of information). When we look at the future, we know that we have to find better ways of getting information from our heads, pens, and typewriters to those who need it. We're not going to be able to rely on once plentiful secretarial or clerical support staff, because we are already feeling a shortfall of these administrative personnel, and in the future, we will see a decreasing population. The ability of a company to stay price-competitive in any marketplace hinges on its recognition of the need to automate certain functions within the office, so that employee talent can be applied to successfully achieving the overall goals of the company and meeting new challenges.
Network performance reporting
Authors: K. Terplan
Venue: Proceedings of the Computer Network Performance Symposium (1982)

Managing networks using Network Administration Centers is increasingly considered. After introducing the information demand for operational, tactical and strategic network management the paper is dealing with the investigation of the applicability of tools and techniques for these areas. Network monitors and software problem determination tools are investigated in greater detail. Also implementation details for a multihost-multinode network including software and hardware tools combined by SAS are discussed.