ppxscal/embedding_network huggingface dataset:
Discrete event simulation of stochastic and deterministic sequential machine models
Authors: Melvin M. Cutler
Venue: Proceedings of the 12th conference on Winter simulation (1980)

This paper presents and proves the correctness of novel techniques for the mathematical verification of simulation models against sequential machine specifications. The main idea is to say that a discrete event simulation program simulates a given sequential machine specification if and only if there exists a certain type of mapping from it to the specification. It is first shown that discrete event specifications can be realized by using the traditional formalisms of discrete time systems. Then the two main facilitating results are given. A discrete event simulation of a discrete deterministic system is shown to be a formal object whose fidelity to the system can be proved. A discrete event simulation of a discrete stochastic system is shown to be a formal object whose statistical fidelity to the system can be proved.
Some simplified performance modeling techniques with applications to a new ring-structured microcomputer network
Authors: J. Spragins, H. Jafari, T. Lewis
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

This paper presents a simplified approach to developing performance models for complex systems, such as distributed processing systems, and illustrates the approach by applying it to studying the performance of a new ring-structured microcomputer network. The approach utilizes both regression (curve-fitting) techniques and queueing theory analysis, and suggests that response times of the system studied can be closely approximated by a multiserver queueing model which is generalized to allow a noninteger number of servers. Both the approach and the approximate model developed appear to be applicable to a wide variety of systems.
Demand assigned multiple access systems using collision type request channels: Priority messages
Authors: Gagan L. Choudhury, Stephen S. Rappaport
Venue: Proceedings of the seventh symposium on Data communications (1981)

Demand Assigned Multiple Access (DAMA) schemes in which requests for communication channels are transmitted over collision type channels to a master controller and in which messages of different priorities are present is analyzed. Priority use of the request channels is achieved by having users select among those channels according to a priority dependent probability distribution. Two important schemes of this class are considered. Additionally, three schemes for priority assignment of message channels are treated; two are non-preemptive and one is preemptive. Trade offs among bandwidth utilization and delay are considered as well as optimization of system parameters.
Generalized microcomputer-based Harpoon missile simulation trainer
Authors: James V. Leonard, Herbert A. Crosby
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

A brief review of the Harpoon Missile Systems is provided showing the electrical interfaces with various command and launch systems. Each of the three major command and launch systems with their peculiarities is described. The existing Harpoon simulator and the microcomputer-based simulator are investigated. The methods to adapt one trainer to three command and launch systems are presented.
HEX: An instruction-driven approach to feature extraction
Authors: Mark Hofmann, Ulrich Lauther
Venue: Proceedings of the 20th Design Automation Conference (1983)

HEX is a general purpose geometric feature extractor with an integrated circuit layout emphasis. It differs from previous extractors in that it is process-independent and has the ability to do a simple or detailed extraction of circuit features depending on a user-provided sequence of instructions. Internally the extraction process is carried out by an &ldquo;instruction engine&rdquo;. The extractor produces an output graph showing feature connectivity and attaches extracted attributes to the feature nodes. In circuit applications the post-processed output is suitable for detailed simulation. HEX is currently in use at Siemens Corporation, West Germany.
Comments on capabilities, limitations and &ldquo;correctness&rdquo; of Petri nets
Authors: Tilak Agerwala, Mike Flynn
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

In this paper we examine the capabilities and limitations of Petri nets and investigate techniques for proving their correctness. We define different classes of nets where each is basically a Petri net with slight modifications and study the relationship between the various classes. One particular class appears to be quite powerful, with respect to its capability for representing coordinations. In the second part of the paper we establish the feasibility of using the methods of computational induction and inductive assertions to prove restricted statements about Petri nets.
HOPLA-PLA optimization and synthesis
Authors: S. Wimer, N. Sharfman
Venue: Proceedings of the 20th Design Automation Conference (1983)

