ppxscal/embedding_network huggingface dataset:
Vision Based Intelligent Wheel Chair Control: The Role of Vision and Inertial Sensing in Topological Navigation
Authors: Toon Goedemé, Marnix Nuttin, Tinne Tuytelaars, Luc Van Gool
Venue: Journal of Robotic Systems (2004)

This paper describes ongoing research on vision based mobile robot navigation for wheel chairs. After a guided tour through a natural environment while taking images at regular time intervals, natural landmarks are extracted to automatically build a topological map. Later on this map can be used for place recognition and navigation. We use visual servoing on the landmarks to steer the robot. In this paper, we investigate ways to improve the performance by incorporating inertial sensors. &copy; 2004 Wiley Periodicals, Inc.
Designing Effective Database Systems
Authors: Rebecca M. Riordan
Venue:  (2005)

World-renowned expert Rebecca M. Riordan has written the definitive database design book for working developers who aren't database experts. No matter how messy or complex your business challenge, Designing Effective Database Systems shows you how to design an effective, high-performance database to solve it.Riordan begins by thoroughly demystifying the principles of relational design, making them accessible to every professional developer. Next, she offers the field's clearest introduction to dimensional database modeling: practical insight for designing today's increasingly important analytical applications.One task at a time, Riordan illuminates every facet of database analysis and design for both OLAP and OLTP, showing how to avoid common architectural pitfalls that complicate development and reduce extensibility. The book concludes with comprehensive, expert guidance on designing databases for maximum usability. This book will teach you how to Understand relational database models, structures, relationships, and data integrity principles Define database system goals, criteria, scope, and work processes Construct accurate conceptual models: relationships, entities, domain analysis, and normalization Build efficient, secure database schema Master the elements of OLAP design: fact tables, dimension tables, snowflaking, and more Architect and construct easy, efficient interfaces for querying and reporting Learn from practice examples based on Microsoft's Northwind sample databaseRiordan has helped thousands of professionals master database design and development, earning Microsoft's coveted MVP honor for her exceptional contributions. Nobody's more qualified to help you master database design-and apply it in your real-world environment.
Proceedings of the 2005 ACM symposium on Software visualization
Venue: Software Visualization (2005)

Welcome to SoftVis 05.Welcome to St. Louis for the second bi-annual ACM Symposium on Software Visualization. Software visualization encompasses the development and evaluation of methods for graphically representing different aspects of software, including its structure, its abstract and concrete execution, and its evolution. The goal of this symposium is to provide a forum for researchers from different backgrounds (HCI, software engineering, programming languages, visualization, computer science education) to discuss and present original research on software visualization.This year we experienced a 17% increase in submitted papers from the fi rst iteration of the symposium. Seventy-six qualified papers were submitted, and each received at least three reviews from our panel of twenty-three international experts. Twenty papers were selected for presentation at this meeting. The proceedings showcase these exceptional papers.The conference event itself also includes a special demonstration/poster session and a number of informal breaks, allowing attendees to enjoy a reunion with old friends, fi nd an experienced colleague and discuss topics of common interest, make plans for collaboration, or meet new friends in the inviting environment of the conference setting. We also hope that you fi nd the time to relax and stroll along the Mississippi River to visit the famous "Gateway to the West" arch.
Estimating Disparity and Occlusions in Stereo Video Sequences
Authors: Oliver Williams, Michael Isard, John MacCormick
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We propose an algorithm for estimating disparity and occlusion in stereo video sequences. The algorithm defines a prior on sequences of disparity maps using a 3D Markov random field, and approximately computes the MAP estimate for the disparity sequence using loopy belief propagation. In contrast to previous work on temporal stereo, the algorithm (i) correctly models half-occlusions ¿ scene points visible in one camera but not the other ¿ and (ii) enforces the so-called "monotonicity constraint" on the boundary of half-occluded regions. The algorithm is also able to exploit temporal coherence more appropriately than many previous approaches to temporal stereo, by employing additional states in the Markov random field. These additional states permit rudimentary motion estimation to be performed as part of the belief propagation, thus improving the quality of temporal inference. Parameters of the algorithm are learned from the ground truth disparities of a real stereo sequence. Qualitative results are shown on real sequences, including comparisons with competing approaches, and the performance of the algorithm is assessed quantitatively using the ground truth data.
An integer linear programming-based tool for wireless sensor networks
Authors: I. Kadayif, M. Kandemir, N. Vijaykrishnan, M. J. Irwin
Venue: Journal of Parallel and Distributed Computing (2005)

