ppxscal/embedding_network huggingface dataset:
Program generator systems
Authors: John R. Metzner
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

A program generator system is a general software tool for producing program generators. The program generator automates portions of the program synthesis process for members of a particular class of programs, allowing the source forms of programs to be more compact and to reflect the conceptual basis of the applications area more directly. This paper explores the design and workings of program generator systems for simulation programming. A generalization of the macro processor is shown to form a sound design basis, a basis which can be adapted to the simulation programming environment by the inclusion of innovative features. The status of a pilot implementation of a program generator system for GPSS is reported.
Flow control in a resource-sharing computer network
Authors: Robert E. Kahn, William R. Crowther
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

In this paper we discuss flow control in a resource-sharing computer network (1). The network resources consist of a set of inhomogeneous computers called Hosts that are geographically distributed and are interconnected by a store-and-forward communications subnet. Each Host is connected to a store-and-forward switching node called an Interface Message Processor or an IMP, which is located on or nearby its premises (2). IMPs are then interconnected by leased synchronous communication circuits to form the subnet.
Concepts in CAD data base structures
Authors: P. L. Ciampi, J. D. Nash
Venue: Proceedings of the 13th Design Automation Conference (1976)

The concept of a Computer Aided Design (CAD) database (Figure 1) has been discussed for many years, however, during the course of actually implementing such a data base at Raytheon, we found that many critical concepts are hidden in Figure 1. We will discuss these concepts by analyzing the types of information in a CAD data base and by analyzing the &ldquo;flow&rdquo; of this information.
Uses of the LOGO programming language in undergraduate instruction
Authors: George Lukas
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

LOGO is a programming language developed at Bolt Beranek and Newman Inc. specifically for use in teaching. It provides the student with a rich set of numerical and symbolic primitives as elements for gradually building extended, complex program structures. The building of these structures is greatly facilitated by a procedure-oriented programming heuristic and by recursive programming. Combined with these, to make LOGO easy to learn and use by students and teachers, are a syntax resulting in program forms which resemble ordinary English, and powerful tools for debugging and modifying programs. Students without special mathematical ability can use LOGO to do real work on problems previously inaccessible to them.
A college preparatory course in computer programming
Authors: Robert L. Sedlmeyer, William Parman
Venue: ACM SIGCSE Bulletin (1980)

In the last five years we have witnessed a mushrooming of interest in computer education at the secondary level, the primary focus of which has been on computer literacy. Few guidelines exist for designing a course at this level which emphasizes programming. In this paper, we describe a computer programming course for high school students who are considering entering data processing or computer science degree programs. The course was developed jointly by members of the Computer Technology Department of Purdue University at Fort Wayne and the Mathematics Department at New Haven High School.
A proposed interpretation of lukasiewicz's four-valued system of modal logic
Authors: Stanley J. Krolikoski
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

In &ldquo;A system of modal logic&rdquo;1 &Lstrok;ukasiewicz introduced his four-valued system &Lstrok;, a system which was intended to be interpreted modally, but which has, because of certain of its features, resisted such interpretation. Prior has suggested2 that we interpret @@@@ and &Dgr; as restricted functor variables ranging, respectively, over (a) the negation and falsum and (b) the verum and assertion functors of standard two-valued logic. There is much to this suggestion, but I wish to continue to interpret .@@@@ and &dgr; as modal functors, albeit non-standard ones. &Lstrok;ukasiewicz would surely have disputed my interpretation of @@@@ and Dgr;, but I see no other way of accounting for &Lstrok;'s apparent oddness without denying its modal status.
Use of mouse buttons
Authors: Lynne A. Price, Carlos A. Cordova
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

Two experimental tasks were designed to test use of multiple-button mice. In the first, number of errors made and time to complete subtasks were measured as subjects attempted to depress one, two, or three buttons under three sets of conditions. In the second, subjects were asked to indicate true or false either by pressing one of two different buttons or by clicking a single button one or two times. People tended to be faster and more accurate using different buttons than different numbers of clicks.
Curriculum '80: Recommendations guidelines for community junior college curriculum
Authors: Joyce Currie Little, Marjorie Leeson, Iva Helen Lee, John Sweeney
Venue: Proceedings of the ACM 1980 annual conference (1980)

This session will provide a summary of the first ACM curriculum recommendations for the community and junior college associate and vocational technical level of education. The publication of this report represents the culmination of five years of work by the Curriculum Committee on Computer Education, Subcommittee for Community and Junior Colleges Curriculum '80 addresses three areas: computer programming, computer operations, and data entry operations. The report gives, for each of these three, topical outlines of subject matter to be taught, lists of resources needed, and suggestions for articulation and continued relevance. The guidelines should be of benefit to those who wish to begin a new program of study, as well as to those who wish to improve and update an existing program.
Interleaving of control-store for high-performance micro-programmed computers
Authors: Walter H. Burkhardt
Venue: Proceedings of the ACM annual conference (1973)

