ppxscal/embedding_network huggingface dataset:
Automated sign design and stencil cutting system
Authors: W. M. Barnes
Venue: Proceedings of the 11th Design Automation Workshop (1974)

The automation of artistic art form provided a real challange in terms of new software and hardware design for a computer system. The complete system has been in operation daily since July 1972 and provides the necessary features to design and produce stencil art work for sign making.
A computerized analysis of home energy reduction alternatives used in a statewide extension program
Authors: Robert L. Fehr, George M. Turner, George A. Duncan
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

A computer program has been developed which can provide homeowners with an evaluation of the economics of adding insulation to the ceiling, walls and floors of their homes along with the addition of storm windows and doors. This evaluation is done from data collected on a simplified input form. The basic calculation procedure used in the program is discussed in detail including the assumptions made. The program input form and typical output are also presented.
Recruiting computer personnel at MOPAC - a case history -
Authors: L R. Cottrell
Venue: Proceedings of the ACM 1980 annual conference (1980)

Proper recruiting for the computer programmer and systems analyst is mandatory or the continued success and even the existence of today's data processing shop. None of us can escape some attrition and if we are growing, we must find, attract, and hire the right mix of people to accomplish our objectives. This case history will cover the successful recruiting program that we have developed and are currently using. We will share some techniques of our structured recruiting program that work.
Algorithms for partial fraction decomposition and rational function integration
Authors: Ellis Horowitz
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

Algorithms for symbolic partial fraction decomposition and indefinite integration of rational functions are described. Two types of partial fraction decomposition are investigated, square-free and complete square-free. A method is derived, based on the solution of a linear system, which produces the square-free decomposition of any rational function, say A/B. The computing time is shown to be O(n4(1n nf)2) where deg(A) <deg(B) &equil;n and f is a number which is closely related to the size of the coefficients which occur in A and B. The complete square-free partial fraction decomposition can then be directly obtained and it is shown that the computing time for this process is also bounded by O(n4(1n nf)2). A thorough analysis is then made of the classical method for rational function integration, due to Hermite. It is shown that the most efficient implementation of this method has a computing time of O(k3n5(1n nc) 2), where c is a number closely related to f and k is the number of square-free factors of B. A new method is then presented which avoids entirely the use of partial fraction decomposition and instead relies on the solution of an easily obtainable linear system. Theoretical analysis shows that the computing time for this method is O(n5 (in nf) 2) and extensive testing substantiates its superiority over Hermite's method.
A database supported discrete parts manufacturing simulation
Authors: William P. Rundren, Charles R. Standridge
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

This paper discusses a prototype decision support system for discrete parts manufacturing. Basic decision support system concepts are presented. The context of this analysis effort within the entire technical operations of the firm is shown. The use of typical, real production data stored in a database for both traditional reporting purposes and as data input to a simulation model is discussed. Thus, the model can process both currently known future orders and generate currently unknown future orders in analyzing future production requirements. Furthermore, model outputs which measure the ability of the production system to meet future requirements are stored in the database. Thus, they may be analyzed and reported independently of the running of the model.
The structure of the &ldquo;the&rdquo;-multiprogramming system
Authors: Edsger W. Dijkstra
Venue: Proceedings of the first ACM symposium on Operating System Principles (1967)

A multiprogramming system is described in which all activities are divided over a number of sequential processes. These sequential processes are placed at various hierarchical levels, in each of which one or more independent abstractions have been implemented. The hierarchical structure proved to be vital for the verification of the logical soundness of the design and the correctness of its implementation.
On morphological openings and closings of signals in shaped noise
Authors: N. D. Sidiropoulos, J. S. Baras, C. A. Berenstein
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

We have shown previously that morphological openings and closings can be viewed as consistent MAP estimators of morphologically smooth binary image signals immersed in i.i.d. union (clutter) noise, or suffering from i.i.d. random dropouts. We revisit this viewpoint under a different set of assumptions, which allows the explicit incorporation of geometric and morphological constraints into the noise model, i.e., the noise may now exhibit a geometric structure; surprisingly, it turns out that this affects neither the optimality nor the consistency of these filters.
A microcomputer based system for automated pattern digitization and editing
Authors: T. J. Pavliscak, G. W. Stowell, M. J. Bailey
Venue: ACM SIGGRAPH Computer Graphics (1978)

