ppxscal/embedding_network huggingface dataset:
Adaptive Processing of Top-k Queries in XML
Authors: Amelie Marian, Sihem Amer-Yahia, Nick Koudas, Divesh Srivastava
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies on using scores to prune irrelevant answers as early as possible in the evaluation process. In this context, evaluating the same query plan for all answers might be too rigid because, at any time in the evaluation, answers have gone through the same number and sequence of operations, which limits the speed at which scores grow. Therefore, adaptive query processing that permits different plans for different partial matches and maximizes the best scores is more appropriate. In this paper, we propose an architecture and adaptive algorithms for efficiently computing top-k matches to XML queries. Our techniques can be used to evaluate both exact and approximate matches where approximation is defined by relaxing XPath axes. In order to compute the scores of query answers, we extend the traditional tf*idf measure to account for document structure. We conduct extensive experiments on a variety of benchmark data and queries, and demonstrate the usefulness of the adaptive approach for computing top-k queries in XML.
Spring Into Linux(R)
Authors: Janet Valade
Venue:  (2005)

The fastest route to true Linux mastery!You know your way around Windows (or maybe a Mac, or even UNIX). Now, you're ready for Linux.And you don't have a minute to waste.Welcome. This book's for you.Janet Valade has spent thirteen years helping new users master Linux and related technologies. She knows the "magic words" that'll help you get the job done, fast. (And she knows exactly how to keep you out of trouble, too!)You'll learn Linux through dozens of focused, bite-size examples, each one carefully designed to build on what you've learned before.Need specific solutions? This book's carefully crafted, high-efficiency format delivers them... instantly. Working on Fedora? Mandrake? SuSE? No matter. This book is for you.No other introduction to Linux covers this much, this well, this quickly. Dig in, get started, get results! All you need to succeed with Linux-without the hassles! Choose the best Linux distribution for your personal or business needs Get Linux installed quickly and running reliably Handle your day-to-day tasks and efficiently manage your files Master KDE, GNOME, and the Linux command line Write documents and build spreadsheets with OpenOffice.org Set up Web access, email, and instant messaging Work with powerful Linux multimedia and graphics software Find, install, and run new Linux software Set up your printer to work with Linux Supercharge Linux with shell scripts and customized configuration filesIncludes concise Linux command reference and quick guide to building powerful Regular ExpressionsSpring Into... is a new series of fast-paced tutorials from Addison-Wesley Professional Publishers. Each book in the series is designed to bring you up-to-speed quickly. Complex technologies are reduced to their core components, and each component is treated with remarkable efficiency in one- or two-page spreads. Just the information you need to begin working...now! And because the books are example-rich and easy to navigate, you'll find that they make great on-the-job references after you've mastered the basics.© Copyright Pearson Education. All rights reserved.
QoS Aware Job Scheduling in a Cluster-Based Web Server for Multimedia Applications
Authors: Jiani Guo, Laxmi Bhuyan, Raj Kumar, Sujoy Basu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

We propose a cluster-based web server where a few computing nodes are separately reserved for high-performance computing applications, such as multimedia, SSL, and CGI. As an example application, we consider a multimedia server that dynamically generates video units to satisfy the bit rate and bandwidth requirements of a variety of clients. To perform QoS aware scheduling of multiple multimedia jobs on the computing servers, a two-step algorithm is proposed. The first step is to fairly schedule multimedia streams to satisfy each stream's QoS requirement; and the second step is to balance the workload among heterogeneous computing nodes in the cluster. We propose a new Quota-based Adaptive CoScheduling (QACS) algorithm that greatly reduces delay jitter by eliminating the out-of-order departure for outgoing streams, as well as achieves high throughput in a heterogeneous cluster. Experimental results show that the proposed scheduling technique gives adequate QoS guarantees to multiple streams.
Introducing ardour
Authors: Dave Phillips
Venue: Linux Journal (2005)

A Linux Journal first, this article features a new song recorded just for this issue. Get started with hard-disk recording and have a listen.
An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
Authors: Arvind U. Raghunathan, Lorenz T. Biegler
Venue: SIAM Journal on Optimization (2005)

