ppxscal/embedding_network huggingface dataset:
An event-driven data collection and analysis facility for a two-computer network
Authors: James D. Foley, John W. McInroy
Venue: Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation (1974)

In this paper we describe an event-driven data collection facility, and a general-purpose program to perform a set of analyses on the collected data. There are several features which distinguish this facility from others. First, the system being monitored is a network of loosely-coupled computers. Although there are just two computers in the network, the facility could be readily extended to larger networks. Second, the main purpose of the facility is to monitor the execution of interactive graphics application programs whose processing and data are distributed between the network's computers. Third, the data collector and analyzer are readily extendible to treat new kinds of data. This is accomplished by a data and event independent collector, and a table-driven data analyzer.
An APL-total interface
Authors: Rick Mayforth
Venue: ACM SIGAPL APL Quote Quad (1979)

A description is made of an interface between Control Data's APL2 and Cincom's TOTAL data base manager. The areas discussed are: organization of TOTAL data bases, the interface to APL2, the interface to the APL user, and comments on the use of this system. It was found that the difference in costs between coding a moderately sized application in COBOL and APL was enough to pay for implementing the interface, with savings remaining after that.
Local networking by ring, ethernet, broadband, and PABX&mdash;perspectives from the field
Authors: Jerome H. Saltzer
Venue: Proceedings of the ACM '81 conference (1981)

The advocates of various approaches to local networking have largely emerged from the ranks of research and development organizations, and have thus mostly described the prospective advantages of their preferred technologies. Often, in the field, the dominating concerns turn out to be different from the ones anticipated by the developers. This panel session will bring together four representatives of organizations that have each chosen different local network technologies, developed them, placed products in the field, and gained some practical experience.
Pushdown store machines and real-time computation
Authors: Stephen N. Cole
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

A comparison is made of the computing capabilities of pushdown store machines and real-time iterative arrays of finite-state machines with the following results. Every pushdown store computation can be performed by some iterative array in real time. The latter are strictly more powerful, since they can recognize the set of palindromes in real time, which is impossible for pushdown-store machines even without a real-time constraint. Versions of pushdown store machines, the tabulator machines and the n-dimensional pushdown store machines, are introduced during the development. By imposing a real-time constraint and letting the number of tabs and the number of dimensions vary, these form infinite hierarchies whose unions are equivalent to the pushdown store machine.
Statistical techniques of timing verification
Authors: James H. Shelly, David R. Tryon
Venue: Proceedings of the 20th Design Automation Conference (1983)

Timing verification of VLSI designs using statistical techniques such as those implemented in Hitchcock's Timing Analysis1 permit a far more precise assessment of machine performance than previous techniques. The accuracy of these results is affected by proper user specification of statistical input parameters and by the algorithmic treatment of the system design. Since these items are both system and technology dependent, the system designer must understand them and apply appropriate statistical techniques in order to insure a properly verified design. This paper both outlines the mathematical derivations and illustrates the magnitude of the improvements to be obtained.
Computer science education and the ideal of liberal arts
Authors: Gail B. Brackett, Chadwick H. Nestman, Emil R. Spees
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

With the watchword, slogan, and panacea of today being &ldquo;Back to Basics&rdquo;, it is especially appropriate that the ACM conference should look at the relationship of computers, computer science education, and the liberal arts. In keeping with realistic, pragmatic program learning, it is necessary that we define the terms to be used and the nature of the problem; that we review the budding efforts toward the solution; and finally, that we offer our own suggestions for the future. In order to avoid the inevitable conflict involved in defining what comprises liberal arts, we shall deal with the more global issue of describing the concept of liberal arts education.
Attributed Tree Matching and Maximum Weight Cliques
Authors: Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

A classical way of matching relational structures consists of finding a maximum clique in a derived "association graph." However, it is not clear how to apply this approach to problems where the graphs are hierarchically organized, i.e. are trees, since maximum cliques are not constrained to preserve the partial order. We have recently provided a solution to this problem by constructing the association graph using the graph-theoretic concept of connectivity.In this paper, we extend the approach to the problem of matching attributed trees. Specifically, we show how to derive a "weighted" association graph, and prove that the attributed tree matching problem is equivalent to finding a maximum weight clique in it. We then formulate the maximum weight clique problem in terms of a continuous optimization problem, which we solve using "replicator" dynamical systems developed in theoretical biology. This formulation is attractive because it can motivate analog and biological implementations. We illustrate the power of the approach by matching articulated and deformed shapes described by shock trees.
The design and implementation of fault insertion capabilities for ISPS
Authors: J. Duane Northcutt
Venue: Proceedings of the 17th Design Automation Conference (1980)

