ppxscal/embedding_network huggingface dataset:
Toward a parametric approach for modeling local area network performance
Authors: Peter S. Mager
Venue: ACM SIGMETRICS Performance Evaluation Review (1982)

The task of modeling the performance of a single computer (host) with associated peripheral devices is now well understood [Computer 80]. In fact, highly usable tools based on analytical modeling techniques are commercially available and in widespread use throughout the industry. [Buzen 78] [Buzen 81] [Won 81] These tools provide a mechanism for describing computerized environments and the workloads to be placed on them in a highly parameterized manner. This is important because it allows users to describe their computer environments in a structured way that avoids unnecessary complexity. It also is helpful in facilitating intuitive interpretations of modeling results and applying them to capacity planning decisions. A first step toward building a modeling tool and associated network specification language that allows straightforward, inexpensive, and interpretable modeling of multi-computer network performance is to identify the set of characteristics (parameters) that most heavily influence that performance. The result of such a study for the communication aspects of local area networks is the subject of this paper.
The Hughes Automated Layout System - automated LSI/VLSI layout based on channel routing
Authors: G. Persky, C. Enger, D. M. Selove
Venue: Proceedings of the 18th Design Automation Conference (1981)

The Hughes Automated Layout System (HAL) is intended to provide fast, accurate, and efficient layout of LSI/VLSI circuits. The HAL development plan calls for an evolutionary development in three phases, with each phase providing a usable design system. HAL(I) is limited to standard cell layout and is now operational. HAL(II), which will permit more complex geometries, and HAL(III), which will add hierarchical capabilities, are in initial development. This paper discusses the features of HAL(I), and the concepts of decomposition and ordering of routing domains that underlie the more advanced systems.
The synthesis of algorithmic systems
Authors: A. J. Perlis
Venue: Proceedings of the 1966 21st national conference (1966)

On what does the fame of Turing rest? That he proved a theorem showing that for a general computing device -later dubbed a &ldquo;Turing machine&rdquo;&mdash;there existed functions which it could not compute? I doubt it. More likely it is because of the model he invented and employed: his formal mechanism. This model has captured the imagination and mobilized the thoughts of a generation of scientists. It has provided a base for arguments leading to theories. His model has proved so useful that its generated activity has been distributed not only in mathematics, but through several technologies as well. The arguments employed were not always formal and the consequent creations were not all abstract. Indeed a most fruitful consequence of the Turing machine has been with the creation, study, and computation of functions which are computable, i.e., in computer programming.
Applications of error data in software error model validations(Presentation Abstract)
Authors: Alan Sukert
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

An in-house study was performed by RADC between August 1974 and May 1978 to validate the predictions of several mathematical models for predicting the reliability and error content of a software package. This study used actual software error data that had been extracted from the formalized testing phases of four large software development projects encompassing command and control, avionics and radar control applications. Model predictions were compared on a project vs. project basis, as well as on an intra-project basis using total system, error criticality and functional subsystem categorizations. The results of this empirical analysis will be discussed in terms of the conclusions that were tentatively drawn as to potential model applicability. Results will also be discussed in terms of the error data available and the techniques used to extract the necessary information for input into the analyzed models.
Key extraction by image differentiation
Authors: T. Mitsunaga, T. Yokoyama, T. Totsuka
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

Key extraction is an inverse problem of finding the foreground, the background, and the alpha value from an image and some hints. Although the chromakey solves this for a limited case (single background color), this is often too restrictive in practical situations. When the extraction from an arbitrary background is necessary this is currently done by a time consuming manual task. To solve the problem, an algorithm must address the unique requirements of the key extraction: high resolution, analytically correct alpha values, and easy human interaction. We present an image differentiation method which, for the first time, fulfills these requirements.
A pay-per-program television network simulation model
Authors: Paul J. Kuzdrall, James E. Hatch, Roger A. More
Venue: Proceedings of the 12th conference on Winter simulation (1980)

This paper describes a simulation model which was constructed to evaluate the financial implications of a national pay-per-program television network. The model is currently being used to explore a number of consumer price/content scenarios prior to introduction and selection of a pay-per-program or pay-per-channel system. It affords the user a laboratory in which to test key marketing and financial assumptions and evaluate the consequences of their outcome measured in terms of revenue and cost. The paper outlines the structure of the model and the reports it generates, multiple uses for the model and the levels of disaggregate reporting for the simulated pay television network.
On the use of syntax-based translators for symbolic and algebraic manipulation
Authors: S. R. Petrick
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

