ppxscal/embedding_network huggingface dataset:
Reconstruction from image sequences by means of relative depths
Authors: A. Heyden
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

The paper deals with the problem of reconstructing the locations of n points in space from m different images without camera calibration. It shows how these problems can be put into a similar theoretical framework. A new concept, the reduced fundamental matrix, is introduced. It contains just 4 parameters and can be used to predict locations of points in the images and to make reconstruction. We also introduce the concept of reduced fundamental tensor which describes the relations between points in 3 images. It has 15 components and depends on 9 parameters. Necessary and sufficient conditions for a tensor to be a reduced fundamental tensor are derived. This framework can be generalised to a sequence of images. The dependencies between the different representations are investigated. Furthermore a canonical form of the camera matrices in a sequence are presented.
Budget planning and costing in xerox APL
Venue: Proceedings of the sixth international conference on APL (1974)

An interactive APL program, PLANNER, has been developed by Xerox for the benefit of project-oriented management in preparing their budgetary plans. Use of PLANNNER obsoletes the onerous tasks of filling out forms and repeated iterations of conventional batch budget programs.
Computational simplicial homology in APL
Authors: J. O. Shallit
Venue: Proceedings of the international conference on APL (1982)

In this paper, we describe a set of APL programs prepared by the author for computation of homology groups of simplicial complexes. These programs may be used in conjunction with a first course in algebraic topology in several ways: to help the student gain an intuitive feel for homology theory, to suggest plausible conjectures in algebraic topology, and to aid proofs.
The extended file system at GSFC
Authors: May W. Adams
Venue: Proceedings of the sixth international conference on APL (1974)

A description of one extended file system and its implementation Goddard Space Flight Center. The paper includes summaries of the principal components of the system and their uses, both from the user's point of view and that of the system's programmer maintaining the software.
Simulation: A tool for design and pre-implementation testing of large scale software systems
Authors: Miklos Antal Vasarhelyi
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This paper discusses the application of simplified, surrogate (simulated) software systems in the pre-implementation, design and evaluation of large scale software systems. In earlier research a theoretical framework for an interactive computer language for financial planning has been postulated.10 This paper discusses the utilization of a surrogate computer system as a tool to test the feasibility of such an interactive planning system. This surrogate system is programmed in APL and serves both as a validation of a planning theory and as an ex-ante device for the prediction and evaluation of expected system performance. Surrogate systems are held to be a most useful methodology in developing and analyzing large scale systems.
The MACSYMA system
Authors: W. A. Martin, R. J. Fateman
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

MACSYMA is a system for symbolic manipulation of algebraic expressions which is being developed at Project MAC, M.I.T. This paper discusses its philosophy, goals, and current achievements. MACSYMA makes extensive use of the power of its rational function subsystem. The facilities derived from this are discussed in considerable detail.
T: a dialect of Lisp or LAMBDA: The ultimate software tool
Authors: Jonathan A. Rees, Norman I. Adams IV
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

The T project is an experiment in language design and implementation. Its purpose is to test the thesis developed by Steele and Sussman in their series of papers about the Scheme language: that Scheme may be used as the basis for a practical programming language of exceptional expressive power; and, that implementations of Scheme could perform better than other Lisp systems, and competitively with implementations of programming languages, such as C and Bliss, which are usually considered to be inherently more efficient than Lisp on conventional machine architectures. We are developing a portable implementation of T, currently targeted for the VAX under the Unix and VMS operating systems and for the Apollo, a MC68000-based workstation.
APLNET, a local computer network
Authors: Daniel Brocklebank
Venue: Proceedings of the international conference on APL (1982)

A local network has been developed to interconnect computers used by the Applied Physics Laboratory of Johns Hopkins University (APL/JHU). The network is based upon proven, commercially available networking components and the APL/MVS interactive system which offers Iverson's APL to users of large-scale IBM processors. The need for users of the APL language to access data within minicomputer systems and to control specialized peripherals connected to those minicomputers constituted a major motivation for the network. Shared variables provide the interface between APL users and the APLNET network. Network management functions are implemented in APL for maximum ease of customizing and changing both the displays and commands used by management.
Methods for generalized deductive fault simulation
Authors: N. Giambiasi, A. Miara, D. Muriach
Venue: Proceedings of the 17th Design Automation Conference (1980)

