ppxscal/embedding_network huggingface dataset:
An encoding scheme for word stuffing
Authors: M. M. Buchner,  Jr., E. J. Hronik
Venue: Proceedings of the first ACM symposium on Problems in the optimization of data communications systems (1969)

The effectiveness of word stuffing for synchronization depends upon the ability to distinguish the stuff words from the data words at the destination and, thus, delete correctly the stuff words. If all input sequences are permitted, the data words must be encoded before stuffing occurs so that the stuff word can be distinct from the data words. Previously, a code was given in which a single transmission error could change a data word into the stuff word. In this paper, we give the code that maximizes the minimum distance between the stuff word and any data word. It follows that the probability of character synchronization loss because of confusion between data and stuff words due to transmission errors is considerably reduced. Some implementations are given which suggest that the increase in distance can be achieved at a small cost in hardware. Some other encoding schemes, for which no immediate applications are known, are presented to show the variety of codes that can be designed in hopes of stimulating new applications.
Use of a syntax checker to improve student access to computing
Authors: Christopher Fox, Ronald L. Lancaster
Venue: ACM SIGCSE Bulletin (1984)

This paper describes the design of a syntax checker which is being used to provide enhanced access to computing for introductory programming students. Syntax errors are detected on a microcomputer prior to submission of the job to the mainframe for execution. Advantages of this approach for the students, the instructor, and for the computer center are discussed.
Government actions to increase CAD software productivity
Authors: Dan Nash
Venue: Proceedings of the 18th Design Automation Conference (1981)

As both a user of public domain CAD software and a supplier of CAD software to the government, I am interested in obtaining and supplying such software as efficiently as possible. I feel that the U. S. Government, by taking three relatively inexpensive actions, can increase the CAD productivity of companies in the defense industry. First, a set of standard data interchange formats should be specified and made into industry standards. Second, once these standards are developed, actions should be taken to enforce them. Third, a central &ldquo;database&rdquo; of CAD software available for a fee or in the public domain should be established. These three steps can be implemented at a reasonably small cost, yet would provide large cost savings to government contractors. The long term benefit to the government will be that labor and money spent in modeling devices, reformatting data, and duplicating existing capabilities can be spent on more productive efforts.
&ldquo;A user's experience in Computer Aided Manufacturing&rdquo; or &ldquo;CAM&rdquo; at GTE - Automatic Electric
Authors: H. T. Olson
Venue: Proceedings of the 15th Design Automation Conference (1978)

The term &ldquo;Computer Aided Manufacturing&rdquo; (CAM) congers up different ideas in the minds of different people, depending upon their particular area of expertise, and the size and type of the company they are associated with. It ranges from those types of activites such as Material Requirements Planning, Inventory Management, Factory Capacity Planning, Shop Floor Control etc. to such activities as routing and placement of components on printed wiring cards as well as the art work generation. Another idea of 'CAM' is the actual operation and control of process equipment as well as production test equipment. Some feel that CAM is all of these things together. This paper deals with the actual operation and control of process and test equipment on the factory floor.
An efficient algorithm for computing optimal disk merge patterns. (Extended Abstract)
Authors: L. Hyafil, F. Prusker, J. Vuillemin
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

In this paper, we present an algorithm which computes the optimal pattern for merging n equal size sorted sequences stored on a disk, in time O(log n) and constant space. The best previously known algorithm for solving this problem (Knuth [4], Schlumberger-Vuillemin [5]) takes time O(n2) and space O(n).
Remindings and their effects in learning a text editor
Authors: Brian H. Ross, Thomas P. Moran
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

How can learning in text-editing be characterized? Much recent work has focused on the use of analogies from prior experience. In this paper, we investigate the retrievals of earlier experiences within the editor and how they might be used by analogy to accomplish the task and learn the editor. An experiment is presented that demonstrates the effects of these &ldquo;remindings&rdquo; on performance. In addition, some possible determinants of these remindings are investigated. This experiment points out the need to consider not only the general form of instruction, but also the specifics of the instructional sequence as well. Irrelevant aspects of the task may have strong effects on performance. We consider three teaching techniques, designed to take advantage of these effects in different ways.
Soft documentation&mdash;challenges and techniques for handling mixed-media documents (Panel)
Venue: Proceedings of the ACM 1980 annual conference (1980)

