ppxscal/embedding_network huggingface dataset:
A technique for the architectural implementation of software subsystems
Authors: Anand Jagannathan
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

This paper presents a technique to implement operating system software more efficiently: as part of the processor architecture. Such an'architectural'implementation has two significant advantages over a conventional'software'implementation. First, it allows performance critical modules of the operating system to be implemented through specialized hardware or firmware. Second, it allows the implementation of the operating system to evolve with technology without any change to the basic design structure. The basis for the proposed technique is the application of a software structuring methodology called'type extension'. A model for the architectural implementation of a subsystem, which is structured through this methodology, is presented. It is shown that this model encompasses all conventional forms of implementation&mdash;hardware, firmware, software. The model establishes that architectural implementation allows a range of implementation choices; a software implementation utilizes only a small subset of these choices.
Current research in computer science (Research Session)
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

This is a feature session at ACM 72. At this session prominent and active people working in the area of computer science, its applications, or its supporting disciplines will state what they are doing, its importance to mankind, and its applications and prospects. The speakers will report on work in the following broad areas: artificial intelligence, industrial research, computer architecture, software, automatic programming, graphics, modeling, population control, speech recognition and generation, and other timely topics. The following speakers will talk about the research being conducted by the groups for which they are responsible.
Identification in computer networks
Authors: Zaw-Sing Su
Venue: Proceedings of the eighth symposium on Data communications (1983)

To communicate across a network system, entities within the system need to be able to identify one another. An identifier usually takes the form of a name or an address. Conventions for the assignment of these identifiers and their resolution affect many aspects of network design. Identification is thus a crucial issue for network architecture and standardization. In this paper, our discussion is first devoted to the semantics of names, addresses, and routes, with emphasis on the relationships among them. We then examine the implications of layered network architecture, syntactic differences of identifiers, and broadcast communication. Finally, we turn our attention to naming and addressing in large dynamic networks.
A general simulation model for the evaluation of distributed processing systems
Authors: Paul J. Fortier, Richard G. Leary
Venue: Proceedings of the 14th annual symposium on Simulation (1981)

This paper describes a general discrete-simulation model that will be used to evaluate the suitability of various localized distributed processing computer architectures for real-time control applications. The concept of distributed systems is first discussed and the particular area of interest, i.e., Local Computer Networks, is described. The model design concepts are then presented and the simulation model itself is defined. The simulation was programmed using the FORTRAN-based GASP IV simulation language.
Prototyping and simulation tools for user/computer dialogue design
Authors: Paul R. Hanau, David R. Lenorovitz
Venue: Proceedings of the 7th annual conference on Computer graphics and interactive techniques (1980)

The design and development of user interfaces to interactive computer systems is enhanced by permitting designers to easily express their design concepts in concrete, comprehensive, and comprehensible working models. A set of prototyping and simulation tools has been developed to be used as an integral part of the specification and design process. These include an interactive display building utility and a syntax-driven interactive dialogue controller. The display builder is used to develop initial conceptual snapshots of system display appearance at selected points in the user/system dialogue. The dialogue controller interprets a grammatical description of input tools and system logic, using predrawn and dynamically constructed displays to simulate the external appearance of the desired end system.
Mask Shop Information System
Authors: J. G. Brinsfield
Venue: Proceedings of the 8th Design Automation Workshop (1971)

The Mask Shop Information System (MSIS) is a computer system which provides real-time control as well as information retrieval functions for a shop where integrated circuit masks are made. This system is now in use at two Bell Laboratories locations, one at Murray Hill, New Jersey, and the other at Allentown, Pennsylvania. Each mask shop contains its own complex of Bell Laboratories designed, photolithographic devices. The original artwork for each mask level is produced on a Primary Pattern Generator, a device which uses a laser beam to accurately expose a pattern on a photographic plate. Specially designed Reduction and Step-and-Repeat Cameras are used to arrive at the final mask. Developing, inspection, and copying facilities are also part of the shop.
University of Maryland student scheduling algorithm
Authors: James Stewart, Robert L. Clark
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

