ppxscal/embedding_network huggingface dataset:
Large Join Optimization on a Hypercube Multiprocessor
Authors: E. T. Lin, E. R. Omiecinski, S. Yalamanchili
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Optimizing large join queries that consist of many joins has been recognized as NP-hard. Most of the previous work focuses on a uniprocessor environment. In a multiprocessor, the location of each join adds another dimension to the complexity of the problem. In this paper, we examine the feasibility of exploiting the inherent parallelism in optimizing large join queries on a hypercube multiprocessor. This includes using the multiprocessor not only to answer the large join query but also to optimize it. We propose an algorithm to estimate the cost of a parallel large join plan. Three heuristics are provided for generating an initial solution, which is further optimized by an iterative local-improvement method. The entire process of parallel query optimization and execution is simulated on an Intel iPSC/2 hypercube machine. Our experimental results show that the performance of each heuristic depends on the characteristics of the query.
A Newton Acceleration of the Weiszfeld Algorithm forMinimizing the Sum of Euclidean Distances
Authors: Yuying Li
Venue: Computational Optimization and Applications (1998)

The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweighted least squares method. It generally exhibits linear convergence. In this paper, a Newton algorithm with similar simplicity is proposed to solve a continuous multifacility location problem with the Euclidean distance measure. Similar to the Weiszfeld algorithm, the main computation can be solving a weighted least squares problem at each iteration. A Cholesky factorization of a symmetric positive definite band matrix, typically with a small band width (e.g., a band width of two for a Euclidean location problem on a plane) is performed. This new algorithm can be regarded as a Newton acceleration to the Weiszfeld algorithm with fast global and local convergence. The simplicity and efficiency of the proposed algorithm makes it particularly suitable for large-scale Euclidean location problems and parallel implementation. Computational experience suggests that the proposed algorithm often performs well in the absence of the linear independence or strict complementarity assumption. In addition, the proposed algorithm is proven to be globally convergent under similar assumptions for the Weiszfeld algorithm. Although local convergence analysis is still under investigation, computation results suggest that it is typically superlinearly convergent.
Common Subexpression Processing in Multiple-Query Processing
Authors: Fa-Chung Fred Chen, Margaret H. Dunham
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

The efficiency of common subexpression identification is critical to the performance of multiple-query processing. In this paper, we develop a multigraph for representing and facilitating the processing of multiple queries. In addition to the traditional multiple-query processing approaches in exploiting common subexpressions for identical and subsumption cases, the proposed multigraph processing also covers the overlap case. A performance study shows the viability of this technique when compared to an earlier multigraph approach.
Managing Iteration in OO Projects
Authors: John D. Williams
Venue: Computer (1996)

Why do some companies succeed in managing object-oriented projects and others fail? I have reviewed numerous failed object technology projects, and it is clear to me that the single largest failure is technology management, not the technology itself. When they move to object technology, most companies prepare their technical staffs by sending them to language and object-oriented analysis and design classes. Unfortunately, these same companies often ignore the training needs of the managers who'll be directing those technical staffs. Managers are left to fend for themselves, armed with yesterday's tools and with little insight into the potential of today's technology. Moving to object technology does not mean project managers must discard everything they know. Managers still need to know if their projects are meeting goals, on schedule, or suffering from feature creep. They must still understand overall project goals and keep the project team focused on meeting them. They still must manage customer expectations when it comes to features and delivery schedules. Switching technologies does not make these problems disappear. If you have problems with these issues now, you'll still have problems when you switch to object technology. In this article, I describe several project management issues facing companies switching to object technology and offer ways for managers to cope.
A Primer on Speech Technologies
Venue: IEEE Software (1990)

No abstract available The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Computing 2-D Min, Median, and Max Filters
Authors: J. Gil, M. Werman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Fast algorithms for computing min, median, max, or any other order statistic filter transforms are described. The algorithms take constant time per pixel to compute min or max filters and polylog time per pixel, in the size of the filter, to compute the median filter. A logarithmic time per pixel lower bound for the computation of the median filter is shown.
Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers
Authors: E. R. Omiecinski, E. T. Lin
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The authors compare the performance of two join algorithms on both cube and ring interconnections for message-based multicomputers, and investigate the effects that the number of processors and the type of interconnection scheme have on the performance. First, the parallel hybrid-hash join algorithm and the parallel join-index join algorithm for both the cube and ring connected multicomputers are presented. The performance of these algorithms is then compared through analytical cost modeling. The result shows that the join-index join algorithm gives good performance only when the join selectivity is very small, and the hybrid-hash join algorithm performs consistently well under most situations. It is shown that the cube topology yields better execution time than the same algorithm on the ring topology. Furthermore, increasing the number of processors has a more significant improvement on the execution time of the cube than for the ring configuration. The applicability of join indexes on the parallel database algorithms is also discussed.
Superconvergence analysis for the Navier---Stokes equations
Authors: Xiaoshen Wang, Xiu Ye
Venue: Applied Numerical Mathematics (2002)

