ppxscal/embedding_network huggingface dataset:
The design of parsers for incremental language processors
Authors: G. Lindstrom
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

An incremental language processor is one that accepts as input a sequence of substrings of the source language and maps them independently onto fragments in some object code. The ordered sequence of these object code fragments are then either compiled, in which case we have an incremental compiler, or interpreted. In the first case the advantage resulting is that subsequent changes in the source program entail only reprocessing the source fragments affected and recompiling the updated collection of object code fragments. In an environment where small changes are made frequently to large programs, e.g. debugging, the curtailment of reprocessing is attractive. In the second case the object code fragments are the actual run-time program representation, and hence inter-fragment relations are transiently evaluated as needed in the process of execution, with no long-term preservation of these relationships beyond the scope of their immediate need in execution time. This permits the possibility of program recomposition in the midst of execution, one of the principal characteristics of conversational computing. Many conversational language processors execute a program representation functionally analogous to parse trees, i.e. the syntax analysis of a fragment, insofar as it is possible, is done at fragment load time. This representation choice is popular because many of the expensive aspects of interpretation, including character string scanning, symbol table lookup, and parsing, are performed once only and do not contribute to the execution overhead. This paper is devoted to examining the question of the construction of such a parser in a general manner for an arbitrary source language.
Prototyping vs. specifying: A multi-project experiment
Authors: Barry W. Boehm, Terence E. Gray, Thomas Seewaldt
Venue: Proceedings of the 7th international conference on Software engineering (1984)

In this experiment, seven software teams developed versions of the same small-size (2000-4000 source instruction) application software product. Four teams used the Specifying approach. Three teams used the Prototyping approach. The main results of the experiment were: Prototyping yielded products with roughly equivalent performance, but with about 40% less code and 45% less effort. The prototyped products rated somewhat lower on functionality and robustness, but higher on ease of use and ease of learning. Specifying produced more coherent designs and software that was easier to integrate. The paper presents the experimental data supporting these and a number of additional conclusions.
Verification of a monitor specification
Authors: Ashok R. Saxena, Thomas H. Bredt
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

A specification of the monitor primitives that have been proposed for mutual exclusion and interprocess communication in operating systems is verified to be correct. The specification is given in the PASCAL programming language and the proofs of correctness use the axiomatic definition of this language. Two aspects of correctness are considered: the correctness of the program implementation of the primitives and the correctness as viewed by the processes that execute the monitor primitives.
What's wrong with APL?
Authors: Philip S. Abrams
Venue: Proceedings of seventh international conference on APL (1975)

Throughout history, every time a new idea has come along there have been many people quick to criticize it. As often as not, such criticism has come from detractors of the idea, and has been motivated by its threat to older, more established beliefs. The Biblical prophets, Socrates, Jesus, Copernicus, Galileo, Pasteur, Marx, Darwin, Stravinsky, and countless others, all experienced resistance to their ideas for essentially emotional rather than intellectual reasons. From its early days as &ldquo;Iverson Notation&rdquo; through its more recent development, APL has been the target of heated discussion. This paper is a criticism of APL, but I believe, different from others. I am not a detractor of APL; in fact, I have been a supporter, developer, and promoter of the language for quite some time. Therefore, the intention of this review is not to suggest that since APL has faults it is worthless. To the contrary, I hope that these comments will lead to further improvements of APL and perhaps suggest some of the directions to consider in the development of its successors. This paper could not have been written much earlier. It is because APL has come of age, both in the theoretical domain and in the commercial world, that it is possible to look at it publicly with a critical eye. The discussion that follows is written for the APL community, present and future. My wish is that APL &ldquo;believers&rdquo; will accept this analysis in the constructive spirit in which it is offered, and that those who still do not appreciate the beauty, elegance, and practical power of APL will not take these comments out of the context in which they are presented.
Structured programming concepts in an introductory COBOL course
Authors: Jan L. Mize
Venue: ACM SIGCSE Bulletin (1976)

This paper concerns an effort to implement structured programming concepts in an introductory COBOL programming course in order to improve student program design and techniques. Since COBOL's native habitat is a business environment with recurring processing cycles and evolving systems requirements, COBOL, perhaps more than other languages, exhibits a glaring need for orderly structure and rigid standards to provide for readability, maintainability and modifiability. It is difficult for a student in a one-quarter course to fully appreciate the significance of having these characteristics in his own program when they are reviewed months (or years) later or in programs acquired from someone else.
Issues in Ada's future sponsored by ACM/adatc (Panel Discussion)
Venue: Proceedings of the ACM '82 conference (1982)

