ppxscal/embedding_network huggingface dataset:
Extensible languages: A potential user's point of view
Authors: J. J. Duby
Venue: ACM SIGPLAN Notices (1971)

The purpose of this paper is to describe a computer user's concern about what extensible languages will do for him, and how they will do it. It may in some respects sound a little demagogic, by considering users requirements as priority requirements. However, as Lenin said, &ldquo;facts are stubborn&rdquo;, and if users have been used to certain performance characteristics of usual programming languages, they will want to get at least the same performance from extensible languages, and in fact much more - otherwise why switch?
Analysis of algorithms, a case study: Determinants of polynomials
Authors: W. M. Gentleman, S. C. Johnson
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

We consider the problem of computing the determinant of a matrix of polynomials; we compare two algorithms (expansion by minors and Gaussian elimination), examining each under two models for polynomial computation (dense univariate and totally sparse). The results, while interesting in themselves, also serve to display two points: 1. Asymptotic results are sometimes misleading for noninfinite (e.g., practical) problems. 2. Models of computation are by definition simplifications of reality: Algorithmic analysis should be carried out under several distinct computational models, and should be supported by empirical data.
Modeling and control of robotic mine haulage system
Authors: Ernest G. Holzmann, Kenneth B. Haefner
Venue: Proceedings of the 15th annual symposium on Simulation (1982)

Concepts borrowed from discrete and hybrid system simulation have been successfully applied in the design of a complex, distributed computer control system. The example presented is a rail haulage system for a horizontally cut coal mine. The system controls all train movements and haulage operations into and out of the mine. The control logic is embedded in the system software, distributed over three levels: 1. Central control (resident in a minicomputer) 2. Wayside control (five microcomputers in distinct mine sections) 3. Locomotive control (one microcomputer in each locomotive) The paper focuses on the wayside control. To accomplish the control objectives, the wayside software compares actual operation with the operation of a flexible reference model. That model gives the wayside control the ability to function like an intelligent robotic system.
Links-1 - a parallel pipelined multimicrocomputer system for image creation
Authors: Hitoshi Nishimura, Hiroshi Ohno, Toru Kawata, Isao Shirakawa, Koichi Omura
Venue: ACM SIGARCH Computer Architecture News (1983)

A multimicrocomputer system is described, stressing mainly software and hardware architectures, which has been constructed mainly for image creation. This system is distinctive mainly in that (i) 64 unit computers are interconnected with a root computer, each of equal performance, such that a number of unit computers constitute a pipelined computer and such pipelined computers work in parallel, all controlled by the root computer, and (ii) an intercomputer memory swapping unit is introduced, which is to be linked with a pair of unit computers to transfer a great amount of data at a time from one to the other through the use of a bus exchange switch.
A graphics system for APL users-APL/Graph-II
Authors: Larry Koenigsberg, Ned Thanhouser
Venue: Proceedings of the sixth international conference on APL (1974)

A context dependent graphics system for APL users is described. The system is divided into environmental and functional routines. The environmental routines set the current graphics environment, such as the units of reference on the display device, window definitions, rotation and scale parameters, etc. Functional routines perform actions on the display, for instance drawing a line through a series of points, according to the current environmental definitions. The system is implemented in such a manner as to allow the various graphic commands to be simply understood at a glance. For example, one can type: DRAW HOUSE AT 1 3 The environment for this operation could have been specified by writing: USING INCHES SET ROTATION TO 45, SCALE TO 3 .5 This would cause the graphic object HOUSE to be drawn in inches, at a rotation of 45&deg; with an X-scale factor of 3 and a Y-scale factor of .5. The use of context dependent graphics allows the user to program in a more natural manner. Objects may be defined in one context and then utilized in many others. Context dependency should be particularly attractive to the APL user, who thereby has available the means for facile interactive manipulation of graphic entities.
The simulation of partial differential equations on the digital differential analyzer
Authors: George Forbes
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

The mathematical analog involved in the Digital Differential Analyzer, (Digital Analog Computer), requires a different approach to partial differential equations. The usual boundary and initial condition problem becomes a selection of auxiliary partial differential equations and of point starting values for the various partial derivatives of the dependent variable. The DDA System is not suited for the usual classical method of condition definition. In some special cases the classical approach may be made more general because the ordinary differential equations need not be solved, In such case, assumed separability may be an order higher. This paper discusses these problems and describes the nature of the generalities involved. It is pointed out that the Digital Differential Analyzer can &ldquo;solve&rdquo; the simultaneous case of the common partial differential equations.
Installation of a large electronic computer
Authors: L. R. Johnson
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

