ppxscal/embedding_network huggingface dataset:
A balanced view of MUMPS
Authors: Anthony I. Wasserman, David D. Sherertz
Venue: ACM SIGPLAN Notices (1976)

The MUMPS programming system was designed and developed to facilitate shared conversational access to a hierarchically-organized data base on a small computer. The MUMPS language, which has recently been standardized, contains features for numeric and string operations, along with a built-in file system called globals, embedded in a multiprogrammed execution environment. This paper gives an overview of the MUMPS language and a typical MUMPS system, then evaluates MUMPS in terms of modern notions of programming languages and software development. Despite the many attractive features for the development of interactive programs, MUMPS is seen to have a number of shortcomings when evaluated in this way. Among the problem areas are weakness of control structures, the ability to write self-modifying code, the incomprehensibility of most MUMPS programs, and the lack of support given by the language to notions of abstraction and modularity.
The P method, a design philosophy
Authors: J. Robert Logan
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

The time is ripe for a completely new philosophy in the area of &ldquo;design&rdquo;. We are accustomed to thinking that the task of working out causal relationships requires the &ldquo;feel&rdquo; that only a human can provide. There is no concrete evidence to support this. There is evidence to the effect that design can be relegated to the field of data processing. It can be made completely deterministic. This being the case, we turn our attentions to applicable data processing techniques.
On-line large screen display system for computer instruction
Authors: Richard Cheng
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

This paper is concerned with a new instructional method to teach computer programming techniques to students in Computer Science as well as other scientific and non-scientific disciplines. Several courses in the Computer Science curriculum could be substantially enhanced if the instructional gap between the classroom lecture and the computer programming excercises could be eliminated. Rochester Institute of Technology has experimented to achieve this objective by means of an on-line large screen display system which will permit the instructors to perform classroom demonstrations to emphasize the key point of concepts or example of applications to a class of students through a keyboard with a computer. This new instructional method will eliminate deficiencies in conventional chalkboard approaches which result in material being covered too fast to be digested by the students or the course content to be diluted to match the pace of the class.
Programming languages for non-numeric processing&mdash;2: An extended ALGOL based language
Authors: G. E. Haynam
Venue: Proceedings of the 1965 20th national conference (1965)

THE PURPOSE of a problem oriented language (POL) is to provide a convenient and efficient means for expressing the algorithms for solving a large class of problems. In the past, many special problem oriented languages were developed to efficiently handle special classes of problems such as data processing, list processing, and simulation. Currently since the advent of ALGOL 60 as a very general problem oriented language, it is possible to extend the ALGOL language to include efficiently and effectively the vast majority of the special classes of problems described above. Thus, it is possible to use the ALGOL language as a basis or carrier for extended special purpose languages without losing any of the generality of the ALGOL language itself.
Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations
Authors: Martin Tompa
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

Any Boolean straight-line program which computes the transitive closure of an nxn Boolean matrix by successive squaring requires time exceeding any polynomial in n if the space used is o(n). This is the first demonstration of a &ldquo;natural&rdquo; algorithm which (1) has a polynomial time implementation and (2) has a small (e.g., O(log2n)) space implementation, but (3) has no implementation running in polynomial time and small space simultaneously. It is also shown that any implementation of Warshall's transitive closure algorithm requires &Ohgr;(n) space.
An instructional Computer Program Library
Authors: Charles M. Lovas
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

The Computer Program Library, a compilation of computer programs coded in FORTRAN and executed in the batch mode, facilitates both direct and adjunct use of the computer by students. A six year project, the library now contains over 290 fully-documented subprograms and programs which engineering students utilize for problem-solving, independent study projects, and research. In addition, the library provides the instructor with a ready source of material which may be used to augment course content in several ways. The computer program library concept has proven to be an effective method of implementing computer augmented engineering education, especially in curricular areas not adequately serviced by task-oriented software and/or in small emerging educational institutions.
The caret functions: Efficient algorithms for scans and reductions of eight Boolean functions
Authors: E. E. McDonnell
Venue: Proceedings of the sixth international conference on APL (1974)

This paper describes an efficient algorithm for the APL scans for eight Boolean functions, those whose symbols employ the caret in some orientation. The APL reduction function for each can be derived from the scan algorithm.
Simulation of a rapid-exit industrial parking structure
Authors: Edward R. Broad,  Jr.
Venue: Proceedings of the second conference on Applications of simulations (1968)

