ppxscal/embedding_network huggingface dataset:
Local and global properties in networks of processors (Extended Abstract)
Authors: Dana Angluin
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

This paper attempts to get at some of the fundamental properties of distributed computing by means of the following question: &ldquo;How much does each processor in a network of processors need to know about its own identity, the identities of other processors, and the underlying connection network in order for the network to be able to carry out useful functions?&rdquo; The approach we take is to require that the processors be designed without any knowledge (or only very broad knowledge) of the networks they are to be used in, and furthermore, that all processors with the same number of communication ports be identical. Given a particular network function, e.g., setting up a spanning tree, we ask whether processors may be designed so that when they are embedded in any connected network and started in some initial configuration, they are guaranteed to accomplish the desired function.
An excellent mixture for PSI: Computer science, PLATO, knowledge levels.
Authors: Kenneth L. Modesitt
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Introductory computer science courses offer an excellent test bed for utilizing a personalized system of instruction. The ubiquity and operating hours of computer terminals and computer centers in educational institutions is ideal for student self-pacing. The rapid response time of computers is a positive reinforcement when solving problems. The recent advent of the PLATO computer-based educational system provides many opportunities for students and faculty in computer science and many other disciplines. PLATO terminals provide a powerful motivational tool for PSI. Motivation is a critical part of computer science courses. Students are expected to acquire synthesis-level skills in the cognitive domain. This level of knowledge is higher than the level of skill, memorization or rule application, required for many other introductory courses. An Excellent Mixture for PSI: Computer Science, PLATO, and Knowledge Levels.
An extension of relational database model to probabilistic data
Authors: Renzo Beltrame
Venue: ACM SIGAPL APL Quote Quad (1984)

In many applications, for example in representing data concerning historical &ldquo;objects&rdquo;, alternatives are the rule; so we are led to a probabilistic scheme in their representation. A deterministic approach, which underlies actual DBMS types, leads to very poor results, and, in certain cases, to misleading ones too. An extension of relational model is proposed to take into account these aspects, and the effects of a non-deterministic approach on operations concerning both relations and database are examined. A formal description of this extension is presented with reference to the internal representation of data. The effects on the queries are outlined. A representation as a general array is discussed which preserves the typical properties of the relational model with deterministic data, and the form of the operations.
Program evolution and its impact on software engineering
Authors: M. M. Lehman, F. N. Parr
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Large scale, widely used programs such as operating systems are never complete. They undergo a continuing evolutionary cycle of maintenance, augmentation and restructuring to keep pace with evolving usage and implementation technologies. The paper provides quantitative evidence, from widely different environments, of the existence and nature of this evolutionary process. Interpretations and possible significance of some of the observed phenomena are discussed. Some implications for software engineering and for project planners and managers are noted.
Generic programming: APL and Smalltalk
Authors: Alan C. Kay
Venue: ACM SIGAPL APL Quote Quad (1981)

Early generic concepts in programming languages were mixed-type arithmetic (e.g., &ldquo;+&rdquo; used with any combination of fixed- and floating-point numbers) and &ldquo;print&rdquo; functions which could be applied to any of a language's objects. Generic concepts reduce the number of terms which must be remembered and permit considerable condensation of language design. Three different paths in the development of generic-concept languages have been followed by APL, Algol 68, and object-oriented languages such as SIMULA 67 and Smalltalk. APL was the earliest and one of the most interesting applications of generic-concept methods, but now makes the weakest use of these ideas. My talk will use slides and movies to show how the message-object programming system Smalltalk makes use of generic concepts embedded in class descriptions to give rise to a wide variety of simply programmed dynamic simulations including graphic animation, music synthesis, document layout and retrieval, and APL-like calculation features. Many of these systems have been brought to life by child and adult novice programmers. A short list of references is given for those wishing more introductory information about Smalltalk.
Modeling the student and the discipline in CAI drill and practice
Authors: Paul Lorton,  Jr., Rosemary N. Killam
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

Models built into computer assisted instructional courses have several advantages. They make the underlying theoretical assumptions more explicit and, at the same time, give a clearer direction to the actual development of the CAI program. The purpose of this discussion is to present some of the areas in which models have had an implicit or explicit impact and to indicate how our current work is focused by these efforts. The main purpose of the modeling discussed here is to provide better, more effective instruction (models of the learner) with substantially generated curriculum (models of the discipline). The drill and practice context is emphasized because that is one with a history of models in both areas and one which has demonstrated potential.
Teaching problem solving and structured programming in FORTRAN
Authors: Frank L. Friedman, Elliot B. Koffman
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