This report describes the basic algorithm by which students are assigned to classes, the various criteria which directed the design of that algorithm, and the consequences of some of its features. The University of Maryland Student Scheduling Program consists of two separate phases: a catalogue builder and a student scheduler. These programs operate on the IBM 7094 and are described in the last section of this report. Since the subject of this report is the basic scheduling algorithm, the report is restricted to those features and routines which take an active part in the logic of student scheduling.
Calculating presentations for certain kinds of quotient groups
Authors: M. F. Newman
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

Over the last few years a new algorithm has emerged for manipulation with finite presentations of groups. It enables one to calculate from a given finite presentation a useful presentation for certain nilpotent quotient groups of the group presented by the input. The algorithm has been machine implemented. With the aid of these machine implementations it has been possible to dig more deeply into the structure of some groups, in particular finite groups of prime-power order, and the prospects for further investigations seem bright.
A version of Beale's method avoiding the free-variables
Authors: Amilcar dos Santos Gonçalves
Venue: Proceedings of the 1971 26th annual conference (1971)

Whithin the algorithms to solve the quadratic programming problem, Beale's method has proved to be a good one. Due to an entirely new technique to change the basis, a new version of Beale's method avoiding the use of &ldquo;free-variables&rdquo; is presented here. This algorithm can be seen as a condensed way to acomplish Beale's method.
Playback: A method for evaluating the usability of software and its documentation
Authors: Alan S. Neal, Roger M. Simons
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

A methodology is described for obtaining objective measures of product usability. The Playback program developed at the IBM Human Factors Center in San Jose collects performance data of the user interface without impact upon the user or the system being evaluated. While a user is working with the system, keyboard activity is timed and recorded by a second computer. This log of stored activity is later played back through the host system for analysis. An observer watching television monitors enters time-stamped codes and comments concerning the users employment of system publications. The advantages of this approach are: (1) data-collection programs are external to the product being evaluated, (2) no modifications of the Playback program are required for testing different software applications, (3) the data-collection process does not intrude on the user's thoughts or activities, (4) problem determination is performed at an accelerated rate during playback analysis, and (5) all data collection is performed on line.
Logic versus mathematics in computer science education
Authors: K. Culik, M. M. Rizki
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

Informal mathematical proofs admit and require interpretation while formal logic proofs suppress (abstract from) meanings. The former is closely related to problem solving and computer programming. The latter, which is commonly used for proving program correctness, complicates this procedure because it separates problem solving from programming. A constructive mathematical proof in finite discrete mathematics of an existential theorem is a computer program if the pertinent data structures and functions are expressed in a programming language. Several detailed examples of graph theoretical problems and theorems are presented along with their constructive proofs and corresponding programs.
The Argonne workstation evaluation and demonstration room
Authors: Debbie Coultis
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

This presentation describes the environment at Argonne National Laboratory and the actions underway to provide computer users assistance in selecting electronic workstations. The focus of the presentation will be on the opening of the Workstation Evaluation and Demonstration Room, where the Computing Services Division provides users access to terminals, personal desktop computers, word processors, scientific workstations and peripheral equipment.
Testing graph connectivity
Authors: R. Endre Tarjan
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

An algorithm proposed by Dinic for finding maximum flows in networks and by Hopcroft and Karp for finding maximum bipartite matchings is applied to graph connectivity problems. It is shown that the algorithm requires 0(V1/2E) time to find a maximum set of node-disjoint paths in a graph, and 0(V2/3E) time to find a maximum set of edge disjoint paths. These bounds are tight. Thus the node connectivity of a graph may be tested in 0(V5/2E) time, and the edge connectivity of a graph may be tested in 0(V5/3E) time.
A generative model of working set dynamics
Authors: Domenico Ferrari
Venue: Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1981)

An algorithm for generating a page reference string which exhibits a given working set size behavior in the time domain is presented, and the possible applications of such a string are discussed. The correctness of the algorithm is proved, and its computational complexity found to be linear in the length of the string. A program implementing the algorithm, which is performed in one pass and requires very little space, is briefly described, and some experimental results are given.
SIGSAM (Tutorial Session)
Authors: John D. Lipson, Ellis Horowitz
Venue: Proceedings of the 1976 annual conference (1976)

This is the second in a series of two tutorial sessions featuring letures from the 1975-76 SIGSAM Lecture Program. Prof. Lipson's tutorial will discuss the Cooley-Tukey fast Fourier transform, and algorithm which has truly revolutionized large scale time series analysis. Prof. Horowitz presents a taxonomy of algorithms with examples of algorithms in each category.
On the theory of programming logics
Authors: Robert L. Constable
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

