ppxscal/embedding_network huggingface dataset:
Graphical tools for interactive image interpretation
Authors: David M. Mckeown,  Jr., Jerry L. Denlinger
Venue: Proceedings of the 9th annual conference on Computer graphics and interactive techniques (1982)

This paper describes BROWSE, an interactive raster image display facility which is a major component of a larger integrated Map Assisted Photo-interpretation System (MAPS), being developed as a prototype interactive aid for photo-interpretation. Application areas for this research include image cartography, land use studies and reconnaissance, as well as image database organization, storage, and retrieval. BROWSE is a window-oriented display manager which supports raster image display, overlay of graphical data such as map descriptions and image processing segmentations, and the specification and generation of 3D shaded surface models. Digitized imagery from black and white and color aerial mapping photographs is displayed by BROWSE at multiple levels of resolution and allows for dynamic positioning, zooming, expansion or shrinking of the image window. Map data represented as vectors and polygons can be superimposed on the imagery through image-to-map registration. Access to collateral map databases and terrain models may be accomplished using the BROWSE graphical interface. Finally, the window representation gives a convenient communication mechanism for passing image fragments to image interpretation programs, which generally run as separate processes. The results of such processing can be returned to BROWSE for further processing by the user. We will discuss the rationale behind the design of BROWSE as well as its application to domains including aerial photo-interpretation and 3D cartography.
A method to expose the hidden structure of Fortran programs
Authors: Loren P. Meissner
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Program structure is inherent in program design; therefore special keywords such as "if... then ... else&rdquo; or "do ... while&rdquo; are useful only to the extent that they reveal that structure. A simple listing of Fortran program statements is ineffective for revealing program structure. Proposals have been made for manually inserting keywords, comments, indentations, etc., either during a separate preprocessing stage or during the normal coding process. We show how the flow graph can provide independent structural information. Although the flow graph may be said to exist as soon as a program has been designed, it is most readily generated from the program statements. &ldquo;Bad&rdquo; structure can be detected objectively, and &ldquo;good&rdquo; programs can be reconstituted to reveal their block structure more clearly. Our implementation is based on an algorithm suggested by Peterson et al (CACM, August 1973). We have extended this algorithm to automatically detect block exits.
Social and Content-based Information Filtering for a Web Graphics Recommender System
Authors: Junichi Tatemura, Simone Santini, Ramesh Jain
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Existing social or content-based approaches to filtering-by-example are difficult to apply to image data. To realize a filtering-by-example system for image data, we propose a new approach to combine social and content-based filtering techniques. A content-based subsystem provides two types of clusters, equivalent items and virtual users, to overcome a disadvantage of social filtering, that is, a shortage of ratings. Since items similar in visual properties are not always similar in users' tastes, a social sub-system controls the content-based sub-system with an evaluation function that estimates the validity of content-based clusters according to user ratings. Based on this approach, we have developed an image database, Web Graphics Navigator, that recommends graphics for web pages according to the users' tastes. The database has been open to the public on the World Wide Web to obtain user ratings. A preliminary observation of the user data shows promising results.
The relational/network Hybrid data model for Design Automation Databases
Authors: Mark N. Haynie
Venue: Proceedings of the 18th Design Automation Conference (1981)

The three traditional database data models (relational, network and hierarchical) fail to satisfy certain &ldquo;real world&rdquo; database problems, particularly in large engineering applications. A Hybrid relational/network data model is proposed based on certain requirements of an example Design Automation (CAD/CAM) application.
Distributed communicating media-a multitrack bus-capable of concurrent data exchanging
Authors: Makoto Hasegawa, Tadao Nakamura, Yoshiharu Shigei
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

We propose a multitrack bus architecture: a novel interconnection scheme of functional units in a multiprocessor system. It features concurrent data transfer among functional units and flexible bus structure. We have clarified the possibility of more mass transfer of data in comparison with conventional interconnection schemes.
An interactive computer approach to performing resource analysis for a multi-resource/multi-project problem
Authors: Ronald A. Schlagheck
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

Current inventory planning in the National Aeronautics and Space Administration (NASA) has required the development of efficient methods to project resource procurements. This paper addresses a specific type of resource analysis and its implementation in an interactive computer system environment. This type of analysis is described as a multi-resource/multi-project (MR/MP) model. The emphasis of this article is towards two aspects of the solution process. The first involves an efficient approach for inputting the problem characteristics into the computer data base. The second addresses the scheduling procedure and analysis used for minimizing resources. Both represent important parts of the end-to-end resource utilization problem. Solution is accomplished with an interactive man/machine system. Descriptions of the database operations and example outputs from the program are presented. A comparison of the operations time in solving the MR/MP problem with interactive front-end processing over end-to-end batch runs is given.
PANON-1B: A programming language for symbol manipulation
Authors: A. Caracciolo di Forino, L. Spanedda, N. Wolkenstein
Venue: Proceedings of the first ACM symposium on Symbolic and algebraic manipulation (1966)