When Eli Lilly and Company considered the use of multilevel parking structures as providers of high-density parking space, concern was expressed as to operating efficiency under peak-load, end-of-workday conditions. Simulation of various types of structures addresses itself specifically to this concern and, in addition, provides interesting and useful design information regarding the structure and the configuration of structure site. This paper will review the simulation study made at Eli Lilly and Company and the application of IBM's GPSS/360 simulator package.
Using GPSS to teach operating systems concepts
Authors: Edward L. Lamie
Venue: ACM SIGCUE Outlook (1976)

Operating systems concepts are taught in many undergraduate curricula. Assignment of a student project involving the development of an operating system creates a difficult situation due to time and financial considerations. Using GPSS to simulate the behavior of the student-created operating system can diminish these problems and serve as an effective learning device. Many features and concepts can be simulated that might otherwise be ignored in a student project.
ALI: A procedural language to describe VLSI layouts
Authors: Richard J. Lipton, Stephen C. North, Robert Sedgewick, Jacobo Valdes, Gopalakrishanan Vijayan
Venue: Proceedings of the 19th Design Automation Conference (1982)

ALI is a procedural language to specify VLSI layouts. It allows the designer to describe layouts without reference to the sizes and positions of the layout elements or to the distances between them. Among the interesting characteristics of ALI are that it does not need design rule checking, is easy to extend, facilitates the division of labor and permits the easy update of a layout to new design rules or to new processes. The general features of the language and the experience gained with a preliminary implementation of it are described.
IC mask layout with a single conductor layer
Authors: Sheldon B. Akers, James M. Geyer, Donald L. Roberts
Venue: Proceedings of the 7th Design Automation Workshop (1970)

A computer program for the automatic layout of single conductor layer IC masks is described. Descriptions are included of element modelling, element placement, grid expansion, cross-over minimization, conductor routing and layout compaction.
The user-level semantic matching capability in MACSYMA
Authors: Richard J. Fateman
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

The pattern matching facility of MACSYMA, an algebraic manipulation system, is described in this paper. By taking advantage of the special semantic properties of algebraic expressions, diverse expressions are recognized as occurrences of the same pattern. For example, a semantic pattern for &ldquo;quadratic in x&rdquo; matches both 3*x**2+4 and (x+1)*(x+6). Patterns are created by declaring variables to satisfy predicates, and then composing, out of these variables, expressions which serve as templates for the pattern matching process. Efficiency is achieved by compiling programs corresponding to each pattern. Specific examples show how this recognition capability is used in augmenting simplification rules and in writing algorithms for the solution of differential equations. Other systems with related capabilities are compared with regard to their implementations and matching strategies.
Computerization and managerial control in large offices
Authors: Andrew Clement
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

There is considerable debate over whether current practices of office computerization represent a continuation or reversal of &ldquo;scientific management&rdquo; principles. This issue will be discussed in light of case study research being conducted at the head office of a large insurance firm. The company is in the process of introducing on-line systems at the clerical level in the policy administration area. As part of this process and the concomitant reorganization of the company along territorial lines, the new jobs being created show a marked reduction in task fragmentation and some lessening of hierarchy, both regarded as characteristics of Taylorian organization. However, other features of scientific management, including skill dissociation, separation of conception from execution and control by monopoly of knowledge, are still very much in evidence, with computer systems playing a central role. Taylor's ghost may be dressed in modern garb, but it is certainly recognizable in computerized offices.
Internal communications for external results
Authors: Rita Seplowitz Saltz
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

