ppxscal/embedding_network huggingface dataset:
Automatic programming and compilers II: WIZOR, a compiler, compiler for the GE 225 computer
Authors: D. W. Scott
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THE WIZOR COMPILER, a GE-225 computer program, has been designed to aid in reducing the cost of translating from the flow-graph specification of a new compiler to a machine-language binary program of that compiler, in one pass through the computer. The WIZOR program is some what faster than the machine-language assembly program, in producing more or less equivalent binary programs. WIZOR compiler language statements are generally more concise and easily followed than the same program written in symbolic machine-language statements.
Computer response time and user performance.
Authors: T. W. Butler
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

Nearly everyone agrees that computer response time is very important to the users of interactive systems. Many papers have been written describing the bad effects of computer response times that are too long or too short, and many sets of &ldquo;guidelines&rdquo; for appropriate human-engineered computer response times in human-machine systems have been published, as well. Nearly all these sets of guidelines are direct descendants of the set published by Robert Miller (1968) about 15 years ago. When Miller wrote his guidelines, he was quite open in describing them as based only on his experience, and he called for experimental data that would allow for the formulation of better, empirically-based rules for setting computer response time for optimal human performance. About fifteen years later, these studies are still missing, for the most part. Aside for the problem-solving studies of Grossberg, et al. (1976), Goodman and Spence (1981), Bergrnan, et al. (1981), and others, the literature is sadly lacking in empirical data to support the simplest assertions about how computer response time affects computer users. Though there is only the sparsest data to support them, several assertions about computer response time and user performance have become accepted as common knowledge.
The MVA Pre-empt resume priority approximation
Authors: Raymond M. Bryant, Anthony E. Krzesinski, Peter Teunissen
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

A Mean Value Analysis (MVA) approximation is presented for computing the average performance measures of closed multiclass queueing networks containing non pre-emptive Head Of Line (HOL) and Pre-empt Resume (PR) priority centers. The approximation has the same storage and computational requirements as MVA thus allowing computationally efficient solutions of large priority queueing networks. The accuracy of the MVA PR approximation is systematically investigated and presented in terms of error contour diagrams. The contour diagrams reveal that the approximation can compute the average performance measures of priority networks to within an accuracy of 5 percent for a large range of network parameter values. Accuracy of the method is also compared to Sevcik's shadow approximation and another MVA approximation recently proposed by Chandy and Lakshmi.
Computers and privacy: What price analytic power?
Authors: Roger F. Miller
Venue: Proceedings of the 1971 26th annual conference (1971)

Confidential data, pertaining to an identifiable individual or an identifiable small group of individuals, is extremely useful in social science research as well as in governmental administration and private business operations. It tends to be confidential because its full usefulness requires the ability to link the records of a particular decision unit together, despite disparate sources of the data. Both uses and abuses of such data are with us now, and the potential expansion of these requires more than technical &ldquo;know how&rdquo; to prevent errors and buggings if the expansion of uses is to be sufficiently greater than the expansion of abuses to justify any expansion at all. Legislation is needed and must control both uses and abuses (they tend to blend in any event). Among other things, such legislation should provide essential standards for file maintenance and disclosure, and provide that an individual be informed as to what identifiable data about him is on file, where it is, and why.
Computer arithmetic and programming languages
Authors: Ulrich W. Kulisch
Venue: ACM SIGAPL APL Quote Quad (1982)

For historical reasons, the early programming languages lacked a precise definition of the arithmetic operations and the roundings which are to be employed. The paper summarizes an extensive research activity on computer arithmetic that went on during the last fifteen years as well as the experience gained through various implementations. We begin with a complete listing of the spaces that occur in numerical computations. This leads to a new and general definition of computer arithmetic. The arithmetic operations are defined by a general mapping property which is called a semimorphism. We discuss the properties of semimorphisms, show briefly how they can be obtained and mention the most important features of their implementation on computers. The properties of a semimorphism should be used for an axiomatic definition of the arithmetic operations and the roundings within each programming language. Then we show that the new, semimorphic operations can not be properly addressed by existing programming languages. Correcting this limitation led to extensions of PASCAL [4] and FORTRAN [3]. APL is much better suited for adoptation of the new arithmetic operations. A demonstration of a computer that has been systematically equipped with the new arithmetic will follow the talk. The new arithmetic turns out to be a key property for an automatic error control in numerical analysis. By means of a large number of examples we show that guaranteed bounds for the solution with maximum accuracy can be obtained. The computer even proves the existence and uniqueness of the solution within the calculated bounds. If there is no unique solution (e.g. in case of a singular matrix) the computer recognizes it.
Quadratic lower bounds for deterministic and nondeterministic one-tape turing machines
Authors: Wolfgang Maass
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We introduce new techniques for proving quadratic lower bounds for deterministic and nondeterministic l-tape Turing machines (all considered Turing machines have an additional oneway input tape). In particular we produce quadratic lower bounds for the simulation of 2-tape TM's by l-tape TM's and thus answer a rather old question (problem No.1 and No.7 in the list of Duris, Galil, Paul, Reischuk [3]). Further we demonstrate a substantial superiority of nondeterminism over determinism and of co-nondeterminism over nondeterminism for l-tape TM's.
An integrated approach to user services software support
Authors: Virginia Patterson
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

