ppxscal/embedding_network huggingface dataset:
On program control structure
Authors: Peter M. Neely
Venue: Proceedings of the ACM annual conference (1973)

The syntax of the DO-WHILE is revised so as to distinguish the semantics of logical control of iteration from those of site of test within the scope of the DO. The corresponding control graph (flowchart subdiagram) is shown to be a combination of previously used alternative forms. An indentation scheme is proposed in which the indentation rules are identical for both iterative and conditional statements. Furthermore the rules as given are identical for any programming language, whether it is a lower level language which requires hand coded book-keeping statements or some ideal language in which all loop control is provided for in the syntactic forms. The minimal sufficient set of program control structures is augmented with forms for the convenience of human program writers and readers. These forms all share common indentation rules corresponding to those used for the DO-WHILE and IF-THEN-ELSE. Last a form is provided for handling error conditions, POSIT-QUIT-ADMIT in which multiple QUITs are permitted. The indentation rules are compatible with the preceding rules.
Test plan generation using formal grammars
Authors: Jonathan A. Bauer, Alan B. Finger
Venue: Proceedings of the 4th international conference on Software engineering (1979)

A test plan generation algorithm is proposed for systems such as process-control systems or transaction-processing systems. Input to the algorithm is a description of the functional requirements for a given system. This is converted to an augmented finite state automaton (fsa) from which a regular grammar is derived. The grammar is used to generate test &ldquo;sentences&rdquo; each of which describes a sequence of stimuli to be applied to the system under test and responses required of the system under test.
How to evaluate page replacement algorithms
Authors: Richard Y. Kain
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

The designer of a virtual memory system can obtain accurate estimates of the average memory requirements of programs running in the system by weighting the average allocation during execution intervals with the average allocation during page waiting intervals. We show how to combine the averages, how to use the measure to determine the size of primary memory while achieving system balance between memory and processor demands, and how to partially order the performance of paging algorithms.
The chip layout problem: An automatic wiring procedure
Authors: K. A. Chen, M. Feuer, K. H. Khokhani, N. Nan, S. Schmidt
Venue: Proceedings of the 14th Design Automation Conference (1977)

This paper describes an automatic system for routing the metal connections on integrated circuit chips. The system contains three major sections: global wiring, vertical channel assignment, and horizontal bilateral channel allocation. Since its initial development in 1972, this system has been used successfully at IBM in the physical design of bipolar logic chips.
Teaching problem solving in an introductory computer science class
Authors: David D. Riley
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

This paper deals the difficulties of teaching problem solving in an introductory level computer science course where the majority of students are not computer science majors. An approach is suggested using top-down design techniques. The specific pseudo language, problem definition form, and design procedure taught in this course are described.
Automatic design of data processing systems
Authors: Gregory R. Ruth
Venue: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages (1976)

