ppxscal/embedding_network huggingface dataset:
Reliability issues in the ARPA network
Authors: W. Crowther, J. McQuillan, D. Walden
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

Since the inception of the ARPA Network1 in 1969, we have been part of the group responsible for the development of that network's communications subnet. This role has provided us with a unique opportunity for study of the problems of network reliability and the effects of attempted improvements, particularly in the context of rapid network growth. Our overall philosophy for this effort has been that the network should be fault-tolerant with respect to individual component errors, and that the IMPs themselves should be fault-tolerant with respect to local failures. Along with this concern, we feel that the program should provide as much diagnostic information as possible. Component failures are of several kinds: hardware or software; solid, intermittent, or one-time. As we will discuss in the following sections, our attention has shifted in the last few years from handling circuit errors and failures to handling more difficult problems in the IMPs themselves: first intermittent problems, and recently even solid failures of major components.
A sophisticated microcomputer user interface
Authors: Richard Snodgrass
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

The design and implementation of a menu-oriented interface for personal computers is discussed. Factors pertaining to the cognitive limitations of users are examined and their impact on the design of the system is described. The major attributes of the system are (1) all communication between the operator and the computer is through menus or forms (which are analogous to hard copy documents); (2) extensive help is available at all times; (3) the interface can adapt to the experience of the user; (4) the display processing time is short; and (5) an external data format exists that completely defines the interface. The various components of the interface are discussed in detail, followed by a discussion of the implementation.
Temporal verification of carrier-sense local area network protocols
Authors: D. E. Shasha, A. Pnueli, W. Ewald
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

We examine local area network protocols and verify the correctness of two representative algorithms using temporal logic. We introduce an interval temporal logic that allows us to make assertions of the form &ldquo;in the next k units, X holds.&rdquo; This logic encodes intuitive arguments about contention protocols quite directly. We present two proofs of an Ethernet-like contention protocol, one using the interval temporal logic and one using classical temporal logic. We also verify a contention-free protocol using an invariant that seems to have wide applicability for such protocols.
Two implementations of the 'FLEX' machine
Authors: John Kershaw
Venue: ACM SIGMICRO Newsletter (1981)

The FLEX high-level language architecture is introduced. Two microprogrammed implementations of FLEX are described, one based on a special purpose, horizontally coded machine and the other on a general purpose emulator called GEMINI. Examples and statistics of both microprograms are given and the two implementations compared.
Compiling a functional language
Authors: Luca Cardelli
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

This paper summarizes my experience in implementing a compiler for a functional language. The language is ML(1) [Milner 84] and the compiler was first implemented in 1980 as a personal project when I was a postgraduate student at the University of Edinburgh(2). At the time, I was familiar with programming language semantics but knew very little about compiler technology; interpreters had been my main programming concern. Major influences in the design of this compiler have been [Steele 77] [Steele 78] and the implementation folklore for statically and dynamically scoped dialects of Lisp [Allen 78]. As a result, the internal structure of the compiler is fairly unorthodox, if compared for example with [Aho 78]. Anyway, a compiler for a language like ML has to be different. ML is interactive, statically scoped, strongly typed, polymorphic, and has first class higher-order functions, type inference and dynamic allocation. These features preclude many well-known implementation styles, particularly the ones used for Lisp (because of static scoping), the Algol family (because of functional values) and C (because of nested scoping and strong typing). The interaction of these features is what gives ML its &ldquo;character&rdquo;, and makes compilation challenging. The compiler has been recently partially converted to the new ML standard. The major points of interest which are discussed in this paper are: (a) the interactive interpreter-like usage; (b) the polymorphic type inference algorithm; (c) the compilation of pattern matching; (d) the optimization of the representation of user defined data types; (e) the compilation of functional closures, function application and variable access; (f) the intermediate abstract machine and its formal operational semantics; (g) modules and type-safe separate compilation.
An analytic model of the HASP execution task monitor
Authors: Jon C. Strauss
Venue: Proceedings of the 1973 ACM SIGME symposium (1973)

The HASP Execution Task Monitor periodically rearranges the OS/360 dispatching chain to give tasks pre-emptive execution priority in inverse order to their CPU utilization history. The effect is to keep the I/O bound tasks active and to prevent CPU bound tasks which have high priority due to the partition/initiator priority heirarchy of OS from locking out other tasks. This paper develops a simple model of the Execution Task Monitor and employs it to study the effectiveness of the monitor in improving system performance. A modified strategy for monitor control is postulated and investigated for the case of task execution in memory of varying speed. This work was supported by National Science Foundation Grant DJ-33764X
Matching computer personnel and the job environment
Authors: Ward Testerman
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

