ppxscal/embedding_network huggingface dataset:
Specification and implementation of parallel activities on abstract objects
Authors: S. Keramidis, L. Mackert
Venue: Proceedings of the 4th international conference on Software engineering (1979)

This paper describes a new method for the specification and implementation of parallel activities on abstract objects. The priority relationship, which is of practical importance, is an important part of this method. The syntax of a suitable specification language is given. Restrictions in the lower levels of a hierarchical system can be hidden towards the upper levels (e.g. finite capacity of buffers or memories) by an appropriate use of synchronization. To make the use of a particular level as flexible as possible, the level should be subject to as few restrictions as possible. Synchronization conditions on different levels can lead to deadlocks.
Hierarchical circuit extraction with detailed parasitic capacitance
Authors: Gary M. Tarolli, William J. Herman
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper describes a hierarchical MOS layout verification program called IV. IV extracts a circuit netlist from a MOS layout and then compares this netlist to a reference circuit netlist obtained from a schematic. The circuit extraction phase of IV is described in detail. A unique characteristic of the program is the treatment of parasitic capacitance. IV is currently being used in a production environment to extract circuits in a variety of NMOS and CMOS processes.
System for economic simulation
Authors: Zalman A. Shavell
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

The characteristics desirable in a system designed for the development and operation of simultaneous equation economic models are outlined. Classes of users are identified; and their needs are considered. Specifically, the point is made that a system for economic simulation must include a data management capability and facilities for the analysis of data and the estimation of parameters in addition to those required to exercise models.
On the construction of general purpose programs for studying finite groups
Authors: John Cannon
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

During the past decade efficient algorithms for many basic group theoretic constructions have been developed. These include centralizers, normalizers, conjugacy classes, subgroup lattices and character tables. In order to effectively utilize such programs it is necessary to allow the user to program his own constructions in terms of some basic set of constructions. Owing to the large number of basic constructions required and also because of the complexity of many of them, the realization of a satisfactory group theory system is a difficult task. In this talk we shall discuss the design of such a system. In particular, we shall discuss the design of a suitable higher level language for writing the system, the choice of a suitable set of basic constructions, the design and implementation of these basic constructions, and finally, the machine/user interface.
Design automation and VLSI in the 80's (Position Statement)
Authors: R. M. Jacobs
Venue: Proceedings of the 17th Design Automation Conference (1980)

The density of silicon integrated circuits has been increasing by a factor of two per year and this increase can be expected to continue in the forseeable future. This increasing scale of integration requires the use of comprehensive aids in order to prevent the design intervals from becoming excessively long and to limit the expenditure of design resources per circuit. With the increasing density and the trend to larger chips, silicon utilization will not be as critical a consideration as it has been in the past. It is therefore likely that faster turnaround and lower design cost can be achieved at the expense of some silicon area. Turnaround time and design cost considerations will likely cause the design style to become more modular and the use of predesigned blocks will become more common.
Lamport's algorithm reconsidered
Authors: H. Neil Singleton, Ronnie G. Ward
Venue: Proceedings of the ACM '82 conference (1982)

A modification to Lamport's algorithm that eliminates busy waiting is presented. A processor that is waiting to enter its critical section is freed to do other useful work. The algorithm is modified further to recognize and honor priorities.
Timing Verification and the Timing Analysis program
Authors: Robert B. Hitchcock,  Sr.
Venue: Proceedings of the 19th Design Automation Conference (1982)

Timing Verification consists of validating the path delays (primary input or storage element to primary output or storage element) to be sure they are not too long or too short and checking the clock pulses to be sure they are not too wide or too narrow. The programs addressing these problems neither produce input patterns like test pattern generators nor require input patterns like traditional simulators. Several programs (described here) operate by tracing paths [P173, WO78, SA81, KA81]. One program [MC80] extends simulation into a pessimistic analyzer not dependent on test patterns. Timing Analysis, a program described recently in [H182a], is designed to analyze the timing of large digital computers and is based, in part, on the concepts disclosed in a patented method [DO81] for determining the extreme characteristics of logic block diagrams. The output of Timing Analysis includes &ldquo;slack&rdquo; at each block to provide a measure of the severity of the timing problem. The program also generates standard deviations for the times so that a statistical timing design can be produced rather than a worst case approach.
Implications Of The President's Reorganization Project On Government Data Processing
Authors: John M. Carabello, Harris Reiche, Jules DuPeza, Paul Oyer
Venue: Proceedings of the 1978 annual conference (1978)

