ppxscal/embedding_network huggingface dataset:
The development of dialogue design guidelines for a computer based local information system to be used by the general public
Authors: Martin Maguire
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

A number of trends over the last twenty years have brought the prospect of instant computer power to the ordinary man and woman to near fruition. The arrival of interactive computing coupled with developments in the communications field have enabled man and computer to converse both at high speed and at long distance. Furthermore the decreasing cost of microprocessor hardware has made the acquisition of a computer or remote computer access, affordable by most establishments and many ordinary people. A need exists therefore, to develop usable software interfaces or man-computer dialogues to support this equipment. This abstract reports on an experiment which was carried out as part of a research project /5/ to investigate the use which was made of a computer access system, developed by the author, to provide local information to the public.
The Pica-B Computer An Abstract Target Machine For A Transportable Single-User Operating Environment
Authors: Harvey Abramson, Mark Fox, Michael Gorlick, Vince Manis, John Peck
Venue: Proceedings of the 1978 annual conference (1978)

The Pica-B computer is a simple abstract machine designed to: 1. facilitate the portability of a simple single user operating environment written in BCPL. 2. serve the pedagogic goal of providing a basis for teaching concepts of hardware and system architecture, systems programming and programming language design in a unified setting, and 3. serve as a possible solution to the current and future software crisis caused by the advent of the micro-computer. The Pica-B is based on Richards' Intcode machine but differs from it in the addition of an (interrupt) status register and a PDP-II style memory map of I/O devices. The status register and hence interrupt and device handlers may be programmed in Pica-B code (an extension of Intcode) or in a version of BCPL with an added inline code facility, the so-called vile command. An example is given or how interrupts and I/O are handled in the Pica-B computer.
Feasibility study of an integrated program for aerospace vehicle design (IPAD)
Authors: Ralph E. Miller,  Jr., S. Hansen, A. Kawaguchi, D. Redhed, J. Southall
Venue: Proceedings of the 11th Design Automation Workshop (1974)

The basic goal of the IPAD system is to increase the productivity of the product design organization. This IPAD study showed increases in individual productivity are feasible through automation and computer support of routine information handling. Such automation can directly decrease cost and flowtime in the product design process.
Computational geometry with APL
Authors: Stig Gustafsson
Venue: Proceedings of the international conference on APL (1984)

This paper describes a system for computational geometry consisting of a method for representation of geometric figures and a set of APL functions. The system has been constructed at Kockums Computer Systems AB and is used as a research tool in the development of the STEERBEAR 3 ship-building system.
A model for description of communication protocol
Authors: Kazuhiko Chiba, Kazunori Konishi, Akira Kurematsu
Venue: Proceedings of the 6th international conference on Software engineering (1982)

This paper presents a model for the description of communication protocol in view of the total behavior of terminal equipment. In this model, a protocol entity is modeled as a group of processes and monitors, and synchronization between input and output processes is represented by the synchronizing mechanism based on the concept of the monitor. Furthermore, it is possible to specify the relation between entities of different layers of the protocol, including the relation between communication and local functions of terminal equipment. As an example of protocol description based on this model, TELETEX document layer protocol written in concurrent PASCAL language is illustrated.
The whole is greater than the sum of its parts or The effects of interfacing Waterloo SCRIPT with the IBM 6670 information distributor
Authors: Janet M. Hall
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

Waterloo SCRIPT is a powerful text formatting language with extensive capabilities. The IBM 6670 Information Distributor is a laser printer that produces high-quality output. However, without special considerations, text formatted with Waterloo SCRIPT cannot be printed correctly on the 6670. An interface is needed in order to allow use of both technologies together. This paper presents the evolution of Clemson's SCRIPT/6670 Post Processor and examines its impact on users as well as the Academic Computing Support staff at Clemson University.
An application of simulation to tracking
Authors: David A. Bennett, Christopher A. Landauer
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

The AIMER project (Automatic Integration of Multiple Element Radars) is an emulated model of a loosely coupled distributed radar tracking processor. The computational elements of the model are minicomputers similar to the PDP-11. Design goals of the model are to provide a reliable processing system whose computational bandwidth can be dynamically altered in response to changing ground scenario and availability of hardware. A large number of minicomputers connected with multiple packet networks was chosen as the framework for the design. Building such a network with real computers would not have provided the required reconfiguration flexibility, and so a hybrid simulation/emulation approach was chosen. The instruction set of the minicomputer family is emulated, which allows performance monitoring to be an integral part of the system. Simulation is the key to controlled experiments and comprehensive throughput analysis. The radar and ground environments are simulated with logic residing in one of the emulated minicomputers. The use of this simulation technique has resulted in an extremely flexible test bed for the development of distributed radar tracking system models. The test bed itself can be quickly tailored to other application problems. This model is implemented on a Nanodata QM-1 emulation support computer. The QM-1 has two levels of microprogram control store, which allow implementor man hours and efficiency to be traded off conveniently.
Predicting concurrent computer system performance using Petri-Net models
Authors: L. A. Cox,  Jr.
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