A system that automates Programmable Logic Array optimization and synthesis for VLSI design is described. PLA logic is defined via a high level Hardware Definition Language. After translation to table representation comes the logic optimization phase, carried out according to a user defined optimization criterion. The geometrical optimization phase follows, supplemented by a manual interactive graphic PLA editor. The system outputs symbolic Layout of the PLA which can be translated into polygon-level layout.
ATLAS-An Automated Software Testing System
Authors: W. H. Jessop, J. R. Kane, S. Roy, J. M. Scanlon
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The Automated Testing and Load Analysis System (ATLAS) formalizes a concept of model-referenced testing for large software systems. A directed graph model of the software under test, describing the sequential stimulus-response behavior of the software system, forms the basis of the approach. The objective of ATLAS is to certify the software under test against the model. This objective is met by components of ATLAS that automatically identify, generate, apply, and verify the set of tests required to establish that the software has correctly realized the model. The system has been successfully employed in testing over 40,000 instructions of Bell Laboratories large No. 4 ESS software package. Usage data and experience from this application and a critique of the approach are given.
Certification of computer science teachers for secondary schools (Panel Discussion)
Venue: Proceedings of the 1975 annual conference (1975)

In this panel session, a number of issues related to certification will be considered. These include: the need for certification, various types of certification which might be made available, the role to be played by computer science teachers, and accreditation requirements for secondary schools teaching computer science. Experience and problems with gaining certification will be shared by panelists whose states currently offer computer science curriculum. The panel session will be the initial portion of a dialogue to be continued in the evening SIGCUE session. The presentation will center around the effort of Mankato State University, to develop a heading degree in Computer Science and get approval for that degree from the state of Minnesota. The Association for Educational Data Systems assisted in the presentation of the concept which provided professional support at the proper time. Many of the other higher educational institutes in Minnesota do now have majors in this area, following the guidelines established for Mankato State University.
An unusual application of program-proving
Authors: Mitchell Wand
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

An inductive proof in mathematics may often be expressed as an algorithm and a proof that the algorithm is correct. Especially when the proof proceeds by cases, a recursive pattern-matching language, such as Hewitt's MATCHLESS, is a felicitous language for writing the algorithm. We use this idea to prove a new mathematical result, which itself is of interest in computer science. We define objects called k-models. Our main theorem is a necessary and sufficient condition for a k-model to be the restriction of a k+1-model.
The simulation of natural phenomena (Panel Session)
Authors: James Blinn, Julian Gomez, Nelson Max, William Reeves
Venue: Proceedings of the 10th annual conference on Computer graphics and interactive techniques (1983)

This panel will discuss the issues and the problems associated with the simulation of natural phenomena. This is a difficult area of research since it generally involves complex data bases and in many instances time variant phenomena. The computational loads can become enormous as one considers the physics or the mathematical modeling of structures. Most items in nature, trees, clouds, fire and comets being some examples, have not been displayed realistically in computer graphics. This lack stems from a few different problems, all of which are significant. The first is the fact that realistic portrayals require large amounts of storage and consequently large compute time. Nature is able to create diverse detail at the most minute levels within an object of grandoise scale. The second problem is that of diversity of design within a given framework. For example, if a scene requires two dozen poplar trees, how does the designer construct trees that look different but are undeniably poplars? Humans typically become tired after the first few iterations of such a design process, with a resulting degradation in the subsequent models. Clearly, this problem applies to all of the phenomena mentioned above. Finally, there is a lack of models. First, second and third order representations are commonly used in computer graphics to model various kinds of surfaces and their boolean combinations. However, their applications to objects, which do not lend themselves well to being described as surfaces has not been addressed sufficiently. Previous attempts at realism have dealt with the appearances of the surfaces being modeled, in terms of their illumination or relief. More recently, fractal methods have introduced a new degree of realism into terrain modeling systems. However, it appears that natural phenomena will require more research into the fundamental way things occur in nature, and in terms of computer graphics, their representation will build on previous work, but will still require new modeling techniques.
Finding extremal polygons
Authors: James E. Boyce, David P. Dobkin, Robert L.(Scot) Drysdale,  III, Leo J. Guibas
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

Given n points in the plane, we present algorithms for finding maximum perimeter or area convex k-gons with vertices k of the given n points. Our algorithms work in linear space and time O(knlg n + n lg 2n). For the special case k -&-equil; 3 we give O (nlgn) algorithms for these problems. Several related issues are discussed.
Remote job entry and output through APL
Authors: Uday G. Gujar
Venue: Proceedings of seventh international conference on APL (1975)

The power of interactive computing and especially of APL is already well recognized. Some limitations and inconveniences of processing a job through batch can at least partially be offset by providing a similar processing capability for O.S. jobs from an APL terminal. This paper describes such a facility. The system, called RJE/RJO, is first described from the APL user's point of view. The later portion of the paper discusses the system design and implementation. The facility, which has satisfied the needs of a number of users, has been used under APL/360 and is currently being used under APLSV.
Circuit realization of binary functions using threshold devices
Authors: Edward P. Stabler
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

