ppxscal/embedding_network huggingface dataset:
Man-machine interaction: Computer-aided programmed techniques in support of military information systems
Authors: Sylvia R. Mayer, R. Morgan
Venue: Proceedings of the 1965 20th national conference (1965)

THIS PAPER describes research and development addressed to the problem of how to train men in the effective use of military information systems. Three questions are explored: What is the operational concept which dictates the unusual training needs in these systems? What new on-the-job training capability is required in these systems? How can this requirement be met?
An interactive pseudo-assembler for introductory computer science
Authors: Ted Sjoerdsma
Venue: ACM SIGCUE Outlook (1976)

Since 1968 the University of Iowa Computer Science Department has used a locally developed Easy Assembler SYstem (EASY) to accomplish a better comprehension of the concepts taught in the segment of the introductory computing course which dealt with internal structure and organization. In the fall of 1973 my attention focused on EASY (with all of its problems) as a likely candidate for a computerized-interactive-tutorial segment of this course. Since the consistency of use and precision in presentation were important aspects of teaching the concepts related to EASY, such an approach seemed natural.
The art of the algorithmist
Authors: Ellis Horowitz
Venue: Proceedings of the 1976 annual conference (1976)

An algorithmist is a person skilled in the art of devising, expressing, verifying, analyzing, and testing algorithms. Though a great deal has been written about the verification and analysis of algorithms, remarkably little attention has been paid to the issue of algorithm synthesis. In this paper a taxonomy of algorithms is presented. Each category is explained and example algorithms are pointed to which exhibit its characteristics.
A technique for proving lower bounds for distributed maximum-finding algorithms (Preliminary Version)
Authors: Jan K. Pachl, E. Korach, D. Rotem
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

This paper deals with the problem of finding the maximum of a distributed set of distinct integers. The problem is to be solved by a completely distributed asynchronous algorithm.
N-variable fuzzy maps with application to disjunctive decomposition of fuzzy switching functions
Authors: Gary W. Schwede
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

A graphical scheme (map) for representation and manipulation of fuzzy switching functions of N-variables is described. Properties of the map and relations between represented implicants are discussed. Emphasis is placed on illustrations of the use of the map for graphical minimization and decomposition of fuzzy switching functions.
APL thinking finding array-oriented solutions
Authors: Robert C. Metzger
Venue: ACM SIGAPL APL Quote Quad (1981)

APL is used for processing arrays. This is very different from traditional programming languages, which process single numbers and characters. This difference requires different programming methods. Such methods are array oriented. Several approaches to creating array oriented APL programs are explained here.
A system for scanning and segmenting cursively handwritten words into basic strokes
Authors: C. M. Privitera, R. Plamondon
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

This paper presents a segmentation method that partly mimics the cognitive-behavioral process used by human subjects to recover motor-temporal information from the image of a handwritten word. The approach does not exploit any thinning procedure, but rather a different typology of information is manipulated concerning the curvature of the word contour. Starting from the maximum curvature points roughly corresponding to the beginning of a stroke, the algorithm scans the word, following the natural course of the line and attempts to repeat the same movement as executed by the writer during the generation of the word. At each maximum curvature point, the line is segmented and reconstructed by a smooth interpolation of the most interior points belonging to the line just covered. At the end of the scanning process, a temporal sequence of motor strokes is obtained which plausibly composes the original intended movement.
Towards an efficient, machine-independent language for microprogramming
Authors: David A. Patterson, Karl Lew, Richard Tuck
Venue: Proceedings of the 12th annual workshop on Microprogramming (1979)

A machine independent low level language YALLL is presented. This language produces microcode for two very different machines: Hewlett Packard HP 300 and Digital Equipment Corporation VAX 11/780. The efficiency of this language is tested by comparing two examples on both machines to microassembly coded versions. To our best knowledge, this is the first time programs have been compiled and executed on two different microarchitectures. These examples also let us compare the efficiency of the microarchitectures and macroarchitectures of these machines and re-examine the benefits of microprogramming versus macroprogramming. We conclude this paper with comments upon transportability of high level microprogramming languages.
Independence results in Computer Science? (Preliminary Version)
Authors: Deborah Joseph, Paul Young
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

