ppxscal/embedding_network huggingface dataset:
Using temporal hierarchies to efficiently maintain large temporal databases
Authors: Thomas Dean
Venue: Journal of the ACM (JACM) (1989)

Many real-world applications involve the management of large amounts of time-dependent information. Temporal database systems maintain this information in order to support various sorts of inference (e.g., answering questions involving propositions that are true over some intervals and false over others). For any given proposition, there are typically many different occasions on which that proposition becomes true and persists for some length of time. In this paper, these occasions are referred to as time tokens. Many routine database operations must search through the database for time tokens satisfying certain temporal constraints. To expedite these operations, this paper describes a set of techniques for organizing temporal information by exploiting the local and global structure inherent in a wide class of temporal reasoning problems. The global structure of time is exemplified in conventions for partitioning time according to the calendar and the clock. This global structure is used to partition the set of time tokens to facilitate retrieval. The local structure of time is exemplified in the causal relationships between events and the dependencies between planned activities. This local structure is used as part of a strategy for reducing the computation required during constraint propagation. The organizational techniques described in this paper are quite general, and have been used to support a variety of powerful inference mechanisms. Integrating these techniques into an existing temporal database system has increased, by an order of magnitude or more in most applications, the number of time tokens that can be efficiently handled. &mdash;Author's Abstract
A VLSI Architecture for Fast Inversion in GF(2/sup m/)
Authors: G.-L. Feng
Venue: IEEE Transactions on Computers (1989)

A new algorithm for performing fast inversion in GF (2/sup m/) is presented. The algorithm requires O(mlog/sub 2/ m) computation time. Using serial-in-parallel-out multiplication, the design of the algorithm is highly regular, modular, and well suited for VLSI implementation.
Retrieving highly dynamic widely distributed information
Authors: M. F. Wyle, h. P. Frei
Venue: ACM SIGIR Forum (1989)

Wide area networks provide a variety of information sources which can be exploited only by appropriate information retrieval techniques such as repeated automatic query of remote databases and bulletin boards. Distinctive features of the content and access methods of information on wide area nets are discussed from an IR perspective. The development, algorithms, and analysis of a functioning system are also presented.
On the transformation of logic programs with instantiation based computation rules
Authors: Danny de Schreye, Maurice Bruynooghe
Venue: Journal of Symbolic Computation (1989)

We give a formal description of a new transformation technique for declarative Horn clause programs. Our method allows the compilation of control information. We introduce the notion of an instantiation-based computation rule and present an algorithm to transform a given pair (@?, q), consisting of a Horn clause program P and a query pattern q for @?, into a new program @?"n"e"u, which, for the given query pattern, will behave in the same way, under the standard computation rule of Prolog, as the original program @? behaves under a specified instantiation-based computation rule. We prove the soundness and completeness of the method and discuss its relation to existing techniques for the specification of control rules and the transformation of logic programs.
Automatic tub region generation for symbolic layout compaction
Authors: C.-Y. Lo
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

This paper describes a new algorithm that automatically generates tub regions for VLSI symbolic layouts with quality comparable to that of human designers. The algorithm supports an explicit modeling of enclosure rules in the layout compaction task with the benefit of robustness and reduced output database size. In addition, the algorithm runs at O(n2) time and O(n) space with the expected run time of O(nlogn).
Creating graphical interactive application objects by demonstration
Authors: B. A. Myers, B. V. Zanden, R. B. Dannenberg
Venue: Proceedings of the 2nd annual ACM SIGGRAPH symposium on User interface software and technology (1989)

The Lapidary user interface tool allows all pictorial aspects of programs to be specified graphically. In addition, the behavior of these objects at run-time can be specified using dialogue boxes and by demonstration. In particular, Lapidary allows the designer to draw pictures of application-specific graphical objects which will be created and maintained at run-time by the application. This includes the graphical entities that the end user will manipulate (such as the components of the picture), the feedback that shows which objects are selected (such as small boxes on the sides and corners of an object), and the dynamic feedback objects (such as hair-line boxes to show where an object is being dragged). In addition, Lapidary supports the construction and use of &ldquo;widgets&rdquo; (sometimes called interaction techniques or gadgets) such as menus, scroll bars, buttons and icons. Lapidary therefore supports using a pre-defined library of widgets, and defining a new library with a unique &ldquo;look and feel.&rdquo; The run-time behavior of all these objects can be specified in a straightforward way using constraints and abstract descriptions of the interactive response to the input devices. Lapidary generalizes from the specific example pictures to allow the graphics and behaviors to be specified by demonstration.
The Computational Completeness of Extended Database Query Languages
Authors: Donald A. Varvel, Leonard Shapiro
Venue: IEEE Transactions on Software Engineering (1989)

