ppxscal/embedding_network huggingface dataset:
Artificial languages: The use of chain list matrices for the analysis of COBOL data structures
Authors: H. W. Lawson,  Jr.
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THE ANALYSIS, reduction, and verification of the data hierarchy utilized in COBOL presents a major problem for implementors of the language. The use of chain list matrices, to be presented in this paper, provides a significant aid in reducing the time required to process the variably structured data elements in a COBOL program.
Simulation, manufacturing and graphics
Authors: Van B. Norman
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

The simulation of material movement, equipment location, operating and scheduling rules is a powerful tool for the design of state of the art automated manufacturing facilities. This paper describes a software system (AutoGram) that allows the designer of an automated manufacturing facility to easily construct a simulation model by graphically describing the system to be modeled. The designer selects from a menu of standard manufacturing and material handling components. These include such devices as robots, machine tools, conveyors, cranes, automatic guided vehicles and storage systems. For each device the designer may use default performance characteristics or he may specify the important operating parameters of the device. From the designers facility definition a GPSS/H (General Purpose Simulation System) model is automatically produced. Output from the GPSS simulation is displayed graphically as an animated representation of the facility. The designer can observe on the graphics display an animated picture of the manufacturing facility in operation under various simulated operating conditions. Complicated simulation models can be produced in 1/10th the time of traditional techniques.
An independent data definition facility for COBOL and FORTRAN
Authors: Harvey S. Koch, Malcolm H. Gotterer
Venue: Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control (1972)

This paper describes the design of a system that allows the description of a data base independently from applications programs and independent of which languages (COBOL or FORTRAN) are used in the applications programs. The features of a new data definition language called COBOL-FORTRAN Data Definition Language (CFDDL) are discussed. Motivation and justification for a system with such characteristics are given.
SIGMICRO (Panel Session)
Authors: Don Senzig, Gideon Frieder, Wayne T. Wilner, Stanley Habib
Venue: Proceedings of the 1976 annual conference (1976)

Current notions on computer architecture vary from the superficial-the shape of the cabinetry (with blinking lights, of course) - to abstract definitions of functional structures for information processing systems. An &ldquo;orthodox&rdquo; view of computer architecture underlies all these notions. This session will present a wide range of views on the future computer architecture: the &ldquo;orthodox&rdquo; evolutionary change and, finally the totally &ldquo;unorthodox.&rdquo;
Database courses with realistic student projects (Panel Session)
Authors: James R. Driscoll, Pentti A. Honkonen, William Shay
Venue: ACM SIGCSE Bulletin (1983)

This session will consist of a panel discussion of courses in DBMS which involve student projects using commercially available database management systems. A list of panelists and a synopsis of their topics follows. John C. Peck, Chairman Clemson University has used IDMS (a network model by Cullinane Database Systems, Inc.) for the last 8 years in the senior level introductory course in database management. Although all three popular models (network, hierarchical, and relational) are covered in the course a team project (3 or 4 member teams) using IDMS in an online environment is assigned to reinforce the ideas central to all three models. The pros and cons of using large mainframes for such a course are discussed. James R. Driscoll The University of Central Florida has undertaken a project to implement fundamental versions of all three popular DBMS models on low-end microcomputer configurations. Dr. Driscoll will discuss the development of RQL (Relational Query Language) and RMS (Relational Menu Systems) which are used at UCF. Pentti A. Honkonen Georgia State University has access to three database management systems for its course in DBMS. Dr. Honkonen will compare the Instructional Information Management System, Univac's DMS/90 and The Relational Information Management Systems (RIMS) as they pertain to instructional use in a university environment. William Shay The University of Wisconsin at Green Bay offers a project-oriented course in DBMS utilizing a CODASYL type DBMS from Xerox called the Extended Data Management System (EDMS). In this course each student designs, loads, and processes against a real database. The nature of the project and the experiences encountered during the past 4 years the course has been taught will be discussed.
A low-cost host processor for emulation research
Authors: Robert M. McClure
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

