ppxscal/embedding_network huggingface dataset:
A Segmentation-Free Recognition of Two Touching Numerals Using Neural Network
Authors: Soon-Man Choi, Il-Seok Oh
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

The recognition of two touching numerals has been tackled by many researchers with the purpose of recognizing the terminal fields in many document forms. The conventional methods are based on the process with two sequential stages, i.e., segmentation of touching numerals and recognition of the individual numerals. Due to an unlimited number of different overlapping and touching types, the segmentation-based approach has always revealed a limitation in success rates.In this paper, we propose a new segmentation-free method using neural network. In this approach, two touching numerals are regarded as a single pattern coming from a pattern source with 100 classes. To obtain a training set for the neural network classifier, we synthesize the patterns by moving two isolated numerals in the NIST database horizontally until they touch. For the test set, we manually extract two touching numerals from the numeral string dataset of NIST database. By using a modular neural network classifier, a promising result has been obtained.
Combining proximity criteria with nature-of-the-spot criteria in architectural and urban design space planning problems using a computer-aided space allocation technique: A proposed technique and an example of its application
Authors: Donald P. Grant
Venue: Proceedings of the 9th Design Automation Workshop (1972)

Computer-aided space allocation or space planning techniques have been an active research area in the development of automated design assistance techniques. Miller (1971), in his thorough survey of and bibliography for this area, suggested that while the future of geometric space planning would undoubtedly lie in the direction of highly sophisticated, interactive graphic systems for use by the designer, there is an interim need for immediately applicable techniques for use by the design professions. The interim application of simple and comprehensible approaches to design automation may even be a necessary prerequisite to the acceptance by designers of the more sophisticated techniques that will emerge in the future.
A hierarchical structuring method for functional software systems
Authors: Kokichi Futatsugi, Koji Okada
Venue: Proceedings of the 6th international conference on Software engineering (1982)

A hierarchical structuring method for functional software systems is described. This method is greatly influenced by the authors experiences in developing the experimental HIerarchical Software Processor (HISP) during the last four years. In this paper, however, the method is described in a general setting. This method appears to be applicable to a broad class of functional software systems. We first describe the words &ldquo;functional&rdquo; and &ldquo;hierarchical&rdquo;. Then the hierarchical structuring method is presented. Some applications of this method are also discussed. In particular, an example of transformational programming based on this structuring method is presented. The truncated syntax diagrams of the HISP language are also given as an appendix.
Algorithms for the design and analysis of woven textiles
Authors: J. A. Hoskins, W. D. Hoskins
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

The design and analysis of woven textile structures requires the precise manipulation of large amounts of numerical data, the majority of which is binary. As such, algorithms to perform these designs and analytical tests are ideally suited for machine implementation. The use of a microcomputer as a vehicle for the implementation of these algorithms greatly simplifies the user interface with such a system as well as increasing the general availability of the system. This paper will discuss some of the critical algorithms employed in the creation and analysis of woven textiles structures and will describe a novel microcomputer implementation of these algorithms.
A new general triangulation method for planar contours
Authors: S. Ganapathy, T. G. Dennehy
Venue: Proceedings of the 9th annual conference on Computer graphics and interactive techniques (1982)

The problem of approximating the surface spanning a given set of 3D points as a polyhedron of triangular faces (&ldquo;triangulation&rdquo;) is a significant one, and has many applications in the fields of computer graphics and computer vision. In this paper, several solutions to this problem are reviewed. These solutions can be grouped into two classes, and particular emphasis is given to the class of surfaces spanned by parallel planar contours. For a contour pair P0,P1,...Pm&minus;1 and Q0,Q1,...Qn&minus;1, a graph theoretic approach can be used to arrive at a class of solutions, each requiring exactly m+n steps to triangulate the pair. Existing methods (both rigorous and heuristic) for extracting a particular solution from this group are reviewed, and a new heuristic based on inter-contour coherence is proposed. This heuristic is being used in the field of Ultrasonic Non-destructive Evaluation to produce images of flaws in pressure vessels, and its performance is shown to compare favorably with methods of greater computational complexity. It is believed that this heuristic can also be used with success in industrial vision systems where similar contours are obtained using a laser range finder.
Image Processing for Restoration of Old Film Sequences
Authors: Takahiro Saito, Takashi Komatsu, Tomohisa Hoshi, Toshiaki Ohuchi
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

