ppxscal/embedding_network huggingface dataset:
Safety and translation of relational calculus
Authors: Allen Van Gelder, Rodney W. Topor
Venue: ACM Transactions on Database Systems (TODS) (1991)

Not all queries in relational calculus can be answered sensibly when disjunction, negation, and universal quantification are allowed. The class of relation calculus queries or formulas that have sensible answers is called the domain independent class which is known to be undecidable. Subsequent research has focused on identifying large decidable subclasses of domain independent formulas. In this paper we investigate the properties of two such classes: the evaluable formulas and the allowed formulas. Although both classes have been defined before, we give simplified definitions, present short proofs of their main properties, and describe a method to incorporate equality. Although evaluable queries have sensible answers, it is not straightforward to compute them efficiently or correctly. We introduce relational algebra normal form for formulas from which form the correct translation into relational algebra is trivial. We give algorithms to transform an evaluable formula into an equivalent allowed formula and from there into relational algebra normal form. Our algorithms avoid use of the so-called Dom relation, consisting of all constants appearing in the database or the query. Finally, we describe a restriction under which every domain independent formula is evaluable and argue that the class of evaluable formulas is the largest decidable subclass of the domain independent formulas that can be efficiently recognized.
Simple yet complete heuristics for transforming data flow diagrams into Booch style diagrams
Authors: Swathi C. Solsi, Edward L. Jones
Venue: ACM SIGAda Ada Letters (1991)

This paper presents some simple heuristics for transforming a requirements specification (for a non-real time application) expressed as a data flow diagram (DFD) into a design architecture expressed as an extended Booch diagram. This architecture provides a starting point for subsequent design refinement. The transformations based on simple heuristics were implemented in a research tool. We show that simple things work. We also show that the design architecture satisfies the property of completeness, i.e. all the information in the DFD is preserved in the Booch diagram, and that it has good coupling and cohesion properties. The design architecture is amenable to various design optimizations by automated or manual means.
Determinacy of Generalized Schema
Authors: Richard S. Stevens, David J. Kaplan
Venue: IEEE Transactions on Computers (1992)