Microprogramming has now gained a certain amount of maturity and is a widely used technique in the design of computers. With only a few exceptions, such as QM-1 by Nanodata, and the D machine and B1700 of Burroughs, the choice of microprogrammed controls has been made on classic engineering grounds - simplicity and regularity of design, maintainability, flexibility, and cost - rather than to provide a flexible structure for research in microprogramming. For the most part, user microprogramming is reasonably limited to extensions along the same architectural lines as the natural virtual machine. In the case of the exceptions noted above, generality of function was given very high order of priority. This has resulted in relatively expensive central processors. This paper describes an attempt at providing a processor suited for general user microprogramming, with good function, yet economical enough to be within most research budgets. Further, it was planned for the easy attachment of special purpose function units which can be added incrementally.
A mini-micro computer link promotes distributed processing in scientific and engineering computations
Authors: Shmuell Gruber, Meir Tahan, Michael Z. Hanani
Venue: Proceedings of the first SIGMINI symposium on Small systems (1978)

Engineering and scientific work often requires complex computations of different types that should be carried out on different types of computers on the one hand, but must communicate and support each other on the other. To facilitate efficient execution of such computations, a network composed of mini and micro computers (DEC PDP 11/40 and Intel 8080) with the support of a large computer (CDC CYBER 73) has been built and is described in this paper. The network enables the realization of involved scientific computations that could not be carried out by any one of the computers on its own. A general description of the entire set-up is followed by a more detailed discussion of the micro-mini link, and examples of projects using the network.
Design of SEMA: A software system for computer-aided modelling and simulation of sequential machines
Authors: Tuncer I. Ören, Brian Collie
Venue: Proceedings of the 12th conference on Winter simulation (1980)

SEMA (SEquential MAchines) is a theory-based comprehensive computer-aided modelling and model processing system. The modelling methodologies of the current version of SEMA are finite-state machines (Moore and Meally) and Markov chains. In this paper, modelling features, computer-aided modelling facilities, and the highlights of some other features of the SEMA system are discussed.
On the size of programs in subrecursive formalisms
Authors: Robert L. Constable
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

This paper gives an overview of subrecursive hierarchy theory as it relates to computational complexity and applies some of the concepts to questions about the size of programs in subrecursive programming languages. The purpose is three-fold, to reveal in simple terms the workings of subrecursive hierarchies, to indicate new results in the area, and to point out ways that the fundamental ideas in hierarchy theory can lead to interesting questions about programming languages. A specific application yields new information about Blum's results on the size of programs and about the relationship between size and efficiency.
New computer-assisted instruction system for UNIX systems
Authors: Paul G. Matthews
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

The UNIX Instructional Workbench (IWB) software system is a general purpose computer-assisted instruction facility implemented for the UNIX operating system. The facility is characterized by a small number of abstract structures that support a wide range of courseware designs, and flexibility in using available terminal equipment and software. The INB system provides interactive aids for developing courseware as well as the means to deliver courseware to students.
Engagement of interactive graphic tools in a CAD-system for digital units
Authors: E. Hörbst, R. Prechtl, B. Will
Venue: Proceedings of the 13th Design Automation Conference (1976)

The paper describes a graphical system which was developed at Siemens and the use of this system for the design automation of digital processing units.
Three dimensional computer graphics for craniofacial surgical planning and evaluation
Authors: Michael W. Vannier, Jeffrey L. Marsh, James O. Warren
Venue: ACM SIGGRAPH Computer Graphics (1983)

The understanding of complex craniofacial deformities has been aided by high resolution computed tomography. Nonetheless, the planar format limits spatial comprehension. Reconstruction of fully three-dimensional bony and soft tissue surfaces from high resolution CT scans has been accomplished by a level slicing edge detector coupled to a hidden surface processor without perspective depth transformation. This method has clarified aberrant anatomy, facilitated surgical planning and improved quantitative postoperative evaluation in more than 200 clinical cases. Advanced computer aided design techniques, originally developed for the manufacture of military aircraft, have been applied to the planning and evaluation of craniofacial procedures as well. This allows the application of interactive digital graphic technology to surgical patient management.
A lazy evaluator
Authors: Peter Henderson, James H. Morris,  Jr.
Venue: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages (1976)

A different way to execute pure LISP programs is presented. It delays the evaluation of parameters and list structures without ever having to perform more evaluation steps than the usual method. Although the central idea can be found in earlier work this paper is of interest since it treats a rather well-known language and works out an algorithm which avoids full substitution. A partial correctness proof using Scott-Strachey semantics is sketched in a later section.
On the design of an interactive spelling dictionary for personal computers
Authors: Jon Radue
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

The major spelling error detection techniques are briefly reviewed. The virtual hashing technique is described, and results indicate that it could be an efficient way of storing and searching an interactive dictionary on a personal computer.
Classification of computable functions by primitive recursive classes
Authors: Michael Machtey
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

