ppxscal/embedding_network huggingface dataset:
Computer science research in office automation
Venue: Proceedings of the ACM '82 conference (1982)

Whether an &ldquo;office&rdquo; is situated in academia, business, industry or government, the potential application of computer and communication technologies toward its more effective functioning presents particularly complex and challenging problems to researchers in computer science. It is no longer satisfactory to merely have a separate, supportive computer center configured on a centralized basis with its hardware/software/database constituents designed for and situated in a tightly controlled, remote computer room, accessible only to well-trained staff. Instead a modern-day office demands distributed processing and access for potentially all of its employees. It is forcing us to consider the networking of a number of heterogeneous types of computers and terminals with various kinds of nonspecialist users who need or want suitable access from their personal workstations. This precipitates not only &ldquo;distribution&rdquo; of hardware, but also systems software, applications software, databases, network control, access security, and more. Indeed, if we define an automated office (or a computer-based office system) to be an organizational/technological entity which encompasses a set of resources (computer hardware, software, databases, communications equipment, people, etc.) working in some specified pattern(s) of interconnection, interdependency or relation toward the accomplishment of one or more organizational objectives, we have quite a job on our hands in terms of applied research which can support the design of such a system. Not only must its low-level functioning with respect to its component resources be addressed; attention must also be paid to putting those pieces together into an effectively operating complete system. The latter requires research with a global view and with abilities to conceptualize, model, analyze, synthesize and integrate the various component parts and related considerations toward creating a unified, harmonious whole.
Evaluating computer graphics systems organizations(Panel Discussion)
Venue: Proceedings of the 1975 annual conference (1975)

The potential user of a high-performance computer graphics system must select a specific system, but he must also determine which generic type of system best serves his needs. There are three types of computer graphics systems: stand-alone, satellite, and network. Stand-alone graphics systems are configured with a display directly attached to a general purpose computer which is not connected to another computer and whose use is dedicated to the graphics system. Satellite systems utilize a large computer to which is connected a graphics terminal which itself generally contains a small computer. Network systems, which are just now emerging, are in some ways a combination of the other two: a stand-alone system which may utilize a relatively low-speed connection to a supporting computer. Each of the panelists has had experience in implementing the same application (display and manipulation of molecular models) on a different system type. The system will be defined, characterized and evaluated by the panelists before beginning an interchange between the audience and panel.
Stereoscopic computer graphics for simulation and modeling
Authors: John A. Roese, Lawrence E. McCleary
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

A visually effective stereoscopic CRT display technique has been developed which uses continuous tone computer graphics in combination with electro-optic shutter viewing devices. The technique involves the generation of left and right perspective views of an object model using continuous tone computer graphics. The perspective views constitute stereo pairs and are displayed in an alternating manner on the even and odd field scans of a conventional 2:1 interlace raster scan CRT display. When viewed with electro-optic shutters operated synchronously with the CRT field scan rate, the alternating perspective views are perceived as stereoscopic images with strong binocular depth-of-field sensations. Lightweight stereoscopic viewing glasses have been developed which use lead lanthanum zirconate titanate (PLZT) ceramics as electronically controlled shutter elements. Representative applications of the stereoscopic display technique to dynamic flight simulation and complex molecular modeling are presented. The flight simulation illustrates a landing sequence on an aircraft carrier while the modeling application shows complex three-dimensional structures of double helix DNA and bacterial ferredoxin molecules. The stereoscopic display technique has been shown to be highly effective for adding binocular depth-of-field to computer graphics displays with a resulting enhancement of object model realism.
The semi-automatic generation of processing element control paths for highly parallel machines
Authors: Theodore M. Sabety, David Elliot Shaw, Brian Mathies
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper describes a recently implemented program that very rapidly generates control paths for different variants of the constituent processing elements of a particular massively parallel machine; the NON-VON Supercomputer. The program, called PLATO, accepts as input a set of instruction opcodes, together with associated control information, and produces as output a functionally correct, highly area-efficient set of PLA's for the processing elements. One novel aspect of the program is its use of a channel routing algorithm to generate a Weinberger Array layout for the OR-plane of the PLA. By supporting extremely rapid generation of processing elements with different instruction sets, PLATO facilitates &ldquo;rapid turnaround&rdquo; architectural experimentation of a sort that would otherwise be impractical. Use of the program has already yielded major area and performance improvements in the NON-VON processing element. Many of the techniques employed in the PLATO system should prove applicable to the semi-automatic layout of processing elements for other multiprocessor machines.
Gabor wavelets for 3-D object recognition
Authors: Xing Wu, B. Bhanu
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

