ppxscal/embedding_network huggingface dataset:
Character detection based on multi-scale measurement
Authors: H. Hontani, S. Shimotsuji
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

The paper presents a new method for character string extraction that works efficiently even for a complicated geographical map. The concept of multi-scale measurement is introduced to achieve development of an efficient string detection technique. In this paper, scale means the size of the area where character candidates may exist. The proposed method first merges small black regions within a certain area into a mass. When the size of the area changes, the mass will change. The proposed method observes the change of a mass corresponding to the change of the size of the area, and searches for a stable mass as a character string. Multi-scale measurement enables the detection process to find the adequate size of an area to detect a string. Because a stable mass may include small figures, a test of the shape of a detected mass and a character recognition process follow to judge whether a mass forms a character string. If a mass is rejected, it is split into smaller masses according to the results of multi-scale measurement. These judgment and split processes are repeated to detect character strings from a pattern where several strings are written closely.
An interactive graphic and process controlled system for composing and sampling loom constrained designs
Authors: Nitta P. Dooner, Pat Velderman, Janice R. Lourie
Venue: Proceedings of the 10th Design Automation Workshop (1973)

The traditional method of designing textiles is a procedure of filling-in patterns of squares on graph paper to achieve (1) a representation of the finished fabric as well as (for the major classification of looms) (2) a specification of how to set up the loom and (3) how to control its moving parts. For large designs, the traditional method of painting the graph paper is time consuming. An analysis of the loom shows that an enormous design potential exists that remains unactualized. Therefore, a system to permit designers to explore vast numbers of new designs, guided by their own aesthetic judgement, has been developed. This system called LILLY is an implementation of the technique described in reference 1. In addition to the display of the weaves on a CRT, the system permits the sampling of the design on a loom in real time.
Toward an effective software reliability evaluation
Authors: Isao Miyamoto
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

Effective software reliability evaluation requires theories of software reliability which define and deal with software reliability quantitatively, technologies for reliability data measurement and data analysis, techniques to estimate or predict software reliability, and practical reliability evaluation methodologies which effectively reflect the characteristics of software. This paper assesses the extents to which these requirements are currently met, and introduces improved approaches for an effective software reliability evaluation. Introduced are the methodologies for software reliability evaluation and the software reliability evaluation-aid tools.
The analyst's game
Authors: Gregorio Diáz
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

My first reaction when reading the announcement of this conference was to ask myself &ldquo;which systems analyst are we talking about?&rdquo; I assumed that since the conference was sponsored by ACM, the analyst of interest must be involved with computers. That does not mean that the role of the analyst is clear. Before I go any further, let me sketch the systems analyst I want to talk about. He or she works with a client (e.g., an individual or organization), who seems to have a problem requiring a computerized system for a solution. The analyst gets information from the client rather than from someone else. In this sense the analyst is very much like practitioners in the medical and law professions who work for the public rather than for colleagues.
An analysis by arithmetical methods of a calculating network with feedback
Authors: L. C. Robbins
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

At the Wayne University meeting of this Association in the spring of 1951, George W. Patterson presented a paper on Reversing Digit Number Systems. Although these systems can be stated with respect to any base, we will be concerned only with the special case of base 2. The reversing representation for base 2 is also called the Gray code, symmetric binary code, and the reflected binary code. It any n, in going from n to n+1 in the reversing system, one and only one digit is changed. But this is not so for the normal (base 2) representation. Secondly, the changed digit differs in absolute value from the original by only one unit. This is automatically satisfied when the base is 2, but is an additional condition to be imposed when the base is greater than 2.
A complete axiomatization for a large class of dependencies in relational datatbases
Authors: Fereidoon Sadri, Jeffrey D. Ullman
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

Relational database theory has discovered complete axiomatizations for functional and multivalued dependencies. However, a database design system that makes use of dependencies declared by the user must deal with some more general kinds of dependencies than these&mdash; at least with embedded multivalued dependencies. Yet no axiomatization for embedded multivalued dependencies is known. In this paper, we define a more general class of dependencies, called &ldquo;template dependencies&rdquo; and give a complete axiomatization for these. We then discuss the interaction between functional dependencies and template dependencies.
A technique for integrating simulation and system design
Authors: John Sanguinetti
Venue: Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems (1979)