A method for efficiently employing Petri-Net models to predict performance of concurrent computer architectures is presented. The feasibility of such methods for use as architectural design tools is demonstrated, and the model's properties are discussed.
Zeus: A hardware description language for VLSI
Authors: Karl J. Lieberherr, Svend E. Knudsen
Venue: Proceedings of the 20th Design Automation Conference (1983)

Zeus is a technology-independent hardware description language which supports functional and structural (including layout) specifications. Among the interesting characteristics of Zeus are that type checking is used to prevent accidental power to ground connections and that only four basic type concepts (ARRAY, COMPONENT, boolean and multiplex) and the possibility to instantiate types as signals are used to describe complex hardware. Zeus has been tested on a variety of examples like: Finite state machines, comparators, multiplexors, adders, pattern matching, AM2901, dictionary machines and systolic stacks.
A color halftoning algorithm for low-bit flat panel displays
Authors: Je-Ho Lee, Yong-Moo Kwon, Hyoung-Gon Kim
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

A new color halftoning algorithm for very limited flat panel displays is proposed. We introduce a new method of color image halftoning that incorporates the human visual characteristics within the frame work of error diffusion to improve the quality of halftoned images. Moreover, by exploiting an adaptive processing technique which eliminates the estimation of the second-order statistics for input images, coefficients of the error diffusion filter are updated adaptively according to the characteristics of the input image. The image quality resulting from the proposed algorithm is measured by subjective evaluation and shows less artificial contouring and visual worm patterns.
Change control in automated design
Authors: John K. Brown
Venue: Proceedings of the SHARE design automation project (1966)

In the design and production of large missile and space systems, one of the largest tasks is the creating of drawings and the maintaining of drawings at any given revision level. The management teams of present aerospace systems are discovering that the job of up-dating drawings and at the same time creating new ones is consuming a disproportionate amount of time and money. The problem of maintaining drawings up to the most recent revisions can be solved with in an automatic change control system. This paper will discuss the following topics: a. The change control system requirements, b. The organization of drawing data into drawing files, c. The routines for realizing the change control requirements, d. The system incorporating these routines in their logical sequence.
A minimum-impact routing algorithm
Authors: Kenneth J. Supowit
Venue: Proceedings of the 19th Design Automation Conference (1982)

A routing heuristic is presented thatroutes two-terminal nets one at a time, for each net choosing the path so as to avoid adversely impacting the nets not yet routed. An algorithm is presented and proved to correctly implement this heuristic; the computational complexity of that algorithm is shown to be polynomially bounded, but perhaps still too great to be of practical use. Another, speedier algorithm is presented that seems to approximate the heuristic rather closely. Strong evidence is given that the Lee routing algorithm is in some sense inadequate to implement this heuristic. The heuristic has been applied, with very encouraging results, to a specific routing problem: the routing of a channel in which all four sides of the channel may contain terminals. This problem arises in the layout of custom VLSI.
Observations on the interaction between coding and efficiency knowledge in the PSI Program Synthesis System
Authors: David R. Barstow, Elaine Kant
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper discusses how the synthesis phase of the PSI system constructs programs from high level program models by using coding knowledge and efficiency knowledge. In our preliminary implementation, these knowledge bases are separated into distinct modules, the coding expert and the efficiency expert. We describe how the coding expert uses rule-based programming knowledge to produce alternative algorithm and data structure choices, and how the efficiency expert selects the best choice by estimating the costs of the alternatives using analysis of algorithm techniques. Communication between the modules centers around descriptions of partially developed programs which are produced by the coding expert and analyzed by the efficiency expert. Our system has implemented several small programs. From our experience with these modules, we conclude that there is a strong interaction between coding and efficiency knowledge which necessitates a corresponding complexity in the communication mechanism.
Application of discrete system simulation to insect population dynamics
Authors: M. R. Halley, D. E. Lamb, T. Saydam
Venue: Proceedings of the 14th annual symposium on Simulation (1981)

