ppxscal/embedding_network huggingface dataset:
PAOLA: A tool for topological optimization of large PLAS
Authors: Samuel Chuquillanqui, Tomas Perez Segovia
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper presents a tool, called PAOLA, for optimizing the layout of large PLAs used as decoders in VLSI systems. The optimization techniques it uses are heuristic. They involve compacting the AND/OR matrices by cutting and reorganizing the input/output lines in order to reduce the number of columns in these matrices. They also allow the lengthening of the shape of the PLA and the lateral access to the input/output segments. This eases the topological adaptation of different blocks in order to reduce the surface of the interconnection network between them. The layout of the PLA uses internal topological conflicts and ground refresh lines positions to improve accessibility to the input/output segments created inside the AND/OR matrices. This system has been tested on several examples including industrial PLAs. It gives an area reduction of the OR matrix of up to 50% on PLAs having 3000 to 5000 positions in the OR matrix with a computing time of 4 to 5 minutes on a main frame HB-68 computer running with the MULTICS operating system.
Purchase costs - a cost-quantity analysis
Authors: Harris Freeman
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Two objectives underlie this study: The first is a discussion of the subcontracting function of purchasing and the computation of the cost par unit per order on existing &ldquo;closed out&rdquo; orders. The second objective is a statistical analysis of the values computed from the cost/unit/order. The results of this study will provide management with the following tools for a plan of action: 1. A combined percentage rate of cost reduction for all of the subcontractors. 2. A percentage rate of cost reduction of each subcontractor. 3. A control on the purchasing department. 4. A control on subcontractors. 5. A method of analysis of other costs.
Tools For Automatic Compiler Generation (Panel Discussion)
Authors: R. G. Cattell, J. M. Newcomer, Wm. A. Wulf
Venue: Proceedings of the 1978 annual conference (1978)

The PQCC (Production-Quality Compiler-Compiler) project is an effort aimed at the automatic construction of production quality, optimizing compilers. The goal is, with no more than a few man-months effort, to produce a compiler that is competitive in every respect with the best hand-crafted compilers available today. Input to this automatic construction process is formal descriptions of the source language and target machine.
Exploring team avionics systems by simulation
Authors: Glen A. Brent, Thomas M. McCalla,  Jr.
Venue: Proceedings of the 11th annual symposium on Simulation (1978)

Simulation is being used to explore configurations of software and hardware in a no-critical-element team architecture. Future General Aviation aircraft avionics is expected to be significantly changed from present day configurations, through the introduction of low cost, highly integrated, powerful microprocessors. It is small, rugged, and lightweight. NASA sponsored simulation is providing proof that the team architecture will work. GASP-PL/I models are used to gain insight into the performance of different team configurations. These simulations allow changes in the system to be easily implemented and evaluated before commitments are made to a final hardware prototyped system.
Teaching a topic in psychology with APL: A cognitive information processing model
Authors: Howard A. Peelle
Venue: Proceedings of the international conference on APL (1982)

This paper describes a curriculum unit in which APL is used to introduce a simple information processing model known as &ldquo;Pandemonium&rdquo; [1]. It begins by describing the structure of the model; then the corresponding APL representation is given; the curriculum unit is outlined; and, in conclusion, implications for further developments are mentioned.
A view of artificial intelligence
Authors: Fred M. Tonge
Venue: Proceedings of the 1966 21st national conference (1966)

By &ldquo;intelligence&rdquo; we mean a property of a system, a judgment based on observation of the system's behavior and agreed to by &ldquo;most reasonable men&rdquo; as intelligence. &ldquo;Artificial intelligence&rdquo; is then that property as observed in non-living systems. Work directed toward producing such behavior is thereby work in artificial intelligence. While the above is indeed a loose definition, more useful in suggestiveness than in precision, it should suffice for our purposes. It does contain at least one strong assumption&mdash;that, a priori, intelligence is not restricted to &ldquo;living&rdquo; systems. And it does suggest that, if the issue of whether artificial intelligence does or will ever (or can ever) exist is really worthy of further argument or concern, then some agreement should be reached concerning the rules for observation and agreement among most reasonable men. Here, however, we shall treat the term as merely a convenient label. This paper is intended as an overview of artificial intelligence, in the summer of 1966, by one peripheral to the field. It summarizes the author's reaction to a review of a part of the printed record. As such, it cannot be exhaustive. (In the Permuted and Subject Index to Computing Reviews 1964-19654 alone, there are over 275 entries under artificial intelligence.*) Nor is it necessary to provide another extensive bibliography of the field. Published material by Minsky, 15 Feigenbaum, 7 Newell,17,18 and others, together with Computing Reviews3,4 serve this purpose quite well, This paper is rather a set of personal comments, and, as such, an invitation to discussion, rebuttal, and controversy.
Steady-state confidence interval methodology: A forum on theory, practice, and prospects
Venue: Proceedings of the 16th conference on Winter simulation (1984)

