ppxscal/embedding_network huggingface dataset:
A Protocol for Multirendezvous of LOTOS Processes
Authors: Riccardo Sisto, Luigi Ciminiera, Adriano Valenzano
Venue: IEEE Transactions on Computers (1991)

It is noted that the implementation of the multiway rendezvous mechanism of the International Standards Organization (ISO) LOTOS specification language for protocols is very important in the development of tools for the execution of LOTOS. It involves problems such as global knowledge in a distributed environment and distributed agreement. The authors propose a novel algorithm which fully implements the multiway rendezvous of LOTOS within a distributed execution model based on a number of parallel processes. The processes are organized in a hierarchical topology and communicate with each other only by message transfers. The performance of the proposed algorithm is evaluated and is shown to be better than that achieved by other algorithms proposed in the literature. A formal specification of the algorithm in LOTOS is provided.
A hybrid Distributed Centralized System Structure for Transaction Processing
Authors: B. Ciciani, D. M. Dias, B. R. Iyer, P. S. Yu
Venue: IEEE Transactions on Software Engineering (1990)

A hybrid system structure comprised of distributed systems to take advantage of locality of reference and a central system to handle transactions that access non-local data is examined. Several transaction processing applications, such as reservation systems, insurance and banking have such regional locality of reference. A concurrency and coherency control protocol that maintains the integrity of the data and performs well for transactions that access local or non-local data is described. It is shown that the performance of the hybrid system is much less sensitive to the fraction of remote accesses than the distributed system and offers similar performance to the distributed system for local transactions.
Yet another note on minimal covers
Authors: Jyrki Nummenmaa, Peter Thanisch
Venue: ACM SIGMOD Record (1990)

In [Atk88] Atkins corrects a widely spread error in the algorithm for finding a minimal cover for a given set of functional dependencies. The erroneous form of the algorithm has been presented in [Sa186,StW83,Ul182,Yan88]. Unfortunately, though, there is an error also in the corrected algorithm. Atkins proposed the following algorithm for determining a minimal cover for a given set of functional dependencies F.
Multiple Widths Yield Reliable Finite Differences (Computer Vision)
Authors: Margaret M. Fleck
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A finite difference edge finder in which the finite difference is computed at a range of widths, i.e. a range of distances between data points, is introduced. Wide operators report low-amplitude responses more reliably than narrow operators, so if wide operators are used to fill gaps in narrow operator responses, each operator can be restricted to report only statistically reliable responses without losing many real features. This sharply reduces the noise in the final output. Theoretical bounds on spurious responses in the finite difference outputs, given only weak assumptions about the signal and noise, are presented. The expected response of the edge finder to an ideal straight step edge is also analyzed. These performance measures are compared with those of a standard algorithm based on Gaussian smoothing and those of a second algorithm that also considers the spatial structure of noise. The algorithms prove equally good at suppressing noise, but are better able to detect faint or blurred features. These predictions are confirmed by empirical tests on real images.
On the Problem of Local Minima in Backpropagation
Authors: Marco Gori, Alberto Tesi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The authors propose a theoretical framework for backpropagation (BP) in order to identify some of its limitations as a general learning procedure and the reasons for its success in several experiments on pattern recognition. The first important conclusion is that examples can be found in which BP gets stuck in local minima. A simple example in which BP can get stuck during gradient descent without having learned the entire training set is presented. This example guarantees the existence of a solution with null cost. Some conditions on the network architecture and the learning environment that ensure the convergence of the BP algorithm are proposed. It is proven in particular that the convergence holds if the classes are linearly separable. In this case, the experience gained in several experiments shows that multilayered neural networks (MLNs) exceed perceptrons in generalization to new examples.
On finding the closest bitwise matches in a fixed set
Authors: Peter Klier, Richard J. Fateman
Venue: ACM Transactions on Mathematical Software (TOMS) (1991)

In a given large fixed table of bit-vectors, we would like to find, as rapidly as possible, those bit-vectors which have the least Hamming distances from a newly-presented arbitrary bit-vector.
Quantization Error in Hexagonal Sensory Configurations
Authors: Behzad Kamgar-Parsi, Behrooz Kamgar-Parsi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The authors develop mathematical tools for estimating quantization error in hexagonal sensory configurations. These include analytic expressions for the average error and the error distribution of a function of an arbitrary number of independently quantized variables. These two quantities are essential for assessing the reliability of a given algorithm. They can also be used to compare the relative sensitivity of a particular algorithm to quantization error for hexagonal and other spatial samplings, e.g., square, and can have an impact on sensor design. Furthermore, it is shown that the ratio of hexagonal error to square error is bounded between 0.90 and 1.05.
Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2/sup m/)
Authors: M. Anwarul Hasan, Muzhong Wang, Vijay K. Bhargava
Venue: IEEE Transactions on Computers (1992)

