ppxscal/embedding_network huggingface dataset:
On translating a set of rectangles
Authors: Leo J. Guibas, F. Frances Yao
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

Given a collection of disjoint objects in the plane, we are interested in translating them by a common vector. If we have a primitive for translating one object at a time, then the order in which the objects can individually be translated is often geometrically constrained. In this paper we study the nature of these constraints and exhibit optimal algorithms for finding valid motion ordering for several different classes of objects. These algorithms find use in computer display applications.
A higher level language for micro-programming
Authors: C. V. Ramamoorthy, M. Tabandeh, M. Tsuchiya
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

There are many reasons why microprogramming has become an essential architectural attribute in contemporary computers. It provides certain well-known design and manufacturing advantages. It also facilitates the emulation of other machine languages. It gives the user the opportunity to tailor instruction sets to suit his application environment. However, a number of difficulties arise when the user attempts to exploit the potential of microprogramming. When microprograms are stored in Read-Only Memories (ROM's), the advantage of dynamic modification of control information is lost at the microprogram level. Recent trends towards writable stores will obviate this disadvantage. Also, microinstruction coding (microcoding) of computers using horizontal or minimally encoded formats becomes a time consuming proposition. In the foregoing sections we shall briefly review some high level languages for microcoding and develop a new language that provides an efficient way for detecting and locating parallel processable independent actions for possible representation in microinstruction.
The design of a topology information maintenance scheme for a distributed computer network
Authors: William D. Tajibnapis
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

In order for the nodes of a distributed computer network to communicate, each node must have information about the network's topology. Since nodes and links sometimes crash, a scheme is needed to update this information. One of the major constraints on such a scheme is that it may not involve a central controller. In this report a straightforward scheme involving adjacency matrices and a broadcast scheme are discussed and their inadequacies described. The NETCHANGE Protocol which is based on Baran's &ldquo;Hot Potato Heuristic Routing Doctrine,&rdquo; is presented. This system has been implemented on the MERIT Computer Network and its correctness has been proved. We end by showing how the NETCHANGE Protocol can be modified into a shortest path algorithm.
A data structure and drive mechanism for a table-driven simulation system employing multilevel structural representations of digital systems
Authors: N. Billawala, S. A. Szygenda, E. W. Thompson
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper describes the design and development of a very large Fortran simulation program. This discussion includes; the data structure, drive mechanism, and event scheduling for a time-based digital simulation system that could handle functional level models of logical devices. Five different types of functional modules are likely to be specified: a) combinational, b) ripple-effect arithmetic, c) register, d) memories, and e) basic logical devices. Currently implemented modules include decoders, encoders, universal shift registers, up-down counters, random-access memories, and ripple-carry adders. Additional functional modules could be added and basic gates can be intermixed with the functions.
A high quality, low cost router for MOS/LSI
Authors: Roland L. Mattison
Venue: Proceedings of the 9th Design Automation Workshop (1972)

This paper presents the implementation of an automatic router for the custom design of MOS integrated circuits. Standard cells are utilized for the logical functions and are interconnected by the router according to the specific design being produced. The design program operates at a very low cost and yields results comparable to manual routing. An expansion technique is used which will give 100 percent completion of interconnection. The router will handle any cell size and will route according to any predetermined design rules. An accuracy of one-hundredth of a mil can be maintained on chips over 300 mils on a side. The router may be used to build designs automatically or, because of its very low cost, can allow manual intervention to achieve more efficient layouts.
The computer manager and his job
Authors: Malcolm H. Gotterer
Venue: Proceedings of the seventh annual conference on SIGCPR (1969)

In a recent study1 a large group of managers of medium to large computer installations were surveyed. One of the questions asked was what they felt were the major problems facing them now and in the future. Over 40% responded that personnel problems (Table I) were the most formidable. In addition, a considerable number of the managers responding to another question in the survey indicated that they did not prefer working solely with technical problems (Table II), rather preferred problems that involved people. But yet it has been observed that computer managers do, in fact, spend a good deal of their time working with technical problems. The purpose of this study was therefore to determine if the data in Table I is a true representation of the problems facing the computer manager. In this study, as in the earlier one, the computer manager or computer executive is defined as the highest-ranking person in the organization whose duties are concerned solely with computational matters.
A simulation approach to examining traditional EOQ/EOP and single order exponential smoothing efficiency adopting a small business perspective
Authors: Frederick C. Weston,  Jr.
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

