ppxscal/embedding_network huggingface dataset:
A new philosophy for interconnection on multilayer boards
Authors: B. Ramakrishna Rau
Venue: Proceedings of the 13th Design Automation Conference (1976)

Alternative approaches to the interconnection problem on multilayer boards are studied and evaluated with respect to their desirability and feasability. A brief review of the current methodology is included to highlight those aspects of the current approach that might be improved upon. The conclusion is that a more integrated approach to interconnection on multilayer boards is essential to deriving the maximum benefit from the additional degrees of freedom afforded by a multilayer board. Various such integrated approaches are proposed.
The structure and operation of a relational database system in a cell-oriented integrated circuit design system
Authors: Lee Hollaar, Brent Nelson, Tony Carter, Raymond A. Lorie
Venue: Proceedings of the 21st Design Automation Conference (1984)

An important use for a database management system is in the storage and handling of information for engineering design, particularly integrated circuit design. However, most discussions on this topic have concentrated on the layout of shapes necessary to form the various circuit elements, or connections between user-defined cells. Equally important, but often disregarded, is the necessity to support other design tools in addition to graphics for circuit layout. These include simulators and automatic layout programs that take a description of a circuit at one level and convert it to a lower level. In addition, if cells are part of a library defined and maintained by others, operations must be included to handle the maintenance of generations or versions of a cell design. These aspects of a database management system for engineering design are discussed in light of the tools being developed at the University of Utah and an extended version of System R, developed at the IBM San Jose Research Laboratory. The Utah approach emphasizes the use of previously designed and tested cells, with interconnects at fixed locations, placed on a grid. Because it is unlikely that the designers of circuits designed all (or any) of the cells used in their circuits, special database management operations are necessary to assure that a consistent, working circuit results.
Lexical and syntactic analysis of APL, generation of a prefix polish string
Venue: Proceedings of the sixth international conference on APL (1974)

The purpose of this @@@@ is to determine a set of Functions for reducing the translation time of APL capressions. These functions developed by simulation (APL) and machine-language programs (assembler) will be used to determine a suitable set of &ldquo;machine-functions&rdquo; which could become new (microcoded) machine -language instructions. The evalution for concept to an implementation has creatly facilitates by the fact that the @@@ was cone at a high level and in an interactive @@@@ and that the assembler pertier was also treated in APL.
A measure for program locality in demand paging
Authors: Robert L. Hedges, Udo W. Pooch
Venue: Proceedings of the 1975 annual conference (1975)

The concept of information flow and information theory, adapted from the management sciences, is utilized to provide a measure of program locality that could be used to analyze, compare, and extend various replacement algorithms. A Locality Matrix Model (LMM) is derived and analyzed in the areas of page fault reductions and the determination of memory requirements to contain any inherent program locality. This approach of dynamic clustering page references is used to predict stationary behavior of the reference string.
Empirical analysis of the mesa instruction set
Authors: Richard E. Sweet, James G. Sandman,  Jr.
Venue: Proceedings of the first international symposium on Architectural support for programming languages and operating systems (1982)

This paper describes recent work to refine the instruction set of the Mesa processor. Mesa [8] is a high level systems implementation language developed at Xerox PARC during the middle 1970's. Typical systems written in Mesa are large collections of programs running on single-user machines. For this reason, a major design goal of the project has been to generate compact object programs. The computers that execute Mesa programs are implementations of a stack architecture [5]. The instructions of an object program are organized into a stream of eight bit bytes. The exact complement into of instructions in the architecture has changed as the language and machine micro architecture have evolved. In Sections 3 and 4, we give a short history of the Mesa instruction set and discuss the motivation for our most recent analysis of it. In Section 5, we discuss the tools and techniques used in this analysis. Section 6 shows the results of this analysis as applied to a large sample of approximately 2.5 million instruction bytes. Sections 7 and 8 give advice to others who might be contemplating similar analyses.
Some connections between mathematical logic and complexity theory
Authors: Richard A. DeMillo, Richard J. Lipton
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

