ppxscal/embedding_network huggingface dataset:
Controversies in the design of computer-mediated communication systems: A Delphi study
Authors: Murray Turoff, Starr Roxanne Hiltz, Elaine B. Kerr
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Computer-mediated communication systems represent a fairly new development in interactive computer systems. This paper will summarize the procedures followed in the Delphi survey, and the results and will then turn to a more detailed treatment of the disagreements that were discovered, presenting the arguments which underlie the disagreements. We will conclude with a brief discussion of the extent to which Delphi approaches may be generally useful design tools for summarizing the &ldquo;state of the art&rdquo; and pinpointing research priorities for new types of systems. The purpose of the synthesis of design choices presented in this paper is to familiarize the reader with the range of capabilities and characteristics that currently exist, and to summarize the &ldquo;collective wisdom&rdquo; of designers so as to establish design guidelines and options for future systems.
A probabilistic relation between desirable and feasible, models of parallel computation
Authors: Eli Upfal
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We present a powerful probabilistic technique for simulating strong models of synchronized parallel computation by weaker ones. The technique is demonstrated by an algorithm simulating an n processor PRAM, with an arbitrary large shared memory, by an n processor ULRTACOMPUTER (a set of n processors communicating through a bounded degree network, and sharing no common memory). We prove that if a program required t PRAM steps, our simulation algorithm executes it on the ULTRACOMPUTER within O(tlog2n) steps with overwhelming probability.
Vision, perception and imagery
Authors: David M. McKeown,  Jr., Susan E. Brennan, Alex P. Pentland, Richard F. Voss
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

How principles of perception and human interaction can be used to solve problems in machine vision and image generation.
1971 AFIPS information processing personnel survey
Authors: Robert Dickmann
Venue: Proceedings of the tenth annual SIGCPR conference (1972)

A primary difficulty in conducting a survey is in getting a representative sample. Gathering data on Information Processing personnel is further complicated by the lack of one professional society to go to for a membership list, standardized educational requirements which would allow you to access by degree or standardized job titles which would allow surveying through organizations where they are employed. Although several governmental organizations gather data on Information Processing personnel, most of the data is incomplete and the names and addresses, if available, are confidential. The alternative chosen for this survey was a sampling of the membership lists of the professional societies encompassing the Information Processing field.
Management of APL public libraries
Authors: Marguerite A. Boisvert
Venue: Proceedings of the international conference on APL: part 1 (1979)

Ten years of APL public-library acquisitions were sorted through, reduced in quantity, and reorganized. Policies intended to assure high quality in new acquisitions were developed, and programs were created both to support these policies and to provide ease of access to all public-library materials.
A pedagogical exercise utilizing computer simulation
Authors: Newell E. Chiesl
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

&ldquo;Tommie Company&rdquo; is an interactive computerized case developed by the author with the help of a grant from Western Illinois University. The purpose of the computerized case is to provide assistance in the teaching of marketing management and to partially bridge the gap between theory and reality for the student in a business curriculum.
Revisiting an operational graphic design system
Authors: S. P. Krosner, W. H. Sass
Venue: Proceedings of the 8th Design Automation Workshop (1971)

