ppxscal/embedding_network huggingface dataset:
Symbolic Parasitic Extractor for Circuit Simulation (SPECS)
Authors: J. D. Bastian, M. Ellement, P. J. Fowler, C. E. Huang, L. P. McNamee
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper describes the design, development and implementation of the program SPECS. The purpose of SPECS is to automatically extract from a Rockwell microelectronic symbolic matrix description a netlist for circuit simulation. This program differs from others in that it uses a symbol layout matrix as an input, calculates both interelectrode and intrinsic capacitance, calculates conductor resistance, produces a schematic representation of the network and has a selective TRACE, i.e., traces only the circuit or network of interest.
A brief account: Implementation and applications of a Pascal program verifier (Position Statement)
Authors: David C. Luckham
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The Stanford Pascal verifier is an interactive program verification system. It automates much of the work necessary to analyze a program for consistency with its documentation, and to give a rigorous mathematical proof of such consistency or to pin-point areas of inconsistency. It has been shown to have applications as an aid to programming, and to have potential for development as a new and useful tool in the production of reliable software. This verifier is a prototype system. It has inadequacies and shortcomings. It is undergoing continuous improvement, and is expected to be used eventually in conjunction with other kinds of program analyzers. In this talk we shall describe the verifier and some of the results that have been obtained using it. We shall discuss some of the problems that still stand in the way of developing verifiers to a stage where they are part of the programmer's normal working environment.
Binary Decision Diagrams: From abstract representations to physical implementations
Authors: Jose S. Metos, John V. Oldfield
Venue: Proceedings of the 20th Design Automation Conference (1983)

The Binary Decision Diagram (BDD) has established its place as a modelling technique for digital systems. The paper shows that further significant benefits can be realized by implementing BDDs as custom or semi-custom integrated circuits. Benefits include efficient use of silicon area and improved simulation. A well-known example is given of a traffic light controller previously implemented by a PLA. The BDD layout is regular, compact and lends itself to automatic generation. A sample worst-case circuit simulation is included.
Secondary school model automatic test generation
Authors: Eugene J. Muscat
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

A review of the literature dealing with automatic test generation yields a wide variety of subject matter applications. Most decriptives, however, deal with college level projects. This paper out lines secondary school requirements that may encourage the development of appropriate test generation models. Our discussion will center on a common need for remediation at the secondary level, namely, mathematics skill building (addition, subtraction, multiplication and division). The subject matter selection is only to assure that the suggestions made are as concrete as possible. The paper will concentrate on the structural and procedural aspects of school site test generation and will not deal with the computer programming requirements. The basic model assumes remedial curriculum that will be directed as a student population of 500 students. This supposes that the entire student population is not utilizing a single test generation package. The recommendations allow for adding additional curriculum services and increasing student use. A test generating laboratory should emerge that would operate as a service bureau. This center will be detailed below. The discussion will be organized under the following headings: The discussion will be organized under the following headings: Hardware Requirements Turnaround Personnel Cost
Programming Language Standards From A User's Point Of View (Panel Discussion)
Authors: Paul Abraham, Paul Stylos, David Reese, Pat Hagerty, Don Dudley
Venue: Proceedings of the 1978 annual conference (1978)

Although ACM and NCC sessions have reviewed programming language standards many times in the past years, the emphasis has been mainly on the processes of standards development, as a tutorial on an up-coming standard, or on the validation procedures for implementation. This panel consists of a number of implementers who have not been involved in the standards development process but who are attempting to produce processors which conform to either a National standard (such as PL/I) or a defacto standard (such as PASCAL). Three major questions are of concern - was the standard of assistance to you in the implementation process; in what way did it fall short of your expectations; and did the standard inhibit you in any way?
IPv6 Prefix Delegation-Based Addressing Solution for a Mobile Personal Area Network
Authors: P. Pääkkönen, J. Latvakoski
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

This paper provides a dynamic IPv6 prefix delegation-based addressing solution to enable Internet connectivity when a Personal Area Network (PAN) is moving between sub-networks. A PAN consists of a cluster of mobile devices, which are dynamically connected with each other and move around together. The approach is based on IPv6 stateless address auto-configuration, and Automatic Prefix Delegation Protocol for IPv6. The problems related to addressing, mobility and IPv6 prefix delegation are evaluated with the constructed prototype. The experiences indicate that the solution is quite light and enables session continuity in subnet changes for any mobile node of a PAN. In addition, the solution does not exclude application of Mobile IPv6 (MIPv6), however Mobile IPv6 is not necessarily needed when Session Initiation Protocol (SIP) based mobility is applied. By using SIP, route optimization is also achieved and IPv6 encapsulation is avoided with UDP-based sessions. However, the solution is not necessarily very scalable to big mobile networks.
When to stop a simulation run: A case study
Authors: Herbert D. Schwetman, Steven C. Bruell
Venue: Proceedings of the 4th symposium on Simulation of computer systems (1976)