The growth of the computer industry has created more diversity within jobs in the computer industry than any other industry. Each week there are new users with new types of applications in new environments. The systems analyst working in a small IBM System 3 shop performs considerably different tasks than the analyst working on a CDC Star system in research environment, yet both are classified and titled Systems Analyst. Many employers select their employees as if the job in their installation was identical to all other jobs in the industry which have similar titles. The widespread use of the many forms of the IBM programmer aptitude test confirm this statement. But selection devices like this ignore the job environment which the employee must work. This paper presents a different look at matching the employee to the job which he will fill. The approach taken here is to define a Computer Job Environment Model which is used to classify the work environment required by a job. The use of a decision making style model helps us understand how people handle information. A person's internal need for and use of information can affect his job in system analysis. These two models are merged into a Computer Personnel Job Model which matches the types of information processing styles to the requirements of the job. A discussion of how will the model fits the computer industry is presented, followed by research findings on the model.
What do systems analysts think about the CDP program
Authors: John D. Longhill
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

This paper is based on a 1975 survey of the perceptions of data processing managers and holders of the Certificate in Data Processing concerning aspects of the CDP program.
The use of an algebraic language as both a source and target language
Authors: Prentiss Hadley Knowlton
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The use of an algebraic language as both a source and a target language is worth investigating. This approach to compiler writing is perhaps justified when 1) one wishes to make only minor extensions to a given language, and 2) one wishes to minimize his effort in the performing of 1).
Panel on future directions in network services
Authors: P. Jackson, L. Pouzin, L. Roberts, K. Uncapher
Venue: Proceedings of the sixth symposium on Data communications (1979)

With the double-digit rate of increase in the cost of energy, transportation and personnel and the double-digit rate of decrease in the cost of computing and communications, the demand to bring remote information to users via data networks for cost savings and convenience is overwhelming. Drs. Jackson and Roberts, both associated with operating public networks, will discuss the types of future network service to be offered to the public. Monsieur Pouzin and Dr. Uncapher will address user acceptance. Wide acceptance from the public of a network service requires easy access. LOUIS POUZIN'S REMARKS: Instead of guessing what future network services will be, I would rather present my expectations. A summary of my expectations could fit in a few key statements: 1. Unobtrusive access to network services 2. Responsible commercial organizations 3. Human-oriented services Now, some developments might be useful.
Computer graphics in medicine: Six theses
Authors: David J. Mishelevich
Venue: Proceedings of the 1972 SIGGRAPH seminar on Computer graphics in medicine (1972)

The objective of this paper is not to present a catalog of current or potential applications of computer graphics in medicine, but rather to raise some basic key issues for consideration. The six theses which I am exploring are: 1. Iconic Communication must be the ultimate objective of computer graphics; 2. Possibilities for dynamism and interaction provide exciting dimensions for graphic presentation; 3. Use of the Optimality Principle can assist in promoting rapid progress; 4. The Building Block Principle is useful for system development and application as well as initially getting started; 5. Adherence to simple design principles can enhance graphic effectiveness; and 6. Cost-Benefit is a key factor in graphics system evaluation and utility. Each of these theses will be considered in turn in an effort to lay the groundwork for discussing, analyzing and evaluating computer graphics in medicine. It must, of course, be noted that all principles discussed here are pertinent to computer graphics in general and not just related to medicine. In medicine however, the problems are often more difficult to deal with and the consequences greater. Thus interdisciplinary communication is critical if the problems are to be solved.
Lower bounds on communication complexity
Authors: Pavol Duris, Zvi Galil, Georg Schnitger
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We prove the following four results on communication complexity: 1) For every k &ge; 2, the language Lk of encodings of directed graphs of out degree one that contain a path of length k+1 from the first vertex to the last vertex and can be recognized by exchanging O(k log n) bits using a simple k-round protocol requires exchanging &Ohgr;(n1/2/k4log3n) bits if any (k&minus;1)- round protocol is used. 2) For every k &ge; 1 and for infinitely many n &ge; 1, there exists a collection of sets Lnk @@@@ {0,1}2n that can be recognized by exchanging O(k log n) bits using a k-round protocol, and any (k&minus;1)-round protocol recognizing Lnk requires exchanging &Ohgr;(n/k) bits. 3) Given a set L @@@@ {0,1}2n, there is a set L@@@@{0,1}8n such that any (k-round) protocol recognizing L@@@@ can be transformed to a (k-round) fixed partition protocol recognizing L with the same communication complexity, and vice versa. 4) For every integer function f, 1 &le;f(n) &le; n, there are languages recognized by a one round deterministic protocol exchanging f(n) bits, but not by any nondeterministic protocol exchanging f(n)&minus;1 bits. The first two results show in an incomparable way an exponential gap between (k&minus;1)-round and k-round protocols, settling a conjecture by Papadimitriou and Sipser. The third result shows that as long as we are interested in existence proofs, a fixed partition of the input is not a restriction. The fourth result extends a result by Papadimitriou and Sipser who showed that for every integer function f, 1 &le; f(n) &le; n, there is a language accepted by a deterministic protocol exchanging f(n) bits but not by any deterministic protocol exchanging f(n) &minus; 1 bits.
Symbolic mathematical computation&mdash;introduction and overview
Authors: Robert G. Tobey
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

