ppxscal/embedding_network huggingface dataset:
Some Properties of the E Matrix in Two-View Motion Estimation
Authors: T. S. Huang, O. D. Faugeras
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

In the eight-point linear algorithm for determining 3D motion/structure from two perspective views using point correspondences, the E matrix plays a central role. The E matrix is defined as a skew-symmetrical matrix (containing the translation components) postmultiplied by a rotation matrix. The authors show that a necessary and sufficient condition for a 3*3 matrix to be so decomposable is that one of its singular values is zero and the other two are equal. Several other forms of this property are presented. Some applications are briefly described.
A multisided generalization of B&eacute;zier surfaces
Authors: Charles T. Loop, Tony D. DeRose
Venue: ACM Transactions on Graphics (TOG) (1989)

In this paper we introduce a class of surface patch representations, called S-patches, that unify and generalize triangular and tensor product B&eacute;zier surfaces by allowing patches to be defined over any convex polygonal domain; hence, S-patches may have any number of boundary curves. Other properties of S-patches are geometrically meaningful control points, separate control over positions and derivatives along boundary curves, and a geometric construction algorithm based on de Casteljau's algorithm. Of special interest are the regular S-patches, that is, S-patches defined on regular domain polygons. Also presented is an algorithm for smoothly joining together these surfaces with Ck continuity.
Subpixel Measurements Using a Moment-Based Edge Operator
Authors: E. P. Lyvers, O. R. Mitchell, M. L. Akey, A. P. Reeves
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

Recent results in precision measurements using computer vision are presented. An edge operator based on two-dimensional spatial moments is given. The operator can be implemented for virtually any size of window and has been shown to locate edges in digitized images to a twentieth of a pixel. This accuracy is unaffected by additive or multiplicative changes to the data values. The precision is achieved by correcting for many of the deterministic errors caused by nonideal edge profiles using a lookup table to correct the original estimates of edge orientation and location. This table is generated using a synthesized edge which is located at various subpixel locations and various orientations. The operator is extended to accommodate nonideal edge profiles and rectangularly sampled pixels. The technique is applied to the measurement of imaged machined metal parts. Theoretical and experimental noise analyses show that the operator has relatively small bias in the presence of noise.
Three dimensional Terrain modeling and display for environmental assessment
Authors: K. Kaneda, F. Kato, E. Nakamae, T. Nishita, H. Tanaka, Takao Noguchi
Venue: Proceedings of the 16th annual conference on Computer graphics and interactive techniques (1989)

A technique for compositing computer generated images of buildings and background images created from aerial photographs is described. The aerial photo data are mapped onto a terrain model based on cartographic data. The technique can be used to pre-evaluate visual impact of large scale construction by means of not only still images but also animations.The technique can be briefly described as follows: 1) an accurate, three-dimensional terrain model is created based on cartographic data. 2) a hierarchy of aerial photo data at various resolutions is mapped onto the terrain model as a texture. 3) the height of trees is taken into account in regions near the viewpoint. 4) allowing intersections of terrain models with constructions facilitates geometric adjustments and shadowing.
Parallel solution of pentadiagonal systems using generalized odd-even elimination
Authors: C. Levit
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

A new method for the solution of pentadiagonal systems of linear equations is presented. The method is a generalization of ordinary odd-even elimination used for tridiagonal systems. Using n processors, an n X n pentadiagonal system can be solved using the new method (generalized odd-even elimination) in time proportional to log2 n.
A general sequential time-space tradeoff for finding unique elements
Authors: P. Beame
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

An optimal &OHgr;(n2) lower bound is shown for the time-space product of any R-way branching program that determines those values which occur exactly once in a list of n integers in the range [1, R] where R &ge; n. This &OHgr;(n2) tradeoff also applies to the sorting problem and thus improves the previous time-space tradeoffs for sorting. Because the R-way branching program is a such a powerful model these time-space product tradeoffs also apply to all models of sequential computation that have a fair measure of space such as off-line multi-tape Turing machines and off-line log-cost RAMs.
A knowledge-based water purification plant control system
Authors: Yasuyuki Miyajima, Shuichiro Kobayashi, Ryuichi Inaba, Kiichiro Ito
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

