ppxscal/embedding_network huggingface dataset:
An analysis of magic sets and related optimization strategies for logic queries
Authors: Seppo Sippu, Eljas Soisalon-Soininen
Venue: Journal of the ACM (JACM) (1996)

We analyze the optimization effect of the &ldquo;magic sets&rdquo; rewriting technique for datalog queries and present some supplementary or alternative techniques that avoid many shortcomings of the basic technique. Given a magic sets rewritten query, the set of facts generated for the original, nonmagic predicates by the seminaive bottom-up evaluation is characterized precisely. It is shown that&mdash;because of the additional magic facts&mdash;magic sets processing may result in generating an order of magnitude more facts than the straightforward naive evaluation. A refinement of magic sets in factorized magic sets is defined. These magic sets retain most of the efficiency of original magic sets in regards to the number of nonmagic facts generated and have the property that a linear-time bound with respect to seminaive evaluation is guaranteed in all cases. An alternative technique for magic sets, called envelopes, which has several desirable properties over magic sets, is introduced. Envelope predicates are never recursive with the original predicates; thus, envelopes can be computed as a preprocessing task. Envelopes also allow the utilization of multiple sideways information passing strategies (sips) for a rule. An envelope-transformed program may be &ldquo;readorned&rdquo; according to another choice of sips and reoptimized by magic sets (or envelopes), thus making possible an optimization effect that cannot be achieved by magic sets based on a particular choice of sips.
Fundamental Limitations on Projective Invariants of Planar Curves
Authors: Kalle Åström
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

In this paper, some fundamental limitations of projective invariants of non-algebraic planar curves are discussed. It is shown that all curves within a large class can be mapped arbitrarily close to a circle by projective transformations. It is also shown that arbitrarily close to each of a finite number of closed planar curves there is one member of a set of projectively equivalent curves. Thus a continuous projective invariant on closed curves is constant. This also limits the possibility of finding so called projective normalisation schemes for closed planar curves.
Using Partial-Order Methods in the Formal Validation of Industrial Concurrent Programs
Authors: Patrice Godefroid, Doron Peled, Mark Staskauskas
Venue: IEEE Transactions on Software Engineering (1996)

Formal validation is a powerful technique for automatically checking that a collection of communicating processes is free from concurrency-related errors. Although validation tools invariably find subtle errors that were missed during thorough simulation and testing, the brute-force search they perform can result in excessive memory usage and extremely long running times. Recently, a number of researchers have been investigating techniques known as partial-order methods that can significantly reduce the computational resources needed for formal validation by avoiding redundant exploration of execution scenarios. This paper investigates the behavior of partial-order methods in an industrial setting. We describe the design of a partial-order algorithm for a formal validation tool that has been used on several projects that are developing software for the Lucent Technologies 5ESS¯ telephone switching system. We demonstrate the effectiveness of the algorithm by presenting the results of experiments with actual industrial examples drawn from a variety of 5ESS application domains.
Efficient Parallel Algorithms for Chordal Graphs
Authors: Philip N. Klein
Venue: SIAM Journal on Computing (1996)

We give the first efficient parallel algorithms for recognizing chordal graphs, finding a maximum clique and a maximum independent set in a chordal graph, finding an optimal coloring of a chordal graph, finding a breadth-first search tree and a depth-first search tree of a chordal graph, recognizing interval graphs, and testing interval graphs for isomorphism. The key to our results is an efficient parallel algorithm for finding a perfect elimination ordering.
SUBTRACT: a program for the efficient evaluation of substrate parasitics in integrated circuits
Authors: Nishath K. Verghese, David J. Allstot
Venue: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design (1995)

Algorithms for the efficient evaluation of substrate parasitics in mixed-signal integrated circuits have been developed and incorporated in an extraction tool for substrate parasitics, SUBTRACT. Using a preprocessed, polynomial- based boundary element method, SUBTRACT enables the parasitic extraction process to be completely technology independent, allowing for fast evaluation. Additionally, techniques to accelerate the iterative solution of the resulting impedance matrix have been developed and employed to further improve the speed advantages that this method offers. The preprocessed boundary element method is more efficient than finite-difference schemes and orders of magnitude faster than general boundary element methods using a direct evaluation of Green's function. Results of employing SUBTRACT to the design and verification of a mixed-signal A/D converter IC are described.
Efficient parallel recursion
Authors: Per Brinch Hansen
Venue: ACM SIGPLAN Notices (1995)

A simple mechanism is proposed for dynamic memory allocation of a parallel recursive program with Algol-like scope rules. The method is about as fast as the traditional stack discipline for sequential languages. It has been used to implement the parallel programming language SuperPascal.
A high-level design and optimization tool for analog RF receiver front-ends
Authors: Jan Crols, Stéphane Donnay, Michiel Steyaert, Georges Gielen
Venue: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design (1995)