For the past two decades, much of the attention in the statistical methodology of computer simulation has been motivated by and directed toward what is essentially a single goal: To construct a valid confidence interval for a steady-state parameter of a stochastic process by means of simulation. During this time, a number of approaches have been developed in an attempt to meet this goal, and the purpose of this two-session forum is to gather several of these ideas together for exposition and discussion. Each participant in this forum is actively involved in research in this area, and has agreed to present or co-present one of six methods: Replication, batch means, time series, spectral methods, regenerative methods, and standardized time series. The order chosen represents an attempt to follow the chairperson's impression of the chronology of development.
Address/memory management for a gigantic LISP environment or, GC considered harmful
Authors: Jon L. White
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

The possibility of incredibly cheap, fantastically large media for storage gives rise to a realistic LISP memory management scheme under which GC may be postponed for days, or even indefinitely; the idea is encapsulated in the acronym &ldquo;DDI&rdquo;&mdash;&ldquo;GC? Don't Do It!&rdquo;. Tertiary memory is used to archive pages of the LISP environment which are perhaps reclaimable, but which have not been proven so; whereas the standard technique of &ldquo;paging&rdquo; is used to swap active data from the main memory to a secondary store such as magnetic disk. Some scenarios are presented considering a variety of currently-available technologies, and of one speculative possibility&mdash;videodisc&mdash;by which a requisite compactifying GC would be done &ldquo;overnight&rdquo;, or over the weekend. With enough tertiary available, one design could last for over 12 years without a GC. &ldquo;Write-once&rdquo; memories, probably unusable for most applications, would not be at a disadvantage here.
Building Auto-Adaptive Distributed Applications: The QuO-APOD Experience
Authors: Michael Atighetchi, Partha P. Pal, Christopher C. Jones, Paul Rubel, Richard E. Schantz, Joseph P. Loyall, John A. Zinky
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Exploiting autonomic adaptation in defending a distributed application is a relatively new research area. We describe how the QuO adaptive middleware was used to implement auto-adaptive defenses ranging from simple rapid-response sensor-actuator tactics to more sophisticated containment and out-run strategies. In addition, we report on two experiments where live red team attacks were used to evaluate our auto-adaptive defense technology.
Combining graphics and a layout language in a single interactive system
Authors: Stephen Trimberger
Venue: Proceedings of the 18th Design Automation Conference (1981)

Layout languages provide users with the capability to algorithmically define cells. But the specification language is so non-intuitive that it is impossible to debug a design in that language, one must plot it. Interactive graphics systems, on the other hand, allow the user to debug in the form in which he sees the design; but severely restrict the language he may use to express the graphics. For example, he cannot express loops or conditionals. What is really needed is a single interactive system that combines layout language and graphic modifications to the data. This paper describes just such a system.
Initial design concepts for an advanced design automation system
Authors: Melvin A. Breuer, A. D. Friedman
Venue: Proceedings of the 11th Design Automation Workshop (1974)

Most design automation systems attempt to automate only a small part of the physical description. Much is left to the designers. An exploratory design automation system is being developed at the University of Southern California. The system is intended to be highly interactive and has several features which will enhance the possibilities of automatic physical description. Different approaches and algorithms required to accomplish the &ldquo;future&rdquo; system are outlined.
Learner-controlled course on the TICCIT system
Authors: C. Victor Bunderson
Venue: Proceedings of the ACM annual conference (1973)

The TICCIT project (Time-shared, Interactive, Computer-controlled Information Television) being developed jointly by the MITRE Corporation and Brigham Young University is now installed and operating at BYU with 30 terminals. The software for on-line authoring is being used to input more than six semesters of material in Mathematics and English instruction for Community Colleges. Two community colleges have been selected for a field test in 1974-75. They are Phoenix College and Northern Virginia Community College in Alexandria. The innovative concepts of learner-controlled courseware were illustrated by means of 35 mm. slides. These concepts include the objectives and status display (MAP), the primary instruction logic of the learner-control command language, and the Advisor program. The modularity of design for learner-controlled courseware permits differentiated staffing for the production of large volumes of quality material. The production procedures for learner-controlled courseware, involving roles of different team members, were briefly described.
A discipline for generating practical optimal structural designs
Authors: R. T. Douty, J. W. Chai
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