The old film restoration involves the development of image processing technology. We focus on the correction of film misalignment and the removal of blotches. In the restoration, the film is first read with a scanner, but the scanned sequence often suffers from irregular spatial vibration due to inaccurate frame alignment. This artifact is perceived as a flicker. Reduction of this flicker needs accurate knowledge of relative locations of scanned frames. Global inter-frame deformation contains such information. However, inter-frame deformation is also caused by camera work. Hence, we develop a robust correction method for estimating inter-frame misalignment separately from camera work and compensating for it. After the correction of inter-frame misalignment and the separation of camera work, the blotch removal can be performed by a filtering method. We present a spatiotemporal nonlinear restoration filter whose response is controlled according to the local anisotropic brightness continuity of a corrupted sequence.
An extended Algol-60 for Shaded Computer Graphics
Authors: Ben Jones
Venue: ACM SIGGRAPH Computer Graphics (1976)

This report describes a high level programming language implemented for the Shaded Graphic System at Case Western Reserve University. It consists of a complete implementation, for the PDP-11, of Algol-60 with the addition of string variables, I/O facilities, and extensions for handling shaded graphic images. The primary purpose of this work was to facilitate the use of a custom-built system which can produce shaded perspective images in real-time.
Computer applications in a cable television environment
Authors: Howard Buckholtz, Eileen Buckholtz
Venue: Proceedings of the ACM annual conference (1973)

The intention of this paper is to survey the field of cable television and computer applications.
Rational vs. empirical approaches to job/task descriptions for COBOL programmers
Authors: Felix F. Kopstein
Venue: Proceedings of the seventh annual conference on SIGCPR (1969)

Perhaps the intent of this paper will stand out more clearly as figure when viewed against the background or context in which it first arose. While not directly relevant, the context is the development of a computer-administered instruction (CAI) course designed to produce competent COBOL programmers for the U.S. Army. To produce competent COBOL programmers one must specify what constitutes on-the-job competence and this concern led to the considerations to be set forth. Let it be noted clearly at the outset that these considerations obviously transcend COBOL as subject matter and training development as goal. Both are used here merely to provide a continuing illustrative framework. Because the primary concern here is with technique in the sense of practical (not formal) methodology, only simulated empirical data will be presented.
Functions in APL to assist the programming and servicing of CAI-Lessons
Authors: Georg R. Lampl, Isolde Schell-Haungs
Venue: Proceedings of the eighth international conference on APL (1976)

While APL was not designed expressly for CAI, it is a general purpose language which offers favorable preconditions (tools) for use in developing and servicing CAI lessons. Our own experience with the author languages PLANIT and COURSEWRITER III has proven, that these languages are advantageous as long as we have to deal with special problems. On the whole, however, they are less efficient than the assembly language in which they have been written.
On the effect of different counting rules for control flow operators on Software Science metrics in Fortran
Authors: S. D. Conte, V. Y. Shen, K. Dickey
Venue: ACM SIGMETRICS Performance Evaluation Review (1982)

Halstead in his Theory of Software Science, proposed that in the Fortran language, each occurrence of a GOTO i for different label i's be counted as a unique operator. Several writers have questioned the wisdom of this method of counting GOTO's. In this paper, we investigate the effect of counting GOTO's as several occurrences of a single unique operator on various software science metrics. Some 412 modules from the International Mathematical and Statistical Libraries (IMSL) are used as the data base for this study.
Interaction with a color computer graphics system for archaeological sites
Authors: Norman I. Badler
Venue: ACM SIGGRAPH Computer Graphics (1978)

Our goal was to design and implement an interactive system using a color video display to assist an archaeologist in the task of analyzing the spatial distribution of various objects from an excavated site. The existing system configuration required controlling the display over a slow communications line from the mainframe CPU, and there was little local intelligence in the minicomputer display driver. The user of the system was expected to be computer-naive. Certain design principals evolved which should be applicable to graphical database query systems in other domains.
Reification: Reflection without metaphysics
Authors: Daniel P. Friedman, Mitchell Wand
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

We consider how the data structures of an interpreter may be made available to the program it is running, and how the program may alter its interpreter's structures. We refer to these processes as reification and reflection. We show how these processes may be considered as an extension of the fexpr concept in which not only the form and the environment, but also the continuation, are made available to the body of the procedure. We show how such a construct can be used to effectively add an unlimited variety of &ldquo;special forms&rdquo; to a very small base language. We consider some trade-offs in how interpreter objects are reified. Our version of this construct is similar to one in 3-Lisp [Smith 82, 84], but is independent of the rest of 3-Lisp. In particular, it does not rely on the notion of a tower of interpreters.
Developing computer awareness
Authors: Lawrence J. Mazlack
Venue: ACM SIGCSE Bulletin (1977)