A new logic for reasoning about programs is proposed here, and its metamathematics is investigated. No new primitive notions are needed for the logic beyond those used in elementary programming and mathematics, yet the combination of these notions is remarkably powerful. The logic includes a programming language, designed with Michael O'Donnell, for program verification. It forms the core of the PL/CV verifier at Cornell. This study belongs to the discipline of Algorithmic Logic as conceived by Engeler. The logic is related to Park's mu-calculus based on functions instead of relations. The monadic quantifier free subset is developed in the style of the system in J.W. deBakker's Recursive Procedures. But this logic is substantially different from either of these. It is intended to be a practical programming logic in the spirit of E. Dijkstra's calculus. This paper proves the completeness and decidability of the monadic (iterative) programming logic. It discusses the polyadic logic and the programming language briefly, and considers general models for the iterative programming logic. The polyadic logic is shown to be incomplete with respect to standard models, but complete with respect to general models.
Floss: An approach to automated layout for high-volume designs
Authors: Y. E. Cho, A. J. Korenjak, D. E. Stockton
Venue: Proceedings of the 14th Design Automation Conference (1977)

Traditionally, automatic IC layout programs have been constrained to produced designs in which cells are placed in rows. The resulting chips are typically too large, compared to manual layout, to be used for high-volume production. FLOSS uses a new approach &emdash; automatic packing of a manually-generated sketch &emdash; to achieve chip area that is competitive with manual layout.
User identification, access control, and audit requirements
Authors: Leslie Chalmers
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Good computer security depends upon knowing who is using the system and managing how each individual is able to access the information on the system. The next generation of computer should build in the kind of controls which are often added on to today's systems. This session will discuss the objectives for positively identifying system users, controlling their use of computerized resources, and providing accountability for users who are authorized and for those who attempt to exceed their authority. Traditionally, user identification depends upon an identification code (ID) and a password. Password security has proven to be weak: where users are allowed to select their own passwords, they tend to select ones that are easily guessed, and where passwords are assigned, the users tend to write them down. Future user identification systems should expand into something a user has (e.g. a badge) or something a user is (e.g. fingerprints). Signature verification is a technology which is worth improving since it offers good security within existing legal and social contexts. Ideally, user identification and authentication should be based upon a combination of two or more technologies.
A discussion of machine-interpreted macroinstructions
Authors: R. M. Meade
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

The vocabulary of the IBM 7950 Computer includes a directly interpreted and executed set of data processing macroinstructions. Operations include file maintenance and searching, sorting, selection, and general tabular transformation. The use of these intrinsic subroutines yields faster operation and more direct programming. This paper describes a machine organization that facilitates data processing. Description of the macroinstruction set includes flow charts and comparison with conventional routines. The instructions represent a generalization of the use of control words. Limitations and possible extensions of such a command structure are examined.
Introduction to GPSS
Authors: Thomas J. Schriber
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

GPSS (General Purpose Simulation System) is a simulation programming language who use greatly eases the task of building computer models for discrete-event simulations. (A discrete-event simulation is one in which the state of the system being simulated changes at only a discrete, but possibly random, set of time points, called event times.) GPSS lends itself especially well to the modeling of queuing systems, but is generally applicable when it is of interest to determine how well a service organization will respond to the demands placed on it. For example, GPSS has been applied to the modeling of telephone companies, brokerage firms, computing centers, supermarkets, manufacturing shops, banks, steel mills, hotels, warehouse and distribution facilities, and general business (to examine the flow of information through a business, and assess its impact on operations performance).
High level operations in automatic programming
Authors: Jay Earley
Venue: ACM SIGPLAN Notices (1974)

We discuss the thesis that one good way of achieving non-procedural or problem-oriented languages is by constructing higher and higher level procedural languages. We present a set of operations embedded in a programming language VERS2 which represent a higher level of description than currently exists. These include iterators (operations which, if written out, would normally involve an iteration over a group of objects), pattern matching facilities, implicitly specified data structures, and the ability to place constraints on data structures.
Organizational change and educational computing
Authors: John A. Sonquist
Venue: Proceedings of the 1976 annual conference (1976)

