ppxscal/embedding_network huggingface dataset:
Banyan networks for partitioning multiprocessor systems
Authors: L. Rodney Goke, G. J. Lipovski
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

This paper describes a class of partitioning networks, called banyans, whose cost function grows more slowly than that of the crossbar and whose fan-out requirements are independent of network size. Such networks can economically partition the resources of large modular systems into a wide variety of subsystems. Any possible partition can be realized by paralleling several networks or by multiplexing a single network in a manner to be described later. Results will be given indicating that a cost/performance advantage over the crossbar can be obtained for large systems and that the crossbar can, in fact, be considered a non-optimal special case of a banyan network. Inherent fail-soft capability and the existence of rapid control algorithms which can be largely performed by distributed logic within the network are also important attributes of banyans. This paper presents fundamental properties and preliminary simulation results of banyan partitioning networks. A more detailed treatment, including proofs of theoretical properties, is reserved for reference (5).
Nonpositional indexing for a relational data base
Authors: J. Philip Benkard
Venue: ACM SIGAPL APL Quote Quad (1982)

Extensions of the set of character scalars and of the domain of the INDEX function lead to use of lexical keys for nonpositional indexing of APL arrays. Using keys derived from the items of an array provides an approach to content addressing. When such keys are used to address rows of a matrix representing a relation in a relational data base, they serve as primary keys. To represent a secondary key, the matrix must be partitioned into a vector of appropriate submatrices.
Owl: An on-line consulting service
Authors: Sharon M. J. Richardson
Venue: Proceedings of the 11th annual ACM SIGUCCS conference on User services (1983)

In a university environment, computer users tend to be a dynamic group with broad consulting requirements and varying schedules. They generally have two alternatives when seeking assistance: visit the consultant or locate the appropriate documentation. Though not to the same degree, both methods suffer from the same fundamental deficiency: assistance cannot be guaranteed to the user at the most appropriate time. Sometimes the consulting office is closed and/or the required documentation cannot be found. This paper describes a program which was designed to provide interactive, on-line assistance 24 hours a day, to augment consultant services and user manuals.
EASY&mdash;an operating system for the QM-1
Authors: Charles W. Flink,  II
Venue: Proceedings of the 10th annual workshop on Microprogramming (1977)

The Emulation Aid SYstem is a virtual machine monitor for the Nanodata QM-1 microprogrammable computer. The system is designed to provide the user with an interactive interface for the development and subsequent use of emulations on the QM-1. EASY provides integrated support for: 1) interactive control of multiple, concurrently resident, virtual computers implemented via emulation, 2) input/output from emulations (virtual I/O) to the various real peripherals of the QM-1, and 3) diagnostic displays for debugging of both the emulations and the software running on the emulated computers. EASY is implemented at three distinct levels: the majority of the system software is programmed in a high-level language (SIMPL-Q); this (service) software, in turn, executes on an emulated intermediate language machine (also called EASY); the EASY machine executes as the highest priority task under a microprogrammed operating system kernel (called TASK). Via EASY the user currently has access to several previously developed emulations. EASY is the host system for ongoing emulator development at the Navy's Dahlgren Laboratory.
An improved illumination model for shaded display
Authors: Turner Whitted
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

To accurately render a scene, global illumination information that affects the intensity of each pixel of the image must be known at the time the intensity is calculated. In a simplified form, this information is stored in a tree of &ldquo;rays&rdquo; extending from the viewer to the first surface encountered and from there to other surfaces and to the light sources. The visible surface algorithm creates this tree for each pixel of the display and passes it to the shader. The shader then traverses the tree to determine the intensity of the light received by the viewer. Consideration of all of these factors allows the shader to accurately simulate true reflection, shadows, and refraction as well as the effects simulated by conventional shaders. Anti-aliasing is included as an integral part of the visibility calculations. Surfaces displayed include curved as well as polygonal surfaces.
Adaptation of the TL event list algorithm to the GASP IV simulation language
Authors: S. Hurtubise, T. Gavin, A. Girard
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

Simulation models for large systems have earned the reputation of eating up hours of computer time. This problem can be attributed in part to the fact that a significant amount of bookkeeping time is required to keep future events in their proper sequence. Many methods have been proposed to improve the efficiency of this operation but few results have been published to indicate how they perform in a real simulation environment. This paper shows how simulation time, using a particular simulation language (GASP IV), can be substantially reduced by replacing the existing filing system with a slightly modified version of a recently proposed event scheduling algorithm called the TL algorithm. Guidelines are given for the selection of the parameters of the algorithm, and also some experimental comparisons between the current GASP IV filing system and the new TL/GASP implementation.
Concurrent fault simulation and functional level modeling
Authors: M. Abramovici, M. A. Breuer, K. Kumar
Venue: Proceedings of the 14th Design Automation Conference (1977)