There are three different approaches to an introductory computer science course: technical competance, non-technical awareness, and a mixture of technical competance and non-technical awareness. This paper discusses the best strategy for a course aimed at students who will not need a high level of technical competance once they leave the course. A course which develops a computer awareness through a mixture of technical programming instruction and a discussion of computer applications and power for good or evil. Films are extensively used.
Simulation of natural scenes using textured quadric surfaces
Authors: Geoffrey Y. Gardner
Venue: ACM SIGGRAPH Computer Graphics (1984)

Because of the high complexity of the real world, realistic simulation of natural scenes is very costly in computation. The topographical subtlety of common natural features such as trees and clouds remains a stumbling block to cost-effective computer modeling. A new scene model, composed of quadric surfaces bounded with planes and overlaid with texturing, provides an efficient and effective means of representing a wide range, of natural features. The new model provides a compact and functional data base which minimizes the number of scene elements. Efficient hidden surface algorithms for quadric surfaces bounded by planes are included. A mathematical texturing function represents natural surface detail in a statistical manner. Techniques have been developed to simulate natural scenes with the artistic efficiency of an impressionist painter.
External customers enhance university services
Authors: Patrick J. Gossman
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

The Computing Services Center (CSC) of Wayne State University began to actively seek business from local government, health care, other educational institutions, and research facilities in 1977. The addition of external customers acted as a catalyst, affecting CSC policies and procedures, hardware and software, marketing strategy, and most importantly, attitudes toward customers and ourselves. External customers forced us to examine our service organization from a new perspective, and as a result, helped us find new ways to improve the service we provide to our own University community.
Calculating the block preconditioner on parallel multivector processors
Authors: J. C. Diaz
Venue: Proceedings of the 1986 workshop on Applied computing (1986)

A parallel algorithm for the preconditioning of nonsymmetric sparse linear systems generated by various discretizations of highly coupled partial differential equations in two spatial dimensions, is discussed. Gathering of the highly coupled unknowns, for improved accuracy, induces a natural block structure in the linear system. The preconditioning scheme consists of the block incomplete LU decomposition. The scheme exploits the natural block structure. The scheme is amenable of vectorization within the blocks and parallelism over the grid. Hence, the algorithm is well suited for parallel multivector architectures. The parallel implementation uses SCHEDULE a portable package for parallel processing development. Implementations on the Alliant FX/8 and the CRAY-2 are discussed.
An exchange method for solving Haar or non-Haar overdetermined linear equations in the sense of Chebyshev
Authors: C. S. Duris
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The problem under consideration here is to solve the system of linear equations Ax&equil;b in the sense of Chebyshev. The matrix A is m&times;n with rank n and n+1&le; m. Define
Computer system modelling: A test bed for new software technologies
Authors: Ronald R. Willis>
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

This paper discusses a technique in computer system simulation that uses models as effective tools for the study of new software technologies. This model development technique, called representative modelling, and its relationship with real-time program development are surveyed. The significant correlation between these two development processes in addition to reduced costs substantiate the effectiveness of using simulation models for the evaluation of new techniques in software development. An experiment to verify this hypothesis was conducted in which a model was developed using the methods of Top Down Development. This experiment not only indicated that models could be effective development analysis tools, but that computer system simulation is a natural environment for the use of these new software technologies.
Auditing for secure statistical databases
Authors: Francis Chin, Gultekin Ozsoyoglu
Venue: Proceedings of the ACM '81 conference (1981)

A statistical database (SDB) is an ordinary database that returns statistical information to user queries. The security problem for the SDB is to control the use of the SDB so that only statistical information is available and no sequence of queries is sufficient to infer protected information about any individual. When such information is obtained, the SDB is said to be compromised. Many researchers have studied different protection mechanisms to prevent an SDB from being compromised. However, most of these mechanisms are either ineffective or inefficient or are only applicable to large SDBs. Auditing in SDBs is initially proposed in the form of investigating log trails manually. In this paper, we present a practical technique for managing the past history of user's queries, discuss how the sequence of all the answered queries of the SDB can be reduced and stored in finite storage, and describe how this storage scheme can provide an effective way of checking compromise. We believe that this will help us to develop a more practical and efficient tool for protection in a small SDB than the previously known mechanisms. We also extend the idea to batched queries and a more general environment for better protection and performance. We also state that the problem of maximizing the amount of information to the users without compromising the SDB is NP-complete.
Vector extensions to LRLTRAN
Authors: R. G. Zwakenberg
Venue: ACM SIGPLAN Notices (1975)