An automated business data processing system designer is described. Attention is centered on the I/O aspects of such systems and the development of optimizing design heuristics. The design of data organization and data accessing procedures for data processing systems operating on large keyed files of data is a common and recurrent activity in modern data processing applications. A considerable amount of understanding and expertise in the this area has been developed and it is time to begin codifying and automating this process. It should be possible to develop a system where the user has merely to specify the characteristics of his (input, output, and intermediate) data objects and their interrelations1 and the system will automatically determine the data organizations and accessing procedures that are optimal for his application. The optimizer for Protosystem I (an automatic programming system prototype at MIT's Project MAC) provides an example of how such automation can be accomplished. This paper describes the theory and algorithms behind the optimizer that is currently operational at Project MAC.
A requirement model for the 5th generation
Authors: David A. Gustafson
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

A requirement specification model suitable for the next generation of software development tools is presented. The model uses frames for each entity and relations between entities. The model includes levels and meta-information. The entity-relationship-level of abstraction (E-R-L) viewpoint is explained. Some current requirement methodologies are compared and evaluated in terms of classroom experience. Features of the proposed model are discussed. The relationship between the model and an information base for the whole software life cycle is discussed. An example is presented.
Discussant comments on sources and types of service
Authors: Glenn Ingram
Venue: Proceedings of the annual ACM SIGUCCS symposium on The administration and management of small-college computing centers (1972)

When Jerry Engel asked me to serve as a discussant for this session, I said I'd be pleased to, but on second thought, asked how I should prepare for the job. His advice was, &ldquo;Have your sense of humor, be prepared to fill in for Preston Hammer if he doesn't make it, and if Gordon Sherman doesn't show up, you can talk about NSF and ACM.&rdquo; Reflecting on these three points, I realized with some sadness that I was ill-prepared for the role. First, as a Computing Center Director, I don't have a sense of humor. Second, as an old Giant fan, I've had a recurring dream of being called to pinch-hit for Willie Mays, but I didn't have enough time to grow a beard or acquire the other attributes necessary to pinch-hit for Preston. And third, I believe Milton had a somewhat easier task in justifying the ways of God to man than Gordon had in justifying the ways of NSF to small colleges.
CMS at North Carolina State University: Tailoring a time sharing system for computer science instruction
Authors: Lionel E. Deimel,  Jr.
Venue: ACM SIGCSE Bulletin (1982)

The convenience of a time sharing system from the point of view of a computer science instructor is considered. Tools which may be helpful for course administration are described. The experience of the North Carolina State Computer Science Department with its IBM VM/CMS system is considered in detail and its strengths and weaknesses noted.
Real-time algorithms for string-matching and palindrome recognition
Authors: Zvi Galil
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

We give a sufficient condition when an on-line algorithm can be transformed into a real-time algorithm. We use this condition to construct real-time algorithms for string-matching and palindrome recognition problems by random access machines and by Turing machines.
The Missouri statewide Automated Standard System of Psychiatry problems and partial solutions
Authors: Ivan W. Sletten
Venue: Proceedings of the ACM annual conference (1973)

The Missouri Automated Standard System of Psychiatry (SSOP) is a system in which both business and clinical information is gathered from a statewide Division of Mental Health. It involves 10 major, 19 minor institutions and a great number of outpatient clinics. It was begun in 1966 as a joint effort by the Missouri Institute of Psychiatry, a branch of the University of Missouri and the Missouri Division of Mental Health. The aims are 1) to use computer technology to develop a psychiatric information system providing multiple reports from minimal input. 2) To monitor and evaluate patient care programs. 3) To provide clinicians computer aided suggestions for patient care and 4) to provide business and administrative support in such areas as patient billing, inventories, property control and in fiscal management.
A fast parallel algorithm for the maximal independent set problem
Authors: Richard M. Karp, Avi Wigderson
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

A parallel algorithm is presented which accepts as input a graph G and produces a maximal independent set of vertices in G. On a P-RAM without the concurrent write or concurrent read features, the algorithm executes in O((log n)4) time and uses O((n/log n)3) processors, where n is the number of vertices in G. The algorithm has several novel features that may find other applications. These include the use of balanced incomplete block designs to replace random sampling by deterministic sampling, and the use of a &ldquo;dynamic pigeonhole principle&rdquo; that generalizes the conventional pigeonhole principle.
The training of teachers in the use of computers in the classroom
Authors: Pamela McGinley
Venue: Proceedings of the annual ACM SIGUCCS symposium on The administration and management of small-college computing centers (1972)

Since the use of computers is increasingly common in school administrative and instructional programs, teacher and administrator training is of utmost importance. Teachers and administrators are being called upon, increasingly, to make important and costly decisions regarding curriculum content, computer languages, and equipment, as well as the administrative side regarding scheduling, trade reporting, budgeting, etc. Too often these teachers and administrators have had little or no appropriate preparation for this responsibility. Traditional college and university courses in computer programming or data processing have not been suitable for the special needs of teachers or administrators. The typical course is FORTRAN programming with no exploration into the why or the how of computers, no discussion of appropriate teaching methods and materials, and no motivation in using the computer to extend instruction.
On-line information retrieval
Authors: Roger K. Summit
Venue: Proceedings of the ACM 1980 annual conference (1980)

The methods of information retrieval in general use today are straightforward and easy to understand. They include batch and interactive, either of which can utilize a sequential search or inverted index file structure - with peculiar advantages and disadvantages to each. Most important recorded literature from 1970 is represented in the form of bibliographic citations and abstracts; the purpose of the system is to identify citations which are relevant to a given interest. Queries are most often formulated as Boolean combinations of keywords and phrases. Many specialized service bureaus exist to provide information retrieval services. For the most part such services are located within the commercial sector of the economy, but more and more government services are tending to encroach upon the commercial market place. Vast networks of users are served via packet-switched, value-added telecommunications service networks. As the industry grows, various conflicts arise which are considered in some detail, as is the outlook and challenges faced by the industry.
The early history of COBOL
Authors: Jean E. Sammet
Venue: ACM SIGPLAN Notices (1978)