This paper describes an approach towards teaching problem solving in an introductory service course using the FORTRAN programming language. The course is centered around s set of problems which are used to illustrate a problem solving methodology. Three pedogogical tools (data table, flow diagram, and program system chart) are used to provide a framework for algorithm development. Two control structures (the Block IF decision structured and WHILE loop) have been added to the FORTRAN language to facilitate the implementation of algorithms.
Guiding sensitization searches using problem reduction graphs
Authors: Ben M. Huey
Venue: Proceedings of the 15th Design Automation Conference (1978)

In an earlier paper (10) the generation of problem reduction graphs from a search goal definition and a design language description of circuit behavior was presented. The objective of forming such a graph was to provide heuristic guidance for state space searches. Most state space searches use both heuristic cost weighting on the nodes and heuristic input vector generation. In this paper an approach is provided for computing the heuristic cost function based on its contribution to the search objective and the frequency with which that node has been reached in past searches. This is done by weighting the nodes of the problem reduction graph associated with the state search problem based on the frequency with which those problem reduction graph nodes have been reached in past searches. From this weighting follows an heuristic cost function which can be used to quickly compute node weights during the actual state space search. Input vectors are also suggested by the problem reduction graph. Because digital circuits so often partition naturally into control and data sections, the input vectors which can be applied at a given control state are taken from the problem reduction graph and so grouped. Four case studies demonstrate the usefulness of the method, while also showing that neither heuristic weighting nor input selection alone is adequate to provide general purpose state space search guidance.
A large-scale undergraduate programme in computer science
Authors: D. D. Cowan, R. B. Roden
Venue: Proceedings of the first SIGCSE technical symposium on Education in computer science (1970)

In the early 1960's, the University of Waterloo recognized a growing need in society both for computer specialists and for non-specialists having some familiarity with computers. Programmes initiated at that time have grown so rapidly that computer science courses are now attended by approximately 4000 Waterloo undergraduates, about 1000 of whom may be regarded as computer science majors. Courses have been designed upon the premise that hands-on experience is one of the most effective vehicles for teaching the practice of computer science. Many of the courses require that a student write programmes and run between 100 and 500 jobs through the computer. The objective of providing prompt service to student programmers entailed major operational difficulties for the University Computing Centre as the volume of work approached a level of 1 million student jobs per year.
A proposal for training youngsters in digital computing techniques
Authors: Rollin P. Mayer
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

The proposal outlined here is based on three premises: (1) That the digital computing field needs, and will continue to need, not only more people who are capable of designing and programming digital computers, but more people who understand the basic limitations and potential uses of digital computers; (2) that the computer industry should take an active interest in providing a basic computer training to the largest number of people, in addition to more extensive training to those who show an interest in designing and programming computers; and (3) that the typical 12-year-old youngster has the interest, skill and basic knowledge necessary to build and understand simple working models of practically anything. Consider a typical 12-year old: You would not be surprised to learn that he's been flying gliders for years, has probably built at least one rubber-powered stick model airplane, and is wondering whether he should spend his allowance on a more fancy model. At this age, he can take his bike apart and put it together again, diagnose and often correct a short circuit on his friend's electric train, build a bridge with his Erector set, and can develop and print pictures taken with his own box camera. He knows the difference between a rocket and a jet, alternating current and direct current, telescopes and microscopes, and between a gasoline engine and a diesel. For a small sum of money - often less than $20 - he can buy himself a working model of any of these things, plus a subscription to a magazine which will keep him informed of progress in the real devices, in the models, and in ways of using and improving the models. It is not surprising to find such youngsters entering the aeronautics, automotive, and electronics industries.
Generation Scavenging: A non-disruptive high performance storage reclamation algorithm
Authors: David Ungar
Venue: ACM SIGPLAN Notices (1984)

Many interactive computing environments provide automatic storage reclamation and virtual memory to ease the burden of managing storage. Unfortunately, many storage reclamation algorithms impede interaction with distracting pauses. Generation Scavenging is a reclamation algorithm that has no noticeable pauses, eliminates page faults for transient objects, compacts objects without resorting to indirection, and reclaims circular structures, in one third the time of traditional approaches. We have incorporated Generation Scavenging in Berkeley Smalltalk(BS), our Smalltalk-80 implementation, and instrumented it to obtain performance data. We are also designing a microprocessor with hardware support for Generation Scavenging.
Incomplete Fault Coverage In Modular Miltiprocessor Systems
Authors: L. Simoncini, A. D. Friedman
Venue: Proceedings of the 1978 annual conference (1978)