The CDC STAR-100 brings a new concept in computing to LLL. The STAR is a string(vector) - oriented machine that is most efficient when it performs the same operations on sequentially stored operands. This approach to computer design opens up new areas of problem-solving techniques. Some algorithms that are long and cumbersome on other machines can be easily and efficiently programmed on the STAR computer. The vector extensions described in this paper represent an attempt to expand LRLTRAN (a dialect of FORTRAN) into a useful computer language for the STAR. The additions will enable an LRLTRAN-language compiler to produce vector code and hence allow the programmer to access, via LRLTRAN, the powerful STAR hardware instructions.
A program testing system
Authors: Lori A. Clarke
Venue: Proceedings of the 1976 annual conference (1976)

A system that aids in testing programs is described. This system symbolically executes program paths and creates symbolic representations of the output variables that aid in verifying a path's computations. The conditional statements that affect the flow of control are also symbolically represented by a set of inequalities. The inequalities are then evaluated to determine input data that would cause execution of the path. The system also does extensive error checking by simulating possible data dependent errors and then attempting to detect data sets that would cause execution errors.
Design integrity and immunity checking: A new look at layout verification and design rule checking
Authors: Edward J. McGrath, Telle Whitney
Venue: Proceedings of the 17th Design Automation Conference (1980)

A program implementing a novel approach to layout verification is presented. The approach uses topological and device information to eliminate most false and unchecked errors. This technique, coupled with a hierarchical front end to eliminated redundant checks, is appropriate for layout verification of VLSI designs. Design rules appropriate for this technique, some usage rules in the context of structured design, and a discussion of the future of design rule checking are also presented.
RIPO: An automated prototyping tool based on nested arrays
Authors: Laurle J. Hendres
Venue: Proceedings of the international conference on APL (1984)

In this paper we describe an automated database prototyping tool that is based on a relational style data model and nested arrays. The tool is described in terms of of its input, a set of rosters (relations), and its output, a database prototype. The design and implementation of the tool is discussed relative to nested arrays and the nested array language, Nial.
Evaluating the &ldquo;friendliness&rdquo; of a timesharing system
Authors: Lorraine Borman, Rosemary Karr
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 decade of the Sixties served to introduce most university campuses to the computer; the Seventies brought the computer, via a terminal, into every facet of university life. Computing in the Eighties will cause every university and college to evaluate and reconsider its exploitation of modern computing equipment for education and research.For example, at Northwestern University, it was recognized that continued growth in timesharing would be a major factor in computing at NU in the 1980s and that this growth would come from a large community of new users and of casual users. In January 1980, the Computing Center began a long-range planning study. A five-year equipment enhancement and replacement plan was to be developed which was intended to reverse an unsatisfactory trend toward computer saturation, to further improve and modernize our computer offerings, and to ensure that NU remained on a path of excellence in computing. Since time-sharing had already increased to over 50% of the total usage of the computer, a decision was made to begin the evaluation of modern timesharing systems, with special emphasis in two areas: 1) efficiency and reliability, and 2) the user interface.This paper describes the processes which were developed and used for the evaluation of the user interface, or as it came to be known, the "friendliness" study [1].
The operations control center multi-computer operating system
Authors: John A. Gosden
Venue: Proceedings of the 1964 19th ACM national conference (1964)

An OPCON computer system is a facility required to support the strategic requirements of a command to maintain, update, compute, and retrieve data on a demand basis. This is effectively an on-line data handling system. The basic design principles of an Operations Control Center computer system require certain capabilities of performance, reliability, response, and capacity. A discussion of the equipment complex provided to meet these requirements is given in reference 1. This facility is a multi-computer configuration of some 3 to 12 computers of two different types, linked to some 25 to 100 peripheral devices via a special sub-system switch as shown schematically in Figure 1. A computer in this context is a conventional digital computer without its peripheral devices and their particular controllers. It includes processor, core storage, and input-output channels. In order for such a large complex of equipment to work together efficiently, it is necessary to provide special hardware facilities and special programs. In particular, one of several of the computers may be manually switched to become a control computer. This computer has direct control over the Subsystem switch and can connect any set of peripheral devices to a selected channel of any computer. In effect, the complete system can be decomposed into a number of separate subsystems, each being a computer with its input-output channels switched to a chosen set of peripheral devices. There is no time-sharing in the system. Everything is space-shared. Each central processor at one time has its own permanent core store, its own permanent input-output channels, and its own temporary set of peripheral devices.