Structures for parallel multipliers of a class of fields GF(2/sup m/) based on irreducible all one polynomials (AOP) and equally spaced polynomials (ESP) are presented. The structures are simple and modular, which is important for hardware realization. Relationships between an irreducible AOP and the corresponding irreducible ESPs have been exploited to construct ESP-based multipliers of large fields by a regular expansion of the basic modules of the AOP-based multiplier of a small field. Some features of the structures also enable a fast implementation of squaring and multiplication algorithms and therefore make fast exponentiation and inversion possible. It is shown that, if for a certain degree, an irreducible AOP as well as an irreducible ESP exist, then from the complexity point of view, it is advantageous to use the ESP-based parallel multiplier.
Biosphere 2 nerve system
Authors: Rocky L. Stewart
Venue: Communications of the ACM (1991)

Biosphere 2 (Earth being Biosphere 1) is an experiment in closed system ecology. It is a steel and glass structure about the size of three football fields and has a volume of more than three million cubic feet. The purpose of the project is to demonstrate the viability of materially closed ecosystems&mdash;a sort of bioregenerative life support system&mdash;where water, air, and food are recycled. Later this year, eight people, called Biospherians, will be sealed inside Biosphere 2 for two years with only power and information being exchanged with the outside. A major part of this project is an expert system-based environmental control and monitoring system called the &ldquo;Nerve System.&rdquo;
The standards factor: catching up with committees
Authors: Pat Billingsley
Venue: ACM SIGCHI Bulletin (1991)

New standards committees are springing up left and right, old standards committees are releasing documents with abandon, and global demand for standards is increasing; meanwhile, the SIGCHI community waits breathlessly for information. Perhaps I exaggerate, but it does seem to be time once again to bring you the latest news from user interface standards committees around the world.
A Management Tool for Evaluation of Software Design
Authors: Sergio Cárdenas-García, Marvin V. Zelkowitz
Venue: IEEE Transactions on Software Engineering (1991)

A model for evaluating software designs based on extending the functional model of program verification with concepts from economic decision theory has been proposed. The authors describe the method, and discuss a prototype implementation of a tool, called Selector, which implements this technique. It is suggested that a system like Selector can be used in two ways: as a decision support system for management to be used in the process of making choices among various alternatives; and as a prototyping investigative system for proposing and answering a series of 'what if' scenarios. The proposed model depends on a risk analysis, of each potential solution and aspects of decision theory to modify the evaluation strategy. The model depends on equilibrium probabilities for generating answers.
Efficient Evaluation of Multiple Linear Recursions
Authors: Jiawei Han, Ling Liu
Venue: IEEE Transactions on Software Engineering (1991)

The authors study the efficient evaluation of side-coherent multiple linear recursions, which can be further classified into three types: multiple one-sided, multiple balanced k-sided, and multiple mixed k-sided. New techniques are developed by integrating the existing single-linear recursive query evaluation methods with the idea of side-relation unioned processing, which leads to a set of efficient query evaluation algorithms such as a side-relation unioned transitive closure algorithm for the processing of Type I ML recursions and a generalized side-relation unioned magic sets method for the processing of Types II and III ML recursions. The authors describe the processing of single-probe queries on side-coherent ML recursions. They outline the processing of complex queries on ML recursions.
A context for designing adaptations: the multioriented structured task analysis (MOST) methodology
Authors: James A. Carter,  Jr., James P. Hancock
Venue: ACM SIGCHI Bulletin (1991)

The Multi-Oriented Structured Task analysis (MOST) methodology attempts to be most things to most of its users most of the time by balancing the needs for completeness and consistency of structured specifications with the needs of both system designers and system users for flexibility and adaptivity. The MOST methodology structures a task analysis and integrates it with other more formal specification methodologies including software engineering methodologies, human-computer interaction methodologies, and explicit user models. MOST stores these specifications in a knowledge base of four major interlinked foci for the information (users, tasks, data, and tools) and an optional foci (constraints) that can be linked to any of the major foci. The linkages in a MOST knowledge base facilitate the flexible structuring and restructuring of records. These linkages can model alternative designs and/or paths by which a system can adapt its interface while maintaining functional consistency. Various design heuristics (both software engineering and human factors) can be applied to an analysis recorded in a MOST knowledge base to assist in its transformation into a suitable design. The MOST methodology is designed to cooperate with and to assist the designer rather than to force the user to serve the methodology.
A tool supporting query optimization and program transformation techniques
Authors: John Sieg,  Jr.
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