This paper presents a model-based object recognition approach that uses a hierarchical Gabor wavelet representation. The key idea is to use magnitude, phase and frequency measures of Gabor wavelet representation in an innovative flexible matching approach that can provide robust recognition. A Gabor grid a topology-preserving map, efficiently encodes both signal energy and structural information of an object in a sparse multi-resolution representation. The Gabor grid subsamples the Gabor wavelet decomposition of an object model and is deformed to allow the indexed object model match with the image data. Flexible matching between the model and the image minimizes a cost function based on local similarity and geometric distortion of the Gabor grid. Grid erosion and repairing is performed whenever a collapsed grid, due to object occlusion, is detected. The results on infrared imagery are presented. Where objects undergo rotation, translation, scale, occlusion and aspect variations under changing environmental conditions.
Every little bit hurts: Saving money by saving space in APL
Authors: Richard Alercia, Robert Swiatek, Gerlad M. Weinberg
Venue: Proceedings of the fourth international conference on APL (1972)

The State University of New York at Binghamton has been a user of IBM's APL system since the earliest releases, and currently runs about 50 ports on a model 155. At the time of our study, 1400 user numbers accounted for approximately 5000 tracks of 2314 space. A persistent trouble in our system seems to be one of inadequate space on disk files. At the beginning of a semester there is quite a bit of space, but as the weeks pass on, the disks fill monotonically until users begin to feel the effects. Each passing year seemed to see the addition of another 2314 to the system, in order to solve the previous year's problems, and each year the system fills up. Other installations have told us of the same difficulty, so we decided to investigate the problem. We conducted our investigation during the Fall of 1971, through a survey and through detailed investigation of a random sample of individual users' workspaces. Our sample generated 295 user numbers, two of which were no longer in use and 48 of which were locked. We respected all locked numbers and workspaces&mdash;of which there were only seven under unlocked numbers. Altogether, then, we investigated 245 numbers. We realize that the profile of locked numbers may be different from that of the unlocked, but we do not know how to adjust for the difference. We conjecture that the average locked user is a larger, more sophisticated user, and since they seem to waste more space among the unlocked, we imagine that our estimates are consequently on the conservative side.
Control variates in nonlinear regression
Authors: James J. Swain
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

Control variates can be applied to Monte Carlo sampling experiments to improve the precision of the results. This method is especially useful in statistical problems were low order approximators of a particular variate of interest are available and possibly several statistical properties of the variate are to be investigated. In this paper a control variate scheme based on the linear approximator &sgr; of the nonlinear parameter estimator (@@@@) is used to improve the precision of the first four moments of (@@@@) and the covariance matrix of the paramter estimates. The control variate method is shown to improve the effectiveness of the Monte Carlo results without substantially increasing the estimation effort, and it is effective over a wide range of nonlinearities. An approximate expression for the effectiveness of the control variate method based on the Beale measure of nonlinearity N&thgr; is given.
MULTI - a LISP based multiprocessing system
Authors: Donald P. McKay, Stuart C. Shapiro
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

A package of LISP functions, collectively called MULTI, which extends LISP 1.5 to multiprogramming is presented. MULTI defines the notion of a process within a LISP implementation using function invocation as the only control primitive. A process is an executable entity consisting of a process template and a set of register values. The process template defines the operations the process carries out. Process environments are saved in what can be viewed as function call instances, i.e. LISP forms which have the name of a process template in functional position and the register values following it. The flexibility of this simple conceptualization of processes is demonstrated by several examples which use MULTI to implement recursion, backtracking, generators, agendas and AND/OR graph searching. The implementation of MULTI does not assume that the host LISP system provides any data or control environment saving mechanisms such as FUNARG or INTERLISP's spaghetti stack. Thus, MULTI is portable to other LISP systems.
Novanet communications network for a control system
Authors: J. R. Hill, J. R. Severyn, P. J. VanArsdall
Venue: Proceedings of the eighth symposium on Data communications (1983)