Most discussions about documentation are concerned with dissemination of documentation to the user community. This paper attacks a different problem, documentation to facilitate implementation of software and the development of system programmer expertise in a User Services group where there is continuing responsibility for extensive upkeep of software systems.
Evaluation and analysis of users' activity organization
Authors: Liam Bannon, Allen Cypher, Steven Greenspan, Melissa L. Monty
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

Our analyses of the activities performed by users of computer systems show complex patterns of interleaved activities. Current human - computer interfaces provide little support for the kinds of problems users encounter when attempting to accomplish several different tasks in a single session. In this paper we develop a framework for discussing the characteristics of activities, in terms of activity structures, and provide a number of conceptual guidelines for developing an interface which supports activity coordination. The concept of a workspace is introduced as a unifying construct for reducing the mental workload when switching tasks, and for supporting contextually-driven interpretations of the users' activity structures.
A dynamic long range budget model to assist navy planners
Authors: Samuel Graves, Rolf Clark
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

Navy long range planning is a complex process in which a 15-yr budget is coordinated through numerous interested offices and agencies. In this administrative process it is difficult to capture all of the interactions between budget elements and the downstream influences of decisions. Alterations in one budget element affect not only other elements in the same year but, through a ripple effect, influence many other elements in subsequent years. The computer model described here, The Navy Resource Dynamics Model, has been developed and applied to assist in this process.
Design and implementation of a non-binary code for byte-organized memory with binary and quaternary logics
Authors: Tich T. Dao
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

Byte-organized memory requires an error control scheme which can handle errors involving one or several entire bytes. A special parallel non-binary single error correction and double error detection SEC-DED block code is constructed by an iterative technique. This code is optimum in the sense that it lends itself to a simple and high speed hardware implementation either in binary or in quaternary logic. A double extension field GF(22m) of the subfield GF(2m) is then introduced. As a design example a (80,64) SED-DED code in GF(24) is constructed and implemented.
Pin assignment in automated printed circuit board design
Authors: Norman L. Koren
Venue: Proceedings of the 9th Design Automation Workshop (1972)

The success of a router in automated printed circuit board design depends strongly on board organization prior to routing. One of the steps in board organization is the assignment of connections to pins, which can be made with considerable freedom since most chips have permutable circuits, gates, or gate input pins. Intelligently made pin assignment can reduce the two principal causes of router failure: (1) the crossing of connection paths and (2) the filling of available channels. The method described in this paper assigns a vector to each available chip pin and to each set of connections which are to be connected to a single pin on the chip. These vectors are used to assign the connections to the pins following a heuristic optimization procedure. This procedure was implemented as a FORTRAN program and gave a significant improvement in the number of wires routed on a large sample of typical boards. It is now incorporated into the UNIVAC automated P.C. board design program.
An artificial intelligence approach to tonal music theory
Authors: James R. Meehan
Venue: Proceedings of the 1979 annual conference (1979)

There are virtually no computer models of tonal music theory, largely due to a preoccupation with syntax that comes from traditional linguistics, particularly from transformational grammar. Narmour's recent book, Beyond Schenkerism [5], defines Schenker analysis as a transformational system, refutes the central parts of that theory, and suggests an alternative theory of analysis. This paper draws a parallel between some of Narmour's ideas and current work in natural language processing, Schank and Abelson's Knowledge Structures [11]. The principal correspondence is between Narmour's &ldquo;style forms&rdquo; and the AI notion of semantic primitives. It may now be possible for music theorists to share the philosophy and methodology of AI researchers in producing programs to compose and analyze tonal music.
On the problem of computational time and complexity of arithmetic functions
Authors: Algirdas Avižienis
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

