ppxscal/embedding_network huggingface dataset:
CHIC: A 7090 program to compute hypergeometric series in two variables
Authors: Margaret L. Johnson, Ward C. Sangren
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Two previous programs BEAUTY and BEAST have been written to calculate hypergeometric functions. The program BEAUTY [1] can be used as a routine or subroutine to calculate any generalized hypergeometric function with up to ten numerator and denominator parameters, and one argument. The program BEAST [2] computes the analytical continuation of an ordinary hypergeometric function. The general usefulness of these programs, particularly BEAUTY, has encouraged the writing of the routine CHIC.
Delay related issues in integrated voice and data transmission: A review and some experimental work
Authors: John G. Gruber
Venue: Proceedings of the sixth symposium on Data communications (1979)

This paper focuses on network delays as they apply to voice transmission. First the nature of the problem is discussed and this is followed by a review of circuit, packet and hybrid switching. The concept of introducing delay to resolve contention in speech interpolation is also noted, and when applied to both voice and data messages, forms a basis for a relatively new and so-called &ldquo;transparent&rdquo; approach to network design. The second part of the paper deals with experimental work. First, external link considerations involving subnet access by frame synchronous vocoders is discussed, and an experimental software interface is described which exploits the 60 to 65% idle time in voice calls. Secondly, based on the simulation of variable network delays, first indications are that with 180 ms &ldquo;hangover&rdquo;, the perceptable threshold of variable delay is about 200 ms average. Finally, suggestions for further works on performance analysis and subjective testing are made.
Database filters
Authors: Sakti Pramanik
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

Several hardware database-searchers for a large number of patterns or keys are presented. These searchers can be implemented by a random access memory and are suitable for VLSI implementation. Application of these searchers as database filters is described; a filter detects all the matched records in the database as well as a few others which don't match. The percentage of these unmatched records that manage to pass through can be reduced to any arbitrary minimum value; this is done, for example, by using several filters together, or passing the output records repeatedly through the same filters. Several filters can be used together by cascading them in series, parallel, and series-parallel fashion. The performance of the filters using iterative approach depends very much on the regrouping algorithms of the patterns/keys. Several such algorithms are presented and their performances compared. A single pass is required if they are pipelined. Hardware organization for different pipelined approaches are also studied. Experiments are performed for all the different hardware organizations mentioned above on an employee-name database. The results are presented in graph forms. They support the usefulness of these hardware organizations as filters.
Experiences with a data set security system in a university environment
Authors: Gordon K. Springer
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

Recently a vast amount of publicity and concern has been given to the problems associated with security and privacy in computer systems. There has been legislation proposed and passed which attempts to provide safeguards for the storage of data&mdash;what is to be stored, who may have access to the data and for what purpose the data is to be stored and/or accessed. Much of the publicity and legislation has been aimed at the legal and what I would call the &ldquo;moral&rdquo; side of computer security and privacy. However, there are really two sides to this problem. The first of these is the legal/moral one and the other is the physical/technological side. The physical and technological side of the problem concerns itself with the design and implementation of computer systems and computer facilities which attempt to control access to the data stored in or external to the system. Given that data is stored in the computer, the technological problem is to ensure that only the properly authorized people are granted access to that data. In this paper, the concern is with the technological problems of computer security and privacy.
A core graphics environment for teletext simulations
Authors: Douglas F. Dixon
Venue: ACM SIGGRAPH Computer Graphics (1983)

The development of our graphics environment over the past year has been directed towards demonstrating the concept of broadcast teletext service, where pages of graphics and text are received in the home over existing television channels. We have developed a graphics editor, Radix, which uses an underlying Core graphics package to create teletext-compatible images. Radix is also used to display these images at arbitrary resolutions by scaling the graphics primitives, selecting the corresponding sizes of fonts and bitmaps, and then precisely adjusting the output video signal. The combination of powerful display hardware and a robust set of software tools has allowed us to rapidly prototype potential teletext features, and to provide these accurate simulations of teletext pages at any resolution. While this general graphics environment does impose some inefficiencies in running graphics applications, they are far outweighed by the ability to quickly respond to changing requirements.
The haloed line effect for hidden line elimination.
Authors: Arthur Appel, F. James Rohlf, Arthur J. Stein
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