Wireless sensor networks will be widely deployed in the future for monitoring important environmental conditions, security, and health care. One of the most important challenges in the implementation of such networks is minimizing energy dissipation. Given that many of the energy optimization problems defined for sensor networks are very hard, heuristics are commonly employed. Evaluating the effectiveness of these heuristics, i.e., how close do they come to the optimal solutions, is a challenge. While algorithms that give optimal solutions cannot be on-line (since they are expensive), if they are used off-line, they can provide invaluable insight to improve existing heuristics and to derive new ones. In this paper, we present an integer linear programming (ILP)-based tool that can be used to evaluate optimal solutions for communication energy optimization in sensor networks under specific constraints. This tool, which is based on the required sensing and communication schedules, determines optimal sensor movement and communication strategies to minimize energy consumption due to inter-sensor communication. The tool can also accommodate several constraints related to movement capabilities of sensor nodes, their battery capacities, and their communication ranges since all these can be expressed in a linear form. In addition, it can also work with objective functions other than minimizing communication energy. Our experience with the tool indicates that it is very useful for studying different scenarios under which an objective function needs to be optimized.
Scrutinizing Frequent Pattern Discovery Performance
Authors: Osmar R. Zaiane, Mohammad El-Hajj, Yi Li, Stella Luk
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Benchmarking technical solutions is as important as the solutions themselves. Yet many fields still lack any type of rigorous evaluation. Performance benchmarking has always been an important issue in databases and has played a significant role in the development, deployment and adoption of technologies. To help assessing the myriad algorithms for frequent itemset mining, we built an open framework and testbed to analytically study the performance of different algorithms and their implementations, and contrast their achievements given different data characteristics, different conditions, and different types of patterns to discover and their constraints. This facilitates reporting consistent and reproducible performance results using known conditions.
Reliability Estimation of Mobile Agent Systems Using the Monte Carlo Approach
Authors: Mosaab Daoud, Qusay H. Mahmoud
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In this paper two algorithms are proposed for estimating the reliability of mobile agent systems, which are based on the conditions of the underlying computer network. A third algorithm is proposed for generating a random static planning strategy for mobile agents. The complexity of the mobile agent system network makes it hard to obtain the reliability of the system theoretically; instead we estimate it using the Monte Carlo simulation approach. In this paper, we assume that the system consists of a number of independent mobile agents operating simultaneously. The results we have achieved demonstrate the robustness of the proposed algorithms.
Scientific computations using micro-computers
Authors: E. L. Battiste
Venue: ACM SIGNUM Newsletter (1981)

We review software and hardware of micro-computers in the light of requirements for the production of robust software. We consider that attitudes about such production on large scale computers which have been developed over the last fifteen years should be adhered to, and that user protection from inadequate software is most important. The typical computer user will tend more and more to consider computational ingredients made available to him to be "black boxes", and will be prone to rely on results in the same manner as he relies on arithmetic componentry to perform correct operations.
Performance-based middleware for Grid computing: Research Articles
Authors: G. R. Nudd, S. A. Jarvis
Venue: Concurrency and Computation: Practice Experience (2005)

This paper describes a stateful service-oriented middleware infrastructure for the management of scientific tasks running on multi-domain heterogeneous distributed architectures. Allocating scientific workload across multiple administrative boundaries is a key issue in Grid computing and as a result a number of supporting services including match-making, scheduling and staging have been developed. Each of these services allows the scientist to utilize the available resources, although a sustainable level of service in such shared environments cannot always be guaranteed. A performance-based middleware infrastructure is described in which prediction data for each scientific task are calculated, stored and published through a Globus-based performance information service. Distributing these data allows additional performance-based middleware services to be built, two of which are described in this paper: an intra-domain predictive co-scheduler and a multi-domain workload steering system. These additional facilities significantly improve the ability of the system to meet task deadlines, as well as enhancing inter-domain load-balancing and system-wide resource utilization. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Vibration Control of a Planar Parallel Manipulator Using Piezoelectric Actuators
Authors: Bongsoo Kang, James K. Mills
Venue: Journal of Intelligent and Robotic Systems (2005)