The time and incremental complexity required to perform two-operand addition using logical circuitry are compared for nonredundant and minimally redundant encodings of the operands. The comparison is extended to multi-operand addition and two-operand multiplication.
CIBOL - an interactive graphics program used in the design of printed wiring boards and generation of associated artmasters
Authors: T. J. Kriewall, N. R. Miller
Venue: Proceedings of the 8th Design Automation Workshop (1971)

CIBOL (CIrcuit BOard Layout) is an application program that uses a computer graphics facility to aid in the design of low density discrete component printed wiring boards. There are three distinct program phases: creating the board outline, positioning the components, and routing the interconnections. A light pen and scope display are used interactively during the three program phases. The program directly generates manufacturing information on auxiliary peripherals in the form of parts lists, component layouts, drilling lists and artmasters. The use of the program has resulted in considerable savings in the cost of producing printed wiring board designs and reduction in the turnaround time from design inception to completion.
The art and science of user services
Authors: Robert K. Shaffer
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

We are all familiar with the great advances made over the years in all areas of science and technology resulting from the application of well known laws and principles. Among such laws are the laws of conservation of energy and mass, the laws of thermodynamics, and Newton's laws of motion. We are frequently overwhelmed by the changes confronting us daily in our user services work. We experience changes in hardware, software, organizational structure, management, personnel, user education, consulting, documentation and physical facilities. The discipline of physics takes the whole universe of ubiquitous changes in stride and integrates them into unifying principles. In the midst of an ever-changing world, physics presupposes a constancy of nature, i.e. that identical conditions give identical results; that cause and effect relationships can be determined and applied to observed phenomena. This paper will be a light-hearted trip in analogous thinking into a different perspective of the many changes we experience in our profession. I shall explore how we might be able to use these classical laws of physics to ease our burden of coping with the changes we encounter daily. If our activities do obey these laws in a predictable and sensible fashion, then we can use these principles to help us. For example, the fundamental law of the conservation of energy states that energy can neither be created nor destroyed. From this law we can deduce that for a given level of user services personnel staffing, a maximum amount of work (energy) can be accomplished over a given period of time. Hence, priorities are set, either implicitly or explicitly. By clearly seeing the situation, realistic goals and expectations are possible. Perhaps such phenomena as staff personnel burnout and high turnover rates might be diminished by seriously applying such techniques.
Some experiments in directory organization - a simulation study
Authors: Allen Reiter
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

Using a simulation model, experiments were conducted on various directory organization schemes and their performance implications. In particular we tested the effects of a multiprogrammed environment on system throughput for retrieval operations. Analysis of the results shows that different factors are relevant to performance for the various systems, and that under some circumstances ISAM and hash-coding may lose the advantages they possess over B-trees in a stand-alone environment when multiprogramming is used. Some results of sharing data among simultaneous users are also presented.
Efficiency vs responsiveness in a multiple-services computer facility
Authors: David N. Freeman, Robert R. Pearson
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

When a general-purpose computer performs compute-limited applications, its performance&mdash;unit cost per computation&mdash;is the primary measure of its adequacy. When such a computer performs a wide variety of services&mdash;interactive computation, fast-turnaround batch jobs, prolonged I/O-limited jobs, and prolonged compute-limited jobs&mdash;its raw performance is only one of several important measures: capability to overlap I/O operations with computation, accessibility to users, and turnaround times appropriate to user needs, as well as unit cost per computation. The focus of our paper is on two measures: capability to overlap I/O operations with computation, and a wide range of turnaround times. Consider the aggregate needs of a university population, representing the physical, behavioral, social, and engineering sciences, as well as the humanities and the university business Office. Some users&mdash;particularly in the behavioral sciences&mdash;will require the instant turnaround of interactive computing. Other users can be quite satisfied with ten-minute turnaround; they may prefer instant turnaround, but they can afford neither the terminal equipment nor the functional limitations imposed by interactive computing. Users with nontrivial jobs (at least three minutes on a powerful machine) will settle for turnaround of a few hours if&mdash;and only if&mdash;the unit price per computation is attractively low. Many administrative jobs and routine data-reduction jobs can be deferred until pre-dawn hours, i.e., over-night turnaround.
Correctness of data representations (Extended Abstract): Pointers in high level languages
Authors: D. M. Berry, Z. Erlich, C. J. Lucena
Venue: ACM SIGMOD Record (1976)