This paper presents a high-level analysis and optimization tool for the design of analog RF receiver front-ends, which takes all design parameters and all aspects of performance degradation (noise, distortion, self-mixing...) into account. The simulations are performed in the spectral domain with a behavioral model library for the RF building blocks. The tool allows to explore alternative RF receiver topologies as well as to investigate design trade-offs within each topology. By having integrated the performance analysis routine within a simulated annealing optimization loop, the tool can also perform an optimal high-level synthesis of a given topology towards a specific application. It then determines the optimal specifications for the RF building blocks such that the required receiver signal quality is met while the overall power and/or area consumption is minimized.
Flow in Planar Graphs with Multiple Sources and Sinks
Authors: Gary L. Miller
Venue: SIAM Journal on Computing (1995)

The problem of maximum flow in planar graphs has always been investigated under the assumption that there is only one source and one sink. Here we consider the case where there are many sources and sinks (single commodity) in a directed planar graph. An algorithm for the case when the demands of the sources and sinks are fixed and given in advance is presented. It can be implemented efficiently sequentially and in parallel and its complexity is dominated by the complexity of computing all shortest paths from a single source in a planar graph. If the demands are not known, an algorithm for computing the maximum flow is presented for the case where the number of faces that contain sources and sinks is bounded by a slowly growing function. Our result places the problem of computing a perfect matching in a planar bipartite graph in NC and it improves a previous parallel algorithm for the case of a single source, single sink in a planar directed1nd undirected) graph, both in terms of processor bounds and in its simple presentation.
Garbage collection using a dynamic threatening boundary
Authors: David A. Barrett, Benjamin G. Zorn
Venue: ACM SIGPLAN Notices (1995)

Generational techniques have been very successful in reducing the impact of garbage collection algorithms upon the performance of programs. However, all generational algorithms occasionally promote objects that later become garbage, resulting in an accumulation of garbage in older generations. Reclaiming this tenured garbage without resorting to collecting the entire heap is a difficult problem. In this paper, we describe a mechanism that extends existing generational collection algorithms by allowing them to reclaim tenured garbage more effectively. In particular, our dynamic threatening boundary mechanism divides memory into two spaces, one for shortlived, and another for long-lived objects. Unlike previous work, our collection mechanism can dynamically adjust the boundary between these two spaces either forward or backward in time, essentially allowing data to become untenured. We describe an implementation of the dynamic threatening boundary mechanism and quantify its associated costs. We also describe a policy for setting the threatening boundary and evaluate its performance relative to existing generational collection algorithms. Our results show that a policy that uses the dynamic threatening boundary mechanism is effective at reclaiming tenured garbage.
What is a procedure call?
Authors: Brian L. Meek
Venue: ACM SIGPLAN Notices (1995)

This third article in a series describing the language-independent work of the ISO/IEC JTC1/SC22 WG11 provides and introduction to the proposed ISQ/IEC 13886 standard, Language Independent Procedure Calling.
Singular Values of Companion Matrices and Bounds on Zeros of Polynomials
Authors: Fuad Kittaneh
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

Let $C(p)$ denote the companion matrix of a monic polynomial $p$ with complex coefficients. Then the zeros of $p$ are exactly the eigenvalues of $C(p)$. In this paper, the singular values of $C(p)$ are computed. Applying some basic eigenvalue-singular value majorization relations, several sharp estimates are obtained for the zeros of $p$ in terms of its coefficients. These estimates improve some classical bounds on zeros of polynomials.
The design philosophy of the DARPA Internet Protocols
Authors: David D. Clark
Venue: ACM SIGCOMM Computer Communication Review (1995)

The Internet protocol suite, TCP/IP, was first proposed fifteen years ago. It was developed by the Defense Advanced Research Projects Agency (DARPA), and has been used widely in military and commercial systems. While there have been papers and specifications that describe how the protocols work, it is sometimes difficult to deduce from these why the protocol is as it is. For example, the Internet protocol is based on a connectionless or datagram mode of service. The motivation for this has been greatly misunderstood. This paper attempts to capture some of the early reasoning which shaped the Internet protocols.
A Fast Algorithm for Computing a Histogram on Reconfigurable Mesh
Authors: Ju-wook Jang, Heonchul Park, Viktor K. Prasanna
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

