ppxscal/embedding_network huggingface dataset:
Using plans to understand natural language
Authors: Robert Wilensky
Venue: Proceedings of the 1976 annual conference (1976)

Our ability to build a natural language understanding system is limited by the degree to which we can organize and apply world knowledge. This paper describes a program, called PAM, that has knowledge about people's intentions. PAM uses its knowledge to infer the relationships between sentences in a text. A sample run of the program is presented and is described in detail. The inference mechanisms of PAM are compared to those of other knowledge-application programs.
Object data structures towards distributed graphics processing
Authors: David Grabel
Venue: Proceedings of the 19th Design Automation Conference (1982)

A new approach to interactive graphics processing is described. A system for supporting interactive graphics in a distributed computing environment and its primary data structure are explained. It is compared with traditional display list processing. Its use in an important design automation problem, filling concave polygons, is also explained.
The design of an APL primitive function for the eigenproblem
Authors: M. A. Jenkins
Venue: Proceedings of seventh international conference on APL (1975)

This is a proposal for the addition to APL of a primitive function to solve the generalized algebraic eigenvalue problem. After a discussion of the issues involved in the design a specific proposal is given which suggests the use of the QZ algorithm as the basis of a primitive to find both eigenvalues and eigenvectors. An APL workspace which simulates the proposal primitive is described and examples of its use are given.
Classes of diagnostic tests
Authors: Charles Paulson
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper presents the results of an investigation into the types of tests useful for automatically diagnosing combinational digital devices. The diagnosis is based on a design model that allows hierarchy in both the structure and the data of the device being represented. A more general set of assumptions than is commonly employed allows data values other than boolean values to be diagnosed, and permits faults other than stuck-at faults to be found. The design model, the assumptions, and the tests are represented in SUBTLE, a language based on predicate calculus and specialized for digital systems.
FORTRAN: A self-paced, mastery-based course
Authors: Henry A. Etlinger, Gordon I. Goodman, Charles Plummer
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

A new FORTRAN service course has been developed and is being pilot-tested. The course was designed to reduce the number of redundant FORTRAN courses, make more efficient use of faculty time, and provide more consistent and predictable learning outcomes for down-stream courses while improving faculty and student satisfaction. The course is largely self-instructional, mastery-based and self-paced. Incentives are used to reward students for mastery of learning outcomes and prompt completion of assignments. Preliminary evaluations of the course show that we have been largely successful in meeting design goals.
Data Base Retrieval System (DBRS) a personalized data base system for the APL user
Authors: C. E. Mahood
Venue: Proceedings of the eighth international conference on APL (1976)

A Data Base Retrieval System (DBRS) provides facilities the opportunity to use terminals to maintain information in a data base and generate reports from it. It is composed of APL functions, but is designed to be used by people who have little or no knowledge of APL. The basic operations supported by DBRS include: &bull; Describing the data format and defining the size and structure of the data base &bull; Entering, listing and modifying data &bull; Searching the data and selecting entries for reports &bull; Generating formatted reports &bull; Performing arithmetic operations on the data. The advantage of DBRS is its relatively straightforward, command-oriented interface as the user does not have to learn the complexities of a data base system in order to implement an application. Thus the user proceeds immediately from defining an application to obtaining useful results.
Fifteen years of psychology in software engineering: Individual differences and cognitive science
Authors: Bill Curtis
Venue: Proceedings of the 7th international conference on Software engineering (1984)

Since the 1950's, psychologists have studied the behavioral aspects of software engineering. However, the results of their research have never been organized into a subfield of either software engineering or psychology. This failure results from the difficulty of integrating theory and data from the mixture of paradigms borrowed from psychology. This paper will review some of the psychological research on software engineering performed since the Garmisch Conference in 1968. This review will be organized under two of the psychological paradigms used in exploring programming problems: individual differences and cognitive science. The major theoretical and practical contributions of each area to the theory and practice of software engineering will be discussed. The review will end with a call for more research guided by the paradigm of cognitive science, since such results are the easiest to integrate with new developments in artificial intelligence and computer science theory.
Polynomial algorithms for multiple processor agreement
Authors: Danny Dolev, H. Raymond Strong
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