Interior point methods for nonlinear programs (NLPs) are adapted for solution of mathematical programs with complementarity constraints (MPCCs). The constraints of the MPCC are suitably relaxed so as to guarantee a strictly feasible interior for the inequality constraints. The standard primal-dual algorithm has been adapted with a modified step calculation. The algorithm is shown to be superlinearly convergent in the neighborhood of the solution set under assumptions of MPCC-LICQ, strong stationarity and upper level strict complementarity. The modification can be easily accommodated within most nonlinear programming interior point algorithms with identical local behavior. Numerical experience is also presented and holds promise for the proposed method.
GNU motion: your eye in the sky for computer room surveillance
Authors: Phil Hollenback
Venue: Linux Journal (2005)

Make your security Webcam show you all the crimes, none of the empty rooms.
Software Clustering based on Omnipresent Object Detection
Authors: Zhihua Wen, Vassilios Tzerpos
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

The detection of omnipresent objects can be an important aid to the process of understanding a large software system. As a result, various detection techniques have been presented in the literature. However, these techniques do not take the subsystem structure into account when deciding whether an object is omnipresent or not. In this paper, we present a new set of detection methods for omnipresent objects that maintain that an object needs to be connected to a large number of subsystems before it is deemed omnipresent. We compare this novel approach to existing ones. We also introduce a framework that can improve the effectiveness of existing software clustering algorithms by combining them with an omnipresent object detection method. Experiments with two large software systems demonstrate the usefulness of this framework.
Cranks and dissections in Ramanujan's lost notebook
Authors: Bruce C. Berndt, Heng Huat Chan, Song Heng Chan, Wen-Chin Liaw
Venue: Journal of Combinatorial Theory Series A (2005)

In his lost notebook, Ramanujan offers several results related to the crank, the existence of which was first conjectured by F.J. Dyson and later established by G.E. Andrews and F.G. Garvan. Using an obscure identity found on p. 59 of the lost notebook, we provide uniform proofs of several congruences in the ring of formal power series for the generating function F(q) of cranks. All are found, sometimes in abbreviated form, in the lost notebook, and imply dissections of F(q). Consequences of our work are interesting new q-series identities and congruences in the spirit of Atkin and Swinnerton-Dyer.
The Maxima Haptics Package " A Tool for Symbolic Analysis of Haptics and Teleoperation
Authors: Goran Christiansson
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The Maxima Haptics Package is a free software package for symbolic analysis of linear models of haptic devices and teleoperators. From a mechanical model of the haptic device, the slave robot and a formulation of the controller, the package calculates the well known "hybrid matrix" representation of the whole system. From the acquired hybrid matrix, the linear performance measures and external device characteristics can be calculated, e.g. force bandwidth and free air inertia. The package provides a common language for the haptic community for exchange of symbolic models, and tools to enhance understanding and learning. The Maxima Haptics Package is released to the public for the first time ever during the WorldHaptics Conference 2005.
Topology preserving surface extraction using adaptive subdivision
Authors: Gokul Varadhan, Shankar Krishnan, TVN Sriram, Dinesh Manocha
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

We address the problem of computing a topology preserving isosurface from a volumetric grid using Marching Cubes for geometry processing applications. We present a novel topology preserving subdivision algorithm to generate an adaptive volumetric grid. Our algorithm ensures that every grid cell satisfies two local geometric criteria: a complex cell criterion and a star-shaped criterion. We show that these two criteria are sufficient to ensure that the surface extracted from the grid using Marching Cubes has the same genus and connectedness as that of the exact isosurface. We use our subdivision algorithm for accurate boundary evaluation of CSG combinations of polyhedra and low degree algebraic primitives, translational motion planning, model simplification and remeshing. The running time of our algorithm varies between a few seconds for simple models composed of a few thousand triangles to tens of seconds for complex polyhedral models represented using hundreds of thousands of triangles.
The PN-tree: a parallel and distributed multidimensional index
Authors: M. H. Ali, A. A. Saad, M. A. Ismail
Venue: Distributed and Parallel Databases (2005)

