ppxscal/embedding_network huggingface dataset:
Physical design and manufacturing information aspects aspects of the AT T bell laboratories CAD system
Authors: Charles W. Rosenthal
Venue: Proceedings of the 21st Design Automation Conference (1984)

The features for physical design are contained in the integrated Interconnection Design System (IDS) component of the AT T Bell Laboratories CAD System. These features are used by transferring a file (the Common Design File, CDF) created in the prototype design phase by the Engineering Design System (EDS) component of the System. IDS also has the flexibility to handle design processes that start with a textual description of design intent or with the digitizing of preexisting designs. IDS can process circuit packs that are based on double-sided or multi-layer etched technology or on discrete wire technologies. IDS can process backplanes using etched, discrete, or mixed technologies. Checks are provided to ensure the consistency of the design intent, the schematic drawing, and the physical layout. Audits are provided for electrical and mechanical criteria. The complete design description is contained in the CDF, which may be depicted using assembly and piecepart drawings for the physical attributes and schematics for the logical/circuit attributes. The manufacture of initial models or volume product is aided with CAM data extracted from the CDF for artwork, component insertion, discrete wiring, drill, high voltage test, and bare board test machines. IDS uses a single, comprehensive data base, the CDF, to accumulate data in uniformly defined formats. The CDF serves as a data bus among many independently designed application units. The CDF for a complete design is transferred to manufacturing organizations or other design organizations. A component file contains the schematic and physical definitions of components shared throughout the AT T businesses, locally or on a single project. IDS uses shared mainframes in computation centers, and minicomputers in dedicated environments. There are now six mainframe hosts at sites from Colorado to New Jersey, and users are distributed among eleven sites. The IDS users are primarily expert layout and documentation people in the Design Engineering Staff organizations of the AT T design and manufacturing organizations. There are several hundred users who are concurrently processing over 500 design codes. The productivity of designers has been increased fourfold over the preexisting design processes while the design complexity and the scope of activities has also increased. Success with the comprehensive IDS has encouraged its extension to all corners of the AT T development and manufacturing community. This has stimulated the development of follow-up aids that will further reduce the cost of design by using more effective computing environments and improved algorithms and processes.
The CUPM recommendations on a computational mathematics program and on the impact of computers on undergraduate mathematics courses
Authors: Werner C. Rheinboldt
Venue: Proceedings of the third SIGCSE technical symposium on Computer science education (1973)

The growing influence of modern electronic computing in many fields of knowledge has contributed to a dramatic increase and diversification in the application of mathematics to other disciplines. No longer are the uses of mathematics confined exclusively to the physical sciences and engineering; they are found with increasing frequency in the social, behavioral, and life sciences as well. At the same time the use of the computer has led to different requirements for the solution process in mathematics itself. Theory construction and model building have assumed a different dimension; in addition to knowing existence theorems, the user of mathematics must know constructive methods for solving problems, and he must have the means to ascertain the efficiency as well as the correctness of these methods.
The quad-CIF tree: A data structure for hierarchical on-line algorithms
Authors: Gershon Kedem
Venue: Proceedings of the 19th Design Automation Conference (1982)

In this paper we describe the quad-CIF tree data structure and its application to hierarchical on-line computer-aided design algorithms. The main idea is to overlay a tree of coordinates on top of the hierarchical representation of an integrated circuit. The coordinate tree enables one to find quickly the set of all objects that intersect a given window. We outline how one can use the data structure in order to implement hierarchical, on-line design rule checking and node extraction. We also describe some applications to plotting.
APL and its entry into the world (?)
Authors: Cyrus J. Creveling
Venue: Proceedings of the sixth international conference on APL (1974)

The more widespread use of APL is contingent on the solution of a number of technical, psychological, and promotional problems. A separate organization is suggested as the best way to coordinate the solution of these.
Application of APL/360 in junior high school
Authors: David DeBarthe
Venue: Proceedings of the sixth international conference on APL (1974)

After finding serious problems of scheduling our one console for student hands-on for drill, simulation, testing and tutorial type programs, we have attempted to find uses for the computer which reach a larger number of students with a relatively small amount of connect time. Primary emphasis has been in the generation of worksheets and test problems, and puzzle formers. Other uses developed include grade reporting, test analysis, and curriculum materials management.
A proposed computer-assisted approach to long-range global strategic forecasting
Authors: Patricia Kramer-DeBuck, Brian L. Marshall, Reuben G. Miller
Venue: Proceedings of the 11th annual symposium on Simulation (1978)