A classification of all the computable functions is given in terms of subrecursive programming languages. These classes are those which also arise from the relation &ldquo;primitive recursive in.&rdquo; By distinguishing between honest and dishonest classes the classification is related to the computational complexity of the functions classified, and the classification has a wide degree of measure invariance. The structure of the honest and dishonest classes under inclusion is explored. It is shown that any countable partial ordering can be embedded in the honest or in the dishonest classes. The honest classes are dense in themselves, and the dishonest classes are dense in the honest classes. Every honest class is minimal over some dishonest class, but there is a dishonest class with no honest class minimal over it. Every honest class is the intersection (g.l.b.) of two incomparable honest classes, but there are incomparable pairs of honest classes with no g.l.b. It follows that the upper semi-lattice of the recursive degrees of primitive recursiveness is not a lattice. Finally, no r.e. increasing sequence of honest classes has a l.u.b.
Some studies on microprogram optimization
Authors: Pradip K. Srimani, Bhabani P. Sinha
Venue: Proceedings of the 13th annual workshop on Microprogramming (1980)

Minimization of control memory bit dimension constitutes a major problem in the synthesis of a microprogrammed digital computer. This paper investigates the problem in both the cases of static and dynamic microprogramming, i.e., the problems of ROM, as well as WCS minimization. It develops certain useful results and pre-estimates about the possible minimal cost of implementation and finally describes a simple reduction methodology to pick up one of the near minimal or engineering solutions with much less computational labor and, if necessary, the true minimal solution with some extra computation.
People-Oriented Computer Systems (Panel Discussion): When, and how?
Authors: Robert Dunn, Thomas H. Martin, Lawrence Miller, Hugh Smith, Shirley Ward Watkins
Venue: Proceedings of the 1978 annual conference (1978)

What will be required in order to accomplish the transition from the current generation of computer-oriented people to people-oriented systems? This session will address various questions relating to the following areas: - How do casual users interact with information processing systems? What do we know about interface characteristics and their effects upon end users? How do users learn the necessary protocols for each host system? - What can we learn from human factors research? Are there some issues that always exist, even when nothing is known about the particular user or the user's tasks? How can system designers learn more about the professed needs of users and their actual behavior? - How will the widespread move towards the use of CRTs rather than printing terminals affect the end user? What changes in system and interface characteristics will be necessitated because of the move towards national networks? - How can we encourage and facilitate collaborative research into the interaction process? How can the findings from such studies be disseminated and implemented? The panelists will describe current work in networking, graphics, interaction monitoring, ergonomics, and the psychology of information system design and discuss the application of such activities to the design and development of people-oriented information systems.
Local network architectures
Authors: Jeffry W. Yeh, William Siegmund
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

Local networks have many characteristics which are quite different than those of geographically dispersed networks. In this paper, we first review these defining characteristics of local networks and present a brief evolutionary history of local networks. We then review three dominant architectures for local networks together with examples. In the last part of this paper, we describe some of the protocol considerations for local networks.
Prototyping for naval battle group simulation development
Authors: Jerry Golub, Willis A. Soper
Venue: Proceedings of the 16th annual symposium on Simulation (1983)

Development of a new simulation involves problems such as what the simulation should do, to what level of detail, and with what models. For very broad simulations, these problems reach a level where straightforward development techniques become intractable. Dynamic software prototyping is an approach being taken at RCA to address such problems in simulating a multi-faceted naval battle group.
Busy and lazy FP with infinite objects
Authors: Walter Dosch, Bernhard Möller>
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

The paper introduces a variant of Backus' functional programming language FP that has non-strict basic operations as well as non-strict language constructs. The basic data structure of FP, finite nested sequences, is generalized to infinite trees by allowing a non-strict sequence constructor. Then infinite objects can be described as least solutions of recursion equations. For this language variant we give a structured mathematical and operational semantics which employs rewriting rules on finite terms. Infinite objects are evaluated by repeated unfolding of their recursive definitions and subsequent simplifications according to a confluent and Noetherian rewriting system on the level of objects. Two algorithms are given that formalize the ideas of busy (data-driven) and lazy (demand-driven) evaluation. Throughout the paper the semantic concepts of FP are explained; special emphasis is laid on the notion and the proper algebraic treatment of infinite objects.
Worst-case analysis of memory allocation algorithms
Authors: M. R. Garey, R. L. Graham, J. D. Ullman
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