The use of an efficient stopping rule can assist in the achievement of accurate simulation results at a reduced cost of computation. Conversely, with an inefficient stopping rule, either in-accurate results or excessive costs can occur. The problem of deciding when to stop a simulation model of a computer system is further complicated by the fact that a key parameter, response time at a service center, is not an independent random variable. In spite of this complication, procedures for determining the number of observations of response time variables required to achieve statistically valid results have been developed. This paper presents, via the case-study approach, the effects of using an insufficient number of observations of response time and the improved accuracy which is obtained when an efficient stopping rule is used. While these results are not new, they are perhaps not widely known in the field of simulation of computer systems. We therefore view the contribution of this paper as that of demonstrating the application of such results in this field, so that other researchers can make use of them. An appendix includes a brief description of the algorithms used.
Online system performance measurements with software and hybrid monitors
Authors: Liba Svobodova
Venue: Proceedings of the fourth ACM symposium on Operating system principles (1973)

Two monitors were implemented to collect information about the behavior of the online system developed and run at Stanford. The response of this online system was slow and main memory was a critical resource. The goal was to extract desired information by a method that requires only a negligible amount of monitored system resources. Results presented in this paper indicate that this effort has been successful. A software monitor that requires less than 700 bytes of main memory collects statistics about utilization of special online system resources and about the scheduler mechanism, detects system deadlocks, and measures online executive overhead. This software monitor helped to discover various facts about the system behavior; however, to understand the reasons behind certain situations, it was necessary to learn more about properties of individual terminal tasks. Since a software monitor would cause an intolerable system degradation and hardware monitoring is not directly applicable for such measurements, a hardware/software monitor interface was implemented which enables recording of software events by a hardware monitor. The monitoring artifact is thus kept close to zero. This technique has been applied to measure time a task spends in various states and it has many other uses.
Linear time bounds for median computations
Authors: Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, Robert E. Tarjan
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

New upper and lower bounds are presented for the maximum number of comparisons, f(i,n), required to select the i-th largest of n numbers. An upper bound is found, by an analysis of a new selection algorithm, to be a linear function of n: f(i,n) &le; 103n/18 < 5.73n, for 1 &le; i &le; n. A lower bound is shown deductively to be: f(i,n) &ge; n+min(i,n&minus;i+l) + [log2(n)] &minus; 4, for 2 &le; i &le; n&minus;1, or, for the case of computing medians: f([n/2],n) &ge; 3n/2 &minus; 3
A methodology for preparing the computer professional for certification
Authors: Paul P. Howley,  Jr., James S. Ketchel, Michael G. Rowloff
Venue: Proceedings of the ACM 1980 annual conference (1980)

This paper describes a methodology by which higher education institutions, business and government training facilities and professional societies can set-up and administer a review course for the Certificate in Data Processing examination. During the past seventeen years, one or more of the authors have conducted CDP review programs for the benefit of members of professional societies, students, and company employees. These years of experience have provided the basis for establishing a rigorous methodology for preparing candidates for the CDP examination with excellent results. The Certificate in Data Processing examination program is administered by the Institute for Certification of Computer Professionals. More than 25,000 persons have taken the examinations over the past ten years. This large response to voluntary certification suggests the need for an orderly program to prepare the computer professional for certification.
Some inequalities about univariate polynomials
Authors: Maurice Mignotte
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

This paper deals with the two following topics: bounds for the heights of divisors of polynomials, minimal distance between distinct roots of integral univariate polynomials. In each case we recall the best known results, we give some new inequalities and, constructing suitable examples, we show that these inequalities are not &ldquo;too bad&rdquo;.
Entry-level position of computer programmer survey
Authors: James W. Phillips
Venue: Proceedings of the eleventh SIGCSE technical symposium on Computer science education (1980)