In an early paper Preparata, Metze, and Chien formulated a model of system level diagnosis in which it is assumed that a fault-free module can detect any fault in a module it is testing. In practice this assumption may not be true. If a fault-free module can only detect p &times; 100% of all faults (or equivalently detect a fault with probability p) we refer to this as incomplete fault coverage. With incomplete fault coverage it is possibile that a system will fail to detect a faulty module. In this paper we consider the problem of designing systems which minimize the probability of failure to detect for a given fault coverage p. We show that the ability to detect faults does not only depend on the number of modules n and testing links m, but also in general, on the structure of the network (i.e. the exact interconnection pattern of testing links). Systems which are optimal with respect to fault detectability are presented for various n and m, and a correspondence between detectability and the girth of the system testing graph is presented. The effect of system structure on diagnosability is briefly discussed.
The 1940 and 1950 Public Use Sample Project: Data quality issues
Authors: Richard M. Cohn, Howard R. Prouse
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

The 1940 and 1950 Public Use Sample Project is the creation of 1/100 household samples from the 1940 and 1950 Censuses of Population. The data source for the samples is the microfilmed original Population Schedules which contain the census enumerator's recording of household information. The procedure to sample the universe of household listings and transcribe the sample households' data is described in the paper. A pretest of the 1940 Public Use Sample included a comparison of three methods of sampling and transcription. The results of this comparison are reported. The applicability of these procedures to similar projects is discussed.
Response to undesired events in software systems
Authors: D. L. Parnas, H. Würges
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper discusses an approach to handling run-time errors in software systems. It is often assumed that in programs which can be proven correct, errors will not be a problem. This paper is predicted on the assumption that, even with correct programs, undesired events at run-time will continue to be a problem. Routines to respond to these undesired events (UEs) must be provided in reliable systems. This paper describes a program organization which aims at satisfying the following criteria: (1) UE response routines are written by each programmer in terms of the abstract machine which he uses for his normal case code. UEs are reported in those terms. He is never forced to use information about the implementation of other modules in the system. (2) Programs can be written so that the code for UE detection, UE correction, and normal case, are lexically separate and can be modified independently. (3) The system can evolve from an initial version that does little recovery to one which uses sophisticated recovery techniques without a change in the structure of the system. (4) Even with unsophisticated recovery procedures, the task of locating the module containing a bug discovered at run-time does not require internal knowledge of many modules. (5) Costs incurred because of the recovery techniques are low as no UE occurs.
A data type encapsulation scheme utilizing base language operators
Authors: Mark B. Wells, Fred L. Cornwell
Venue: ACM SIGPLAN Notices (1976)

A data type encapsulation scheme in which the &ldquo;space&rdquo; operations are expressed naturally in terms of the base language operators is described. The scheme results from a conceptual separation of operators and procedure calls in the base language and produces a language of considerable expressive power. The scheme has been implemented and several examples are given.
Publishing: a reliable broadcast communication mechanism
Authors: Michael L. Powell, David L. Presotto
Venue: Proceedings of the ninth ACM symposium on Operating systems principles (1983)

Publishing is a model and mechanism for crash recovery in a distributed computing environment. Published communication works for systems connected via a broadcast medium by recording messages transmitted over the network. The recovery mechanism can be completely transparent to the failed process and all processes interacting with it. Although published communication is intended for a broadcast network such as a bus, a ring, or an Ethernet, it can be used in other environments. A recorder reliably stores all messages that are transmitted, as well as checkpoint and recovery information. When it detects a failure, the recorder may restart affected processes from checkpoints. The recorder subsequently resends to each process all messages which were sent to it since the time its checkpoint was taken, while ignoring duplicate messages sent by it. Message-based systems without shared memory can use published communications to recover groups of processes. Simulations show that at least 5 multi-user minicomputers can be supported on a standard Ethernet using a single recorder. The prototype version implemented in DEMOS/MP demonstrates that an error recovery can be transparent to user processes and can be centralized in the network.
Deterministic CFL's are accepted simultaneously in polynomial time and log squared space
Authors: Stephen A. Cook
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