The population dynamics of the insect European Corn Borer have been simulated using discrete event simulation. Discrete system simulation offers several advantages over continuous simulation. Discrete simulations are homomorphic with the life cycle of the insect and are less computationally complex. Discrete simulation also offers the advantages of waiting time distributions and scaling for widely varying populations. The simulation was used to determine the optimum time to apply insecticide to reduce destructive pest stages. The sensitivity study found that the optimal time to apply insecticide was to several early stages of the first generation of the insect.
Employment decisions by computer science faculty: A summary of the 1980-81 NSF survey
Authors: Gerald L. Engel, Bruce H. Barnes
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

Over the past several years a great deal has been written, and even more said, regarding the crisis in employment of faculty in computer science departments (1,2,3,4,5). In order to obtain data regarding the magnitude of the problem, and reasons for it, the National Science Foundation, in the 1980-81 academic year conducted a survey of Ph.D. granting departments of computer science in the United States. This paper will present a summary of the results of the survey. Data obtained regarding the departments were consistent with that reported earlier by Hamblen (6,7), and Taulbee and Conte (8). Results of the survey regarding motivation for professional mobility were consistent with those reported by Eisenberg and Galanti (9) regarding the engineering disciplines.
Unique decomposability of shuffled strings: A formal treatment of asynchronous time-multiplexed communication
Authors: Kazuo Iwama
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

A string x is said to be decomposed into strings yl,Y2,...,yn if x is in y1 @@@@ y2 @@@@ ... @@@@ yn where @@@@ is the shuffle operator. We consider the problem of decomposing x into yl,Y2,...,yn such that yl,Y2,...,yn belong to predetermined languages L1,L2,...,Ln, respectively. Conditions under which such a decomposition is unique are presented as well as uniquely decomposable L1,L2,...,Ln which are of practical significance from the viewpoint of time-multiplexed communication.
A case study in the use of data base management
Authors: A. M. Koss, J. M. Noonan
Venue: Proceedings of the 1976 annual conference (1976)

Data base management systems have been presented as the means for improving information accessibility and consolidating data processing. In a non-dedicated computer environment the resource allocation that such systems require must be considered. Based on more than four years experience with data base management systems, this paper analyzes the efficiencies and computer resource usage of a data base management system with random access in comparison with the efficiencies and computer resource usage of a data base management system based on sequential and random access.
Computers and society: An interdisciplinary approach
Authors: E. Horowitz, M. C. Horowitz
Venue: Proceedings of the third SIGCSE technical symposium on Computer science education (1973)

Since their inception some 25 years ago, computers have become an all pervasive influence in society. Their impact has been felt not only in the sciences and social sciences, but in almost all fields of endeavor where there is a significant amount of information to be taken, stored and manipulated. Their use in the many spheres of business activity has contributed to the creation of a huge computer industry. In recognition of the immense social influences of computers and the concurrent influence of the technocrats who &ldquo;control&rdquo; the machines, computer science departments have recently tried to respond to the challenge by giving their students an awareness of these forces. Their response has taken basically 2 forms. The first approach has been to incorporate within existing courses a measure of social awareness and responsibility. This has been accomplished by examining, where appropriate case situations of computer related developments and trying to assess their implications in the social context. Experiments of this type have been reported by [NEI72]. The second approach has been to create a new course, often called Computers and Society, whose main goal is to expose the student to at least a subset of the relevant issues connected with computers. Though called by the same name, these courses often vary widely, and several proposals which describe various formats have appeared in the literature e.g. see [HOR72] and [LEE71]. This paper deals with a variation on this second approach.
Using the cloze procedure to assess program reading comprehension
Authors: Eileen B. Entin
Venue: ACM SIGCSE Bulletin (1984)

This paper discusses the feasibility of using cloze procedure to assess program reading comprehension. Two Pascal programs were prepared as cloze tests and administered to introductory computer science students. Scores on the cloze tests were found to be positively related to other measures of program reading comprehension. A number of procedural and methodological issues are raised, but, overall, the results indicate that the cloze procedure can be used to assess program reading comprehension and, perhaps, program complexity as well.
A student-computer programming system for teaching graph and network theory
Authors: Pentti A. Honkanen
Venue: Proceedings of the third SIGCSE technical symposium on Computer science education (1973)