In 1968 we described an experimental multitasking monitor for the IBM 1130 system.(1) In 1970 we described a logic design and analysis application using the multitask monitor as a base.(2) This application supports interactive graphic design on the IBM 1130/2250 system. The emphasis in both of these papers was placed on what we had done. This paper will instead attempt to answer the question &ldquo;how was it done?&rdquo;. The system consists of three major subsystems which interact to achieve a common goal. These groups are: &bull;The development group. These are the people who will design and implement the tool. &bull;The user group. These are the people who will directly use the tool to design and analyze computer components (or other product) and who require computer-aid (whether they know it or not). &bull;The third (and most often overlooked) group are the users of the system's output. These people are the assembly technician, production control specialist, quality inspector, manufacturing engineer, or other party who uses the system generated data in his day-to-day work. Traditionally the design automation process has been tailored to satisfy the needs of the second group. It is our feeling that if design automation is to be useful it must address the needs of the data consumers as well as the data generators.
Variable dimension quantization in the transform domain
Authors: D. L. Tull, R. J. Safranek
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Quantization is a critical procedure in lossy image compression. Linear (uniform) quantizers are used in most of the present image (sequence) compression standards for their simplicity and flexibility. Unfortunately, the resulting representation is often inefficient, preventing potentially significant gains in image compression. We introduce a new class of linear, low complexity, variable dimension quantizers (VDQ) that efficiently reduces the redundancy of the data stream while retaining the design flexibility and signal-to-noise performance of a linear quantizer. When applied to frequency domain representations in the JPEG image compression standard, this approach resulted in SNR improvements of almost 9 dB over the baseline quantizer at comparable bit rates. The algorithm presented is near optimal and runs in O(N) time, making it suitable for real time applications. Its low complexity and effectiveness make VDQ a promising alternative to conventional quantization for image codecs.
Surveillance Sensor Systems Using CMOS Imagers
Authors: A. Teuner, M. Hillebrand, B. J. Hosticka, S.-B. Park, J. E. Santos Conde, N. Stevanovic
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Surveillance sensors are being applied in factory automation systems, traffic control, entrapment protection, automotive safety systems and in other applications where information about the occupancy of a scene is required. In order to detect object motion several methods exploiting distinct physical phenomena, e. g. passive infrared sensors or active microwave sensors, have been realized. When comparing all of the applicable methods, the electro-optical approach outperforms with respect to the spatial resolution of the monitored area. Therefore, electro-optical sensors are able to provide additional information, e. g. to predict the direction of motion, or to localize and identify objects.However, convenient image processing systems using CCD sensors for image acquisition and DSP or µP boards for signal processing and classification are not well suited for dedicated, powerful and cost-effective optical sensor solutions. In contrast to this mainstream approach CMOS based imaging technologies offer novel solutions in both the design and applications of electro-optical surveillance sensors.This contribution discusses CMOS imagers operating principles and describes certain architectures and applications for passive and active surveillance sensors. The capabilities to realize on-chip motion detection and range sensing using fast shutter devices are illustrated. We conclude with a discussion of the status of CMOS surveillance sensors and suggest trends for future applications.
SYNARC: A computer - aided model for architectural design
Authors: Joseph I. Greenberg, San Luis Obispo, Steven A. Siskind
Venue: Proceedings of the 9th Design Automation Workshop (1972)

The SYNARC model provides the architect-planner with a series of modular programs which allows him to evaluate and revise conceptual design solutions with a precision that has been heretofore lacking. SYNARC allows the architect to evaluate his conceptual design solution at every level of development from basic land plan to transportation systems location, from land-use and building locations to economic feasibility. It provides objective output data from physical attributes of the conceptual design solution for the architect to interpret. While the negative aspects of speculative investment and rigid financial considerations can never be isolated from solving the problems of the built-environment, the SYNARC model can allow the architect to deal with them in a more integrative, problem-solving process, perhaps producing design solutions which are more sensitive and sympathetic to all human needs.
A software reliability assessment based on a structural and behavioral analysis of programs
Authors: Simone Pimont, Jean-Claude Rault
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper deals with the problem of assessing the reliability of programs written using structured programming techniques and having undergone a certain amount of testing. A program is said to be verified if, for a given set of tests it can be shown that every case of interest has been tested. As this end is, however, unattainable, we will consider, in the following, that a program is verified if one can prove that all the logic paths in the program flow graph have been traversed. Therefore, we will consider that a certain degree of verification is attained with a given set of tests, according to the number of paths actually traversed. This degree of verification, which is a non-decreasing function of the number of tests can be considered as an assessment of program reliability. The degree of verification attained through experiments can then be deduced from the images of experiments in the program flow graph. This paper defines a practical procedure to perform such an evaluation.
A rectangular area filling display system architecture
Authors: Daniel S. Whelan
Venue: Proceedings of the 9th annual conference on Computer graphics and interactive techniques (1982)

A display system architecture which has rectangular area filling as its primitive operation is presented. It is shown that lines can be drawn significantly faster with this architecture than with a pixel display system. The rendition of filled boxes is also faster showing an O(n2) speed improvement. Furthermore filled polygons can be rendered with an O(n) speed improvement. The design and implementation of this rectangular area filling architecture are discussed and refined. A custom VLSI integrated circuit is currently being designed to implement this rectangular area filling architecture and at the same time reduce the display memory system video refresh bandwidth requirements.
SICSOFT (Tutorial Session)
Authors: Don Good
Venue: Proceedings of the 1976 annual conference (1976)