(The conference session planned includes some discussion, followed by video-taped selections to prompt problem-solving by session participants. An instrument for evaluating internal communication may be developed. The quality of service and information that a computing facility provides to its computer users depends largely upon the quality of communication among the members of the installation's staff.
Distributed virtual hosts and networks: Measurement and control
Authors: R. H. Sherman, M. G. Gable, A. W. Chung
Venue: Proceedings of the Computer Network Performance Symposium (1982)

Diverse network application requirements bring about local networks of various size, degree of complexity and architecture. The purpose of this paper is to present a network protocol layer which is used to provide a homogeneous operating environment and to ensure the availability of network resources. The network layer process probes the underlying local network to discover its properties and then adapts to changing network conditions. The principle contribution of this paper is to generalize properties of diverse local networks which can be measured. This is important when considering maintenance and service of various communication links. Three type of links are point-to-point links, multi-drop, loop or switched links and multi-access contention data buses. A prototype network is used to show a complexity improvement in the number of measurement probes required using a multi-access contention bus. Examples of measurement techniques and network adaption are presented.
Pin assignment on a printed circuit board
Authors: Leah Mory-Rauch
Venue: Proceedings of the 15th Design Automation Conference (1978)

The design of a Printed Circuit Board is complete when the board is routed. All effort prior to activating the router is aimed at insuring successful routing, often involving the following steps: 1) Assigning elements to packages (this is known as the assignment problem). 2) Placing the packages on the board (the placement problem). 3) Assigning the connections of the nets to specific pins on the packages (the pin assignment problem). Each of these steps is designed to help produce a routable board. This paper describes a method of solving the pin assignment problem that achieves routability of the board by reducing prospective wire crossings. Routability is improved by ordering the nets to be assigned to a specific set of pins according to their location relative to this set of pins, and then assigning them, in this order, to the nearest available pin.
An introduction to the simulation data language
Authors: Charles R. Standridge, A. Alan B. Pritsker
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

In this tutorial, basic concepts for using database management capabilities in simulation studies will be discussed. The implementation of these concepts in the Simulation Data Language (SDLTM) will be presented. For better understanding, the tutorial will consist of two example simulation studies, one elementary and one realistic, performed using SDL. In the course of these examples, SDL data organization constructs, expecially those for model outputs, and SDL commands will be discussed. Finally, a simulation study application performed using SDL will be overviewed.
An heuristic model for analysis of memory use under static partition allocation strategies
Authors: Trân Quôc Tê
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

This paper examines minimum memory wastage strategies for partitioning and allocating main memory to a stream of jobs, in a context where each job resides throughout its execution in a frame to which it is assigned. In contrast to usual approaches, the present one considers core memory as the main limiting resource, and assumes that job competition for other resources can be neglected. From job mix characteristics, a condition for a given memory partition to avoid system saturation is postulated. Then, among such partitions avoiding saturation, we are interested in 1) those requiring the least amount of space, 2) those leading to the lowest core fragmentation. Concerning the first problem, we give a simple method for generating the smallest partition, and show that &ldquo;exact fit&rdquo; allocation should be used. As for the second problem, if a partition is given so that exact fit meets the overload constraint then this algorithm is optimal; otherwise, best fit would be the best algorithm.
A mathematical model of a crankcase scavenged, two-stroke, spark ignited engine and comparisons with experimental data
Authors: Richard R. Booy, Roger B. Krieger, P. S. Myers, O. A. Uyehara
Venue: Proceedings of the third conference on Applications of simulation (1969)

A detailed mathematical model of the thermodynamic events of a crankcase scavenged, two-stroke SI engine is described. Energy balances, mass continuity equations, the ideal gas law, and thermodynamic property relationships are combined to give a set of coupled ordinary differential equations which describe the thermodynamic states encountered by the engine systems during one cycle of operation. A computer program is used to integrate the equations, adjusting the initial estimates until the final conditions agree with the initial estimates, that is, until a cycle results. Experimental data from the simulated engine are compared with the computed results.
Using a command language as a high-level programming language
Authors: J. R. Mashey
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The command language for the Programmer's Workbench (PWB) utilizes an extended version of the standard UNIX shell program, plus commands designed mainly for use within shell procedures (command files). Modifications have been aimed at improving the use of the shell by large programming groups, and making it even more convenient to use as a high-level programming language. In line with the philosophy of much existing UNIX software, an attempt has been made to add new features only when they are shown necessary by actual user experience in order to avoid contaminating a compact, elegant system through &ldquo;creeping featurism.&rdquo; By utilizing the shell as a programming language, PWB users have been able to eliminate a great deal of the programming drudgery that often accompanies a large project. Many manual procedures have been quickly, cheaply, and conveniently automated. Because it is so easy to create and use shell procedures, each separate project has tended to customize the general PWB environment into one tailored to its own requirements, organizational structure, and terminology. A summary is given of the usage patterns revealed by a survey of 1,725 existing shell procedures.
The software engineering technique of data hiding as applied to multi-level model implementation of logical devices in digital simulation
Authors: E. W. Thompson, N. Billawala
Venue: Proceedings of the 12th Design Automation Conference (1975)