A technique for simulating incomplete systems is given which allows performance prediction during system design. This technique, called integrated simulation, allows the system design to itself be a simulation model, thus avoiding the overhead of maintaining a separate, valid simulation model for the system. The paper presents integrated simulation in the framework of a system modeling language called the Program Process Modeling Language, PPML. This language provides a means for describing systems of concurrent processes in both abstract and explicit terms, thus lending itself well to a top-down design method. In the design process, any PPML representation of the system can be simulated directly, from the most abstract design to the completely elaborated system. Simulation of the completely elaborated system is, in fact, simply the system in execution. The paper defines PPML and describes the techniques required to simulate PPML systems given various underlying machines. It concludes with a discussion of the limitations of the integrated simulation method.
Advanced placement in computer science: A summer workshop
Authors: James R. Comer, Kurt A. Schember
Venue: ACM SIGCSE Bulletin (1984)

A discussion of an in-service course designed to give high school teachers the background needed to teach an Advanced Placement course in Computer Science is presented. The discussion outlines the decisions made regarding equipment and other facilities, support personnel, and textbooks. Course outlines are presented, along with an evaluation of the course.
A graphical model of procedures for an automated manager's assistant
Authors: Michael Bauer, Sylvia Osborn
Venue: Proceedings of the ACM '82 conference (1982)

A model of office procedures based upon directed graphs is introduced. This model is being used as a basis for work on an office assistant which integrates office procedures performed by individuals and by the assistant. It also provides a framework for an interface to an on-line database system. This paper introduces the basic features of the model, including a set of primitive actions which determine the semantics for the office procedures within the model.
Modeling and simulating data flow computations at machine language level
Authors: Stone H. Yu, Tadao Murata
Venue: Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems (1979)

This paper is concerned with the data flow organization of computers and programs, which exhibits a good deal of inherent concurrencies in a computation by imposing no superfluous precedence constraints. In view of the popularity of parallel and distributed processing, this organization can be expected to play an increasingly prominent role in the design and development of computer systems. A schematic diagram called DF-graphs, suitable for modeling data flow computations at the machine language level, is introduced. To facilitate the storage of DF-graphs in computers, matrix equations which fully describe their structure and their dynamic behaviors are developed as an alternate representation. Also demonstrated is the feasibility of simulating the execution of computations specified by DF-graphs on a network of conventional mini- and microprocessors.
Direct Execution In A High-Level Computer Architecture
Authors: Yaohan Chu
Venue: Proceedings of the 1978 annual conference (1978)

A high-level computer architecture is one where its structure reflects the constructs of high-level programming languages. This paper describes the structure of a high-level computer architecture, which makes use of the basic concepts of control flow and data flow of programming languages. In this structure, there are the lexical, control and data processors to handle the lexical, control and data elements, respectively. Each processor is associated with an associative memory, and the associative memories are used not for storing data or program but for storing structural information about the data and program. Direct execution of this high-level architecture is described and then illustrated by a token-by-token description of the direct-execution of a sample program.
Partitioned list techniques for the synthesis by computer of two-level and-or networks
Authors: Eugenio Morreale
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

In recent years much effort has been expended and many solutions have been proposed for realizing the goal of automatic1,2,3 or semi-automatic4,5 or computer-aided6,7 design of digital systems. However, in any possible solution for the above problems, the final step in designing the system in project is the synthesis of the sequential and combinatorial networks resulting from the previous steps of the design process. For the purpose of fully or semi-automatic design of digital systems, it is mandatory that the synthesis procedures be able to handle even very large problems, the one hand, and on the other be sufficiently rapid make possible the many trials that are frequently requested for analyzing a number of possible alternative solutions.
A minicomputerized automatic layout system for two-layer printed wiring boards
Authors: Ikuo Nishioka, Takuji Kurimoto, Hisao Nishida
Venue: Proceedings of the 14th Design Automation Conference (1977)

The requirement for high density packaging is dominant in the design of electronic systems. In the assembly of such systems multi-layer printed wiring boards are often used to provide the necessary connections among functional modules, and as the wiring density for a board ascends, an automatic scheme to realize 100 percent wiring would be more essential to reduce cost and time incurred in laying out wire pattern. Thus, methods to improve the layout of printed wiring boards are still continually under investigation. The present paper proposes an automatic layout system for two-layer printed wiring boards, which operates on a PDP 11/40 computer with 24K 16-bit words of core memory and with 1.2M words of disk storage, coupled with a TEKTRONIX 4014 display terminal in conjunction with a 4953 graphics tablet. This system has been at work, and more than 300 wiring boards of manufacturing use have been already processed automatically by this system, almost all with 100 percent routing realized. A part of such implemented results are also shown.
First generation software engineering system: The Ballistic Missile Defense Software Development System
Authors: C. R. Vick
Venue: Proceedings of the 1977 annual conference (1977)