In this paper two w ell known formalisms, due to Irons and Knuth, for mapping syntactic tree structures into appropriate target strings or structures are considered. Their utility as general purpose tools for symbolic and algebraic manipulation is illustrated by applying them to a symbolic differentiation exercise. A few of the existing syntax-based translation systems and the uses to which they have been put are discussed. Finally, attempts to mathematically model syntax-based translators are reviewed.
Design For Test Calculus: An algorithm for DFT rules checking
Authors: Dilip K. Bhavsar
Venue: Proceedings of the 20th Design Automation Conference (1983)

A new one-pass algorithm for checking networks for compliance to a set of Design for Test (DFT) rules is presented. The algorithm is based on a &ldquo;Design For Test Calculus&rdquo; which defines various types of signals and nodes in the network, signal sets attached to node's inputs and outputs, and rules for transferring signal sets through nodes. The rule checking is accomplished by examining the characteristic contents of the signal sets transferred. The calculus is capable of handling a wide variety of &ldquo;test point flip-flops&rdquo; and test access schemes, and has features that make hierarchical rule checking feasible.
Professional ethics and simulation
Authors: John McLeod
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

The increasing use of simulation studies as adjuncts to decision-making imposes an increasing responsibility on the part of modelers and analysts to determine and disclose to the decision-maker the extent to which information derived from the studies is valid and applicable to the decision of interest. This raises ethical problems concerning the selection of input data and the professional judgment of the modeler and analyst as well. These problems involve the selection of data, the modeler's interpretation of the dynamics of the system modeled, and his or the analyst's interpretation of the results. Such situations put a severe strain on the professional ethics of all involved. This paper discusses the problem and offers suggestions as to how it might be alleviated.
A high order language optimal execution processor Fast Intent Recognition System (FIRST)
Authors: S. C. Schroeder, L. E. Vaughn
Venue: Proceedings of the ACM-IEEE symposium on High-level-language computer architecture (1973)

The history of digital computers represents a twofold development toward the common goal of harnessing &ldquo;electronic energy&rdquo; to solve human problems. On the one hand we have the hardware designers producing faster, cheaper, more versatile computers to execute larger, more complex programs. On the other hand we have the software designers generally producing faster, cheaper, and more versatile languages, compilers, operating systems, and application software with which to program these larger, more complex problems. It is only recently that timesharing and interactive systems have begun to bridge the hardware-software generation gap. This paper describes a system which is intended to eliminate the gap by providing a computer which directly executes a powerful language - APL - in a highly efficient manner. The programmer and machine communicate entirely in APL with a fully interactive timesharing operating system integral in the design. In particular this paper focuses on the execution aspects of the computer and relates results obtained by emulating the main processor to conventional computer approaches.
A powerful but simple editor based on APL
Authors: Norman Brenner
Venue: ACM SIGAPL APL Quote Quad (1983)

An experimental full screen editor has been written in APL for IBM 3270 display terminals, based on the following principles: &bull; a small command repertoire, based on APL syntax &bull; an undo facility for correcting mistakes &bull; internal dependence upon a small number of editing primitives As written, the editor contains two major commands, thirteen minor commands, and permits all of APL for a macro language. The internal primitives are Erase, Insert Gap, Overlay and Find.
From zero to sixty in seven months: Managing the change to a new computer system
Authors: Terry A. Ward
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

A NEW SYSTEM ?! The very words strike fear into even the most hardened of user consultants. Such is the nature of system implementation and conversion that even grown analysts have been known to prefer the job of IBM JCL debugger to that of managing the change to a new (and heaven forbid), another manufacturer's mainframe. This presentation will outline some of the steps taken at the University of Northern Iowa to make the transition from one computer system (HP-2000) to another (Harris 800). Before I begin, I must clear up some common misconceptions: we are the University of Northern Iowa. Mail addressed to Ohio or Idaho is not likely to reach us; and yes, there are three state universities in Iowa!
Introducing programming concepts with graphical objects
Authors: Nadia Magnenat-Thalmann, Daniel Thalmann
Venue: Proceedings of the eleventh SIGCSE technical symposium on Computer science education (1980)

It is more attractive for students to learn programming concepts like control structures, data structures or recursion by the means of examples based on graphical objects. The use of a graphical PASCAL extension is a well-suited way of realizing this goal. In particular, we emphasize the use of interactive graphical input-output, graphical types and data structures bases on graphical types. Typical examples are arrays of circles or linked lists of figures entered by the student.
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)
Authors: E. Cardoza, R. Lipton, A. R. Meyer
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