Sociological theories of change in formal organizations are brought to bear on acceptance of computer technology in support of social science research and teaching in colleges and universities. The paper employs theory based on general studies of organizational change to sensitize organizational planners to issues and problems specifically related to computing.
Sharing data and services in a virtual machine system
Authors: J. D. Bagley, E. R. Floto, S. C. Hsieh, V. Watson
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

Experimental additions have been made to a conventional virtual machine system (VM/370) in order to support a centralized program library management service for a group of interdependent users. These additions enable users to share read/write access to a data base as well as processing services. Although the primary motivation was the enhancement of performance, considerable attention was given to retaining the inherent advantages of the virtual machine system. Extended applications of the basic technique are described and the implications of such extensions on operating system design are considered.
A FORMAC program for the solution of linear boundary and initial value problems
Authors: E. Cuthill
Venue: Proceedings of the first ACM symposium on Symbolic and algebraic manipulation (1966)

A computer program is described which has been developed for obtaining approximate solutions to linear initial and boundary value problems involving differential equations. The program can be used for ordinary curve fitting as well. For each problem, input to the program includes: 1. The equations (in symbolic form) to be satisfied - the differential equations, equations describing auxiliary conditions such as boundary conditions, etc. 2. A numerical description of the regions in which each of the equations are to be satisfied. 3. Sets of functions (in symbolic form) to be used in linear combinations to approximate the solution functions. Given the above input, the program generates an approximation to the solutuon of the specified problem in terms of the specified functions which is optimum in the least squares sense. A number of examples illustrating the use of the program are included in the paper.
Analysis of an intrinsic overload control for a class of queueing systems
Authors: Y. T. Wang
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

We consider a priority queueing system which consists of two queues sharing a processor and in which there is delayed feedback. Such a model arises from systems which employ a priority assignment scheme to achieve overload control. An analytic expression for the stationary probability of the queue lengths is derived. An algorithm is proposed to compute the queue lengths distribution. Some numerical results are illustrated.
Heuristics for the Circuit Realization Problem
Authors: James Cohoon, Sartaj Sahni
Venue: Proceedings of the 20th Design Automation Conference (1983)

The Circuit Realization Problem has been previously shown to be NP-hard. We develop here several heuristics for the Circuit Realization Problem. These heuristics are locally optimal with respect to a transform and are f(n)-approximation algorithms. Several of the heuristics make use of a Statistical Mechanics technique for thermal equilibrium analysis in producing their solution. In addition, the heuristics are experimentally shown to have quite acceptable behavior.
Complexity of formal translations and speed-up results
Authors: R. L. Constable, J. Hartmanis
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

The purpose of this paper is to give a model for the study of quantitative problems about formal translations from one programming language into another, as well as derive some initial results about the speed of programs produced by translations. The paper also contains a new speed-up result which shows that in any computational complexity measure there exist functions which have arbitrarily large speed-ups but that the size of the speed-up programs must grow non-computably fast.
Maintainability engineering simulation system: An application of discrete simulation to engineering education
Authors: Ronald S. Morris
Venue: Proceedings of the 5th conference on Winter simulation (1971)

In the instruction of system engineering disciplines, like maintainability or reliability, the importance of considering the interactions of all system parameters in the evaluation of proposed hardware configurations must be emphasized. The student should thoroughly comprehend that the nature of these interactions determines the impact of a design configuration on performance. To promote an understanding of these complex interactions a teaching aid in the form of a simulation model can be employed. The paper describes a maintenance/reliability simulation model that has been used to introduce the concepts of maintainability/reliability engineering to undergraduate engineering students and that will be used in the training of graduate level systems engineering students. The graduate level personnel will have studied the analytical processes involved in systems engineering and will have a considerable background in statistics prior to use of the simulation. For this level student, use of the model also provides an excellent introduction to the techniques of digital simulation. The undergraduate student, on the other hand, cannot use sophisticated analytical or statistical techniques to suboptimize parameters and must rely on intuition and experience in establishing input parameters values. In either case, the use of the model provides the student an excellent understanding of the complex interactions between various parameters of the system. The model will be described in Section II. Section III includes a sample and description of the output and a list of required input variables. Section IV contains a brief discussion of the use of the model as a teaching aid.