This paper addresses the question of how well classical economic order quantity (EOQ) and economic order point (EOP) logic performs under conditions of varying demand over time. A second question addressed is how well does first-order exponential smoothing serve as a forecasting tool in the face of varying demand. A small business perspective is adopted. The above questions are addressed for the following reasons: 1) EOQ and EOP logic are still widely taught in schools of business, often without consideration of the current academic and practical surge of interest in material requirements planning (MRP); 2) Small businesses will be the last to join the MRP &ldquo;bandwagon&rdquo; due in part to the current lack of software and cost effective computer resources&mdash;and therefore will remain the most likely candidates for continued use of EOQ and EOP in the traditional fashion; 3) Small businesses most likely conduct less forecasting than larger organizations who provide staff to accomplish tasks such as forecasting&mdash;and therefore could potentially benefit greatly from a simplistic tool such as first-order exponential smoothing. A simulation approach is adopted for addressing the above defined research questions.
Sizing a federated computer system
Authors: Joseph B. Major
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

Discrete event simulation of a federated hardware-software system under a single resource manager is performed. Workload projections, system logic and performance information are merged into an integrated model. Data Base/Data Communication. Time-Shared and Batch work under OS/VS2 on a multisystem is modeled. System feasibility and equipment trade-offs are studied for stand-alone and concurrent subsystem operations. Statistical model validation and calibration thru benchmarks/measurements is discussed.
The effects of input/output activity on the average instruction execution time of a real-time computer system
Authors: Salvatore C. Catania
Venue: Proceedings of the third conference on Applications of simulation (1969)

The paper describes the results of a GPSS simulation of a real-time computer system undertaken to determine the effects of specific types of Input/Output (I/O ) activity on the average instruction execution time (AIET) of the system's central processor. The types of I/O activities studied are communications I/0 and references to mass storage devices. Various memory bank configurations and different memory bank referencing schemes are considered in an attempt to minimize the effects of the I/O activity on the AIET.
Performance evaluation of a batch processing computer network under different processing strategies
Authors: John Cady, Ronald M. Sorli, Barry S. Thornton
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

In an Australian national batch-oriented computer network, processing strategies have been investigated, using simulation, to give guidelines for management of the work load and to provide direction for measurement of the performance of the system under actual conditions. The nature of the conflicting interactions between computer resource utilization and transmission line requirements has been studied to provide the basis for an economic analysis to determine the most cost-effective processing strategy.
Automatic component placement in the nomad system
Authors: Charles F. Shupe
Venue: Proceedings of the 12th Design Automation Conference (1975)

Algorithms and techniques for automatic component placement, as currently used in the NOMAD System, are presented. Aspects of continuing experimental work are also discussed.
Serial link protocol design: A critique of the X.25 standard, level 2
Authors: John G. Fletcher
Venue: ACM SIGCOMM Computer Communication Review (1984)

There are certain technical design principles for link communication protocols which, if followed, result in a protocol that is less complex in both concept and implementation, but at the same time provides better service, than if the principles are not followed. These principles include modularization into sub-protocols, symmetry between the nodes on the link, and use of the state-exchange model of a conversation rather than the command-response model. The principles are described, the extent to which they are followed by the standard protocol X.25, level 2, is examined, and a protocol adhering to them is presented.
Rational approximation via minimax linear programming regression
Authors: M. Klein
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

Consider an involved function f(x) which is to be approximated in the interval (&agr;,&bgr;) by the rational function h (a, c, x): [equation] To determine h (a, c, x) we need to find the values of the unknown coefficients aj and cj. The minimax or Chebyshev criterion requires that the maximum absolute deviation (&dgr;&ge;0) of h (x) from f(x) be minimum [equation] When r&equil;0, the approximating function is a simple polynominal. Yet, we often much prefer a general rational approximation to a straightforward polynominal approximation.
A descriptive model for the design and implementation of computer systems
Authors: John Mazur
Venue: Proceedings of the ACM annual conference (1973)

We postulate a general computing model and investigate the design and implementation of systems in the postulated environment. The model is drawn from our interpretation of the writings of John von Newmann 1 and others. Its central concept is an abstraction of the capability of all digital computers to modify cells contents that represent addresses of other cells. We discuss three formulations of the model; namely, a &ldquo;programming language&rdquo; formulation using vectors, pointers, and move operators, an &ldquo;emulator&rdquo; formulation extending the first formulation to include control structure and execution semantics, and a &ldquo;mathematical&rdquo; formulation. The proposed model is specifically intended for the interactive design and implementation of software (and also hardware) computer systems. The completeness and the hierarchial nature of the descriptions based on the model allow those descriptions to serve as simulation models and documentation for the complete system being described or for any well-defined part of the system.
PANDA: A Pascal network data base management system
Authors: André Frank
Venue: Proceedings of the 5th ACM SIGSMALL symposium on Small systems (1982)