Micro-program control for computers has not been applied to models of high performance so far.1 The reason being the slow speed of Read-Only-Memory or Writable Control Store compared to hard-wired components. Previously suggested are Micro-Cache memories 2 and Control Hierarchies3. The first one applies to improvement of small computers; the second to trade-offs in the speed-size relationship of memories. A new method for control stores is suggested, using interleaving techniques from data store technology. Considerable performance improvement can be expected, because 1.) micro-control words are usually long for partitioning them among different memory modules, and/or, 2.) sequences consist of 5-10 micro-instructions on the average before branching. Additionally, optimization can usually minimize branches. Overall performance is estimated at 70-90% of fast hard-wired logic.
Logical Structure Analysis of Document Images Based on Emergent Computation
Authors: Yasuto Ishitani
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

A new method for logical structure analysis of document images is proposed in this paper as the basis for a document reader which can extract logical information from various printed documents. The proposed system consists of five basic modules: typography analysis, object recognition, object segmentation, object grouping, and object modification. Emergent computation, which is a key concept of artificial life, is adopted for the cooperative interaction among modules in the system in order to achieve effective and flexible behavior of the whole system. It has three principal advantages over other methods: adaptive system configuration for various and complex logical structures, robust document analysis tolerant of erroneous feature detection, and feedback of high-level logical information to the low-level physical process for accurate analysis.Experimental results obtained for 150 documents show that the method is adaptable, robust, and effective for various document structures.
Natural language and voice output for relational data base systems
Authors: P. B. Powell, P. Thompson
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

A method to output answers and reasons in English and/or voice in a question-answering system is presented. The system for which the output is designed has a relational data base. A description of &pgr;-relations is given. A &pgr;-relation is one which has multiple values for the predicate or arguments of the relation. The natural language output uses predicate and function patterns for the &pgr;-relations. Pattern construction and pattern expansion into English sentences are described. The context-sensitive translator which converts written sentences into voice output is also described. Lastly, an algorithm is given which extracts the answer and reasons from a proof. The reasons are logically grouped so the user may easily follow the deductive proof procedure. The above has been implemented as part of the MRPPS 3.0 system at the University of Maryland.
1981 A.C.M. annual conference position paper computer crime laws and the computing professional: What you don't know hay hurt you
Authors: Lance B. Eliot, John Sanchez
Venue: Proceedings of the ACM '81 conference (1981)

This position paper succinctly describes several key issues arising in the area of computer crime laws and their connections to the computing profession. Through this statement, and the Technical Session presentation, the computing professional will be introduced to: 1 Meanings of Computer Criminal Law 2 Debates on Legislative Control 3 Debates on Current Enactments 4 Interpretations of Enacted and Proposed Laws 5 Comments and Suggestions Offered To Professionals 6 Summarized Views for Further Consideration
Area-time complexity for VLSI
Authors: C. D. Thompson
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

The complexity of the Discrete Fourier Transform (DFT) is studied with respect to a new model of computation appropriate to VLSI technology. This model focuses on two key parameters, the amount of silicon area and time required to implement a DFT on a single chip. Lower bounds on area (A) and time (T) are related to the number of points (N) in the DFT: AT2&ge; N2/16. This inequality holds for any chip design based on any algorithm, and is nearly tight when T &equil; &thgr;(N1/2) or T &equil; &thgr;(log N). A more general lower bound is also derived: ATx &equil; &Ohgr;(N1+x/2), for 0&le;&times;&le;2.
Software architecture based on communicating residential environments
Authors: Erik Sandewall, Claes Strömberg, Henrik Sörensen
Venue: Proceedings of the 5th international conference on Software engineering (1981)

This paper describes an alternative approach to software architecture, where the classical division of responsibilities between operating systems, programming languages and compilers, and so forth is revised. Our alternative is organized as a set of self-contained environments which are able to communicate pieces of software between them, and whose internal structure is predominantly descriptive and declarative. The base structure within each environment (its diversified shell) is designed so that it can accomodate such arriving software modules. The presentation of that software architecture is done in the context of an operational implementation, the SCREEN system (System of Communicating REsidential ENvironments).
A structured introductory computer science course
Authors: L. Winslow
Venue: ACM SIGCSE Bulletin (1977)