Each panel member will present his thoughts on the impact of the President's Reorganization Project on Federal agency ADP management policy and organizational structures. After a summary, the panel will respond to questions from the audience.
Portability and the national energy software center
Authors: Margaret K. Butler
Venue: ACM SIGNUM Newsletter (1979)

The software portability problem is examined from the viewpoint of experience gained in the operation of a software exchange and information center. First, the factors contributing to the program interchange to date are identified, then major problem areas remaining are noted. The import of the development of programming language and documentation standards is noted, and the program packaging procedures and dissemination practices employed by the Center to facilitate successful software transport are described. Organization, or installation, dependencies of the computing environment, often hidden from the program author, and data interchange complexities are seen as today's primary issues with dedicated processors and network communications offering an alternative solution.
Information retrieval I: DIGEST&mdash;DIebold GEnerator for Statistical Tabulation
Authors: C. F. Brennan
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

DIGEST is a series of programs designed to create statistical tabulations using the 1401 Data Processing System. The input to the programs is a series of parameter cards expressed in modified English language. Parameter cards generate the instructions necessary to process the detail data for creating statistical tables which reflect the frequency of input information. The basic objective of this system is to simulate and expand on the statistical report-producing facilities of the IBM 101 Sorter.
Trends in high performance graphic systems(Panel Session)
Authors: D. Cohen, Bob Sproull, Jim Clark, Fred Parke
Venue: ACM SIGGRAPH Computer Graphics (1980)

Accompanying the rapid development of integrated circuit fabrication technology has been a parallel, but slower, development of IC design techniques and systems. Recent approaches to IC design enable individual designers to consider developing their own VLSI circuits. Such capability may open the door to a more varied set of system designs than could previously be considered in most design environments. The panel members are all currently designing graphic systems oriented towards VLSI implementation. Each will give a short presentation describing one of their system designs. Following these presentations, three members of the previous session (Forest Baskett, Andreas Bechtolsheim, and Fred Parke) will discuss common issues, problems, and future prospects.
Is APL epidemic? or a study of its growth through an extended bibliography
Authors: J. C. Rault, G. Demars
Venue: Proceedings of the fourth international conference on APL (1972)

An attempt is made to demonstrate that the use of APL is growing in an epidemic fashion. The theory of epidemic processes is applied in an approximate manner by means of data provided by a nearly-exhaustive bibliography given as an appendix. APL is proved to be undoubtedly epidemic. A second part details the given bibliography.
Design of a microprogrammed lexical microprocessor
Authors: Yaohan Chu
Venue: Proceedings of the 8th annual workshop on Microprogramming (1975)

A lexical processor accepts a string of characters and delivers a string of symbols. This paper presents the design of a vertically microprogrammed processor, specially for lexical processing of a subset of Algol. The design includes the processor organization, the microprogram control organization, and the algorithm for the microsubroutines. This microprogrammed lexical processor could be implemented as a microprocessor in a multi-microprocessor system for high-level languages. The advent of microprocessors in 1971 has created a new era in computer technology. Since then, there are over 20 microprocessors that have become available, and there are numerous applications that have been made possible by these microprocessors. However, these microprocessors are essentially arithmetic processors. As a result, conventional software such as compilers, assemblers, linkage editors and loaders are required. The advancement in semiconductor technology has not been equally matched by the advancement of computer architecture and computer languages. In order to make better use of microprocessors, it is highly desirable that the layers of software be simplified or eliminated, and that high-level languages be designed with both the technology and the users in the proper perspective. This paper presents the design of a lexical processor, which is vertically microprogrammed for easier programming. This processor could be implemented as a microprocessor to be a member of a multi-microprocessor system for high-level languages.
A preprocessor for structural analysis programs
Authors: Peter K. Ho
Venue: Proceedings of the 13th Design Automation Conference (1976)

This preprocessor generates and updates input data on the geometry and properties of a structure and its foundation, and on gravity, seismic and other loadings.
Algebraic structure theory of stochastic machines
Authors: Eugene S. Santos
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

In the present paper, an algebraic structure theory of stochastic machines is developed which contains both Bacon's theory [1] and Hartmanis' theory for deterministic machines [5] as special cases. Although the present theory is patterned after both theories, it exhibits many interesting features which are here-to-fore unknown. Among other things, it is shown that the basic concepts involved, e.g., partitions with substitution property, partition pairs, state-behavior realizations, are all equivalent to well-known concepts in linear algebra. Section II introduces the model of stochastic machines to be used in subsequent developments. In Section III, various types of realizations and assignments are introduced. The concepts of partitions with substitution property, partition pairs, etc. are introduced in Section III. The last section gives a formulation of a network of concurrently operating QSMs.
Software accounting and the hardware monitor: Their marriage in performance analysis
Authors: Richard L. Madden
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

