ppxscal/embedding_network huggingface dataset:
A path connection algorithm for multi-layer boards
Authors: Sam Heiss
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

The design of component interconnection paths on printed plugboards, platters, and backplanes is becoming increasingly critical as the component density and circuit speed increases. At the present time, most of the successful attempts to route multi-layer surfaces have been based on orthogonal wiring patterns where one surface of a pair contains mostly vertical paths and the other surface contains mostly horizontal paths. The two surfaces may be joined, or &ldquo;stitched&rdquo;, at specified points by plated (via) holes. This method has produced results ranging from excellent to poor depending on the surface definition, path width, pad size, etc. A fault inherent to orthogonal wiring is a tendency to use an excessive number of via holes. The algorithm proposed in this paper and presently being incorporated in a Design Automation program for RCA Information Systems Division extends a well known &ldquo;maze running&rdquo; technique commonly used on single surfaces to multi-layer boards.
Babel, an application of extensible compilers
Authors: R. S. Scowen
Venue: Proceedings of the international symposium on Extensible languages (1971)

The normal approach in providing an extensible programming language seems to be to design and implement a base language which has facilities enabling the programmer to define and use extensions. This paper discusses a solution using an alternative approach in which extensions are made by changing the compiler. Of course, in theory, any compiler can be altered (it is only a computer program); in practice it is probably not so easy since difficulties will arise if the compiler has been designed for one fixed standard language on one particular computer. If a compiler is to be altered, it must possess various properties; there should be no danger of accidentally invalidating an existing program, and it must be clear what changes are required to make a desired extension. It is also desirable that only a small number of changes should be required to make an extension. The method of writing compilers which is described below satisfies these conditions and has been adopted in three different applications:- (1) Babel, a conventional high level programming language. (2) SOAP, a program which documents and edits an ALGOL 60 program. (3) PL516, a high level assembly language for the Honeywell DDP516 computer.
Automatic generation of cells for recurrence structures
Authors: Avinoam Bilgory, Daniel D. Gajski
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper describes a method for automatic translation of functional into structural descriptions for Boolean recurrence systems. The solution of a recurrence system is accomplished by a network that requires at most four different types of cells. Given any Boolean recurrence of any order, the cell generator module defines the Boolean equations of these cells.
Design of a microcomputer laboratory for teaching computer science
Authors: Alfred C. Weaver
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

On the premise that many of the fundamental concepts of computer science can be better taught in a hands-on, dedicated computing environment (i.e., a microcomputer), as opposed to a large multi-purpose system in which the student is insulated from the machine by multiple layers of operating system software, we have developed a microcomputer-based lecture/lab course to teach CPU organization, digital computer architecture, and assembly language programming as a third undergraduate course in computer science. By beginning with simple machine organizations and simple assembly languages, and later on making a transition toward more complex architectures and languages, the transfer of knowledge and experience is positive at every step. The same laboratory also supports a graduate course in microcomputer systems design which teaches hardware technology, component specification, operating system design, hardware/software tradeoffs, and practical applications such as process control. This paper outlines the motivation and justification for the project, and then discusses the actual design of these courses and their supporting laboratory. This project is supported in part by two grants from the National Science Foundation: SER-7915929 for the acquisition of the microcomputer equipment and SER-8000802 for the development of the undergraduate course material.
Automatic computation of limits
Authors: Paul S. Wang
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

This paper describes a program designed and implemented for the MACSYMA system for the computation of limits of single-valued functions of a real variable. The classes of expressions handled by this program include rational, radical, logarithmic and exponential expressions, and also the trigonometric functions sine, cosine and tangent. The first few sections of this paper contain an outline of the algorithm used and some examples of solutions of limit problems by the MACSYMA system. A number of more important methods used in the program are discussed in detail in the later sections. Among these methods are: a fast method for the limit of a rational function, L'Hospital's rule, a method for a class of expressions called RP-expressions and comparison of orders of infinity.
Measurement and analysis of a demand paging Time Sharing System
Authors: W. M. De Meis, N. Weizer
Venue: Proceedings of the 1969 24th national conference (1969)

This paper presents performance measurements and analysis undertaken during development of RCA's Time Sharing Operating System (TSOS). The measurement results provide some indications of the capabilities of the operating system and its hardware. The analysis of the results provides information in attempting to establish general principals of multiprogramming operating system design. In the following we describe: the equipment and operating system of TSOS; the measurement method, results, and analysis; and finally, conclusions and some opinions about time slicing and demand paging in operating systems.
On formulating simultaneity for studying parallelism and synchronization
Authors: Raymond E. Miller, Chee K. Yap
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