A pragmatic forum where practitioner panelists deliver short papers concerning the impact of the &ldquo;Distributed Interactive Environment&rdquo; on the integration of disparate documentation (by different authors, on different media, in different locations) into a coherent document for transferring information to meet a given, yet variable, need-to-know of the reader/viewer(s). Interactive design, development, and programming provide the opportunities for both technical and end-user personnel to create on-line documentation. The panelists will address new challenges and techniques involved in providing cohesive communication within the areas of: -terminology, writing/editing styles, management, quality control, access, retrieval, publication, distribution, update, and audit controls. Interactive audience participation in an open discussion is encouraged.
Accurate simulation of high speed computer logic
Authors: Lionel C. Bening,  Jr.
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

This paper presents a design verification logic simulation system which uses a ccurate timing information and propagation delay ambiguity in its circuit models. The case in favor of such a system is put forth. Methods for simulating propagation delay ambiguity and utilizing accurate circuit timing data are introduced. The time-sequenced simulation programming technique used in this system is described. Host computer memory and time requirement data from simulation test runs are reported.
A microprogrammed storage management system for a paged stack machine
Authors: P. Macres, G. F. Coulouris
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

The development of a storage management scheme for MEMBERS, an emulated stack machine incorporating a virtual store and paging, is described. The approach used employs an anologue of the 'working set' concept of Denning. Information contained in the activation stack for each process is used to identify a 'Top Stack Set' for the process. The set of all the top stack sets defines the pages that are held in main storage. The architecture of the MEMBERS machine incorporates an activation stack in which pointers can be distinguished from other data. The basic programming language for the machine is designed to encourage a modular structure for programs, so the activation records in the stack for the recently entered procedures contain pointers to an approximation of the working set. A descriptor-based addressing structure enables address mapping to be performed without the use of a page table, so no further gains can be obtained through the use of associative page-register hardware. The use of microprogramming for the implementation of the storage management system is discussed and some preliminary estimates of its performance are given.
Aspects of software design analysis: Concurrency and blocking
Authors: Connie Smith, J. C. Browne
Venue: ACM SIGMETRICS Performance Evaluation Review (1980)

This paper extends previous work on development of a methodology for the prediction of the performance of computer software systems from design level specifications and continuing through implementation. The effects of synchronized behavior, such as results from data reservation in multi-thread executions of data base systems, and competition for host system resources are incorporated. The previous methodology uses hierarchical graphs to represent the execution of software on some host computer system (or on some abstract machine). Performance metrics such as response time were obtained from analysis of these graphs assuming execution of a single copy on a dedicated host. This paper discusses the mapping of these execution graphs upon queueing network models of the host computing environment to yield performance metric estimates for more complex and realistic processing environments.
State of the art issues in distributed databases (Panel session): The efficacy of replicated data
Authors: A. Keller
Venue: Proceedings of the ACM '81 conference (1981)

This discussion of replicated data will investigate such questions as: What good is replicated data? What overhead does it have? What cost/benefit is there to the increased availability it may provide? How can a system take advantage of this availability?
Publications inventory control and distribution
Authors: Deborah R. Richardson
Venue: ACM SIGAPL APL Quote Quad (1983)

Most publications stocked by STSC, Inc. are produced at headquarters. A small number of other publications, however, are ordered from outside vendors and then stocked at headquarters for distribution. Past procedures for inventory control and distribution provided inconsistent data and no means for allocating costs to publications and charging them back to requests. This paper describes the design of STSC's inventory control and distribution system using the APL*PLUS&reg; Data Management System. Although this system was implemented to solve a specific problem, its design provides a general-purpose tool for tracking and allocating costs for stocked items to consuming cost centers.
Aquarius: Logic simulation on an Engineering Workstation
Authors: Andrew Sangster, Jhon Monahan
Venue: Proceedings of the 20th Design Automation Conference (1983)