This paper discusses the early history of COBOL, starting with the May 1959 meeting in the Pentagon which established the Short Range Committee which defined the initial version of COBOL, and continuing through the creation of COBOL 61. The paper gives a detailed description of the committee activities leading to the publication of the first official version, namely COBOL 60. The major inputs to COBOL are discussed, and there is also a description of how and why some of the technical decisions in COBOL were made. Finally, there is a brief &ldquo;after the fact&rdquo; evaluation, and some indication of the implication of COBOL on current and future languages.
Multi-party protocols
Authors: Ashok K. Chandra, Merrick L. Furst, Richard J. Lipton
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

Many different types of inter-process communication have been examined from a complexity point of view [SP, Y]. We study a new model, in which a collection of processes P0, ..., Pk&minus;1 that share information about a set of integers {a0, ...,ak&minus;1}, communicate to determine a 0-1 predicate of the numbers. In this new model, tremendous sharing of information is allowed, while no single party is given enough information to determine the predicate on its own. Formally, each Pi has access to every aj except for ai. For simplicity, we only allow the parties to communicate as follows.
An Efficient RP (Rendezvous Point) Replacement Mechanism for Rendezvous-Based Multicast Routing
Authors: Bhed Bahadur Bista, Goutam Chakraborty, Toyoo Takata
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

There are basically three types of multicast routing protocols: broadcast and prune, membership advertisement and rendezvous-based whose examples can be DVMRP, MOSPF and PIM-SM respectively. In rendezvous-based protocol, each multicast group address is mapped to a address called 'core' or 'rendezvous-point' (RP). Members willing to receive data sent to the group .rst join the RP. When a RP fails, a new RP should be selected and the multicast group should be mapped to it. In this paper, unlike bootstrap mechanism which redistributes RP-set should a RP fails, we propose a mechanism to construct a RP table at each PIM-SM router and to distribute a pair of (RPprimary, RPsecondaries) which is a column of the RP table. In this mechanism initially a multicast group addresses are mapped to RPprimaries. When a RPprimary fails corresponding RPsecondary takes over the function of the failed RPprimary (i.e. becomes RPprimary), selects a new RPsecondary from the table, updates the table with the new (RPprimary, RPsecondary) and distributes the new (RPprimary, RPsecondary) to all routers in the domain. When the RPsecondary) fails the RPprimary selects a new RPsecondary from the table, updates the table from the new (RPprimary, RPsecondaries) and distributes the new (RPprimary, RPsecondaries) to all routers in the domain. When the RPsecondaries fails the RPprimary selects a new RPsecondaries from the table, updates the table and distributes the new (RPprimary, RPsecondaries) pair to all routers. Each router in the domain after receiving the (RPprimary, RPsecondaries) updates its table accordingly. RPprimary, RPsecondaries exchange live message periodically to check each others liveliness.
Discrete simulation applied to Mars lander
Authors: Edward M. Morgan, Jon I. Fellers
Venue: Proceedings of the third conference on Applications of simulation (1969)

NASA plans for a sophisticated Mars lander mission during the 1973 opportunity present a rigorous deceleration system design problem due to uncertainties in the environment in which the retardation must be effected. Selection of design characteristics such as ballistic coefficient, aeroshell diameter, parachute size and deployment altitude, and propulsion thrust level and initiation altitude is critical, for if a &ldquo;worst case&rdquo; design philosophy is adopted for all parameters, weight is not available to perform an interesting science mission. To establish a proper design, a certain risk with respect to environment must be accepted; this paper discusses a digital simulation tool as it has been applied to parameter trades to specify retardation design.
Simulating the impact of changes in a statewide freight system
Authors: Robert C. Bushnell, James T. Low, Edward S. Pearsall
Venue: Proceedings of the 12th conference on Winter simulation (1980)

This model of the Michigan Freight Transportation System simulates the decision processes of shippers for freight movements in the state of Michigan. Given an origin and destination, the model will produce appropriate routes for shipments of a specified commodity, and will allocate the shipments of that commodity on a percentage basis to those routes, according to the freight rates, transit times, and variability of transit times for those routes. The model can be used to examine the effect of changed circumstances on the shipments of that commodity. These can include changes in the physical network system, its ownership or operating policies, or underlying economic parameters. For either single mode or multimodal routes, the model generates the variable costs associated with these routes, the applicable tariffs, the expected transit times, and the variability of times in transit. These data are used by a probabilistic model which computes the expected &ldquo;market share&rdquo; for each of the generated routes.
A Design Verification and Logic Validation System
Authors: William A. Noon
Venue: Proceedings of the 14th Design Automation Conference (1977)

This paper describes an experimental design specification language which is &ldquo;engineer oriented&rdquo; rather than &ldquo;programmer oriented.&rdquo; Computer programs using this language as input will Create a software model of the function description, statically and dynamically check for the completeness of the function described, check the logic implementation of the function for completeness and accuracy and generate a number of documents to provide clear communications.
Procedure referencing environments in SL5
Authors: Dianne E. Britton, Frederick C. Druseiks, Ralph E. Griswold, David R. Hanson, Richard A. Holmes
Venue: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages (1976)