Fault tolerance is an important attribute of most computer systems, and to be effective it must be an explicit objective from the beginning of the design process. Inserting faults into a simulation of the machine and observing its behavior is a thorough and economical technique for evaluating prospective fault detection, diagnosis, recovery, and repair mechanisms. As systems become larger due to rising semiconductor integration, the expense of these fault simulations increasingly necessitates that they be performed at higher levels of abstraction (such as the register transfer level) rather than lower (such as the gate level). This can achieve major cost savings without significantly compromising fault coverage. This paper describes the design and implementation of a high level fault insertion mechanism for the Instruction Set Processor Specification (ISPS) simulator. The ISPS simulator was chosen because it is an interactive, high level simulator which is capable, mature, and widely used and accepted. The faults which can be simulated include hard and transient, deterministic and probabilistic, stuck-at and bridged, data, control, and operation types. These facilities have been implemented and demonstrated to be sound in both concept and implementation. They have been incorporated as a standard feature in the latest release of the ISPS simulator
A hierarchical approach for layout versus circuit consistency check
Authors: Shiu-Ping Chao, Yen-Son Huang, Lap Man Yam
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper describes a CAD program which checks the circuit topology and the electrical parameters from the IC layout data against the user supplied circuit descriptions. Taking advantage of the hierarchical characteristics of the layout data, the program achieves an efficient analysis and does a clear presentation of the results.
Simulation model to evaluate maintenance strategies for large network of fielded systems
Authors: Gene A. Wong
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

A dynamic simulation model of a field maintenance organization has been developed and validated. The objective of the model is to provide an analytical tool for evaluating the operational feasibility of new maintenance strategies prior to their introduction into the field. This simulation model is an accurate replica of the policies and time critical maintenance activities within a field organization, providing a rendering in detail of each technician and each facility as events take place in time. This paper discusses the structure of the model, the functions simulated, the validation experiment, and an application of the model.
Applications of digital processors to energy monitoring and control systems
Authors: Alan A. Ross, John M. Borky
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

The crisis in cost and availability of energy has led to the development of digital monitoring and control systems which manage and reduce energy consumption in a wide range of facilities. Large energy management systems incorporate distributed processing architectures and a wide range of manual and automatic functions. Design and implementation of such systems poses serious problems of function and algorithm definition, data communications, and optimization of physically dispersed processor networks. This paper describes the application of a structured design methodology which addresses the problem of interdisciplinary communication in energy management system realization and greatly simplifies the development of the wide range of software required. Also considered are questions of proper data communication design for the unique environment encountered in such situations and optimum implementation of the distributed processing architecture for the functional priorities of the energy conservation application.
Constraints
Authors: Guy Lewis Steele,  Jr., Gerald Jay Sussman
Venue: Proceedings of the international conference on APL: part 1 (1979)

We present an interactive system organized around networks of constraints rather than the programs which manipulate them. We describe a language of hierarchical constraint networks. We describe one method of deriving useful consequences of a set of constraints which we call propagation. Dependency analysis is used to spot and track down inconsistent subsets of a constraint set. Propagation of constraints is most flexible and useful when coupled with the ability to perform symbolic manipulations on algebraic expressions. Such manipulations are in turn best expressed as alterations or augmentations of the constraint network. Numerous diagrams ornament the text.
Simulation of merge junctions in a dynamically entrained automated guideway transit system
Authors: Steven E. Shladover
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