Reaching agreement in a distributed system while handling malfunctioning behavior is a central issue for reliable computer systems. All previous algorithms for reaching the agreement required an exponential number of messages to be sent, with or without authentication. We give polynomial algorithms for reaching (Byzantine) agreement, both with and without the use of authentication protocols. We also prove that no matter what kind of information is exchanged, there is no way to reach agreement with fewer than t+1 rounds of exchange, where t is the upper bound on the number of faults.
Three level subscriber signaling for data network
Authors: Yasunori Nishizawa, Hidenao Munakata, Hiroshi Sunagawa, Hiromasa Ikeda
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

This paper reports the results of the study on the subscriber signaling system in the data switching network. Requirements for the subscriber line signaling and, the advantages in realizing the requirements with three level signaling system are discussed. In this system, signals are defined by three logical states of the subscriber line, i.e. +, &minus;' and N. This system is applicable to both start-stop and synchronous terminals. A DTE-DCE interface suitable for the system is also described.
Current and future tools for debugging
Authors: Robert F. Mathis
Venue: Proceedings of the 1979 annual conference (1979)

This session will concentrate on an informal discussion of debugging tools and methodologies. Presentations will discuss theories about debugging and how bugs arise in programming; the relationship of debugging tools to other systems software; the relationship of debugging to other techniques for improving programs and programming; the implications of debugging in the design of systems; and unsolved problems for further investigation and research. The presentations will be informal to stimulate interaction and respond to audience interests.
Computer-aided partitioning of behavioral hardware descriptions
Authors: Michael C. McFarland S.J.
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper describes an algorithm for partitioning a behavioral hardware description written in the ISPS computer hardware description language. The partitioning is done before the actual registers, processing elements, and interconnections have been chosen, so that the partitioning information can be used to guide the design of the data path structure. An experiment was conducted in which a partition produced by the algorithm was compared to partitions done by human designers. The automatic partition was found to be in close agreement with those done by the designers.
Dimensioning of message-switched computer-communication networks with end-to-end window flow-control
Authors: Jackson Y.K. Chan, Nicolas D. Georganas
Venue: Proceedings of the sixth symposium on Data communications (1979)

A message-switched computer network with end-to-end window flow control is considered. Using recently developed heuristics for the numerical solution of such networks, an algorithm for the selection of &ldquo;good&rdquo; flow-control window settings is developed. The criterion of performance is the ratio of the network average throughput versus average network delay. An example network demonstrates the results.
Conditional syntactic specification
Authors: J. A. N. Lee, J. Dorocak
Venue: Proceedings of the ACM annual conference (1973)

In this paper, the shortcomings of Backus Naur specification of the syntactic properties of programming languages are investigated and a method for the specification of context-sensitive properties is suggested. Based on the notation of the tree structures of the Vienna Definition Language [Lu 1], samples of descriptions of context-sensitive grammars are presented as sets of conditionals which operate over the derivation trees of context-free specifications in BNF grammars to eliminate the extra-lingual features. The method is also extended to provide a syntactic specification of the default attributes of a language by the description of modifications which are to be made to the parsed form (syntactic tree) of instances of the language. For the purposes of example, a mini-language (ML 5/2) is presented. This paper exemplifies the problems of parameter passing and provides examples of the context-sensitive conditions of matching procedure calls and their declarations as well as matching parameters and their corresponding arguments.
A system model for computer performance evaluation
Authors: D. J. Kuck, B. Kumar
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

A framework for the study of computer capacity is given by means of a definition of capacity in terms of speeds of various parts of a computer as well as memory size. In addition to these machine parameters, we also include certain parameters of the programs to be run on a given machine. The calculation of theoretical capacity is given for several combinations of processor, memory, and I/O bandwidth for overlapped machines. The tradeoff between primary memory size and I/O bandwidth is discussed in terms of the new definition.
An ease of use evaluation of an integrated document processing system
Authors: Michael Good
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Designers of systems intended to be easy to use have many guidelines available to them in the literature. Most of these recommendations are based on the intuition and experiences of particular designers with particular systems. Very few of them have been evaluated experimentally, so one must be cautious not to attribute more authority to these guidelines than they deserve [6]. This paper summarizes the results of an experimental evaluation of the Etude text processing system [8]. Section 2 provides a brief overview of Etude. Section 3 describes the development of suitable ease of use criteria. Section 4 presents the experimental protocol. Section 5 discusses the results of the evaluation. A complete description of the experiment can be found in [7].
A model for analyzing closed-loop conveyor systems with multiple work stations
Authors: Lynn E. Bussey, M. Palmer Terrell
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This paper presents the modeling methodology incorporated in a GPSS/360 program to simulate and test the operation of a generalized recirculating conveyor-supplied system, consisting of loader, conveyor, and multiple work stations. Features of the generalized model include its ability to simulate a constant-speed closed-loop conveyor with discretely spaced random loads, variable spacing between work stations, variable supply and return distances, variable total length, zero or specifiably finite local storages at each work station, homogeneous service rates in the work stations, variable number of work stations, and choice of arrival (loading) distribution. Output statistics include many tabulated operating characteristics of the system.
Segment transfer protocols for a homogeneous computer network
Authors: Eric Manning, R. W. Peebles
Venue: ACM SIGOPS Operating Systems Review (1975)

