ppxscal/embedding_network huggingface dataset:
Four models for the analysis and optimization of program control structures
Authors: Terrence Pratt
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

The analysis of the relation between the structure of a program and the function that it computes requires a decomposition of the program into its components. Traditionally this decomposition has been based on the common division of a program into subprograms, and ultimately into statements, expressions and individual variables and constants. In this paper an alternative decomposition is proposed that is based on the decomposition of a program into a set of kernel elements, those program elements that participate in the direct computation of the outputs of the program, and a set of control elements, those elements that participate in the determination of the execution path. The kernel-control decomposition of a program leads to a series of progressively more abstract program representations, each of which has both theoretical and practical interest. The separation of control structure from kernel and the three abstract models presented here, which are based on this decomposition, are particularly valuable in the analysis and optimization of program control structures. This research summary outlines the major results, which will be reported in full in a journal article.
A layout strategy for VLSI which is provably good (Extended Abstract)
Authors: Frank Thomson Leighton
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

In this paper, we introduce a new framework within which to study VLSI layout problems. The framework is based on a straightforward generalization of the Lipton-Tarjan notion of a planar separator and, unlike previous approaches, leads to universally close upper and lower bounds on the layout area and crossing number of an arbitrary network. In addition, the framework permits simple proofs of results previously thought to be difficult and is suitable for use with good bisection width heurisitcs.
Proving assertions about programs that manipulate data structures
Authors: Derek C. Oppen, Stephen A. Cook
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

In this paper we wish to consider the problem of proving assertions about programs that construct and alter data structures. Our method will be to define a suitable assertion language L for data structures, to define a simple programming language L' for constructing and altering data structures, to give axioms and rules of inference (in the style of [Hoare 1969]) which specify the effect of program segments on data structures (described by formulas in L) and finally to prove that these axioms are correct (relative to a formal definition of the semantics of L') and, in a reasonable sense, complete. Thus our intention is to provide a complete theoretical framework for describing arbitrary data structures and proving assertions about programs that manipulate them.
Changes that users demanded in the human interface to the Hermes Message System
Authors: Charlotte D. Mooers
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

The Hermes Message System has evolved in response to the needs and criticisms of users. This paper gives examples of some less than successful features, many of which have been changed, so that future designers will know what didn't work, as well as what does. Principles derived from this experience are: (a) What you see should be what you can type. (b) Commands and syntax should be uniform. (c) Commands and objects should be organized into groups. (d) Hierarchy is great for organizing things you know about but much less useful for finding things you don't know. Even with careful design, it is impossible to predict what users will dislike so it is important to design programs so they can be easily changed.
A language extension for controlling access to shared data
Authors: Anita K. Jones, Barbara H. Liskov
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Controlled sharing of information is needed for many applications. Access control mechanisms exist in operating systems to provide such controlled sharing. However, programming languages currently do not support such a facility. This paper illustrates how an access control facility could be incorporated in a programming language. The mechanism described is suitable for incorporation in object-oriented languages that permit the definition of abstract data types, and is defined in a way that enables compile time checking of access control.
Digital simulation for detecting congestion in hospital facilities
Authors: G. Miles Johnson, William W. Happ
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

Alternatives to eliminate hospital congestion are tested quantitatively by simulating the flow of patients, materials, and decisions. Critical parameters are determined by (i) layout of facilities (ii) time of day or (iii) scheduling of services. With the aid of GERTS GQ (Graphical Evaluation and Review Technique for Simulation - Gated Queue network simulation program), it is possible to identify causes of congestion and low productivity. The technique is useful in projecting planned modifications in the system, including scheduling strategies, changes in resources or in patient load.
A simulation procedure for estimating bias in well diversified portfolios
Authors: George M. Frankfurter, Herbert E. Phillips
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

The existence of a selection bias in applications of the portfolio selection models have previously been identified. The importance of this bias, in terms of the magnitude of its potential impact on portfolio selection, has never been demonstrated. Monte Carlo approaches are used in this paper in order to demonstrate that selection bias is more than a mere mathematical curiosity; the effects of this bias are very significant. Other insights are provided by the simulations. The point is made that these insights would be impossible to achieve without simulation.
Gulf Computer Network Economic Planning Model
Authors: M. Boksenbaum
Venue: Proceedings of the 3rd symposium on Simulation of computer systems (1975)