Although there has been considerable additional work discussing limitations of formal proof techniques for Computer Science ([YO-73 77], [HAR-76], [HAR HO-77], [HAJ-77 79], [GO-79]), these papers show only very general consequences of incompleteness: the stated results hold for all sufficiently powerful formal systems for Computer Science. Only the work of O'Donnell and of Lipton directly addresses the question of just how powerful formal axioms for Computer Science should be, and these two authors make rather radically different suggestions. We investigate this latter question: How powerful should a set of axioms be if it is to be adequate for Computer Science? In particular, in this paper we investigate the adequacy of the system of [LI-78] as a formal system for Computer Science.
Generalizations of boolean query processing
Authors: Donald H. Kraft
Venue: Proceedings of the ACM '82 conference (1982)

Substantial work has been done recently applying fuzzy subset theory to the problems of document and query representation and processing in retrieval systems. The motivation has often been to generalize Boolean query processing to allow for non-Boolean index weights or measures of importance to be attached to the individual terms in the document or in the query representation. The problems of generalizing the Boolean lattice structure have been noted. Criteria have been generated for query processing mechanisms with relevance weights in the query, but these have been shown to be inconsistent. An alternative approach using thresholds in the query has been suggested, with the generation of appropriate document evaluation criteria for Boolean query processing.
A 2.5 n-lower bound on the combinational complexity of Boolean functions
Authors: Wolfgang J. Paul
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

Consider the combinational complexity L(f) of Boolean functions over the basis &Ohgr; &equil; {f&brvbar; f:{0,1}2 &rarr; {0,1}}. A new Method for proving linear lower bounds of size 2n is presented. Combining it with methods presented in [12] and [15], we establish for a special sequence of functions fn:{0,1}n &rarr; {0,1}: 2.5n &le; L(f) &le 6n. Also a trade-off result between circuit complexity and formula size is derived.
An OIS model for internal control evaluation
Authors: Andrew D. Bailey,  Jr., James Gerlach, R. Preston McAfee, Andrew B. Whinston
Venue: ACM SIGOA Newsletter (1982)

Satisfactory accountability, that is, a control structure which protects corporate assets from theft, misuse, and fraud, is an important aspect of office information system design. The OIS design goals of flexibility, efficiency, and modularity must not preclude the accountability needs of managers, stockholders, and auditors. This will require meticulous examination of the OIS to ensure that it satisfies the multi-attribute control criteria used by auditors.
The network Unix system
Authors: Gregory L. Chesson
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

A Network Interface Program (NIP) is that part of an operating system which interfaces with similar entities in a network. Normally, the NIP is a collection of software routines which implement interprocess communication, interhost protocols, data flow controls, and other necessary executive functions. This paper discusses the organization of the NIP currently being used with the Unix operating system on the ARPA network. The Network Unix system is noteworthy because of the natural way that network and local functions are merged. As a result the network appears as a logical extension to the local system - from the point of view of both the interactive terminal and user program.
Tools For Automatic Compiler Generation (Panel Discussion)
Authors: Steven C. Johnson
Venue: Proceedings of the 1978 annual conference (1978)

As various parts of the compiling process have become better understood, it has been possible to package this understanding in tools that can be used by nonspecialists. This talk describes tools for parser generation and lexical analyzer generation which are available under the UNIX@@@@ operating system. It will also touch on some less successful attempts to package understanding of symbol table management. In addition to specific tools, the UNIX system eases many of the ancillary tasks of the compiler writer: debugging, regression testing, and constructing new versions of the compiler, to name a few. The talk will draw from practical experience in the construction of a portable compiler for the language C, which has been moved to over a dozen different machines.
A simulation model for evaluation and design of inpatient care facilities
Authors: H. Richard Howland, Richard Irvin Baldock
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

The complexity of activities and fluctuations in workload make prospective evaluation and design of inpatient care facilities difficult. This paper describes a simulation which allows the user to select a compromise between service availability and cost by comparing alternatives for different ward sizes, ancillary capacities and admission policies. Reporting includes not only occupancy and workload figures, but also statistics on over-loads and excess occupancy. The sequence of care administered to an inpatient is modeled as a Markov chain, whose states are patient level of dependency; ward workloads and ancillary usage depend on the patient's state. Different parameters in the basic model represent the sequences of care corresponding to distinct diagnosis classes; varying patient mixes can be simulated by adjusting arrival rates in the diagnosis categories. This paper focuses on the use of the simulation in comparing admission policies.
An algorithm to compact a VLSI symbolic layout with mixed constraints
Authors: Y. Z. Liao, C. K. Wong
Venue: Proceedings of the 20th Design Automation Conference (1983)

