ppxscal/embedding_network huggingface dataset:
A Robust Skew Detection Algorithm for Grayscale Document Image
Authors: Ming Chen, Xiaoqing Ding
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

A fast and robust skew detection algorithm for grayscale image is presented in this paper. This MCCSD (Modified Cross-Correlation Skew Detection) algorithm use horizontal and vertical cross-correlation simultaneously to deal with vertical layout text which is commonly used in Chinese or Japanese document. Instead of calculating correlation for the entire image, we use randomly selected small regions to speed up the process. Region verification stage and auxiliary peaks further processing make our method robust and reliable. Experiment shows that proposed method has good result on detecting skew in various kinds of pages.
Efficient Gaussian elimination method for symbolic determinants and linear systems (Extended Abstract)
Authors: Tateaki Sasaki, Hirokazu Murao
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

Efficient Gaussian elimination method for symbolic determinants and linear systems
An APL compiler for the UNIX timesharing system
Authors: Timothy A. Budd
Venue: Proceedings of the international conference on APL (1983)

An APL compiler running under the UNIX timesharing system on a PDP 11/70 is described.
FACOM 230-series computer design automation system
Authors: Takao Hayashi
Venue: Proceedings of the 7th Design Automation Workshop (1970)

This presentation describes the Design Automation System (DAS-2) used in designing FACOM 230-series computers (such as FACOM 230-60, one of Japan's largest computers). Greatly assisting designers, DAS-2 lightens their workload in logic design, packaging design, and wiring design. It also provides manufacturing data required for automatic production and inspection. This Design Automation System consists primarily of FACOM 230-50 programs, and contains some FACOM 230-60 and 270-20 programs. This presentation deals chiefly with automatic logic diagram printing, automatic packaging design, wiring design, logic card function tests.
Optimization of the PLA area
Authors: J. F. Paillotin
Venue: Proceedings of the 18th Design Automation Conference (1981)

A method to reduce the area of the PLA's is presented. Two steps are considered: the permutation of the minterms (columns) and the compacting of the PLA. The method is illustrated on the NMOS technology.
IDEA&mdash;a conversational, heuristic program for Inductive Data Exploration and Analysis
Authors: Laurence I. Press, Miles S. Rogers
Venue: Proceedings of the 1967 22nd national conference (1967)

The goal of this project is to improve the power and scope of computer routines that search for structure in a data base. IDEA (Inductive Data Exploration and Analysis) is a computer program that detects and represents inherent structure in multi-variage data. The IDEA program is designed either to run in an automatic mode or to allow the investigator to intercede at each major decision in the analysis. At each such juncture he is presented with information that permits him to concur or override a computer decision before the program continues to the next major decision. In addition, IDEA has two other distinguishing features: (1) Heuristic computational procedures are used for those cases where the combinational aspects of the analysis would require extensive computations, and (2) heuristics are selectively used for different types of data, enabling IDEA to operate on a mixture of nominal (categorical), ordinal (ranked), and interval- or ratio-scaled measurements.
A data description language approach to file translation
Authors: Alan G. Merten, James P. Fry
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

The basic research on data definition languages and the translation algorithm was supported by the Air Force Office of Scientific Research, Air Force Systems Command, U.S.A.F., under Grant No. AFOSR-72-2219. The development and implementation of the Prototype Data Translator was supported by the Joint Technical Support Activity of the Defense Communications Agency under Contract No. DCA 100-72-C-0019. The authors would like to express their appreciation to Janet Eggleton for her assistance in the technical editing and final preparation of this paper.
SIGSAM (Paper Session)
Authors: Joel Moses, Martin L. Griss
Venue: Proceedings of the 1976 annual conference (1976)

This is the first in a series of two tutorial sessions featuring lectures from the 1975-76 SIGSAM Lecture Program. Prof. Moses will describe Risch's decision procedure for determining the integrability in closed form of the elementary functions of the calculus together with examples. Prof. Griss will present an improved algorithm for computing the minors of a large sparse matrix of polynomials with emphasis on efficiency and optimal ordering.
Some theoretical aspects of algorithmic routing
Authors: Pratima Agarwal, M. A. Breuer
Venue: Proceedings of the 14th Design Automation Conference (1977)

In this paper we describe a router which has the capabilities of automatic rip-up and rerouting. The system employs a &ldquo;look-ahead&rdquo; feature for determining if as yet unrouted nets are unroutable. Backtrack programming is used to implement an implicit enumeration scheme which sequentially produces alternative paths for a given net. The relationship between this type of router and the problem of ordering nets is discussed. By varying parameters in our router which deal with back tracking and path-length deviations, we can obtain a hierarchy of routing systems. One extreme case corresponds to a classical Lee-type router; another to a &ldquo;perfect&rdquo; router which guarantees finding a solution if one exists.
Address size independence in a 16-bit minicomputer
Authors: Philip E. Stanley
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

Most minicomputers do not distinguish in their architecture between addresses and other operands, with the result that operand size becomes a de facto limit on address size (and thus memory size). This has created serious problems for many architectures when attempting to build systems with large address space. It is possible, however, to make address size &ldquo;invisible&rdquo; to the programmer and independent of operand/word size. This is achieved by defining the architecture to segregate addresses from other operands, and to compensate for the number of storage words required to hold an address. In a system so designed, the assembly source code written by a programmer then becomes &ldquo;independent&rdquo; of the address size of the particular computer for which it is intended; differences in address size becoming the concern of only the assembler. The implementation of this concept in a new minicomputer architecture is described. The necessary features in the architecture are identified, and the manner in which the assembler treats addresses is described. The effects upon ease of programming of these features is considered, and the object code produced (from a single source code) for two systems with different address sizes is analyzed. It is found that the sample programs will be only 5% larger and 3% slower for a system with two-word addresses than for a system with one-word addresses.
&ldquo;The technical issues confronting Ada&rdquo;
Venue: Proceedings of the ACM '81 conference (1981)

A few in-depth presentations exploring current technical (and management/control) issues confronting Ada implementers and users. 4 distinguished Ada experts now producing and using Ada technology report their current progress.
Services provided to users of SNA networks
Authors: James P. Gray
Venue: Proceedings of the sixth symposium on Data communications (1979)

The services that can be provided by an SNA network are discussed from a user's (e.g., terminal operator's, application programmer's, network system programmer's) point of view. No details of the network's internal behavior are given, but a short review of SNA introduces the paper.
Automatic programming and compilers III: Languages and real time information processing
Authors: T. B. Steel,  Jr.
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

