ppxscal/embedding_network huggingface dataset:
A communication structure to implement a multi-microprocessor computer architecture
Authors: George N. Arnovick, Robert L. Britton
Venue: Proceedings of the 1975 annual conference (1975)

From the results of research dealing with the overall system architecture of a nodal processor system, a major problem was the way in which nodes (individual) processors can effectively communicate with each other. This paper presents a proposed communications method for a set of interconnected micro-processors. The proposed communication system provides for a multitude of communication buses and the ability for simultaneous direct communication between all microcomputers connected to the same communication bus, which would be a single wire. Also any microcomputer within this structure can select to communicate over three different orthogonally arranged buses. To make this possible a special transmitter receiver circuit must be associated with each microcomputer. Although only one physical wire makes up an individual communication path, simultaneous direct communication is possible among any combination of microcomputers connected to a bus by phase modulation of individually selected binary orthogonal waveforms (Walsh Functions) generated by the special communications circuit. The information is separated in sequency [@@@@] instead of in space. Each microcomputer must be programmed with the information as to what sequencys of Walsh Functions are to be used to transmit or receive information at specific times. The general geometric arrangement for this communication structure would be somewhat similar to that of a three-wire three-dimensional core memory, where in this case microcomputers and their associated memorys would be located geometrically analogous to where the cores are located in a core memory. Such a computer structure is completely homogenous thus offering high reliability and also provides the capability for a high degree of parallelism when computing.
A combinatorial problem which is complete in polynomial space
Authors: Shimon Even, R. Endre Tarjan
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

We consider a generalization, which we call the Shannon switching game on vertices, of a familiar board game called HEX. We show that determining who wins such a game if each player plays perfectly is very hard; in fact, it is as hard as carrying out any polynomial-space-bounded computation. This result suggests that the theory of combinatorial games is difficult.
A computer simulation model of driver vision while merging from a freeway on-ramp
Authors: Kumares C. Sinha, Philip H. DeCabooter
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This paper is concerned with the development of a digital simulation model for use as a tool in the analysis of the visual quality of a freeway on-ramp.
Computability and completeness in logics of programs (Preliminary Report)
Authors: D. Harel, A. R. Meyer, V. R. Pratt
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

Dynamic logic is a generalization of first order logic in which quantifiers of the form &ldquo;for all &khgr;...&rdquo; are replaced by phrases of the form &ldquo;after executing program &agr;...&rdquo;. This logic subsumes most existing first-order logics of programs that manipulate their environment, including Floyd's and Hoare's logics of partial correctness and Manna and Waldinger's logic of total correctness, yet is more closely related to classical first-order logic than any other proposed logic of programs. We consider two issues: how hard is the validity problem for the formulae of dynamic logic, and how might one axiomatize dynamic logic? We give bounds on the validity problem for some special cases, including a &Pgr;02-completeness result for the partial correctness theories of uninterpreted flowchart programs. We also demonstrate the completeness of an axiomatization of dynamic logic relative to arithmetic.
Topological routing of multi-bit data buses
Authors: G. Persky, L. V. Tran
Venue: Proceedings of the 21st Design Automation Conference (1984)

In LSI and VLSI layout, certain categories of signal nets, e.g. critical nets, power buses and data buses, require special attention during routing. In data bus routing the goal is to maximize the commonality of the routing paths comprising the bus, without unnecessarily lengthening individual routing paths. A topological data bus router has been implemented in the Hughes Automated Layout system and is the subject of this paper.
Distributed algorithms for synchronizing interprocess communication within real time
Authors: John Reif, Paul Spirakis
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

This paper considers a fixed (possibly infinite) set &pgr; of distributed asynchronous processes which at various times are willing to communicate with each other. We describe probabilistic algorithms for synchronizing this communication with boolean &ldquo;flag&rdquo; variables, each of which can be written by only one process and read by at most one other process. With very few assumptions (the speeds of processes may vary in time within fixed arbitrary bounds, and the processes may be willing to communicate with a time varying set of processes (but bounded in number), and no probability assumptions about system behavior) we show our synchronization algorithms have real time response: If a pair of processes are mutually willing to communicate within a constant time interval, they establish communication in that interval, with high likelihood (for the worst case behavior of the system). Our communication model and synchronization algorithms are quite robust. They are applied to solve a large class of real time resource synchronization problems, as well as real time implementation of the synchronization primitives of Hoare's multiprocessing language CSP.
The Development of Hierarchical Visual Languages
Authors: G. Costagliola, F. Ferrucci, G. Polese, G. Vitiello
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