SL5 is a programming language developed for experimental work in generalized pattern matching and high-level data structuring and access mechanisms. This paper describes the procedure mechanism and the conventions for the interpretation of identifiers in SL5. Procedure invocation in SL5 is decomposed into the separate source-language operations of context creation, argument binding and procedure activation, and allows SL5 procedures to be used as recursive functions or coroutines. This decomposition has led to rules for scoping and for the interpretation of identifiers that are different from those found in other programming languages. Several examples of SL5 procedures are given, including a scanner based on the coroutine model of pattern matching.
Integer arithmetic algorithms for polynomial real zero determination
Authors: Lee E. Heindel
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

This paper discusses a set of algorithms which given a univariate polynomial with integer coefficients (with possible multiple zeros) and a positive rational error bound, uses infinite-precision integer arithmetic and Sturm's Theorem to compute intervals containing the real zeros of the polynomial and whose lengths are less than the given error bound. The algorithms also provide a simple means of determining the number of real zeros in any interval. Theoretical computing time bounds are developed for the algorithms and some empirical results are reported.
The impact of synchronous communication on the problem of electing a leader in a ring
Authors: Greg N. Frederickson, Nancy A. Lynch
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We consider the problem of electing a leader in a synchronous ring of n processors. We obtain both positive and negative results. On the one hand, we show that if processor ID's are chosen from some countable set, then there is an algorithm which uses only O(n) messages in the worst case. On the other hand, we obtain two lower bound results: If the algorithm is restricted to use only comparisons of ID's, then we obtain an &Ohgr;(n log n) lower bound for the number of messages required in the worst case. Alternatively, there is a (very fast-growing) function f with the following property. If the number of rounds is required to be bounded by some t in the worst case, and ID's are chosen from any set having at least f(n,t) elements, then any algorithm requires &Ohgr; (n log n) messages in the worst case.
A heuristic approach to scheduling assignments for the purpose of evaluating school floorplans
Authors: William S. Bregar
Venue: Proceedings of the 1975 annual conference (1975)

An approach to assignment of scheduled school activities to available space is presented. The assignment process is central to a program which simulates activities on a proposed school floorplan and provides feedback to school designers on the functionality of the designed space. The focus of this research is on open-plan school designs. Observation of open-plan schools showed that a large open space was generally divided and subdivided into a hierarchy of spaces. Thus, assignment of scheduled activities could not be made using standard assignment algorithms. A heuristic approach to the assignment of activities was developed, therefore, and is shown to be an effective means of obtaining reasonable, if not optimal, solutions to the assignment problems.
The APL identity crisis
Authors: J. A. Brown, M. A. Jenkins
Venue: ACM SIGAPL APL Quote Quad (1981)

When a non empty result is produced in the application of reduction to an empty array, the result is filled with the identity element of the function of reduction. This paper explores the fill elements to be used when the function of reduction is not a scalar function.
The IC Module Compiler, a VLSI system design aid
Authors: N. J. Elias, A. W. Wetzel
Venue: Proceedings of the 20th Design Automation Conference (1983)

The IC Module Compiler is a new design aid that applies structured hierarchical design methodology, similar to aspects of the methodology pioneered by the Caltech Silicon Structures Project [GRA79], to the task of defining VLSI chip logic. It converts designs described as interconnections of MSI level modules into detailed logic or functional descriptions for simulators and other chip design aids. Detailed models of the modules, including adders, counters, multiplexers and memory elements, are stored in a library. Along with a simple syntax for circuit connectivity data, the Module Compiler language features C language style constructs to support module parameterization and maximize flexibility. This paper describes the features and structure of the Module Compiler and illustrates its application through examples.
On the Danilewski method for computing the characteristic polynomial
Authors: Eldon R. Hansen
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

The Danilewski method, as commonly applied, tends to be a very unstable method for finding the characteristic polynomial of a matrix. In this paper we show that, by an appropriate computational procedure, the method seems, in general, to be relatively stable. For the examples tried, it has yielded the characteristic polynomial with high accuracy. It is a well known fact that the roots of a polynomial can vary greatly when small changes are made in the polynomial coefficients. Hence it has been argued that, to find matrix eigenvalues, one should not first obtain the characteristic polynomial. However, the Danilewski method is extremely fast and, as shown below, it seems possible to obtain eigenvalues of a given accuracy by the Danilewski method in less computing time than by other methods.