PANON-1B is a Universal Programming Language for Symbol Manipulation, base on a particular extension of Markov Normal Algorithms. It consists essentially of a sequence of Labelled Structural Transformation Rules to be applied to an arbitrary argument string, according to appropriate sequencing rules. PANON-1B includes also specifications for input-output operations. The basic principles are discussed. Some details of a particular complete hardware representation are given.
Generalized inverse computations using the gradient projection method
Authors: L. Duane Pyle
Venue: Proceedings of the 1964 19th ACM national conference (1964)

A number of methods have been proposed for computing the (Moore-Penrose-Bjerhammar) generalized inverse A+ of an arbitrary m by n complex matrix A of rank r-and-le;m-and-le;n. Boot, Ben-Israel and Wersan have recently published methods which require the formation either of AA* or BB*, where B is an r by n submatrix of A having rank r. In this paper a procedure for computing A+ is given which consists of a variant of the gradient projection method. The procedure, which is equivalent to a Hestenes conjugate directions method in the special case r-and-equil;m, may be applied to any complex matrix. The basic procedure requires the application of the Gram-Schmidt orthogonalization process, first to the column vectors (a(i)*) of A*, then, if A is not of full row rank, to the column vectors (c(j)) of A.
Matching graph embeddings for shape analysis
Authors: T. Pavlidis, W. J. Sakoda, H. Shi
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

Past research in shape analysis and OCR has often emphasized graph matching techniques. We propose to use matching of graph embeddings because this is what is actually of interest. In this way we obtain faster and simpler algorithms since most decisions can be made on the basis of graph labels (the geometry of the embedding) rather than the topology of the graph. The latter has to examined only in very few cases. The proposed algorithm consists of four sieves that compare branches of two embeddings by (normalized), angle, y-position, x-position, and length. Pairs of graphs that pass all the sieves have a node correspondence established so the next step compares degrees. Finally paths are determined using Kleene's algorithm and compared with prototype arcs.
Analytic modelling of disk I/O subsystems: A tutorial
Authors: Edward D. Lazowska, John Zahorjan
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

This is a summary of a tutorial presented during the conference discussing a number of approaches to representing disk I/O subsystems in analytic models of computer systems. As in any analytic modelling study, the fundamental objective in considering an I/O subsystem is to determine which devices should be represented in the model, and what their loadings should be. The device loadings represent the service required by jobs, and are the basic parameters needed by the computational algorithm which calculates performance measures for the model. To set these parameters, knowledge of service times at the various devices in the I/O subsystem is required. The tutorial begins by distinguishing analytic modelling from alternative approaches, by identifying the parameter values that are required for an analytic modelling study, and by explaining the role of the computational algorithm that is employed (Denning Buzen [1978] provide a good, although lengthy, summary). We then consider a sequence of models of increasingly complex I/O subsystems. Next we discuss I/O subsystems with rotational position sensing. We then discuss approaches to modelling shared DASD, emphasizing hierarchical techniques in which highlevel models of each system can be analyzed in isolation. We also mention recent techniques for modelling complex I/O subsystems involving multipathing. Finally, we discuss the analysis of I/O subsystems based on broadcast channels such as Ethernet.
A simulation model of the primary health care system of Indiana
Authors: Charles Standridge, Charles Macal, A. Alan B. Pritsker, Harry Delcher, Raymond Murray
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

A combined discrete/continuous simulation model of the primary health care system of Indiana has been developed and implemented in the GASP IV simulation language. The purpose of this model is to project the supply of and demand for primary health care in Indiana from 1970 through 2000. The model has been developed to evaluate the need for additional primary care supply in Indiana, and to assess the effect of exogenous policy changes on performance measures of the Indiana primary health care system. This paper describes the model and its use, however, an emphasis is placed on the data collection aspects of model building. The data to support the model was obtained from many sources. Extensive problems existed in converting the data to a consistent basis. A description of the data sources, the data reduction requirements and the parameter estimation procedures are included in the paper. The primary health care system of Indiana is modeled as having four major components: 1. the providers of primary care; 2. the volume of services of the providers; 3. the population of Indiana; and 4. the volume of services the population demands. Model outputs involved the projection of the four components over time. In working with health man-power policy-makers, it was determined that the following two performance measures were of significant interest: 1. Ratio of the supply of visits to the demand for visits. 2. A normalized difference between the supply of visits and the demand for visits.
Abstracto 84: The next generation
Authors: Lambert Meertens
Venue: Proceedings of the 1979 annual conference (1979)