Aquarius is an interactive hierarchical logic simulator designed to run in a multiple window (concurrent processing) environment on an Engineering Workstation. This approach lets an engineer iterate conveniently between simulation and modification of the logic model or input patterns. Because Aquarius is hierarchical, any subtree of the model may be simulated, facilitating bottom-up design verification. Aquarius uses an event-driven selective trace algorithm and 9 logic states. It models the bidirectional nature of NMOS and CMOS pass elements with a variation of the Sherwood algorithm, which uses pairs of unidirectional gates and inserts phantom zero-delay elements at junction points. This modified algorithm precludes the possibility of erroneous feedback that can result from application of the Sherwood approach for certain network topologies. The Aquarius interactive user interface is menu driven; its progressive disclosure approach uses a form fill-in paradigm and postfix syntax that is keystroke efficient and natural for engineers.
Discovery and learning techniques for pattern recognition
Authors: Rebecca C. Prather, Leonard M. Uhr
Venue: Proceedings of the 1964 19th ACM national conference (1964)

The problem of pattern recognition is that of grasping the meaning of complex entities. A great variety of problem areas attempt to cope with Just such complexities. The importance of discovery and induction methods embedded within a pattern recognition program lies in their potential generality. The program, rather than the programmer, can be asked to discover and learn about the problem area. Pattern recognition should ultimately provide powerful techniques for use in such research areas as form perception, target recognition, language translation, theorem proving, game playing, and the testing of psychological models. Research on some of these applications is already underway. To the extent that discovery and induction can be successfully employed by the program itself, they should be used. This paper describes a program that makes a beginning attempt at such use.
Problems of communication
Authors: Rita Seplowitz Saltz
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

During this SIGUCC User Services Conference, we will be addressing problems of communication with all the energy we can summon up and all the creativity we can muster. We will begin with true-life experiences and from these we will synthesize general definitions of the problems we encounter in various aspects of our work. During subsequent formal sessions and informal meetings, we will try to develop solution approaches to the problems thus defined. In our final time together, each of us will address some particular area of concern, and in a final moment of sharing, we will attempt to unify our many voices to create a common statement which treats the various facets of our theme topic.
Impact of hardware interconnection structures on the performance of decentralized software
Authors: Robert J. Souza, Edward E. Balkovich
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

The results of an investigation of the relationship between software structure, hardware interconnect structure, and the performance of decentralized computer systems are presented in this paper. Programs written in a language that has the salient features of most languages suggested for decentralized software were analyzed using trace-driven simulation. Results indicate that reasonable performance may be obtained at relatively low bandwidths using typical decentralized interconnect structures. Additional results provide insight into the use of hardware interconnect structures by decentralized software.
Simulating the environmental impacts of a high voltage transmission line
Authors: Robert H. Giles,  Jr.
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

A system called POWER has been developed for the optimal location of high voltage power lines. The system employs a Dijkstra network-search algorithm, a type of modified dynamic programming. An optimal corridor, based on a least-cost criterion, is selected from all grid cells between the specified origin and destination of the line. By using the optimum route as a standard, it is possible to study the likely consequences of routes if placed in other corridors, between other points, or over certain line segments, such as across a national park.
Some experiences in the use of inspection teams
Authors: Trevor D. Crossman
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

Because the complexity and sophistication of computer systems continue to increase, more and more areas of critical importance to the Company's viability are encompassed in the Data Processing domain. As this happens, special demands are made of D.P. staff by Users of computer systems. Users need software which gives them high total system availability. For this to be possible any repairs required to software must be made within a tight time (and cost) budget. The discipline of developing systems in a team environment with a tightly knit technical nucleus, is claimed to have come a long way towards meeting these demands. One of the Development Departments in our installation, which serves a large financial corporation, has experimented with another discipline to assist us to meet our User's requirements. We do not claim that we have done anything startlingly new. We have gathered ideas from various sources and applied them to our largely COBOL, largely batch situation. Since mid-1975 systems developed in this Department have been subjected to the discipline of the &ldquo;INSPECTION PROCESS&rdquo;.
Towards the construction of verifiable software systems
Authors: L. Flon, A. N. Habermann
Venue: ACM SIGMOD Record (1976)

Data types are an important design tool because they allow freedom of abstraction. Thus, they are useful for constructing large software systems, including operating systems. It is shown that when dealing with problems of concurrency, the use of path expressions, which are associated with data, makes the task of verification simpler than when the synchronization conditions are associated with programs.
Antithetic variates and quasirandom points as variance reduction techniques
Authors: George S. Fishman
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