This paper derives a general superconvergence result for finite element approximations of the Navier-Stokes problem by using a least-squares surface fitting method proposed and analyzed recently by Wang for the standard Galerkin method. The superconvergence result is based on some regularity assumption for the Navier-Stokes problem and is applicable to any finite element method with quasi-uniform meshes. The method is demonstrated to give a convergent scheme for finite element spaces which fail to satisfy the well-known uniform inf-sup condition of Brezzi and Babuska.
Topological Entropy of Free Semigroup Actions and Skew-Product Transformations
Authors: A. Bufetov
Venue: Journal of Dynamical and Control Systems (1999)

A definition of topological entropy for a free semigroup action is suggested. Suppose that a free semigroup acts on a compact metric space by continuous self-maps. To this action, we assign a skew-product transformation whose fiber entropy is taken to be the entropy of the initial action. The main result is Theorem 1, a topological analogue of the Abramov&ndash;Rokhlin formula.
Semiparametric Estimation of the Fractional Differencing Parameter ofMeasures of the U.K. Unemployment
Authors: Luis A. Gil-Alana
Venue: Computational Economics (2002)

The order of integration of different measures of the U.K. unemployment is investigated in this paper by means of semiparametric techniques. Several methods, such as the R&bsol; S statistic, along with others proposed by Robinson in a number of papers are applied in this article. The methods perform poorly when using the time domain approaches, however, when using the frequency domain procedures, the results are fairly conclusive, with the order of integration of the series fluctuating around 1.50.
Finite linear spaces with b - v ∈ {M, M+ 1}
Authors: Nicola Durante
Venue: Discrete Mathematics (2002)

In this paper finite linear spaces (P,L) with b - υ ∈ {M,M + 1}, M + 1 = maxl∈L|l|, are studied. If b - υ = M those linear spaces are completely classified. If b - υ = M + 1 they are classified for M + 1 different from the order of the linear space.
How ATE Planning Affects LSI Manufacturing Cost
Authors: Koji Nakamae, Homare Sakamoto, Hiromu Fujioka
Venue: IEEE Design Test (1996)

The authors describe ATE planning effects on the total LSI manufacturing costs through simulation analysis, which uses a combination of the event-scheduling approach and detailed parametric models. They show that the method is useful in predicting the cost effects of ATE planning in the LSI manufacturing system.
Power-Aware Localized Routing in Wireless Networks
Authors: Ivan Stojmenovic, Xu Lin
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

Recently, a cost aware metric for wireless networks based on remaining battery power at nodes was proposed for shortest-cost routing algorithms, assuming constant transmission power. Power-aware metrics, where transmission power depends on distance between nodes and corresponding shortest power algorithms were also recently proposed. We define a new power-cost metric based on the combination of both node's lifetime and distance-based power metrics. We investigate some properties of power adjusted transmissions and show that, if additional nodes can be placed at desired locations between two nodes at distance d, the transmission power can be made linear in d as opposed to d^\alpha dependence for \alpha\geq 2. This provides basis for power, cost, and power-cost localized routing algorithms where nodes make routing decisions solely on the basis of location of their neighbors and destination. The power-aware routing algorithm attempts to minimize the total power needed to route a message between a source and a destination. The cost-aware routing algorithm is aimed at extending the battery's worst-case lifetime at each node. The combined power-cost localized routing algorithm attempts to minimize the total power needed and to avoid nodes with a short battery's remaining lifetime. We prove that the proposed localized (where each node makes routing decisions based solely on the location of itself, its neighbors, and destination) power, cost, and power-cost efficient routing algorithms are loop-free and show their efficiency by experiments.
Paging tradeoffs in distributed-shared-memory multiprocessors
Authors: Douglas C. Burger, Rahmat S. Hyder, Barton P. Miller, David A. Wood
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Massively parallel processors have begun using commodity operating systems that support demand-paged virtual memory. To evaluate the utility of virtual memory, we measured the behavior of seven shared-memory parallel application programs on a simulated distributed-shared-memory machine. Our results (i) confirm the importance of gang CPU scheduling, (ii) show that a page-faulting processor should spin rather than invoke a parallel context switch, (iii) show that our parallel programs frequently touch most of their data, and (iv) indicate that memory, not just CPUs, must be "gang scheduled". Overall, our experiments demonstrate that demand paging has limited value on current parallel machines because of the applications' synchronization and memory reference patterns and the machines' high page-fault and parallel-context-switch overheads.
Solving the Java Object Storage Problem
Authors: Douglas Barry, Torsten Stanienda
Venue: Computer (1998)

