ppxscal/embedding_network huggingface dataset:
A NonStop kernel
Authors: Joel F. Bartlett
Venue: Proceedings of the eighth ACM symposium on Operating systems principles (1981)

The Tandem NonStop System is a fault-tolerant [1], expandable, and distributed computer system designed expressly for online transaction processing. This paper describes the key primitives of the kernel of the operating system. The first section describes the basic hardware building blocks and introduces their software analogs: processes and messages. Using these primitives, a mechanism that allows fault-tolerant resource access, the process-pair, is described. The paper concludes with some observations on this type of system structure and on actual use of the system.
A simulation model of a message switching system
Authors: Bea Mei Fagan, Henry Kleine
Venue: Proceedings of the 2nd symposium on Simulation of computer systems (1974)

A simulation model of a message switching minicomputer in the tracking and data acquisition subsystem of the Deep Space Network was developed and used to assist in the system design. Some results obtained from the model and their impact on the system design are reported.
Image processing in a university environment
Authors: Gregory C. Alvord, James J. Quinn
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

The Computing Center of the State University of New York at Albany is engaged in providing an innovative service to the research community of our region. During the past few years many pages of literature have been written about image processing (Rosenfeld, 1971). In this literature are presented many application areas that have been investigated to develop algorithms for data analysis. It is our impression that much of this previous work can be brought out of the research phase and into the development phase. We, as computer service specialists, recognize the need to provide card readers and tape drives for our users with data in 'machine readable form' We further recognize that maintenance of a library of statistical and mathematical tools is our obligation to the user/research environment. Image processing has made great strides in establishing itself as a viable research tool. We believe that it is not premature to extend our definition of machine readable objects to include pictures(or what ever a TV camera can see).Further we are extending our program library to include tools tailored to the data structure inherent in images(two dimensional matricies where row and column have positional meanings).
Estimating reliability in simulation experiments
Authors: George S. Fishman
Venue: Proceedings of the second conference on Applications of simulations (1968)

In all simulations containing random phenomena, the investigator wishes to estimate the reliability of his results. This study describes several approaches and suggests an easily implemented two-stage procedure.
The 801 minicomputer
Authors: George Radin
Venue: Proceedings of the first international symposium on Architectural support for programming languages and operating systems (1982)

This paper provides an overview of an experimental system developed at the IBM T. J. Watson Research Center. It consists of a running hardware prototype, a control program and an optimizing compiler. The basic concepts underlying the system are discussed as are the performance characteristics of the prototype. In particular, three principles are examined: system orientation towards the pervasive use of high level language programming and a sophisticated compiler, a primitive instruction set which can be completely hard-wired, storage hierarchy and I/O organization to enable the CPU to execute an instruction at almost every cycle.
A new design language for communication protocols and a systematic design method of communication systems
Authors: Norio Shiratori, Junichi Gohara, Shoichi Noguchi
Venue: Proceedings of the 6th international conference on Software engineering (1982)

A systematic design method of a communication system is given, by which the design, validation, implementation and maintenance of the system can be developed under the consistent philosophy. Next, the DAI-expression method for describing communication protocols is proposed to support the above design method. Here, the DAI-expression consists of three types of expressions, namely, the D-expression, A-expression and I-expression depending upon the purposes such as design, validation and implementation. And the new design language COPDEL is given as the D-expression which is a logical design-oriented expression. Finally, the validation algorithm EXPA is given, which is a generalization of the perturbation analysis given by C.H.West. Furthermore, the EXPA can validate communication protocols described by the COPDEL.
SHARPS: A hierarchical layout system for VLSI
Authors: Toru Chiba, Noboru Okuda, Takashi Kambe, Ikuo Nishioka, Tsuneo Inufushi, Seiji Kimura
Venue: Proceedings of the 18th Design Automation Conference (1981)

A hierarchical layout system for VLSI provided with placement and routing facilities is described, highlighting the routing scheme constructed on the basis of a channel router. Several implementation results are also shown to reveal how much the system has potentialities to be of great use in the practice of layout design of full custom LSI's.
The problems facing computer science education in developing nations
Authors: Edward L. Robertson
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