We propose to prove the theorem in the title. Let PLOSS be the class of sets recognizable on a deterministic Turing machine simultaneously in polynomial time and log squared space. Using the notation of Bruss and Meyer [1], PLOSS &equil; &ugr;k TISP(nk,k log2n).
On A System For Adaptive, Parallel Finite Element Computations
Authors: Ivo Babuska, Werner C. Rheinboldt
Venue: Proceedings of the 1978 annual conference (1978)

The principal aspects are outlined of a prototype, adaptive finite element system for the solution of a class of linear, elliptic problems defined by a weak mathematical formulation. The system uses results about computable a-posteriori estimates and asymptotically optimal meshes developed earlier by the authors to control the adaptive mesh refinement and to provide an optimal solution within a prescribed cost range. Moreover, the system takes advantage of natural parallelism and modularity of the method. An overview of the principal error estimation results is presented, the overall systems design is outlined, and a data structure for the mesh refinement, based on a novel tree structure, is discussed. Some numerical results obtained with a preliminary version of the system illustrate the effectivity of the approach.
The current state of the art in microprocessor software
Authors: Douglas A. Cassell, Warren F. Mayhew
Venue: Proceedings of the 1975 annual conference (1975)

Aspects of microprocessor programming are described and compared to the programming of conventional computers. The effects of microprocessor architectures and their current state of development are related to commonly used utility and language support software and to trends in the availability of these programs.
Linear unification
Authors: M. S. Paterson, M. N. Wegman
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

A unification algorithm is described which tests a set of expressions for unifiability and which requires time and space which are only linear in the size of the input.
PSL: A Portable LISP System
Authors: Martin L. Griss, Eric Benson, Gerald Q. Maguire,  Jr.
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

This paper presents the implementation strategy and current status of a new Portable LISP System, PSL, based upon STANDARD LISP. PSL is written entirely in itself and is compiled with an efficient LISP compiler with machine-oriented optimizations. A full PSL is currently running on a DECSystem-20 and a VAX, and a preliminary version runs on a Motorola MC68000. Versions for a CRAY-1 and an IBM-370 are planned.
Organizing tests during software evolution
Authors: A. Cicu, M. Maiocchi, R. Polillo, A. Sardoni
Venue: Proceedings of the international conference on Reliable software (1975)

This paper describes the structure and expounds the underlying motivations of the 'Testing System' which is presently being designed and experienced in testing the Honeywell GCOS Level 62 operating system. TS is a hierarchical system in which two main levels are individuated: tests and 'testing structures'. The former are automatic 'system exercisers' - either 'testing programs' and 'testing units' at JCL level; the latter are hierarchically organized 'catalogues', allowing the management of testing activities through the use of automatic tools.
An automatic/interactive layout planning system for arbitrarily-sized rectangular building blocks
Authors: Chi-Song Horng, Margaret Lie
Venue: Proceedings of the 18th Design Automation Conference (1981)

Layout Planning Aids (LPA) is designed to allow easy generation of topological layout (chip) plans for IC mask designs. The output of LPA is a hard-copy topological plan. The system encourages a hierarchical design style. It encompasses both algorithmic and computer-assisted, designer-controlled approaches to the problem by providing automatic placement and routing facilities plus a set of versatile interactive commands. The interactive features allow designers to work collaboratively with the system such that the strengths of both can be combined to achieve the best results.
Quasi-real simulation as a tool for the implementation of modular computer systems
Authors: N. J. Hadjidakis
Venue: Proceedings of the 12th annual symposium on Simulation (1979)

As a result of the appearance of microprocessors, one of the important trends in actual computer architecture is the breakage of computer systems into special function processors. Accordingly, new methods and tools are developed to design and realize these systems. Quasi-real simulation appears as a design tool insuring the cooperation between a simulated part of a system and its wired parts, in such a manner that its constructor may have an idea of the quasi-real machine during all the steps of its realization.
Functional level simulation in FANSIM3 - algorithms, data structures and results
Authors: S. S. Hirschhorn, M. B. Hommel, C. Bures
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper discusses the functional level logic simulation techniques used in the FANSIM3 simulator. The data structures for function evaluation and the algorithms used to simulate functional models are presented. The methods used to simulate datapaths and bussed signals are also discussed. Specific results, based on a year's experience with the simulator, are presented.