The computational completeness is demonstrated of certain extended database query languages, namely, POSTGRES and GENESIS, and a language defined by A. Aho and J. Ullman (1979). The method used is to implement a Turing machine interpreter in each of the languages. These query languages were defined as extensions to traditional database languages in order to encompass certain specific new applications. Results show that these extensions have already encompassed all the computational power of any programming language.
Load balancing and task decomposition techniques for parallel implementation of integrated vision systems algorithms
Authors: A. N. Choudhary, J. H. Pater
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

Integrated vision systems employ a sequence of image understanding algorithms in which the output of an algorithm is the input of the next algorithm in the sequence. Algorithms that constitute an integrated vision systems exhibit different characteristics, and therefore, require different data decomposition techniques and efficient load balancing techniques for parallel implementation. However, since input data of a task is produced as output of the previous task, this information can be exploited to perform knowledge based data decomposition and load balancing. This paper presents several techniques to perform static and dynamic load balancing schemes for integrated vision systems. These techniques are novel in the sense that they capture the computational requirements of a task by examining the data when it is produced. Furthermore, they can be applied to many integrated vision systems because many algorithms in different systems are either same or have similar computational characteristics. These techniques are evaluated by applying them to the algorithms in a motion estimation system. It is shown that the performance gains when these techniques are used are significant and the overhead of using these techniques is minimal. The performance is evaluated by implementing the algorithms using the presented techniques on a hypercube multiprocessor system.
Coordinating user interfaces for consistency
Authors: J. Nielsen
Venue: ACM SIGCHI Bulletin (1989)

One of the most important aspects of usability is consistency in user interfaces. Consistency should apply both within the individual application and across complete computer systems and even across product families. Practical methods for coordinating user interface design are not well known, however. To remedy this situation, a workshop on Coordinating User Interfaces for Consistency was held at the ACM CHI'88 conference in Washington, DC, 15--16 May 1988.
The precursors of personal computing
Authors: Larry Press
Venue: ACM SIGSMALL/PC Notes (1988)

I am compiling an anthology of historical papers which laid the groundwork for today's workstations and personal computers. The following list is preliminary, based mostly on personal recollection and a little library research and suggestions from others.
Surface interaction: a paradigm and model for separating application and interface
Authors: Roger Took
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

From the point of view of the application designer, user interface services work by factoring some domain common to a range of applications, and implementing this separately. Existing services, such as window managers, UIMSs, or toolkits, either lack generality, or are limited in their separability. A new interface paradigm, here called surface interaction, separates application and interface by factoring presentation and its manipulation, rather than dialogue or functionality. The surface is thus a medium which can be controlled equally by the user or by the application. This paper outlines Presenter, an implementation of a model for surface interaction.
Using hypertext to overcome the knowledge base development bottleneck: a case study
Authors: E. A. Roehl, C. R. Hill
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

The installation of a new complex rolling mill used to manufacture the sheet metal to make beverage cans raised concerns about maintaining and troubleshooting the mill's systems. This led to an evaluation of computer-based technologies which could provide the needed diagnostic decision support, including expert and hypertext systems. Expert systems have been demonstrated for a variety of applications including equipment diagostics. Their principal drawback is that they are very costly to develop and maintain for large problems. In hypertext systems, objects in a documentation data base are represented by graphical objects on a computer screen. By manipulating the screen objects, users can display and organize the on-line documentation. The course embarked upon was to construct a hypertext system with the means to build troubleshooting and maintenance aids as well. The Electronics Guidance and Documentation System (EGADS), now operational in the mill, combines a commercially available hypertext system with a custom interface which graphically depicts decision networks. The decision networks convey high level qualitative problem solving knowledge to users, and highly detailed information typical of technical documentation is available through the hypertext system. EGADS was used to develop a diagnostic and maintenance aid for one the mill's major components, the flatness subsystem. Its decision network gives step by step instructions for troubleshooting a wide variety of problems, and provides direct access to appropriate equipment functional descriptions and maintenance documentation. By using the detailed technical documentation available from equipment vendors, the authors conclude that the application they developed required considerably less resources than would be needed to create an expert system with comparable functionality.
The category-partition method for specifying and generating fuctional tests
Authors: T. J. Ostrand, M. J. Balcer
Venue: Communications of the ACM (1988)