Merge junctions and intersections are the principal capacity limiters and sources of delay in automated guideway transit (AGT) networks. The capacity and delay performance of the merge junctions must be thoroughly understood before an AGT network can be designed. This paper describes the modeling and event-structured Monte Carlo simulation of a single merge junction, having two input lanes and one output lane, operating in a quasi-synchronous network. The simulation described here differs from previous merging models by permitting slots to be of variable length to accommodate trains of different lengths, and allowing unlimited maneuvering of trains (if needed). It has the unique ability to represent the operation of a special, newly devised concatenating merge, which permits trains arriving on separate input lanes to combine themselves into a longer train at the merge. The simulation logic which is used to represent special features of merge performance (flow compressibility, upstream propagation of disturbances, etc.) is explained, and the implementation using GASP IIA is described. The statistical considerations underlying the experimental design are discussed and some sample diagnostic outputs displayed.
The relational and network approaches: Comparison of the application programming interfaces
Authors: C. J. Date, E. F. Codd
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational (1975)

For some time now there has been considerable debate in the field of database systems over the fundamental question of the underlying design philosophy of such a system. The controversy has centered on the structure of the programmer interface, though of course the design chosen for this interface has repercussions throughout the rest of the system. Two approaches to this problem have received particular attention: the network approach, which is typified by the proposals of the CODASYL Data Base Task Group (DBTG), and the relational approach, which is advocated by the present authors (among others). The purpose of this paper is to give some comparisons between these two approaches (primarily from the application programming viewpoint), and to show what the authors believe to be the advantages of the relational approach. The reader is assumed to have a basic familiarity with the two approaches.
Priority dispatch and aircraft scheduling: A study of strategic airlift scheduling
Authors: Gerald R. Armstrong, Joseph W. Coleman, Vernon H. Hamilton, Jerry W. Poe
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

This paper demonstrates the development of a flexible methodology for examining strategic airlift resource allocation and cargo priority rules. The work was motivated by the need to develop and test heuristic rules to reduce the amount of cargo delivered late in a contingency operation. Priority rules derived from machine scheduling are adapted and used in conjunction with alternative aircraft allocation procedures to determine an improved method for scheduling C-5 aircraft. To test the different scheduling policies in a dynamic environment, a simulation model was developed, using SLAM. Multiattribute utility theory was also used to develop a scalar scoring function (SSF) which effectively combined the response variables into a single value for each policy to facilitate comparison among the various scheduling policies. A full factorial experiment was performed, using five levels of cargo priority rules and three levels of aircraft allocation rules. A one-way analysis of variance was used to compare the mean SSF values for each policy.
An experiment to improve operand addressing
Authors: Robert P. Cook, Nitin Donde
Venue: Proceedings of the first international symposium on Architectural support for programming languages and operating systems (1982)

MCODE is a high-level language, stack machine designed to support strongly-typed, Pascal-based languages with a variety of data types in a modular programming environment. The instruction set, constructed for efficiency and extensibility, is based on an analysis of 120,000 lines of Pascal programs. The design was compared for efficiency with the instruction sets of the Digital Equipment PDP-11 and VAX by examining the generated code from the same compiler for all three machines. In addition, the original design choices were tested by analyzing the generated code from 19,000 lines of StarMod programs. As a result of this iterative experiment, we have summarized our observations in an efficient reorganization of the VAX's addressing modes.
Creating polyhedral stellations
Authors: Kathleen R. McKeown, Norman I. Badler
Venue: ACM SIGGRAPH Computer Graphics (1980)

A process for creating and displaying stellations of a given polyhedral solid is described. A stellation is one of many star-like polyhedra which can be derived from a single solid by extending its existing faces. A program has been implemented which performs the stellation process on an input object and generates a 3-dimensional image of the stellated object on a computer graphics display screen. Pictures of icosahedron and rhombictriacontahedron stellations generated by the program are included in the paper.
How to develop module logic using pseudo-code and stepwise refinement
Authors: Anthony A. Lekkos, Carl M. Peters
Venue: Proceedings of the 15th Design Automation Conference (1978)

The use of pseudo-code and the stepwise refinement process in developing the logic of modules is discussed, and the advantages of this method are analyzed. An example is given to illustrate the steps to be taken in analyzing the function, selecting data structure and algorithm, abstracting the function in pseudo-code, expanding the function into subfunctions, and finally, verifying the function.
Hyperdocument generation using OCR and icon detection
Authors: M. Worring, R. van den Boomgaard, A. W. M. Smeulders
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