This paper will be concerned with digital circuit synthesis using a theoretical model of a threshold device as the fundamental building block. It will be shown that the model may be made to behave as an AND gate or an OR gate and in addition that a fairly wide variety of functional behavior may be exhibited by these simple models.
Adding and using structure in general arrays
Authors: J. Philip Benkard
Venue: ACM SIGAPL APL Quote Quad (1981)

Examples of pre-APL general arrays suggest uses for APL II. Two structure-creating functions are proposed. Using numerical or logical control arguments, they partition a level of an array regularly or irregularly, with or without reuse of items. The resulting arrays reduce string search to item search in two distinct ways. They can be used on arrays of any rank to simplify search for abstractly defined patterns of relationships between nearby elements or to construct a tessellation by repetition of a given pattern. The relationships between these techniques and programming techniques using operators is noted. Formal identities relate the two proposed functions to APL I functions and to each other.
Scheduling in systems with two scarce resources
Authors: E. D. Lazowska, K. C. Sevcik
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Few optimality results have been reported for the scheduling of computer systems with more than one resource. This paper considers a system with two independently-scheduled scarce resources, which may be thought of as a CPU and an I/O channel, and two active programs with distinct service burst time characteristics. Schedules requiring preemption no more frequently than when a program requests service at a resource are shown to be sufficient to achieve maximum average utilization (the unweighted average of the utilizations of the two resources). A rule that specifies schedules of this form when applied at both resources is defined and proven optimal. Finally, the more general problem of maximizing weighted utilization is treated.
PL/I in the computer science curriculum
Authors: J. Mack Adams, William H. Inmon, Jim Shirley
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

Two questions perpetually arising within Computer Science Departments are (1) whether or not the programming languages stressed in the academic programs are appropriate and (2) whether the correct emphasis is being placed on one language as opposed to another. In particular, one always wonders if any emerging and promising language is receiving enough attention. Attempts at answering such questions seem to provide quite suitable vehicles for student involvement in curriculum development and so recently at New Mexico State University a combined faculty-graduate student study was made for one important appropriate language, PL/I.
State of the art issues in distributed databases (Panel session): Site autonomy issues in the R@@@@ distributed database system
Authors: P. Selinger
Venue: Proceedings of the ACM '81 conference (1981)