PANDA is a set of database programmes entirely written in Pascal and especially suited for small (micro) computer systems; it was developed with interactive application and computer graphics in mind. PANDA is based on the network approach to data management, as it is proposed by CODASYL| CODASYL 71|. PANDA is therefore similar to commercially available systems on main frames such as e.g. DBMS from Digital Equipment Corp. The programmes interface of PANDA was specially adapted to the use within Pascal programmes. Its use seems much easier for the programmer than the CODASYL proposal. PANDA is small enough to be used on small systems. The code for a Motorola 6809 micro-processor is about 15 kbytes. PANDA, especially its buffer management, is further adapted to small computer systems. PANDA is, however, not a system for the fast organization of data with little strucuture and does not feature an interactive query language or a report generator. PANDA is a tool for the programmer to facilitate the structuring of complicated data, not a utility for the end user.
Object oriented operating systems: An emerging design methodology
Authors: Ariel Pashtan
Venue: Proceedings of the ACM '82 conference (1982)

Object oriented design of operating systems has evolved from pure protection considerations to a more general methodology of design as exemplified in Intel's iAPX-432 machine. This paper compares and contrasts, from an architectural point of view, eight major object oriented operating systems. Five different architectural aspects have been chosen as a basis for this analysis. These aspects include: uniformity of the object approach, object type extensibility, the process concept, the domain concept, and object implementation techniques.
The use of interactive, computer-managed instruction to control the quality of self-paced training without requiring the presence of an instructor
Authors: Jesse M. Heines
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The cost of computer systems is constantly decreasing, but the cost of training people to run these systems is constantly increasing. To make training cost-effective for its small systems customers, Digital Equipment Corporation has been providing self-paced training packages for several years that can be used by its customers on-site. To control the quality of this training, Digital is now incorporating Computer-Managed Instruction (CMI) into some of these packages. This CMI component uses a sequential probability test algorithm that allows tests to vary in length depending upon the learner's skill level. This algorithm assures that the tests' results are statistically reliable while keeping their lengths as short as possible.
A GPSS model of a complex on-line computer system
Authors: Arthur C. Traub,  Jr., William F. Zachmann
Venue: Proceedings of the 1st symposium on Simulation of computer systems (1973)

This paper describes the development of a GPSS model of the First National Bank of Boston's Real Time System (RTS). RTS is a generalized on-line teleprocessing, data base management, and work scheduling system which provides an interface between the IBM operating system (OS/MFT) and on-line COBOL applications programs. The architecture of the model, based on a hierarchical process string structure, is described along with specific techniques of implementation. Methods used to establish parameters and aspects of interpretation of the model which may be useful to others dealing with similar problems are discussed. A listing of the model is included as an appendix.
Productivity factors and programming environments
Authors: J. Vosburgh, B. Curtis, R. Wolverton, B. Albert, H. Malec, S. Hoben, Y. Liu
Venue: Proceedings of the 7th international conference on Software engineering (1984)

Fourteen factors that influence the efficiency of programming projects were identified in a corporate-wide study of 44 ITT programming projects in nine countries. Productivity factors were classified according to project management's ability to control them. Product-related factors are not generally under the control of project management. They describe intrinsic properties of the programming product and tend to place limitations on achievable productivity. Project-related factors, on the other hand, are controllable by project management to varying degrees. These factors provide real opportunities for productivity improvement. The analysis indicates that productivity variation is almost equally attributable to product-related and project-related factors.
An APL system-development facility
Authors: Douglas W. Flower, Maurice Elliott
Venue: ACM SIGAPL APL Quote Quad (1979)

The APL system-development facility provides a framework within which system designers can easily solve many of the problems associated with the development of large systems. Systems can be defined and set up quickly, with automatically provided database-access facilities, data dictionary, and interactive maintenance protocols. A planned procedure definition and cataloging capability will provide a report writer and direct data-base inquiry and update facility to the user. Overall system structure is transparent, allowing straightforward additions and changes to the system. Fully general data structures are supported. Additionally, all data-access mechanisms can be tailored to take optimum advantage of individual situations. The optimization techniques themselves are well-defined and localized, further insuring system maintainability.
Generalizing APL I/O
Authors: Cory F. Skutt
Venue: ACM SIGAPL APL Quote Quad (1983)