The Ada programming language has gone public. The Department of Defense originally sponsored the effort in order to develop a high level language which could be used in real time computer systems. Such systems are written in assembly language or in obscure languages such as CMS (Navy), JOVIAL (Air Force), and TACPOL (Army). Each of the high level languages in current use by the services has deficiencies which require the use of assembly language in almost all applications. In fact, most of the real time applications which are written supposedly in a high level language are written actually in assembly language because the compilers accept assembly language statements. This sad state of affairs has resulted because none of the current language can handle all of the requirements of real time applications. For example, there exist at least four dialects of JOVIAL (J2, J3, J3B, and J73) none of which have a basic input or output capability. Some of the problems which result from the use of assembly language and obscure languages are logistical rather than technical: a small number of people know these languages; there is a dearth of training material and courses; there is no portability of programs or people between systems which use these languages; the programming environments for each of the languages is poor; the languages are not available on many computer systems.
The design of an efficient data base to support an interactive LSI layout system
Authors: James A. Wilmore
Venue: Proceedings of the 16th Design Automation Conference (1979)

The increasing size and complexity of integrated circuits has made an efficient data base essential to the operation of an interactive layout system. This paper describes the design of a data base for IC mask data which features rough bit-maps of entities for sorting by location, a routine for the automatic selection of the bit-map regions' boundaries, and a page-filling algorithm which facilitates the separation of dissimilar data between pages. The routine for automatic selection of region boundaries is described in detail.
Character string manipulation in APL
Authors: Charles R. Moore
Venue: Proceedings of the sixth international conference on APL (1974)

Use of the NMSU EXECUTE enhancement at PCS (since September 1973) has opened the way to many new applications and programming techniques, Most of these applications have been in the area of packages where the user communicates indirectly with APL through a higher-level 'language' tailored to a specific task. One such program is the PCS APL/RJE system. In the RJE system the user is under firm program control with all his inputs in the character input mode. These inputs are scanned with the APL character handling primitives and program control paths are altered to satisfy the request. As the interface languages become more sophisticated, it often becomes useful to create or modify APL programs under program control and cause them to be executed. The enhancement of APL character string manipulation and some programming application areas are the subject of this paper.
Introducing "theory" in the second programming course
Authors: Paul N. Hilfinger, Mary Shaw, Wm. A. Wulf
Venue: ACM SIGCSE Bulletin (1978)

Traditionally, the first two programming courses have emphasized basic techniques and skills&mdash;the details of a programming language, basic problem solving and program development, &ldquo;structured programming&rdquo;, the manipulation of simple data structures and files, basic sorting and searching algorithms, etc. Our principle motivation is the conviction that programming should be an engineering discipline, and that engineering disciplines must be grounded in engineering science. Further, to be effectively taught, this science must be introduced as early as possible. In contrast to the measure-theoretic under pinnings of the calculus, the theory we introduce is immediately useful to working programmers. In addition, the topics we cover are fundamental to later courses. By introducing the topics early in the curriculum, we provide a common vocabulary for these later courses, eliminate redundant treatment of topics, and give students greater exposure to the material and a better chance to absorb it. We feel we have been successful with the course, although our evidence is necessarily subjective. Because its philosophy flies in the face of current practice, we shall attempt to explain that philosophy in this paper. The course itself, &ldquo;Fundamental Structures of Computer Science&rdquo; (FS here after) is described in somewhat greater detail in [2] and we are preparing a supporting text [3]. We are not so much interested in pressing our own particular treatment of the topics, however, as we are the choice of material and its place in the curriculum.
An analysis of a time window multiaccess protocol with collision size feedback (WCSF)
Authors: M. Y. Elsanadidi, Wesley W. Chu
Venue: Proceedings of the Computer Network Performance Symposium (1982)

We analyze the performance of a window multiaccess protocol with collision size feedback. We obtain bounds on the throughput and the expected packet delay, and assess the sensitivity of the performance to collision recognition time and packet transmission time. An approximate optimal window reduction factor to minimize packet isolation time is {equation}, where n is the collision size and R the collision recognition time (in units of packet propagation delay). The WCSF protocol, which requires more information than CSMA-CD, is shown to have at least 30% more capacity than CSMA-CD for high bandwidth channels; that is, when packet transmission time is comparable to propagation delay. The capacity gain of the WCSF protocol decreases as the propagation delay decreases and the collision recognition time increases. Our study also reveals the inherent stability of WCSF. When the input load increases beyond saturation. The throughput remains at its maximum value.
A microcomputer based simulation model for a military scheduling application
Authors: Daniel G. Shimshak, Dean J. Saluti
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