Multidimensional indexing is concerned with the indexing of multi-attributed records, where queries can be applied on some or all of the attributes. Indexing multi-attributed records is referred to by the term multidimensional indexing because each record is viewed as a point in a multidimensional space with a number of dimensions that is equal to the number of attributes. The values of the point coordinates along each dimension are equivalent to the values of the corresponding attributes. In this paper, the PN-tree, a new index structure for multidimensional spaces, is presented. This index structure is an efficient structure for indexing multidimensional points and is parallel by nature. Moreover, the proposed index structure does not lose its efficiency if it is serially processed or if it is processed using a small number of processors. The PN-tree can take advantage of as many processors as the dimensionality of the space. The PN-tree makes use of B+-trees that have been developed and tested over years in many DBMSs. The PN-tree is compared to the Hybrid tree that is known for its superiority among various index structures. Experimental results show that parallel processing of the PN-tree reduces significantly the number of disk accesses involved in the search operation. Even in its serial case, the PN-tree outperforms the Hybrid tree for large database sizes.
A parallel SML compiler based on algorithmic skeletons
Authors: Norman Scaife, Susumi Horiguchi, Greg Michaelson, Paul Bristow
Venue: Journal of Functional Programming (2005)

Algorithmic skeletons are abstractions from common patterns of parallel activity which offer a high degree of reusability for developers of parallel algorithms. Their close association with higher order functions (HOFs) makes functional languages, with their strong transformational properties, excellent vehicles for skeleton-based parallel program development. However, using HOFs in this way raises substantial problems of identification of useful HOFs within a given application and of resource allocation on target architectures. We present the design and implementation of a parallelising compiler for Standard ML which exploits parallelism in the familiar $map$ and $fold$ HOFs through skeletons for processor farms and processor trees, respectively. The compiler extracts parallelism automatically and is target architecture independant. HOF execution within a functional language can be nested in the sense that one HOF may be passed and evaluated during the execution of another HOF. We are able to exploit this by nesting our parallel skeletons in a processor topology which matches the structure of the Standard ML source. However, where HOF arguments result from partially applied functions, free variable bindings must be identified and communicated through the corresponding skeleton hierarchy to where those arguments are actually applied. We describe the analysis leading from input Standard ML through HOF instantiation and backend compilation to an executable parallel program. We also present an overview of the runtime system and the execution model. Finally, we give parallel performance figures for several example programs, of varying computational loads, on the Linux-based Beowulf, IBM SP&#x002F;2, Fujitsu AP3000 and Sun StarCat 15000 MIMD parallel machines. These demonstrate good cross-platform consistency of parallel code behaviour.
Grid-Aware HA-OSCAR
Authors: Kshitij Limaye, Box Leangsuksun, Venkata K. Munganuru, Zeno Greenwood, Stephen L. Scott, Richard Libby, Kasidit Chanchio
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

Physicists today have employed grid technology to overcome various resource level hurdles. The collective resource utilization achieved through grid computing is critical to the overall computing capacity of the community and should be guaranteed. In an environment where job sites are cluster systems, a service node failure renders a whole system outage. Our grid-aware HA-OSCAR effort was motivated by the popularity of the cluster architecture in the Grid environment. We propose the high-availability architecture, HA-OSCAR, for cluster-based job sites in the grid environment. This architecture deals with fault tolerance at the service level complementing task-based solutions such as checkpoint/restart. We discuss various service availability issues related to the grid, some issues and preliminary results obtained while implementing the smart failover feature and the automated grid installation package. Our report entails the performance benefits achieved after applying the HA-OSCAR solution to the cluster components of the grid compared to regular Beowulf style cluster solutions.
Run-Time Reconfiguration Support for FPGAs with Embedded CPUs: The Hardware Layer
Authors: Joao Canas Ferreira, Miguel M. Silva
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

We report on work in progress that aims to provide a run-time management kernel for applications running on FPGAs with embedded CPUs. We describe the global concept, the organization of the hardware environment for the reconfigurable modules and the reconfiguration strategy supported by the run-time management kernel. Practical issues concerning the implementation of the system on a Virtex-II Pro-based board are also addressed.
Symmetry descriptors and 3D shape matching
Authors: Michael Kazhdan, Thomas Funkhouser, Szymon Rusinkiewicz
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

In this paper, we present the Symmetry Descriptors of a 3D model. This is a collection of spherical functions that describes the measure of a model's rotational and reflective symmetry with respect to every axis passing through the center of mass. We show that Symmetry Descriptors can be computed efficiently using fast signal processing techniques, and demonstrate the empirical value of Symmetry Descriptors by showing that they improve matching performance in a variety of shape retrieval experiments.
Visualizing multiple evolution metrics
Authors: Martin Pinzger, Harald Gall, Michael Fischer, Michele Lanza
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