Various APL systems have facilities that allow specialized I/O operations with a terminal. A new general approach is to use the system variable terminal types (@@@@TT) to designate I/O devices, modes, and options. The APL I/O supervisor for APL/V80 embodies this approach. This paper discusses the application goals, design objectives, challenges, and design of such a supervisor.
An instruction timing model of CPU performance
Authors: Bernard L. Peuto, Leonard J. Shustek
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

A model of high-performance computers is derived from instruction timing formulas, with compensation for pipeline and cache memory effects. The model is used to predict the performance of the IBM 370/168 and the Amdahl 470 V/6 on specific programs,/and the results are verified by comparison with actual performance. Data collected about program behavior is combined with the performance analysis to highlight some of the problems with high-performance implementations of such architectures.
User-perceived quality of interactive systems
Authors: W. Dzida, S. Herda, W. D. Itzfeldt
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

User-perceived quality of interactive systems is defined in terms of statistically non-overlapping categories, so-called dimensions or factors. Categories are identified by factor analysis and represent a dimensional concept of the quality of interactive systems as perceived by its users. Each category describes essential user requirements. This paper reports on a method and some initial results in the analysis of user-perceived quality of interactive systems. It is based on research work described in more detail elsewhere7. The methodology of approach is suitable for software requirements definition and human factors engineering.
Hardware implementation of loop trace and microprogram synthesis
Authors: A. M. ADB-Alla, Laird H. Moffett
Venue: Proceedings of the 1975 annual conference (1975)

The modification or tuning of the microcode in a computer that utilizes a writable control store is one method whereby a program's execution time can be improved. A method for automatically performing a microcode tuning or synthesis has been developed by Drs. Karlgaard and Abd-alla and is discussed in detail in [1]. Presented is an extension of this effort which allows microcode synthesis to be performed &ldquo;on-the-fly&rdquo;. This is accomplished by: (1) performing the required program trace with a hardware modification, (2) eliminating the statistics generation requirement, and (3) performing the synthesizing by using a microprogram rather than software. The implementation of this technique is described in this paper.
A general simulation model of an on-line telephone directory assistance information retrieval system
Authors: W. A. Hall
Venue: Proceedings of the third conference on Applications of simulation (1969)

During the course of the development of the Directory Assistance System, it was desirable to study the expected performance of a wide variety of hardware configurations. Instead of creating a separate simulation program for each proposed design, it was decided to construct and implement a single, more general model. The model to be described is such that very little, if any, modification to the body of the program is necessary to describe all pertinent details of any given design to be simulated. The user need only modify the appropriate input parameters to experiment with a different configuration.
Preliminary experience from the dice system a distributed incremantal compiling environment
Authors: Peter Fritzson
Venue: Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments (1984)

Abstracts The DICE system Is a highly Integrated programming environment which provides programmer support in the case where the programming environment resides in a host computer and the program Is running on a target computer that Is connected to the host. Such a system configuration is also suitable for remote debugging and maintenance of production versions of programs that has been installed in a user environment. The system contains tools such as an screen-oriented structure editor, a statement-level incremental compiler, a screen-oriented debugger and a program database. The debugger uses the same facility for pointing and display as does the editor, and it uses the incremental compiler for insertion of breakpoints and statement evaluation. Most of these tools are automatically generated from compact descriptions. This paper describes some aspects of a prototype version of the system and gives some preliminary data on the performance. Also, strategies for implementing portable programming environments are discussed and are exemplified by the DiCE system.
Defensive COBOL strategies
Authors: James Landon Linderman
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

This paper will focus on an approach to teaching a stylistic subset of COBOL in such a manner that students are equipped with the &ldquo;safe&rdquo; way to program from the outset, even if this means &ldquo;hiding&rdquo; some of the more &ldquo;dangerous&rdquo; features of the language from them until they can better cope with them. This approach places the highest priority on teaching techniques which go beyond effectiveness to the broader objectives of adaptability and continued effectiveness in the face of change.
Teaching hardware and computer design in a software oriented computer science program
Authors: David Salomon
Venue: Proceedings of the eighth SIGCSE technical symposium on Computer science education (1977)

A computer hardware and design course is described which is oriented toward softies. The special problems of such a course are discussed, some solutions offered, and the students' responses are analyzed.