A method for creating functional test suites has been developed in which a test engineer analyzes the system specification, writes a series of formal test specifications, and then uses a generator tool to produce test descriptions from which test scripts are written. The advantages of this method are that the tester can easily modify the test specification when necessary, and can control the complexity and number of the tests by annotating the tests specification with constraints.
Computer aided electron beam testing for VLSI circuit analysis
Authors: L. A. Levy, A. P. Milne, A. R. Dinnis
Venue: Microelectronic Engineering (1988)

The program embarked upon aims at providing an integrated debug system for production devices which will reduce the time, effort and skill level required to identify fault locations on VLSI devices. This paper discusses some of the methods employed in attempting to realise this objective. Computer control is widely used in order to speed up the set-up of system parameters and minimise the amount of 'expertise' required to operate the system. Workstation utilities are used in order to simplify the user interface by standardising all system operating procedures to one format. Two image comparison methods are detailed. The first utilises the subtraction approach widely reported for global picture interpretation. The second is a more efficient technique enabling a logic state table of specified conductors to be created and compared for a reference device and a device under test. Finally, a technique utilising video gating together with capacitive coupling voltage contrast is detailed for successfully acquiring dynamic voltage contast images of conductors under layers of passivation. The present limitations of this system and future perspectives for improvement are also highlighted.
Constructing replicated systems using processors with point-to-point communication links
Authors: P. D. Ezhilchelvan, S. K. Shrivastava, A. Tully
Venue: ACM SIGARCH Computer Architecture News (1989)

Replicated processing with majority voting is a well known method of achieving fault tolerance. We consider the problem of constructing a distributed system composed of an arbitrarily large number of N-modular redundant (NMR) nodes, where each node itself is composed of N, N = 2m + 1 and m &ge; 1, processing and voting elements. Advanced microprocessors, such as Inmos Transputers, provide fast serial communication links for inter-processor communication, making it possible to construct large networks of processors. We describe how replicated processing with majority voting can be achieved for such processor networks. This paper will present the overall systems architecture, including voting and NMR synchronization algorithms specially developed to exploit fast point to point communication facilities.
Orwell&mdash;a configuration management system for team programming
Authors: Dave Thomas, Kent Johnson
Venue: ACM SIGPLAN Notices (1988)

In this paper, we describe the design and implementation of Orwell, a configuration management tool for multiperson Smalltalk projects. Although the system described has been implemented for Smalltalk, the design is applicable to other languages such as C++, Objective-C or ADA. Smalltalk is well recognized as a productive programming environment for an individual programmer, but its lack of team support is currently a major obstacle in using Smalltalk for a large software project. To support multiperson Smalltalk programming, Orwell provides both source and object code sharing as well as version control on a network of personal workstations. Class ownership is used as the primary means for dividing work among programmers during the lifecycle of a project. Orwell also supports groups of programmers not physically connected to a common file server. We describe our implementation which preserves the productive exploratory environment of Smalltalk. Seamless integration and performance are essential for Orwell to be accepted and used by Smalltalk programmers.
Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
Authors: M. Coste, M. F. Roy
Venue: Journal of Symbolic Computation (1988)

Thom's lemma, a very simple and basic result in real algebraic geometry, and explained in section I, has a lot of interesting computational consequences. We shall outline two of these. The first one is the fact that a real root @x of a polynomial P of degree n with real coefficients may be distinguished from the other real roots of P by the signs of the derivatives P^i of P at @x, i = 1, ..., n - 1. This offers a new possibility for the coding of real algebraic numbers and for computation with these numbers (see section 2). The second is based on a generalisation of Thom's lemma to the case of several variables. It gives, after a linear change of coordinates, a cylindric algebraic decomposition of a semi- algebraic set where the incidence relation between the cells is easily obtained (see section 3).
An Interpolating Memory Unit for Function Evaluation: Analysis and Design
Authors: A. S. Noetzel
Venue: IEEE Transactions on Computers (1989)