Computer applications and computer science education for developing nations have received little attention in developed countries, largely because we are naturally interested in first putting our own house in order. This paper is first intended to call attention to the problems of developing nations. It surveys the ways in which developing nations need computing and computer science, and how computer science education can help satisfy these needs. The goals and problems of computer science education are then discussed. One of the gravest problems of a computer science department in a developing nation is isolation&mdash;from technology and research, from professional contacts, from advice. Contacts with departments in developed nations will alleviate, if not solve, this problem at little expense to us. This is not a formal &ldquo;twinning&rdquo;, requiring funds which are presently hard to fund, but an informal assistance.
Improved effectiveness from a real time LISP garbage collector
Authors: Jeffrey L. Dawson
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

This paper describes a real-time garbage collection algorithm for list processing systems. We identify two efficiency problems inherent to real-time garbage collectors, and give some evidence that the proposed algorithm tends to reduce these problems. In a virtual memory implementation, the algorithm restructures the cell storage area more compactly, thus reducing working sets. The algorithm also may provide a more garbage-free storage area at the end of the collection cycle, although this claim really must await empirical verification.
A work-training program for developing consultants at the University of Missouri - St. Louis
Authors: William P. Heinbecker
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

Several years ago the University of Missouri - St. Louis (UMSL) Campus Computer Center initiated a four year work-training program for incoming freshmen. The purpose of the program was to develop student assistants who could relieve the full-time staff of some of the consulting load. It was also intended that the consulting services could be expanded to serve students, who at the time were almost entirely dependent on instructors for assistance. The initial group began in the fall of 1975 and has just completed its second year. A second group has finished one year, and the class of '77 began this fall. This paper describes the program and the results of date.
Summer grazing
Authors: J. R. Donnelly, J. S. Armstrong
Venue: Proceedings of the second conference on Applications of simulations (1968)

A model has been constructed to simulate the grazing of summer pasture by sheep. It records daily changes in the amount and digestibility of the food available and the diet eaten and the resulting changes in the weight of the sheep. The model has been used to predict the response of sheep weight to grazing subdivision, rainfall, growth rate of herbage, the amount of dry food available and the efficiency with which this is grazed.
Interactive computer graphics at Ford Motor Company
Authors: Frank W. Bliss
Venue: ACM SIGGRAPH Computer Graphics (1980)

Over the past fourteen years the Ford Motor Company actively pursued the development and use of interactive computer graphics in the design and manufacture of automobiles. The success of Ford's pioneering efforts in the area of minicomputer graphics led to widespread acceptance and support for graphics within the corporation. This in turn led to a rapid expansion of computer graphics equipment. The advent of numerous Federal regulations in the areas of fuel economy, emissions control, and safety has generated additional Corporate interest in the use of computer graphics to help solve these difficult problems. Use of the Ford Computer Graphics System, as well as various commercially available turnkey computer graphics systems, has contributed substantially to cost reductions, improved productivity, and better documentation and control. This paper describes the on-going computer graphics effort at Ford Motor Company. A brief history of computer graphics is presented along with a detailed description of the Ford Computer Graphics System and the commercial systems. A few applications involving the various graphics systems are discussed. These include design activity at several design and manufacturing areas which are major users of graphics equipment. Next, four computer graphics-related projects presently receiving considerable attention are described. They include communications between graphics systems, a graphics information system and the use of graphics in both structural analysis and numerical control. Finally, some indication of where computer graphics is headed in the future is presented.
META II a syntax-oriented compiler writing language
Authors: D. V. Schorre
Venue: Proceedings of the 1964 19th ACM national conference (1964)

META II is a compiler writing language which consists of syntax equations resembling Backus normal form and into which instructions to output assembly language commands are inserted. Compilers have been written in this language for VALGOL I and VALGOL II. The former is a simple algebraic language designed for the purpose of illustrating META II. The latter contains a fairly large subset of ALGOL 60. The method of writing compilers which is given in detail in the paper may be explained briefly as follows. Each syntax equation is translated into a recursive subroutine which tests the input string for a particular phrase structure, and deletes it if found. Backup is avoided by the extensive use of factoring in the syntax equations. For each source language, an interpreter is written and programs are compiled into that interpretive language.
Tracking Vehicles in Image Sequence for Avoiding Obstacles
Authors: Wu Donghui, Ye Xiuqin, Gu Weikang
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

A real time module is presented in this paper which is used to track vehicles for the navigation of autonomous vehicle moving along motorways. Taking a video stream from a standard camera as the input, this module tracks the preceding vehicles and output their positions and speed related to the host autonomous vehicle. Using Intel's MMX technology, the module is designed to work in real-time on PC platforms.
Format-directed list processing in LISP
Authors: Daniel G. Bobrow, Warren Teitelman
Venue: Proceedings of the first ACM symposium on Symbolic and algebraic manipulation (1966)