However difficult the fundamental problems of theoretical computer science may seem, there is very little to suggest that they are anything more than knotty combinatorial problems. So, when we look for reasons for our inability to resolve P &equil; NP and related questions, we most likely find them dealing with a lack of understanding of particular computational problems and their lower bounds. This is the sense of Hopcroft's prediction: &ldquo;...within the next five years, nobody will prove that any of these problems takes more than let's say n2 time. I think that's a reasonably safe conjecture and it also illustrates how little we know about lower bounds.&rdquo; [MT]. Hopcroft's guess is uncanny in its accuracy&mdash;after six years and considerable effort by many researchers, his conjecture remains unchallenged. The results in this paper offer a possible explanation for our failure to resolve these problems. Roughly, the main result of the sequel links lower bounds and a branch of mathematical logic known as model theory. In particular, we prove that the existence of nonpolynomial lower bounds is equivalent to the existence of nonstandard models of a sizable fragment of arithmetic. Since these are deep logical issues and there are very few techniques for handling them, and since the nonstandard models in question are non-effective, it seems plausible that this linking of complexity theory and logic explains our failure to obtain nontrivial lower bounds. One of the aims of mathematical logic is to clarify the relation between mathematical theories and their interpretations&mdash;or models.
Automated design based upon Microprogrammable Bit Slice Microprocessors
Authors: Bernard J. Carey, George F. MacLachlan
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

This article will discuss an automated approach to designing digital systems which is based upon the use of System Description Languages (SDL)1,2,3 and Microprogrammable Bit Slice Microprocessors (MBSM)4,5. Both of these concepts have started to reach maturity in recent years with the result that Computer Aided Design (CAD) systems6,7,8 are starting to evolve to a level whereby they may be truly useful in automating certain of the traditionally difficult and time consuming steps in the digital systems design process. In addition to simply minimizing the time consumed in the design process, an automated design approach also opens the possibilities of evaluating different hardware system configurations through simulation. This article will discuss an approach taken at the University of Connecticut to realize a limited form of a CAD system which is based upon a high level design language and the Intel 3000 Family Microprogrammable Bit Slice Microcomputer. The overall design system is called the Restructurable Microprocessor Design System (RMDS)10 and it has been realized in a two phase form. This consists of a high level language system specification phase which occurs in the University Computer Center. This step generates a semi-complete design of the hardware system including the system control unit. An implementation phase may then occur in the Computer Science Microprocessor Laboratory where the design may be translated into a hardware form.
On solving systems of algebraic equations via ideal bases and elimination theory
Authors: Michael E. Pohst, David Y. Y. Yun
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

The determination of solutions of a system of algebraic equations is still a problem for which an efficient solution does not exist. In the last few years several authors have suggested new or refined methods, but none of them seems to be satisfactory. In this paper we are mainly concerned with exploring the use of Buchberger's algorithm for finding Groebner ideal bases [2] and combine/compare it with the more familiar methods of polynomial remainder sequences (pseudo-division) and of variable elimination (resultants) [4].
Communication system design using ADA
Authors: Arthur G. Duncan, John S. Hutchison, John W. Bailey, Thomas M. Chapman, Andrew Fregly, Elizabeth Kruesi, Thomas McDonald, Dennis Merrill, Sylvia B. Sheppard
Venue: Proceedings of the 7th international conference on Software engineering (1984)

This paper describes an experiment in Ada design and some of the lessons learned from it. The experiment itself involved redesigning and reimplementing portions of an existing communication system. The paper compares the project team's design, based on traditional top-down structured design methods, with an alternative design based on information hiding. The project was intended to monitor how a typical industrial software team might adapt to using Ada on realistic embedded application projects. Just as important, however, were the insights gained on how to use Ada in system design. Although the team used virtually every novel feature of Ada, they produced a design remarkably similar to that produced by the original implementors of the system, who used Fortran and Assembler. Thus, the major problem in using Ada appears to be one of education. It is not enough merely to teach the Ada language itself. Instead, one must stress the methodology&mdash;information hiding&mdash;that Ada supports.
An accurate functional level concurrent fault simulator
Authors: M. A. d'Abreu, E. W. Thompson
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper describes the basic data structures and algorithms for a functional level fault simulator. The technique used is that of concurrent fault simulation. The algorithms and data structure support multi-signal value, gate and functional level device models. These algorithms and data structures also support the capability to simulate user defined faults and faults that cause timing violations. In the experimental version of the system, developed at the University of Texas, only classical stuck-at faults and faults that lead to timing discrepancies between the good and the faulty circuit were implemented. Minor additions to the data structures will allow the simulator to process non-classical faults like: (1) memory stuck-at, (2) user defined functional faults, (3) technology dependent shorted signal faults, etc. The accuracy achieved simulating a fault is consistent with the accuracy of the non-fault model.
A simultaneous, radix four, I2L multiplier mechanized via repeated addition
Authors: Adit D. Singh, James R. Armstrong
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