Since the first microcomputer was produced in 1969 by Intel Corporation to support the functions of an intelligent terminal, the complexion of digital computers has changed radically. Microcomputers have been successfully applied to a wide variety of dedicated tasks requiring relatively slow calculation speeds and limited numeric accuracy. However, little has been done to bring the LSI microprocessor into stand alone interactive graphics systems. This has been so probably because of the large data files and rapid computation speeds demanded by most interactive graphics applications. This paper outlines a hardware and software configuration for a microcomputer based graphics system developed in response to a need in the sewing industry for a low cost pattern digitizer. A basic graphics package was written which renders both text and vectors on the storage terminal. Around this core, an application program was organized which permits an operator to log piercing point coordinate data from a scaled drawing. Output is then committed to paper tape for permanent storage and PROM for control of the sewing machine. Additional features allow for graphical editing of patterns, display of stored pattern &ldquo;programs&rdquo; from PROM or paper tape, and merging of new and/or old patterns. Some proof of the success of this project was documented during final checkout, where the time to reduce a drawing to formatted binary on a control PROM was improved from about one man day to a matter of minutes.
A survey of methods for sampling from the gamma distribution
Authors: Pandu R. Tadikamalla, Mark E. Johnson
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

Considerable attention has recently been directed at developing ever faster algorithms for generating gamma random variates on digital computers. This paper surveys the current state of the art including the leading algorithms of Ahrens and Dieter, Atkinson, Cheng, Fishman, Marsaglia, Tadikamalla and Wallace. General random variate generation techniques are explained with reference to these gamma algorithms. Computer simulation experiments on IBM and CDC computers are reported.
Parameterized random testing
Authors: Karl J. Lieberherr
Venue: Proceedings of the 21st Design Automation Conference (1984)

Random testing uses random inputs to test digital circuits. A major problem in random testing is the cost to compute the test length which is required for achieving an acceptable fault coverage. Different input distributions on the random inputs produce different fault detection probabilities. Therefore parameterized input distributions are analyzed and analytical methods are given for computing the fault coverage as a function of the parameters. The parameters are chosen so that the fault detection probability is maximized and the test pattern length is minimized. This analytical method of analyzing random test patterns tends to be faster than fault simulation.
Cellular wiring and the cellular modeling technique
Authors: R. B. Hitchcock
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

In cellular modeling a given structure is broken up into a collection of substructures called &ldquo;cells.&rdquo; Gross topology is then determined from the inter-cellular relation ships while only the essential intra cellular details are retained as parameters. Applying this method in printed circuit wiring programs results in dramatic savings in storage requirements and running times over conventional programs which consider each coordinate in their model. Storage requirements are reduced since only the inter-cellular wire routes are stored, Running time is shorter because one can determine when a wire is unroutable without computing the fine details of the routing. However, once the wiring is determined on the gross level, a significant problem remains&mdash;the overall routings must be transformed into specific coordinates with in each cell. The purpose of this paper is not to describe these programs, since they follow easily from the modeling technique, but rather to describe the ideas and concepts behind them.
Automated techniques for product-grading systems design
Authors: Belur V. Dasarathy
Venue: Proceedings of the 15th Design Automation Conference (1978)

The study presents innovative pattern recognition techniques for design automation of systems capable of on-line supervision of product-grading activities in production environments.
Data preparation and entry for computer-aided mapping
Authors: Bernard Schechter
Venue: Proceedings of the 15th Design Automation Conference (1978)

The rapid growth in use of interactive graphic systems for geo-coded data bases has expanded interest about the computer-aided mapping processes by many groups involved in automation. Surveying and mapping were early users of computer technology and the current systems and practices are evolving through changes to modern classical analog mapping. The various phases of the process, from aerial photography acquisition through computer-driven hard copy output plots are reviewed as a basis for understanding and appreciating the problems associated with data preparation and entry.
Node-and edge-deletion NP-complete problems
Authors: Mihalis Yannakakis
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

If &pgr; is a graph property, the general node(edge) deletion problem can be stated as follows: Find the minimum number of nodes(edges), whose deletion results in a subgraph satisfying property &pgr;. In this paper we show that if &pgr; belongs to a rather broad class of properties (the class of properties that are hereditary on induced subgraphs) then the node-deletion problem is NP-complete, and the same is true for several restrictions of it. For the same class of properties, requiring the remaining graph to be connected does not change the NP-complete status of the problem; moreover for a certain subclass, finding any "reasonable" approximation is also NP-complete. Edge-deletion problems seem to be less amenable to such generalizations. We show however that for several common properties (e.g. planar, outer-planar, line-graph, transitive digraph) the edge-deletion problem is NP-complete.
Computers in the study of Lie algebras
Authors: Bernard Kolman, Robert E. Beck
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