The development of a visual language requires a specification of its syntax and semantics and the implementation of a visual environment which embeds it. In the present paper we describe VLCC, a graphical system for the automatic generation of visual programming environments. We show that the system is able to support the development of complex real world visual languages which exhibit hierarchical aspects, such as State-charts and UML notations.
The nested rectangular array as a model of data
Authors: Trenchard More
Venue: ACM SIGAPL APL Quote Quad (1979)

Data, like electricity and gravity, are part of the world in which we live. Some occur naturally, as in the genetic code, while most occur as a consequence of language and social organization. The search for a theory of data, which begins with the choice of a model, is as important and interesting as the development of theories in physics, economics, and psychology. Most models of data are collections, such as the unnested array of APL, the one-axis nested list of LISP, and the set, which is nested but lacks the properties of order, repetitions, type, and multiple axes inherent in rectangular arrangement. Nested rectangular arrays have all these properties. The existence of simple, universally valid equations in both set theory and linear algebra suggests that equally simple equations may hold for all arrays. The principles of nested collections developed in set theory apply with few changes to the nesting of arrays. A one-sorted theory of arrays, in which type is preserved for empty arrays, provides an algebra of operations interpreted not only for data but also types of data.
SIMPAS: A simulation language based on PASCAL
Authors: R. M. Bryant
Venue: Proceedings of the 12th conference on Winter simulation (1980)

SIMPAS is a portable, strongly-typed, event-oriented, discrete system simulation language based on PASCAL. It has most of the useful features of SIMSCRIPT II.5. However, because of the type checking inherent in SIMPAS, a SIMPAS program is easier to debug and maintain than the corresponding SIMSCRIPT II.5 program. This paper briefly describes SIMPAS and discusses the advantages of using SIMPAS instead of SIMSCRIPT II.5 for the rapid construction of reliable simulation programs.
Evaluation of polynomials with super-preconditioning
Authors: Richard J. Lipton, Larry J. Stockmeyer
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

In an effort to understand the complexity of arithmetic computation, a number of researchers [1,5,7,8,9,11] have studied the following question: Given a polynomial f(x), Find a minimal cost straightline program that computes f(x).@@@@ In this paper this question is generalized to the following question: Given a polynomial f(x) and an operator &Dgr; that maps polynomials to sets of polynomials, Find a minimal cost straightline program that computes some h(x) &egr; &Dgr;(f(x)).
An interactive drafting system based on two dimensional primitives
Authors: G. Cosmai, U. Cugini, P. Mussio, A. Napolitano
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes an interactive drafting system based on two dimensional primitives and logic operators. A special attention is given to the ways of interaction derived from the analysis of the usual drafting procedures.
Hardware monitoring of real-time aerospace computer systems
Authors: D. R. Partridge, R. E. Card
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

Hardware monitoring has proven to be a useful means for measuring the performance of computer systems generally, and is particularly attractive for use on real-time systems due to its attribute of non-interference with system operation. This technique is uniquely able to quantify precisely the interactions between hardware and software, which must be completely understood in these systems. In this paper, we report the application of a commercially-developed hardware monitor to two real-time computer systems. The first was an airborne computer whose basic task was radar data processing. The second system was a more powerful shipboard computer which included a unique, extensive internal performance data gathering facility. The objectives of these projects were to answer several specific performance questions, to demonstrate techniques for software verification and performance enhancement, and to obtain data for system modifications and future designs. A variety of measurements were employed to meet these objectives. They are described in the paper together with our rational in selecting them, typical measurement results, and a discussion of the measurement significance. We found that, while our monitor provided much valuable data, it was not completely sufficient for our purposes. We therefore developed special-purpose hardware to augment the monitor and this combination has been quite successful. Of our various measurements, software event traces were found to be most valuable for system verification and problem diagnosis. The internal data gathering hardware in one of the monitored systems proved convenient to use and powerful as well.
Simplification of CNC programming for PWB routing
Authors: J. Drier
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper did not arrive in time to be included in this proceedings.
Automated design of open web steel joists
Authors: Albert D. M. Lewis
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