A step-by-step presentation for the introductory computer science course which introduces the student to structured problem solving has been developed. By emphasizing the importance of &ldquo;finding the pattern&rdquo; and developing sequential algorithms from a top-down point of view, the students seem to have a better grasp on how to solve a problem, how to use a language, and how to apply what they have learned to later courses which use the computer.
The history of FORTRAN I, II, and III
Authors: John Backus
Venue: ACM SIGPLAN Notices (1978)

Before 1954 almost all programming was done in machine language or assembly language. Programmers rightly regarded their work as a complex, creative art that required human inventiveness to produce an efficient program. Much of their effort was devoted to overcoming the difficulties created by the computers of that era: the lack of index registers, the lack of built- in floating point operations, restricted instruction sets (which might have AND but not OR, for example), and primitive input- output arrangements. Given the nature of computers, the services which &ldquo;automatic programming&rdquo; performed for the programmer were concerned with overcoming the machine's shortcomings. Thus the primary concern of some &ldquo;automatic programming&rdquo; systems was to allow the use of symbolic addresses and decimal numbers (e.g., the MIDAC Input Translation Program [Brown and Carr 1954]). But most of the larger &ldquo;automatic. Programming&rdquo; systems (with the exception of Laning and Zierler's algebraic system [Laning and Zierler 1954] and the A-2 compiler [Remington Rand 1953; Moser 1954]) simply provided a synthetic &ldquo;computer&rdquo; with an order code different from that of the real machine. This synthetic computer usually had floating point instructions and index registers and had improved input-output commands; it was therefore much easier to program than its real counterpart.
Proposal on efficient address allocation algorithm for horizontal microprograms
Authors: Tadashi Tanaka, Tadamichi Kawada, Teiji Emori
Venue: Proceedings of the 11th annual workshop on Microprogramming (1978)

A new algorithm to allocate horizontal microprograms having many addressing restrictions is presented in this note. This algorithm, using simultaneous partitioning, sufficiently maximizes the microprogram performance and minimizes the necessary memory amount in practical use.
Improved updating in relational data base systems by deuter-sphere algorithms
Authors: Peter Kümmel
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The need to ease the user's handling of data banks concerning natural insertions and deletions, requires more data independencies. A fundamental trend to 'normalize' relations in first and second normal forms has been indicated by Codd and Kent. When it comes to the third normal form, obscurities are spreading. This touches the very moment, when adequate content relations of programming morphologies to content realities are missing. As Chamberlin, Gray and Traiger pointed out, a so called 'rectangle of a base relation' aids to clarify natural function dependencies. These indications have been further developed and advanced to a level, where each tuple and entity is subdivided into six deuter-criteria: 1. identity, 2. age, 3. association, 4. frequency, 5. significance and 6. truth. The validity of each criterion is related to all potential components within a relational data base. The metric data of each deuter criterion can be derived by analytical methods within three- and four dimensional realities in the model of a deuter-sphere. This leads to fundamental insertion- and deletion rules and an improved updating.
Smalltalk and generic concepts in programming languages
Authors: Alan C. Kay
Venue: Proceedings of the international conference on APL: part 1 (1979)

Early generic concepts in programming languages were mixed-type arithmetic (e.g., &ldquo;+&rdquo; used with any combination of fixed-and floating-point numbers) and &ldquo;print&rdquo; functions which could be applied to any of a language's objects. Generic concepts reduce the number of terms which must be remembered and permit considerable condensation of language design. Three different paths in the development of generic-concept languages have been followed by APL, Algol 68, and object-oriented languages such as SIMULA 67 and Smalltalk. APL was the earliest and one of the most interesting applications of generic-concept methods, but now makes the weakest use of these ideas. My talk will use slides and movies to show how the message-object programming system Smalltalk makes use of generic concepts embedded in class descriptions to give rise to a wide variety of simply programmed dynamic simulations including graphic animation, music synthesis, document layout and retrieval, and APL-like calculation features. Many of these systems have been brought to life by child and adult novice programmers. A short list of references is given for those wishing more introductory information about Smalltalk.
Software for satellite graphics systems
Authors: James D. Foley
Venue: Proceedings of the ACM annual conference (1973)

This paper has four purposes. Each is addressed in one of the four following sections. In section 2 the motivations for satellite graphics are briefly summarized. Section 3 briefly reviews the past and current technological developments which have made satellite graphics possible. Having set the stage with these two reviews, in section 4 various interactive graphics programming systems which use satellites are presented, evaluated, and found lacking. The basic theme of the section is that hardware technology has outpaced software technology. The fifth section describes several projected improvements to software technology which will substantially narrow or eliminate the hardware-software gap
An analysis of the Cray-1 computer
Authors: Richard L. Sites
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