Observing the evolution of very large software systems needs the analysis of large complex data models and visualization of condensed views on the system. For visualization software metrics have been used to compute such condensed views. However, current techniques concentrate on visualizing data of one particular release providing only insufficient support for visualizing data of several releases.In this paper we present the RelVis visualization approach that concentrates on providing integrated condensed graphical views on source code and release history data of up to n releases. Measures of metrics of source code entities and relationships are composed in Kiviat diagrams as annual rings. Diagrams highlight the good and bad times of an entity and facilitate the identification of entities and relationships with critical trends. They represent potential refactoring candidates that should be addressed first before further evolving the system. The paper provides needed background information and evaluation of the approach with a large open source software project.
Architecture-Based Web Service Composition Framework and Strategy
Authors: Yuan Rao, Zunchao Li, Boqin Feng
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Web services provided a new solution for reusing and assembling web software or components under the distributed service-oriented architecture and across-platform environment with a series of XML-based protocols. An architecture-based service composition model based on the architecture life-cycle is proposed, which provide a mechanism for dynamic service management and deployment. It also guarantees the version control of service components and a manageable evolvement process of application system. In addition, a kind of relationship-oriented service composition description language, i.e., RSCDL, for description the composition process is investigated, which can guarantee that the complex services can be composed of the reused atomic services by different structural types and can provide a value-added service to different users.
An integrated approach to realize multi-resolution of B-rep model
Authors: Sungchan Kim, Kunwoo Lee, Taesik Hong, Mincheol Kim, Moonki Jung, Youngjae Song
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

It is becoming a common trend that many designers work on a very complex assembly together in a collaborative environment. In this environment, every designer should be able to see the whole assembly in a full detail or in a rough shape at least. Even though the hardware technology is being improved very rapidly, it is very difficult to display a very complex assembly at a speed to allow smooth interactions for designers. This problem could be solved if a designer could manipulate his portion of the assembly in a full resolution while the remaining portion of the assembly is displayed in a rough resolution. It is also desired that the remaining portion is converted to the full resolution when needed. To realize this environment, the capabilities to simplify the portions of an assembly and to reset to the original resolution should be added to the current CAD systems. Thus operators realizing multi-resolution on B-rep are proposed in this paper, They are: wrap-around, smooth-out, and thinning operator. Through appropriately applying these operators sequentially, an assembly model of any desired resolution can be easily generated. Of course, the assembly can go back to the finer resolution. In this paper, the data structures and the processes to realize these operators are described and a prototype modeling system with these operators is also demonstrated.
An Integrated Power Recovery Module Dedicated to Implantable Electronic Devices
Authors: Yamu Hu, Mohamad Sawan, Mourad N. El-Gamal
Venue: Analog Integrated Circuits and Signal Processing (2005)

This paper concerns the design and implementation of an inductively coupled RF telemetry for both power and data transferring to implantable microelectronic devices. The major shortcomings of available inductive powering designs are their low power-transfer efficiency and large size of the implantable unit. Therefore, there is a need to fully integrate interfacing module of the implantable unit. The presented power recovery module is dedicated to the biotelemetry application of cortical/nerve stimulation. The proposed strategy allows providing dual regulated output voltages 3.3 V/1.8 V to the electrodes driver and other implantable circuitry, respectively. Its low dropout voltage makes high power efficiency attainable. Fabricated integrated prototype in a CMOS 0.18 ¿m technology has demonstrated its feasibility, providing a load current driving ability of 5 mA for each one of the two supply voltages.
Fast Illumination-Invariant Background Subtraction Using Two Views: Error Analysis, Sensor Placement and Applications
Authors: Ser-Nam Lim, Anurag Mittal, Larry S. Davis, Nikos Paragios
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Background modeling and subtraction to detect new or moving objects in a scene is an important component of many intelligent video applications. Compared to a single camera, the use of multiple cameras leads to better handling of shadows, specularities and illumination changes due to the utilization of geometric information. Although the result of stereo matching can be used as the feature for detection, it has been shown that the detection process can be made much faster by a simple subtraction of the intensities observed at stereo-generated conjugate pairs in the two views. The method, however, suffers from false and missed detections due to some geometric considerations. In this paper, we perform a detailed analysis of such errors. Then, we propose a sensor configuration that eliminates false detections. Algorithms are also proposed that effectively eliminate most detection errors due to missed detections, specular reflections and objects being geometrically close to the background. Experiments on several scenes illustrate the utility and enhanced performance of the proposed approach compared to existing techniques.