The haloed line effect is a technique where when a line in three-dimensional space passes in front of another line, a gap is produced in the projection of the more distant line. The gap is produced as if an opaque halo surrounded the closer line. This method for approximate hidden-line-elimination is advantageous because explicit surface equations are not necessary. The relative depth of lines, axes, curves and lettering is easily perceived. This technique is especially suitable for the display of finite element grids, three-dimensional contour maps and ruled surfaces. When the lines or curves on a surface are closer than the gap size, the gaps produced close up to produce a complete hidden-line-elimination. A simple but efficient implementation is described which can be used in the rendering of a variety of three-dimensional situations.
Modelling and analysis of distributed software systems
Authors: B. Kumar, Timothy A. Gonsalves
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

The problem of modelling and analysing the performance of software structures for distributed computer systems is addressed. A modelling technique is proposed which has many striking analogies with current techniques for evaluating hardware systems and yet focuses attention on the system software. The analysis of such models will draw heavily on the substantial work already done in the analysis of hardware models. To illustrate the modelling technique proposed, it is applied to an investigation of the trade-offs associated with the configuration of critical sections in a distributed software system. Simple queueing techniques are used to model a number of alternative configurations. The study throws some light on the regions of optimum decomposition, and the impact on performance of some of the important design variables.
Statistically suitable initial multiplier values for IBM's GPSS V random number generators
Authors: Charles S. Saxon, Thomas J. Schriber
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

Five collections of statistically acceptable multiplier values suitable for use in initializing the random number generators in IBM's GPSS V are presented. The collections, each consisting of about 50 entries, are respectively appropriate for simulations in which given stochastic elements use sequences of approximately 600, 1200, 2400, 4800, or 9600 random numbers per replication. These sequences are short enough so that localized non-randomness can produce misleading simulation results unless multiplier values are chosen with care, and yet are long enough to span the number of random numbers typically need per stochastic element in many simulations. The multipliers, which take the form of odd, non-negative integers containing five or fewer digits, are statistically acceptable in the sense that they satisfy, at 0.l0 and 0.02 significance levels, the one dimensional Chi-square and the Kolmogorov-Smirnov tests for uniformity; and autocorrelation, runs-above-the-mean, modified poker, and two-dimensional Chi-square tests which guard against the presence of unacceptable patterns in the sequences. A sixth collection, consisting of those initial multipliers which are the most satisfactory on balance for all of the above sequence lengths, is also presented. No particular pattern is evident in any of the acceptable multipliers, meaning that no guidelines can be given for selecting multipliers which are likely to produce statistically sound random number sequences of one or another length. Furthermore, not many multipliers are common to two or more of the five length-specific collections. This leads to the conclusion that it might be well for simulation languages to provide optional built-in statistical testing of the random number sequences actually produced by their underlying 0-1 uniform random number generators during the course of a simulation. The user could then be told whether each of the one or more random number sequences used in a given simulation was suitably random, or whether localized non-randomness was in effect to such an extent in one or more of the sequences that the simulation run should be discarded, or at least should be interpreted with unusual care.
The influence of microprocessors on computer architecture: Distributed processing
Authors: E. Douglas Jensen
Venue: Proceedings of the 1975 annual conference (1975)

It has recently become both technologically and economically feasible to produce a complete, general purpose, stored program process or on a small number of LSI circuits. This development has already begun to influence computer system architecture in the direction of distributed processing&mdash;the construction of a larger machine from a multiplicity of smaller ones. Critical issues in this effort appear to be process partitioning and assignment, interprocess communication, and processor interconnection. In a distributed computer, processors may function as: special purpose components (e.g., decimal processing unit) in a larger processor; dedicated support (e.g., I/O) processors; or multiple main (i.e., &ldquo;central&rdquo;) processors.
Note on probabilistic algorithms in integer and polynomial arithmetic
Authors: Michael Kaminski
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

For many computational problems it is not known whether verification of a result can be done faster than its computation. For instance, it is unknown whether the verification of the validity of the integer equality x*y&equil;z needs fewer bit operations than a computation of the product x*y. It is sometimes much easier, however, to speed up the computation probabilistically if just the verification of the result is involved. In this paper we present linear probabilistic algorithms for verification of the validity of the integer equality f1(x1,...,xN)&equil;f2(x1,...,xN) for rational functions f1 and f2, which can be of the form of a rational combination of rational functions.
A tutoring and student modelling paradigm for gaming environments
Authors: Richard R. Burton, John Seely Brown
Venue: ACM SIGCUE Outlook (1976)