The Department of the Air Force now owns, operates, and maintains a Univac on premises of its own. The installation in the Pentagon of Univac #2 was formally completed on June 25, 1952. This was the first Univac to leave the factory of the Eckert-Mauchly Division of Remington Rand, Inc. Since June 25th all maintenance has been performed by Air Force personnel. While there is nothing particularly new to be gleaned from the limited operating experience with Univac #2, the experience of getting it into operation in its permanent home may be of interest. One measure of the extent of such a project is indicated by the fact that active preparations for this computer began more than 18 months before the installation contract was terminated. In this period some 16 manyears were directly allocated to necessary training of programmers and engineers and to the coding and testing of instruction routines needed to get into effective operation.
The use of electronic mail for user services
Authors: Gerald R. Lathrop
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

One of the most effective means of providing remote user services in a network is through the use of electronic mail. The advantages of such systems should not be overlooked, however, for user services at the local level. This paper examines the advantages and disadvantages of electronic mail in both a network and local environment, and makes some suggestions as to how these systems can be used more effectively for user services.
Mod-PROLOG, a modular, microcomputer oriented PROLOG
Authors: G. Battani, J. C. Guzmán, A. Márquez, M. J. Peyer
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

In this paper we propose a new implementation of PROLOG which is designed to solve the above problems; it has new facilities, based on a new data structure that permits the definition of independent modules communicating through the exchange of PROLOG terms.
Exposure, knowledge or skill the computer literacy dilemma
Authors: Theodore C. Willoughby
Venue: The Proceedings of the Twentieth Annual Computer Personnel on Research Conference (1983)

There was a time when computer knowledge was so esoteric that only specialists needed to be educated. Only large organizations had computers and skills were needed only by the professional staff. Now the scene has changed. Computers are being used in the smallest of firms. Today there are millions of computers in homes, and there are offices with more computers and/or terminals than employees. There is some possibility that in the future all financial transactions and much shopping will be done by computer. Thus it is obvious that computer literacy is needed by all people. The question is not whether but rather what kind of education is required. There are three levels of understanding that may be imparted in education. One can teach a subject to the level of a basic understanding or general knowledge. Or one can provide detailed knowledge. Finally, one can develop in the student the ability to make skillful use of the subject area. Music appreciation, counterpoint and private vocal lessons illustrate the differences in one field of study. In curriculum development in business we tend to solve the question of depth of knowledge this way. All students are required to have a general understanding of the business core and a detailed knowledge of a major field. In addition, we expect that skills be developed in communications and quantitative methods. We carried over this pattern into data processing. However, we didn't know whether DP was a quantitative area requiring skill development or not. Thus we have Introduction to Data Processing courses that develop a programming skill in some language and others that just talk about programming but don't do any of it. There is substantial disagreement among educators as to the correct course of action. This lack of agreement, as well as a belated entry into DP education, has resulted in a limited and uneven computer education in colleges of business. Our graduates vary from computer illiterate to very skillful user. What to do about this situation is the focus of this study.
Autodoc: Computer-based assistance for document production
Authors: Michael D. Callahan, Gloria Lauer Grace
Venue: Proceedings of the 1967 22nd national conference (1967)

Autodoc is a man-machine system designed to provide automated documentation capability to assist professional and secretarial personnel in carrying out their routine work assignments. The initial application is the production of user documentation. However, design intent is not limited to this single application. The completed system permits broad application by a variety of users. This system provides automated capability for document production, maintenance, and bookkeeping.
Recoverability of modular systems
Authors: Philip M. Merlin, David J. Farber
Venue: ACM SIGOPS Operating Systems Review (1975)

In [1] GOSTELOW-VAN WEERT, it was shown that processes can be described by Petri-nets (PN). In this note we will demonstrate a way of designing programs using Petri-nets as a way of describing the desired behavior. This approach makes it possible to utilize all the theoretic knowledge developed for PN and thus provides a powerful tool for program design. In an example of this approach we show how to design a recoverable program. This design is based on a study of recoverable PN's presented in [2], [3], [4] and [5]. In this note, we will not deal with the code itself, but with the structural organization of the programs. Our approach is based on an hierarchical, top-bottom, modular design. At each level a description of the desired system behavior is given. This description is then modeled by a PN and analyzed using the theory developed for PN's. This analysis allows one to check for, among other things, properties of the systems such as recoverability, proper termination, etc. These properties are inherently structural and not dependent on internal module semantics.
Improving and refining programs by program manipulation
Authors: Thomas A. Standish, Dennis F. Kibler, James M. Neighbors
Venue: Proceedings of the 1976 annual conference (1976)