Modularity and data hiding have been considered important software engineering concepts in the design of large software systems. Program modularity deals with the partitioning of a large program into small subprograms, namely modules performing one conceptual function. Such partitioning helps to decrease the complexity of a large system. A module being small and conceptually complete, it is easier to design, test, and can be well documented. While modularization deals with program flow, data hiding on the other hand deals with the accessing of data structures. Communication between modules is established through some form of data structure. If modules directly manipulate a data structure, then their complexity is increased and a change in the data structure would force the redesign of the modules using it. Also direct access to a data structure used by many modules may propagate an error by one module to the other modules thereby making it difficult to locate the error. Such difficulties can be minimized by introducing levels of abstraction between modules and the data structures they use. These levels of abstraction should be such that modules using a data structure should be unaffected by changes in that data structure.
Planning for microcomputer services
Authors: Rebecca Serey
Venue: Proceedings of the 11th annual ACM SIGUCCS conference on User services (1983)

In January 1982, the Instruction and Research Computer Center (IRCC) began providing a new service to the University through the Microcomputer Services Group. This group provides consulting, education, and referral services for the University community in the rapidly growing domain of microcomputers.
Features of a proposed synchronous data network
Authors: F. R.E. Dell
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

Marketing surveys on data communication have indicated the possible need for a new data service. Technical studies have resulted in a number of detailed proposals for providing a service which, although functionally distinct, is physically integrated with other telecommunications services. The proposed network utilises synchronous digital transmission with a processor controlled T.D.M. switching structure. A range of speeds is available. Users data bytes are structured in 'envelopes' to provide an in-band control signalling facility. The use of a processor for switch control gives greater flexibility, allows the implementation of sophisticated diagnostics, and, with high speed inter switch signalling, reduces overall call set up times. The proposed network is hybrid in that it can operate in a conventional circuit switched mode, or operate in a 'packet' switched mode. Extensive multiplexing is used to increase transmission utilisation and reduce local area transmission costs.
LTX - a system for the directed automatic design of LSI circuits
Authors: G. Persky, D. N. Deutsch, D. G. Schweikert
Venue: Proceedings of the 13th Design Automation Conference (1976)

LTX is a minicomputer-based design system for large-scale integrated circuit chip layout which offers a flexible set of interactive and automatic procedures for translating a circuit connectivity description into a finished mask design. The system encompasses algorithms for two-dimensional placement, string placement, exploitation of equivalent terminals, decomposition of routing into channels, and channel routing. Circuit connectivity is preserved during interactive procedures. LTX runs on an H-P 2100 series computer with 32K of memory and disc. In current applications to polycell-style layouts, one to two weeks is typically required for completion of the layout design of an LSI chip containing 500 cells.
Simulating commodity market trading policies
Authors: J. R. Emshoff, L. L. Jayaraman
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This paper describes a simulation model that was developed to help a company analyze and improve its rules for purchasing one of its key raw materials. The material is traded on a commodity market and the company had successfully developed a system for forecasting price changes in the commodity market. The corporate executives were interested in evaluating the sales and returns that could be expected when various constraints were placed on commodity trading. The simulation was initially developed to address these questiond on trading limits and subsequently expanded to provide a basis for analyzing the trading system itself.
A critical overview of computer performance evaluation
Authors: J. C. Browne
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Effective computer performance evaluation requires: theories and models which effectively represent computer systems and computer processes, evaluation techniques which generate accurate assessments of system or program behavior from models and theories, technology for data gathering on executing systems or processes and technology for data analysis. This paper assesses the extent to which these requirements are currently met. A greater emphasis on combining empirical and theoretical work is needed. The significance and value of current applications of performance measurement and analysis are assessed. Network and data base systems offer high leverage for application of performance modeling and evaluation.
Learning to use a text processing system: Evidence from &ldquo;thinking aloud&rdquo; protocols
Authors: Clayton Lewis, Robert Mack
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

There is growing interest in cognitive science in the the mental processes that underly learning and using computer systems (e. g., Bott {1}; Mayer, {2}; Card, Moran Newell {3}). In this paper we report generalizations about the problems people who are not experienced with computers have learning to use a text-processing system. We are especially interested in unaided self-instruction, because of the practical interest in reducing the role of experienced personel in the training process. We analyze these difficulties in terms of the interaction between the cognitive characteristics of the learner, and the design of self-instruction, and the interface. Finally, we are also interested in implications of these problems for designing better training methods and computer interfaces that are easier to learn.