R.M. Karp and R.E. Miller's (1966) computation graphs have been widely studied because they are a useful abstraction of multiprocessor computation. A system has the determinacy property if whenever the same set of input streams are entered into the system, the resultant output is the same set of output streams. Karp and Miller showed that computation graphs have this property; N.S. Woo et al. (1984) showed that dataflow schema also have the property of determinacy. A more general model than either of the foregoing, called a multiple component system model (MCSM), is presently defined. It is proved that MCSMs have the determinacy property. Deadlocking is then defined, and some additional properties of deadlocking MCSMs are proved.
Photometric Motion
Authors: Alex Pentland
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The author compares the photometric effects of motion (which is defined as the variation of a point's imaged intensity as a consequence of motion) and the geometric effects of motion (which is defined as the variation in projected surface geometry as a consequence of motion). It is shown that photometric motion provides a cue to surface shape that is potentially as useful as that provided by geometric motion. A simple technique for using this photometric motion information to extract both surface shape and reflectance is developed, and a biological implementation is proposed. How this photometric motion mechanism can be integrated with and used to enhance existing structure-motion algorithms is discussed. Intensity information is sometimes even more important than geometric distortion when estimating the shape of a single, continuous surface that is rotating relative to the observer's frame of reference.
Specification and Verification Using Dependent Types
Authors: F. K. Hanna, N. Daeche, M. Longley
Venue: IEEE Transactions on Software Engineering (1990)

VERITAS/sup +/, a specification logic based on dependent types, is described. The overall aim is to demonstrate how the use of dependent types together with subtypes and datatypes allows the writing of specifications that are clear, concise, and generic. The development of theories of arithmetic, numerals, and iterative structures is described, and the proof of a theorem that greatly simplifies the formal verification of iterative arithmetic structures is outlined. The VERITAS/sup +/ logic is defined by modeling it as a partial algebra within a purely functional metalanguage. Aspects of the computational implementation of the logic and its associated toolset are briefly described.
MAFIA&mdash;an active mail-filter-agent for an intelligent document processing support
Authors: Ernst Lutz, Hans V. Kleist-Retzow, Karl Hoernig
Venue: ACM SIGOIS Bulletin (1990)

The main goal in the design of intelligent information processing systems is to provide automatic support for the processing of the large amount of documents, today's office workers are confronted with. Existing message filtering systems can provide this support only if the messages to be processed are at least semi-structured.The MAFIA System (MAil-FIlter-Agent) overcomes these limitations of existing message filtering systems by providing an automatic document classification component which recognizes the relevant concepts of weakly structured documents automatically and computes a semantic representation of the document. Using this semantic representation the user is able to specify rules for an effective and content-oriented information processing support.
A framework for industrial layout generators
Authors: Wayne Bower, Carl Seaquist, Wayne Wolf
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

The MACLOG layout generator set is built on an object-oriented framework. Most frameworks are built around the hierarchy of module types. We found the service hierarchy&mdash;the types of information provided to the user by the generator&mdash;made the framework and generators easier to design and modify. This paper describes the MACLOG framework and details our experience with framework structure.
A simple and correct shared-queue algorithm using compare-and-swap
Authors: Janice M. Stone
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

The shared queue is a paradigm of concurrent processes. Because shared queues are central to many multiprocessor systems, their implementations require correctness and efficiency. We present a Compare-and-Swap shared-queue algorithm that permits concurrent access and is nondelaying, in that no processor need wait for an action by another processor. We present a verification method that analyzes the states of the shared data-structure. By drawing a graph that incorporates in a simple way the effects of multi-processor interleaving, one can quickly find errors in an algorithm or produce a proof of correctness. Since enqueue and dequeue operations may begin at any time, concurrent queue operations are represented by providing, in each state of the shared data-structure, one transition that initiates an enqueue operation and another transition for a dequeue operation. The method is a practical one that is applicable to a variety of algorithms that use shared data-structures.
A method for converting abstract objects to discrete objects
Authors: Henry Weidman
Venue: ACM SIGAda Ada Letters (1990)

This paper specifies how to use truth tables to convert abstract objects to discrete objects. An abstract object is defined as an object which has no specific parameters assigned to describe its dimensions. A discrete object has specific well defined parameters which describe its dimensions. A mechanical method for producing program code from a truth table is specified. Procedure steps are provided for using the method. A real world object conversion example is discussed. Program code examples are written in Ada.
Interpolatory integration formulas for optimal composition
Authors: Paola Favati, Grazia Lotti, Francesco Romani
Venue: ACM Transactions on Mathematical Software (TOMS) (1991)

A set of symmetric, closed, interpolatory integration formulas on the interval [-1, 1] with positive weights and increasing degree of precision is introduced. These formulas, called recursive monotone stable (RMS) formulas, allow applying higher order or compound rules without wasting previously computed functional values. An exhaustive search shows the existence of 27 families of RMS formulas, stemming from the simple trapezoidal rule.
Monolithic Architectures for Image Processing and Compression
Authors: Konstantinos Konstantinides, Vasudev Bhaskaran
Venue: IEEE Computer Graphics and Applications (1992)

Programmable IC architectures for image processing applications are reviewed. Chip sets that can be used for image and video compression and for traditional image processing systems like computer-vision systems, chip designs that can handle all three of the major multimedia compression, decompression, and transmission standards, ICs for generic image processing, and uniprocessor and multiprocessor image processing chips are discussed. Requirements for graphics architectures and image processing are outlined.
Heterogeneous and Autonomous Transaction Processing
Authors: Calton Pu, Avraham Leff, Shu-Wie F. Chen
Venue: Computer (1991)

The problems specific to heterogeneous and autonomous transactions processing (HATP) systems are discussed. HATP is divided into three dimensions: distribution, heterogeneity, and autonomy. The authors regard the three dimensions as independent, and they present concrete design and implementation techniques to support this view.
Symbol Error-Correcting Codes for Computer Memory Systems
Authors: C. L. Chen
Venue: IEEE Transactions on Computers (1992)

A method is presented of constructing symbol error correcting codes that have a minimum symbol distance of 4. The method yields some codes that are more efficient than previously known codes. The application is to designing fault-tolerant semiconductor memories.
A linear-time algorithm for testing the inscribability of trivalent polyhedra
Authors: Michael B. Dillencourt, Warren D. Smith
Venue: Proceedings of the eighth annual symposium on Computational geometry (1992)

We present an algorithm for testing the inscribability of a trivalent polyhedron, or, equivalently, testing the circumscribability of a simplicial polyhedron. Our algorithm runs in linear time, using only low-precision integer arithmetic. The algorithm is based on a purely combinatorial characterization of inscribable trivalent polyhedra.
An Efficient Implementation of Boolean Functions as Self-Timed Circuits
Authors: Ilana David, Ran Ginosar, Michael Yoeli
Venue: IEEE Transactions on Computers (1992)

The authors propose a general synthesis method for efficiently implementing any family of Boolean functions over a set of variables, as a self-timed logic module. Interval temporal logic is used to express the constraints that are formulated for the self-timed logic module. A method is provided for proving the correct behavior of the designed circuit, by showing that it obeys all the functional constraints. The resulting circuit is compared with alternative proposed self-timed methodologies. This approach is shown to require less gates than other methods. The proposed method is appropriate for automatic synthesis of self-timed systems. A formal proof of correctness is provided.
3-D Reconstruction Using Mirror Images Based on a Plane Symmetry Recovering Method
Authors: Hiroshi Mitsumoto, Shinichi Tamura, Kozo Okazaki, Naoki Kajimi, Yutaka Fukui
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

Three-dimensional reconstruction from a perspective 2D image using mirrors is addressed. The mirrors are used to form symmetrical relations between the direct image and mirror images. By finding correspondences between them, the 3D shape can be reconstructed by means of plane symmetry recovering method using the vanishing point. Two constraints are used in determining the correspondence. In the case where only one mirror is used, invisible parts both in the direct image and in the mirror image may still remain. Using multiple mirrors, however, occluded parts will decrease or disappear, and occlusion-free object reconstruction becomes possible.
KIDS: A Semiautomatic Program Development System
Authors: D. R. Smith
Venue: IEEE Transactions on Software Engineering (1990)

The Kestrel Interactive Development System (KIDS), which provides automated support for the development of correct and efficient programs from formal specifications, is described. The system has components for performing algorithm design, deductive inference, program simplification, partial evaluation, finite differencing optimizations, data type refinement, compilation, and other development operations. Although their application is interactive, all of the KIDS operations are automatic except the algorithm design tactics, which require some interaction at present. Dozens of programs have been derived using the system, and it is believed that KIDS could be developed to the point where it becomes economical to use for routine programming. To illustrate the use of KIDS, the author traces the derivation of an algorithm for enumerating solutions to the k-queens problem. The initial algorithm that KIDS designed takes about 60 minutes on a SUN-4/110 to find all 92 solutions to the 8-queens problem instance. The final optimized version finds the same solutions in under one second.
A polynomial factorization challenge
Authors: Joachim von zur Gathen
Venue: ACM SIGSAM Bulletin (1992)

In the early 1970s, a major paradigm shift took place in algorithms research, away from experimental results to asymptotic analysis. Knuth popularized the "Big O" notation, and Hopcroft says in his 1986 ACM Turing Award (with Robert Tarjan) address: "During the 1960s, research on algorithms had been very unsatisfying. A researcher would publish an algorithm in a journal along with execution times for a small set of sample problems, and then several years later, a second researcher would give an improved algorithm along with execution times for the same set of sample problems. The new algorithm would invariably be faster, since in the intervening years, both computer performance and programming languages had improved. The fact that the algorithms were run on different computers and programmed in different languages made me uncomfortable with the comparison. It was difficult to factor out both the effects of increased computer performance and the programming skills of the implementors---to discover the effects due to the new algorithm as opposed to its implementation. Furthermore, it was possible that the second researcher had inadvertently tuned his or her algorithm to the sample problems ... I set out to demonstrate that a theory of algorithm design based on worst-case asymptotic performance could be a valuable aid to the practitioner."
Computing Frobenius maps and factoring polynomials
Authors: Joachim von zur Gathen, Victor Shoup
Venue: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing (1992)

A new probabilistic algorithm for factoring univariate polynomials over finite fields is presented whose asymptotic running time improves upon previous results. To factor a polynomial of degree n over Fq, the algorithm uses O((n2 + n log q)&bull;(log n)2 log log n) arithmetic operations in Fq. The main technical innovation is a new way to compute Frobenius and trace maps in the ring of polynomials modulo the polynomial to be factored.
Computing perspectives: software and the programmer
Authors: Maurice V. Wilkes
Venue: Communications of the ACM (1991)

Engineering could not exist without mathematics and experimental science. Mathematics deals in pure thought and experimental science is concerned with the laws of nature. Within the same framework, it may be said that the aim of engineering is to secure control over nature. In some branches of engineering the dependence is very clear. Where, for example, would heat engines be without thermodynamics, radio antenna design without electromagnetic theory, or communications without Fourier analysis? It has long been accepted that the training of an engineer should include a serious study of mathematics and the relevant science, whatever use he or she may subsequently make of this learning.
The Geometry of Basis Sets for Morphologic Closing
Authors: Imants D. Svalbe
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

P. Maragos (1989) provided a framework for the decomposition of many morphologic operations into orthogonal components or basis sets. Using this framework, a method to find the minimal basis set for the important operation of closing in two dimensions is described. The closing basis sets are special because their elements are members of an ordered, global set of closing shapes or primitives. The selection or design of appropriate individual or multiple structuring elements for image filtering can be better understood, and sometimes implemented more easily, through consideration of the orthogonal closing decomposition. Partial closing of images using ordered fractions of a closing basis set may give a finer texture or roughness measure than that obtained from the conventional use of scaled sets of shapes such as the disc. The connection between elements of the basis set for closing and the complete, minimal representation of arbitrary logic functions is analyzed from a geometric viewpoint.
A knowledge acquisition tool for intelligent computer tutors
Authors: Tom Murray, Beverly Park Woolf
Venue: ACM SIGART Bulletin (1991)

This research addresses the widening gap between research in intelligent tutoring systems and practical use of this technology by the educational community. In order to insure that intelligent tutoring systems (ITSs) are effective, teachers must be involved in their design and evaluation. We have followed a user participatory design process to build a set of ITS knowledge acquisition tools tailored for usability by teachers. The system facilitates rapid prototyping and testing of curriculum and multiple tutoring strategies. Teachers use the system to create, modify, and test the system's domain content and tutoring strategy knowledge bases. The design includes novel methodologies for strategy representation and overlay student modeling, and incorporates considerations from instructional design theory. Tools have been designed to provide the user with visual models of the concepts and structures of the underlying framework. In close collaboration with a veteran high school teacher, we have used the interface to design a tutor for statics (part of a high school physics course). In this paper we describe the system (called KAFITS), report on our experience involving educators in ITS development, discuss issues of ITS knowledge representation and acquisition, and compare the system with related research in generic tutoring systems and knowledge acquisition.
Autonomous Robotic Inspection and Manipulation Using Multisensor Feedback
Authors: Mongi A. Abidi, Richard O. Eason, Rafael C. Gonzalez
Venue: Computer (1991)

A six-degree-of-freedom industrial robot to which was added a number of sensors-vision, range, sound, proximity, force/torque, and touch-to enhance its inspection and manipulation capabilities is described. The work falls under the scope of partial autonomy. In teleoperation mode, the human operator prepares the robotic system to perform the desired task. Using its sensory cues, the system maps the workspace and performs its operations in a fully autonomous mode. Finally, the system reports back to the human operator on the success or failure of the task and resumes its teleoperation mode. The feasibility of realistic autonomous robotic inspection and manipulation tasks using multisensory information cues is demonstrated. The focus is on the estimation of the three-dimensional position and orientation of the task panel and the use of other nonvision sensors for valve manipulation. The experiment illustrates the need for multisensory information to accomplish complex, autonomous robotic inspection and manipulation tasks.
Experiments with a Program Timing Tool Based on Source-Level Timing Schema
Authors: Chang Yun Park, Alan C. Shaw
Venue: Computer (1991)

Analytic methods are employed at the source-language level, using formal timing schema that include control costs, handle interferences such as interrupts, and produce guaranteed best- and worst-case bounds. The timing tool computes the deterministic execution times for programs that are written in a subset of C and run on a bare machine. Two versions of the tool were written, using two granularity extremes for the atomic elements of the timing schema. All overview of the tool is given, timing schema and code prediction are discussed, and machine analysis and timing tool design are examined. Experimental and validation results are reported. It was found that all the predicted times are consistent, and most are safe. Some predictions are fairly tight, while others are a little loose. There are clear technical reasons that explain the differences between measured and predicted times, and technical solutions that should minimize these differences within the timing schema framework are seen.
Search problems in the decision tree model (preliminary version)
Authors: László Lovász, Moni Naor, Ilan Newman, Avi Wigderson
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

The relative power of determinism, randomness, and nondeterminism for search problems in the Boolean decision tree model is studied. It is shown that the CNF search problem is complete for all the variants of decision trees. It is then shown that the gaps between the nondeterministic, the randomized, and the deterministic complexities can be arbitrarily large for search problems. The special case of nondeterministic complexity is discussed.
General models and algorithms for over-the-cell routing in standard cell design
Authors: Jason Cong, Bryan Preas, C. L. Liu
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

When an over-the-cell routing layer is available for standard cell layout, efficient utilization of routing space over the cells can significantly reduce layout area. In this paper, we present three physical models to utilize the area over the cells for routing in standard cell designs. We also present efficient algorithms to choose and to route a planar subset of nets over the cells so that the resulting channel density is reduced as much as possible. For each of the physical models, we show how to arrange inter-cell routing, over-the-cell routing and power/ground busses to achieve valid routing solutions. Each algorithm exploits the particular arrangement in the corresponding physical model and produces provably good results in polynomial time. We tested our algorithms on several industrial standard cell designs. In our tests, this method reduces total channel density as much as 21%.