Today's Internet-driven view of information systems is helping to popularize Java as an application development language. Developers are beginning to use Java to create multitier application architectures that often integrate relational data stores with new data types, in order to package information in easier-to- use, dynamic ways. Java's object-oriented nature is ideally suited to this new world. Using objects, Java developers can encapsulate both data and data manipulation methods to give applications a runtime dynamism and self-contained intelligence that is difficult to achieve using other methods. Java application developers need to be able to store these Java objects-technically, to give them persistence-in order to take advantage of these capabilities. In this article, we examine the development issues surrounding Java object storage, including a brief overview of the ODMG Java binding, a standard that adds object persistence to Java. We compare this with the much greater level of effort required to implement the same application using the lower level JDBC interface, which supports Java object storage in relational databases. The ODMG binding for Java and JDBC are not competitive specifications: ODMG interfaces can be built on top of JDBC.
Angle Densities and Recognition of 3D Objects
Authors: Raashid Malik, Taegkeun Whangbo
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

Recognition of 3D objects using computer vision is complicated by the fact that geometric features vary with view orientation. An important factor in designing recognition algorithms in such situations is understanding the variation of certain critical features such as angles. In this paper we derive the two dimensional joint density function of two angles in a scene given an isotropic view orientation and an orthographic projection. The analytic expression for the densities are useful in determining statistical decision rules to recognize surfaces and objects. Experiments to evaluate the usefulness of the proposed methods are reported.
On the use of stochastic resonance in sine detection
Authors: Steeve Zozor, Pierre-Olivier Amblard
Venue: Signal Processing (2002)

This paper deals with the use of stochastic resonance (SR) for detection purposes. The nonlinear physical phenomenon of SR generally occurs in dynamical bistable systems excited by a noisy sine: such systems are able to force cooperation between sine and noise such that the noise amplifies the sine. Because of this non-intuitive effect, the use of SR can be envisaged to detect small amplitude sines corrupted by additive noise. In this paper we recall some basics of detection and then show why SR can be used in sine detection context. After recalling some basics of SR in discrete time, we show how to use SR in a detection scheme.
Mining association rules using inverted hashing and pruning
Authors: John D. Holt, Soon M. Chung
Venue: Information Processing Letters (2002)

In this paper, we propose a new algorithm named Inverted Hashing and Pruning (IHP) for mining association rules between items in transaction databases. The performance of the IHP algorithm was evaluated for various cases and compared with those of two well-known mining algorithms, Apriori algorithm [Proc. 20th VLDB Conf., 1994, pp. 487-499] and Direct Hashing and Pruning algorithm [IEEE Trans. on Knowledge Data Engrg. 9 (5) (1997) 813-825]. It has been shown that the IHP algorithm has better performance for databases with long transactions.
A Parallel Execution Model of Logic Programs
Authors: A. C. Chen, C. I. Wu
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

A parallel-execution model that can concurrently exploit AND and OR parallelism in logic programs is presented. This model employs a combination of techniques in an approach to executing logic problems in parallel, making tradeoffs among number of processes, degree of parallelism, and combination bandwidth. For interpreting a nondeterministic logic program, this model (1) performs frame inheritance for newly created goals, (2) creates data-dependency graphs (DDGs) that represent relationships among the goals, and (3) constructs appropriate process structures based on the DDGs. (1) The use of frame inheritance serves to increase modularity. In contrast to most previous parallel models that have a large single process structure, frame inheritance facilitates the dynamic construction of multiple independent process structures, and thus permits further manipulation of each process structure. (2) The dynamic determination of data dependency serves to reduce computational complexity. In comparison to models that exploit brute-force parallelism and models that have fixed execution sequences, this model can reduce the number of unification and/or merging steps substantially. In comparison to models that exploit only AND parallelism, this model can selectively exploit demand-driven computation, according to the binding of the query and optional annotations. (3) The construction of appropriate process structures serves to reduce communication complexity. Unlike other methods that map DDGs directly onto process structures, this model can significantly reduce the number of data sent to a process and/or the number of communication channels connected to a process.
Merging Fossil Specimens with Computer-Generated Information
Authors: Oliver Bimber, Stephen M. Gatesy, Lawrence M. Witmer, Ramesh Raskar, L. Miguel Encarnação
Venue: Computer (2002)