The reconfigurable mesh captures salient features from a variety of sources, including the CAAPP, the CHiP, the polymorphic-torus network and the bus automaton. It consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns between the processors. In this paper, we present a fast algorithm for computing the histogram of an N×N image with h grey levels in$$O\!\!\left({\bf min}\!\left\{\sqrt h + {\bf log^*} (N/h), N\right\}\!\right)$$time on an N×N reconfigurable mesh assuming each PE has a constant amount of local memory. This algorithm runs on the PARBUS and MRN/LRN models. In addition, histogram modification can be performed in $O(\sqrt h)$ time on the same model.A variant of our algorithm runs in$$O\!\!\left({\bf min}\!\left\{\sqrt {\bf h} + {\bf log\ log} (N/h), N\right\}\!\right)$$time on an N×N RMESH in which each PE has constant storage. This result improves the known time and memory bounds for histogramming on the RMESH model.
Cost-based optimization for magic: algebra and implementation
Authors: Praveen Seshadri, Joseph M. Hellerstein, Hamid Pirahesh, T. Y. Cliff Leung, Raghu Ramakrishnan, Divesh Srivastava, Peter J. Stuckey, S. Sudarshan
Venue: ACM SIGMOD Record (1996)

Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which differ greatly in execution performance. We propose cost-based techniques for selecting an efficient variant from the many choices.Our first contribution is a practical scheme that models magic sets rewriting as a special join method that can be added to any cost-based query optimizer. We derive cost formulas that allow an optimizer to choose the best variant of the rewriting and to decide whether it is beneficial. The order of complexity of the optimization process is preserved by limiting the search space in a reasonable manner. We have implemented this technique in IBM's DB2 C/S V2 database system. Our performance measurements demonstrate that the cost-based magic optimization technique performs well, and that without it, several poor decisions could be made.Our second contribution is a formal algebraic model of magic sets rewriting, based on an extension of the multiset relational algebra, which cleanly defines the search space and can be used in a rule-based optimizer. We introduce the multiset theta;-semijoin operator, and derive equivalence rules involving this operator. We demonstrate that magic sets rewriting for non-recursive SQL queries can be modeled as a sequential composition of these equivalence rules.
Fault Coverage and Test Length Estimation for Random Pattern Testing
Authors: Amitava Majumdar, Sarma B. K. Vrudhula
Venue: IEEE Transactions on Computers (1995)

Fault coverage and test length estimation in circuits under random test is the subject of this paper. Testing by a sequence of random input patterns is viewed as sequential sampling of faults from a given fault universe. Based on this model, the probability mass function ($\mbi{pmf}$) of fault coverage and expressions for all its moments are derived. This provides a means for computing estimates of fault coverage as well as determining the accuracy of the estimates. Test length, viewed as waiting time on fault coverage, is analyzed next. We derive expressions for its $\mbi{pmf}$ and its probability generating function ($\mbi{pgf}$). This allows computation of all the higher order moments. In particular, expressions for mean and variance of test length for any specified fault coverage are derived. This is a considerable enhancement of the state of the art in techniques for predicting test length as a function of fault coverage. It is shown that any moment of test length requires knowledge of all the moments of fault coverage, and hence, its $\mbi{pmf}$. For this reason, expressions for approximating its expected value and variance, for user specified error bounds, are also given. A methodology based on these results is outlined. Experiments carried out on several circuits demonstrate that this technique is capable of providing excellent predictions of test length. Furthermore it is shown, as with fault coverage prediction, that estimates of variances can be used to bound average test length quite effectively.Index Terms¿Fault coverage, test length, urn models, occupancy, waiting time.
A hybrid approach to software reuse
Authors: Sanjay Bhansali
Venue: ACM SIGSOFT Software Engineering Notes (1995)

We describe a hybrid approach to software reuse in an ongoing project that addresses a challenging software engineering task. The approach is driven by an architectural design and makes use of both code components and program synthesis technology. We describe criteria that were used in choosing the reuse strategy for different parts of the application and argue that to be successful a reuse strategy must be driven by the needs of an application program instead of adapting a software development strategy around a reuse program.
Emerging security issues involving the presence of microphones and video cameras in the computing environment
Authors: Sam Nitzberg
Venue: ACM SIGSAC Review (1996)

Microphones and video cameras are becoming more common accessories in the modern computing environment. As their popularity has been increasing, little has been said regarding any new security problems which may be created by their presence. My intention is to examine security problems that their presence may contribute to, and assess their severity, as well as possible remedies.
A logical framework for software proof reuse
Authors: Joshua E. Caplan, Mehdi T. Harandi
Venue: ACM SIGSOFT Software Engineering Notes (1995)

We describe a logical framework PR for verification of reusable software components. Within our system, developers can employ the advantages traditionally associated with software reuse to reduce the cost of software verification by reusing abstract proofs and specifications. One can construct an algorithm with parameters, a specification with parameters, and a proof that the algorithm satisfies the specification provided the parameters satisfy certain conditions. Proofs in PRwill themselves contain parameters for subproofs concerning those conditions. In this framework, typing, type checking, and proof checking are decidable.
The basic object system: supporting a spectrum from prototypes to hardened code
Authors: Allen Dutoit, Sean Levy, Douglas Cunningham, Robert Patrick
Venue: ACM SIGPLAN Notices (1996)