A knowledge-based control system has been developed and applied to a water purification plant. The objective of the system is to realize an intelligent supervisory control system that is based on the accumulated knowledge of experts. This control system employs a production system as an expert system. &ldquo;Knowledge&rdquo; required for operating the plant is represented by IF-THEN rules. In order for such an expert system to operate in real time, an on-line interface and environment are required.This paper describes the configuration of the knowledge-based water purification plant control system and results of numerical simulation and on-line operation.
Issues in object database management
Authors: Jacob Stein, Tim Andrews, Bill Kent, Kate Rotzell, Dan Weinreb
Venue: Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications (1990)

While the availability of commercial systems from several vendors indicates maturity in object database management technology, there are numerous issues which remain. This panel will attempt to expose and discuss several of these issues. Part of the performance advantage realized by object database management systems comes from linking application programs with the database management system, and the use of large virtual memory caches. This is acceptable in engineering applications where previously large amounts of data were read from the file system into an application program's data space. However, the potential impact on database integrity of giving application programs direct access to very large database management system caches will be of great concern in commercial applications. How can these concerns be addressed with minimal impact on the performance advantage of object database management? There appear to be two distinct approaches to object query languages: extensions to SQL and programming language extensions. SQL extensions might provide a fast path to a standard, but would have the traditional impedance mismatch problems associated with embedded query languages. Language extensions are elegant in that they use the same syntax as the programming language and do not suffer from impedance mismatch problems. However, language extensions would probably make standards more difficult to arrive at as it would require the coordination of extensions to multiple languages. Which of the approaches is most appropriate? In which order should these two approaches be addressed by the object database vendors and standards bodies? One might argue that a good deal of research in relational theory has had little or no impact on commercial relational systems (e.g., relational dependence theory). From a vendor's perspective, what are the hard, interesting research issues whose resolution would allow you to build better systems?
Application of metasystem transition to function inversion and transformation
Authors: R. Glueck, V. F. Turchin
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

We proved by construction an application considered theoretically by Turchin [7] that self-application of metacomputation will allow the automatic construction of inverse algorithms, in particular the algorithm of binary subtraction from the algorithm of binary addition. Further, we will present results concerning the algorithmic construction of an efficient pattern matcher, which leads to the Knuth, Morris and Pratt algorithm. These results were achieved with the first working model of a self-applicable supercompiler system, implementing the concept of metacomputation.
Type inference with subtypes
Authors: R. Stansifer
Venue: Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1988)

We give an algorithm for type inference in a language with functions, records, and variant records. A similar language was studied by Cardelli who gave a type checking algorithm. This language is interesting because it captures aspects of object-oriented programming using subtype polymorphism. We give a type system for deriving types of expressions in the language and prove the type inference algorithm is sound, i.e., it returns a type derivable from the proof system. We also prove that the type the algorithm finds is a &ldquo;principal&rdquo; type, i.e., one which characterizes all others. The approach taken here is due to Milner for universal polymorphism. The result is a synthesis of subtype polymorphism and universal polymorphism.
Modeling and Analysis of the Behavior of Information Systems
Authors: G. Lausen
Venue: IEEE Transactions on Software Engineering (1988)

Many widely used specification techniques for information systems are based on a hierarchy of information flow diagrams. A method is introduced which preserves the benefits of these techniques and adds the precision of the Petri net formalism. Information-flow diagram hierarchies are formalized by notions of net theory. The bottom-level nets of a hierarchy are treated as Petri nets. The behavior model of the information system is the Petri net derived by repeatedly replacing each part of a net by its associated refinement. As a prerequisite for such replacements, the data abstractions relation information flows of different level are specified by a semantic hierarchy data model. The nets in the hierarchy are appended by dynamic counterparts of the abstractions so that a consistent replacement becomes possible. The interface behavior of the nets in the hierarchy is analyzed, using the concept of behavior constraints as a formal measure of correct interface behavior. The behavior model can be derived in an iterative bottom-up way by first analyzing a net for fulfillment of its associated behavior constraint and afterward integrating it into the next-higher-level net.
Visualizing relativistic effects in spacetime
Authors: P.-K. Hsiung, R. H. P. Dunn
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