A discipline is described for generating, by nonlinear programming, finished designs of large structural systems involving large sets of nonlinear, nonconvex, discontinuous constraints. The set of techniques which are used to extend the cutting-plane method to handle this situation have to do with manipulating the large expressions with a symbolic manipulation language (PL/I-FORMAC), smoothing the deleterious effects of discontinuities and local optima on convergence, and forcing convergence to a set of commercially available values for the structural components. A comparison is made between a design accomplished by human effort and a design generated by the described methods for the same geometric and loading situation.
A hierarchical microcomputer system for hardware and software development
Authors: C. V. Ravi, Torben Moller
Venue: ACM SIGARCH Computer Architecture News (1977)

This paper describes a facility for integrated hardware and software development in the microprocessor area by graduate students. The constraints of a low budget, the necessity of providing fast turn-around time for software development, and tightly scheduled laboratory sessions, all of which are necessary in a university environment, precluded the use of methods such as primitive handtranslation of code (too slow), separate floppy-based development systems (too expensive) and in-circuit emulators (too expensive). The result was a hierarchical network of microprocessors whose design and development is described in detail. Experience with its operation and the applicability of the system for more general use is also discussed.
Technology marches on: Using microcomputers to deliver elementary computer science instruction
Authors: Rich Stillman
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

During the Spring 1980 semester, an experiment in teaching basic computer science was begun. Instead of using PL/C on the University's IBM 370 batch computer, 120 students in the Introduction to Programming course were taught Pascal using the single user, graphics-oriented environment of the Apple microcomputer. The paper describes our practical experiences with, and students' reactions to, UCSD Pascal and the Apples.
Multiprocessor hardware: An architectural overview
Authors: John Tartar
Venue: Proceedings of the ACM 1980 annual conference (1980)

The subject of multiprocessor computer systems has been discussed almost since the inception of the modern digital computer in its uniprocessor form. The motivation for multiprocessor system research and development activity arises from a consideration of one or more of the following factors: throughput flexibility extendability price/performance availability reliability fault tolerance. While any one of these factors may be the central issue, it should not be construed that these factors are disjoint. Quite the contrary, each may have a subtle, nonobvious effect on any multiprocessor system design.
Data retrieval in MOBIDIC B
Authors: Stanley K. Chao
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Digital Computers are used for a wide variety of data processing applications. Typical examples include inventory control, logistics, personnel files and post office directories. As a rule, large amounts of data must be stored within the computer system. This data must frequently be retrieved for the purpose of updating, to answer simple inquiries, or for further processing. This paper describes the data retrieval capabilities in MOBIDIC B, the organization of a typical personnel file, and a search program procedure.
Image sequence coding using a contour-based method
Authors: J. Murayama, T. Miyauchi, N. Shirota
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

This paper describes a new technique for reconstructing an image sequence from spatio-temporally represented contour information. The contour information includes geometry and amplitude information. The dependency of contours between frames is determined by their shape, amplitude and temporal difference. Contours are connected if the dependency of the contours between adjacent frames is strong. Connected contour groups are reconstructed in the form of a tree structure from dominant contours using their motion vector to each frame. Simulation results show that a constructed image sequence can be obtained with about 128 kbit/s for color CIF format image sequences at 25 frames/s.
Some results from an empirical study of computer software
Authors: Alan R. Feuer, Edward B. Fowlkes
Venue: Proceedings of the 4th international conference on Software engineering (1979)

A study has been carried out to relate the maintenance performance of a collection of PL/I programs to measures that characterize control flow, data usage, and software science attributes of the programs. The programs are from two subsystems of a business data processing application. Interesting relationships were found not only between the maintenance data and the measures but also among the measures themselves. This paper discusses some of the stronger of these relationships.
Automated inspection of electronic assemblies
Authors: C. A. Harlow, S. E. Henderson, D. A. Rayfield, R. J. Johnston, S. J. Dwyer,  III
Venue: Proceedings of the 11th Design Automation Workshop (1974)

Automated Visual Inspection Systems for electronic assemblies have been investigated. Three major phases have been researched: scanning devices, software algorithms, and possible computer systems.
GRAFOS - A symbolic routing language
Authors: G. Persky, H. K. Gummel
Venue: Proceedings of the 10th Design Automation Workshop (1973)

Interactive computer aids for integrated circuit layout usually offer a choice between slow, high-precision plotters or fast, low-resolution interactive media. A system, called GRAFOS, has been designed, which attempts to overcome resolution limitations by the use of symbolic referencing. It employs a symbolic routing language through which both the electrical connectivity and the geometry of the circuit interconnections are specified. This paper presents the syntax and symbology of the GRAFOS language, together with examples illustrating its adaptability to a variety of routing styles, e.g. slant lines, custom layout, polycell routing. Also included is a brief description of the GRAFOS operating system.
Emulation in a telecommunications environment
Authors: Mark M. Klein
Venue: Proceedings of the 1969 24th national conference (1969)