Computers have been successfully used in group theory for a good many years to calculate the structure of a group. They have also been used to either prove or disprove a number of conjectures since they allow examination of large examples. Moreover, computers have been instrumental in the discovery of a number of new groups. Few areas in algebra have been applied as extensively to other areas of mathematics and the physical sciences as Lie algebras. Applications almost invariably call for extensive computational work. There are strong parallels between the structure of groups and the structure theory of Lie algebras. In view of the successful application of computers to handle computational problems in group theory, it was reasonable to consider an analogous approach in Lie algebras.
PVS - design for a practical verification system
Authors: Charles H. Applebaum, James G. Williams
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

In this paper we present a new and practical approach to program verification based on the transformational program development method. We believe this system, which we call the Practical Verification System, is both user-friendly and mathematically powerful. A user of this system would present the system with an initial abstract specification, written in the user-interface language, and the system, under the guidance of the user, would generate a program guaranteed to satisfy the goals set forth in the initial specification. The advantages of the transformational method are its potential ability to act as a rich source of high-level, reusable theorems, to allow efficient verification of resulting programs, and to track the user's understanding of a program. Simplicity of design is also achieved through the use of a single, powerful internal language, and through reliance on a large information database.
Current issues in government interest and involvement in CAD
Authors: Paul Losleben
Venue: Proceedings of the 18th Design Automation Conference (1981)

The history of Government interest and involvement in CAD can be traced to the very origins of this field. The author is aware of Government sponsored work in the electronics area in the late 1950's and was personally involved in CAD development both in-house and on contract since the early 1960's. This paper addresses only electronics CAD, but there has been considerable Government investment in non-electronics CAD as well. There are currently numerous CAD programs in widespread use which had their origins in Government sponsored work. Virtually all the circuit analysis programs, many of the logic simulators, and many of the PC and IC layout programs are obvious examples of work resulting from early Government sponsorship.
The use of grayscale for improved raster display of vectors and characters
Authors: Franklin C. Crow
Venue: Proceedings of the 5th annual conference on Computer graphics and interactive techniques (1978)

Decreasing memory costs will soon allow grayscale displays in low-cost raster graphic terminals. Subtle shadings can be used to provide improvements in line quality and character flexibility which could allow raster displays to compete on better terms with the more expensive calligraphic displays. Algorithms for achieving smooth vectors and rotatable dot matrix characters are outlined and scan conversion is discussed. A discussion of the relation between image quality and number and distribution of gray levels follows, with concluding remarks on costs and other practical matters.
Extensible data features in the operating system language OSL/2
Authors: Peter A. Alsberg
Venue: Proceedings of the third ACM symposium on Operating systems principles (1971)

The extensible data facilities of OSL/2, an operating system language, are described. These facilities allow one to create new data types, such as queues, files, and tables, and describe complex access algorithms for these new types. When used in operating system codes, data type extension facilities help the programmer isolate macro and micro levels of complex data manipulation and provide logical places to insert and remove system measurement code. The implementation of these facilities is compatible with existing block structured languages like ALGOL 60 and PL/1 and can be accomplished in a straightforward manner.
The AED approach to generalized computer-aided design
Authors: Douglas T. Ross
Venue: Proceedings of the 1967 22nd national conference (1967)

This paper has been written in response to a request for an up-to-date broad view of the approach to computer-aided design taken by the M.I.T. Computer-Aided Design Project. Included in the suggestion was the hope that such a description would help to illuminate, expecially for people who are not system programmers, the major features which any computer-aided design system must have in order to be a useful practical tool. This has proved to be a difficult assignment, because there are several audiences involved. Engineers, designers, managers, programmers, and system programmers all have different interests in the problems of computer-aided design. With several notable exceptions, however, all of these types of people seem to lack a clear understanding of what &ldquo;design&rdquo; means, and just what is required to really involve the computer in the design process.
A user-oriented macro processor
Authors: D. L. Marrs, C. W. Collins, H. A. Hess
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