This paper describes a paradigm for tutorial systems capable of automatically providing feedback and hints in a game environment. The paradigm is illustrated by a tutoring system for the PLATO game &ldquo;How the West Was Won&rdquo;. The system uses a computer-based &ldquo;Expert&rdquo; player to evaluate a student's moves and construct a &ldquo;differential model&rdquo; of the student's behavior with respect to the Expert's. The essential aspects of the student's behavior are analyzed with respect to a set of &ldquo;issues&rdquo;, which are addressed to the basic conceptual constraints that might prevent the student's full utilization of the environment. Issues are viewed as procedural specialists that &ldquo;wake-up&rdquo; or become active when an instance of an issue manifests itself in a move. These issue specialists help the Tutor isolate what to comment on. The intent of the system is to transform a &ldquo;fun&rdquo; game into a productive learning environment without altering the student's enjoyment.
Synchronization: Introduction by the session chairman
Venue: ACM SIGOPS Operating Systems Review (1975)

The discussion at this session centered around two aspects of the synchronization problem: abstract models, primarily of local synchronization; and synchronization in networks which have long delays, lost messages, duplication of messages, and crashes of the communicating parties. There were two presentations on abstract models (Belpaire and Chen) and one on network problems (Dalal), supported by several working papers for which there were no presentations during the session (Ekanadham, Akkoyunlu, Tomlinson).
Design Automation in a computer science curriculum
Authors: J. G. Linders, W. M. vanCleemput
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Design Automation is emerging as a discipline and as such necessitates the development of appropriate curricula within the University environment. It is proposed that this can be achieved within the context of existing syllabi with the objective of producing graduates having an orientation in Design Automation. Some requirements for design automation are identified and corresponding curricula are proposed.
Pseudo-oracles for non-testable programs
Authors: Martin D. Davis, Elaine J. Weyuker
Venue: Proceedings of the ACM '81 conference (1981)

The most commonly used method of validating a program is by testing. The programmer typically runs the program on some test cases, and if and when they run correctly, the program is considered to be correct. We know that many difficult problems are associated with testing. One such problem is that it is a fundamental part of the testing process to require the ability to infer properties of a program by observing the program's behavior on selected inputs. The most common property that one hopes to infer through testing is correctness. But unless the program is run on the entire input domain, there are infinitely many programs which produce the correct output on the selected inputs, but produce incorrect output for some other element of the domain.
The design of an instruction set for common LISP
Authors: Skef Wholey, Scott E. Fahlman
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

The design of a microcoded instruction set for executing Common Lisp is presented. The influence that the language design, the machine, and the operating system had on this design is described. A statistical analysis of object code for an earlier instruction set was used to assign specific instruction lengths that led to a significant compression of the object code.
ORACLE a tool for learning compiler writing
Authors: William R. Haynes,  Jr., Charles E. Hughes, Charles P. Pfleeger
Venue: ACM SIGCSE Bulletin (1977)

This paper describes a compiler called ORACLE which allows a student to examine the actions performed by a simple compiler. Two features are provided to assist the student. The first called replacement mode, provides the necessary conditions to simulate the replacement of three compiler components: symbol table management, lexical analysis, and syntax analysis. Each replacement module is monitored by ORACLE in order to detect errors and to verify correct operation. The second, a trace option, permits source statements to initiate or terminate a selective monitoring of the actions of the compiler.
Structured modeling of manufacturing processes
Authors: H. Engelke, J. Grotrian, C. Scheuing, A. Schmackpfeffer, B. Solf
Venue: Proceedings of the 16th annual symposium on Simulation (1983)

The complexity of modern manufacturing systems calls for advanced modeling techniques which can be applied during different planning phases from a first design to the operation of a system. This paper introduces a Manufacturing Modeling (MM) concept which partitions a system into the subsystems INFORM, EXECUTE and SUPPORT and describes all activities in the individual subsystems by the MM functions REST, MOVE, MAKE and VERIFY. Graphical representations of the model structure and of simulation output help to make models transparent to the user. The technique is being implemented using the Research Queueing Package (RESQ), a modeling language developed by IBM Research in Yorktown Heights. It will be demonstrated for an automatic manufacturing line.
A computer simulation of the effects of variations in constitutive rules and individual goals on interpersonal communications
Authors: Aaron H. Brown, Charles J. Campbell, Eugene E. Kaczka
Venue: Proceedings of the 12th conference on Winter simulation (1980)

This paper is an extension of earlier work concerning the Coordinated Management of Meaning theory of interpersonal communication. Prior research has taken several paths. Among them have been laboratory experiments utilizing games to simulate conversations, computer simulations, and case studies of actual conversations. The research reported in this paper involves a detailed examination of relatively simple interpersonal communications systems. The results of the simulation will be used to evaluate selected theorems to develop protocols for further laboratory testing and to identify laboratory and field research necessary to develop a more accurate model of conversational behavior.
Current status of a portable LISP compiler
Authors: Martin L. Griss, Eric Benson, Anthony C. Hearn
Venue: ACM SIGPLAN Notices (1982)