The uniform word problem for commutative semigroups (UWCS) is the problem of determining from any given finite set of defining relations and any pair of words, whether the words describe the same element in the commutative semigroup defined by the relations. The effective decidability of this classical algebraic problem was first explicitly noted by Malcev [1958] and Emilichev [1958], though in retrospect this result can be seen to be contained in the earlier work of K&ouml;nig [1903] and Hermann [1926] on polynomial ideals.
The Micro8 microcode assembler
Authors: Kenneth F. Greenberg
Venue: Proceedings of the 14th annual workshop on Microprogramming (1981)

This paper describes Micro8, a commercially-available microcode assembler written in ISO standard Pascal to enhance portability. Micro8 is designed to be a useful tool for both bit-slice and discrete logic designs. Considerable flexibility in definition of the microinstruction is provided to support both vertical and horizontal microwords. Debugging assistance is included in the form of a symbol cross reference listing, a map of control store locations, and diagnostic messages. Various features provided by the assembler are described, as are examples of typical microprogram sections.
MIMD machine communication using the augmented data manipulator network
Authors: Robert J. McMillen, Howard Jay Siegel
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

There have been many multistage interconnection networks proposed in the literature for interconnecting the processors that comprise large parallel processing systems. In this paper, the use of a multistage network in the MIMD mode of operation is considered. A tag based routing scheme is proposed for the Augmented Data Manipulator network. Also included is a rerouting scheme that allows a message blocked by a busy link in its present path to dynamically make use of a non-busy link and continue, when possible. Finally, a tag based broadcasting scheme is introduced that allows one processor to send messages to a power of two other processors.
A predictor for success in an introductory programming class based upon abstract reasoning development
Authors: Ricky J. Barker, E. A. Unger
Venue: ACM SIGCSE Bulletin (1983)

The purpose of this study was to create and validate a tool which could be administered to students enrolled in or considering enrollment in an introductory programming course to predict success in the course or alternatively to segregate enrolled students into fast and slow paced sections. Previous work which met the criteria of a self contained predictive tool included the work of Barry Kurtz [5] of the University of California, Irvine using abstract reasoning development as the predictive measure. The test Kurtz developed had been tested only on a small sample (23 students) in a controlled environment (one instructor - the researcher) and the test required up to 80 minutes to complete. This study modified the Kurtz test to require 40 minutes and administered it to 353 students learning two different languages from a variety of instructors. This predictor successfully predicted the advanced students from average to below average students. When used in conjunction with other known factors, e. g., GPA, the authors feel it is a viable tool for advising and placement purposes.
Computing personnel: Changes in the workplace
Authors: Fred A. Gluckson
Venue: Proceedings of the 1979 annual conference (1979)

This session will concentrate on computing people and how they have been affected by the decade of the 1970's. The decade began on a sour note. In 1970 the Aerospace industry was coming down from a high, a recession was afoot in the land, and the Los Angeles Chapter of ACM conducted a seminar to help the displaced programmer. Since then our economy has followed a rocky course, with peaks and valleys in the Gross National Product. Indeed, economics dominated the news in the 1970's. But computer people fared better than others. A growing shortage of qualified staff exerted upward pressure on salaries. The Federal restrictions on merit increases made it difficult for experienced programmers to keep up with new hires. This is just one dilemma faced by systems managers in the decade of the 1970's.
Teaching beyond elementary APL to applications users: Principal author
Authors: Anne Kellerman, Jeanine Meyer
Venue: Proceedings of the sixth international conference on APL (1974)

Instructional efforts to achieve a higher quality of APL usage are needed. Six possible areas of instruction are cited: program design, styler and debugging; thinking in APL; sophisticated APL techniques; advanced subsets suitable for specific disciplines; new APL software features and hardware devices; and advanced uses of program packages exclusively or in conjunction with user-defined functions and/or data bases. General heuristic principles and outlines as well as specific classroom exercises are provided for potential teachers of APL in the above areas.
A deterministic simulation model for scheduled airline fleet maintenance
Authors: Alan J. Parker
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The system described by the simulation is the operation and scheduled maintenance of a fleet of fifty Boeing 727 aircraft. Sixty airports are serviced with a total of 286 flights a day. The model concentrates on scheduled (periodic) maintenance set by FAA specifications. This encompasses fifty percent of all maintenance work. The major focus of the results, at the tactical level, is on the utilization of flying hours between the various maintenance checks At the strategic level, the model can answer many questions, such as the impact of moving and closing maintenance bases and the effect of changing the number of spare aircraft.
The problems of computer-assisted animation
Authors: Edwin Catmull
Venue: ACM SIGGRAPH Computer Graphics (1978)