Programming languages are not an ideal vehicle for expressing algorithms. This paper sketches how a language Abstracto might be developed for &ldquo;algorithmic expressions&rdquo; that may be manipulated by the rules of &ldquo;algorithmics&rdquo;, quite similar to the manipulation of mathematical expressions in mathematics. Two examples are given of &ldquo;abstract&rdquo; algorithmic expressions that are not executable in the ordinary sense, but may be used in the derivation of programs. It appears that the notion of &ldquo;refinement&rdquo; may be replaced by a weaker notion for abstract algorithmic expressions, corresponding also to a weaker notion of &ldquo;weakest precondition&rdquo;.
Integrated environments
Venue: Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging (1983)

The session on debugging in integrated environments started with Fairley's characterization of integrated environments as follows: (1) versatile collection of analysis, design, implementation, testing, and maintenance tools; (2) consistent user interface among the tools; (3) common representation of information (e.g., Stoneman's database model, Unix pipe); (4) history/version control/configuration management capability; and (5) encouragement of good practice. He then asked the audience the following questions: (1) what is your view of environments? (2) what possibilities exist for debugging in integrated environments that do not exist in a mere collection of tools? (3) what is the difference between high-level debugging and low-level debugging with high-level tools?
Microprogramming Design support System
Authors: Akihiko Yamada, Akihiro Kawaguchi, Kazutoshi Takahashi, Shunichi Kato
Venue: Proceedings of the 11th Design Automation Workshop (1974)

Recently microprogramming technique has been used in many areas such as computers, peripheral devices, terminals, and so on. Control word organization varies with each control equipment. Also integrated control technique or centralized control technique requires the integration of microprograms depending on system configuration. Therefore generalized and sophisticated design support system has been desired. Microprogramming Design support System, MDS, has been developed to meet such requirements.
APL and FORTRAN: A Symbiotic Mix for a Small Machine
Authors: C. P. Nielsan, T. H. Burnett, W. Vernon
Venue: Proceedings of the sixth international conference on APL (1974)

This paper discusses the interactive capabilities between APL and FORTRAN on a small computer. This has been accomplished through implementation of several new system commands to facilitate communication between APL and FORTRAN. Use of the FORTRAN compiler while in APL and providing system I/0 for APL is discussed.
On Robust Rectification for Uncalibrated Images
Authors: Francesco Isgrò, Emanuele Trucco
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

We present a robust algorithm performing uncalibrated rectification which does not require explicit computation of the epipolar geometry, and specifically of the fundamental matrix. Our algorithm exploits the fact that the fundamental matrix of a pair of rectified images has a particular, known form. This allows us to set up a minimization that yields the rectifying homographies directly from image correspondences. Experimental results show that our method works even in the presence of noise, and can cope with inaccurate point correspondences. Robustness in the presence of wrong point correspondences is also addressed in this paper, and a two steps outlier detector is described.
An overlaying method for the effective organisation of APL systems
Authors: A D Crossley, G R Streeter
Venue: ACM SIGAPL APL Quote Quad (1979)

A system has been developed to manage the workspace with an application operating under its control. The system, known as PROGRAMSYSTEM, utilises a novel overlaying technique to limit workspace contents to those which are pertinent to the current processing task. Having been evolved over the past two years, it is currently managing three large operational applications in different organisations, using Sharp APL and Xerox APL. The paper briefly reviews some popular workspace-management methods using program files, and introduces the concept of Sharp-APL 'packages' on which PROGRAMSYSTEM was based. A characteristic of conventional methods is the use of a directory reference table to locate required objects on the program file. PROGRAMSYSTEM dispenses with this relatively expensive approach. Instead, small functions are generated for the application, which directly reference overlays on a program file; by localising overlay contents within these functions, they are automatically removed from the workspace on termination. The methodology is explained in detail, and demonstrated by example. The structure of the program file is described, including the additional facilities supported by PROGRAMSYSTEM, these being: collection of cost statistics, handling of graphics and terminal characteristics, and extensive automatic documentation capabilities.
Face Processing and Recognition Using Learning and Evolution
Authors: Harry Wechsler
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