It is desirable to have a Distributed Database Management System (DDBMS) whose behavior and control is as identical as possible to that used in single site database management systems. We call this notion site autonomy. Preserving the autonomy of sites which join a DDBMS network is essential to the peace of mind of its managers and users, and more technically, is essential in an environment where sites and communication lines fail. To achieve resilience to failures of sites and communication lines (these are indistinguishable from one site's viewpoint), there can be no reliance on centralized functions or services. This means no global dictionary, no global information collector for deadlock detection, and no broadcast of local events such as file creation or addition of a new site. Aside from these prohibitions, this goal of site autonomy also implies that sites should perform their own compilation, their own binding of print names to internal names, their own decomposition of compound objects (such as relational views), and their own authorization checking. This talk discusses the concept of site autonomy in further detail and discusses several specific issues on which the site autonomy philosophy has an impact.
Pipelined microprogrammed control of a real-time signal processor
Authors: D. D. Lynch, L. W. Tower
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

The design of a pipelined microprogrammed controller for a real-time signal processor is described. The signal processor has an arithmetic functional unit with four multipliers and four adders, eight general-purpose registers, 16 index registers, a program memory, and a number of data memories. To realize the full potential of the four multiplers, it is necessary to overlap operations such as instruction fetch, operand fetch, instruction execution, and result store. This overlap requirement and the desire for a flexible instruction set led to the development of a pipelined microprogrammed controller. The controller operates by decoding encoded instructions at each stage in the instruction pipe. Decoded microprogram instructions can modify encoded instructions as they propagate down the instruction pipe. To decrease the width of both machine instructions and micro-instructions, the control function is shared by a small number of global control registers.
Simulation of a network manufacturing process
Authors: Wayne J. Oates, Susan H. Antle
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

A GPSS model was developed to simulate the flow of parts through the stages of a network manufacturing process. The general network consists of M sequential stages, with a variable number of machines per stage. Parts can be processed on any of the Ni machines at stage i, and different types of parts may be mixed within a single machine. The simulator is used to evaluate scheduling policies proposed for each stage of the process. Scheduling policies to be considered are first in-first out (FIFO), last in-first out (LIFO), minimum process time, maximum process time, random, and priority.
A general method for locally optimal search
Authors: Allen J. Friedman
Venue: ACM SIGAPL APL Quote Quad (1979)

This paper describes a general search procedure for finding a best member of a large discrete set of solutions. The Traveling Salesperson Problem illustrates how the method is used. Two APL functions contain the core of the method. NEXTSET implements the user's definition of the neighborhood of a solution while WHATNOW expresses the search strategy to be employed. WHATNOW can incorporate any calculations, or system or session parameters available to the function as the search progresses, and it passes its determination on to NEXTSET which dynamically expands and contracts the scope of the search.
AIDS, APL integrated-circuit design system
Authors: Paul Penfield,  Jr.
Venue: ACM SIGAPL APL Quote Quad (1981)

AIDS is a programming-based language for denoting integrated-circuit mask art-work. In this language, drawings are denoted using supplied APL functions that return graphical objects or collections of them. Although these functions can be invoked interactively, the recommended procedure is to denote an overall drawing as a defined APL function with calls to the AIDS functions. Then executing the function produces the numerical data that represents the drawing, listing the function documents the design, and editing the function changes the design. Of course the function can call other user-defined functions, and the hierarchy of a design can be so expressed, using the normal APL function conventions.
Modeling for synthesis - the gap between intent and behavior
Authors: Gerald Estrin
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

Aside from the continuing critical inputs of UCLA faculty and students SARA has been affected by [CLE74]; the work of the MIT Information Structures Group, Carnegie-Mellon studies, the Case-Western Reserve LOGOS project, Petri Net studies, the growing literature on structured programming and work on program verification. The body of this paper presents the highlights of our synthesis methodology, the set of primitives used by modeling tools in SARA and a fast look at the design procedure proposed to support the methodology.
Application design within the system for business automation (SBA)
Authors: S. Peter de Jong, Moshé M. Zloof
Venue: Proceedings of the 12th Design Automation Conference (1975)

The system for business automation provides a new design methodology with which business applications can be automated by non-professional programmers onto a computer. This methodology retains the users manual perception of his application, it allows a gradual automation of the application, each application within a business system can be designed with only local knowledge of the business, and frames of reference are provided within which the application is designed.
Efficient mapping of algorithms to single-stage interconnections
Authors: Robert H. Kuhn
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

In this paper, we consider the problem of restructuring or transforming algorithms to efficiently use a single-stage interconnection network. All algorithms contain some freedom in the way they are mapped to a machine. We use this freedom to show that superior interconnection efficiency can be obtained by implementing the interconnections required by the algorithm within the context of the algorithm rather than attempting to implement each request individually. The interconnection considered is the bidirectional shuffle-shift. It is shown that two algorithm transformations are useful for implementing several lower triangular and tridiagonal system algorithms on the shuffle-shift network. Of the 14 algorithms considered, 85% could be implemented on this network. The transformations developed to produce these results are described. They are general-purpose in nature and can be applied to a much larger class of algorithms.
A Technique of Mathematical Expression Structure Analysis for the Handwriting Input System
Authors: Ryoji Fukuda, I Sou, Fumikazu Tamari, Xie Ming, Masakazu Suzuki
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

In this paper, we propose a new practical user interface to input mathematical expressions into computer, using a data tablet or an electron board. The system recognizes mathematical expressions of high school level (until the first year of university), and the results are output in L A T E X-source format.For the character recognition, we use 3 _ 5-mesh directional element feature and some additional features which are robust against the distortion. As for the segmentation of characters and the structure analysis of mathematical expressions, our method is considerably robust against the touching of characters and the deviation of positions in the wide range.
Operators and uniform forms
Authors: Douglas J. Keenan
Venue: ACM SIGAPL APL Quote Quad (1979)

A syntax for operators is formally defined. This formalization permits an extension to current operators and the introduction of new operators, two of which are proposed. The new operators, in conjunction with generalized uniform forms, are shown to have great power, allowing, among other things, easy manipulation of nested arrays.