ppxscal/embedding_network huggingface dataset:
Object of interest-based visual navigation, retrieval, and semantic content identification system
Authors: Khalid Idrissi, Guillaume Lavoué, Julien Ricard, Atilla Baskurt
Venue: Computer Vision and Image Understanding (2004)

This study presents a content-based image retrieval system IMALBUM based on local region of interest called object of interest (OOI). Each segmented or user-selected OOI is indexed with new local adapted descriptors associated to color, texture, and shape features. This local approach is an efficient way to associate the local semantic content with low-level descriptors (color, texture, shape, etc.) computed on regions selected by the user. So the user actively takes part in the indexing process (offline) and can use a selected OOI as a query for the retrieval system (online). The IMALBUM system proposes original functionalities. A visual navigation tool allows to surf in the image database when the user has no precise idea of what he is really searching for in the database. Furthermore, when an OOI is selected as a query for retrieval, a semantic content identification tool indicates to the user the probable class of this unknown object. The performance of these different tools are evaluated on different databases.
Approximation algorithm for k-node connected subgraphs via critical graphs
Authors: G. Kortsarz, Z. Nutov
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We present two new approximation algorithms for the problem of finding a k-node connected spanning subgraph (directed or undirected) of minimum cost. The best known approximation guarantees for this problem were O(min (k,n/√n-k)) for both directed and undirected graphs, and O(ln k) for undirected graphs with n ≥ 6k2, where n is the number of nodes in the input graph. Our first algorithm has approximation ratio O(k/n-kln 2 k, which is O(ln2 k) except for very large values of k, namely, k=n-o(n). This algorithm is based on a new result on l-connected p-critical graphs, which is of independent interest in the context of graph theory. Our second algorithm uses the primal-dual method and has approximation ratio O(√n ln k) for all values of n,k. Combining these two gives an algorithm with approximation ratio O(ln k • min (√k, k/n-k ln k)), which asymptotically improves the best known approximation guarantee for directed graphs for all values of n,k, and for undirected graphs for k> √n⁄6. Moreover, this is the first algorithm that has an approximation guarantee better than Θ(k) for all values of n,k. Our approximation ratio also provides an upper bound on the integrality gap of the standard LP-relaxation to the problem.As a byproduct, we also get the following result which is of independent interest. To get a faster implementation of our algorithms, we consider the problem of adding a minimum-cost edge set to increase the outconnectivity of a directed graph by Δ a graph is said to be l-outconnected from its node r if it contains l internally disjoint paths from r to any other node. The best known time complexity for the later problem is O(m3). For the particular case of Δ=1, we give a primal-dual algorithm with running time O(m2).
An integrated agent-based approach for responsive control of manufacturing resources
Authors: M. K. Lim, D. Z. Zhang
Venue: Computers and Industrial Engineering (2004)

Due to the dynamic fluctuation of customer demands in the global market, manufacturing enterprises are facing difficulties in rapidly responding to market changes. The aim of this research is to develop a system to integrate dynamic process planning and dynamic production scheduling for the purpose of increasing the responsiveness of adaptive manufacturing systems in accommodating dynamic market changes (rapidly changing demand patterns or product varieties). The concept of Multi-Agent Systems (MAS) has been adopted in this study. All of the tasks related to process planning, optimization and scheduling in this system are carried out by autonomous agents that are capable of interacting and negotiating with each other to bid for jobs and make decisions. On the one hand, this system optimizes the utilization of manufacturing resources and on the other hand, it also provides a platform where the reconfiguration of manufacturing systems can be assessed. This system has been implemented on a Java platform and a case study is provided to elaborate on this system and evaluate its implementation.
Multi-Domain Clock Skew Scheduling
Authors: Kaushik Ravindran, Andreas Kuehlmann, Ellen Sentovich
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

The application of general clock skew scheduling is practicallylimited due to the difficulties in implementing a wide spectrum ofdedicated clock delays in a reliable manner. This results in a significantlimitation of the optimization potential. As an alternative,the application of multiple clocking domains with dedicatedphase shifts that are implemented by reliable, possibly expensivedesign structures can overcome these limitations and substantiallyincrease the implementable optimization potential of clock adjustments.In this paper we present an algorithm for constrained clockskew scheduling which computes for a given number of clockingdomains the optimal phase shifts for the domains and the assignmentof the individual registers to the domains. For the within-domainlatency values, the algorithm can assume a zero-skew clockdelivery or apply a user-provided upper bound. Our experimentsdemonstrate that a constrained clock skew schedule using a fewclocking domains combined with small within-domain latency canreliably implement the full sequential optimization potential to dateonly possible with an unconstrained clock schedule.
Indexing spatio-temporal trajectories with Chebyshev polynomials
Authors: Yuhan Cai, Raymond Ng
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

In this paper, we attempt to approximate and index a d- dimensional (d &ge; 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose the polynomial, including (continuous)Fourier transforms, splines, non-linear regressino, etc. Some of these possiblities have indeed been studied beofre. We hypothesize that one of the best possibilities is the polynomial that minimizes the maximum deviation from the true value, which is called the minimax polynomial. Minimax approximation is particularly meaningful for indexing because in a branch-and-bound search (i.e., for finding nearest neighbours), the smaller the maximum deviation, the more pruning opportunities there exist. However, in general, among all the polynomials of the same degree, the optimal minimax polynomial is very hard to compute. However, it has been shown thta the Chebyshev approximation is almost identical to the optimal minimax polynomial, and is easy to compute [16]. Thus, in this paper, we explore how to use the Chebyshev polynomials as a basis for approximating and indexing d-dimenstional trajectories.The key analytic result of this paper is the Lower Bounding Lemma. that is, we show that the Euclidean distance between two d-dimensional trajectories is lower bounded by the weighted Euclidean distance between the two vectors of Chebyshev coefficients. this lemma is not trivial to show, and it ensures that indexing with Chebyshev cofficients aedmits no false negatives. To complement that analystic result, we conducted comprehensive experimental evaluation with real and generated 1-dimensional to 4-dimensional data sets. We compared the proposed schem with the Adaptive Piecewise Constant Approximation (APCA) scheme. Our preliminary results indicate that in all situations we tested, Chebyshev indexing dominates APCA in pruning power, I/O and CPU costs.
Efficient reduction of finite state model checking to reachability analysis
Authors: Viktor Schuppan, Armin Biere
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2004)

Two types of temporal properties are usually distinguished: safety and liveness. Recently we have shown how to verify liveness properties of finite state systems using safety checking. In this article we extend the translation scheme to typical combinations of temporal operators. We discuss optimizations that limit the overhead of our translation. Using the notions of predicated diameter and radius we obtain revised bounds for our translation scheme. These notions also give a tight bound on the minimal completeness bound for simple liveness properties. Experimental results show the feasibility of the approach for complex examples. For one example, even an exponential speedup can be observed.
A Paradigm for Dynamic Coordination of Multiple Robots
Authors: Luiz Chaimowicz, Vijay Kumar, Mario F. M. Campos
Venue: Autonomous Robots (2004)

In this paper, we present a paradigm for coordinating multiple robots in the execution of cooperative tasks. The basic idea in the paper is to assign to each robot in the team, a role that determines its actions during the cooperation. The robots dynamically assume and exchange roles in a synchronized manner in order to perform the task successfully, adapting to unexpected events in the environment. We model this mechanism using a hybrid systems framework and apply it in different cooperative tasks: cooperative manipulation and cooperative search and transportation. Simulations and real experiments demonstrating the effectiveness of the proposed paradigm are presented.
Repairable Fault Tree for the Automatic Evaluation of Repair Policies
Authors: Daniele Codetta Raiteri, Mauro Iacono, Giuliana Franceschinis, Valeria Vittorini
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Fault trees are a well known mean for the evaluation ofdependability of complex systems. Many extensions havebeen proposed to the original formalism in order to enhancethe advantages of Fault Tree Analysis for the designand assessment of systems. In this paper we proposean extension, Repairable Fault Trees, which allows the designerto evaluate the effects of different repair policies ona repairable system: this extended formalism has been integratedin a multi-formalism multi-solution framework, andit is supported by a solution technique which transparentlyexploits Generalized Stochastic Petri Nets (GSPN) for modellingthe repairing process. The modelling technique andthe solution process are illustrated through an example.
Learning the Kernel Matrix with Semidefinite Programming
Authors: Gert R. G. Lanckriet, Nello Cristianini, Peter Bartlett, Laurent El Ghaoui, Michael I. Jordan
Venue: The Journal of Machine Learning Research (2004)

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive semidefinite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space---classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semidefinite programming (SDP) techniques. When applied to a kernel matrix associated with both training and test data this gives a powerful transductive algorithm---using the labeled part of the data one can learn an embedding also for the unlabeled part. The similarity between test points is inferred from training points and their labels. Importantly, these learning problems are convex, so we obtain a method for learning both the model class and the function without local minima. Furthermore, this approach leads directly to a convex method for learning the 2-norm soft margin parameter in support vector machines, solving an important open problem.
A network-failure-tolerant message-passing system for terascale clusters
Authors: Richard L. Graham, Sung-Eun Choi, David J. Daniel, Nehal N. Desai, Ronald G. Minnich, Craig E. Rasmussen, L. Dean Risinger, Mitchel W. Sukalski
Venue: International Journal of Parallel Programming (2003)

The Los Alamos Message Passing Interface (LA-MPI) is an end-to-end network-failure-tolerant message-passing system designed for terascale clusters. LAMPI is a standard-compliant implementation of MPI designed to tolerate network-related failures including I/O bus errors, network card errors, and wire-transmission errors. This paper details the distinguishing features of LA-MPI, including support for concurrent use of multiple types of network interface, and reliable message transmission utilizing multiple network paths and routes between a given source and destination. In addition, performance measurements on production-grade platforms are presented.
Fuzzy Conditional Probability Relations and their Applications in Fuzzy Information Systems
Authors: Rolly Intan, Masao Mukaidono
Venue: Knowledge and Information Systems (2004)

In our real-world applications, data may be imprecise in which levels or degrees of preciseness of data are intuitively different. In this case, fuzzy set expressions are considered as an alternative to represent the imprecise data. In general, the degree of similarity relationship between two fuzzy (imprecise) data in real-world applications may not necessarily be symmetric or transitive. In order to provide such a degree of similarity between two fuzzy data, we introduced the fuzzy conditional probability relation. The concept of a fuzzy conditional probability relation may be considered as a concrete example of weak similarity relation which in turn is a special type of fuzzy binary relation generalizing similarity relation. Two important applications concerning the application of Knowledge Discovery and Data Mining (KDD) in the presence of a fuzzy data table (usually called fuzzy information system), namely removing redundant objects and recognizing partial or total dependency of (domain) attributes, are considered induced by the fuzzy conditional probability relation. Here, the fuzzy information system contains precise as well as imprecise data (fuzzy values) about objects of interest characterized by some attributes. Related to the dependency of attributes, we introduce the fuzzy functional dependency that satisfies Armstrong&#x2019;s Axioms. In addition, we also discuss some interesting applications such as approximate data reduction and projection, approximate data querying and approximate joining in order to extend the query system.
A Deliberative Model for Self-Adaptation Middleware Using Architectural Dependency
Authors: N. Badr, A. Taleb-Bendiab, M. Randles, D. Reilly
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

A crucial prerequisite to externalized adaptation is an understanding of how components are interconnected, or more particularly how and why they depend on one another. Such dependencies can be used to provide an architectural model, which provides a reference point for externalized adaptation. In this paper, it is described how dependencies are used as a basis to systems' self-understanding and subsequent architectural reconfigurations. The approach is based on the combination of: instrumentation services, a dependency meta-model and a system controller. In particular, the latter uses self-healing repair rules (or conflict resolution strategies), based on an Extensible Beliefs, Desires and Intention (EBDI) model, to reflect reconfiguration changes back to a target application under examination.
Pagoda: a dynamic overlay network for routing, data management, and multicasting
Authors: Ankur Bhargava, Kishore Kothapalli, Chris Riley, Christian Scheideler, Mark Thober
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for these systems. While a large collection of scalable peer-to-peer overlay networks has been proposed in recent years, many fundamental questions have remained open. Some of these are: Is it possible to design deterministic peer-to-peer overlay networks with properties comparable to randomized peer-to-peer systems? How can peers of non-uniform bandwidth be organized in an overlay network?We propose a dynamic overlay network called Pagoda that provides solutions to both of these problems. The Pagoda network has a constant degree, a logarithmic diameter, and a 1/logarithmic expansion, and therefore matches the properties of the best randomized overlay networks known so far. However, in contrast to these networks, the Pagoda is deterministic and therefore guarantees these properties. The Pagoda can be used to organize both nodes with uniform bandwidth and nodes with non-uniform bandwidth. For nodes with uniform bandwidth, any node insertion or deletion can be executed with logarithmic work, and for nodes with non-uniform bandwidth, any node insertion and deletion can be executed with polylogarithmic work. Moreover, the Pagoda overlay network can route arbitrary multicast problems with a congestion that is within a logarithmic factor of what a best possible overlay network of logarithmic degree for that particular multicast problem can achieve, even though the Pagoda is a constant degree network. This holds even for nodes of arbitrary non-uniform bandwidths. We also show that the Pagoda network can be used for efficient data management.
Consumers of e-health: patterns of use and barriers
Authors: James G. Anderson
Venue: Social Science Computer Review (2004)

In 2002, 80% of all adults in the United States sought health information and/or services online. This article reports the results of computer-assisted telephone interviews of a national random sample of 186 adults. The purpose of the survey was to clarify the circumstances under which consumers utilize Internet health resources and identify barriers to Internet use. The results indicated that although 78% of the respondents had used the Internet to obtain health information, only about 10% communicated by e-mail with their providers, purchased supplies over the web, or used the Internet to manage a chronic disease. At the same time, more than 50% of the respondents indicated an interest in using the Internet for clinical purposes. Major barriers to the use of the Internet for health-related purposes were potential threats to privacy, inaccuracy of information, problems in evaluating the quality of information and services obtained from the web, and physician disapproval.
A Real-Time Model for the Robotic Highway Safety Marker System
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

This paper presents the design and implementation of areal-time model for the global control of robotic highwaysafety markers. Problems addressed in the system are: 1)poor scalability and predictability as the number of markersincreases, 2) jerky movement of markers, and 3) false-hitscaused by environment objects.We extensively analyze the system and offer two solutions:a basic solution and an enhanced solution. They arebuilt respectively upon two task models: the periodic taskmodel and the variable rate execution task model. The formeris characterized by four static parameters: phase, period,worst case execution time and relative deadline. Thelatter has similar parameters. Its parameter values, however,are allowed to change at arbitrary times. We thenexamine two typical real-time scheduling approaches: ratemonotonic (RM) priority driven and earliest deadline first(EDF). Analysis of their sufficient conditions shows that oursystem is feasibly schedulable under either RM or EDF. Thisconclusion justifies that the path for each safety marker canbe guaranteed to be smooth under the designed real-timesystem. For the scalability issue, we present a sufficient conditionfor the upper bound on the number of barrel robotsthat can be reliably controlled.One key technique integrated into our real-time system isthe Hough transform. We refine its traditional implementationso that, for the task of detecting safety markers, the timecomplexity decreases and the reliability increases with onlyslight additional storage for search windows. The basic ideabehind our improvements is to limit the search window forsafety markers.
Covering sharing trees: a compact data structure for parameterized verification
Authors: Giorgio Delzanno, Jean-Fran&#x00e7;ois Raskin, Laurent Van Begin
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2004)

