ppxscal/embedding_network huggingface dataset:
A hiererachical, error-tolerant compactor
Authors: Christopher Kingsley
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper describes a compactor that is practical for compacting whole chips that are designed hierarchically, and can produce a reasonable result in spite of the layout being over-constrained. The layout produced is good enough to be used in high volume chips. The compactor is currently used in a cell layout system and a chip assembly tool.
Individualized instruction in computer science
Authors: Robert R. Korfhage, Robert J. Smith
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

The concept of individualized instruction centered around a rather extensive research project has been present in education for centuries. As recently as fifty years ago many colleges and universities required some form of thesis for bachelors and masters degrees, as well as for the doctorate. However, with the pressure of increasing numbers of students the emphasis on individual study has abated to such an extent that in many schools only the PhD students have a real opportunity to engage in extensive individual work. Over the past two years we have been attempting a small reversal in this trend. During this period we have supervised nearly two dozen projects done by individual students or small student groups at both the undergraduate and the graduate level. After the first semester of this effort we established a set of guidelines which we have been following in subsequent project work. Our present guidelines form the Appendix to this paper.
A combinatorial programming approach to the joint optimization of land use and transportation
Authors: Marc Los
Venue: Proceedings of the 11th Design Automation Workshop (1974)

So far, mathematical models used in urban planning were descriptive or predictive. It is the purpose of this paper to describe a planning model, Joe. a model whose purpose is to produce a plan rather than to predict the consequences of a given plan. It produces a land use plan as well as a transportation plan and takes into account the interactions between land use and transportation. In part I, I take the transportation network for given and formalize the land use planning problem as a quadratic assignment problem as formulated by Koopmans and Beckmann (ref. 4). I describe the principles for a branch and bound algorithm yielding an exact optimal solution, first stated by Lawler (ref. 5). This algorithm has been progranmned and computational efficiency is examined here. In part II, I present the problem of optimizing jointly land use and transportation. The formalization chosen is an extension of the quadratic assignment problem. Principles for a branch and bound algorithm are statedï¾° This algorithm has been progranmned and its efficiency is examined. In part III, heuristic techniques for solving the joint problem are examined briefly.
Evolution of the philosophy and capability for the CAD of digital modules
Authors: J. A. Rader
Venue: Proceedings of the 10th Design Automation Workshop (1973)

The evolution of CAD (Computer-Aided Design) in response to the increased requirements of design engineers is discussed, and the effect of increased CAD capability on CAD philosophy is studied. It is noted that without the increases in hardware and software capabilities experienced in the last decade, these increases in capability would not have been possible.
Finding Water Depths from Synthetic Remotely Sensed Images
Authors: M. L. Martín, M. Y. Luna, F. Valero, M. Lybanon
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Mathematical morphology coupled with creation of a time stack image and Principal Oscillation Pattern analysis are used to determine the water depths over a known sloping bottom from synthetic remotely sensed images. The data, produced by a simulator, consisted of 60 images, each 256x256 pixels, separated by 1 second in time. The mathematical depth results are compared with those derived using principal oscillation pattern analysis by which three significant complex pairs of patterns are found with their corresponding characteristic times: e-folding times and periods. From these results and by using the classical hydrodynamic theory of gravity waves, water depths are determined. Both analyses yield small errors for the simulated data, indicating both methods should perform reliably for real data.
A proposed curriculum for software engineering education
Authors: Peter Freeman, Anthony I. Wasserman
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