The Cray-1 is an extremely high-speed computer, intended to be used for large floating-point scientific computations. However, it is a well-balanced machine that can gracefully be used on a wide class of problems. The machine has two major architectural innovations: (1) 128 backup registers which represent a new layer in the memory hierarchy, essentially a programmer or compiler-managed cache, and (2) 8 vector registers holding up to 64 words each, and operated on by vector instructions. In this paper, we will describe the entire machine, discuss efficient ways to use the 656+ programmer-accessible registers, and discuss some of the design shortcomings.
Instruction tracing via microprogramming
Authors: Dan H. Barnes, Larry L. Wear
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

Assembly level instruction trace routines have been used for years by programmers as a debugging aid. However, most of these have the disadvantages that they are usually 1) very slow and 2) not amenable for use with operating system development. This paper shows how the standard ROM resident instruction set of the H-P 2100 was replaced by a new WCS resident set that contains instruction trace routines with physical I/O. The trace routine was designed so that either all instructions could be traced, or only instructions from a specified area of memory; since the specified area may be modified while the program is running, the user has the flexibility to choose how his program will be monitored. Because all the routines are in firmware rather than software, degradation in speed while the trace executes is not nearly as great as it is for software trace routines. Also, since the trace routine requires no system support, such as I/O or loaders, it can be an effective tool for use in operating system development.
APL and a Black-Box theory of electric circuits
Authors: John C. Wilson
Venue: Proceedings of the international conference on APL: part 1 (1979)

The paper presents the rudiments of a theory of resistive electric circuits viewed as black boxes. The relevant mathematical model is a function mapping voltage vectors to current vectors and having two properties which can be regarded as analogous to Kirchhoff's laws. This treatment of electric circuit theory is unconventional and in fact appears to be new. The purpose of the paper is not to develop the theory itself but to show the convenience and precision of the APL notation in such a theory, and also to illustrate the need, even in a relatively simple application, for general arrays of functions and numbers, and for a notation for and a means of specifying user-defined operators.
Advising the novice computer user in a university environment (and other problems you did not know you had)
Authors: H. Kugel
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

For the novice university computer user, starting a programming project can be somewhat like the dream world of the sleeper. The same sort of process can often be seen in the world of program construction for the novice university computer user. There may be feeling of enthusiasm and anticipation at the onset of the project. It is the purpose of this paper to look at the initial hours of program design and implementation from the general point of view of the novice university computer user.
The IIT MST in computer science program
Authors: John G. Meinke, Charles R. Bauer
Venue: ACM SIGCUE Outlook (1976)

The MST program at Illinois Institute of Technology evolved as a result of Computer Science emerging as a separate discipline at the secondary school level. The State of Illinois and the Chicago Board of Education have both been investigating certification for Computer Science teachers, but at present only two states, Wisconsin and Minnesota, have certification programs for teachers of Computer Science. In the not too far distant future there will be certification programs in many states and the IIT MST program in Computer Science is designed to meet those requirements. It is important to realize before discussing the program itself that the MST program is not designed to teach people how to teach. Before entering the program, a teacher must have at least three years of superior teaching experience as well as recommendations from his principal attesting to his quality as a teacher. Of the 32 semester hours required for the MST degree, a maximum of 12 semester hours are in Computer Pedagogy, with the norm being nine. In addition, students in the program study on a part-time basis to encourage use of the principles studied at IIT in their own classrooms.
Universal schemes for parallel communication
Authors: L. G. Valiant, G. J. Brebner
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

In this paper we isolate a combinatorial problem that, we believe, lies at the heart of this question and provide some encouragingly positive solutions to it. We show that there exists an N-processor realistic computer that can simulate arbitrary idealistic N-processor parallel computations with only a factor of O(log N) loss of runtime efficiency. The main innovation is an O(log N) time randomized routing algorithm. Previous approaches were based on sorting or permutation networks, and implied loss factors of order at least (log N)2.
Waterloo microcomputer systems for the 1980's
Authors: D. D. Cowan, J. W. Graham
Venue: Proceedings of the ACM '82 conference (1982)

Over the years the University of Waterloo has developed academic programs which have been rich in traditional material, but which have also had a pragmatic flavour. As a growing industrial nation, Canada has an insatiable requirement for people with state-of-the-art technical and managerial skills, and our government has encouraged us to enter into &ldquo;mission-oriented&rdquo; projects. The University of Waterloo was founded as a technologically-oriented university and as such has developed a broad requirement for computing.