The Gulf Computer Network Economic Planning Model (GCNEPM) is a planning tool to aid in the management of data processing resources. The objective of the model is to determine the most cost-effective combination of computer and communications systems and equipment to handle Gulf's needs. This model is an application of mixed integer programming.
Using a computer aided graphics system to help design and draft automotive components
Authors: Ned L. Brown
Venue: Proceedings of the 14th Design Automation Conference (1977)

This paper will describe how the Product Engineering Department of an Automotive Accessory Manufacturer, has utilized computer graphics to aid in the design and drafting of a variety of products. It will briefly describe the general justification for obtaining equipment, what equipment is being used, and the organization for using it, and typical applications in both design and drafting. Five problems related to using computer graphics will be discussed followed by a description of three techniques that have been used to improve system efficiency. In closing, it will look at some problems related with using computer graphics as well as its future, as seen from a authors view point.
Human vision, anti-aliasing, and the cheap 4000 line display
Authors: William J Leler
Venue: ACM SIGGRAPH Computer Graphics (1980)

Despite its other advantages, one of the major objections to raster graphics has been the poor image quality and aliasing effects caused by discrete sampling. These effects include &ldquo;jaggies&rdquo; or stair-stepping, crawling, line breakup, and scintillation. Several solutions have been proposed in the literature, however, most suffer severe drawbacks and are only partially successful at eliminating aliasing effects. One solution, area anti-aliasing, is not only effective, it produces results comparable to higher resolution systems. Using widely available data on human visual response, it is shown how this technique actually increases the perceived resolution of a display beyond the hardware resolution by factors of up to 16X. The requirements of such a system are discussed, as well as some of the problems encountered.
Computer graphics for simulation problem-solving
Authors: Thomas E. Bell
Venue: Proceedings of the third conference on Applications of simulation (1969)

Interactive computer graphics was used while simulating a computer system. The graphics capabilities were extremely valuable for sifting through the large volume of simulation output in order to discover anomalous behavior characteristics. Hard copy options were available, and they were used extensively.
Design of a microprogramming language
Authors: Gérard L.M. Noguez
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

This paper attempts to define some of the fundaments of a high level microprogramming language. In particular, we have attempted to design tools to describe and process parallel orders. These tools are based on an uniform tree structure issued from the structured programming. That allows to process and optimize microprograms as normal data sets. There is no &ldquo;GO TO&rdquo; or &ldquo;ASSIGN&rdquo; statements. An instruction segment is written as a complete parenthesis expression, using iterative and conditional clauses. The variables are replaced by sequential functions and a logical or arithmetical expression is described as the composition of combinational functions. These features are used to optimize the data sets management. The suggested writing facilities give a readable and computable description of the instruction set and data flow of a computer. The set declarations structure, added to the sequential and parallel notations, allow to optimize the user's sequences of parallel orders, through the mixing declarations. Illustrating our concepts, a description of the mini-computer ELBIT 100 is given.
Automation of manufacturing planning, shop loading and work measurement in an engineering job shop environment
Authors: Edward J. Bresnen
Venue: Proceedings of the 16th Design Automation Conference (1979)

A computer assisted system using standardized operations to prepare shop estimates, planning, status reporting, and work measurement information. Describes the development process, operational capabilities and current application at TRW Defense and Space Systems Group.
Table: Object oriented editing of complex structures
Authors: Ted J. Biggerstaff, D. Mack Endres, Ira R. Forman
Venue: Proceedings of the 7th international conference on Software engineering (1984)

This research adopts the point of view that much of software development is a process of editing complex structures, structures that represent a tightly coupled integration of textual and graphical material. In the context of text and table objects, this research explores a Smalltalk-like, object oriented architecture for editors of such complex structures. Based on this experience, we propose certain design and operation principles for such editors.
Dynamic decentralized cache schemes for mimd parallel processors
Authors: Larry Rudolph, Zary Segall
Venue: ACM SIGARCH Computer Architecture News (1984)