LARGE SCALE PROCESSING of data in real time as an element of complex control systems has become a major segment in the science of information processing. These systems are quite diverse in character. They range in the response dimension from days in an inventory control system to milli-seconds in a satellite guidance control, and in the dimension of decision making automation from near totality in an oil refinery to virtual absence in a business management control system. Despite this variety, certain common elements of considerable importance to the task of computer programming are isolable. In this paper these factors will be characterized and their implications for program design and coding discussed.
CROGRO: An interactive forest growth simulator
Authors: D. M. Fellows, G. L. Sprague, G. L. Baskerville
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

CROGRO is an interactive computer model which simulates crown growth in trees as they compete with each other for available space and light. The model contains growth data for six species of trees. CROGRO was designed to be used as a teaching aid. It allows forestry students to observe in a few minutes a process which, in the real world, occurs over several decades. The system is programmed in APL and input/output is via a Tektronix 4015 graphics display terminal.
An experimental debugger in a limited programming environment (Extended Abstract)
Authors: Zen Kishimoto
Venue: Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging (1983)

This paper describes a debugger feature of a system that supports a limited programming environment for program validation, revalidation and debugging. The debugger in this system is tightly coupled with other tools through a database which is used as a central repository. The execution by this system is based on the hardware independent intermediate codes and, thus, the system has the potential to be multilingual. The debugger supports backward execution, provides both normal and symbolic execution results, and allows source-level debugging.
Reconstruction of algorithms from memory snapshots of their execution
Authors: Frederick E. Petry, Alan W. Biermann
Venue: Proceedings of the 1976 annual conference (1976)