Various memory allocation problems can be modeled by the following abstract problem. Given a list A &equil; (&agr;1,&agr;2,...&agr;n,) of real numbers in the range (0, 1], place these in a minimum number of &ldquo;bins&rdquo; so that no bin holds numbers summing to more than 1. We let A* be the smallest number of bins into which the numbers of list A may be placed. Since a general placement algorithm for attaining A* appears to be impractical, it is important to determine good heuristic methods for assigning numbers of bins. We consider four such simple methods and analyze the worst-case performance of each, closely bounding the maximum of the ratio of the number of bins used by each method applied to list A to the optimal quantity A*.
Uses of general arrays and operators
Authors: J. E. Mezei
Venue: Proceedings of the sixth international conference on APL (1974)

This paper introduces basic definitions for general arrays and operators in the context of illustrative examples of their uses. Most examples are rendered in two versions, one that uses general arrays and operators, and one that foregoes their use.
Interactive graphical spline approximation to boundary value problems
Authors: J. B. Rosen, Paul S. LaFata
Venue: Proceedings of the 1971 26th annual conference (1971)

Earlier work on interactive graphical approximation of data using linear programming has now been extended to ordinary differential equation multipoint boundary value problems. The approximation is obtained using a suitable spline basis where the degree and uniform knot size is specified by the user. The coefficients of the spline basis are determined so as to minimize the maximum error in the differential equation over a specified discrete grid.
Micromodules: Microprogrammable building blocks for hardware development
Authors: Richard G. Cooper
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

The purpose of the Micromodules project is to greatly reduce the amount of effort expended on logic design, fabrication and debug for small quantity developments. Secondly, with this modular approach, a quick reaction capability is sought that would allow a large reduction in the time interval between system specification and the delivery of the finished product. Finally, by simultaneously simplifying and speeding up the development process, we aim to improve the practicability of implementing more complex equipments.
Security and protection of data in the IBM System/38
Authors: Viktors Berstis
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

The IBM System/38 machine architecture provides data security through addressability control and protection domains while minimizing overhead for this service. This paper describes the addressing mechanism, basic data organization and process structure of the System/38. These constructs are fundamental to the operation of the security mechanism. A description is given of security in the architecture and how it can be extended.
A comparative analysis of disk scheduling policies
Authors: Toby J. Teorey, Tad B. Pinkerton
Venue: Proceedings of the third ACM symposium on Operating systems principles (1971)

This paper appears in the March, 1972, issue of the Communications of the ACM. Its abstract is reproduced below. Five well-known scheduling policies for movable head disks are compared using the performance criteria of expected seek time (system oriented) and expected waiting time (individual I/O request oriented). Both analytical and simulation results are obtained. The variance of waiting time is introduced as another meaningful measure of performance, showing possible discrimination against individual requests. Then the choice of a utility function to measure total performance including system oriented and individual request oriented measures is described. Such a function allows one to differentiate among the scheduling policies over a wide range of input loading conditions. The selection and implementation of a maximum performance two-policy algorithm are discussed.
Interconnecting a distributed processor system for avionics
Authors: George A. Anderson
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

This paper describes the interconnection scheme devised for an advanced Air Force system concept called Distribution Processor/Memory (DP/M) in which topologically irregular networks of small computers are used to perform avionics processing. The interconnection scheme involves the use of a combination of global and point-to-point busses to handle message traffic in predominantly homogeneous systems of from 5 to 20 computers. The major features of the scheme are the use of biphase bit-serial transmission, associatively addressed messages, and a method for reconfiguration of the point-to-point communications paths under program control. It is expected that the scheme may have general applicability to other distributed processing systems, particularly other real-time systems employing limited-capability processors.
Alternation and the power of nondeterminism
Authors: Ravi Kannan
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

While nondeterminism is widely beleived to be more powerful than determinism in various contexts (the most famous being the conjecture that NP strictly contains P), no proof of the added power of nondeterminism is available for any significant issue. The weaker conjecture (than NP strictly contains P) that there is a language accepted by a nondeterministic linear time bounded multitape Turing Machine that cannot be accepted by a deterministic linear time bounded multi-tape TM still seems quite hard (Paul 1982). The aim of this paper is to show how the existance of the polynomial-time hierarchy of Meyer and Stockmeyer(1972) and the related concept of alternation (Chandra, Kozen and Stockmeyer(1981)) can be exploited to prove the power of nondeterminism over determinism in some contexts. It is hoped that this approach may be useful in proving stronger results.