In this paper, the authors describe methods for generalized deductive fault simulation of digital networks. By introducing the notion of unknown fault list, the propagation algorithm through gates modelized with rise and fall times are simplified with the same accuracy.
Tree-manipulating systems and Church-Rosser Theorems
Authors: Barry K. Rosen
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

We define a general class of tree-manipulating systems that includes many of the special cases from logic, linguistics, and automata theory. Systems possessing what we call the &ldquo;Church-Rosser property&rdquo; are appropriate for evaluation or translation processes: the end result of a complete sequence of applications of the rules does not depend on the order in which the rules were applied. We sketch the theoretical and practical advantages of such flexibility. We derive general sufficient conditions for the Church-Rosser property and apply them to some important tree-manipulating systems. Applications include tree transducers, the McCarthy formalism for recursive computation, and the classical Church-Rosser Theorem for the full lambda-calculus.
Seed corn session
Authors: Artie Briggs, Roger Elliott, Orrin Taulbee, Ray Miller, Fred Maryanski
Venue: Proceedings of the ACM '82 conference (1982)

There is a consensus in academia and industry that the shortage of computer science faculty is at crisis proportions. The solutions to this crisis involve actions both independent and concurrent. Some of the actions suggested for the academic arena include the offering of salaries competitive with industry wages, marketing the perceived advantages of university appointments as opposed to industrial positions, recruit from industry, provide stronger career counseling to avoid a surplus in esoteric specialties, reaffirm teaching as the primary responsibility, actively develop industrial contracts and acknowledge the validity of industrial research and selection of directions for computer sciences. Industry could help alleviate the problem by rebuilding computer science laboratories with state-of-the-art hardware, provide summer jobs and encourage graduate students to complete degree work before seeking employment. Both groups need to work together to improve channels of communication, to share personnel, seek better job matches and open research centers on both sides.
On the faithful regular extensions of iterative algebras
Authors: Francesco Parisi-Presicce
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

In ([6]), Tiuryn proved the existence of extensions of algebras with the unique fixed point property (iterative algebras) to ordered algebras with the least fixed point property (regular algebras), extensions preserving the fixed point solutions. The aim of this paper is to prove that whenever the extension is &ldquo;faithful&rdquo;, i.e. obtained without collapsing elements of the carrier, the new regular algebra is again iterative. In Section 1 we fix some notations and definitions and state Tiuryn's result. Section 2 contains the formulation of the problem and a sketch of the proof. Section 3 deals with the main construction.
Color gamut transform pairs
Authors: Alvy Ray Smith
Venue: Proceedings of the 5th annual conference on Computer graphics and interactive techniques (1978)

Digital control of color television monitors&mdash;in particular, via frame buffers&mdash;has added precise control of a large subset of human colorspace to the capabilities of computer graphics. This subset is the gamut of colors spanned by the red, green, and blue (RGB) electron guns exciting their respective phosphors. It is called the RGB monitor gamut. Full-blown color theory is a quite complex subject involving physics, psychology, and physiology, but restriction to the RGB monitor gamut simplifies matters substantially. It is linear, for example, and admits to familiar spatial representations. This paper presents a set of alternative models of the RGB monitor gamut based on the perceptual variables hue (H), saturation (S), and value (V) or brightness (L). Algorithms for transforming between these models are derived. Particular emphasis is placed on an RGB to HSV non-trigonometric pair of transforms which have been used successfully for about four years in frame buffer painting programs. These are fast, accurate, and adequate in many applications. Computationally more difficult transform pairs are sometimes necessary, however. Guidelines for choosing among the models are provided. Psychophysical corrections are described within the context of the definitions established by the NTSC (National Television Standards Committee).
Simulation in a tax model
Authors: Roger F. Miller, Martin David
Venue: Proceedings of the 1971 26th annual conference (1971)

Design of a tax simulation requires the selection of separable policy choices within an appropriate aggregative context. Simulation can be expedited by suitable presorting, file linkages, and phasing of program development.
Taking advantage of zero entries in the exact inverse of sparse matrices
Authors: Paul S. Wang, Tadatoshi Minamikawa
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