A system is described which utilizes a trace of memory snapshots taken during the execution of an algorithm. With such traces and a description of the environment in which the algorithm was executed, the algorithm can be reconstructed. In the first phase, decomputation of the results which appear in the snapshots is performed. Decomputation is the process which produces, for each result in the trace, the set of possible instructions which could have been its cause. The construction phase then uses static and dynamic information obtained from the trace to aid in synthesizing the algorithm. A number of experiments which have been performed with system are also described.
Social implications of intelligent machines
Authors: Margaret A. Boden
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The much-discussed issues of privacy, unemployment, leisure, centralization of political power, and military misuse of technology are raised by work in artificial intelligence no less than by applications exploiting the &ldquo;brute force&rdquo; of computers. But this paper focuses specifically on matters associated with the social use of intelligent machines in particular. Some current and predicted developments in machine intelligence are described and possible ill and good effects these may have on society outlined. Precautionary measures that might be taken in the writing and presentation of programs to forestall the social dangers implicit in this area of research are examined.
Some classes of naturally provable programs
Authors: S. K. Basu, J. Misra
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Three different classes of programs are identified for which the proof of correctness is shown to be &ldquo;natural&rdquo;, in that the functional input-output specifications of the programs lead, in a straightforward manner, to the verification conditions that should be proven. Furthermore, these verification conditions are shown to be necessary and sufficient so that a proof/refutation follows by proving/disproving the corresponding verification conditions. It is not necessary to follow the exact control flow of the programs to generate these conditions; certain simple checks are enough to show whether a particular program belongs to one of the classes. These apparently different programs have the common feature that they operate &ldquo;uniformly&rdquo; on the data domain; changing the input to the program changes the dynamic behavior of the program in a predictable, easily definable fashion. Implications of this feature in program construction are discussed.
A general interactive guidance for information retrieval and processing systems
Authors: R. Erbe, G. Walch
Venue: Proceedings of the eighth international conference on APL (1976)

A general application guidance system -GAGS- was developed to support the problem solving enduser in applying DP-facilities without being a DP-professional. It has the following four main features: 1. Dialogue supported methods dictionary: guides the user from a given application problem to the adequate solution method or program. 2. Dialogue supported data dictionary: gives syntactic and semantic information about the data available in data administration systems such as data base systems. 3. Dialogue supported execution facility: offers a system triggered execution of programs found with the help of the methods dictionary in order to process data identified by means of the data dictionary. 4. Dialogue supported system guidance: enables the unexperienced user to work with software systems without being a DP-expert. The basic information structure for the interactive guidance which is the common overall feature of the four facilities listed above, is the information network. It is generated by breaking down the knowledge about the application area in question into information elements (network nodes) which are interconnected (network arcs).
PDL/Ada&mdash;a design language based on Ada
Authors: Jean E. Sammet, Douglas W. Waugh, Robert W. Reiter,  Jr.
Venue: Proceedings of the ACM '81 conference (1981)

This paper discusses (1) some general concepts of design languages, (2) the development of the specific design language denoted as PDL/Ada, (3) the specific features of PDL/Ada, and (4) some problems encountered and techniques used in defining PDL/Ada. An appendix shows two examples. Because of space constraints, each of these items can only be touched on briefly. This paper assumes that the reader has a basic familiarity with the Ada language (herein after referred to as Ada), but detailed knowledge is not required. The prime technical focus of the work has been to replace an existing design language and notation which supports a specific design methodology with a design language based on Ada without impacting the methodology. There was a clearcut decision to use Ada to obtain the dual benefits of having a design language which was a subset of a programming language while still retaining just the concepts needed for a design (rather than a programming) language.
Computer science curricula for high schools (A Panel Discussion)
Venue: Proceedings of the ACM 1980 annual conference (1980)

This Panel consists of discussions of current efforts underway to design and test textbooks, lesson plans and teaching strategies for the teaching of computer science in high schools. Most high school curriculum development concerning computing has been directed toward the teaching of traditional subjects (physics, chemistry, math) with computers. The Panelists will have just finished a site visit with HSCS, the National Science Foundation High School Computer Science Project at the University of Tennessee. They will offer a critical look at its promises and problems compared to other approaches to teaching high school computing, such as the LOGO project, and the use of BASIC.
Data abstraction and hiding in Fortran
Authors: Jerrold L. Wagener
Venue: Proceedings of the ACM '81 conference (1981)

Few computing techniques have been as successful for software development as Fortran's external procedure facilities. These may be viewed as a practical way to provide libraries of abstract operators for manipulating numeric and boolean, and in Fortran 77 also character, data objects. The implementation details of such operators are hidden from, and are of no concern to, the user. Proposed Fortran 8x allows programmers to define new data objects. Intrinsic operations do not exist for programmer-defined objects, and procedural abstraction is the only mechanism for providing operations for such objects. Thus implementation details of programmer-defined object operators may also be hidden from the user. Moreover, data object definitions themselves may be made externally, and used without local redefinition. Thus the implementation details of any data object may also be ignored by the user. Fortran 8x therefore provides many of the features of data abstraction as well as procedural abstraction. The proposed Fortran 8x mechanisms for data object definition and external data libraries will be described, with examples of their use as data abstraction facilities.
The mathematics component of the undergraduate curriculum in computer science (Panel Discussion)
Authors: Anthony Ralston, Carol Chrisman, Lawrence A. Jehn, Charles P. Poirier, Donald J. Del Vecchio
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