One of the most challenging tasks for visual form ('shape') analysis and object recognition is the understanding of how people process and recognize each other's face, and the development of corresponding computational models. This paper describes the important and successful role learning and evolution plays on improved and robust face coding and classification schemes. In particular we describe how committees of connectionist networks and symbolic learning, evolutionary computation, and statistical learning theory lead to increased performance on tasks including the location of facial landmarks, gender and ethnic categorization, face recognition, and pose discrimination.
A multi-microprocessor design
Authors: Helmut Berndt
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

In the low-to-medium performance range of computer systems, the designer is faced with ever increasing input/output requirements which cannot be accommodated in the traditional way. In the past as well in present day computers of sufficient internal performance the input/output part and the instruction execution part of a central processing unit are combined. In order to provide high input/output data rates on smaller machines, a multiprocessor system must be used. Different design alternatives are discussed using microprogram controlled processors. The paper focusses on a design, where dedicated processors for internal and external processing needs are combined with a maintenance processor and the memory system in a star-like configuration. Microprogramming needs and hardware support vary widely in such a design. The central processor handling the internal tasks like instruction execution and interrupt processing requires the customary complex and powerful microinstruction repertoire. The processor for the external tasks - the input/output processor - performs all data transfers and executes channel programs. Here, realtime behavior is essential while the microinstruction set is fairly small and simple. In dealing with these design principles, the realization of such a computer will be discussed as an example.
A general computer simulation technique for assessments and testing requirements
Authors: John H. Fountain
Venue: Proceedings of the SHARE design automation project (1965)

This paper contains a description of the use of a digital computer technique which is designed to solve any of the following problems: a) Ascertain a point estimate of the reliability of a system given only the logic flow diagrams describing the component configuration within the system and point estimates or failure rates on the components. b) Ascertain an interval estimate of the reliability of a system given only the logic flow diagrams describing the component configuration within the system and the test data on the components in varying amounts and types. c) Determine the minimum confidence level to which all apportioned component reliabilities need be demonstrated in order to meet a system reliability and confidence specification. The technique is general in that it is designed to handle configurations containing parallel, standby, series, or logical networks or any combination thereof. It is unique in that no equations need be written to construct the mathematical model describing the component configuration within the system. All that is necessary to run the program is to write a relatively simple pseudo-program, how the components are connected, as input along with either test data, point estimate, or failure rate specifications, or any combinations thereof on the components (where appropriate).
The &ohgr;-sequence equivalence problem for DOL systems is decidable
Authors: Karel Culik,  II, Tero Harju
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

The following problem is shown to be decidable. Given are homomorphisms h1 and h2 from &Sgr;* to &Sgr;* and strings &sgr;1 and &sgr;2 over &Sgr; such that hni(&sgr;i) is a proper prefix of hn+1i (&sgr;i) for i &equil; 1, 2 and all n &ge; 0, i.e. for i &equil; 1, 2, hi generates from &sgr;i an infinite string &agr;i with prefixes hni(&sgr;i) for all n &ge; 0. Test whether &agr;1 &equil; &agr;2. From this result easily follows the decidability of limit language equivalence (&ohgr;-equivalence) for DOL systems.
Presentation abstract
Authors: R. W. Signor
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

ANSI X3.9-1978 FORTRAN is not convenient for use in various application areas. Examples of such application areas include numerical analysis, industrial control, and computer graphics. A means is required to permit application- oriented extensions of FORTRAN by users with special application requirements that does not burden all users. Such a means is not presently available without changes to FORTRAN itself. This position states the nature of the changes required to FORTRAN. It then suggests constraints to be observed by all application-oriented extension modules.
An overview of the new routing algorithm for the ARPANET
Authors: John M. McQuillan, Ira Richer, Eric C. Rosen
Venue: Proceedings of the sixth symposium on Data communications (1979)

The original routing algorithm of the ARPANET, in service for over a decade, has recently been removed from the ARPANET and replaced with a new and different algorithm. Although the new algorithm, like the old, is a distributed, adaptive routing algorithm, it is not similar to the old in any other important respect. In the new algorithm, each node maintains a data base describing the delay on each network line. A shortest-path computation is run in each node which explicitly computes the minimum-delay paths (based on the delay entries in the data base) from that node to all other nodes in the network. The average delay on each network line is measured periodically by the nodes attached to the lines. These measured delays are broadcast to all network nodes, so that all nodes use the same data base for performing their shortest-path computations. The new routing algorithm was extensively tested on the ARPANET before being released. This paper describes the algorithm and summarizes the results of these tests.