This study analyzes various design alternatives in determining the manpower requirements needed for an army orders processing operation. Specifically it will enable a National Guard Plans and Training orders. The analysis is performed by use of simulation modeling. Different manpower alternatives were evaluated that included varying numbers and arrangements of processes. Consideration was given to the total processing time objectives in order to determine these levels of manpower. It is intended that this model will ultimately reside in interactive software on a microcomputer.
Graphic display techniques in the automated interconnection process
Authors: R. R. Klemetsmo, G. A. Minturn, A. I. Wright
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

At present, it is necessary to negotiate a manual completion phase in wiring multi-layer interconnection boards used in aerospace computers. This phase occurs after automatic placement of logic modules and routing of the greater majority of the requisite wiring. The GAPE (Graphic Aids to Packaging Engineering) System utilizes an IBM 2250 to minimize not only time-consuming and error-prone functions in the wiring completion process but also the total amount of computer time required. Selection and routing of wires in an n-plane environment is controlled using a displayed set of functions which are activated by light pen and function keyboard. Routing is enhanced by the ability of the system to rapidly switch between planes and subsections of the planes. The system also permits re-routing of wires already placed either in their entirety or portions thereof. Description of the physical board to be wired is supplied at execution time for maximum system flexibility and minimum user intervention. System tape output interfaces with printed circuit generator functions.
Towards a simulation model of motivation and adjustment
Authors: F. Paul Wyman, John W. Slocum,  Jr., Richard R. Reed
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A model of human motivation is formulated on the basis of Maslow's need theory. Additionally, behaviors are selected by degree of tension and are reinforced by environmental reactions which facilitate or frustrate reduction of tension according to the aggressiveness of behavior. Comparisons of alternative environments support the internal consistency of the model. Recommendations are made to improve the stability of the model and for behavioral research that would be necessary for validation.
Case studies on the implementation and use of database management systems
Venue: Proceedings of the 1977 annual conference (1977)

The acquisition and implementation of database management systems is occurring at an accelerating rate. Although the literature on the design considerations for these systems is substantial, there is little communication to the user community as a whole about the actual implementation and use of database management systems in organizations. The purpose of this panel is to examine usage issues related to DBMS in organizations. A number of organizational, application, and technical issues will be presented by members of the panel, each of whom is experienced with a particular kind of DBMS. Essentially, the question that each panelist will address is, &ldquo;Now that you have a DBMS, how have you used it?&rdquo; The discussion will deal with such issues as where to begin, how to start to structure the database, what interfaces with the users are necessary, what are the advantages and disadvantages as well as needed modifications for particular database management systems. Each panel member will present actual experiences with a DBMS in a particular application area.
AEGIS Mission Performance Simulation (AMPS)
Authors: Willis A. Soper,  Jr.
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

This paper describes a simulation of the AEGIS Weapon System called AMPS (AEGIS Mission Performance Simulation). The full text discusses the problems encountered and the solutions chosen in the development of this simulation. It is expected that similar types of problems would appear in simulation development for any large scale system which is simultaneously being developed and the approaches to solutions given here may be equally applicable. Other contents of the complete paper are the genesis and purpose of AMPS, its general features and structure, simulation timing, the AEGIS environment and its simulation, the quantitative description of AEGIS as simulated, the operational description of the simulation, and the simulation outputs.
A modern Curriculum for an ancient culture
Authors: Robert M. Aiken, Chien F. Chao, Yi Fen Zhu
Venue: ACM SIGCSE Bulletin (1982)

This paper reports on one such effort. The senior author was invited by the First Ministry of Machine Building to review a Computer Science program which had been established along the lines of the IEEE Model Curriculum [4]. The work of the two other authors and their colleagues forms the bulk of the reminder of the presentation. This discussion of a particular program presents one of the ways in which the PRC is &ldquo;catching up&rdquo;. A more complete review is provided in another document [5].
Doubly twisted torus networks for VLSI processor arrays
Authors: Carlo H. Sequin
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

The twisted torus processing surface, introduced and analyzed by Martin,1,2 is extended to contain a double twist and then mapped into a two-dimensional network suitable for implementation on a VLSI wafer. The result is a homogeneous, isotropic multiprocessor configuration without boundaries. Every processor has four nearest neighbors, and the interconnections between all pairs of processors are of approximately equal length. Special attention is given to mapping binary trees onto the processor array. Most divide-and-conquer-type problems will distribute themselves relatively uniformly over all available processors. Nine building blocks are introduced that will permit making doubly twisted torus arrays of arbitrary sizes.
The orbit problem is decidable
Authors: Ravindran Kannan, Richard J. Lipton
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