In this paper we propose the integration of query optimization and program transformation technologies in a second generation optimizer generator called OG. The input to OG is a high-level specification of the strategy transformations done by each module of a query optimizer. OG's design is intended to support the specification and automatic implementation of extensions to data-access languages.
Integrating active concepts into an object-oriented database system
Authors: Stella Gatziu, Andreas Geppert, Klaus R. Dittrich
Venue: Proceedings of the third international workshop on Database programming languages : bulk types persistent data: bulk types persistent data (1992)

This paper describes the active, object-oriented database system SAMOS being developed as a research prototype. Its main approach is the integration of rules in the sense of active database systems into a general object-oriented data model. Our effort is also focussed on integrating the rule system with transaction processing in a meaningful way.
Defining Software by Continuous, Smooth Functions
Authors: Richard A. DeMillo, Richard J. Lipton
Venue: IEEE Transactions on Software Engineering (1991)

A simple proof is given, showing that for every operational description of a software system expressed as a discrete state transition function on a virtual machine, there is a continuous smooth function on the reals that agrees with the state transition function on all legal states and has exactly the same complexity. It is suggested that an implication of this result is that there is no reason, in principle, that the methods of classical analysis cannot be used in software engineering.
Using type transformation in database system implementation
Authors: Leonidas Fegaras, David Stemple
Venue: Proceedings of the third international workshop on Database programming languages : bulk types persistent data: bulk types persistent data (1992)

We propose the use of semi-automatic methods for the translation of abstract database programs into efficient lower level user-defined primitives. We present a type transformation model for use in defining and facilitating the query translation and optimization process. We discuss how this model can be used also as a framework for schema evolution and data restructuring.
An Onlognloglogn algorithm for the on-line closest pair problem
Authors: Christian Schwarz, Michiel Smid
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