An important use of a computer symbolic mathematical system lies in the area of matrix manipulation. This includes determinant [1,5] and linear equations [2,6,8]. Computing the inverse is one of the more complicated matrix operations. A principal difficulty in the exact inversion of a matrix is intermediate expression growth. This is particularly true if the given matrix contains a number of variables. The MACSYMA system [7] has been using an inversion scheme based on Gaussian elimination [6]. When the given matrix is sparse, it is desirable to have a way of taking advantage of the presence of the many zero entries. We used the technique of reduction to block triangular form [3]. The reduction is done by finding the strong components in a directed graph [4] associated with the given sparse matrix. In section two we shall describe how this scheme is employed to compute the exact inverse. A proof will be given in section three to show that, as far as symbolic inversion is concerned, this algorithm gives all the &ldquo;predictable&rdquo; zero entries in the inverse. Section four contains timing data comparing this method with MACSYMA's Bareiss-type fraction free elimination scheme.
Software guideline development: Proposed methodology
Authors: Richard E. Cordes
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Too often Human Factors guidelines or checklists are of limited value. The reasons for following them and the degree to which they should be followed are not always apparent. These problems in conjunction with the fact that they are usually full of words or concepts that are not adequately defined, result in guidelines which are misused and/or grossly under-consulted. A methodology will be advocated that will help alleviate these problems. This methodology, when followed, will produce guidelines which can be shown to be effective and are unambiguous in their use and interpretation. Guidelines produced by this procedure become useful tools for objectively evaluating software products.
User interface flexibility and limits of effective computer documentation for users
Authors: Allan J. Henderson
Venue: Proceedings of the 2nd annual international conference on Systems documentation (1983)

This paper looks at the increasing flexibility of computer interfaces and the resulting impact on the effectiveness of the computer manufacturer's documentation (reference manuals, training packages, and so on). The paper identifies the types of documentation that begin to lose effectiveness as the user interface becomes more flexible, and briefly looks at ways to keep that documentation as effective as possible.
On bounds on the number of steps to compute functions
Authors: Giorgio Ausiello
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

Let f be a partial recursive function defined in terms of other functions g1,...,gn such that f converges if and only if some well defined assertions about the convergency of g1,...,gn hold: then we can find a total function (depending on the number of steps required to compute g1,...,gn) that bounds the step counting function of f almost everywhere f is defined. It is also shown that, in that case, to compute the bound to the step counting function is not much harder than computing the step counting function itself.
Morphological contour coding using structuring functions optimized by genetic algorithms
Authors: P. Brigger, M. Kunt
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Shape representation is an important image analysis task which can be used for contour coding and feature extraction. The morphological skeleton is a geometrical shape description by means of maximal inscribed structuring elements. The form of the structuring element is usually chosen a priori, and we show how genetic algorithms can be used for an automatic optimization of an arbitrary shaped structuring element. It permits improved progressive contour transmission and the extraction of shape features.
Ongoing developments in GASP
Authors: A. Alan. B. Pritsker
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

During the past two years, the many applications that have been made using GASP IV (16) have resulted in the need for new developments. In reviewing the applications, it has been found that the organizational structure provided by GASP IV for building combined continuous/discrete models has been of tremendous aid to analysts. The ability to super-impose a discrete event structure on a state variable model of a system in an efficient and effective manner has been demonstrated by diverse applications. Although GASP IV is used for the normal discrete type of problems such as the study of inventory and queueing systems and for the analysis of continuous systems, it is the area of combined simulation where it has had its greatest impact. The first type of ongoing developments relate to modifications, adaptations and extensions for GASP IV. Another ongoing development in GASP involves the design and implementation of an interactive version of GASP IV (5,6).
Evolution of a program in computing for a Latin American graduate college
Authors: Yolanda F. Villasenor
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

This paper describes the design process for the program in computing of the Colegio de Postgraduados located in Chapingo, Mexico. The program was designed to fit the research and academic requirements of the agronomical community in Mexico. First, a brief description of the organization of the Colegio de Postgraduados and of its broad objectives will be presented. Then the setting in which the program was developed and the design process itself will be described.
Global optimization of microprograms through modular control constructs
Authors: Graham Wood
Venue: ACM SIGMICRO Newsletter (1979)

By taking due regard of the disciplines of structured programming, we extend the scope of optimization of microprograms from blocks of micro-operations delimited by labels and branches (straight line segments) to complete microprograms.
Application of an interactive graphics system to the kinematic design of an artificial knee joint
Authors: Roger E. Kaufman
Venue: ACM SIGGRAPH Computer Graphics (1972)