This paper presents two cache schemes for a shared-memory shared bus multiprocessor. Both schemes feature decentralized consistency control and dynamic type classification of the datum cached (i.e. read-only, local, or shared). It is shown how to exploit these features to minimize the shared bus traffic. The broadcasting ability of the shared bus is used not only to signal an event but also to distribute data. In addition, by introducing a new synchronization construct, i.e. the Test-and-Test-and-Set instruction, many of the traditional. parallell processing &ldquo;hot spots&rdquo; or bottlenecks are eliminated. Sketches of formal correctness proofs for the proposed schemes are also presented. It appears that moderately large parallel processors can be designed by employing the principles presented in this paper.
The computer system representation problem
Authors: Gary J. Nutt
Venue: Proceedings of the 1st symposium on Simulation of computer systems (1973)

The computer system representation problem arises whenever a simulation designer attempts to derive knowledge necessary to faithfully model a computer system. The attendant time and effort expended in gaining that knowledge is often significant with respect to the total amount of time and effort relegated to simulation model construction. This paper argues for a standardized method of representing computer systems and provides some criteria for defining such a representation. Some attempts at a solution to the problem are briefly surveyed.
A heterogeneous multiprocessor design and the distributed scheduling of its task group workload
Authors: Leslie Jill Miller
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

A multiprocessor architecture is proposed which is based on the Multics concept of having all on-line information processor-addressible. All memory management is done by an intelligent paged virtual memory system, and each processor deals only with those segments relevant to its single executing program. The processors are chosen to have different implementations of a single system-wide instruction set and the problem is to effectively schedule different categories of programs, called task groups, on the dissimilar processors. Average weighted instruction times for each task group on every processor are defined as task/processor suitability measures, and typical values are given for different groups of programs running on IBM 370 models. Through the use of linear programming techniques, an optimal schedule for any such multiprocessor is then defined for the static case where task group loads and task/processor suitability values are known in advance. A priority-based task management scheduling algorithm is then defined which uses the optimal schedule of the formal model as a parameter, and its performance is simulated.
SICDOC (Panel Session)
Authors: Nancy Phillips, Joseph Santini, Tom D'Auria
Venue: Proceedings of the 1976 annual conference (1976)

Assuming that documentation is going on during the design phase of a project, how can the documentor influence the system design? Frequently producing user documentation reveals design and implementation flaws, especially when it is done, as it should be, by someone other than designers and programmers themselves. What right has a documentor, acting in his capacity as user representative, to insist on a system change in the event of a serious design flaw? Can feedback be maintained at too high a degree, such that the documentor loses his ability to represent an outsider's view?
UTMC's LSI CAD system - highland
Authors: K. Anderson, R. Powell
Venue: Proceedings of the 21st Design Automation Conference (1984)

The HIGHLAND [1] integrated logic design system, for the design of gate array and standard cell IC's is described. While the main system features are reviewed, the major emphasis is on system software control and release issues.
Correct and optimal implementations of recursion in a simple programming language
Authors: Jean Vuillemin
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

The object of this paper is to study the mechanism of recursion in a simple, LISP-like programming language, where the only mean of iteration is through recursion. The theory of computation developped in Scott [4] provides the framework of our study. We show how the implementations of recursion which deserve to be called &ldquo;correct&rdquo; can be characterized semantically, and demonstrate a general criterion for the correctness of an implementation. We then describe an implementation of recursion which is both correct and optimal in a general class of sequential languages, and therefore constitutes an attractive alternative to both &ldquo;call-by-name&rdquo; and &ldquo;call-by-value&rdquo;.
Analysis of a multiprocessor system with a shared bus
Authors: L. L. Kinney, R. G. Arnold
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

An analysis for a multiprocessor system with a shared bus is given. The analysis applies to application areas where the task to be performed can be partitioned into largely independent subtasks. Each subtask requires cyclic execution on continuous data input. The objective is to determine the processing power of such a system as the number of subtasks or, equivalently, as the number of processors is increased. First, it is assumed that the partitioning of the task can be done without incurring any overhead in processor execution time (E) or bus usage time (I). Upper bounds on the processing power are determined that are independent of the bus type and bus allocation scheme. The upper bounds are functions of the number of processors and the ratio (E/I). The upper bound on processing power increases linearly with the number processors until it reaches the value E/I. Secondly, it is assumed that the partitioning causes an overhead in processor execution time and bus usage time that increases linearly with the number of processors. If the processor execution overhead predominates, then the number of processors required to obtain maximum processing power is greatly increased and the maximum processing power attainable is limited by the overhead factor for any E/I. If the bus usage overhead predominates, then the maximum attainable processing power is reduced and is reached with fewer processors, i.e., the bus is saturated with fewer processors. Thirdly, a specific bus allocation scheme is analyzed namely FIFO, assuming randomly distributed processor execution and bus usage times with average values E and I, respectively. In this case, the processing power is lower than what is ideally attainable (partitioning without overhead) for any value of n. As n becomes large, the maximum approached is the same as in the ideal case.
A syntax-oriented formal system for defining processes
Authors: Clifford Hollander
Venue: Proceedings of the ACM annual conference (1973)