In the last few years several systems have been written for aiding in the conventional two-dimensional animation process. The main purpose of these systems has been to let the computer produce missing drawings based on extreme drawings produced by animators. While there has been some success and a great deal of optimism, the promise of higher output and quality using a computer has not been realized. The transition from simple drawings optimized for use on the computer to the complicated and detailed drawings of quality conventional animation has been much harder than expected. The principle difficulty is that the animators drawings are really two dimensional projections of three dimensional characters as visualized in the animators head, hence information is lost, ie. one leg obscures another. The problem of making a program infer the original object from its projections is akin to extremely difficult artificial intelligence problems. Efforts to overcome this by drawing skeletons or increasing the number of overlays require more manual intervention thereby offsetting the gains of using the computer. One way to analyze an approach is to determine the average time required of an artist or operator at all stages of animation for every frame. A second problem not generally recognized is that a production animation system requires the management of hundreds of thousands of drawings, hence data base management techniques not normally found in experimental animation systems.
A study of protocol analysis for packet switched network
Authors: K. Tsukamoto, T. Itoh, M. Nomura, Y. Tanaka
Venue: Proceedings of the seventh symposium on Data communications (1981)

Communication failures may occur because of residual hardware or software implementation flaws, operator errors, transmission noises and transient or permanent machine failures. For packet switched network operation, some means are necessary to detect the errors and to analyze the phenomena to identify the causes of the errors, since, generally, it is almost impossible to predict errors or to implement systems without errors or failures. This paper describes general aspects of communication protocol analysis, protocol analysis technologies for CCITT X.25 and the protocol analyzer to be used in DDX packet switched network operation.
Review of the workshop on computer architecture education
Authors: George Rossmann
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

This paper reviews the presentations and discussions of the participants in the Workshop on Education and Computer Architecture held in Atlanta, Georgia on 30 August 1973.
On some families of languages related to the Dyck language
Authors: Maurice Nivat
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

We recall that the Dyck language on the alphabet of 2n letters X &equil; {x1,...,xn,&xmarc;1,...,&xmarc;n} is the equivalence class of the empty word 1 &egr; X@@@@ modulo the Thue congruence generated on X@@@@ by the 2n relations xi&xmarc;i &equil; &xmarc;ixi &equil; 1 i &egr; {1,...,n}. Indeed for all n &egr; X@@@@ the equivalence class of n modulo this congruence is a non ambiguous algebraic (ie. context-free) language, the complement of which is also a non ambiguous algebraic language. The same situation is true for the congruence generated on X@@@@ by the n relations xi&xmarc;i &equil; 1 i &egr; {1,...,n}. The author convinced himself that many other congruences have the same property [Ni 1], and undertook the task of finding them systematically. Here is presented a part of the results of this undertaking. An important family of congruences is brought to light which have interesting decidability properties: in the constructions leading to these decidability properties we used as a guide line the nice paper of Mac Naughton [McN]. Sufficient conditions are given in order that the equivalence classes (and their complements) of such a congruence be an algebraic language. We do not study in this paper the properties of these languages, this will be done elsewhere [Ni 2].
New languages from old: The extension of programming languages by embedding, with a case study
Authors: Michael B. Feldman
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Embedding is the extension of a programming language without altering the processor for that language, and preferably using only the facilities of that language. While a single subroutine is the simplest form of semantic extension by embedding, embedding can produce powerful application-oriented languages (AOL) in a relatively economical fashion. A first approximation to a design discipline for writing embedded AOLs is presented. SNOBOL4 is discussed as a particularly receptive host language, in that it has flexible subroutine, data-structure, and storage allocation facilities, has a run-time compiler which can be called from a SNOBOL4 program, and is widely available for almost all research computer systems. A description is given of AUTOMAT, a SNOBOL4-embedded AOL for classroom or research experiments with abstract sequential machines. The generalized transition table is introduced as a data structure in which finite-state machines (FSM), Turing machines, pushdown automata, and the like can be represented as special cases. Data structures for sets, partitions and covers, sparse matrices, and tapes are provided as well. The AUTOMAT AOL currently includes over 100 operators developed according to the proposed method. Applications thus far include an extensive FSM utility system, universal simulators for FSM and other models, FSM minimization, and Krohn-Rhodes decomposition. Performance statistics are presented.