This paper generally summarizes a report prepared for the Department of Defense on global strategic forecasting. It recommends that DOD long-range planning be conducted on a general probabilistic basis, identifying the factors of national power, forecasting their most likely status on a national and regional basis, and assessing the political implications of these future power relationships accordingly. It suggests Ray Cline's Perceived Power equation as the vehicle for such an approach and recommends a &ldquo;family&rdquo; of forecasting models using Mesarovic's &ldquo;APT&rdquo; interactive software to provide needed inputs to the equation.
Meaningfulness as a factor of program complexity
Authors: B. D. Chaudhary, H. V. Sahasrabuddhe
Venue: Proceedings of the ACM 1980 annual conference (1980)

Various measures of program complexity have been proposed in the literature. However, none of these measures represent the total psychological complexity of the programs. Five features of the program: size, control structure, data structure, execution structure and "meaningfulness" are identified as factors affecting processes involved in program understanding and hence the program complexity. Results of an experiment, which was conducted to study the effect of meaningfulness of a program on its understanding, is also described.
Zero divided by zero
Authors: E. E. McDonnell
Venue: Proceedings of the eighth international conference on APL (1976)

Current implementations of APL give one as the result of zero divided by zero. This paper gives the reasons for proposing that this quotient be changed to zero. Two conventions introduced by K. E. Iverson [1] for the exposition of mathematical topics are used here.
Using simulation to optimize solar greenhouse design
Authors: Robert D. Engel
Venue: Proceedings of the 17th annual symposium on Simulation (1984)

This paper discusses the development and use of a thermal greenhouse model which was written in the DYNAMO computer simulation language. The model is used in designing an energy-efficient passive stand-alone greenhouse for use in the Southern California area. The design process and model are readily adaptable for use in other climatic regions and for studying attached greenhouses.
A.P. 1 APL.68000's local auxiliary processor mechanism
Authors: A. Van Cleave
Venue: ACM SIGAPL APL Quote Quad (1983)

This paper will discuss the implications, uses, and internal architecture of APL.68000's Auxiliary Processor 1, a special auxiliary processor which allows users to create their own local auxiliary processors. As microcomputers become more and more sophisticated, it is increasingly important that APL systems on micros can interface to the &ldquo;outside world&rdquo; in as general and as simple a manner as possible. There are three key things that the APL user on a micro needs to interface with: 1) Peripherals 2) Operating System Routines 3) Non-APL Sub-routines (Assembler, Fortran, etc.)
An Analysis Of Recurrent Software Errors In A Real-Time Control System
Authors: Amrit L. Goel, Kazu Okumoto
Venue: Proceedings of the 1978 annual conference (1978)

This paper presents an analysis of actual software error data from a large-scale software project using the imperfect debugging model proposed by Goel and Okumoto [1]. The model parameters are estimated from the actual data and the values predicted from the model are compared with the observed values. Joint confidence regions for the parameters are also constructed which permit a study of the sensitivity of predictions.
An axiomatization of low-level parallelism in microarchitectures
Authors: Werner Damm
Venue: ACM SIGMICRO Newsletter (1984)

This paper presents the heart of a universal syntax-directed proof system for the verification of horizontal computer architectures. The system is based on the axiomatic architecture description language AADL, which incorporates a comcise model of clocked microarchitectures. For a given description A of a host architecture, we show how to axiomatize A's microoperations and present powerful proof-rules dealing with the inherent low-level parallelism of horizontal architectures. They allow for a complete axiomatic treatment of the timing behaviour and dynamic conflicts of microprograms written in an A-dependent high-level microprogramming language based on S*.
AQL: An APL based system for accessing and manipulating data in a Relational Database System
Authors: F. Antonacci, P. Dell'Orco, V. N. Spadavecchia
Venue: Proceedings of the eighth international conference on APL (1976)