By manipulating programs to reorganize the way they compute their results, it is possible to improve program performance in certain desirable directions. Further, using certain laws of exchange, it is possible to transform concise, abstract, high-level programs into efficient, concrete , underlying representations. This paper explores the notion of using source-to-source transformations interactively as a basis for an approach to program improvement and refinement. Examples of program manipulation are presented that convey both the flavor of the approach and its requirements.
A simulation model of urban politics
Authors: Frank L. Adelman, Irma Adelman
Venue: Proceedings of the 5th conference on Winter simulation (1971)

As part of a projected simulation of the social, political, and economic character of an urban community, a simulation model of the political subsystem of a large city has been constructed. The model assigns utility functions and decision rules to the aldermen and mayor of the city, who take into account both potential votes and job and favor patronage. A bargaining submodel is included, and the roles of the mayor, the media, and community interest groups are taken into account explicitly. The construction of the model and the validation process are discussed.
A &ldquo;Dogleg&rdquo; channel router
Authors: David N. Deutsch
Venue: Proceedings of the 13th Design Automation Conference (1976)

This paper presents an algorithm for interconnecting two sets of terminals across an intervening channel. It is assumed that the routing is done on two distinct levels with all horizontal paths being assigned to one level and all vertical paths to the other. Connections between the levels are made through contact windows. A single net may result in many horizontal and vertical segments. Experimental results indicate that this algorithm is very successful in routing channels that contain severe constraints. Usually, the routing is accomplished within one track of the mathematical lower bound. The routing algorithm presented here was developed as part of LTX, a computer-aided design system for integrated circuit layout and was implemented on an HP-2100 minicomputer. A typical channel (300 terminals, 100 nets) can be routed in less than 5 seconds. Routing results are presented both for polycell chips under development at Bell Laboratories and for examples that exist in the published literature. For the latter, reductions of 10% in the wiring area were typical.
CALMOS: A portable software system for the automatic and interactive layout of MOS/LSI
Authors: Herman Beke, Willy Sansen
Venue: Proceedings of the 16th Design Automation Conference (1979)

CALMOS (Computer Aided Layout of MOS) is a computer system for the layout of custom MOS/LSI circuits. Starting with a standard cell library and a simple circuit connectivity description, the program performs various automatic and/or interactive procedures such as initial placement, assignment of equivalent and equipotential pins, optimization of the placement, prerouting, routing, routing compression, fan in fan out and crosstalk verification and circuit verification. The database has reentrant properties such that a designer can step through the system and try out different possibilities. After each step the results are immediately available and can be compared with previous outputs. This on-line optimization avoids multiple rerunning of the task and will also yield a better chip minimization.
BUBBLE: Relationship diagrams using iterative vector approximation
Authors: Gilles Fortin
Venue: Proceedings of the 15th Design Automation Conference (1978)

The BUBBLE program generates relationship diagrams from a list of elements (rooms, peoples, functions, etc.) and a relationship matrix between these elements which specifies desirable distances. Every element is considered as a point in 2-D space in which vectors approximating the specified distances are applied. An equilibrium state is reached after a few iterations. Because the program can also take into account the size of elements and their orientation, it is a useful tool in preliminary architectural layout. The layout problem is described and the BUBBLE approach is stated and compared with other layout techniques such as enumeration, hill-climbing, build-up models, a detailed description of the algorithm is supplied. Some examples are discussed. Test-cases describe the efficiency and the limits of the approach. The program is currently being used by students in architecture to help them gain insight on using relationship matrices to solve preliminary layout problems.
A CAI system based on modifications to York/APL
Authors: Steve Peterson
Venue: Proceedings of the sixth international conference on APL (1974)

This paper describes a CAI system based on York University's implementation of APL. This CAI system is based not only on APL functions but also on a number of modifications to the system itself. A brief description of York/APL, noting the major differences between it and APL/360 is given, followed by a general description of the requirements of a CAI system. The body of the paper deals with the modifications made to York/APL en route to using it as a basis for CAI at Simon Fraser University.
Minicomputers, main frames, and distributed systems (Keynote Address)
Authors: Maurice V. Wilkes
Venue: Proceedings of the first SIGMINI symposium on Small systems (1978)