Novanet is a control system oriented fiber optic local area network that was designed to meet the unique and often conflicting requirements of the Nova laser control system which will begin operation in 1984. The computers and data acquisition devices that form the distributed control system for a large laser fusion research facility need reliable, high speed communications. Both control/status messages and experimental data must be handled. A subset of NOVANET is currently operating on the two beam Novette laser system.
Machine aids to coding
Authors: Earl J. Isaac
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

Coding for digital computers is a process of translating from one language to another. A problem to be computed might be expressed in algebraic notation of several types or in one of several forms of logical symbolism. This notation or symbolism must be translated into the machine language. In many problems, particularly those involving iterative processing of many variables, the translation is reasonably direct and can be written out and checked with little difficulty. Some problems, however, require a great many instructions dealing with few variables and arranged in complex alternative paths. In these cases the translation process becomes formidable and the most extensive checking often fails to eliminate clerical errors.
Introduction to simulation modeling
Authors: J. William Schmidt
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

Since World War II system modeling has played an increasingly important role in the analysis of complex systems in both the private and public sectors. In the broadest sense, a model may be considered to be a representation of reality without the presence of reality itself. Hence, pictures, graphs, management games, computer programs and mathematical equations may be considered models of those systems which they represent. For the purposes of this discussion we will restrict our attention to that class of models which attempts to capture the relationship between the behavior of a measure or measures of system effectiveness and the behavior of those variables and parameters which influence the measure(s) of effectiveness and includes simulation and mathematical models. The specific focus of our attention will be on simulation models.
Functional parallelism in an operand state saving computer
Authors: J. B. Harvill
Venue: Proceedings of the fourth workshop on Computer architecture for non-numeric processing (1978)

Multiple, high-level operators are assigned to a general operand. The operators are implemented with individual micro-processors and are &ldquo;attached&rdquo; dynamically to the memory location representing the &ldquo;current&rdquo; value of the operand. The operators then asynchronously use each new operand value as it is stored and perform their operations in parallel. The proposed architecture represents a true M I S D (Multiple instruction Stream - Single Data Stream) computer. Its architecture can provide effective parallelism and reduced programming complexity for a large class of both numeric and non-numeric computer problems.
A scheduling philosophy for multi-processing systems
Authors: Butler W. Lampson
Venue: Proceedings of the first ACM symposium on Operating System Principles (1967)

One of the essential parts of any computer system is a mechanism for allocating the processors of the system among the various competitors for their services. These allocations must be performed in even the simplest system, for example, by the action of an operator at the console of the machine. In larger systems more automatic techniques are usually adopted; batching of jobs, interrupts and interval timers are the most common ones. As the use of such techniques becomes more frequent, it becomes increasingly difficult to maintain the conventional view of a computer as a system which does only one job at a time; even though it may at any given instant be executing a particular sequence of instructions, its attention is switched from one such sequence to another with such rapidity that it appears desirable to describe the system in a manner which accommodates this multiplexing more naturally. It is worthwhile to observe that these remarks apply to any large modern computer system and not just to one which attempts to service a number of on-line users simultaneously.
Directory-Assisted Abbreviated Name Entry: Telephone dialing by name
Authors: Philip A. Coates
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

A proposal for a novel, non-standard computer application which could become very widespread. The application involves a method for telephone dialing by typing in an abbreviated form of the name of the party being called rather than dialing a 7-digit telephone number. This paper (1) proposes a design for such an application, (2) describes in non-technical terms some terminal and microcomputer configurations for data entry, (3) lists 7 major advantages over numeric dialing, (4) argues for the economic feasibility of the proposal.
The optimal organization of multiprogrammed multi-level memory
Authors: S. R. Arora, A. Gallo
Venue: Proceedings of the SIGOPS workshop on System performance evaluation (1971)

This study suggests a method for performance evaluation in a multiprogramming environment. The joint effect of two major cost elements - the processing time and the memory space - have been investigated. This involves two issues; 1) optimal memory loading and sizing, and 2) central site timing analysis. The latter has been approached mathematically with a cyclic queuing model; the memory space utilization was studied with a linear optimization model. Varying the values of the major cost carrying factors, through iteration, the authors investigate marginal utilities and search for the concept of an optimally balanced system.
Statistical methods in performance evaluation
Authors: Peter J. Denning, Bruce A. Eisenstein
Venue: Proceedings of the SIGOPS workshop on System performance evaluation (1971)