While dinosaur fossils reveal much, they keep us guessing about the original organisms' color, sound, and behavior. For several years, modern paleontologists have used 3D computer graphics to help reconstruct these pieces of the past. Augmented reality leverages this technology to provide an interface that enhances the real world with synthetic supplements. Paleontologists can use AR to present virtual data directly within a real, 3D environment rather than on a flat monitor. This technology's immersiveness can give paleontologists new insights into their research and communicate the results to museum visitors in an exciting and effective way.
Guest Editors' Introduction: Hot Chips and the Microprocessor
Authors: Norman P. Jouppi, Hasan S. AlKhatib
Venue: IEEE Micro (1996)

This special issue of IEEE Micro features some of the best presentations from last year's annual Hot Chips Symposium. Hot Chips enjoyed another year of spectacular success with over 800 attendees from around the world who gathered at Stanford University to listen to the latest and hottest developments in the chip industry. This symposium is the seventh of a series that started in 1989.
Fast converging adaptive matched filter and adaptive cosine/Coherence estimator
Authors: Antonio De Maio
Venue: Signal Processing (2002)

This paper deals with the problem of detecting a signal known up to a scaling factor in the presence of Gaussian disturbance with unknown covariance matrix. We focus on scenarios where the number of secondary data which share the same covariance of the data under test is very limited. Thus, we propose a modified version of the adaptive matched filter (AMF) and of the adaptive cosine/coherence estimator (ACE) which can be applied even if the sample covariance matrix is rank deficient. Even though these detectors do not ensure the constant false alarm rate (CFAR) property with respect to the covariance matrix of the disturbance, a sensitivity analysis has shown that the threshold setting is very robust with respect to possible discrepancies between the design and the operating conditions. Finally, numerical results highlight that the proposed receivers outperform the conventional AMF and ACE in low sample situations.
Enhancing the Cocomo Estimation Models
Authors: Joanne Hale, Allen Parrish, Brandon Dixon, Randy K. Smith
Venue: IEEE Software (2000)

Team task assignments appear to have a significant potential impact on a project's overall success. The authors propose task assignment effort adjustment factors that can help tune existing estimation models. They show significant improvements in the predictive abilities of both Cocomo I and II by enhancing them with these factors.
A quorum-based self-stabilizing distributed mutual exclusion algorithm
Authors: Mikhail Nesterenko, Masaaki Mizuno
Venue: Journal of Parallel and Distributed Computing (2002)

In this paper, we present a self-stabilizing quorum-based distributed mutual exclusion algorithm. Our algorithm is designed for an asynchronous message-passing model. The algorithm scales well since it has constant synchronization delay and its message complexity is proportional to the square root of the number of processes in the system. The algorithm tolerates message loss. The algorithm places few assumptions on timeouts needed for its implementation. All this allows for a ready implementation of the algorithm on practical distributed architectures.
A Time-Multiplexed Reconfigurable Neuroprocessor
Authors: Fadi N. Sibai, Sunil D. Kulkarni
Venue: IEEE Micro (1997)

We present the architecture and VLSI circuit design of a multilayered pulse-stream neuroprocessor. This neuroprocessor design uses a mixed analog/digital implementation to obtain an efficient use of chip area and operating speed. The processing element (PE) weights are stored digitally in local dynamic cyclic shift registers. These 7-bit signed weights allow both excitatory as well as inhibitory connection strengths to be incorporated. The weights are trained externally and downloaded onto the network. The computational units are analog and consist of a multiplying charge-scaling digital-to-analog converter and a neural activity integrator. They operate at a clock frequency of 10 MHz, delivering a performance of 2.5-billion connections per second for a typical 64-element, 4-layered network, based on a 1-micron CMOS technology process.
A Ravenscar-Compliant Run-time Kernel for Safety-Critical Systems*
Authors: Kristina Lundqvist, Lars Asplund
Venue: Real-Time Systems (2003)

The Ravenscar tasking profile for Ada 95 has been designed to allow implementation of highly safety critical systems. Ravenscar defines a tasking system with deterministic behavior and low complexity. We provide a formal model using UPPAAL of the primitives provided by Ravenscar including exceptions. This formal model is used to verify the correctness of the Ravenscar model and can be used to verify safety properties of applications using the Ravenscar profile. As an illustration of this, we model a sample application using all features of Ravenscar and formally verify its correctness. Furthermore, an introduction to the Ravenscar model is given.
Object-Oriented Query Languages: The Notion and the Issues
Authors: E. Bertino, M. Negri, G. Pelagatti, L. Sbattella
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

The authors describe how the characteristics of an object-oriented data model, such as object identity, complex object structure, methods, and class hierarchies, have an impact on the design of a query language. They also point out major differences with respect to relational query languages. The discussion is supported through the definition of OOPC, a formal object-oriented query language based on predicate calculus, which incorporates in a consistent formal notation most features of existing object-oriented query languages.