The Ballistic Missile Defense &ldquo;Software Development System&rdquo; treats a total software development cycle from requirements to operational code with verification and validation at each intermediate stage,Figure 1 Numerous papers and reports have been written on the &ldquo;System,&rdquo; and in various forms it has found utility in several government agencies, private industry, and universities. Interested parties will find an overwhelming amount of documentation through the above two references; therefore, it is not my intent to describe the system or its attributes in this paper. However, it could be of interest as to why an agency whose mission is to develop technology to defend against hostile missile attacks has been and continues to be vitally interested in Software Engineering and how the research issues surfaced over the several years devoted to the effort.
Large-scale software development with the Ada Language System
Authors: Richard M. Thall
Venue: Proceedings of the 1983 computer science conference (1983)

This paper identifies three major characteristics of large-scale computer programming projects. The design features of the Ada Language System which facilitate large-scale efforts are then described in terms of these characteristics. The Ada Language System is a programming support environment for the Ada Language.
AMOVIP: Advanced Modeling of Visual Information Processing
Authors: M. Keil, G. Cristóbal, H. du Buf, B. Escalante, L. Pessoa
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

The AMOVIP 1 project is a joint initiative for a cooperation in specific aspects of vision research and their applications, involving EU partners in Spain and Portugal together with developing countries Mexico and Brazil in Latin America. Models of visual perception concern primarily the local brightness as perceived at different spatial luminance patterns.The main aim of this project is to develop a 2D brightness model that is able to predict most if not all known brightness effects, such as illusions, and to apply this in practical applications for improving medical diagnosis, feature detection in remote sensing, as well as image coding.
Resource &equil; abstract data type + synchronization - A methodology for message oriented programming -
Authors: P. R.F. Cunha, T. S.E. Maibaum
Venue: Proceedings of the 5th international conference on Software engineering (1981)

We present in this paper a methodology for the development (and analysis) of programs designed specifically for distributed environments where synchronization is achieved through message passing. The methodology is based on techniques and concepts which have been found to be useful for the development of sequential programs&mdash;namely, stepwise refinement and abstract data types. The methodology is based on the concept of resource, generalizing the concepts of monitors, managers, proprietors, etc. We put forward the proposition that a resource is an abstract data type together with mechanisms for synchronization: firstly, for the operations of the type with each other (to gain parallelism) and, secondly, to enable the user environment to perform operation invocation. A methodology is then presented for the design of resources and their implementation.
Pushdown automata, graphs, ends, second-order logic, and reachability problems
Authors: David E. Muller, Paul E. Schupp
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

We have discovered a very strong connection between certain areas of theoretical computer science&mdash;the theory of context-free languages and pushdown automata, tiling problems, cellular automata, and vector addition systems&mdash;and certain concepts from group theory, topology, and second-order logic. We use these concepts to investigate a rather wide class of graphs which we call context-free graphs. Using the results obtained and Rabin's theorem that the monadic second-order theory of the infinite binary tree is decidable, we are able to show that the monadic second-order theory of any context-free graph is decidable. Cellular automata and vector addition systems are usually considered as involving the grid of integer lattice points in n-dimensional space. We show that such systems make sense on a very general class of graphs and, in contrast to the classical case, all the relevant algorithmic problems concerning such systems are solvable on context-free graphs.
Two nonlinear lower bounds
Authors: Pavol Dûriš, Wolfgang Paul, Zvi Galil, Ruediger Reischuk
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

We prove the following lower bounds for on line computation. 1) Simulating two tape nondeterministic machines by one tape machines requires &Ohgr;(n log log n) time. 2) Simulating k tape (deterministic) machines by machines with k pushdown stores requires &Ohgr;(n log1/(k+1)n) time.
Referential communication in AUTONOTE, a personal information retrieval system
Authors: William E. Linn,  Jr., Walter Reitman
Venue: Proceedings of the 1971 26th annual conference (1971)