A technique for the evaluation of a general continuous function f(x) is presented, and the design of an interpolating memory as an implementation of the technique is described. The technique partitions the domain of f(x) into segments and defines an interpolating (or approximating) function for each. The implementation is a memory subsystem that holds the parameters of the approximating functions and yields an interpolated function value on each read reference. Polynomial interpolating functions are considered in particular. Hardware requirements (memory and computational logic) are analyzed in terms of the required precision. It is shown that as long as f(x) has d+1 derivatives, where d is the degree of the interpolating polynomial, d+1 additional bits of precision of the computed f(x) are obtained for each additional address bit used in the interpolating memory. This establishes a tradeoff between memory and computational logic, which can be exploited in the design of a unit for a specific function, for any precision requirement. Furthermore, a single unit can be designed for any class of functions that have the required derivatives. Two examples of implementations for particular functions are presented.
A mathematical analysis of the scattered decomposition
Authors: J. Salmon
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

A theoretical basis for the scattered decomposition is worked out in some detail. The basic result has been part of the &ldquo;folklore&rdquo; for some time, but has never been proved. The load imbalance expected from a scattered decomposition of a set of computational tasks is proportional n-1/2&sgr;task/mtask where n is the number of tasks assigned to each processor, mtask is the mean time per task and &sgr;task is the root mean square deviation time per task. The constant of proportionality is of O(1), and is a very slowly increasing function of the number of processors.
Unifying Maximum Cut and Minimum Cut of a Planar Graph
Authors: W.-K. Shih, S. Wu, Y. S. Kuo
Venue: IEEE Transactions on Computers (1990)

The real-weight maximum cut of a planar graph is considered. Given an undirected planar graph with real-value weights associated with its edges, the problem is to find a partition of the vertices into two nonempty sets such that the sum of the weights of the edges connecting the two sets is maximum. The conventional maximum cut and minimum cut problems assume nonnegative edge weights, and thus are special cases of the real-weight maximum cut. An O(n/sup 3/2/ log n) algorithm for finding a real-weight maximum cut of a planar graph where n is the number of vertices in the graph is developed. The best maximum cut algorithm previously known for planar graphs has running time of O(n/sup 3/).
1989 computer graphics education directory
Authors: E. Ferguson
Venue: ACM SIGGRAPH Computer Graphics (1989)

This is SIGGRAPH's fourth directory of college-level computer graphics education, covering courses in computer graphics in several different subjects. This directory is a single source of computer graphics course information. If you are a student entering college or considering a change of studies, a professional considering broadening your skills, or an educator seeking broader contacts in graphics among your peers, this directory is designed for you.We compiled the directory from the responses to a questionnaire sent out this spring, and it is completely updated since the last edition. The responses were separated by topic according to information received on the questionnaire and our perception of the course's audience. The placement of some courses may not be precise, so you may be advised to use more than one directory list in searching for an interesting course. For example, if you are interested in graphics for architects you should consult the Arts, Architecture and Design listings, but you might also find useful information in the list on Engineering, CAD/CAM and Drafting. You should follow up interesting entries by contacting the school directly for the many details of schedule, cost and admission which are not included here. We should point out that our listing is not complete since we do not know of all the computer graphics courses being taught, and some courses listed in previous directories are not here since no information was received on them.The course information we received was placed in individual lists by the following criteria. The Concepts and Systems list contains courses covering general concepts in computer graphics and systems for producing graphics; such courses are often found in Computer Science or EECS programs and have no particular application orientation. The Engineering, CAD/CAM and Drafting list contains courses which seem to be oriented toward applications in these areas. For CAD/CAM and Drafting courses, this is rather easy to tell, while the engineering orientation is inferred from a location in an Engineering program with no other information, or from a title such as "Engineering Computer Graphics." Many engineering programs, however, have courses which seem to fit the Concepts and Systems category most closely and so are listed there. The other lists are fairly easily categorized, except for some problems determining where to place courses in Design; here the home program is usually the determining factor.
The HCN: a versatile interconnection network based on cubes
Authors: K. Ghose, K. R. Desai
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

This paper introduces a family of interconnection networks for loosely-coupled multiprocessors called Hierarchical Cubic Networks (HCNs). HCNs use the well-known hypercube network as their basic building block. Using a considerably lower number of links per node, HCNs realize lower network diameters than the hypercube. The performance of several well-known applications on a hypothetical system employing the HCN is identical to their performance on a hypercube. HCNs thus enjoy the same advantages as a hypercube, albeit with considerably simpler interconnections.