I propose to divide this lecture into three parts. I would first like to look at the situation as it exists at the present day and to consider the question &ldquo;When do we use mini-computers and when do we use a main frame? &rdquo;. Secondly, I would like to canvass a few ideas, some of them admittedly speculative, on the way in which minicomputers may develop. Thirdly, I would like to consider possible computer systems of the future in which mini-computers form the principal building blocks.
A model for the test evaluation of Advanced Group Rapid Transit [AGRT] systems
Authors: Norman R. Nielsen, Waheed Siddiqee, Marilyn S. Sanfilippo, Peter J. Wong
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

The design and evaluation of the Central Management System (CMS) for an Advanced Group Rapid Transit (AGRT) system is a very complex undertaking. The CMS is responsible for the routing and scheduling of hundreds of vehicles and for the making of thousands of passenger-vehicle assignments per hour in order to transport passengers between the various guideway stations in the network. This volume of decision making, coupled with the level of detail and complexity commonly found in CMS algorithms, forces the system designer/evaluator to employ computational tools to assist him in his work. This paper describes such an analysis tool. The results of applying this discrete-event simulator to an illustrative AGRT network have been previously described (5). The simulator actually encompasses two different systems. One system models the actual decision logic of the CMS algorithms. Thus, vehicle locations and waiting passengers are tracked at all times, and the appropriate vehicle routings and passenger-vehicle assignments are made. The other system must model the effects of the vehicle control system. Otherwise, vehicle locations would not be properly identified for the CMS decision algorithms. Normally, the accurate tracking of vehicle locations involves the maintenance and frequent recalculation of vehicle velocities and accelerations. This volume of calculation causes the simulation to execute slowly, to be expensive, and hence to be considered ineffective in studying CMS-level problems. Our approach permits vehicle positions to be updated accurately at only those points where the information is needed for decision making, significantly reducing computational requirements. The foundations of our approach are set forth in the paper, so that other investigators may apply this technique. The simulator is designed to accommodate a very broad range of network configurations, traffic loads, vehicle populations, and operating policies via parametric adjustments, so that this tool can be used by a broad community of investigators.
A model for workload characterization
Authors: A. K. Agrawala, J. M. Mohr
Venue: Proceedings of the 3rd symposium on Simulation of computer systems (1975)

A major problem in the evaluation of the performance of a multiprogrammed, time-sharing computer system is the development of an accurate description of its normal workload. In evaluating the performance of a computer system, the validity of the analyzed data can be no better than the degree to which the test workload represents the real workload. The paper reports on the research aimed at developing a probabilistic model of the workload which can be validated with respect to the real workload and is easy to use in a performance evaluation study. In this characterization, the workload is modelled as a mixture of a number of classes. The distribution of load in each class is described by a unimodal distribution of various resource loadings. Therefore, the workload is modelled as a mixture distribution in an appropriately chosen n-dimensional space. By increasing the number of classes the mixture distribution model allows us to model a complex multimodal distribution. At present, we are studying the workloads on the Univac 1108/1106 computer at the Computer Science Center of the University of Maryland. This installation is used for educational and research computing by the students and faculty at the University and handles a workload of several thousand processes during a typical day. Some results of this study are presented.
Dynamic Movement Prediction: An on-line railroad simulation model
Authors: Michael G. Tashker, Peter J. Wong
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

The Dynamic Movement Predictor is a FORTRAN event-step railroad simulation. It is initialized with yard inventories and consists of trains currently running from an on-line data base (i.e., RAILS: Railroad Automated Identification and Location System). The user inputs block definitions, train schedules and marshalling instructions as well as expected traffic for nonautomated network points. The simulation generates yard and train reports as well as system cost statistics. The simulation system allows the user great flexibility in editing the input data and allows him to make tactical operating decisions, due to fast turnaround time.
A GPSS planning model for large scale strip harvesting
Authors: Richard A. Sammis, Thomas J. Corcoran
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

The degree of mechanization in timber harvesting throughout North America has been so complete that the once highly hand-labor intensive practices can now be characterized as becoming devoid of human effort, personal risk, and climatic discomforts. As this age of mechanization continues to advance, the regular application of vigorous planning approaches will understandably increase. Simulation offers high potential in this regard. A GPSS (General Purpose Simulation System) application has been developed that can prompt innovative analysis, under a flexible modular formate, of equipment requirements and operational schedules for a large scale logging system.