The control state reachability problem is decidable for well-structured infinite-state systems like (Lossy) Petri Nets, Vector Addition Systems, and broadcast protocols. An abstract algorithm that solves the problem is the backward reachability algorithm of [1, 21 ]. The algorithm computes the closure of the predecessor operator with respect to a given upward-closed set of target states. When applied to this class of verification problems, symbolic model checkers based on constraints like [7, 26 ] suffer from the state explosion problem.In order to tackle this problem, in [13] we introduced a new data structure, called covering sharing trees, to represent in a compact way collections of infinite sets of system configurations. In this paper, we will study the theoretical complexity of the operations over covering sharing trees needed in symbolic model checking. We will also discuss several optimizations that can be used when dealing with Petri Nets. Among them, in [14] we introduced a new heuristic rule based on structural properties of Petri Nets that can be used to efficiently prune the search during symbolic backward exploration. The combination of these techniques allowed us to turn the abstract algorithm of [1, 21 ] into a practical method. We have evaluated the method on several finite-state and infinite-state examples taken from the literature [2, 18 , 20 , 30 ]. In this paper, we will compare the results we obtained in our experiments with those obtained using other finite and infinite-state verification tools.
Bit-rate Allocation Control and Quality Improvement for Color Channels in HMVQ Image Compression
Authors: Jiangling Guo, Prateek Shrivastava, Kayla Kepley, Shuyu Yang, Sunanda Mitra, Brian Nutter
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Medical images usually require higher fidelity than commonly used natural images,especially with respect to detail preservation. Color medical images also require a higherdegree of color preservation. In this paper, we present the extension of the novel gray-scaleimage compression technique, Hybrid Multi-scale Vector Quantization (HMVQ) to colorimage compression. Limitations of common color image compression methods in controllingbit-rate allocation for color channels are discussed, and the ability of HMVQ in overcomingsuch limitations while improving the color quality is demonstrated.