The mission of a community college is to provide educational services to the community. These services are dictated by the priorities of the specific community. The first priority for Lexington, Kentucky, is employment. The two factors of employment are an available position and a qualified applicant. For local business, the majority of computer-related technical positions are in data entry, operations, and programming. The community college must be able to prepare individuals to be qualified for some of these careers. Lexington Technical Institute (LTI) is one of thirteen institutions under the University of Kentucky's Community College System. LTI offers programs in many technical areas. Among them is a Business Data Processing curriculum leading to as Associate Degree in Applied Science. The intent of the curriculum is to prepare individuals for careers in computer programming for business applications. Other state-supported institutions cover data entry and other types of programming. Formal training for data entry is given through local vocational schools. Formal training for research and advanced programming positions is given through the Computer Science Department at the University of Kentucky. There is no institution providing adequate formal training for computer operations. The curriculum at LTI is oriented toward preparing individuals for entry-level positions as computer programmers within the Lexington area. To ensure that an institution continues to provide a relevant curriculum, the needs of local business must be periodically reviewed (Little, 1977). A mailed questionnaire was returned by 142 companies in the Lexington area in 1975 (Hager, 1975). The important facts identified were: 1. the predominant computer languages (in decreasing order of use) were COBOL, RPG, and Assembly language; 2. trend toward increased use of BASIC timesharing systems; 3. a preference for an education stressing business systems as well as programming; 4. job opportunities enhanced by practical experience. A follow-up survey was undertaken through the support of the University of Kentucky's Community College System during the summer of 1979. Selected employers of computer programmers within the Lexington area were interviewed.
Uniform modular realization of sequential machines
Authors: Edward P. Hsieh, C. J. Tan, Monroe M. Newborn
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

Several researchers have investigated the problem of using a finite set of sequential modules to realize a given synchronous Moore machine.1,2,3 It has been shown that there does not exist either a single module or a finite set of modules that is logically complete for synchronous sequential machine design.3 That is, no finite number of identical copies of one module or finite set of modules can be used to realize with unit delay any arbitrary synchronous sequential machine. However, it has been shown that for every integer n, a finite number of identical copies of one module is sufficient to realize every n-input synchronous machine.2,3 It is the purpose of this paper to investigate this form of machine realization for both synchronous and asynchronous machines.
Trapol: A cold-start-sensitive simulation model of traffic-generated air pollution emissions
Authors: Brian Laird Crissey
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

It should not be a surprise to anyone that the automobile is a primary source of the air pollutants Carbon Monoxide (CO), Hydrocarbons (HC), and Nitrogen Oxides (NOx). The severity of the issue is well documented, and the search for viable solutions to this complex problem is widely publicized, if still hesitant and speculative in nature. The use of computer models for the analysis of air pollution problems, although widespread and increasing, is constrained by a problem of scale. HC and NOx display their most severe impact on a metropolitan-wide scale, where their presence contributes to the formation of photo-chemical smog. CO, on the other hand, is a local pollutant whose most adverse effects are felt relatively close to its source. This disparity in scale implies that different modeling techniques should be used for the two classes of pollutants. While a macro-scale is appropriate for HC and NOx, a micro- or meso-scale is correct for CO. Also, while a small-scale model of CO concentrations can be used to predict the HC and Nox contributions of a small area to the metropolitan area, a large scale HC/NOx model cannot easily be used to predict local CO concentrations.
Proposing resident user-cycles in personal computers
Authors: Peter Schulthess, Jiri Hoppe
Venue: Proceedings of the 5th ACM SIGSMALL symposium on Small systems (1982)

Most people using a personal computer work according to a cyclical pattern. A program developer for instance will repeatedly execute and load the functions EDIT, COMPILE and EXECUTE from secondary storage. The efficiency of this user-cycle critically depends on the performance of the channel to secondary storage. However, if all programs required during one user cycle can be kept in local main memory then the local disk can be omitted and even a medium speed local area network will be adequate to supply the missing portions of data and code.
Storage representations for tree-like data structures
Authors: Arnold L. Rosenberg, Derick Wood, Zvi Galil
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

We review the motivation underlying the study of data encodings and the formal framework of the study. We then present a series of results whose main message is that (complete) trees are materially less congenial storage representations for tree-like data structures than they have been shown to be for array-like data structures. In response to these results, we propose a new data structure, called a dree, which we show to share the advantages of trees, but not to suffer their disadvantages, when used as a storage structure.
Language constructs and support systems for distributed computing
Authors: C. S. Ellis, J. A. Feldman, J. E. Heliotis
Venue: Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing (1982)