We propose a curriculum for a graduate professional degree in software engineering. After presenting the instructional objectives to be met by this curriculum, we present its underlying philosophy and assumptions. A number of suggestions are made for implementing the curriculum. In particular, we emphasize that this is a specific curriculum (for a Master's degree) which can serve as a starting point for the development of other software engineering curricula.
Principles of optimality for multiprogramming
Authors: Jacques Leroudier, Dominique Potier
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

In this paper, we shall use the same analytical model to investigate the behaviour of the paging drum when the degree of multiprogramming is set to its optimal value. The main conclusion, which corroborates the general feeling on performance of virtual memory systems [3, 4, 5], is that drum utilization remains in the 50% range whenever CPU utilization is maximized, if no resource is saturated. The results are validated through simulation experiments in order to relax some theoretical assumptions used in the analytical model and to take into account some detailed mechanisms such as CPU overheads. As an application, an adaptive control algorithm based on the activity of the paging device is proposed. The algorithm has been simulated and comparisons with results reported in [2] are presented. Moreover, after investigations we show also that optimal performance can only be achieved through a balanced use of the different resources of the system. This conclusion cross-checks and extends Buzen's theoretical results [6] and Wulf's practical ones [7].
Affine-Invariant Correlation of Gray-Scale Characters Using GAT Iteration
Authors: Toru Wakahara, Yoshimasa Kimura
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper introduces a new technique of affine-invariant correlation of gray-scale characters by reinforcing correlation-based matching in two ways. First is the use of normalized cross-correlation as matching measure based on definite canonicalization to realize robustness against image degradation. Second is the application of iterative global affine transformation (GAT) to the input image so as to realize the maximal affine-invariant correlation with the target image. The advantages and effectiveness of the proposed method are both shown theoretically and demonstrated through preliminary experiments using gray-scale images of numerals subject to a wide range of affine transformation and random Gaussian noise.
Graphs for Queueing Models
Authors: B. Helbrough, G. T. Herman
Venue: Proceedings of the second conference on Applications of simulations (1968)

We discuss a program whose task is to produce graphical answers to problems arising in queueing theory. We consider why such a program is necessary and describe the situation to which it is applicable. Some of the statistical and programming considerations for the design of the program are mentioned. An example of its application is given.
Why is Top Management Difficult to Convince?
Authors: John E. Snyder
Venue: Proceedings of the second conference on Applications of simulations (1968)

My topic is &ldquo;Why is Top Management Difficult to Convince?&rdquo; Before proceeding very far in an attempt to answer this question it seems appropriate that we first examine the assumption that top management really is difficult to convince. I will address myself to this question from two points of view. First, I will discuss the opinions of some people that may be considered authorities on the subject and, second, I will discuss some of my personal experience.
Formulas for the variance of the sample mean in finite state Markov processes
Authors: Gordon B. Hazen, A. Alan B. Pritsker
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

Formulas are derived for the variance of sample means associated with finite state Markov processes. Results are presented to illustrate the use of the formulas for example processes. The formulas can be used to evaluate proposed statistical methods for estimating the variance of a sample mean obtained from simulation experiments.
A real-time, multi-task programming language for microprocessor-based industrial process control
Authors: Alfred C. Weaver
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

This paper presents an overview of the design of a real-time programming language whose purpose is to permit an inexperienced programmer to quickly and efficiently implement control of multiple, parallel industrial processes. The programming language is compiled on one microprocessor-based system and then executed on another. The language divides the program logic into two types: (1) combinational logic which requires both fast and frequent execution, and (2) sequential logic which is more powerful but proceeds more slowly. A discussion of the language design, development, syntax, and semantics is presented.
An extension to algebraic specifications to incorporate state behavior
Authors: Fred Calm, John R. White
Venue: Proceedings of the 1979 annual conference (1979)

Algebraic relations (axioms) have been used to describe the functional behavior of the objects represented by a data abstraction. In this paper an extension to algebraic specifications is described that allows one to associate a state with each object of a data abstraction and to specify how the operations of an abstraction effect an object's current state. Such an extension is necessary if dynamic performance issues are to be investigated during the design process. The extension allows one to define the potential states of an abstract object in terms of a countable set and to then define a transition mapping for each operation. This extension along with a technique for recording the specification of a data abstraction in a relational form are described in detail.
The semantics of lazy (and industrious) evaluation
Authors: Robert Cartwright, James Donahue
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

Since the publication of two influential papers on lazy evaluation in 1976 [Henderson and Morris, Friedman and Wise], the idea has gained widespread acceptance among language theoreticians&mdash;particularly among the advocates of &ldquo;functional programming&rdquo; [Henderson80, Backus78]. There are two basic reasons for the popularity of lazy evaluation. First, by making some of the data constructors in a functional language non-strict, it supports programs that manipulate &ldquo;infinite objects&rdquo; such as recursively enumerable sequences, which may make some applications easier to program. Second, by delaying evaluation of arguments until they are actually needed, it may speed up computations involving ordinary finite objects. First, there are several semantically distinct definitions of lazy evaluation that plausibly capture the intuitive notion. Second, non-trivial lazy spaces are similar in structure (under the approximation ordering) to universal domains (as defined by Scott [Scott81, Scott76]) such as the P@@@@ model for the untyped lambda calculus. Third, we prove that neither initial algebra specifications [ADJ76,77] nor final algebra specifications [Guttag78, Kamin80] have the power to define lazy spaces. Fourth, although lazy spaces have the same &ldquo;higher-order&rdquo; structure as P@@@@, they nevertheless have an elegant, natural characterization within first order logic. In this paper, we develop a simple, yet comprehensive first order theory of lazy spaces relying on three axiom schemes asserting (1) the principle of structural induction for finite objects; (2) the existence of least upper bounds for directed sets; and (3) the continuity of functions.
Interface, a dispersed architecture
Authors: Chris A. Vissers
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

Past and current specification techniques use timing diagrams and written text to describe the phenomenology of an interface. This paper treats an interface as the architecture of a number of processes, which are dispersed over the related system parts and the message path. This approach yields a precise definition of an interface. With this definition as starting point, the inherent structure of an interface is developed. A horizontal and vertical partitioning strategy, based on one functional entity per partition and described by a state description, is used to specify the structure. This method allows unambiguous specification, interpretation, and implementation, and allows a much easier judgement of the quality of an interface. The method has been applied to a number of widely used interfaces.
A new program structure to improve accuracy and readability of pascal software
Authors: W. J. Rogers
Venue: Proceedings of the 7th international conference on Software engineering (1984)

Based on an analysis of errors in a piece of Pascal software a new language feature is introduced to increase the degree of compile time checking of program logic and thus improve the confidence of the programmer in the correctness of a program. Specifically this involves a form of abstract data type, augmented by restrictions on the use of operations provided with the type, and a means of allowing the programmer to bring logically related segments of program together textually.
Panel on computer education for the management, behavioral, and biological sciences (Session M1)
Venue: Proceedings of the 1964 19th ACM national conference (1964)

During the past several years the use of computers and the study of information processing has spread rapidly in each of the areas - Management Sciences, the Behavioral Sciences, and the Biological Sciences. Although these are very diverse fields, the computer specialist may view them as a relatively homogeneous area in which the dominant computational issues are those in which statistical and file processing techniques are of prime importance, and in which complex system models are more relevant than simple mathematical structures. In broader perspective, the use of mathematical models, statistical analysis, and digital computation is growing rapidly in these fields. A new educational synthesis of mathematics, statistics, and information processing may emerge as the proper preparation for professional work and research. The members of the panel will describe trends in digital computation and educational problems in their respective fields. They will indicate possible educational approaches and the prospective roll of computer science as it emerges as a distinct educational area, alongside mathematics and statistics.
Discrete event simulation in pascal with SIMTOOLS
Authors: Andrew F. Seila
Venue: Proceedings of the 16th conference on Winter simulation (1984)

In recent years a great deal of research effort has been devoted to improving simulation software. Products currently available for discrete event simulation include GPSS/H, SIMSCRIPT II.5, SIMULA, SLAM, SIMAN, SIMPAS, PASSIM, and ASSE, to name a few. Some of these products (SIMSCRIPT II.5 and SIMPAS, for example) use process-oriented approaches. All of them assume an entity-attribute-set basis for describing the model to be simulated. SIMSCRIPT II.5 and SIMULA are general-purpose simulation programming languages. Alternatively, GPSS/H, SIMAN, SLAM, Micro NET, INTERACTIVE and ASSE are &ldquo;packages&rdquo; (I won't debate whether the terminology &ldquo;language&rdquo; is appropriate or not) that were developed primarily for simulating queueing networks, such as might be found in manufacturing or computer systems. SIMPAS is a preprocessor for a Pascal program that converts &ldquo;simulation&rdquo; statements into Pascal code for compilation and execution.
Institute of computer science: ALGEM -an algebraic manipulator
Authors: C. C. Gotlieb, R. J. Novak
Venue: Proceedings of the first ACM symposium on Symbolic and algebraic manipulation (1966)

ALGEM is a package of subprograms written in SLIP, FORTRAN IV and MAP for the IBM 7094 II to manipulate algebraic expressions. Given an expression with multiple components connected by the arithmetic operations.+, -, *, /, ** (exponentiation), it is possible to 'simplify' the expression by combining the components to produce a standard form. This paper describes the expression types which can be used, their data structures, and the operations which can be performed on them. Some examples on the use of ALGEM are given.
Staffing The Third Wave
Authors: Ted G. Lewis
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

An analysis of the impact of computing on Business, Education and the Home is given using The Third Wave as a framework. The analysis is carried out using &ldquo;confluence of trends&rdquo;, and the notions of diversity and a network of interwoven connections. This includes the move towards office automation in business, experiential versus abstract learning in education, and a network of imbedded systems in the home of the future.
Position paper on the implementation and use of database management systems
Authors: Seymour Sternberg
Venue: Proceedings of the 1977 annual conference (1977)

Quite often, papers dealing with database management system installation initially concentrate on the technique for selecting a DBMS, and bypass the critical issue of whether a database management system is really required. In the discussion which follows, we will attempt to establish those criteria which should be considered prior to any DBMS selection process. It is imperative to confirm the need for DBMS before embarking on the costly and time consuming process of package installations.
Some Computer Aided Engineering System design principles
Authors: Henry L. Nattrass, Glen K. Okita
Venue: Proceedings of the 20th Design Automation Conference (1983)

Engineering design is a human activity which is becoming increasingly reliant on computer systems programmed to support design processes. The builders of such Computer Aided Engineering (CAE) Systems have many problems to solve and this paper looks at some of the principles involved. A model capable of describing the work of the designer is proposed and placed in the context of computer systems. This model is then used to classify basic design activities and leads to a set of computer aided engineering system design principles. An application of these principles is illustrated by a description of some of the methods used by the authors in designing computer aided electronic engineering products.
A characterization of the power of vector machines
Authors: Vaughan R. Pratt, Michael O. Rabin, Larry J. Stockmeyer
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

Random access machines (RAMs) are usually defined to have registers that hold integers. While this captures in part the structure of a commercial computer, it overlooks an implementation-dependent feature of most binary oriented machines, namely their ability to operate bit by bit on the bit vectors used to represent integers. Typical operations are bit-wise Boolean operations (and, or, not, etc.) and shifts by an amount specified in some register. These operations are ideal for certain problems, such as dealing with sets represented as bit vectors, some parsing algorithms [4], propositional calculus theorem proving, and analysis of sorting networks. A RAM so implemented we shall call a vector machine.
Techniques for improving language-based editors
Authors: J. R. Horgan, D. J. Moore
Venue: Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments (1984)

Syned is a working language-based editor which includes a complete parser for editing the C language. The design ideas which permit parsing in Syned also result in the solution of several important language-based editor problems. We describe these ideas in sufficient detail to make them accessible to others.
Computers and privacy: A proposal for self-regulation
Authors: Edward J. Grenier,  Jr.
Venue: Proceedings of the first ACM symposium on Problems in the optimization of data communications systems (1969)

The purpose of this paper is to analyze some of the legal problems faced by the computer industry in the area of assuring privacy and security of data both during transmission and storage and to propose a solution. The focus of the paper is upon recent trends in the law of privacy generally and a theoretical projection of possible future developments in view of the computer revolution and the ever increasing automation of data handling, processing, storage and retrieval. In view of these trends and likely future developments, and in order to assure continued operation of the computer industry in the public interest, the author proposes that the computer industry embark on a program of self-regulation modeled on the highly successful National Association of Securities Dealers. Such a program must be fashioned under the auspices of the federal government and pursuant to express federal statutory authority.
Job shop type production scheduling by simulation
Authors: Ronald G. Pettit
Venue: Proceedings of the second conference on Applications of simulations (1968)

The primary purpose of this paper is to introduce the audience to a concept that is not always appreciated by those skilled in the art of simulation. In contrast to the traditional use of simulation as a study tool, the following discussion will emphasize the potential role of simulation for operational production scheduling in job shop-like environments rather than the research-oriented role now primarily assigned to it. Simulation techniques have been employed to study nearly all phases of the manufacturing process including forecasting, long-range planning, order release, and the flow of jobs on the production floor. This paper discusses production floor scheduling of discrete production facilities with job shop characteristics. A job shop is defined as having the following characteristics: 1)there is a set of production or service facilities; 2) jobs consisting of several tasks move between facilities for service; 3) one or more tasks are performed at each facility; 4) the service time for tasks may vary from job to job; and 5) the routing between facilities may vary from job to job.
A new instructional environment for beginning computer science students
Authors: Nell Dale, David Orshalick
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

At the Computer Science Conference in St. Louis in February, 1981, there were 34 job offers for each PhD and 12 for each Bachelors candidate. These figures come as no surprise to those of us who teach undergraduate computer science courses. Where we once taught beginning classes of 30, we are performing before lecture sections of 250. This short paper reports on an innovative introductory computer science course which attempts to make more productive use of faculty and teaching assistant time.