This paper describes a programming system used in the teaching of two Computer Science courses at The Pennsylvania State University (7). The courses are; an upper level undergraduate-beginning graduate level course in graph theory, and a graduate level course in the theory of graphs and networks. As can be ascertained from the description of these courses they are not primarily what would normally be called programming courses. However, since they are computer science courses they do stress the computational aspects of graph and network theory and analysis. Past experiences have indicated that if a computational problem of any reasonable complexity is assigned in class the majority of the students focus an inordinate amount of their energies to the programming problems, and consequently fail to grasp the significant features of the theoretical problems involved. In addition, since graph and network theory encompasses not only computer science, but engineering and physical, and to a lesser extent, the social sciences, many of these students would be unduly burdened by writing many rather complex programs. On the other hand, teaching the computational aspects of graph theory without doing some programming is equally ludicrous. Thus, a default type solution of assigning two or three problems from a narrow set of problems was rapidly becoming an undesirable solution to this dilema. It was at this point that the concept of a dynamically growing programming system, as described in this paper, began to formulate itself.
Integrating uncertainty into a language for knowledge based systems
Authors: Bruce D'Ambrosio
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Fm is an object oriented language designed to serve as a testbed for experiments in the development of conceptual structure in continuous domains. Possibilistic truth representation is fully integrated into a language for building knowledge based systems offerring support for object, rule, and data-access based programming styles as well as the more traditional procedural form. A prototype implementation of Fm has been written in Franzlisp and has been used to construct two simple expert systems, one a data structure consultant and the other a knowledge based automobile driver. This paper describes the facilities provided in Fm for representing and reasoning with uncertain information.
The bell laboratories numerical mathematics program library project
Authors: W M Gentleman, J F Traub
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

Most computer facilities have &ldquo;program libraries.&rdquo; All too often the library is inadequate because: 1. The latest and best algorithms are not used. 2. When several routines are available which purport to do the same job, there is little or no indication as to which one is best, and under what circumstances. 3. Certain basic programs are completely missing. 4. Certification is haphazard. Routines are not, and should not be, trusted. (By certification we mean a stamp of approval that someone other than the author has tested the program and that the tests were &ldquo;successful.&rdquo; Certification must be accompanied by documentation of the tests.) 5. Documentation is inadequate: the method used is not divulged, values of fundamental constants are not given, limitations are not properly described. 6. Often the routines are incompatible with respect to calling sequence or data format and cannot be used together.
The use and disuse of APL: An empirical study
Authors: Raymond Kanner
Venue: ACM SIGAPL APL Quote Quad (1982)

A sample of over 200 workspaces containing over 80,000 lines of code were analyzed to determine their composition and structure. Statistics were gathered on the frequency of all monadic and dyadic functions, operators, system variables and functions as well as other workspace and defined function characteristics. The results of the study indicated that only a fraction of the APL primitive function set was being utilized despite the language's richness. The ubiquitous 80-20 phenomenon was well represented. In general, 80% of all APL usage occurred with 20% of the available function set. This seems to support a contention that more awareness needs to be directed toward &ldquo;thinking primitive&rdquo; instead of only &ldquo;thinking array&rdquo;. Some comparisons with a previous study by Saal and Weiss will be made.
Modelling techniques for dynamic logic and test pattern generation of a microprocessor
Authors: B. A. Prasad
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

Most of the software logic simulators available today have been designed with particular application to the simulation of static logic. Dynamic logic, using transmission gates, a bidirectional analog device, has, however, become popular in MOS LSI due to the higher levels of integration it allows. A modelling technique has been developed by which an interconnection of transmission gates can be simulated on simulators designed for static logic. The model preserves the fault-free behavior as well as the faulty behavior of the original circuit. Preservation of the latter property is particularly important in simulators having fault injection capabilities. The modelling technique was used for doing the fault simulation and test pattern generation of a single dynamic microprocessor. During this process, it was observed that a very high level of fault coverage can be obtained in that portion of the microprocessor which contains the different registers and the arithmatic logic unit. However, failures in the decoder which decodes the contents of the instruction register are more difficult to detect and the microprocessor has to be exercised through complicated sequences to detect them.
Introduction to the SRC design sciences program
Authors: Ralph K. Cavin,  III
Venue: Proceedings of the 21st Design Automation Conference (1984)

The SRC is supported by 29 member companies and sponsors basic and applied research in semiconductor devices, processes, and design at U.S. universities. There are two centers of excellence and fourteen research projects in the SRC Design Sciences research program. The center of excellence in CAD at the University of California at Berkeley considers all phases of the design process but emphasizes most heavily the device, layout and circuit levels. The Carnegie-Mellon University Center of Excellence In CAD is likewise broadly based but tends to concentrate on the functional levels of the design process. The 14 university research projects address all levels of the design process.