In this paper we discuss some of the major issues dealing with the design of a functional level concurrent fault simulator for digital net works. In the area of functional level modeling we discuss the following items: motivation; algorithms for primitives; state events; u-events; timing considerations including inertial delays; and finally the relationship between faults and functional models. For concurrent faults simulation we first discuss the various advantages of this technique, including its compatiability with function level modeling. We then present the major attributes of an abstract data structure required for this system, and then the concurrent simulation mechanism is described. Finally we discuss the problem of switching between functional and gate level models for a module.
Test generation for large logic networks
Authors: P. S. Bottorff, R. E. France, N. H. Garges, E. J. Orosz
Venue: Proceedings of the 14th Design Automation Conference (1977)

A system for automatic test pattern generation for large logic networks is described. The network to be tested is assumed to comply with a set of ground rules for testability. The system includes features for automatic subdivision of the network into easily tested sub-networks, automatic test generation programs, and a post-processor which produces a highly efficient test program. Applications to fault diagnosis, and to fast processing of design changes and variations for machine features are considered.
A hybrid CAD/CAM system for mechanical applications
Authors: J. Z. Gingerich, M. P. Carroll, E. J. Chelius, L. P. Kuan
Venue: Proceedings of the 19th Design Automation Conference (1982)

The current wire frame and surface modeling based CAD/CAM systems provide productive tools for the mechanical manufacturing industries. Volumetric modeling, distributed processing, 3-dimensional graphic displays, relational data bases, and less expensive, more powerful computers are emerging technologies sure to benefit CAD/CAM applications. The challenge of the 80's is to integrate the proven CAD/CAM techniques of the 70's with these emerging technologies. This paper addresses the issues involved in the integration by presenting the concepts of a Hybrid CAD/CAM system designed for the 80's.
A discrete event simulation of the European autovon using GPSS V
Authors: Robert J. Drazovich, Anthony Pan
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

This paper presents a description of a discrete event simulation program developed to model the European AUTOVON (AUTOmatic VOice Network) of the Defense Communication System (DCS). AUTOVON is a telephone network characterized by a relatively small size, unpredictable and often fluctuating traffic loads, and a priority structure of calls and subscribers. The network is designed for survivability and proper operation in stress conditions. This paper briefly describes AUTOVON, indicates how a GPSS model was developed of the network, explains some of the logic flows involved in the model, and discusses several of the engineering and traffic control problems addressed by the simulation. And finally, the results generated by the simulation are presented. This simulation developed has not only provided valuable analysis aid for the present AUTOVON but also proved useful in designing the monitoring and control systems for the future AUTOVON.
An introduction to the construction and verification of Alphard programs
Authors: Wm. A. Wulf, Ralph L. London, Mary Shaw
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The programming language Alphard is designed to provide support for both the methodologies of &ldquo;well-structured&rdquo; programming and the techniques of formal program verification. Language constructs allow a programmer to isolate an abstraction, specifying its behavior publicly while localizing knowledge about its implementation. The verification of such an abstraction consists of showing that its implementation behaves in accordance with its public specifications; the abstraction can then be used with confidence in constructing other programs, and the verification of that use employs only the public specifications. This paper introduces Alphard by developing and verifying a data structure definition and a program that uses it. It shows how each language construct contributes to the development of the abstraction and discusses the way the language design and the verification methodology were tailored to each other. It serves not only as an introduction to Alphard, but also as an example of the symbiosis between verification and methodology in language design. The strategy of program structuring, illustrated for Alphard, is also applicable to most of the &ldquo;data abstraction&rdquo; mechanisms now appearing.
Toward a theory of deviant word order
Authors: Dolores M. Burton
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

A theory of deviant word order has many applications to the study of literary texts. One might wish, for example, to study the development of our contemporary norm of word order or to determine the stylistic norms of word order deviance for different periods of literature (poets of today clearly use deviant word order in a manner quite different from that employed by the Elizabethans.) Certainly it would be most profitable to investigate the effect of word order on rhythm and meter. I have studied Shakespeare's word order for the purpose of tracing the difference in style between a middle-period play like Richard II and a mature piece like Antony and Cleopatra. 1
&ldquo;Towards a Theory of Recursive Processors&rdquo;
Authors: Peter Zilahy Ingerman
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