A problem was faced by the Systems Performance Analyst of a large corporation: could a dual-processor system be downgraded to a uniprocessor system and still handle the work-load within pre-determined time-constraints? No one particular tool for measurement existed that would be adequate; a further constraint existed in the analyst's suspicion that the system was loaded to the point that the overhead from specially designed &ldquo;snap&rdquo; or &ldquo;sniffer&rdquo; programs would be intolerable. An answer was needed almost immediately; thus information for analysis had to be generated immediately. By the marrying of an existing software accounting analysis system and a hardware monitor, satisfactory results were achieved to enable the analyst to recommend a decision.
Computerized Electro Neuro Ophthalmograph (CENOG)
Authors: R. S. Ledley, L. S. Rotolo, M. Buas
Venue: Proceedings of the ACM 1980 annual conference (1980)

CENOG (Computerized Electro Neuro Ophthalmograph) is a new diagnostic instrument developed to assist neurologists and neuro-ophthalmologists in the diagnosis and study of neurologic and ophthalmic disorders. Clinicians are becoming increasingly aware that the study of eye movements and visually evoked (cortical) potentials provides a sensitive, noninvasive means of obtaining valuable information in a neurological evaluation. A number of standard tests of oculomotor function and visually evoked response have been devised in order to detect the presence of latent subclinical lesions that are not apparent in a standard examination.
IGES as an interchange format for integrated circuit design
Authors: Curtis H. Parks
Venue: Proceedings of the 21st Design Automation Conference (1984)

There are several uses for neutral data transfer formats: to send your design out for fracturing and mask preparation, to move cell patterns to a system for routing, to move a completed design to a system for layout verification, and to archive a design. The latter is an interesting problem because integrated circuit (IC) designs are usually not &ldquo;released&rdquo; in hardcopy form as a drawing. Yet the data archive should be independent of system hardware and software revisions or &ldquo;upgrades&rdquo;. Many larger companies are working on a data base management system (DBMS) for graphic design files. Those who have been looking at IGES for archival of other product graphic designs may wish to look at the IC capability cited.
Detection of Rounded Opacities on Chest Radiographs Using Convergence Index Filter
Authors: Jun Wei, Yoshihiro Hagihara, Hidefumi Kobatake
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper presents a method to detect rounded opacities on digital chest radiographs. Based on a model of rounded opacities, three filters that evaluate the convergence degree of gradient vectors in the neighborhood of the pixel of interest are investigated to detect rounded opacities in the complex lung area. These filters do not depend on the contrast of the rounded opacity to its background. Their outputs depend on only the distribution of the gradient vector orientation. Experiments to test their performance have been performed. Their results show the effectiveness of the proposed filters. Especially, the iris filter and the adaptive ring filter are shown to be very effective in detecting cancerous tumor candidates. Another experiments to compare the performance of the iris filter and the Min-QDD filter which is one of the filters effective to detect rounded opacities have been performed and the superiority of the proposed filters has been shown.
Operating system enhancement through firmware
Authors: George E. Brown, Richard Eckhouse,  Jr., Jay Estabrook
Venue: Proceedings of the 10th annual workshop on Microprogramming (1977)

Microprogramming support for the enhancement of operating system design is described in detail, organization structure of realtime operating systems are examined, and criteria proposed for determining which functions are best for firmware implementation. Also, a closed queueing network model with state dependent routing probabilities is developed for studying the impact of microprogramming on a tactical computer system performance. Based on measurement obtained from two applications, the mathematical model is a good approximation in predicting system performance. Avenues for additional research is recommended.
Logo graphics as a mathematical environment
Authors: Harold Abelson
Venue: Proceedings of the 1976 annual conference (1976)

The graphics commands included in the Logo computer language do not rely on a global coordinate system. Descriptions of geometric figures in Logo tend therefore to be more procedural than descriptions arising with most other computer graphics implementations, and couched in terms of properties which are intrinsic to the figure in question rather than imposed by an external reference frame. The ramifications for Logo's role as an educational computer language include a congenial environment for introducing students to mathematics, a natural tool for constructing computational models of animal behavior and a springboard for forays into advanced mathematics.
Variations on pushdown machines (Detailed Abstract)
Authors: Stephen A. Cook
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