This article describes a notation and a programming language for expressing, from within a LISP system, string transformations such as those performed in COMIT or SNOBOL. A simple transformation (or transformation rule) is specified by providing a pattern which must match the structure to be transformed and a format which specifies how to construct a new structure according to the segmentation specified by the pattern. The patterns and formats are greatly generalized versions of the left-half and right-half rules of COMIT and SNOBOL. For example, elementary patterns and formats can be variable names, results of computations, disjunctive sets, or repeating subpatterns; predicates can be associated with elementary patterns which check relationships among separated elements of the match; it is no longer necessary to restrict the operations to linear strings since elementary patterns can themselves match structures. The FLIP language has been implemented in LISP 1.5, and has been successfully used in such disparate tasks as editing LISP functions and parsing Kleene regular expressions.
Device gain - a measure of system component simultaneous operation
Authors: John M. Hoffman
Venue: Proceedings of the ACM annual conference (1973)

As computer systems become more complex and costly, the day-to-day efficient utilization of their capacity becomes more critical. At the same time, the system complexity makes analysis more difficult, and in some cases nearly impossible. It appears that an almost &ldquo;standard solution&rdquo; to the analysis problem is the replacement of the current system with a larger, faster, more complex, and more costly computer configuration. The need for accurate analysis leading to more appropriate management decisions is then postponed. Unfortunately, the cycle repeats itself and the inability to accurately assess the operation and performance of the computer system is now passed on to the new system. The effects of this analysis deficiency will not be immediately realized due to the increased speed and capacity of the new system. This type of solution, however, is becoming so very costly that it is imperative to find an alternative. It is in this context that this analysis and management tool is introduced.
Algorithmic aspects of vertex elimination
Authors: Donald J. Rose, R. Endre Tarjan
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

We consider a graph-theoretic elimination process which is related to performing Gaussian elimination on sparse symmetric and unsymmetric systems of linear equations. We discuss good algorithms for finding elimination orderings, showing that a generalization of breadth-first search, called lexicographic search, can be used to find perfect orderings in 0(n+e) time and minimal orderings in 0(ne) time, if the problem graph is undirected and has n vertices and e edges. We also give efficient (though slower) algorithms for generating such orderings on directed graphs. We claim that the minimum ordering problem for directed graphs is NP-complete, and conjecture that it is also NP-complete for undirected graphs. We include a brief discussion of the relation of elimination to transitive closure and discuss some unresolved, more general, issues.
The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm
Authors: Ehud Artzy, Gideon Frieder, Gabor T. Herman
Venue: ACM SIGGRAPH Computer Graphics (1980)

In many three-dimensional imaging applications the three-dimensional scene is represented by a three-dimensional array of volume elements, or voxels for short. A subset Q of the voxels is specified by some property. The objects in the scene are then defined as subsets of Q formed by voxels which are &ldquo;connected&rdquo; in some appropriate sense. It is often of interest to detect and display the surface of an object in the scene, specified say by one of the voxels in it. In this paper, the problem of surface detection is translated into a problem of traversal of a directed graph, G. The nodes of G correspond to faces separating voxels in Q from voxels not in Q. It has been proven that connected subgraphs of G correspond to surfaces of connected components of Q (i.e., of objects in the scene). Further properties of the directed graph have been proven, which allow us to keep the number of marked nodes (needed to avoid loops in the graph traversal) to a small fraction of the total number of visited nodes. This boundary detection algorithm has been implemented. We discuss the interaction between the underlying mathematical theory and the design of the working software. We illustrate the software on some clinical studies in which the input is computed tomographic (CT) data and the output is dynamically rotating three-dimensional displays of isolated organs. Even though the medical application leads to very large scale problems, our theory and design allows us to use our method routinely on the minicomputer of a CT scanner.
Some algebraic and combinatorial aspects of Multiple-valued circuits
Authors: I. G. Rosenberg
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

The purpose of this expository paper is to review some algebraic and combinatorial results arising in the theory of multiple-level switching circuits. Due to space limitations a selection from the surprisingly rich literature had to be made: the trends and topics presented at the past five International Symposia on Multiple-valued logic. The discussion centers on the formulation of basic problems rather than on the presentation of particular results which may be found in a detailed bibliography. Hardware and implementation are mentioned as motivation only.
Simulation as an estimating tool
Authors: Gerda Woxen
Venue: Proceedings of the second conference on Applications of simulations (1968)