In order to define what we mean by processor, we must describe a primitive undefined processor called the initial control processor, and a primitive command which may be assumed to be executable ab initio. The initial control processor causes a statement in some other processor to be moved from the object level to the command level, and then causes the new-formed command to be executed. The primitive command which cannot be defined, but merely described, is the command append. This command is of the form &ldquo;append &Oslash1...&Oslashn to the list of acceptable commands and give them interpretations &thgr;1...&thgrn respectively&rdquo; and serves to enable the control processor to interpret new commands. The language in which the &Oslash's and &thgr/s are written is undefined; we shall refer to the initial control processor as augmented by appends as the augmented control processor.
Future of design automation (Position Paper)
Authors: P. Losleben
Venue: Proceedings of the 16th Design Automation Conference (1979)

In a field which is at least two decades old, one phenomenon remains constant. It appears that none of us can objectively describe our current status without sprinkling a little of &ldquo;what might be&rdquo; into the discussion. While we all complain about the day-to-day fire fights, we are basically forward looking, if only incrementally. Let us drop all pretense about the present then, and talk strictly about the future. It is useful to think of the future in terms of specific challenges (instead of problems).
The impact of language design on the production of reliable software
Authors: J. D. Gannon, J. J. Horning
Venue: Proceedings of the international conference on Reliable software (1975)

The language in which programs are written can have a substantial effect on their reliability. This paper discusses the design of programming languages to enhance reliability. It presents several general design principles, and then applies them to particular language constructs. Since we can not logically prove the validity of such design principles, empirical evidence is needed to support or discredit them. Gannon has performed a major experiment to measure the effect of nine specific language design decisions in one context. Analysis of the frequency and persistence of errors shows that several decisions had a significant impact on reliability.
Microcomputer access to cross software systems
Authors: Bernard J. Carey, Anne-Marie G. Discepolo
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

Downline loading involves the transferral of information from the internal memory of one computer to the internal memory of another. For development microcomputer systems utilizing cross assemblers (i.e. non-resident assemblers), downline loading provides an extremely fast method of transferring cross-assembled files into the microprocessor's memory. The design for one low-cost method of linking a microcomputer system to a larger computer for downline loading is described. In this design, the microprocessor system is viewed as a teletypewriter (TTY) type device attached to the larger computer system. Software in the microcomputer controls the physical link between the two systems and is responsible for interpreting and storing files into the internal memory of the microcomputer. The implementation of such a system for downline loading an Intel 8080 based microcomputer system from files stored on an IBM 370/VM interactive Conversational Monitoring System (CMS) is described. Hardware details of the serial link between the two systems, as well as the software required, are discussed in detail. For applications involving several microcomputer development systems, methods of downline loading among microcomputer systems are also discussed.
Critical path tracing - an alternative to fault simulation
Authors: M. Abramovici, P. R. Menon, D. T. Miller
Venue: Proceedings of the 20th Design Automation Conference (1983)

We present an alternative to fault simulation, referred to as critical path tracing, that determines the faults detected by a set of tests using a backtracing algorithm starting at the primary outputs of a circuit. Critical path tracing is an approximate method, but the approximations introduced occur seldom and do not affect its usefulness. This method is more efficient than conventional fault simulation.
Training - the key to successful systems in developing countries
Authors: J. Adderley
Venue: ACM SIGCSE Bulletin (1980)

Computers are being installed at an ever increasing rate throughout the developing world. To succeed they must be backed by skilled local manpower. The training for these skills must be provided locally. Unless this training can be provided, there can only be a tragic waste of resources and a slowing down of development. Indeed, in these circumstances the best advice that can be given is to avoid computers completely.
APL standardization
Venue: Proceedings of the international conference on APL (1983)

The Working Draft for an International Standard for the Programming Language APL is now in its fourth revision. It is the work of several national committees and many dedicated individuals. If all goes well, the document will be made available for public comment sometime in the latter half of this year [1983].
Increasing the use of APL
Authors: John W. Myrna
Venue: ACM SIGAPL APL Quote Quad (1983)

It appears that APL is used by only 5 to 10 percent of the programming population that might use it. After 15 years of commercial availability, many APL proponents find this a disappointing percentage. This paper reviews the main factors that inhibit the use of APL. It describes the factors, suggests means to overcome those factors, and gives examples of various APL systems that address the limiting factors.
An interactive routing program with On-line clean-up of sketched routes
Authors: Ola A. Marvik
Venue: Proceedings of the 16th Design Automation Conference (1979)