In this paper, a syntax-oriented formal system, called a metaprocess, is proposed for defining (and perhaps implementing) processes. The metaprocess functions as a kind of generalized metacompiler, in that it occupies the same relationship to a process as a metacompiler does to a compiler. The notion of an interpreter is developed to model the operation of each process and a metalanguage provides the vehicle for designating the actions performed by an interpreter. A combined syntactic-semantic specification of a process' input stream is used to drive the associated interpreter. The syntactic portion of this specification is in BNF while its semantic counterpart is in an Algol-like language. From this viewpoint, the inputs to the process serve as a sequence of directives to its interpreter.
Tracing occurrences of patterns in symbolic computations
Authors: F. Gardin, J. A. Campbell
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

A report is made on the present state of development of a project to construct a tracing aid for users of symbolic computing systems that are written in LISP (or, in principle, any similar high-level language). The traces in question are intended to provide information which is primarily in terms that are natural for a user, e.g. on patterns of actions performed on his data, or patterns occurring in the data themselves during the operation of his program. Patterns are described in a syntax which is inspired by SNOBOL.
Stylitism, Synergism, And Syncretism: The interface of computer science and operations research
Authors: Richard E. Nance
Venue: Proceedings of the 1978 annual conference (1978)

In 1970 I authored a paper dealing with the interface of Operations Research and Computer Science, which was presented at the 37th Meeting of ORSA on April 20-22, 1970. [NANCR70]. That paper, which included the thoughts and opinions of several eminent computer scientists, has proved to be interesting reading some eight years later. My view of the interface between the two disciplines has changed but slightly in that time; nevertheless, certain intersections of the two disciplines are now more clearly defined. Nevertheless, the belief that I have a better picture of the computer science and operations research interface is probably as illusory now as it was in 1970.
Some speculation on simulation and information systems
Authors: Henry C. Lucas,  Jr.
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

An information systems as a set of procedures which process data used to support decision making. Robert Anthony (1965) has suggested a taxonomy of decision types which provides information useful in thinking about systems. Strategic planning decisions involve setting the objectives of the organization. Managerial control decisions deal with the task of determining that resources are employed to achieve the goals set in strategic planning. Operational control decisions deal with the day-to-day operations of the firm. This framework stresses the fact that there are different information requirements for different types of decision problems. For example, for strategic planning one rarely needs information that is current up to the minute, where such information may be vital for operational control decisions.
Office Work Station Networks
Authors: Herb Sullivan, Theodore Baskow
Venue: Proceedings of the 1978 annual conference (1978)

The focus of office automation will be on structuring the activities of people and the information that these people use. Office work station networks will emerge in both large and small companies in the 1980-1990 era. Multiple micro processor terminals and other peripherals will be important components of these networks. The speakers in this session will address various considerations of these future networks.
APL as a statutory language
Authors: Harley M. Courtney
Venue: Proceedings of seventh international conference on APL (1975)

Man's earliest law was oral custom which arose from the necessities of his economic, social, and cultural background. But with the invention of writing, these societial rules were expressed in written form for convenience, communication, and to establish a record for reference. Thus we have the Code of Hammurabi (about 2000B.C.), the Decalogue (after 1225 B.C.), and the XII Tables of Roman Law (about 450 B.C.). The later example is of particular interest because of the reason for reducing the code to writing. In contrast to Hammurabi's attempt at public relations, and Moses desire to produce a lasting record, the &ldquo;Roman common people demanded the writing so that the patrician magistrates could not play fast and loose with the rules. Thus, among the many fundamentals bequeathed by Roman law to Western civilization is the tradition of generality and certainty.&rdquo; (1) The desire for legal certainty and brevity with the resulting clarity is the theme of this paper.