A specific model depicting the nature of research and development work in symbolic mathematical computation is presented. The model provides the organization for this introduction and overview. Basic concepts and issues are adumbrated from the user's point of view, from the mathematician's point of view, and from the designer/implementer's point of view. The model focuses attention on the need for measurement by displaying the scientifically necessary, but currently nonexistent, information feedback loops. A vigorous attempt is made to place the work reported at this symposium in the perspective provided by the model. This examination culminates in a proposal.
Configuration control for evolutional software products
Authors: Osamu Shigo, Yoshio Wada, Yuichi Terashima, Kanji Iwamoto, Takashi Nishimura
Venue: Proceedings of the 6th international conference on Software engineering (1982)

This paper describes the concept of and a system for configuration control for evolutional software products, in which a wide spectrum of varied software products are being continuously evolved, along with rapid advancements in hardware technologies. The system contains a database for dealing with the overall configuration structure, including hierarchical product structure with change status, master file directories, difficulty occurrences and user information. The data representing the configuration can be in more abstract or macroscopic level than the traditional software configuration control, since the configuration manager should control the overall outlines for all software products. The concept and system described in the paper have been used for intelligent terminal software product management in NEC's Data Terminals Division.
A hierarchy for classifying AI implications
Authors: Ira Pohl
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Artificial Intelligence is rapidly emerging from the laboratory into the market-place. Industrial robots are cost effective in a wide range of manufacturing tasks. Expert systems are commercially available and scientifically useful. Sophisticated chess machines are routinely sold in retail outlets. Assaulted by the unprecedented pace of these developments, society is confronted with assimilating these &ldquo;apparently- intelligent&rdquo; artifacts. This paper will view these developments in the context of a hierarchy for classifying social impact. We examine to what extent does the appearance of apparently-intelligent machines produce a paradigmatic shift in how society defines itself and its social relations to these machines. Our analysis is performed in the framework of a taxonomy for segregating the continuum of effects that occur when advanced computer technology impacts society.
Remote Cable-Based Video Surveillance Applications: The Avs-Rio Project
Authors: Claudio Sacchi, Carlo S. Regazzoni, Carlo Dambra
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This summary 1 aims at presenting an overview of the CEC-ESPRIT AVS-RIO (Advanced Video Surveillance -Advanced Video Surveillance - Cable Television Based Remote Video surveillance System for Protected sites Monitoring) project. The peculiarity of the project consists both in the video-surveillance application considered (i.e. the monitoring of tourist and naturalistic places), and in the communication mean used for the remote transmission of information from the observed sites to the remote elaboration center, which is a coaxial cable network for local community TV broadcasting (CATV network). The multimedia information is acquired by video sensors (i.e. TV cameras) and transmitted through the CATV network to a remote control center, where a PC-based High Performance Computing Network (HPCN) architecture performs the image processing tasks needed by the implementation of the system functionalities. The functional specifications of the system will be briefly exposed, together with the HW/SW tools needed for the system implementation.
Placement and routing program for master-slice LSI's
Authors: Ryotaro Kamikawai, Kuniaki Kishida, Akira Osawa, Isao Yasuda, Tsuneyo Chiba
Venue: Proceedings of the 13th Design Automation Conference (1976)