This session will provide an introduction to the fundamental issues of proving properties of computer programs. No attempt will be made to provide an exhaustive survey, but enough of the basic concepts and techniques of proving programs will be included so that the interested reader can pursue specific interests on his own.
Dynamic microprogramming in a time sharing environment
Authors: Ratan K. Guha
Venue: Proceedings of the 10th annual workshop on Microprogramming (1977)

In this paper, we present the system design and implementation of a very flexible dynamic microprogramming support system in a time sharing environment. The system has been implemented under the UNIX time sharing operating system on the user microprogrammable computer CAL DATA 135. The system allows the user to write, assemble, test and debug a microprogram very easily in a multiuser environment. Since the user has access to the internals of the computer, reliability and integrity of the computer system become the primary concern. So when a microprogram is written either it is simulated or it goes through a certification procedure with the help of the user and the system. To ensure the reliability and integrity of the system, the certification procedure becomes a necessity. Once a microprogram is certified, a copy of the program is kept in the system so that it can be used by anyone (if the user wants to share). Thus anyone can take advantage of any of the existing microprograms in the system.
On a laboratory for the study of automating programming
Authors: T. E. Cheatham,  Jr., Ben Wegbreit
Venue: Proceedings of ACM conference on Proving assertions about programs (1972)

At the present time there is considerable interest in the general question of &ldquo;automating programming:&rdquo; there are a number of people actively doing research concerned with various aspects of the question and even a few projects exploring various practical issues via experimental implementations. The area encompassed by &ldquo;automating programming&rdquo; is a very broad one, particularly if one understands &ldquo;programming&rdquo; to include the entire spectrum of activities concerned with producing algorithms which are correct and effective in terms of certain design specifications. It is therefore to be expected that comparison of various techniques and integration of those techniques and the experimental facilities developed in a variety of institutions will be difficult and expensive unless there is some coordinated effort to provide a common framework to support such activities. We would note that at present it is relatively expensive just to construct sufficient programs to permit the investigation of and experimentation with some proposed technique of program automation; because of this many studies in the general area of programming automation are primarily &ldquo;paper studies&rdquo;. It is the purpose of this note to provide an overview of the project currently under way at Harvard's Center for Research in Computing Technology, directed toward the implementation of a laboratory for the study of programming automation techniques. A more detailed discussion of our approach is provided in [1]. In the four sections which follow we will discuss briefly our view of the use of a program automation laboratory, the basis for and basic components of the facility currently being implemented, and finally, suggest that there are a variety of research areas which are strongly related to the question of automating programming in which the laboratory might be employed as a research tool.
Keyboard entry - can it be simplified?
Authors: Richard I. Land
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

The present keyboard arrangement cannot be defended as comfortable, logically arranged, or optimized for human efficiency. Information theory based experiments suggest measures for alternative arrangements. Character sets used in different tasks can be expected to yield different optimal key locations. New tasks are introducing new characters and changing the frequency of selected old ones. Numerous alternative arrangements for alphanumeric fingered entry have been designed, but none are supported by conclusive testing. The amateur keyboard user far outnumbers the professional. Computer entry and word-processors are overtaking the simple typewriter as common alphanumeric stroke entry devices. Compromise and selection of a simplified keyboard that is compatible with present mechanical and electronic designs is advocated.
Trees, automata, and games
Authors: Yuri Gurevich, Leo Harrington
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

In 1969 Rabin introduced tree automata and proved one of the deepest decidability results. If you worked on decision problems you did most probably use Rabin's result. But did you make your way through Rabin's cumbersome proof with its induction on countable ordinals? Building on ideas of our predecessors-&-mdash;and especially those of B-&-uuml;chi-&-mdash;we give here an alternative and transparent proof of Rabin's result. Generalizations and further results will be published elsewhere.
Women in science and academe
Authors: Karen Wieckert, Nell Dale
Venue: Proceedings of the fifteenth SIGCSE technical symposium on Computer science education (1984)

Karan Wieckert will outline the process, conclusions and recommendations of a report published in February of 1983 by the female graduate students and technical staff in computer science and artificial intelligence at the Massachusetts Institute of Technology. Incidents of subtle discrimination from the laboratory work environment will be described as well as general assumptions which give rise to these problems. Also, the effects these incidents have upon women and recommendations for alleviating the problems will be presented. Nell Dale will present the results of a project of the Women in Science Career Facilitation Program of the National Science Foundation. Re-entry projects for women with undergraduate degrees in the sciences were funded over a seven year period. As a part of the final survey questionnaire sent to over 140 participants, a section on discrimination was included. The results of this section will be presented.
DMAP-a COBOL extension for associative array processors
Authors: Harold K. Resnick, Arvid G. Larson
Venue: ACM SIGPLAN Notices (1975)