A popular algorithm to compact a VLSI symbolic layout is to use a graph algorithm similar to finding the 'longest-path' in a network. The algorithm assumes that the spacing constraints on the mask elements are of the lower-bound type. However, to enable the user to have close control over the compaction result, a desired symbolic layout system should allow the user to add either the equality or the upper-bound constraints on selected pairs of mask elements as well. This paper proposes an algorithm which uses a graph-theoretic approach to solve efficiently the compaction problem with mixed constraints.
MAPQUERY: Data base query language for retrieval of geometric data and their graphical representation
Authors: André Frank
Venue: ACM SIGGRAPH Computer Graphics (1982)

The storage of geographical data is a growing type of application within data processing. Users want to retrieve parts of the data stored and to have them shown in graphical form. They need an easy and flexible query language to select the data needed and to describe the form of representation. The existing query languages do not suit this purpose without amendments. This paper presents a proposal for adaptation and gives some examples for query formulation. Moreover, it discusses the special problems of graphical input and output.
An evaluation of the data processing program at eastern kentucky univ.
Authors: Oberita Hager
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

The purpose of this study was to explore job potential for data processing majors and to ascertain what industries in the metropolitan areas of Kentucky want, need, or expect in the way of skills and knowledges by these majors.
The design of program logic
Authors: Norman Loongsung Soong
Venue: Proceedings of the 13th Design Automation Conference (1976)

This paper contributes to the understanding of program structure in terms of stability and reliability in a quantitative sense. Distinctions are made between program structure and control structure. The characteristics of a good system will be identified qualitatively and it is apparent that all desirable characteristics concerns system stability. Stability is defined in terms of the resistence to the amplification of changes that has been made to the system. Some quantitative analysis is made to measure the quality of program structure. The techniques used here are the method of connectivity matrix and the method of random Markovian process. Program structures are defined as abstract relationships between subportions of a program, and the content of the program or its subportions is left undefined. Using these techniques, a collection of program structures is measured and ranked, and the preference of structures based on the stability criteria is shown. Two case studies, based on models of abstract structures, are presented here to show how the above techniques can be used to pick an appropriate system structure.
A survey on computer science curricula
Authors: Douglas A. Ruby
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

As in many businesses, the data processing industry largely depends on colleges and universities for the basic education of its technical and scientific personnel. Increasingly, the key to entry into this industry for the college graduate is becoming a degree in a discipline loosely defined as &ldquo;computer science&rdquo;. Since the computing industry is as broadly defined and as diverse as the various computer science majors, there has been a tendency for the industry on the whole to be only vaguely aware of what students are learning on campus. In addition, there has been a lack of communication by the industry concerning the qualities and skills it seeks in the &ldquo;computer science&rdquo; graduate. This paper, then, discusses some of the attitudes of the McDonnell Douglas Automation Company (MCAUTOtm) concerning those qualities and skills it seeks in college graduates in the computing field.
Simulation in the evaluation of an executive system design
Authors: James E. Weatherbee
Venue: Proceedings of the 1st symposium on Simulation of computer systems (1973)

A simulation model is described which simulates the executive system for the Automatically Reconfigurable Modular Multiprocessor System (ARMMS) a spaceborne computer system being designed by the Astrionics Laboratory of the Marshall Space Flight Center in Huntsville, Alabama. The model was developed to test the effect on system performance of the software logic and execution speed in the resource allocation and task dispatching subroutines of the executive. Simulation results are discussed which led to changes in the initial executive system design.
Fooling a two-way automaton or one pushdown store is better than one counter for two way machines (Preliminary Version)
Authors: Pavol Dûriš, Zvi Galil
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

We define a language L and show that is cannot be recognized by any two way deterministic counter machine. It is done by fooling any given such machine; i.e. showing that if it accepts L' @@@@ L, then L'-L @@@@ &fgr;. For this purpose, an argument stronger than the well known crossing sequence argument needs to be introduced. Since L is accepted by a two-way deterministic pushdown automaton, we consequently show that one pushdown stack is more powerful than one counter for deterministic two-way machines.
Recent study of teaching: cybernetic foundations of learning science
Authors: K. U. Smith
Venue: Proceedings of the 1965 20th national conference (1965)

APPRECIATION of the significance of computer systems for feedback analyses depends on one's understanding of the cybernetic model. Until recently, feedback control in the living system has been assumed generally to conform to the negative-feedback servo-system model for control of minimal error. We conceptualize the cybernetic model as encompassing both positive- and negative-feedback regulation and many different modes of maximal-error, variable-error, constant-error, differentiated-error, and integrated-error control. Further, we see the living body not as a single-channel system, but as a multichannel response mechanism which can generate sensory input independently of external stimulation and also can match, modulate, compare, order, integrate, differentiate, block, and vary sources of external stimulation. Our theory is that the nature of performance and the course of learning are determined directly by the variable feedback effects of these different modes and dimensions of cybernetic control9, 13.
A production PCB layout system on a minicomputer
Authors: K. Bedard, S. Fournier, B. Shastry, U. Stockburger
Venue: Proceedings of the 14th Design Automation Conference (1977)