This paper presents an active damping control approach applied to piezoelectric actuators attached to flexible linkages of a planar parallel manipulator for the purpose of attenuation of unwanted mechanical vibrations. Lightweight linkages of parallel manipulators deform under high acceleration and deceleration, inducing unwanted vibration of linkages. Such vibration must be damped quickly to reduce settling time of the manipulator platform position and orientation. An integrated control system for a parallel manipulator is proposed to achieve precise path tracking of the platform while damping the undesirable manipulator linkage vibration. The proposed control system consists of a PD feedback control scheme for rigid body motion of the platform, and a linear velocity feedback control scheme applied to piezoelectric actuators to damp unwanted linkage vibrations. In this paper, we apply the proposed vibration suppression algorithm to two different types of piezoelectric actuators and evaluate their respective performances. The two piezoelectric actuators are (i) a PVDF layer applied to the flexible linkage and (ii) PZT actuator segments also applied to the linkage. Simulation results show that both piezoelectric actuators achieve good performance in vibration attenuation of the planar parallel manipulator. The dynamics of the planar parallel platform are selected such that the linkages have considerable flexibility, to better exhibit the effects of the vibration damping control system proposed.
Top-Down and Bottom-Up Strategies in Lesion Detection of Background Diabetic Retinopathy
Authors: Xiaohui Zhang, Opas Chutatape
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Bright lesions in the form of exudates and cotton wool spots while dark lesions consisting of hemorrhages are main evidences of background diabetic retinopathy that require early detection and precise classification. Based on different properties of bright lesions and dark lesions, bottom-up and top-down strategies are applied respectively to cope with the main difficulties in lesions detection such as inhomogeneous illumination. In bright lesion detection, a three-stage, bottom-up approach is applied. After local contrast enhancement preprocessing stage, two-step Improved Fuzzy C-Means is applied in Luv color space to segment candidate bright lesion areas. Finally, a hierarchical SVM classification structure is applied to classify bright non-lesion areas, exudates and cotton wool spots. In hemorrhage detection, a top-down strategy is adopted. The hemorrhages are located in the ROI firstly by calculating the evidence value of every pixel using SVM. Then their boundaries can be accurately segmented in the post-processing stage.
Implementation and testing of an algorithm for global optimizations with noise
Authors: Antanas Žilinskas, Darius Kučinskas
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

An implementation problem of an algorithm for one-dimensional global optimization in the presence of noise is considered. The approach is based on modelling the objective function as a standard Wiener process. The testing results of the implemented algorithm are presented using several well known test functions. The efficiency of the algorithm is evaluated for different levels of noise.
New inequalities from classical sturm theorems
Authors: Alfredo Deaño, Amparo Gil, Javier Segura
Venue: Journal of Approximation Theory (2004)

Inequalities satisfied by the zeros of the solutions of second-order hypergeometric equations are derived through a systematic use of Liouville transformations together with the application of classical Sturm theorems. This systematic study allows us to improve previously known inequalities and to extend their range of validity as well as to discover inequalities which appear to be new. Among other properties obtained, Szegö's bounds on the zeros of Jacobi polynomials Pn(α,β) (cos θ) for |α| < ½, |β| < ½ are completed with results for the rest of parameter values, Grosjean's inequality (J. Approx. Theory 50 (1987)84) on the zeros of Legendre polynomials is shown to be valid for Jacobi polynomials with |β| ≤ 1, bounds on ratios of consecutive zeros of Gauss and confluent hypergeometric functions are derived as well as an inequality involving the geometric mean of zeros of Bessel functions.
Stochastic Comparisons in Production Yield Management
Authors: Diwakar Gupta, William L. Cooper
Venue: Operations Research (2005)

Manufacturing firms routinely commit resources to increase yield rates through product- and process-improvement initiatives. Champions of such yield-improvement projects may assume that stochastically larger yield rates are beneficial. In this note, we show that this need not hold, even when the contingent production lot sizes are chosen optimally. We employ stochastic comparison techniques to show that a yield rate that is smaller in the convex order ensures higher expected profit, and we provide a distribution-free bound on the size of increase in expected profit. We also identify properties of yield-rate distributions that do make stochastically larger yield rates beneficial.
Locally consistent transformations and query answering in data exchange
Authors: Marcelo Arenas, Pablo Barceló, Ronald Fagin, Leonid Libkin
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema. Given a source instance, there may be many solutions - target instances that satisfy the constraints of the data exchange problem. Previous work has identified two classes of desirable solutions: canonical universal solutions, and their cores. Query answering in data exchange amounts to rewriting a query over the target schema to another query that, over a materialized target instance, gives the result that is semantically consistent with the source. A basic question is then whether there exists a transformation sending a source instance into a solution over which target queries can be answered.We show that the answer is negative for many data exchange transformations that have structural properties similar to canonical universal solutions and cores. Namely, we prove that many such transformations preserve the local structure of the data. Using this notion, we further show that every target query rewritable over such a transformation cannot distinguish tuples whose neighborhoods in the source are similar. This gives us a first tool that helps check whether a query is rewritable, We also show that these results are robust: they hold for an extension of relational calculus with grouping and aggregates, and for two different semantics of query answering.
An improved algorithm for the distance constrained <toggle>p</toggle>-center location problem with mutual communication on tree networks
Venue: Networks (2004)