This paper is concerned with the mechanisms of human intelligence and natural language communication, and with the design of an interactive computer program that incorporates and utilizes analogous mechanisms to improve man-machine communication. AUTONOTE2 is an improved personal information retrieval system. It includes, in addition to AUTONOTE (a presently running system), (1) mechanisms allowing the user to employ certain kinds of noun phrases to describe the items he wishes to store and retrieve; and (2) mechanisms enabling the system to maintain a map of what the user is referring to. Though extremely limited by comparison with the analogous human capabilities, these mechanisms add significantly to the descriptive power available to the user, and to the ease and efficiency of communication with the system. Furthermore, because AUTONOTE is a file oriented system, these additions add little to the present low cost of using the system. AUTONOTE2 also suggests new directions for software development for man-machine interaction, and it provides a practical testing ground for ideas about intelligence derived from observation of natural intelligence.
Interactive modeling and simulation of transaction flow or network models using the ADA simulation support environment
Authors: Heimo H. Adelsberger
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

The Ada Simulation Support Environment (ASSE) is a software system, with the purpose to support the development and maintenance of simulation models written in Ada throughout their life cycle. We describe here the transaction flow or network part of the ASSE, which allows to build models like in GPSS or SLAM. Our view of such models is slightly different from that of the above mentioned languages, which is demonstrated in detail by the server/resource process. The design stresses modular top-down development using submodels. Models can be developed and tested interactively.
Use of both optimization and simulation models to analyze complex systems
Authors: Dean H. Kropp, Robert C. Carlson, James V. Jucker
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

Recent work dealing with planning of complex facilities has proposed use of a recursive optimization-simulation approach. This technique takes advantage of the best features of both methods while minimizing the disadvantages of each method used alone. Here a mixed integer program generates staffing and facility plans and a simulation model evaluates their day-to-day acceptability. Then a linear regression uses the simulation results to generate non-cost constraints to be added to the optimization model. Results from a hypothetical health care setting demonstrate the value of the recursive method.
Flight recorders and aircraft safety
Authors: Carol A. Roberts
Venue: Proceedings of the 1976 annual conference (1976)

This paper discusses flight recorders, particularly the digital flight data recorder. It includes an illustration of how this device provided data to National Transportation Safety Board investigators which, for the first time, proved that wind shear was a primary factor in an air carrier accident. It also discusses the need for technological development in the area of flight recorder systems, particularly in reducing costs, and in increasing reliability and maintainability of such systems, and in the development of compact, light weight, and inexpensive recorders for use in lighter jets and turboprop airplanes.
Aiming at a general routing strategy
Authors: J. Heinisch
Venue: Proceedings of the 18th Design Automation Conference (1981)

A general method for automatic routing, based on a channel splitting approach, is presented. A weighted graph depicting multilayer partitions and allowing expected channel occupancy estimation is introduced. Problems and algorithms related to the detailed routing phase are briefly reviewed.
Use of an infinite-valued propositional calculus in a document retrieval system
Authors: John R. Miller
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

It is proposed that a particular infinite-valued propositional calculus be used to define a retrieval function for a document retrieval system in which queries are well-formed formulas of the propositional calculus. With this approach, &ldquo;weighted&rdquo; queries may be processed in a simple, straightforward manner; queries may be represented as highly sparse vectors, and this representation may be transformed easily into the more conventional truth-table representation, and conversely; feedback techniques may be used; and a means is provided for circumventing the &ldquo;independence assumption&rdquo; with regard to subject identifiers.
Computer education in two-year institutions: - A natural point of supply for hireable, operational, EDP-applications programmers
Authors: Frank Cable
Venue: Proceedings of the third SIGCSE technical symposium on Computer science education (1973)

This is a personal opinion paper, loaded with obvious prejudices and unsupported charges and claims. As such, it is more fitting that it be presented at Union Square to a convention of rabble-rousers than as an argument to the SIGCSE. The positions may be personal and biased, but they are deeply and dearly held by the author (a very sensitive soul) and were acquired over many years of creating the ills he is now trying to dis-own. It is also important to note that these views are not shared throughout his department and certainly not throughout his university.
Hardware support for memory protection: Capability implementations
Authors: M. V. Wilkes
Venue: ACM SIGARCH Computer Architecture News (1982)

This paper is intended to stimulate discussion on the present state of hardware supported capability systems. Interest in such systems grew up in the mid-1960's and since that time information has been published on several different versions. In the opinion of some observers, the software complexity of these systems outweighs the advantage gained. The paper surveys the situation, and endeavors to set out the general features that a hardware supported capability system should possess. An attempt is made to identify the causes of the complexity and to make recommendations for removing them. The arguments for and against the tagging of capabilities are discussed and attention is drawn to a system of semi-tagging previously proposed by the author.