Machine-language assemblers map statements in a source language to the machine language of a particular computer. The source language accepted by the assembler is, for the most part, defined in a one-to-one manner with the hardware instructions available on the target computer. The addition of a macro processor to the assembler, referred to then as a macro assembler, effectively extends the range of the source languages accepted by the assembler. This is achieved by providing the user with a means of describing how his particular source-language statements are to be translated into assembler language statements. The description of a translation is called a 'macro definition' and may be input to, and used by, the macro processor during an assembly. The actual range of describable translations is dependent upon the features provided in the macro processor and the macro definition language.
A model hierarchy for virtual memory system investigation
Authors: Emily C. Placy, Jon C. Strauss
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

A hierarchy of simple models is presented for an idealized version of an IBM VS/370 computer system. The idealized system consists of a main memory, an auxiliary memory, and a processor. Demand paging is employed with an LRU replacement algorithm. A hierarchy of simulation and analytic models is developed which represents the system at several levels of detail. These models are compared and their suitability for representing the system for various purposes is discussed. Several interesting observations concerning the performance of the LRU page replacement algorithm are presented.
Design transaction management
Authors: Randy H. Katz, Shlomo Weiss
Venue: Proceedings of the 21st Design Automation Conference (1984)

A design transaction is a sequence of operations mapping a consistent version of an object into a new version. We describe a mechanism, based on version checkout and change files, that supports controlled sharing and is resilient to crashes in a network of workstations and database servers.
Computer-based educational communications at the University of Michigan
Authors: Karl L. Zinn, Robert Parnes, Helen Hench
Venue: Proceedings of the 1976 annual conference (1976)

A series of studies at the University of Michigan has explored information systems as a basis for learning environments (Zinn, 1974). Currently staff at the Center for Research on Learning and Teaching (CRLT) is looking at educational uses of computer-based conferencing, for example, computer-based seminars and computer-assisted curriculum development. Departments trying other uses, for example, computer-based committee work and computer-aided proposal preparation, find the basic software developed at CRLT to be applicable. However, some of the procedures described here are modified for the various purposes. A paper now in preparation by the same authors reports the history of computer-based conferencing at the University of Michigan. In brief, the activity did not become practical until the spring of 1975 when the CONFER I program (in Fortran) was completed by Robert Parnes. The conferencing software did not receive much use outside the circle of people interested in the software development until CONFER II became operational in the fall. A year of experience provides clear indication of the scope of conferencing applications and the resources needed for effective use. The first section of this note gives a rationale for the use of computer assistance in seminars, curriculum development and other educational activity. It concludes with a checklist intended for the potential organizer of a conference. The second section provides data on phase one of a study of conferencing applied in seminars and individual study. The third section discusses costs, time commitments and benefits. A fourth section describes implications of computer-based educational communications for the University of Michigan.
Using graphs to analyze APL functions
Authors: Robert Metzger
Venue: ACM SIGAPL APL Quote Quad (1983)

The purpose of this paper is to show how graphs can be used to analyze APL functions. Several kinds of graphs are introduced. In each case, APL functions which generate matrix representations of these graphs derived from APL programs are presented. Then, APL functions which compute measures of the quality of a program based upon these graphs are suggested.
Loop constructs - a design for Fortran
Authors: J. L. Wagener
Venue: Proceedings of the 1979 annual conference (1979)

The Fortran community has, over the past several years, devoted considerable effort to development of modern, effective repetition control structuring for Fortran. Some highlights of these efforts are reviewed here. Recently the American Fortran standards committee has tentatively adopted the basic elements of an extensible looping facility. This facility includes loop-bracketing key words, flexible loop control provisions, and a single-level loop exit statement. Criteria are proposed by which repetition structures may be evaluated. And an extension to the basic Fortran loop facility is described which is consistent with these criteria.
Polygon shadow generation
Authors: Peter Atherton, Kevin Weiler, Donald Greenberg
Venue: ACM SIGGRAPH Computer Graphics (1978)

A general purpose method for generating shadows using a polygonal coordinate data base is presented. The method is based on an object space polygon clipping hidden surface removal algorithm. Output from the program is in the same three-dimensional polygon format as the input. Thus, a shadowed data environment may be easily created and viewed from any observer position with no additional depth sorting time required for the hidden surface removal process. Shadows can also be cast by more than one light source. Since the shadows are generated in object space, the results can be used for both visual display and numerical analysis.