When studying parallel computation and synchronization one is faced with the problem of modeling the simultaneous execution of processes. Although there has been a multitude of formal means for representing such problems [2, 6, 9, 10, 13, 14, 15], invariably, when all the other complexities of the models have been stripped away, the parallelism or synchronization is studied via sequences of events. In all of these studies simultaneity of events is not studied directly. Rather, it is represented by the interleaving of the separate events into sequences, and by studying properties of the set of all such sequences.
Program complexity measure for software development management
Authors: Takeshi Sunohara, Akira Takano, Kenji Uehara, Tsutomu Ohkawa
Venue: Proceedings of the 5th international conference on Software engineering (1981)

The program complexity measure currently seems to be the most capable measure for both quantitative and objective control of the software project. Five program complexity measures (step count, McCabe's V(G), Halstead's E, Weighted Statement Count and Process V(G)) were assessed from such a viewpoint. This empirical study was done with the data collected through a practical software project. All of these measures have highly significant correlations with the management data. Application of complexity measures to software development management is discussed and a method for the detection of anomalous modules in a program is proposed.
A computer simulation model for examining cogeneration alternatives
Authors: P. F. Schweizer, R. E. Sieck
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

The purpose of this paper is to describe a computer simulation model that was used to analyze the technical and economic aspects of specific cogeneration applications. The model was coded in the APL language and runs on the Scientific Time Sharing System. The model was used to help provide a quantitative assessment of the potential market for industrial cogeneration equipment in the near-term future. This assessment was developed from costs and technical parameters derived from a detailed analysis of five generic cogeneration cases.
A simulation model for evaluating initiator structures
Authors: H. Pat Artis
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

The design and implementation of a discrete simulation model of initiator structures for IBM's MVS operating system is presented. This model was developed for evaluating the service characteristics of alternative initiator structures for processing testing workloads.
Robust Skew Estimation on Low-Resolution Document Images
Authors: Oleg Okun, Matti Pietikäinen, Jaakko Sauvola
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

In this paper, we present a new technique for estimating an arbitrary skew angle using a simple and efficient text row accumulation based on the statistics of the 1st and 2nd~orders. In contrast to other works, where an image resolution of 100-300 dpi is necessary, a lower resolution (50 dpi) is enough for our method to obtain a correct result. The performance of the method was evaluated on the database UW-I of the University of Washington and compared with one advanced Hough transform-based method. A significantly lower error rate for our method confirms its advantages and benefits for automated document processing.
Rio Grande message switching/transportation system
Authors: William J. Day
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The Denver and Rio Grande Western Railroad has played an important role in the development of the Rocky Mountain area. In the early pioneering days this home-grown transportation company moved prospectors and their products around the area. From a somewhat isolated railroad, the Rio Grande has developed, with the rest of the region, into a very vital link in the movement of freight across the country. With the current decline of passenger traffic, the Rio Grande's business consists of mainly freight movement across its 2100 miles of track, located in Colorado and Utah. The Western points of the railroad are Salt Lake City and Ogden in Utah, with eastern nodes at Denver and Pueblo, Colorado. Other than property resources, the Rio Grande operates 250 diesel locomotives and has an ownership of over 12,000 cars of all kinds. Approximately 4,000 employees are involved in making the Rio Grande a profitable railroad with total revenues of &dollar;88 million in 1967, and a net of about &dollar;11 million. Most of the freight traffic handled, about 50%, is what is known as bridge traffic; i.e., cars are received from a connecting railroad at one end of the railroad and are given to another connecting railroad at the opposite end. The remaining traffic handled is split about evenly between the other three classes of traffic. To support and produce this off-line generation of business, traffic offices are located in twenty-eight locations throughout the United States&mdash;well away from the actual movement in Colorado and Utah.
Simulation modeling workshop
Authors: William E. Biles
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

This paper reviews the fundamentals of computer simulation modeling. Simulation is viewed here as a technique for the experimental manipulation of a model of a real-world system, drawing heavily upon computer science, mathematics, probability and statistics. Simulation involves modeling the entities in a physical system and the activities in which those entities engage. It affords the opportunity to construct ideally configured systems and select optimum system operating conditions on the basis of results obtained by simulating such configurations and conditions on a digital computer. Models of some simple material handling systems are used to illustrate the simulation concepts presented here.
ENEP - an interactive program for solving one-dimensional continuum mechanical problems using a graphic terminal
Authors: Arne Sundström, Lars Westerling
Venue: Proceedings of the SIGNUM meeting on Software for partial differential equations (1975)