The design of a radix 4 simultaneous multiplier, utilizing I2L circuits, is presented. Because of the relative efficiency of threshold logic implementations in I2L to those using logic primitives, the multiplication is implemented by adding together copies of the multiplicand. This is shown to be more efficient than generating and summing single position partial products. The radix 4 design is also compared to an equivalent radix 2 multiplier (also mechanized with I2L circuits), and is shown to be faster and less costly in terms of required chip area.
Automating mask layout and specification panel session
Authors: Robert B. Cutler
Venue: Proceedings of the 20th Design Automation Conference (1983)

It is becoming increasingly important that the photomasks needed for a VLSI circuit be produced correctly the first time. To obtain good masks, both the design of the chips and their arraying onto masks must be correct. Much attention has been given to chip design&mdash;simulators and design-rule checkers are abundant. In this panel discussion, however, we will be addressing the other aspect&mdash;the layout and specification of the masks themselves. Since a growing number of VLSI designers are turning from traditional optical mask-making to electron-beam (E-beam) mask-making, the emphasis of this discussion will be towards E-beam technology, although many of the concepts apply to all mask making.
Simulation of physiological systems
Authors: Gerald Miller
Venue: Proceedings of the 16th conference on Winter simulation (1984)

Simulation, according to Webster, is the act of representing, feigning, giving an appearance, or assuming. This definition is quiet appropriate in physiological systems. Unlike the technological system, the problem is not the design or the improvement of the system, but rather the understanding of its blueprint. This process is a bit by bit effort in an attempt to unravel a system which has developed slowly over thousands of years of evolution. There are major difficulties in this process, which account for the relatively slow understanding of the workings of the human body. Firstly, there are thousands of subsystems each providing individual functions. Many of these subsystems are Interconnected in massive feedback and control networks. The eye alone contains a network of millions of connections and interconnections. Size of the system is, in itself, often a major stumbling block in the simulation process.
A logic minimizer for VLSI PLA design
Authors: Bill Teel, Doran Wilde
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes LOGMIN, a new, interactive computer aided logic design tool. LOGMIN automates the increasingly complex problems of VLSI PLA design which has made the specification, manipulation, minimization and generation of PLAs difficult to do by hand. LOGMIN allows the specification of both combinational functions and sequential machines. Combinational functions may be described using a variety of operators, intermediate variables or PLA code. A State Machine Description Language (SMDL) was developed for the specification of sequential machines. This paper describes the background and motivation for LOGMIN, the algorithms used and the grammar for SMDL. Several examples are provided.
A study of dynamic reconnection
Authors: Alexandre Brandwajn
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

The recently introduced Extended Architecture (XA) of large IBM computer systems includes, in the disk I/O area, the ability for an access to be resumed and completed on a path different from the one on which it has been initiated. The expected disk performance improvement due to this feature - known as Dynamic Path Reconnection - is investigated in this note. Two popular double pathing connection schemes are considered: switched substrings (as in IBM 3380 Dynamic Path Selection) and dual ported devices (as in Amdahl 6280 Dynamic Performance Pathing). A simple classical queueing system is used to model missed revolutions when transfer paths are found busy. The numerical results obtained indicate that, depending on load, a substantial reduction in the average I/O time can be expected with the Dynamic Path Reconnection feature. This reduction can top 30% under moderately heavy loads. The accuracy of the analytical model for missed reconnections has been checked using discrete-event simulation.
The development of a large scale mathematical programming system
Authors: Jacques De Buchet
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The general purpose mathematical programming systems have greatly changed in the last few years and the aim of such codes is no longer to give access to an efficient algorithm but to integrate the solution of linear programming problems into a loop including the generation of the problem, its solution, its post optimal analysis and the edition of an output report of the results. The link between all these operations is done through a so-called control language program. All these aspects are more or less the same from one code to another but we think that new approaches should be brought into their design, organization, and implementation. The development cost of such programs being very high, usually in the order of 15 to 30 man years, it is necessary to provide facilities in order to: - offer suitable users and programming languages; - have a modular design; - handle memory allocation in a semi-optimal way; - make modifications and extensions easier; and - facilitate day to day programmers tasks. I shall present, in the following pages, the objectives that we had in mind when we began to implement these facilities within the large scale mathematical programming system OPHELIE 2 which we developed for the CDC 6600.
Fast Identification of Stop Words for Font Learning and Keyword Spotting
Authors: Tin Kam Ho
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

A recently proposed adaptive strategy for text recognition uses a linguistic fact that over half of the words on a typical English page are among 150 common stop words. The small lexicon permits word-shape based recognition that yields word identities from which character prototypes can be extracted.This paper describes a fast procedure for locating the best candidates for those stop words. The procedure uses width statistics of individual words and their immediate neighbors. In an experiment using 400 page images, the method removed 63% of the words from consideration. The stop/non-stop word discrimination also assists keyword spotting for information retrieval.
Tidally-generated residual motion in the St. Lawrence estuary
Authors: T. S. Murty, M. I. El-Sabh
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