This paper reviews the principles and definitions which underlie estimation theory and develops the theory for application to problems of performance evaluation and resource allocation. The statistical characterization of the estimates of a parameter is discussed with reference to the meaning and importance of biasedness, convergence criteria, and responsiveness. Several sequential estimation algorithms in the form of stochastic approximation are analyzed and a comparison is made of the ability of these algorithms to determine the value of an &ldquo;almost constant&rdquo; parameter given noisy (uncertain) measurements. A discussion of the shortcomings of the present theory as well as some open problems concludes the paper.
GPSS V model of a computerized manufacturing system
Authors: James R. Siebauer,  BSECE,  MBA
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

The role of simulation in the design of a Computerized Manufacturing System is analyzed. A case study of a particular application is given. The rationale for selecting a particular simulation language is presented. Several useful methods of representing the simulation output both in terms of actual movement of system elements and aggregate statistics are demonstrated. The validity of the results of the case study is discussed.
Aspects Of Implementing CLU
Authors: Russell R. Atkinson, Barbara H. Liskov, Robert W. Scheifler
Venue: Proceedings of the 1978 annual conference (1978)

Linguistic mechanisms used in CLU to support 1) structured exception handling, 2) iteration over abstract objects, and 3) parameterized abstractions are briefly reviewed, and methods of realizing these mechanisms are described. The mechanisms discussed support features that are likely to be included in other programming languages, and the implementation methods should be applicable to a wide range of languages.
Object boundary determination in a textured environment
Authors: Ramakant Nevatia
Venue: Proceedings of the 1975 annual conference (1975)

Detection of object boundaries is an important step in the analysis of an image. In the presence of a textured background, local edge operators generate many edges that do not correspond to the object boundaries. However, edges along the object boundaries link in elongated segments. An efficient algorithm to perform such linking is described and experimental results of a working program are presented.
The feasibility of personal computers as an only computer resource for a computer science program
Authors: Geof Goldbogen, G. H. Williams
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

This paper reports on the experiences at Union University in using a mini-computer based time-sharing facility versus a loosely-coupled micro-computer based facility. These two facilities are the only computer resources used by two disjoint academic populations. Comparisons are drawn on acquisition costs, staffing, and operating costs. The micro-computer system is an inexpensive, viable alternative.
Factors affecting the performance of distributed applications
Authors: Keith A. Lantz, William I. Nowicki, Marvin M. Theimer
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

A major reason for the rarity of distributed applications, despite the proliferation of networks, is the sensitivity of their performance to various aspects of the network environment. Contrary to much popular opinion, we demonstrate that CPU speed remains the predominant factor. With respect to network issues, we focus on two approaches to performance enhancement: (1) Improving the performance of reliable, byte-stream protocols such as TCP; (2) the use of high-level protocols that reduce the frequency and volume of communication.
APL full screen editing and error handling
Authors: Raymond C. Hooker
Venue: ACM SIGAPL APL Quote Quad (1982)

This paper describes the development theory and program dynamics of a full screen APL schedule editor. The form of our editor is similar to the full screen editor available under IBM's SPF facility under TSO. Program function keys control paging and save/no save exits, and an insert column allows the addition and deletion of schedule items. This editor is protocol intensive, and its uniqueness lies in the error processing routines which consider complex inter field relationships both within lines and between lines. This paper attempts to present an overall approach to full screen protocol intensive error handling and reviews the history of APL full screen applications with a special regard to error handling techniques.
Logic Design System
Authors: Frederick G. Linnemann, Carl E. Minich
Venue: Proceedings of the 8th Design Automation Workshop (1971)

The Logic Design System (LDS) is a set of FORTRAN Computer programs that convert Boolean equations and component descriptions into logic diagrams, parts lists, board layouts, wiring lists, and diagnostic data. This system decreases the cost of digital design work and eliminates errors that could be introduced by manual methods. More important, it reduces lead time and frees the designer for creative tasks. It does not yet perform printed circuit routing or artwork generation, although these packages are presently under design. The logic designer can use this tool without trying to describe his problem to a professional programmer. The system input is a free-form, problem oriented language that is readily learned by a designer, and is powerful enough to handle any design. The Logic Design System has been constructed to avoid built in hardware obsolesence. The designer can select parts from a library of standard components and integrated circuits, or specify tailor-made modules consisting of integrated circuit configurations that may repeat many times in the same combination to suit the individual designer's needs. The LDS is compatible with the use of both MSI/LSI logic elements.