This paper describes the problems encountered when a multilocation company centralizes its data processing function without simultaneously converting those existing systems designed for decentralized operation. Techniques are presented for solving these problems by providing an operational environment for the emulation of existing programs.
Computer-aided design of nonlinear dynamic systems
Authors: M. A. Murray-Lasso, Steiner Espestøyl
Venue: Proceedings of the 7th Design Automation Workshop (1970)

With the advent of large memory, fast digital computers with convenient input-output devices and for which high-level problem-oriented languages are available in a time-shared enviromment, it is becoming increasingly desirable to develop digital computer programs for the design of complex control systems. For some time the analog computer has been used for this purpose. In this paper a large digital computer program, called OLDS (On Line dynamic system Design System), useful for the interactive design of nonlinear control systems in the time domain, is described. The program is the preliminary result of a research project with broader objectives.
A special purpose multiprogramming system for a computer-controlled telemetry Data Reduction System
Authors: Harold R. Gillette, William H. Roberts
Venue: Proceedings of the 1966 21st national conference (1966)

The software system described herein was designed for the LEM Data Reduction System (LDRS) by Lockheed Missiles and Space Company, Sunnyvale, California, as a subcontractor to ASTRODATA, Inc., of Anaheim, California, who developed and manufactured the telemetry hardware. The system was delivered to Grumman Aircraft Engineering Corporation for use in the development and testing of the Lunar Excursion Module. The LDRS is an integrated computer-oriented system in which telemetry conversion and data processing are performed concurrently by system components. A Control Data Corporation 3200 Computer system with a 3218 Programmed Data Channel serve as the central control elements of the system.
Environmental inquiry and general precision data type features fort he next fortran standard
Authors: Brian T. Smith
Venue: Proceedings of the ACM '81 conference (1981)

The X3J3 Fortran committee has begun preparing the next draft proposed standard for Fortran. This paper summarizes the committee's progress on two enhancements to Fortran that will aid in the preparation of numerical software; namely, an environmental inquiry feature for arithmetic data types, and a general precision floating point data type facility.
Efficient simulation of AHPL
Authors: Z. Navabi, F. J. Hill
Venue: Proceedings of the 16th Design Automation Conference (1979)

HPSIM2 is a second generation simulator for AHPL featuring a conditional input syntax. HPSIM2 replaces a less efficient simulator in an AHPL software package which includes a hardware compiler.
Distributing a visible surface algorithm over multiple processors
Authors: Henry Fuchs
Venue: Proceedings of the 1977 annual conference (1977)

Described is a procedure for executing a visible surface algorithm in a new multi-microprocessor system which utilizes distributed image and depth (&ldquo;Z&rdquo;) buffers. It is shown that despite image distribution over a large number of processing and memory units, object coherence can still be maintained and used to reduce the number of calculations needed to generate a continuous-tone visible surface image.
Concept communications with design automation systems
Authors: David J. Albert
Venue: Proceedings of the 9th Design Automation Workshop (1972)

Over the past ten years, the difficulties encountered with electronic design and drafting problems have forced the engineer to rely more and more on the computer as a design aid. As are result, a new system concept, the low cost turnkey interactive graphics system has become commercially available to make the computer a more useful design tool. Systems, Science and Software of La Jolla, California has designed the MASK system for this purpose. The philosophy behind the development of the system is presented in this paper, along with a discussion of the applications of the MASK system as a design and drafting tool.
Fast on-line integer multiplication
Authors: Michael J. Fischer, Larry J. Stockmeyer
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

A Turing machine multiplies on-line if it receives its inputs low order digits first and it produces the k-th output digit before reading in the (k+1)-st inputs. We present a general method for converting any off-line multiplication algorithm which forms the product of two n-bit binary numbers in time F(n) into an on-line method, and the new algorithm requires time only 0(F(n) log n). Applying this technique to the fast multiplication algorithm of Sch&ouml;nhage and Strassen gives an upper bound of 0(n (log n)2 log log n) for on-line multiplication of integers. Other applications are to the on-line problems of products of polynomials over a finite ring, recognition of palindromes, and multiplication by a constant.
Finding of optimal stack filter by using graphic searching methods
Authors: Zhi-Ming Chen, Chin-Chuan Han, Kuo-Chin Fan
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

A graphic searching algorithm is proposed to find the optimal stack filter. The search of the optimal stack filter is reduced to a problem of finding a minimal path from the root node to the optimal node in the error cone graph (ECG). Two graphic searching techniques, the greedy and A* algorithms, are applied to avoid the searching an extremely large search space. Experimental results are given to show the efficiency and performance of our proposed method.