This talk describes how one can transform uniformly distributed quantities to achieve substantive variance reduction in Monte Carlo sampling experiments. An abbreviated historical account of the theory of antithetic variance and the theory of quasirandom points will be presented with emphasis on the identification of circumstances in which results for accelerated error convergence are known in both the univariate and multivariate cases for antithetic variates and quasirandom points. The presentation includes extensions of the theory of antithetic variates to the simulation of Markov chains and semi-Markov processes and the application of quasirandom points to the analysis of stochastic networks. As a special topic, the talk describes how these techniques might fare in the setting of parallel processing.
Paper fair
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Many authors submitted abstracts of papers they wished scheduled for presentation in the informal atmosphere of a paper fair. In a fair, full length copies of each paper are available from authors who are assigned a booth at multiple times when they make informal presentations to the interested parties who assemble at the designated times and places. This method of presentation generates contributions from listeners who are free of the inhibitions which are often present in the large group formal presentations of the regular sessions. Abstracts of the 28 papers which were submitted to the paper fair follow.
A simulator generator based on formal descriptions of architectural, load,and operating system models
Authors: Helmut Kerner, Werner Beyerle
Venue: Proceedings of the 1976 annual conference (1976)

The time needed for designing a simulator often hampers or even eliminates its use for the evaluation of computer systems. In order to alleviate this design effort a simulator generator which is driven by formalized descriptions of the hardware, the workload and the operating system is presented. This paper concentrates on the descriptions of the three defining models. These descriptions guide the simulator designer in the selection of pertinent facts from natural language sources and provide a short notation of the data and structures of the three submodels. The structure of the description languages encourages modularization of the simulator. A large variety of simulators can be generated through composition from a growing set of such modules.
The REDUCE system for computer algebra
Authors: Martin L. Griss
Venue: Proceedings of the 1975 annual conference (1975)

REDUCE is an ALGOL-like procedural language for computer algebra, and general symbolic manipulation. Since it is primarily interactive, the language is command oriented, with each command being parsed, and evaluated, before proceeding to the next. The program can also be run batch mode. The language provides scalar variables, matrices and arrays, prefix and infix operators, block structure, FOR loops, WHILE loops and procedure definition, for use with a variety of algebraic and symbolic data types. The symbolic capability of the REDUCE language is complete enough to enable the entire program to be written in its own source language. The system currently uses a standardized subset of LISP 1.5 as an intermediate language, and REDUCE evaluation involves a translation through this subset to the specific LISP provided by the machine on which REDUCE is being run. REDUCE therefore uses LISP parameter binding and scope rules, and provides a RETURN statement to exit from a block with a value
Digital straightness and convexity (Extended Abstract)
Authors: Chul E. Kim, Azriel Rosenfeld
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

We define straightness and convexity of regions in a digital picture. Then it is shown that a few important properties satisfied by convex (Euclidean) regions are also satisfied by convex digital regions. We extend the definition of digital convexity of regions to digital solids. Efficient algorithms are presented that determine whether or not a digital region is convex, a digital arc is a digital straight line segment and a digital solid is convex.
An 0(n log n) sorting network
Authors: M. Ajtai, J. Komlós, E. Szemerédi
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

The purpose of this paper is to describe a sorting network of size 0(n log n) and depth 0(log n). A natural way of sorting is through consecutive halvings: determine the upper and lower halves of the set, proceed similarly within the halves, and so on. Unfortunately, while one can halve a set using only 0(n) comparisons, this cannot be done in less than log n (parallel) time, and it is known that a halving network needs (&frac12;)n log n comparisons. It is possible, however, to construct a network of 0(n) comparisons which halves in constant time with high accuracy. This procedure (&egr;-halving) and a derived procedure (&egr;-nearsort) are described below, and our sorting network will be centered around these elementary steps.
On routing two-point nets across a channel
Authors: Ron Y. Pinter
Venue: Proceedings of the 19th Design Automation Conference (1982)

Many problems that arise in general channel routing manifest themselves in simpler situations. We consider connecting a set of n terminals on a line to another set on a parallel line across a rectangular channel. We show that in any solution to the problem that (almost) minimizes the width of the channel (i.e. the distance between the lines the terminals reside on) a net may require as many as ?(?n) horizontal jogs no net routed from top to bottom need ever turn upward in the middle We also present an efficient algorithm to obtain minimal jogging in river routing, and provide necessary and sufficient conditions for conflict cycle resolution. These and other results are presented in the context of a general survey on routing from a combinatorial complexity point of view.