KINSYN is an interactive general purpose computer system for the kinematic synthesis and analysis of mechanisms. It is applicable to kinematics problems ranging from the synthesis of spacecraft antenna deployment mechanisms to the design of folding high chairs. Features of KINSYN have been described in several recent publications. The results shown in this paper were obtained during the first two or three trial runs on KINSYN. Of course, extensive work would remain to be done in order to apply these techniques to a practical artificial limb design, Nonetheless, the fact that so much useful design data can be obtained so readily with the aid of KINSYN indicates that it could be a significant aid in a physiological limb development program.
Space-bounded hierarchies and probabilistic computations
Authors: Walter L. Ruzzo, Janos Simon, Martin Tompa
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

This paper studies two aspects of the power of space-bounded probabilistic Turing machines. Section 2 presents a simple alternative proof of Simon's recent result [13] that space-bounded probabilistic complexity classes are closed under complement. Section 3 demonstrates that any language in the log n space hierarchy can be recognized by an log n space-bounded probabilistic Turing machine with small error; this is a generalization of Gill's result that any language in NSPACE(log n) can be recognized by such a machine The second result raises interesting questions about space hierarchies, which are considered in section 4. The usual definition is in terms of space-bounded alternating Turing machines with a constant number of alternations [4].
The public planning information system and the computer utility
Authors: R. D. Jones
Venue: Proceedings of the 1967 22nd national conference (1967)

This paper attempts to anticipate the development of two types of organizations: the public planning information system and the &ldquo;computer utility.&rdquo; Public planning information systems are computer-based systems for storing, retrieving and analyzing data in support of relatively long-range, urban-planning activities. The computer utility is an emerging form of organization providing computer services to all types of users and may in the future distribute computer services much as electric power is distributed today.
Self-Organized Classification Problem Solving with Yprel Neural Networks
Authors: E. Stocker, A. Ribert, Y. Lecourtier
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper deals with a new scheme of distributed classifier based on a particular formal neuron named "yprel". The main characteristics of the proposed approach are: (I) a classifier is a set of interconnected and cooperating networks; (II) the distributed resolution strategy emerges from the individual classification behaviors during the incremental building phase of the classifier; (III) each neuron is able to come to classification decisions and to communicate them; (IV) the network architectures and the interconnection links between the networks are not a priori chosen, but get themselves organized thanks to an incremental and competitive learning between the decision-making neurons.
Chip layout optimization using critical path weighting
Authors: A. E. Dunlop, V. D. Agrawal, D. N. Deutsch, M. F. Jukl, P. Kozak, M. Wiesel
Venue: Proceedings of the 21st Design Automation Conference (1984)

A chip layout procedure for optimizing the performance of critical timing paths in a synchronous digital circuit is presented. The procedure uses the path analysis data produced by a static timing analysis program to generate weights for critical nets on clock and data paths. These weights are then used to bias automatic placement and routing in the layout program. This approach is shown to bring the performance of the chip significantly closer to that of an ideal layout which is assumed to have no delay due to routing between cells.
The entropic limitations on VLSI computations(Extended Abstract)
Authors: Andrew C. Yao
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

In this paper we will explore the limitations imposed by entropic constraints, both in generality and for specific problems. We list below the main questions that we will address. (1) In the binary number system, addition is easy while multiplication is hard for VLSI. Is there an &ldquo;ideal&rdquo; number representation, in which all arithmetic operations have efficient VLSI implementations? (2) Can one build multipliers for binary numbers, which achieve both small area and fast average computation time? (3) Thompson's technique applies only to multiple output functions. How can one prove area-time bounds for single output functions? (4) What other ways are there for deriving entropic constraints from consideration of data movement? Answers to these questions will be discussed in the ensuing sections.
What if mass storage were free?
Authors: George Copeland
Venue: ACM SIGIR Forum (1980)

This paper investigates how database systems would be designed and used under the limiting-case assumption that mass storage is free. It is argued that free mass storage would free database systems from the limitations and problems caused by conventional deletion techniques. A non-deletion strategy would significantly simplify database systems and their operation, as well as increase their functionality and availability. Consideration of this limiting case helps shed light on a more realistic argument: if the cost of mass storage were low enough, then deletion would become undesirable. It is also argued that the often labor-intensive costs and time delays involved in archival and retrieval of older data can be minimized if a single technology were available with low-cost on-line storage and a low-cost archival media with long shelf life. Optical discs promise to come one to two orders of magnitude closer to the limiting case of free mass storage than ever before. Other features of optical discs include improved reliability and a single technology for both on-line and archival storage with a long shelf life. Because of these features and because of (not in spite of) their non-deletion limitation, it is argued that optical discs fit the requirements of database systems better than magnetic discs and tapes.