This report describes the current status of a Portable LISP Compiler used with great success to compile Standard LISP on a variety of machines. It has also been used to provide a portable implementation base for a new LISP (PSL) on the DECSystem 20 and VAX.
A virtual circuit based transaction service
Authors: A. Lavia, D. J. Rhynas
Venue: Proceedings of the sixth symposium on Data communications (1979)

There are currently two means of communicating across public packet switched data networks: via virtual circuits and via datagrams. Virtual circuits are well suited to stream type applications such as time sharing, while datagrams are generally regarded as being appropriate for short inquiry - response transactions. This paper proposes that there is also a wide class of transaction oriented applications which are best served using virtual circuits. The requirements of a specific transaction application are outlined followed by a description of the virtual circuit based implementation that was designed to support a corresponding service on the Datapac network. For this class of application, virtual circuits efficiently provide a central computer facility with tight control over a distributed population of terminals.
The design, analysis, and verification of the SIFT fault tolerant system
Authors: John H. Wensley, Milton W. Green, Karl N. Levitt, Robert E. Shostak
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The SIFT (Software Implemented Fault Tolerance) computer is a fault-tolerant computer in which fault tolerance is achieved primarily by software mechanisms. Tasks are executed redundantly on multiple, independent processors that are loosely synchronized. Each processor is multiprogrammed over a set of distinct tasks. A system of independently accessible busses interconnects the processors. When Task A needs data from Task B, each version of A votes, using software, on the data computed by the different versions of B. (A processor cannot write into another processor; all communication is accomplished by reading.) Thus, errors due to a malfunctioning processor or bus can be confined to the faulty unit and can be masked, and the faulty unit can be identified. An executive routine effects the fault location and reconfigures the system by assigning the tasks, previously assigned to the faulty unit, to an operative unit. Since fault-tolerant computers are used in environments where reliability is at a premium, it is essential that the software of SIFT be correct. The software is realized as a hierarchy of modules in a way that significantly enhances proof of correctness. The behavior of each module is characterized by a formal specification, and the implementation of the module is verified with respect to its specification and those of modules at lower level of the hierarchy. An abstract, Markov-like model is used to describe the reliability behavior of SIFT. This model is formally related to the specifications of the top-most modules of the hierarchy; thus the model can be shown to describe accurately the behavior of the system. At the time of writing, the verification of the system is not complete. The paper describes the design of SIFT, the reliability model, and the approach to mapping from the system to the model.
The iMAX-432 object filing system
Authors: Fred J. Pollack, Kevin C. Kahn, Roy M. Wilkinson
Venue: Proceedings of the eighth ACM symposium on Operating systems principles (1981)

iMAX is the operating system for Intel's iAPX-432 computer system. The iAPX-4321 is an object-oriented multiprocessor architecture that supports capability-based addressing. The object filing system is that part of iMAX that implements a permanent reliable object store. In this paper we describe the key elements of the iMAX object filing system design. We first contrast the concept of an object filing system with that of a conventional file system. We then describe the iMAX design paying particular attention to five problems that other object filing designs have either solved inadequately or failed to address. Finally, we discuss an effect of object filing on the programming semantics of Ada.
Controlling numerically controlled machines using APL
Authors: E. J. Fancher
Venue: Proceedings of the sixth international conference on APL (1974)

This article describes the application of APL \360 to a typical numerical control task.
Preprocessors in a data communication computer environment
Authors: David L. Mills
Venue: Proceedings of the first ACM symposium on Problems in the optimization of data communications systems (1969)

Realizing the need for a highly adaptable transmission control unit to interface varied terminal equipment to the Michigan Timesharing System (MTS), the University of Michigan initiated in 1965 the development of a special control unit to be used in conjunction with the System/360 Model 67. Called the Data Concentrator The design approach taken in the Data Concentrator has been to nucleate about a small general-purpose computer a number of special-purpose interfaces to the various data set equipment. An integral part of the design is an interface which connects directly to the Model 67 multiplexor channels on one hand and to the Data Concentrator computer on the other. This approach avoids the operational restrictions imposed by an off-the-shelf IBM control unit to interface the two machines. In the next section several points will be raised concerning the design goals of this equipment, concerning general characteristics desirable in any terminal control unit and supporting supervisory system. Following this is a detailed description of the Data Concentrator hardware and an overview description of its supervisory program system. Much of this material has appeared in [3 and 6].