It was shown that in any water body periodic astronomical tides can generate residual motion, through interaction with the topography of the water body. Such a tidally-generated residual circulation is quite important in computing surface drift. This problem is examined here for the St. Lawrence estuary in eastern Canada, through a numerical model and comparison is made with observations.
Real time diagnosis using single pin probe
Authors: L. M. Zobniw
Venue: Proceedings of the 12th Design Automation Conference (1975)

The cost to generate pre-calculating diagnostics using the stuck (0,1) fault simulation is increasing with logic complexity. This paper describes a real-time diagnostic procedure that does not require fault simulation. This paper describes a Probe Diagnostic Algorithm for making real-time deterministic decisions that direct a single pin probe to as many probe nodes as are required to diagnose a defect to the lowest repairable or replaceable unit. These probe diagnostic criteria are applicable to other test systems, including multiple pin probe testers and manually positioned probes. This Diagnostic Probe Algorithm was designed to be fully automatic or manually interactive.
Optimal subpixel matching of contour chains and segments
Authors: B. Serra, M. Berthod
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

This paper introduces a new general purpose algorithm that allows the optimal geometric match between contours to be determined, that is the transformation yielding a minimal deformation is obtained. The algorithm relies only on the geometric properties of the contours and does not call for any other constraint, so that it is particularly suitable when no parameterization of title deformation is available or desirable. Contour deformation is explicitly incorporated in the computation, allowing for a thorough use of all geometric information available. Moreover, no discretization is involved in the computation, resulting in two main advantages: first, the algorithm is robust to differences in the segmentation of contours and allows the matching of polygonal approximations of contours with very little loss of precision, second, subpixel precision matching can be achieved.
A structure from manipulation for text-graphic objects
Authors: Fred H. Lakin
Venue: ACM SIGGRAPH Computer Graphics (1980)

The general purpose graphics systems of the future will need a simple logic for visual objects&mdash;one structure underlying both text and graphics. As an experiment, perhaps the immediate handling of visual objects by the user can provide the starting point for developing that structure. This paper describes the PAM graphics system, in which the structure of text-graphic objects arises directly out of manual manipulation. The needs of manual manipulation determine the text-graphic pattern as the simplest organizing structure for images; PAM stands for PAttern Manipulating. The PAM system is designed for the agile manipulation of text-graphic patterns&mdash;first manually, and then, later, programmatically. Starting from this strict 'front-in' viewpoint&mdash;where immediate manipulation (hand powered animation) was to be the primary application&mdash;a 'manipulative grammar' was evolved to give the user a simple yet powerful handle on text-graphic images. This grammar turned out to be a generalization of LISP syntax from textual symbolic expressions to text-graphic forms, structuring such forms as trees and then offering: @@@@spatial GRABBING of objects into attention @@@@tree guided attention shifters like FIRST, REST, NEXT, and UP spatial tree manipulations on any object in attention. @@@@The resulting structures also offer surprising computational power (in a manner directly analogous to the way the basic list structures and functions of LISP give rise to the flexibility and power of a full blown LISP system, McCarthy and Talcott [1]), leading finally to computing with text-graphic forms. Consequently, a semantic function is added to supplement the basic manipulative grammar: @@@@evaluation of object in attention, result displayed at the cursor. Evaluation supports facilities like naming (and thus saving) visual objects, programming, and creation of menus (patterns of evaluatable function objects). An experimental version of the PAM system has been implemented in MACLISP at the Stanford Artificial Intelligence Lab.
A proven operational CAD system for P.W.B. design-based on a mini-computer and featuring fully automatic placement and routing.
Authors: G. L. Patterson, B. H. Phillips
Venue: Proceedings of the 13th Design Automation Conference (1976)

The introduction of electronic processor controlled switching systems has led to a re-appraisal of the methods of designing printed wiring boards to cope with the sheer numbers of designs required and their increasing complexity. The Company's policy is normally to realise the equipment on double sided printed wiring boards (pwb) containing a maximum of 80 integrated circuits per board plus discrete components. (Figs. 1 and 2) PWB requirements are frequently changing as new techniques and processes are introduced and therefore methods of improving pwb layout and artwork preparation are continually under investigation. This paper outlines the techniques used within the company and indicates some of the procedural advancements, and the reasons for their introduction.