This paper defines a high-level programming language for a generalized associative array processor (AP). In particular, a data management language for APs, known as DMAP, is developed for use with a representative AP model. This development model, containing both an associative processing section and a sequential processing section, which may operate concurrently, follows current AP design technology[1]. DMAP fully exploits the capabilities available in current AP technology by extending ANSI COBOL [2,3] to support data management functions in an AP environment. There exists general agreement that the use of a high-level language can significantly facilitate the AP programming process in many applications [4,5]. However, a search of the literature suggests that few attempts at high-level language implementation, or even definition, have been made to date [6,7]. The several additional and unique difficulties associated with application-oriented programming of parallel processors in general, and APs in particular, mandates a high-level language capability to produce cost-effective utilization of their processing resources. This paper considers one approach, a first step, toward this development of a high-level language capability to provide some alleviation of immediate programming difficulties as well as provide a tool for further exploration of AP technology.
Computer aided schematics
Authors: Gwendolyn G. Hays
Venue: Proceedings of the 11th Design Automation Workshop (1974)

The paper presents an example of how a computer aided system has aided in the generation of publications in a shorter time frame and at a 33 percent cost savings. A program which produces schematics is examined in detail.
Computer design: The minimization of Boolean functions containing unequal and nonlinear cost functions
Authors: M. A. Breuer
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THIS PAPER will cover the use of linear programming in the minimization of Boolean functions. A vast literature exists on methods of simplifying Boolean functions. A few of the more classical and widely used techniques are those known as the Veitch, Harvardand Quine methods. These simplification procedures make the a priori assumptions that all literals are equal in cost to implement, and that this cost is a constant; i.e., invariant to the number of times a literal is used. In actuality, these two basic assumptions generally prove to be false. When lead length, loading, fan-in, fan-out, and other associated manufacturing and circuit problems are taken into consideration, it is found that the cost for all literals need not be the same. For example, fan-out considerations appear to present a nonlinear cost problem, where the cost is a function of the number of times a literal is used. By formulating the simplification problem as a linear program these basic and important cost factors can be taken into account.
Bell Labs microcode for the IBM 360/67
Authors: S. M. Bauer
Venue: Proceedings of the 8th annual workshop on Microprogramming (1975)

By means of user microprogramming, several machine instructions have been added to the repertoire of an IBM System 360 Model 67 processor in use at Bell Laboratories Indian Hill Computation Center. Two of the instructions have replaced small routines in the TSS operating system which runs on the Model 67. We have attempted to measure their impact on system performance in order to gauge the effectiveness of microprogramming as a tuning tool on a large scale processor. True to its professed policy on customer microprogramming, IBM offered no assistance (nor impediment, fortunately) to our efforts. Its policy becomes especially significant in view of the fact that the control store in the Model 67 is read-only. More than half the duration of the project was spent duplicating IBM's capacitor read-only storage (CROS) plane technology, using in-house laboratory facilities. We feel that we can draw two conclusions from the outcome of the project. Given adequate time and facilities, custom microcode can be written to improve the performance of a processor with a complex, highly specialized, highly concurrent control organization. However, custom microcode tends to be cost-effective as a performance tool only when applied to a small, as yet undefined set of bottlenecks in compute-bound systems.
Garbage collection in a large LISP system
Authors: David A. Moon
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

This paper discusses garbage collection techniques used in a high-performance Lisp implementation with a large virtual memory, the Symbolics 3600. Particular attention is paid to practical issues and experience. In a large system problems of scale appear and the most straightforward garbage-collection techniques do not work well. Many of these problems involve the interaction of the garbage collector with demand-paged virtual memory. Some of the solutions adopted in the 3600 are presented, including incremental copying garbage collection, approximately depth-first copying, ephemeral objects, tagged architecture, and hardware assists. We discuss techniques for improving the efficiency of garbage collection by recognizing that objects in the Lisp world have a variety of lifetimes. The importance of designing the architecture and the hardware to facilitate garbage collection is stressed.