This research is focussed on solving certain problems of distributed processing on a distributed data base, with emphasis on transaction processing. Many data bases exhibit geographic locality of reference; most of the transactions homing on a given component of the data base originate from a particular geographic region. At the same time there is a need to operate the collection of components as a single data base, to provide For occasional transactions which cross regional boundaries, and For managerial queries and information retrieval applications which span the entire data base. There are many examples of this associated with business and Industry; credit and inventory records for example. Finally, geographic locality of reference is only one of the reasons for creating logically unified but physically distributed data bases. If a data base contains information supplied by several agencies, each may Insist as a matter of policy that 'its' data be held in 'its' hardware located on 'its' premises, quite apart From technical efficiencies which may accrue.
An approach to optimization of horizontal microprograms
Authors: M. Tsuchiya, M. J. Gonzalez,  Jr.
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

Detection of concurrently executable microoperations is an important consideration for effective horizontal microprogramming. Since it is highly machine-dependent and requires knowledge of highly intricate features of a machine, only limited effort has been made so far to derive an algorithm for detection of microprogram parallelism to enable optimization of horizontal microprograms. In this paper, problems involved in optimization of horizontal microprograms are described. Existing techniques are applied to detect microprogram parallelism in a sequential source microprogram to allow subsequent optimization of the microprogram in a horizontal format. An algorithm for optimization of horizontal microprograms is derived. An upper bound for microprogram execution time is determined. The results derived in this paper are very general so that they are applicable to any machine with a horizontal microinstruction format (including a vertical format which is a special case of a horizontal format). An example is given to illustrate the algorithm.
An introduction to the simulation of a multiple CPU military communications system
Authors: James G. Sprung, Paul T. Beatty, John W. Camery, John C. Norrell
Venue: ACM SIGSIM Simulation Digest (1976)

All telecommunication systems design, development and support for the Headquarters, Department of the Army, is provided by the Automation Support Detachment. The current operational telecommunication system provides the Army with a full range of communication functions, i.e., receipt, transmission, message validation and online CRT operations, on a dedicated IBM System/360 (Model 50) processor. The system is designed to handle 1500 messages per hour with an average message size of 2000 characters operating on a round-the-clock basis. Design efforts are currently underway to extend the capabilities of the present system and to provide similar operational services to all communication centers within the Pentagon. The proposed system will include a mixture of minicomputers and an IBM System/360 (Model 65) and will support a workload of 6000 messages per hour. The design effort involves computer simulation of the proposed system. This paper describes the development of a comprehensive &ldquo;system&rdquo; of three models which represent the Front End Control, Message Processing, and Staff Service Center Subsystems. These models are written in ECSS II and are linked by special message generation modules. The special processing requirements as well as the multiple CPU configuration present some unique modeling situations. The form the model has taken is predicated to a large extent, on the available data. Extensive use is made of hardware and software monitoring of the IBM System/360 (Model 50) and the analysis of message traffic statistics. The modeling of the traffic statistics. The modeling of the input processing is statistically related to the output processing The processing is functionally divided into stages to provide a high level of generality for the models and add uniformity throughout the models. Various simulation statistics are gathered for each stage besides the usual ECSS II generated statistics. Model validation techniques and future uses of the model are described. A discussion of specific simulation techniques and outputs is beyond the scope of this overview document and, therefore, is deferred to future papers.
A device independent graphics imaging model for use with raster devices
Authors: John Warnock, Douglas K. Wyatt
Venue: ACM SIGGRAPH Computer Graphics (1982)