We have developed an innovative ray-tracing algorithm to describe Relativistic Effects in SpaceTime (&ldquo;REST&rdquo;). Our algorithm, called REST-frame, simulates a generalized world in Spacetime and gives the fine details implicit in the Special Theory of Relativity that have not yet been made apparent. These novel simulations disclose the non-intuitive realm of Special Relativity and, by visualization means, advance beyond the findings of past revelations concerning relativistic effects. Through the application of state-of-the-art computation technology and simulation techniques to earlier quests in Physics, REST-frame offers a flexible visualization tool to study some of the most exciting aspects of the natural world; particularly, the rich visual properties associated with the finite speed of light.
Triangles in space or building (and analyzing) castles in the Air
Authors: B. Aronov, M. Sharir
Venue: Proceedings of the fourth annual symposium on Computational geometry (1988)

We show that the combinatorial complexity of all non-convex cells in an arrangement of n (possibly intersecting) triangles in 3-space is &Ogr;(n7/3+&dgr;), for any &dgr;>0, and that this bound is almost tight in the worst case. Our bound significantly improves a previous nearly cubic bound of Pach and Sharir. We also present a (nearly) worst-case optimal randomized algorithm for calculating a single cell of the arrangement, analyze some special cases of the problem where improved bounds (and better algorithms) can be obtained, and describe applications of our results to translational motion planning for polyhedra in 3-space.
Using GELO to visualize software systems
Authors: S. P. Reiss, S. Meyers, C. Duby
Venue: Proceedings of the 2nd annual ACM SIGGRAPH symposium on User interface software and technology (1989)

GELO is a package that supports the interactive graphical display of software systems. Its features include built-in panning and zooming, abstraction of objects too small to see, pick correlation, windowing, and scroll bars. GELO creates a hierarchy of graphical objects that correspond to the components of the structure being displayed. Five flavors of graphical objects are supported, including those for simple structures, tiled layouts, and graph-based layouts. This framework is powerful enough to handle a wide variety of graphical visualizations, and it is general enough that new object flavors can be smoothly integrated in the future. GELO is easy to learn and to use, and is presently employed in two software development environments. Among its current applications are a variety of visual languages, an interactive display of call graphs, an interactive display of data structures, and a graphical representation of module dependencies.
Intelligent interactive video simulation of a code inspection
Authors: Scott M. Stevens
Venue: Communications of the ACM (1989)

The need for technological solutions to learning, in the software engineering field is increasing. The Advanced Learning Technologies Project (ALT) has developed a highly interactive, high-fidelity simulation of group process communication. The first course demonstrating these techniques is on the formal technical review known as code inspection.
SDA: A novel approach to software environment design and construction
Authors: K. Kishida, T. Katayama, M. Matsuo, I. Miyamoto, K. Ochimizu, Nobuo Saito, Johner H. Sayler, K. Torii, L. G. Williams
Venue: Proceedings of the 10th international conference on Software engineering (1988)

A Software Designer's Associate (SDA) is a workstation-based collection of tools which support: 1) the description, evaluation and comparison of software system architectural designs, and 2) cooperation among, and management of, a team of software designers [Ridd87]. Each Software Designer's Associate is a specific instance of a generic facility which supports a team member's design activities, cooperation among team members, and overall team management. It provides a framework for the integration of tools supporting the use of various notations within the context of a particular set of technical and managerial methods. These tools, notations and methods may be adapted to support the needs of a particular project or the habits of an individual developer by selecting the particular tools to be added to the generic facility. The Software Designer's Associate project is a joint effort involving a consortium of researchers from academic and industrial organizations in both Japan and the United States. This paper describes the concept of Software Designer's Associates and the cooperative, international project which is intended to lead to the realization of that concept.
Careful algebraic translations of geometry theorems
Authors: B. Kutzler
Venue: Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation (1989)