The advantages of using the simulation technique as a tool to estimate performance of systems will be discussed and illustrated by some simulations performed by Swedish industries. &ldquo;Should double tracks be used, or would single tracks perhaps be sufficient in some parts of a mine?&rdquo; was a question raised by a mining company when making preparations for a project. To investigate the utilization of the tracks and estimate the queueing tendencies in the different regions, a model was designated and simulated with the GPSS, General Purpose System Simulator. Another problem of perhaps common interest is the simulation of the traffic in an oil harbor, which was done in order to estimate its utilization during the next ten years, and thus make it easier to predict the appropriate time to enlarge its facilities. The model, which was a somewhat simplified representation of reality, made it possible to study the influence of various parameters on the queueing situation in the harbor.
Duality applied to the complexity of matrix multiplications and other bilinear forms
Authors: J. Hopcroft, J. Musinski
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

The paper considers the complexity of bilinear forms in a noncommutative ring. The dual of a computation is defined and applied to matrix multiplication and other bilinear forms. It is shown that the dual of an optimal computation gives an optimal computation for a dual problem. An nxm by mxp matrix product is shown to be the dual of an nxp by pxm or an mxn by nxp matrix product implying that each of the matrix products requires the same number of multiplications to compute. Finally an algorithm for computing a single bilinear form over a noncommutative ring with a minimum number of multiplications is derived by considering a dual problem.
A heuristics-based approach to decreasing simulation model execution cost
Authors: Keith B. Johnston, Jan A. Aitken
Venue: Proceedings of the 16th annual symposium on Simulation (1983)

This paper presents a brief overview of existing techniques oriented toward improving the executional efficiency of simulation models. It then presents a new heuristics-based technique, describing some language, data, and algorithmic requirements for a simulation package to selectively remove levels of detail from a model in such a way as to decrease the execution time requirements (and cost) of experimenting with the model.
APL\ 360 history
Authors: Adin Falkoff
Venue: Proceedings of the conference on APL (1969)

The program says that this is going to be the history and status of APL\360. It will mostly be the history of APL, and I think that is reasonable because APL\360 is part of the history. I suspect that there will be many other APL\something-or-others before too long. Most of you know that the whole thing was started by Ken Iverson. You may not know that he started it as far back as 1957 when he was teaching at Harvard, and there were certain motivating factors then which it seems have consistently threaded through the rest of the history of APL until now, and I would like to mention what I consider to be the three main lines of continuity, as it were.
Symbolic evaluation of programs: a look at loop analysis
Authors: T. E. Cheatham, J. A. Townley
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

The past several years have witnessed a growing concern with the high cost of software development and maintenance. The usual reaction to this has been administrative&mdash;to organize programming activities better (the Chief Programmer Team); to improve the structure of programming languages, and thus, hopefully, the programs written in them; or to propose that formal &ldquo;specifications&rdquo; be developed for a program before the coding of it in some programming language commences.
The Data Reduction Laboratory-an aid to the space scientist
Authors: Barbara A. Walton, Frank A. Keipert, John J. Quann
Venue: Proceedings of the 1969 24th national conference (1969)

The data Reduction Laboratory was designed as a system that could be used easily by the space scientist. This system will allow him to interface with his data; it will not only process data in real-time, but be capable of being 'programmed' rapidly. The key to this system lies in the use of a combination of dialog and SYNTAX. Dialog is used where possible&mdash;in those areas that can be preconceived, where the possibilities are finite and either limited or subject to limitations&mdash;SYNTAX where not. The input and output, therefore, are defined through dialog, experiment computation by SYNTAX. Relatively complicated processors can be written, checked out, and operating in terms of hours rather than months. Anomalies in the data can be observed and compensated for; data correlations are facilitated. The time lag between launch and analysis should be considerably shortened.
A lesson in recursion and structured programming
Authors: Moshe Augenstein, Aaron Tenenbaum
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

Students in middle level courses in data structures and programming languages often do not have a full appreciation of recursion. The study of the simulation of recursion can be an excellent tool in improving this situation. It is shown how to construct a nonrecursive routine to solve a problem whose solution is naturally recursive. This nonrecursive routine is then used as a foundation from which one can construct a simpler and better structured program than the original version. The advantages of this activity are also discussed.