This paper describes programming constructs and system support functions that are intended to facilitate the programming of reliable distributed systems. The systems considered include very different kinds of computers communicating through a network. Such a heterogeneous network offers a number of advantages to designers of applications software. Different machines emphasize different capabilities and many problems naturally break down into subproblems that are best solved with specialized resources. There is clearly a need for programming tools that will allow users to exploit this kind of environment.
Psychological issues in the use of icons in command menus
Authors: Kathleen Hemenway
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Graphic symbols are being used more and more frequently in computer applications, as high resolution displays with advanced graphic capabilities become more common (for example, see [14]). The motivations for using graphic symbols&mdash;or icons, as they have been called&mdash;in command menus are similar to the reasons graphic symbols have long been popular for use on maps. Their commercial and technical advantages aside, to a large extent the effects of icons on users' performance with a system are unknown. The study summarized here is an initial attempt to understand how commands are represented graphically, to identify the characteristics of icons that make them easy or difficult to comprehend, and to identify the characteristics that lead to retention of the icon-command correspondences. More generally, it is an initial attempt to identify how the user's ability to learn and understand a system is affected by the way in which the commands are represented.
A top-down, laboratory based operating system course
Authors: Dale H. Grit, Dennis D. Georg
Venue: ACM SIGCSE Bulletin (1977)

An operating system course is described which is organized in a top-down fashion and strongly emphasizes the concept of &ldquo;learning by doing.&rdquo; The course content and the corresponding laboratory assignments are discussed. The suggested modularization of the laboratory provides substantial flexibility for course emphasis.
A reconfigurable and fault-tolerant VLSI multiprocessor array
Authors: Israel Koren
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

Multiprocessor arrays have the property of regularity, enabling a low-cost VLSI implementation. However, multiprocessor systems with a fixed structure tend to be error prone and restricted to specialized applications, which makes them less attractive to the semiconductor industry. Consequently, reconfigurability and fault-tolerance are desirable features of a multiprocessor array. A multiprocessor array with a flexible structure can be adapted to many applications and may restructure itself upon failure of a processor, to avoid using faulty processors. The objective of this work is to demonstrate the feasibility of a multiprocessor array having these properties. An example of such an array is introduced, and distributed structuring algorithms for it are presented. A novel strategy for internal testing and for identification of faulty processors is developed, and the structuring algorithms are modified to accommodate faulty processors.
Modern educational techniques - high tech and the traditional approach
Authors: Tim Leso
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Personal computers are enhancing the teaching techniques that are currently being used in classrooms and laboratories. They also possess the potential to transform the dormitories and other homework units into new forms of learning centers. Here at The Altoona Campus of The Pennsylvania State University, new technology and the traditional approach are being merged, tested, and accepted by students, faculty, and administrators as modern educational techniques leading into the 1990s. Typifying these techniques is a case study of a complex and tedious teaching task of instructing a novice to design a &ldquo;shape table&rdquo; and implement a program that personally demonstrates the color graphics capability of the APPLE Personal Computer and provides a fundamental understanding of the concepts of computer graphics.
Pyramidal parametrics
Authors: Lance Williams
Venue: ACM SIGGRAPH Computer Graphics (1983)

The mapping of images onto surfaces may substantially increase the realism and information content of computer-generated imagery. The projection of a flat source image onto a curved surface may involve sampling difficulties, however, which are compounded as the view of the surface changes. As the projected scale of the surface increases, interpolation between the original samples of the source image is necessary; as the scale is reduced, approximation of multiple samples in the source is required. Thus a constantly changing sampling window of view-dependent shape must traverse the source image. To reduce the computation implied by these requirements, a set of prefiltered source images may be created. This approach can be applied to particular advantage in animation, where a large number of frames using the same source image must be generated. This paper advances a &ldquo;pyramidal parametric&rdquo; prefiltering and sampling geometry which minimizes aliasing effects and assures continuity within and between target images. Although the mapping of texture onto surfaces is an excellent example of the process and provided the original motivation for its development, pyramidal parametric data structures admit of wider application. The aliasing of not only surface texture, but also highlights and even the surface representations themselves, may be minimized by pyramidal parametric means.
Information transmission in computational systems
Authors: Ellis Cohen
Venue: ACM SIGOPS Operating Systems Review (1977)

This paper presents Strong Dependency, a formalism based on an information theoretic approach to information transmission in computational systems. Using the formalism, we show how the imposition of initial constraints reduces variety in a system, eliminating undesirable information paths. In this way, protection problems, such as the Confinement Problem, may be solved. A variety of inductive techniques are developed useful for proving that such solutions are correct.