A class of machines called auxiliary pushdown machines is introduced. Several types of pushdown automata, including stack automata, are characterized in terms of these machines. The computing power of each class of machines in question is characterized in terms of time bounded Turing machines, and corollaries are derived which answer some open questions in the field.
What makes computer games fun? (abstract only)
Authors: Thomas Malone
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

One can't deny the effectiveness of video arcade games in reachipg users! Just loop at the number of quarters pushed into the slots, the time spent by people of widely differing abilities, and the number of repeat encounters with the systems. At least part of the success is due to the ease of getting started (the first play of the game gets one comfortable with the procedures), the high degree of visualization of controls and results, and the responsiveness overall. Other factors will be taken up by the panelists.Review of the home computer market shows what can be accomplished by an easy-to-use accounting aid through advertising store demonstrations, and word of mouth. Visicalc has sold over a million dollars! Attendees will have an opportunity to try some of these impressive applications before and after the session.
Specification of content-dependent security policies
Authors: David L. Spooner
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

The protection of information from unauthorized disclosure is an important consideration for the designers of any large multiuser computer system. A general purpose database management system often requires the enforcement of content-dependent security policies in which a decision to allow access must be based on the value of the data itself. Several authors ([Har76], [Sto76], [Gri76], [Sum77], [Min78], [Spo83], and others) have proposed mechanisms for implementing content-dependent security policies. Few authors, however, have investigated the properties of models for the specification of such policies. This paper identifies several problems created by inadequate models for the specification of content-dependent security policies. If a specification model is too liberal in the types of policies it can express, it may provide an increased opportunity for compromise of data. If the specification model is too conservative, it cannot express many desirable policies. Thus a flexible model which will allow a compromise between these two extremes is needed for specifying content-dependent policies. Such a model is proposed here.
Solving linear programming problems stated in English by computer
Authors: Stewart N. T. Shen, Gilbert K. Krulee
Venue: Proceedings of the ACM annual conference (1973)

A system has been developed to process certain types of linear programming problems stated initially in English. The problem statements are restricted to a prescribed grammar, with limited vocabulary, and subject to certain conventions [5]. In some respects, it resembles other systems which also accept problem statements in English. For example, BASEBALL [3] answers certain questions about baseball games, STUDENT [1] solves some elementary algebra problems, ELIZA [6] conducts &ldquo;conversations&rdquo; in English with humans, and Winograd's one-eyed robot works only with the &ldquo;block world&rdquo; [7]. However, the system described in this paper has been designed with certain rather practical uses in mind. The purpose of this paper is to present an overview of the system, how it operates, and what changes might be introduced in order to improve its performance.
Diffusion approximations for storage processes in computer systems
Authors: E. G. Coffman,  Jr., M. I. Reiman
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

In this paper we focus on the storage resource. A basic model of the space time requirements of jobs in a computer system is described, and a number of its variations analyzed by means of diffusion approxmiations. Subject to the usual heavy traffic assumptions, the result of this analysis enable one to quantify the effects of limitations on both storage capacity and processing rates.
Cost trade-offs in hardware support (Panel Discussion)
Authors: Nelle Dale, Victor Wallace, Clair Maple, Larry Loos
Venue: ACM SIGCSE Bulletin (1980)

A serious problem facing Computer Science educators is deciding what type of computer resource(s) needs to exist in order to serve Computer Science students. Should these resources include Time-Sharing, micro-processors, one large dedicated computer, and so forth? What are colleges and universities doing to attack this question? A panel of faculty from several colleges and universities of Computer Science education will present views and insights. There will be time for questions and answers from the audience.
The development and design of the surgical scheduler's hospital management game using GASP II
Authors: Richard O. Hoffman, Paul E. Torgersen
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This paper presents a game designed to introduce the participants to the scheduling function of a hospital's surgical service. The participant is responsible for scheduling a set of operations each period. For each set of operations that have been scheduled, the participant receives a performance and financial report, including a measure of scheduling effectiveness, hospital and social costs, and a comparison of the actual schedule with the best possible schedule for that day. The game is set within a probabilistic environment, includes an adaptive learning feature, and uses GASP II simulation language.
Constructive mathematics and computer science
Authors: Henry Cheng
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

This paper gives an informal exposition of the relationship between mathematics and computer science generated by the constructive viewpoint of Errett Bishop. Brouwer's insight on the lack of computational content in classical mathematics is discussed first. Then Bishop's constructivism is presented as a natural completion on the program started by Brouwer to develop a more realistic foundation for mathematics. Finally, the correlation between formal constructive mathematics and computer languages is illustrated and examined.