An increasing friendliness towards the &ldquo;casual&rdquo; user is one of the main characteristics of the evolution of man-machine communication systems. In the Database area, it is common opinion that this may be achieved by providing an &ldquo;easy&rdquo; means of communication between the user and the system and a conceptually simple data model (i.e. usable by a user who is not DP professional, but accepts a slight degree of formalization). The aim of this paper is to describe a formal query language and its characteristics. Those characteristics display a high degree of data independence, in the sense that the underlying storage structure need not necessarily be known by the user, nor will his transactions be affected by changes in the storage structure or access strategies. Furthermore the formal language is embodied in an homogeneous environment in which the user may define programs and execute algorithms on the results of his queries to satisfy his problem solving needs. The language interface with the Database relies upon Codd's relational data model [1]: its symmetry, and the semantic completeness of its algebra guarantees a friendly interface to the user. The description of the particular implementation of this data model, that is the memory model, is outside the scope of this paper, nevertheless in what follows we will also give a brief sketch of it whenever it is necessary to clarify some of the characteristics of the language.
Automatic component placement in an interactive minicomputer environment
Authors: Charles F. Shupe
Venue: Proceedings of the 18th Design Automation Conference (1981)

A minicomputer-based, second-generation automatic component placement facility has been implemented in the NOMAD System. Features include a new connectivity algorithm and an advanced algorithm for non-modular (no-site) placement.
MU6-G. a new design to achieve mainframe performance from a mini-sized computer
Authors: D. B.G. Edwards, A. E. Knowles, J. V. Woods
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

MU6-G is a high performance machine useful for general or scientific applications. Its order code and architecture are designed to be sympathetic to the needs of the operating system and to both the compilation and execution of programs written in high level languages and to support a word size suitable for high precision scientific computations. Advanced technology, coupled with simplicity of design, is used to achieve a high and more readily predictable performance. Innovative features include the unique organisation of the virtual memory mapping hardware and the use of a combined operand and instruction buffer-store, accessed using virtual addresses. Fault diagnosis is aided by the inclusion of a microprocessor based diagnostic controller which has read/write access to all bistable devices in the machine and has control of the system clock. The paper includes a description of the various functional units and gives estimates of expected performance.
Stability regions and spectra of discrete third-order autoregressive time-series
Authors: Richard Wiener, John S. Dorrenbacher
Venue: Proceedings of the 12th conference on Winter simulation (1980)

This paper presents an analysis of third order autoregressive time-series. The parameter regions, in the three dimensional parameter space, that produce the six separate types of power spectral density are analyzed. The study reveals that when a particular two dimensional cross section of the three dimensional parameter space is taken, the region of stability is always triangular. Within each triangular stability region in this two dimensional space, subregions which produce the six possible types of spectral shape are indicated. From these subregions it is possible to approximately choose the parameters necessary to model a process whose power spectral density contains at most two critical frequencies (maxima and minima).
Operating efficiencies and characteristics of the computing machines at aberdeen proving ground
Authors: Homer W. Spence
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

The Computing Laboratory of the Ballistic Research Laboratories at Aberdeen Proving Ground has greatly expanded its computing facilities during the past year. The ORDVAC now has taken its place with the EDVAC, ENIAC, and the Bell Relay Computers. The ORDVAC is a general purpose machine built by the University of Illinois for the Ballistic Research Laboratories. After reassembling at the Aberdeen Proving Ground during the latter part of February 1952, only five days of testing was required before satisfactory acceptance tests were completed. Since that time the ORDVAC has made a very commendable record. Additions have already been made to this machine in order to reduce the reading and printing time. A tape reader, approximately five times as fast as the original, and a punched card system for reading and printing have been installed
A reliable distributed control algorithm for updating replicated databases
Authors: George Gardarin, Wesley W. Chu
Venue: Proceedings of the sixth symposium on Data communications (1979)

This paper presents a robust, deadlock-free and distributed control algorithm for consistently updating replicated databases. This algorithm is based on local locking and time stamps on lock tables which permit detection of conflicts among transactions executed at replicated databases. Messages are exchanged in the network whenever a transaction commitment occurs, that is, at the end of every consistent step of local processing. Conflicts among remote transactions are resolved by a roll back procedure. Local restart is based on a journal of locks which provides backup facilities. Performance in terms of the number of messages and volume of control messages of the proposed algorithm is compared with that of the voting and centralized locking algorithms. The results reveal that the proposed distributed control algorithm performs, in most cases, comparably to the centralized locking algorithm and better than the voting algorithm.
The system dynamics approach to analysis of complex industrial and management systems
Authors: Thomas D. Clark,  Jr.
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

The tutorial is designed to expand a person's ability to understand and to model complex industrial and management systems. Modeling of physical systems such as aircraft flight or engineering design structures are not addressed. The system dynamics approach to examining, conceptualizing, and modeling complex systems is emphasized. Complex managerial and social systems are of special interest. The informational feedback characteristics of these systems are discussed and methods to focus on feedback structures are presented. Special attention is given to the dynamic interaction among structure, policy, and time delays in decision and actions that determine system behavior and performance.
Stochastic completion fields: a neural model of illusory contour shape and salience
Authors: L. R. Williams, D. W. Jacobs
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