In this contribution we consider the construction of hyperdocuments; converting scanned paper documents into electronic hypertext. Hyperlink creation is automated by analyzing the structure and content of the scanned document. The focus is on hyperlinks between the text and labels in a picture. A number of tools for such hyperlink detection are described. Practical results are presented.
Design and analysis of electronic circuits
Authors: E. L. Calvin, L. C. Casady, J. R. Edenhofer, R. S. Miles
Venue: Proceedings of the 4th Design Automation Conference (1967)

Very seldom does the initial design of an active circuit result in all design constraints being met. Hence, design techniques involve a process of initial design-analysis-redesign-analysis, until the circuit meets the specifications. This paper presents the general philosophy of a computer program which automates the &ldquo;analysis-redesign&rdquo; cycle for a large variety of passive or active, linear or nonlinear circuits. The computer program employs both circuit simulation and optimization techniques. Simulation corresponds to the analysis portion of the cycle in that it determines the circuit's response and whether or not the design constraints have been met. The optimization technique alters parameter values to minimize a function which reflects the design constraints. Thus, the optimization procedure performs the redesign.
An associative array architecture intended for semantic network processing
Authors: Dan I. Moldovan
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

This paper describes the organization and operation of a semantic network array processor (SNAP). The architecture consists of an array of identical cells each containing a content addressable memory, microprogram control and communication unit. Each cell is dedicated to one node of the semantic network and its associated relations. The array can perform global associative functions under the supervision of an outside controller. In addition, each cell is equipped with the necessary logic to perform individual functions. A set of primitive instructions were carefully chosen. Some of the applications discussed in this paper include pattern search operations, production systems and inferences. A LISP simulator was developed for this architecture, and some simulation results are presented in this paper.
Implementation of the GIST Geographic Base File
Authors: Robert Amsterdam
Venue: Proceedings of the 1971 26th annual conference (1971)

GIST, New York City's Geographic Information System, is designed to unify many items of basic information describing the physical, social and environmental features of New York City. Files and programs are being developed for use by all agencies of the city government. The principal files are the Geographic Base File and the Building/Lot File. The GIST Geographic Base File (GBF) has been implemented and has been used by more than 20 city departments. This article describes the present contents of the GBF and related files, significant activities in their development and also describes how the files are being used.
Teaching computer design using macromodules
Authors: Robert A. Ellis, Donald F. Wann
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

This paper describes the teaching of computer design using a new and quite unusual hardware aid, macromodules. Of all the new areas emerging in Computer Science the teaching of computer structures, from an engineering viewpoint, has continually challenged the professional educator. This has in a sense presented a dilemma to him: for digital computer system design requires a broad look at a variety of configurations, but also seems to require a comprehensive examination of individual circuit details in order to remain in a practical atmosphere. As is well known, such detailed investigation of many systems is virtually impossible in the time allotted in most cirricula. Introduction of the macromodular concept, however, has permitted individual students, in one or two semesters, to achieve realizabledesigns of such devices as I/O channels, microprogrammed machines, complete small digital computers, floating point arithmetic systems and list processing hardware.
Production programming by revenue curve analysis
Authors: A. G. Beged Dov, C. D. Carmichael, S. T. Ferguson, I. E. Mitchell, W. H. Struble
Venue: Proceedings of the second conference on Applications of simulations (1968)

We grant that share of the market can and should be an important consideration in setting corporate goals, but it must not be the sole objective. We believe that total market forecasts and the determination of a firm's own sales plan are valid, reasonable and necessary elements of a total decision system, but they are not the whole system. We have developed a procedure, based on the maximax principle1 and the application of the principle of subsidiarity,2 to evaluate the influences bearing on profitability and to optimize profit on a continuing basis, thus providing management with a fully systematized, immediate and rational basis for decisions under an infinite variety of factual or hypothetical situations with respect to those elements basic to the profitable operation of a manufacturing firm. We have formulated a model by which optimization will be achieved through the development of demand curves for various products (using factual, reliable quantitative information from within the firm) and interrogating these curves for the price where profit will be maximized, taking into consideration the demand elasticity for each product, manufacturing capacity limitations and production cost factors. We have developed a computer program which can perform the numerous repetitive calculations required to optimize the various factors. This program was written, de-bugged and test problems were run to demonstrate the effectiveness of the model. Appropriate documentation supporting the computer program is provided, as well as the finished reports generated by the program.