ENEP is a one-dimensional finite-difference Lagrangian code for calculating transient motion of various types of continua, including elastic-plastic media, high explosives, gases, and inviscid fluids. The program is interactive and written in Fortran at the Swedish National Defence Research Institute (FOA) for a PDP-10 (DEC System 10) computer with a TEKTRONIX 4012 Graphic Terminal. The program can only treat problems in one space coordinate, including however both plane, cylindrical, and spherical symmetry. The region of integration can be composed of up to 10 sub-regions with materials of different types, and the physical boundary conditions available are free or fixed boundary, a prescribed boundary velocity or a prescribed boundary pressure. Initially, each material may have a prescribed velocity or be at rest.
Simulation and strategic planning: A case study effectiveness evaluation
Authors: Steven R. Dzubow
Venue: Proceedings of the 17th annual symposium on Simulation (1984)

Strategic Planning, especially planning related to the long-term allocation of organizational resources, is a difficult and complex task. Particularly difficult is the allocation of field service resources with its multitude of variables and operating tradeoffs. Whereas traditional planning techniques are adequate in relatively static environments, their usefulness rapidly deteriorates in volatile, changing situations. This paper investigates the use of simulation techniques to augment strategic planning capabilities and presents the costs and benefits of using alternative techniques via a case study.
Unbounded fan-in circuits and associative functions
Authors: Ashok K. Chandra, Steven Fortune, Richard Lipton
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

We consider the computation of finite semigroups using unbounded fan-in circuits. There are constant-depth, polynomial size circuits for semigroup product iff the semigroup does not contain a nontrivial group as a subset. In the case that the semigroup in fact does not contain a group, then for any primitive recursive function f, circuits of size O(nf&minus;1(n)) and constant depth exist for the semigroup product of n elements. The depth depends upon the choice of the primitive recursive function f. The circuits not only compute the semigroup product, but every prefix of the semigroup product. A consequence is that the same bounds apply for circuits computing the sum of two n-bit numbers.
Formal models for some features of programming languages
Authors: H. Paul Zeiger
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

In this paper we attempt to tighten the connections between classical mathematics, automata theory, and the theory of programming languages. Formal linguistic objects corresponding to programs are defined via sets of functional equations; two interpretations of such an object are given, one in classical mathematics, and one in terms of an abstract machine that executes the program. Within this framework we examine flow charts, recursion, parameterization, and declaration.
Coping with errors in binary search procedures (Preliminary Report)
Authors: R. L. Rivest, A. R. Meyer, D. J. Kleitman
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

We consider the problem of identifying an unknown value x&egr;{1,2,...,n} using only comparisons of x to constants when as many as E of 'the comparisons may receive erroneous answers. For a continuous analogue of this problem we show that there is a unique strategy that is optimal in the worst case. This strategy for the continuous problem is then shown to yield a strategy for the original discrete problem that uses log2n+E.log2log2n+O(E.log2E) comparisons in the worst case. This number is shown to be optimal even if arbitrary &ldquo;Yes-No&rdquo; questions are allowed. We show that a modified version of this search problem with errors is equivalent to the problem of finding the minimal root of a set of increasing functions. The modified version is then also shown to be of complexity log2n+E.log2log2n+0(E.log2E).
A parallel pipelined relational query processor: An architectural overview
Authors: Daniel Gajski, Won Kim, Shinya Fushimi
Venue: ACM SIGARCH Computer Architecture News (1984)

This paper outlines the overall architecture of a query processor for relational queries and describes the design and control of its major processing modules. The query processor consists of only four processing modules and a number of random-access memory modules. Each processing module processes tuples of relations in a bit-serial, tuple-parallel manner for each of the primitive database operations which comprise a complex relational query. The query processor is designed to be manufacturable using existing VLSI technology, and to support in a uniform manner both the numeric and nonnumeric processing requirements a high-level query language like SQL presents.
On the sign of a real algebraic number
Authors: Siegfried Rump
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