In building graphic systems for use with raster devices, it is difficult to develop an intuitive, device independent model of the imaging process, and to preserve that model over a variety of device implementations. This paper describes an imaging model and an associated implementation strategy that: 1. Integrates scanned images, text, and synthetically generated graphics into a uniform device independent metaphor; 2. Isolates the device dependent portions of the implementation to a small set of primitives, thereby minimizing the implementation cost for additional devices; 3. Has been implemented for binary, grey-scale, and full color raster display systems, and for high resolution black and white printers and color raster printers.
A performance comparison of optimally designed computer systems with and without virtual memory
Authors: Kishor S. Trivedi, Timothy M. Sigmon
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

In this paper, a comparison of the performance of optimally designed computer systems with and without virtual memory is made. The computer systems in question are modeled by closed queuing networks of the central server type. The design of the systems is formulated as a nonlinear optimization problem where the objective function is to maximize the throughput subject to a nonlinear cost constraint. The decision variables are the speeds of the individual devices. This optimization problem is then solved by use of the Lagrange multiplier technique. The comparisons of the systems demonstrate the affect on performance of the addition of another I/O device to handle paging and the affect on performance of the additional overhead generated by the page fault handler. Also, the optimal amount of money to be spent on main memory is investigated.
Statistics in simulation: How to design for selecting the best alternative
Authors: Edward J. Dudewicz
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

In many simulation studies the experimenter (the person running the simulation) has under consideration several (two or more) proposed procedures (e.g., for running a real-world system), and is simulating in order to determine which is the best procedure (with regard to certain specified criteria of &ldquo;goodness&rdquo;). Such an experimenter does not wish basically to test hypotheses, or construct confidence intervals, or perform regression analyses (though these may be appropriate minor parts of his analysis); he does wish basically to select the best of several procedures, and the major part of his analysis should therefore be directed towards this goal. It is precisely for this problem that ranking-and-selection procedures were developed. These procedures set sample size (in simulation this means run-length) explicitly so as to guarantee that the probability that &ldquo;the procedure actually selected by the experimenter is the best procedure&rdquo; is suitably large. In this paper we first review the background ideas of ranking-and-selection and contrast them to other approaches to multi-population problems (which, while sometimes appropriate in such areas as social science experimentation, are almost wholly inappropriate for use in statistical design and analysis of simulation experiments). Recommended procedures for several common situations are then outlined in detail. References where further theoretical details may be obtained are provided, along with information on current developments in the area. It is intended that the motivation and technical detail given be sufficient for intelligent application in many common situations (though other situations will still require supplementary consultation).
The use of APL in the management of a time sharing company
Authors: Daniel Dyer
Venue: Proceedings of the sixth international conference on APL (1974)

This paper discusses three major applications implemented in APL: electronic communications, accounting, and address management. Each has made an important contribution to operation and management control in a company developing, promoting, and providing time sharing services with a widely dispersed and highly specialized technical staff.
MAGIC
Venue: Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval (1978)

MAGIC is a simple, elegant, and time-saving system for retrieving, manipulating, and displaying time series data. The user of MAGIC is not required to know anything about file structures or computer programming. Finished reports and graphs suitable for reproduction are attainable after minimal experience with the MAGIC system.
A computer-aided-design system for segmented-folded PLA macro-cells
Authors: I. Suwa, W. J. Kubitz
Venue: Proceedings of the 18th Design Automation Conference (1981)

A PLA structure incorporating segmenting and folding features intended for use as a macro-cell for VLSI applications is described. A brief outline of a computer-aided-design system for the layout synthesis of such PLAs is given. The objectives are the attainment of compact area, low design time, and ease of design Symbolic layout generation for the PLA is treated in detail and practical design algorithms for partitioning and folding are discussed. An example is used to illustrate currently achievable results.
Phase coupling and constant generation in an optimizing microcode compiler
Authors: Steven R. Vegdahl
Venue: Proceedings of the 15th annual workshop on Microprogramming (1982)

The designer of an optimizing compiler must concern himself with the order in which optimization phases are performed; a pair of phases may be interdependent in the sense that each phase could benefit from information produced by the other. In a compiler for a horizontal target architecture, one such phase-ordering problem occurs between code-generation and compaction. Presented here is an overview of a research effort at Carnegie-Mellon University which has examined solutions to this problem. One aspect of the code generation problem-that of generating constants &ldquo;intelligently&rdquo;-is discussed in detail. A technique, called constant-unfolding, is described that can be used to produce code sequences that generate constants in &ldquo;unusual&rdquo; ways during execution; such code sequences can lead to more compact code when the literal field of the microinstruction is a &ldquo;bottleneck&rdquo;.