BOS is a prototype-based, object-oriented toolkit aimed at better supporting evolutionary software development. BOS attempts to support a spectrum of activities in one environment---ranging from rapid prototyping to code hardening. Features enabling rapid prototyping include a prototype-based object model, an interpreted language, run-time argument constraints, position and keyword arguments, and a user interface toolkit. BOS also provides features for code hardening such as multi-methods, multiple inheritance, external code wrapping mechanisms, and interfaces to other packages such as database management systems. BOS thus enables the end-to-end programming of software in an integrated and unified environment. BOS has been used to develop several full-size applications which have been evaluated and delivered externally.
Real time validation of man-in-the-loop simulations
Authors: William C. Hopkinson, José A. Sepúlveda
Venue: Proceedings of the 27th conference on Winter simulation (1995)

The objective of this research is to develop a methodology which allows the user to validate the decisions of the man in the loop dynamically in real time by reducing type II errors. Case-based reasoning provides a modeling paradigm for designing a system which can aid in the validation process. This paradigm provides for a mechanism to capture cases that can be used in the validation process. A proof of principle demonstration is being developed that operationally validates the decisions made by a military commander in a high resolution simulation. This demonstration will establish the ability of an expert system to operate in real time and assist in the validation process.
A grid-enabled MPI: message passing in heterogeneous distributed computing systems
Authors: Ian Foster, Nicholas T. Karonis
Venue: Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM) (1998)

Application development for high-performance distributed computing systems, or computational grids as they are sometimes called, requires ``grid-enabled" tools that hide mundane aspects of the heterogeneous grid environment without compromising performance. As part of an investigation of these issues, we have developed MPICH-G, a grid-enabled implementation of the Message Passing Interface (MPI) that allows a user to run MPI programs across multiple computers at different sites using the same commands that would be used on a parallel computer. This library extends the Argonne MPICH implementation of MPI to use services provided by the Globus grid toolkit. In this paper, we describe the MPICH-G implementation and present preliminary performance results.
Closedness properties in ex-identification
Authors: Kalvis Apsītis, Rīsiņš Freivalds, Raimonds Simanovskis, Juris Smotrovs
Venue: Theoretical Computer Science (2001)

In this paper we investigate in which cases unions of identifiable classes are also necessarily identifiable. We consider identification in the limit with bounds on mindchanges and anomalies. Though not closed under the set union, these identification types still have features resembling closedness. For each of them we and n such that (1) if every union of n &minus; 1 classes out of U1, ... , Un is identifiable, so is the union of all n classes; (2) there are classes U1, ... ,Un&minus;1 such that every union of n&minus;2 classes out of them is identifiable, while the union of n &minus; 1 classes is not. We show that by finding these n we can distinguish which requirements put on the identifiability of unions of classes are satisfiable and which are not. We also show how our problem is connected with team learning. Copyright 2001 Elsevier Science B.V. All rights reserved.
In Computers and Cyberspace: A Comprehensive Guide to Exciting Careers Open to You in Computers or Computer-Related Fields
Authors: Harry Henderson
Venue:  (1999)

:Career Opportunities in Computers and Cyberspace is the most comprehensive and up-to-date guide in this challenging and diverse field. In it you'll find indispensable and realistic information on more than 80 specific jobs.. "For each position detailed, you'll find a Career Profile presenting an overview of the salient features of the job (duties, alternate titles, salary range, employment and advancement prospects, and prerequisites); a Career Ladder illustrating frequent routes to and from the position described; and a comprehensive text pointing out special skills, education, training, and various associations relevant to each job. Each entry offers a special Cross-Training chart to locate other jobs in your area of interest.
Microsoft Office 4 for Windows for Dummies, 1st edition
Authors: Roger C. Parker
Venue:  (1994)

:With its Word word processing software, Excel spreadsheet, Access database, PowerPoint presentation graphics package, and Microsoft Mail e-mail program, Microsoft Office is one of the best and most popular productivity suites available for Macintosh and Windows platforms. Now, with Microsoft Office 4 For Windows For Dummies, you can get the most out of this impressive array of premier applications. Author Roger C. Parker reveals his quick and simple strategies for sharing information among documents, collaborating electronically with your workgroup, setting up document templates and boilerplate text to save time and ensure consistency, developing a flexible customer and prospect database, and even creating winning presentations and proposals. Whether you just want a simple answer to a simple question or you want some smart techniques for working smarter, Microsoft Office 4 For Windows For Dummies has just what you need.
Field Guide to Microsoft PowerPoint for Windows 95
Authors: Stephen L. Nelson
Venue:  (2000)

:Jam-packed with information, illustration, and inspiration, this pocket-size easy-access reference gives you step-by-step coverage of all the essential tasks, terms, and techniques you need to quickly get to work using PowerPoint. Experience Level: Beginner/ Intermediate