We describe an algorithm and representation level theory of illusory contour shape and salience. Unlike previous theories, our model is derived from a single assumption-namely, that the prior probability distribution of boundary completion shape can be modeled by a random walk in a lattice whose points are positions and orientations in the image plane (i.e. the space which one can reasonably assume is represented by neurons of the mammalian visual cortex). Our model does not employ numerical relaxation or other explicit minimization, but instead relies on the fact that the probability that a particle following a random walk will pass through a given position and orientation on a path joining two boundary fragments can be computed directly as the product of two vector-field convolutions. We show that for the random walk we define, the maximum likelihood paths are curves of least energy, that is, on average, random walks follow paths commonly assumed to model the shape of illusory contours. A computer model is demonstrated on numerous illusory contour stimuli from the literature.
Some proposals for distributing central computing power at a University
Authors: Carl F. Eckberg
Venue: ACM SIGCSE Bulletin (1976)

The object of this paper is to present a number of ideas for distributing computer time and power at a University with overtaxed centralized computing. Topics discussed include how to determine who gets computer resources and how much; how to share a centralized facility among administrators, researchers, and students; how to secure a flexible system for the user; and how to devise a system which encourages good user habits. The computing history of San Diego State University (SDSU) is very briefly presented as background for the computer allocation proposals to be presented. The proposals themselves arose from an appointed sub-committee1 and are presented in a rather top-down manner much as they were introduced on the SDSU campus. It is hoped that a number of other institutions will find some of the ideas or specific strategies proposed to be worthy of careful consideration.
FORTRAN simulation of digital logic
Authors: Dale I. Rummer
Venue: Proceedings of the second conference on Applications of simulations (1968)

The software described in this paper was created to aid engineering students verify the correctness of the design of digital logic systems. The verification consists of comparing a truth table generated by the simulation with the truth table desired. The software is written in FORTRAN because computers with FORTRAN compilers are widely available both to students and practicing engineers. The digital logic is defined in terms of actual hardware, rather than in terms of the classical AND, OR, and NOT functions. This feature makes it easy to write the simulation program directly from a hardware logic diagram. Thus the design is verified at the hardware level, rather than at the classical logic level. The implementation described is in terms of logic hardware produced by the Digital Equipment Corporation, but the hardware produced by any manufacturer can be described in similar terms. The method of simulation is applicable to a wide variety of both combinational and sequential logic. The restriction is that the operation of the logic system can be described by a sequence of decisions which are independent of subsequent decisions. For example it is not convenient to simulate the interconnection of two NAND gates for operation as a FLIP-FLOP. Other cases of feedback around several logic stages may also cause problems. This software is not concerned with aiding in minimization of the logic structure. The nature of the formulation of the simulation lends itself to automatic checking for fan-in or fan-out limitations, but this also is not the concern of this paper. The operation of the logic is assumed to be independent of propagation delays which there fore are not simulated. This method of simulation has been used to verify student designs for a pipeline control system, a digital message switching system, and a printer control system for a digital computer.
Software reliability and validation (Panel Session)
Authors: Joseph A. Leubity, Charles Wortz, Bradford L. Glass
Venue: Proceedings of the first SIGMINI symposium on Small systems (1978)

Minicomputers are the newest tool adopted by businesses to improve their efficiency and profitability. The typical small business which seeks such a system, however, lacks the technical skills which have characterized computer installations in the past. They also lack the financial resources to establish such a function. As a result, these businesses have turned to systems houses, consultants and the hardware vendors for a &ldquo;turnkey&rdquo; approach. &ldquo;I just want to plug it in and run it&rdquo; is the typical businessman's comment. Unfortunately, that approach is frought with problems. The turnkey vendor does not have the same understanding of the small business as its management has. The vendor may have a &ldquo;package&rdquo; which he wants to fit his customer into, rather than fitting the programs to the business. There may be contract problems - and most lawyers for small businesses do not understand the special status of a computer turnkey system. There may be problems in training operators or converting data. And on and on. These problems can be avoided. Proper planning and knowing when to get help and from where will go a long way. The purpose of this presentation will be to discuss these problems and solutions in the context of the small business.