In a recent article Averbakh and Berman present an O&lpar;p3 &plus; n2&rpar; serial algorithm to solve the distance constrained p-center location problem with mutual communication on a tree network with n nodes. In this note we suggest two simple modifications leading to the improved &lpar;subquadratic in n&rpar;, O&lpar;p3 &plus; p&lpar;n &plus; p&rpar;log2&lpar;n &plus; p&rpar;&rpar; complexity bound. We also present a new O&lpar;p2n log n log&lpar;n &plus; p&rpar;&rpar; algorithm for the discrete version of this problem. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;1&rpar;, 38&ndash;40 2004
Qualitative properties of stochastic iterative processes under random structural perturbations
Authors: Byron L. Griffin, G. S. Ladde
Venue: Mathematics and Computers in Simulation (2004)

In this work, under different modes of stochastic convergence, several convergence and stability results for stochastic iterative processes are developed. Difference inequalities and a comparison method in the context of Lyapunov-like functions are utilized. The presented method does not demand the knowledge of the probability distributions of solution processes. By decomposing random perturbations in nonlinear iterative processes into internal and external random perturbations, effects of these stochastic disturbances on the convergence and the stability of the the iterative processes are investigated. In fact, it is shown that the convergence and stability analysis is robust under random structural perturbations. The presented conditions are easy to verify, algebraically simple, and computationally attractive. The results provide new tests for distributed iterative processes in decentralized external regulation, adaptation, parameter estimation and the numerical analysis schemes.
Performance of dead reckoning-based location service for mobile ad hoc networks: Research Articles
Authors: Vijay Kumar, Samir R. Das
Venue: Wireless Communications Mobile Computing (2004)

A predictive model-based mobility tracking method, called dead reckoning, is developed for mobile ad hoc networks. It disseminates both location and movement models of mobile nodes in the network so that every node is able to predict or track the movement of every other node with a very low overhead. The basic technique is optimized to use &lsquo;distance effect&rsquo;, where distant nodes maintain less accurate tracking information to save overheads. The dead reckoning-based location service mechanism is evaluated against three known location dissemination service protocols: simple, distance routing effect algorithm for mobility (DREAM) and geographic region summary service (GRSS). The evaluation is done with geographic routing as an application. It is observed that dead reckoning significantly outperforms the other protocols in terms of packet delivery fraction. It also maintains low-control overhead. Its packet delivery performance is only marginally impacted by increasing speed or noise in the mobility model, that affects its predictive ability. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Segmentation of Edge Preserving Gradient Vector Flow: An Approach Toward Automatically Initializing and Splitting of Snakes
Authors: Chunming Li, Jundong Liu, Martin D. Fox
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Active contours or snakes have been extensively utilized in handling image segmentation and classification problems. In traditional active contour models, snake initialization is performed manually by users, and topological changes, such as splitting of the snake, can not be automatically handled. In this paper, we introduce a new method to solve the snake initialization and splitting problem, based on an area segmentation approach: the external force field is segmented first, and then the snake initialization and splitting can be automatically performed by using the segmented external force field. Such initialization and splitting produces multiple snakes, each of which is within the capture range associated to an object and will be evolved to the object boundary. The external force used in this paper is a gradient vector flow with an edge-preserving property (EPGVF), which can prevent the snakes from passing over weak boundaries. To segment the external force field, we represent it with a graph, and a graph-theory approach can be taken to determine the membership of each pixel. Experimental results establish the effectiveness of the proposed approach.
XQuery Midflight: Emerging Database-Oriented Paradigms and a Classification of Research Advances
Authors: Ioana Manolescu, Yannis Papakonstantinou
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

XQuery processing is one of the prime research topics of the database community. At the same time, XQuery research is still in a "pre-paradigmatic" stage, where the conventional symptoms of the stage are observed: It is hard to piece together point efforts into a big picture. Similarities and interplay opportunities between parallel efforts are "lost in the translation" across the different paradigms. The goal of this tutorial is to federate the plethora of works, and categorize existing work and future topics along a few reference paradigms that fuse existing results around a reference architecture.