This paper presents a PCB layout system developed within Bell-Northern Research. The system is implemented on a PDP-11/70 minicomputer and it has been in production use since July 1976. The system consists of several modules for carrying out various steps involved in the PCB layout process such as, data input, assigning the gates to packs, placement of components on the PCB and routing the interconnections. The system also consists of a set of post-processors which modify the PCB data suitable for manufacturing.
A tool to support design automation in batch manufacturing
Authors: Gregory L. Smith, Sharon A. Stephens, Leonard L. Tripp, Wayne L. Warren
Venue: Proceedings of the 17th Design Automation Conference (1980)

The development of integrated computer-aided manufacturing systems demands that the generic functions and common information be identified and classified. This paper presents an automated approach for modeling the functional aspect of an integrated manufacturing system. The approach is called IDEF0 and is being used by the Air Force ICAM program for all system development. The rationale, design approach and implementation of the automated tool AUTOIDEF0, which supports the use of IDEF0, is presented.
A quantitative evaluation of the effectiveness of quality assurance as experienced on a large-scale software development effort
Authors: Peter Chase Belford, Carlo Broglio
Venue: ACM SIGSOFT Software Engineering Notes (1978)

The purpose of quality assurance on software projects is to achieve high quality products on schedule, within cost, and in compliance with contract requirements. However, historically, the effectiveness of these activities on software projects has not been quantitatively demonstrable because of a lack of data collected on the project combined with a lack of insight into the operational reliability of the system. Quality assurance is a collection of activities on a contractual deliverable whose purpose is to impart a degree of confidence that the deliverable will conform to the customer's concept of what was procured. Under these conditions, quality assurance must be performed with respect to a documented baseline of the concept. This baseline can address the need in the form of requirement statements; the conceptual approach to be followed in the form of a functional specification; or the design to be implemented in the form of a design specification. Further, these baselines are hierarchical in the sense that when quality assurance is applied to a level it is implicitly applied to all lower levels; e.g., if the need is to be satisfied, the conceptual approach must be satisfied. Effective quality assurance programs impart a high degree of confidence to the customer without significant impacts on schedule or cost. Historically, this effectiveness has not been quantitatively demonstrable because of a lack of data collected on the project combined with a lack of insight into the operational reliability of the system.
Image Analysis for Video Surveillance Based on Spatial Regularization of a Statistical Model-Based Change Detection
Authors: Francesco Ziliani, Andrea Cavallaro
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Advanced video surveillance applications require two successive steps: image analysis and content understanding. The first step analyses and extracts the characteristics of the video sequence. It defines the regions or the objects of interest according to their spatial/temporal properties. This analysis results in a segmentation of the video sequence. This is interpreted by the content understanding step according to the specific scenario and surveillance requirements.This paper addresses the image analysis problem for a video surveillance system. We use a statistical model-based change detection technique that defines the areas of interest in the image. Each area is analyzed separately by integrating spatial and temporal descriptors in a multi-feature clustering algorithm. The selective procedure we propose minimizes the computational load and significantly improves the results provided by the change detection technique.We test this method on both indoor and outdoor surveillance sequences. All the results show a correct segmentation of the scene. Moreover each object defined in the segmentation is described in terms of its spatial and temporal properties. These results can represent a valid input for a later content understanding procedure in several surveillance scenarios.
An Interactive Graphics System for custom design
Authors: P. Carmody, A. Barone, J. Morrell, A. Weiner, J. Hennessy
Venue: Proceedings of the 17th Design Automation Conference (1980)

The Interactive Graphics System/370 (IGS/370) is one of a series of highly interactive programs 1,2 used extensively within IBM for the design of multiplanar chips, macros, modules, cards, and boards. The programs were developed for IBM's internal use and are not marketed by IBM. This paper describes the hardware and system software environment and the design functions, capacity and performance of IGS/370. The geometric descriptions and associated attributes defining the LSI devices are entered by a beam-directed refresh cathode ray tube, a digitizer, or a graphics interface language. Many capabilities exist for the creation and modification of all phases of design. Data library items called cells, consisting of rectangles, lines, polygons, circles, alphanumerics, attributes and references to other cells, are created, edited and manipulated into a final design. These final designs, output in the graphics interface language, then become source data for the checking and post-processing programs which result in the manufactured product.