Modern application areas like computer-aided design and robotics have revived interest in geometry. The algorithmic techniques of computer algebra are important tools for solving large classes of nonlinear geometric problems. However, their application requires a translation of geometric problems into algebraic form. So far, this algebraization process has not gained special attention, since it was considered &ldquo;obvious&rdquo;. In the context of automated geometry theorem proving, the use of algebraic deduction techniques lead to very promising results, but it seemed to change the nature of proof problems from deciding the validity of a theorem to finding nondegeneracy conditions under which the theorem holds. A careful analysis shows, that this is mainly due to the &ldquo;careless&rdquo; translation method. A careful translation technique is presented that resolves this defect. The usefulness of the new algebraization method is demonstrated on concrete examples, a practical comparison with the former &ldquo;careless&rdquo; translation is done. Keywords: computational analytical geometry, automated geometry theorem proving.
Unification in commutative theories
Authors: Franz Baader
Venue: Journal of Symbolic Computation (1989)

A general framework for unification in ''commutative'' theories is investigated which is based on a categorical reformulation of theory unification. We thus obtain the well-known results for abelian groups, abelian monoids and idempotent abelian monoids as well as some new results as corollaries to a general theorem. In addition, it is shown that constant-free unification problems in ''commutative'' theories are either unitary or of unification type zero and we give an example of a ''commutative'' theory of type zero.
Portable software in modular Pascal
Authors: C. Neusius
Venue: ACM SIGPLAN Notices (1988)

The extension of the programming language Pascal with the concept of separate compilation is widespread but not standardized. To gain portability without loss of this extension, the technique of precompilation is used [EF88], [Br87], [Na87], [PM86]. This means that a (self-defined) extension of Pascal can be translated into a variety of pascal dialects. This paper describes the concepts of the language PM and its programming environment (precompiler and code maintenance system). It was specifically developed as a tool for a research project concerned with heterogeneous computing systems [Ge87].
Algorithmic paradigms: examples in computational geometry
Authors: N. Adlai A. De Pano
Venue: ACM SIGCSE Bulletin (1988)

We present a collection of algorithms that solve problems from the realm of computational geometry to illustrate several basic notions in algorithm design and analysis. Computational geometry is a young discipline that has much to offer both as a field of research and as a source of instruction materials. This paper aims to serve a dual purpose by (a) outlining results that might prick the interest of researchers looking for greener pastures (so to speak) for investigation; and (b) showing the pedagogic value of these results for teachers of algorithm design and analysis.
A neural network for probabilistic information retrieval
Authors: K. L. Kwok
Venue: ACM SIGIR Forum (1989)

This paper demonstrates how a neural network may be constructed, together with learning algorithms and modes of operation, that will provide retrieval effectiveness similar to that of the probabilistic indexing and retrieval model based on single terms as document components.
A loop-free extended Bellman-Ford routing protocol without bouncing effect
Authors: C. Cheng, R. Riley, S. P. R. Kumar, J. J. Garcia-Luna-Aceves
Venue: ACM SIGCOMM Computer Communication Review (1989)

Distributed algorithms for shortest-path problems are important in the context of routing in computer communication networks. We present a protocol that maintains the shortest-path routes in a dynamic topology, that is, in an environment where links and nodes can fail and recover at arbitrary times. The novelty of this protocol is that it avoids the bouncing effect and the looping problem that occur in the previous approaches of the distributed implementation of Bellman-Ford algorithm. The bouncing effect refers to the very long duration for convergence when failures happen or weights increase, and the nonterminating exchanges of messages, or counting-to-infinity behavior, in disconnected components of the network resulting from failures. The looping problems cause data packets to circulate and, thus, waste bandwidth. These undesirable effects are avoided without any increase in the overall message complexity of previous approaches required in the connected part of the network. The time complexity is better than the distributed Bellman-Ford algorithm encountering failures. The key idea in the implementation is to maintain only loop-free paths, and search for the shortest path only from this set.
Distributed testing and measurement across the Atlantic packet satellite network(SATNET)
Authors: K. Seo, J. Crowcroft, P. Spilling, J. Laws, J. Leddy
Venue: Symposium proceedings on Communications architectures and protocols (1988)

The analysis of the test and measurement of TCP/IP performance over the Atlantic Packet Satellite Network (SATNET) is described. Both the methodology and tools as well as the results and their analysis are discussed. Because of the Internetwork nature of the environment, the tests were designed to allow the SATNET Measurement Taskforce to look at the effects of each component of the end-to-end path, e.g., local networks, gateways, SATNET, and protocol layers. Results are given for the IP service provided by SATNET as a function of offered load and for TCP behavior as a function of offered load and the underlying IP service.