Let V be a set of n points in k-dimensional space. It is shown how the closest pair in V can be maintained under insertions in O(log n log log n) amortized time, using O(n) amortized time, using O(n) space. Distances are measured in the Lt-metric, where 1 &le; &infin; . This gives an O(n log n log log n0 time on-line algorithm or computing the closest pair. The algorithm is based on Bentley's logarithmic method for decomposable searching problems. It uses a non-trivial extension of fractional cascading to k-dimensional space.
Analyzing Partition Testing Strategies
Authors: Elaine J. Weyuker, Bingchiang Jeng
Venue: IEEE Transactions on Software Engineering (1991)

Partition testing strategies, which divide a program's input domain into subsets with the tester selecting one or more elements from each subdomain, are analyzed. The conditions that affect the efficiency of partition testing are investigated, and comparisons of the fault detection capabilities of partition testing and random testing are made. The effects of subdomain modifications on partition testing's ability to detect faults are studied.
A progressive multi-pass method for global illumination
Authors: Shenchang Eric Chen, Holly E. Rushmeier, Gavin Miller, Douglass Turner
Venue: Proceedings of the 18th annual conference on Computer graphics and interactive techniques (1991)

A new progressive global illumination method is presented which produces approximate images quickly, and then continues to systematically produce more accurate images. The method combines the existing methods of progressive refinement radiosity, Monte Carlo path tracing and light ray tracing. The method does not place any limitation on surface properties such as ideal Lambertian or mirror-like. To increase efficiency and accuracy, the new concepts of light source reclassification, caustics reconstruction, Monte Carlo path tracing with a radiosity preprocess and an interruptible radiosity solution are introduced. The method presents the user with most useful information about the scene as early as possible by reorganizing the method into a radiosity pass, a high frequency refinement pass and a low frequency refinement pass. The implementation of the method is demonstrated, and sample images are presented.
Programming language RIGAL as a compiler writing tool
Authors: M. I. Auguston
Venue: ACM SIGPLAN Notices (1990)

A new programming language for compiler writing is described briefly in this paper. The main data structures are atoms, lists and trees. The control structures are based on a advanced pattern matching. All phases of compilation, including parsing, optimization and code generation, can be programmed in this language in short and readable form.
Hierarchical splatting: a progressive refinement algorithm for volume rendering
Authors: David Laur, Pat Hanrahan
Venue: Proceedings of the 18th annual conference on Computer graphics and interactive techniques (1991)

This paper presents a progressive refinement algorithm for volume rendering which uses a pyramidal volume representation. Besides storing average values, the pyramid stores estimated error, so an octtree can be fit to the pyramid given a user-supplied precision. This octtree is then drawn using a set of splats, or footprints, each scaled to match the size of the projection of a cell. The splats themselves are approximated with RGBA Gouraud-shaded polygons, so that they can be drawn efficiently on modern graphics workstations. The result is a real-time rendering algorithm suitable for interactive applications.
Graphical styles for building interfaces by demonstration
Authors: Osamu Hashimoto, Brad A. Myers
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

Conventional interface builders allow the user interface designer to select widgets such as menus, buttons and scroll bars, and lay them out using a mouse. Although these are conceptually simple to use, in practice there are a number of problems. First, a typical widget will have dozens of properties which the designer might change. Insuring that these properties are consistent across multiple widgets in a dialog box and multiple dialog boxes in an application can be very difficult. Second, if the designer wants to change the properties, each widget must be edited individually. Third, getting the widgets laid out appropriately in a dialog box can be tedious. Grids and alignment commands are not sufficient. This paper describes Graphical Tabs and Graphical Styles in the Gild interface builder which solve all of these problems. A &ldquo;graphical tab&rdquo; is an absolute position in a window. A &ldquo;graphical style&rdquo; incorporates both property and layout information, and can be defined by example, named, applied to other widgets, edited, saved to a file, and read from a file. If a graphical style is edited, then all widgets defined using that style are modified. In addition, because appropriate styles are inferred, they do not have to be explicitly applied.
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
Authors: J. F. Pekny, D. L. Miller
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

A parallel branch and bound algorithm that solves the asymmetric traveling salesman problem to optimality is described. The algorithm uses an assignment problem based lower bounding technique, subtour elimination branching rules, and a subtour patching algorithm as an upper bounding procedure. The algorithm is organized around a new data flow framework for parallel branch and bound. Computational results are presented for problem sizes from 500 to 7500 cities with cost matrix elements randomly drawn from a uniform distribution of integers in the range [0,1000] and [0,10000].
Parametrized algorithm decomposition and performance analysis
Authors: Gary J. Harkin
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

A unique decomposition model using two-task replacement sets is used to model algorithm decomposition and algorithm performance. This technique provides a parametric representation of decomposition and performance analysis that is more general and powerful than previous methods. The model is used to investigate the performance of algorithms for MIMD architectures, and the results include statistical descriptions of task and synchronization penalty behavior under decomposition and analytical representations of algorithm performance. The analysis provides insight into the effect of decomposition on performance at both the local task and global algorithm levels. This information would be useful to those interested in compiler technology or algorithm development tools.
JOSIE: an integration of specialized representation and reasoning tools
Authors: Robert Nado, Jeffrey Van Baalen, Richard Fikes
Venue: ACM SIGART Bulletin (1991)

We present an overview of an implemented knowledge system development tool, called JOSIE, that provides a general framework for integrating specialized representation and reasoning facilities. In our presentation we emphasize the problematic issues that arise when integrating specialized representations and the distinctive features of the facilities included in the system. The current system includes assertion, retraction, and query facilities using a predicate-calculus style interface language, a default sentential representation for the interface language, an inference rule language and forward chaining interpreter based on the interface language, a justification-based truth maintenance system that supports restricted nonmonotonic proofs, a frame-based specialized representation system that provides arbitrarily nested slot descriptions and default slot values, and a constraint language and reasoner within the frame system that provides both constraint propagation and symbolic solution of linear equations via Gaussian elimination.
Experimental analysis of communication/data-conditional aspects of a mixed-mode parallel architecture via synthetic computations
Authors: Samuel A. Fineberg, Thomas L. Casavant, Howard Jay Siegel
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

Experimentation aimed at determining the potential benefit of mixed-mode SIMD/MIMD parallel architectures is reported. The experimentation is based on timing measurements made on the PASM system prototype at Purdue utilizing carefully coded synthetic variations of a well-known algorithm. The synthetic algorithms used to measure and evaluate this system were based on bitonic sorting of sequences stored in the processing elements. This computation was mapped to both the SIMD and MIMD modes of parallelism, as well as two hybrids of the SIMD and MIMD modes. The computations were coded in these four ways and experiments were performed that explore the trade-offs among them. The results of these experiments are presented and are discussed with special consideration of the effects of the system's architecture. The goal is to (as much as possible) obtain implementation independent analyses of the attributes of mixed-mode parallel processing with respect to the computational characteristics of the application being examined. The results are used to gain insight into the impact of computation mode on synchronization and data-conditional aspects of system performance.
The Literate-Programming Paradigm
Authors: David Cordes, Marcus Brown
Venue: Computer (1991)

Literate programming, a technique for coding software systems that promotes readability and comprehension, is examined in detail. The current literate-programming paradigm is reviewed by looking at two sample literate programs. A critique of literate programming as it is currently used is presented, and methods for enhancing the process are explored. A number of new facilities are proposed, and restrictions on current literate-programming practices are suggested.