The &ldquo;accessibility problem&rdquo; for linear sequential machines (Harrison [7]) is the problem of deciding whether there is an input x that sends such a machine from a given state q1 to a given state q2. Harrison [7] showed that this problem is reducible to the &ldquo;orbit problem:&rdquo; Given A&egr;Qn&times;n does there exist i&egr;N such that Aix &equil;y.* We will call this the &ldquo;orbit problem&rdquo; because the question can be rephrased as: Does y belong to the orbit of x under A where the &ldquo;orbit of x under A&rdquo; is the set {Aix: i &equil; 0,1,2,...}. (A0 is the identity matrix I.) In Harrison's original problem the elements of A,x, and y were members of an arbitrary &ldquo;computable&rdquo; field. In view of the lack of structure of such fields, we study only the rationals. Shank [13] proves that the orbit problem is decidable for the rational case when n&equil;2. The current paper establishes that for the general rational case, the problem is decidable - and in fact polynomial-time decidable. We wish to give a brief idea of our approach to the problem.
An adaptive computer model of the adoption of electricity in a village community
Authors: Martin Pfaff, C. G. Jambotkar
Venue: Proceedings of the third conference on Applications of simulation (1969)

The paper employs the Systemic Interaction Model (SYSTIM) approach to the modeling of social reality. Its specific focus is the process of evaluation of an innovation&mdash;electricity&mdash;by an Indian village community, in terms of the perceived cultural, social, political as well as economic and marketing benefits that are likely to arise for various types of socio-economic actors. The path of commitment and final adoption of this innovation conforms to the well-known empirical adoption pattern observed for real-world villages.
No! high level languages should not be used to write systems software
Authors: John G. Fletcher
Venue: Proceedings of the 1975 annual conference (1975)

The views expressed here derive from the experience of the author and his colleagues in designing and implementing the Octopus computer network at the Lawrence Livermore Laboratory. This network serves five major time-shared computers (CDC 7600's and STAR-100's), connecting them to over 800 interactive terminals, about 200 television monitor displays, printers that operate at up to 18,000 lines/minute, and more than a trillion bits of storage. The software for the network has been written entirely in assembly language (for PDP-8's, 10's, and 11's, MODCOMP II's, and TI 980's) and from scratch, basing none of it on manufacturers' or other commercial software. The same persons who create the design also do the programming and debugging. In most cases one or two persons program a computer; four persons were used on the largest system (the PDP-10's). Our experience does not accord with much of what we read in the computing literature, leading us to conclude that it is written by persons unaware the real problems of systems work. We have had little or no trouble with deadlocks, security loopholes, and other logical flaws that are belabored at length in the literature. Most of our effort has gone into devising ways for the system to survive in the presence of intermittent and random failures of hardware components and for it to maintain high data transfer rates among multiply-interconnected devices and computers of varying speeds, matters that are seldom discussed in the literature at all. It is certainly not the case that the difficulties encountered with operating systems are the same as those encountered with other large programs, such as compilers.
ACM SIGPLAN history of programming languages conference GPSS language summary
Venue: ACM SIGPLAN Notices (1978)

The General Purpose Simulation System language has been developed over many years and implemented on several different manufactures' machines. Of the two current versions, GPSS/360 models can operate with GPSS V, with some minor exemptions and modifications. GPSS V is more powerful and has more language statements and facilities. The system to be simulated in GPSS is described as a block diagram in which the blocks represent the activities, and lines joining the blocks indicate the sequence in which the activities can be executed. Where there is a choice of activities, more than one line leaves a block and the condition for the choice is stated at the block.
Predictors of turnover among computer specialists
Authors: Kathryn M. Bartol
Venue: Proceedings of the 1979 annual conference (1979)

This paper reports on the results of a longitudinal survey of turnover among members of a special interest group of ACM. An initial survey measured a number of individual and organizational variables believed to be related to turnover. One year later, respondents were queried to determine whether or not they still work for the same organization. It was then possible to analyze the usefulness of such variables as job satisfaction, organizational commitment, dedication to the computer profession, perceptions of the reward system of the organization, and number of different organizations for which one had worked in predicting turnover among the sample of computer specialists. The analyses results are reported and the implications are discussed. Major people related problems facing the computer field as indicated by the respondents are also outlined.