This paper describes a program for interactive layout of printed circuit boards (PCB) with fixed holes. The wires may be drawn as a rough sketch and will be cleaned-up conforming to the specified clearance and wire width. Also included is on-line check of spacing and crossing.
Minimum covers in the relational database model (Extended Abstract)
Authors: David Maier
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

Numerous algorithms concerning relational databases use a cover for a set of functional dependencies as all or part of their input. Examples are Bernstein and Beeri's synthesis algorithm [BB] and the tableau modification algorithm of Aho, Beeri, and Ullman [ABU]. The performance of these algorithms may depend both on the number of functional dependencies in the cover and the total size of the cover. Starting with a smaller cover will make such algorithms run faster. After Bernstein [Be75], many researchers believe the problem of finding a minimum cover is NP-complete. We show that minimum covers can be found in polynomial time, using the notion of direct determination. The proof details the structure of minimum covers, refining the structure Bernstein and Beeri show for non-redundant covers [BB]. The kernel algorithm of Lewis, Sekino, and Ting [LST] is improved using these results.
The design of a virtual machine for Ada
Authors: L. J. Groves, W. J. Rogers
Venue: Proceedings of the ACM-SIGPLAN symposium on The ADA programming language (1980)

An implementation of Ada should be based on a machine-independent translator generating code for a Virtual Machine, which can be realised on a variety of machines. This approach, which leads to a high degree of compiler portability, has been very successful in a number of recent language implementation projects and is the approach which has been specified by the U.S. Army and Air Force in their requirements for Ada implementations. This paper discusses the rationale, requirements and design of such a Virtual Machine for Ada. The discussion concentrates on a number of fundamental areas in which problems arise: basic Virtual Machine structure, including storage structure and addressing; data storage and manipulation; flow of control; subprograms, blocks and exceptions; and task handling.
Engineering processes in managing software system development
Authors: David Sung
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

The Project enviroment and human activities in developing a large scale software system are the key factors which determine the success of a project. Sequential life cycle management divides the entire development into separate phases. It is proposed that the development of each phase should proceed according to an engineering process which defines the step-by-step procedures that all software practitioners must follow. The software engineering methodologies such as top-down development, pseudo coding, design walk through, structured programming and code reading, are effectively utilized in the engineering processes. Also, incorporated in the processes are methods in project review, intergroup communication, and group spirit enhancement. This approach has been applied to the development of an information and production control system for processing Landsat data, with five steps in the detailed design phase, and seven steps in the coding and unit testing phase. Specifically, the detailed design phase includes the requirement study, requirement review, top-down design, design walk through and design documentation. The coding and unit testing phase includes the design study, study review, top-down coding, code reading, top-down testing, test evaluation and coding, and unit testing documentation. The application of these engineering processes in software system development reduces management complexities and increases productivity accordingly.
Analysis of conservational transition systems
Authors: Y. Edmund Lien
Venue: Proceedings of the ACM annual conference (1973)

Let V &equil; {A1,A2,..An} be a finite set of symbols. V* denotes the free monoid generated by V with the cummutative operator &ldquo;+&rdquo;; that is, an element in V* can be written as [equation] where ai are nonnegative integers. Let x&equil; [equation] and y &equil; [equation]. We say x &le; y if ai &le; bi for l &le; i &le; n. An element in V* &times; V*, represented by x &rarr; y, is called a transition. Given a finite set T of transitions and S &equil; [equation] some transition [equation] &rarr; [equation] can be fired if [equation] &le; S. Firing of this transition results in a new element [equation](si - ai + bi)Ai. The triple <V,T,S> is called a transition system. The notion of transition system was developed as a result of the study of Petri nets and vector addition systems.1 In this paper we study a special class of transition systems. A transition system is said to be conservational if there exists a function f:V &ran &rarr;{1,2,3...}, such that for every transition [equation] &rarr; [equation] it is true that [equation](Ai) &equil; [equation]. Termination, repetitivity, and deadlock properties of conservational transition systems are studied.
Music theory&mdash;a programming linguistic approach
Authors: Stephen W. Smoliar
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

EUTERPE is an on-line, real-time computer-music system currently in operation at the MIT Artificial Intelligence Laboratory. It was designed to enable the representation of a musical score in the format of an extended assembly language for a special-purpose parallel processor. Through this system, many conventional concepts of musicology have analogous concepts as programs or meta-programs. Thus, a programming language may be used to model a musical composition more formally than conventional musicology permits. Furthermore, such models may then be manipulated by programs which produce original compositions.