Given the simple fact that mathematics forms the foundation of computing, mathematics must play a meaningful role in the computer science program. This meaningful role, however, must be substantially less, in content, than a second major. We must avoid the extreme of little or no mathematics in the curriculum. We must, at the same time, avoid the excess of too much mathematics. The need for restraint becomes most obvious when we recognize that the ideal liberal arts program should be approximately one-third for a major, one-third for a broad &ldquo;liberal arts&rdquo; component, and one-third for free electives. A curriculum including all of the mathematics suggested in &ldquo;Curriculum-68&rdquo;, all of the computer science now needed by an individual wishing to devote his or her post-baccalaureate life to computing, and a minimal number of necessary cognates from other disciplines, would strain the traditional concept of the conventional four-year liberal arts degree. Thus, the only alternatives to moderation in the mathematics component are moderation in the major itself (unthinkable), extension of the curriculum to five or more years, and/or conversion of the curriculum to a professional degree, i.e., an engineering degree.
Bounds on the saved area ratio due to PLA folding
Authors: Wentai Liu, Daniel E. Atkins
Venue: Proceedings of the 20th Design Automation Conference (1983)

Folding is a scheme to reduce the silicon area in Programmable Logic Array (PLA) design. Since optimum folding is an NP-complete problem, methods for estimating potential area saving are desirable. In the case of row folding, both the upper and lower bounds for the saved area ratio &dgr; are derived in the paper. By applying the well-known Rent's relationship on a proposed partition model for PLA, we can show that [equation] where r is the Rent's exponent in the range 0<r<1. Four examples are given to validate the theoretical prediction. Finally, possible refinement and open problems are also mentioned.
A proposal for a hardware text processor
Authors: Amar Mukhopadhyay
Venue: Proceedings of the fifth workshop on Computer architecture for non-numeric processing (1980)

Because of the tremendous growth in the terminal-oriented users community, software text editor is increasingly becoming a significant overhead for the computing systems. The files being manipulated by text editors are usually small but undergo rapid growth and development in its short-lived life-cycle. A look into the basic command structure of these text editors reveal that the operations performed by them fundamentally consist of pattern matching, pattern transformation, pattern deletion and insertion, and management of a set of counters and pointers. It is proposed in this paper that a specialized front-end processor with built-in string processing hardware provide a natural solution to the problem. This paper presents a possible architecture and logical capabilities of such a machine as an embellishment of microprocessors to be used for intelligent terminals. In the process, the structure of a general purpose non-numeric processor is evolved.
A unification of Halstead's Software Science counting rules for programs and English text, and a claim space approach to extensions
Authors: Linda D. Misek-Falkoff
Venue: Selected papers of the 1982 ACM SIGMETRICS workshop on Software Metrics: part 1 (1982)

In his Elements of Software Science, Maurice Halstead proposed that software quality measurements could be based on static lexemic analysis of the vocabularies of operators and operands, and the number of occurrences of each class, in computer programs. He also proposed that quality issues in Natural Language text could be addressed from similar perspectives, although his rules for programs and for English seem to conflict. This paper suggests that Halstead's seemingly disparate rules for classifying the tokens of programs and the tokens of English can be generally reconciled, although Halstead himself does not claim such a union. The thesis of Part One is a unification of his two procedures, based on a linguistic partitioning between &ldquo;open&rdquo; and &ldquo;closed&rdquo; classes. This unification may provide new inputs to some open issues concerning coding, and suggest, on the basis of a conceptual rationale, an explanation as to why programs which are by Halstead's definition &ldquo;impure&rdquo; might indeed be confusing to the human reader. Part Two of this paper, by exploring the nodes in a textual &ldquo;Claim Space,&rdquo; briefly considers other groupings of the classes taken as primitive by Halstead, in ways which bring to light alternate and supplementary sets of candidate coding rules productive for study of textual quality.
Scalable Architectures with Hardware Extensions for Low Bitrate Variable Bandwidth Realtime Videocommunications (SCALAR)
Authors: Giancarlo Parodi, Ivano Barbieri, Marco Raggio
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

The SCALAR Project consortium is a balanced mix of University research groups, large multinational European companies (Ericsson Telecom AB (S), Bang & Olufsen (DK)) and SME's (EID(P), INESC (P)). Three university research groups which participate in the consortium have been long involved in research on image coding problems in complementary areas (University of Linkoping (S), University of Surrey (UK)) and research on image processing, multimedia systems and architectures, real-time systems in particular (University of Genoa(I)). Umeå University(S) is the main educational institute in North of Sweden. The SCALAR project started in the end of 1995 and Field test will end in first half 1999.