At present, there is considerable debate whether, in light of what is being learned about construction of reliable software, pointers are desirable in high level programming languages. One side [Hoa73, Hoa75] maintains that 1) Pointers are like the goto in that they are an invitation to create spaghetti in one's program [Hoa75]. 2) In some languages, e.g., PL/1 [Wlk71], the use of pointers can lead to serious type violations, for example, the compiler believes that a given pointer will be pointing to an integer when in fact, it will be pointing to a real. 3) The indiscriminate use of pointers may confound the attempts of hardware pipelining and use of cache memory to speed up computations [Hoa73, Hoa75]. 4) A pointer may be left dangling, that is, a pointer may point to a variable or other datum which has been deallocated [Bry71, CDMPS73, Bry74].
The two year curriculum in Computer Programming at Purdue University Calumet campus
Authors: A. J. Adams, John Maniotes
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

It is the intent of this paper to describe an implementation of a curriculum compatable with the ACM &ldquo;Curriculum Recommendations and Guide-lines for the Community and Junior College Career Program in Computer Programming&rdquo; (also known as the &ldquo;Little Report&rdquo;). In order to facilitate comparisons among curricula, this paper follows the &ldquo;format&rdquo; developed by members of the ACM C3S-CAJC working group.
The UK5000 - successful collaborative development of an integrated design system for a 5000 gate CMOS array with built-in test
Authors: J. R. Grierson, B. Cosgrove, R. Daniel, R. E. Halliwell, I. H. Kirk, J. C. Knight, J. A. McLean, J. M. McGrail, C. O. Newton
Venue: Proceedings of the 20th Design Automation Conference (1983)

Following a UK Department of Industry initiative, the UK5000 project was launched in July 1981 on a 2 year timescale by 7 autonomous UK organizations with different computer systems. The activity involved the collaborative development of an integrated design system for a 5000 gate CMOS array. The DA system was to be portable and capable of generating layouts and test programs from logic circuit descriptions in a time of the order of one week. The CMOS array is unique in containing rows of dedicated bistables, preformed on chip into a shift loop for scan path testing with a totally synchronous clocking scheme. The dedicated bistables, clock lines, shift loops etc, together with the synchronous design lead to lower routeing requirements, elimination of timing hazards and excellent testability.
Using simulation to analyze pulse stuffing network jitter
Authors: J. A. Gracia, R. M. Huhn
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

It's all about timing. In the digital communications world it is necessary to transport information over distances great and small. In order to accomplish this, it becomes imperative that timing information be made available at the receiver so that the digital information can be recovered as error free as possible. Pulse stuffing synchronization is an established technique. Hardware has been built, deployed and is operating properly in the field. The lack of a precise understanding of the phase jitter characteristics of a pulse stuffing network has created problems when interfacing special digital equipment of this type in a digital communications system. In an effort to overcome this interface problem, it became necessary to develop a better understanding of the phase jitter characteristics as a function of the parameters associated with various pulse stuffing systems now available. This paper discusses a study which undertook such a task and in particular, addresses the role played by a simulation which was key in this study. The problem itself, much too difficult for mathematical analysis, was ideally suited for the combined simulation approach. The Multiplexer Jitter (MUXJIT) Simulator development was sponsored by the Defense Communication Engineering Center (DCEC) for the Defense Communication Agency (DCA) as part of contract DCA-100-76-C-0072 to conduct a systems analysis (and construct a supporting hardware simulator) of phase jitter characteristics in pulse stuffing time division multiplexer networks(4). The study effort was further enhanced by the construction of the hardware simulator which provided: a) verification of the preliminary mathematical and software simulation results, b) further depth by forcing the study to look at results from a hardware viewpoint, and 3) insight into hardware implementation limitations. This effort provides a benchmark for the role of a combined software simulation and a hardware simulation effort as well as a view of the software simulator role in bridging the gap between mathematical analysis and hardware breadboarding.
Academic computing at Atlanta University Center-a consortium of six predominantly black institutions
Authors: Louise S. Morrison, Grover C. Simmons
Venue: ACM SIGCSE Bulletin (1976)

Atlanta University Center is the largest private institution of Black higher education in the world and the second oldest consortium of schools in the nation. When the Center began offering an undergraduate degree in computer science in 1969, it was the first institution in Georgia to do so. Now there are 50 majors, and each semester the Center-Coordinated Computer Science Department teaches approximately 250 students for the six institutions comprising the Atlanta University Center. In this paper the computer science curriculum is described and programs and services provided by this department are detailed.