A computer program has been developed for producing automatically the set of approximately 200 open web steel joist designs required by a fabricator. Chord members are assumed to be cold formed from steel strip. An objective of the design process is to minimize the total steel requirements of the fabricator while keeping to a reasonable number the different sizes of steel strip which must be stocked. Output information includes chord member sizes and properties, web and end diagonal rod sizes, weld proof loads, maximum loads permitted by deflection limitations, and joist weights for various span lengths. Detailed documentation of the design basis for joists is produced by another program. The output of this program is suitable for submission to review committees or engineers who require detailed calculations. Detailing dimensions for shop use in cutting materials are produced by a third program.
Operational specification languages
Authors: Pamela Zave
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

The &ldquo;operational approach&rdquo; to software development is based on separation of problem-oriented and implementation-oriented concerns, and features executable specifications and transformational implementation. &ldquo;Operational specification languages&rdquo; are executable specification languages designed to fit the goals, assumptions, and strategies of the operational approach. This paper defines the operational approach and surveys the existing operational specification languages, viz., the graphic notation of the Jackson System Development method, PAISLey, Gist, and modern applicative languages.
The real world of design automation - part III or The user's viewpoint chairman's introduction (Panel Discussion)
Authors: P. Losleben
Venue: Proceedings of the 17th Design Automation Conference (1980)

For the past two years, this panel examined design automation as professionals evaluating our own profession. With tongue only slightly in cheek, we discussed &ldquo;A Funny Thing Happened on the Way to Implementation&rdquo; in 1978, and &ldquo;Adapting to the Joys of Madness&rdquo; in 1979. Both sessions were hard-hitting self appraisals of the way we do business. This year we elected to include a new element in &ldquo;The Real World of Design Automation&rdquo;: THE USER. Too frequently, we become blinded by the brilliance of our own creation. We fail to recognize the reason for our existance. The user is, after all, the bottom line in Design Automation. Our future depends on his successor failure.
The Interactive Computer Graphics System for Machined Part Design and NC Tape Generation
Authors: Lawrence O. Sinkey, Jeffrey Z. Gingerich
Venue: Proceedings of the 9th Design Automation Workshop (1972)

The Interactive Computer Graphics System for Machined Part Design and NC Tape Generation, CGS-1, was developed as an educational tool. Its primary objective is to introduce computer graphics to students in the Penn State two year Associate Degree program in Drafting and Design Technology. Both computers and computer graphics are being extensively utilized in the engineering profession and promise to take on even greater importance in the future. Since the students will be highly involved with graphics, the College Administration felt they should gain an appreciation of the capabilities inherent in computer graphics. This introduction will demonstrate computer assisted design techniques and provide a limited amount of hands-on-experience. The educational benefit will be the knowledge that graphics systems are currently available and will include a limited understanding of computer graphics. A second major objective is to provide feedback information to the people involved in educational systems design. The areas of computer assisted instruction and interactive computer graphics are both relatively new and this experience is necessary for the development of effective educational tools.
Computations with a restricted number of nondeterministic steps (Extended Abstract)
Authors: Chandra M. R. Kintala, Patrick C. Fischer
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

Nondeterminism is one of the most elusive concepts in computing. In this paper we direct our efforts towards viewing nondeterminism as an additional resource at the disposal of time or space bounded Turing machine computations and study the classes of languages acceptable by these machines with restricted amounts of nondeterminism. One motivation for this study comes from the observation that for many of the well-known NP-complete problems, if n' is the length of the input, an algorithm exists requiring a total number of moves which is polynomial in n, but the number of nondeterministic moves is only linear in n.
Classes of semigroups and classes of sets
Authors: Samuel Eilenberg
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

Let A be a subset of &Sgr;+, the free semigroup generated by a finite set &Sgr;. In &Sgr;+ we consider congruences satisfying the condition x&ntilde;y x&egr;A@@@@y&egr; A Among all such congruences there is a largest one, and the quotient monoid by this congruence is denoted by SA and is called the syntactic semigroup of A. This semigroup is finite if and only if the set A is recognizable (by a finite automaton). The semigroup SA can then easily be described using the minimal automaton of A. It is reasonable to expect that reasonable properties of the recognizable set A will be reflected by reasonable properties of the finite semigroups SA and vice-versa. In trying to establish such a dialog, one is handicapped by the fact that there are finite semigroups which are not syntactic monoids of any set. The objective of this note is to state a theorem showing that the above inconvenience disappears if one considers classes of sets (rather than individual sets) and classes of semigroups.
Coupling virtual machines and system construction
Authors: M. Berthaud, M. Jacolin, Ph. Potin, H. Savary
Venue: Proceedings of the workshop on virtual computer systems (1973)