In an ordered algebraic extension field of the rationales algorithms for sign determinations are studied. Two new algorithms are analyzed in detail and shown to be asymptotically and in practice faster than previous algorithms.
Parsing and evaluation of APL with operators
Authors: M. P. Georgeff, I. Fris, J. Kautsky
Venue: Proceedings of the international conference on APL (1981)

The importance of operators in APL is now well recognised, and considerable attention has been paid to the inclusion of more general operators into the language. In this article we consider some of the consequences for the implementation of interpreters and compilers for APL. We first consider the difficulties that arise with the introduction of function valued and basic valued operators. We then discuss various modifications to the syntactic and semantic structure of APL that serve to avoid these difficulties. Abstraction operators as in the lambda calculus are also introduced. Finally, we describe an abstract machine for interpreting APL-like expressions which is analogous to the SECD machine used in the lambda calculus.
Views of office data
Authors: Richard E. Fikes, Carl Hewitt, Vania Joloboss, Lance A. Miller
Venue: Proceedings of the SIGOA conference on Office information systems (1982)

Office applications will eventually be defined and executed by office personnel rather than professional programmers. There are many scientific disciplines and technologies that are contributing to this goal. This panel will explore a few of these areas: databases, artificial intelligence, and linguistics. Today the active database research areas are in highly distributed, real-time transaction oriented systems, and dynamic expressive data organizations such as the relational model. The extending of the database models to cover the requirements of the office is a major concern in office systems research. Artificial Intelligence has been directly involved with the problems of interfacing with end-users for a considerable period of time. The AI knowledge base systems are much closer in spirit to the way humans accumulate and use partial knowledge to solve problems than the database models. Using AI techniques, expert systems have been built for various application areas. One can envision the use of expert office systems to help in solving business and organizational problems. Much of the communications done in the office is in terms of natural language. Linguistics is concerned with the structure of language and how people generate it and understand it. The greater the extent that an office system can deal with natural languages, the more useful that system will be to end-users. This panel will discuss how intelligent the next generation of office systems can become using these technologies.
Vendor services: Questions that should be asked
Authors: William Decker
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

If User Services is to participate in decisions about computing acquisitions - both hardware and software - the following questions represent concerns that must be addressed. It is asserted that vendors do not traditionally pay as much heed to these issues as they do to the &ldquo;hardware aspects&rdquo; of their products. Yet with decreasing hardware costs and rising people (and related) costs, these issues must receive attention. Two points are being made: User Services personnel had better learn to pursue these issues during times of acquisition andvendors must learn to sell their products to the User Services staff as well as others within the Computer Center.
Simulation of the HMS 5050 computer system
Authors: Leonard H. Weiner, Steven L. Huyser, Bernhard Weinberg
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

The HMS 5050 Computer System was designed to allow Computer Science students at Michigan State University access to a computer which has an interrupt system and programmable data channels. The HMS 5050 simulator, which runs on MSU's CDC 6500, enables the students to implement a major component of an operating system, and has been used successfully there since fall term 1972. In this paper we present the design goals of the HMS 5050, discuss its architecture and the structure of its simulator, and summarize classroom experience with the simulator.
The design of a multi-microprocessor based simulation computer - III
Authors: John Craig Comfort, Yao Winqing, Li Qiang
Venue: Proceedings of the 17th annual symposium on Simulation (1984)

A continuing research project at Florida International University in the development of a discrete event simulation computer based on a tightly coupled network of high performance, (relatively) low cost microprocessors. The basic design approach involves identifying specific sets of related tasks within a simulation program, and assigning these tasks to ancillary processors. In this paper, the state of the system with respect to the task of Event Set Manipulation is reviewed. A new event set algorithm, the Merged Adaptive List algorithm is presented; using this algorithm permits one event set processor to perform computations previously requiring three; its performance is contrasted with that of the Linear and Adaptive Linked List algorithms.
The role of the blind in data processing
Authors: Theodor D. Sterling, Joseph B. Landwehr, Charles McLaughlin, Seymour V. Pollack
Venue: Proceedings of the third annual computer personnel research conference (1965)

Imagine that you are asked to evaluate a candidate for a job as a programmer. The applicant appears to be extremely intelligent. He has shown himself to be very inventive. He seems to have a number of outstanding capabilities which point to him as an especially gifted programmer. There is no question but that he is highly motivated to do well in his profession. He can show that he is well trained in all aspects of computation and related topics. He also appears to have a good general education besides being personable. Yet, despite these desirable qualifications, the applicant may be disqualified because he is blind.