A block placement program and a routing program for inter-block connection of master-slice LSI's are described. The placement program reduces the total expected wire length, by iterative improvements of block placement and gate assignment to blocks. The routing program employs Lee's algorithm basically, and modifications have been made to increase wirability and reduce computer time. The results of applying these programs to several types of LSI's are presented.
Hermes: An operating system for a Modula-2 environment
Authors: Eric Hirschy
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

Hermes is a real-time operating system developed at the San Diego Research Center. Hermes is written entirely in the Modula-2 programming language and executes on the Lilith computer. As an operating system for a Modula-2 environment, the design of Hermes emphasizes the concept of using modular components for building a run-time environment.
The complexity of satisfiability problems
Authors: Thomas J. Schaefer
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied. I t is known that, when restricted to formulas having only two literals per clause, this problem has an efficient (polynomial-time) solution. But the same problem on formulas having three literals per clause is NP-complete, and hence probably does not have any efficient solution. In this paper, we consider an infinite class of satisfiability problems which contains these two particular problems as special cases, and show that every member of this class is either polynomial-time decidable or NP-complete. The infinite collection of new NP-complete problems so obtained may prove very useful in finding other new NP-complete problems. The classification of the polynomial-time decidable cases yields new problems that are complete in polynomial time and in nondeterministic log space. We also consider an analogous class of problems, involving quantified formulas, which has the property that every member is either polynomial time decidable or complete in polynomial space.
An APL poisson solver
Authors: Ronald I. Frank
Venue: ACM SIGAPL APL Quote Quad (1981)

A derivation is presented, based on APL thinking, of a numerical method for solving discrete Poisson equations in a rectangle. The method is equivalent to Separation of Variables, as it must be. It was recovered by this author during the recoding, in APL, of the world's first numerical weather forecast code. von Neumann had presented a formula in 1950, without derivation, for the solution of this type of Elliptic Partial Differential Equation. After using APL to derive the formula, this author then shows the formula equivalent to a Tensor Product method suggested by Lynch, Rice, and Thomas, [2], 14 years after von Neumann's paper. The APL derivation is new and helpful in understanding the structure of the Separation of Variables solution. The derivation depends on APL thinking and manipulations that are not standard in Applied Mathematics.
The problem of herterogeneous groups in computer programmer training
Authors: Stanley L. Levine
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Many of today's industrial computer programmer training programs suffer from the age old problem of heterogeneous grouping of students. In all training programs, a minimum requirement is determined and established as that which is needed for successful completion of the program. Because of many factors and influencing forces, this minimum requirement has not always been respected. Often dual functions vary the motivation for a knowledge of programming. In any case, we find computer programmer classes composed of students with a variety of backgrounds. Let us review briefly some of the heterogeneous groups found in computer programmer training courses. We must first mention that all computer programmer training is either employee training or customer training (prerequisites for attendance may be set for employees but usually not for customers because of the sales influence). Both employees and customers may be experienced or inexperienced. The experienced persons may have backgrounds in symbolic programming (i. e., Fortran), machine language programming, or both. Personnel cards on persons attending computer programmer courses reveal various back-grounds in accounting, engineering, mathematics, management, economics, and sales. The result of this conglomeration is a heterogeneous class within which we may find a young 20 year old Junior college graduate sitting between a college professor and an old accountant. The class may also include a brillant Ph. D. in math or physics and a good hardware oriented practical engineer.
Autonomous Process or Go Navigation Technology for Congestion Avoidance in Distributed Information Service System
Authors: Misato Tasaka, Hélène Arfaoui, Teruyoshi Zenmyo, Kinji Mori
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Rapid changes in service, network and user demand have made conventional distributed information systems mostly unprepared in continuously and timely satisfying the users requests. A high-assurance information system architecture sustained by Push/Pull mobile agents, called Faded Information Field (FIF), has been proposed to achieve adaptability and real-time property under continuously changing conditions of the system. When the service offer changes, the information environment is restructured in order to match the current user demand in terms of volume and trend. However, once the structure is set, it is still required to permit to the user's Pull mobile agents to autonomously adapt to the rapidly changing demand conditions. The goal of autonomous navigation of the pull mobile agents is in that regard to assure adaptive migration and distribution of the pull-MAs' process to avoid the congestion of certain regions of the FIF when the user demand for information is changing. In this paper, the concept and realization of autonomous Process or Go Navigation technology is proposed under the goal to preserve the timeliness of the system under local congestion conditions in the FIF. Effectiveness in fairly reducing the average users' response time under changing demand conditions has been confirmed by simulation.