The behavior of a system running in one virtual machine (OBJECT) is made accessible to an external observer through another virtual machine (SPY) coupled to the previous one. Given the independence of virtual machines, it is possible to run in SPY a fully operational system to which suitable components are added in order to achieve integration and debugging of new systems in OBJECT.
Prolog compared with LISP
Authors: Claudio Gutierrez
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

This is a report on a very concrete experiment to compare the relative speeds of DEC-10 Prolog (Edinburgh implementation) and DEC-10 LISP (Texas implementation of UCI-LISP, or TLISP). The comparison was made on the occasion of programming a theorem prover for the propositional calculus, natural-deduction type. The prover is complicated enough so as to try sufficiently sophisticated weaponry of each language, yet simple enough for the human eye to follow both programs in parallel and make sure that they are accomplishing very much the same thing. The experiment was not undertaken with the direct intention of determining the relative performances of the two languages in general, but with the more specific goal of providing a basis for choosing a language for a large research project. Nevertheless, the results are interesting enough so as to make us consider them worth divulging, especially because they seem to contradict the notion, repeatedly argued for by Prolog advocates, that performances of the two languages are similar in relation to speed.
Analog devices on one chip
Authors: Udo Strasilla
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

Large scale integrated circuits have been developed which are capable of performing discrete-time signal processing operations in a more straight forward manner than possible in digital computers. The signal processing techniques that may be performed in these devices and the basic hardware building blocks for the implementation of the signal processing functions are discussed. Further, by describing existing discretetime analog devices it is demonstrated how the basic building blocks may be arranged in different configurations in order to obtain devices for specific multi-level logic operations.
Semantics of a communication mechanism in a distributed system
Authors: Roberto Zicari
Venue: Proceedings of the 5th ACM SIGSMALL symposium on Small systems (1982)

In existing distributed systems a large gap between the application and the low level communication protocols does exist. Usually, this gap results in a rather ad hoc implementation of the application. To reduce this gap, an intermediate level called abstract network has been introduced and a notation based on Petri net, for describing the semantics of the internode communication of the abstract network is presented.
A generating function approach to the Traveling Salesman Problem
Authors: Samuel Kohn, Allan Gottlieb, Meryle Kohn
Venue: Proceedings of the 1977 annual conference (1977)

A new deterministic approach to the (assymetric) Traveling Salesman Problem based on generating functions is introduced. Specifically, we produce a function G(x)&equil;&Sgr;&agr;ix ei where each ei is the cost of a possible tour and &agr;i is the number of tours having this cost. Evaluating G(x) at a specific value close to O and using a logarithmic technique, we extract the smallest exponent, i.e., the minimal tour cost. For an n city problem the method requires on the order of n32n steps and storage for n2 values (possibly of high precision). This technique should be applicable to other &ldquo;NP&rdquo; problems.
An integrated CAD system for architecture
Authors: B. T. David
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper discusses the advantages of an integrated approach to computer-aided design and more particularly to computer-aided architectural design (CAAD). We have studied different ways of organizing integrated systems, and our work has enabled us to define an integrated system for computer-aided architectural design: SIGMA-ARCHI which we describe. This system is a general support for CAAD, which can, on the one hand, be enriched by new operations of general interest, and, on the other hand, be adapted for a specific application by the adjunction of specialized operations. We illustrate these two methods, the first one by showing how we integrate an open industrialized building system, and the second with the example of the sub-system, SIGMA-HOUSING. Finally we present the computer aspects of the system to demonstrate that the general systems approach to CAD facilitates the specification and the implementation of the system.
Automating The Office: User experiences 2
Authors: Bruce W. Hasenyager, Howard L. Morgan
Venue: Proceedings of the 1978 annual conference (1978)

The problem to which our integrated electronic office function is addressed is multlfold. We set out to assemble the necessary skills to fully exploit existing office technology; to define what concept of office automation we were headed for; to identify the problems we were likely to have; and to influence both our internal organization and the vendor community at large to move in directions conslstant with our concept and our experience. We initially began our study of improving managemment productivity by attempting to define a set of measures that we could use to establish a baseline before he began perturbing things. The effort to measure manager productivity failed resoundingly. We moved ahead undaunted to a model of management in the business process that recognized that managers were not productive in the established sense.