ppxscal/embedding_network huggingface dataset:
Efficient Mean-Shift Tracking via a New Similarity Measure
Authors: Changjiang Yang, Ramani Duraiswami, Larry Davis
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local minima of a similarity measure between the color histograms or kernel density estimates of the model and target image. The most typically used similarity measures are the Bhattacharyya coefficient or the Kullback-Leibler divergence. In practice, these approaches face three difficulties. First, the spatial information of the target is lost when the color histogram is employed, which precludes the application of more elaborate motion models. Second, the classical similarity measures are not very discriminative. Third, the sample-based classical similarity measures require a calculation that is quadratic in the number of samples, making real-time performance difficult. To deal with these difficulties we propose a new, simple-to-compute and more discriminative similarity measure in spatial-feature spaces. The new similarity measure allows the mean shift algorithm to track more general motion models in an integrated way. To reduce the complexity of the computation to linear order we employ the recently proposed improved fast Gauss transform. This leads to a very efficient and robust nonparametric spatial-feature tracking algorithm. The algorithm is tested on several image sequences and shown to achieve robust and reliable frame-rate tracking.
Formal specification and analysis of the group domain of interpretation protocol using NPATRL and the NRL protocol analyzer
Authors: Catherine Meadows, Paul Syverson, Iliano Cervesato
Venue: Journal of Computer Security (2004)

Although research has been going on in the formal analysis of cryptographic protocols for a number of years, they are only slowly being integrated into the protocol design process. In this paper we describe how we furthered the integration of analysis and design by working closely with the Multicast Security Working Group in the Internet Engineering Task Force on the analysis of a proposed Internet Standard, the Group Domain Of Interpretation (GDOI) Protocol. We describe the challenges that had to be met before the analysis could be successfully completed, and some of the challenges that still remain. Perhaps not surprisingly, some of the most challenging work was in understanding the security requirements for group protocols in general. We give a detailed specification of the requirements for GDOI, describe our formal analysis of the protocol with respect to these requirements, and show how our analysis impacted the development of GDOI.
Combining classifiers in error correcting output coding
Authors: Nobuhiko Yamaguchi, Naohiro Ishii
Venue: Systems and Computers in Japan (2004)

The authors performed research on a pattern classifier using ECOC (Error Correcting Output Coding) which encodes learning patterns using error correction coding and then learns such that each discriminant function outputs the encoded values. In particular, in this research the authors focused on a method to decode the output of each discriminant function to class symbols, and then proposed a decoding method: WLS-ECOC (ECOC combination strategy based on Weighted Least Squares). WLS-ECOC estimated posterior probability for each class using the linear sum of the output of each discriminant function and then performed pattern recognition based on these posterior probabilities. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(4): 9&ndash;18, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10549
Extension of colorings
Authors: Ivan Izmestiev
Venue: European Journal of Combinatorics (2005)

Let K be a combinatorial (d - 1)-sphere with vertices colored in n colors, n ≥ d + 1. We prove that K bounds an n-colored combinatorial ball. This theorem generalizes previously known facts for d = 2 and 3. A further generalization is obtained. Namely, let L be a simplicial complex of dimension d and K be a subcomplex of L. Then any vertex coloring of K in n ≥ d + 1 colors extends to some subdivision of L relative to K. Besides, in both cases the extension can be required to use only d + 1 of n colors in the complement to K.
Varying cardinality in metonymic extensions to nouns
Authors: Helmut Horacek
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

Meaning shifting phenomena such as metonymy have recently attracted increasing interest of researchers. Though these phenomena have been addressed by plenty of computational methods, the impacts of cardinalities of metonymically related items have been widely ignored in all of them. Motivated by this lack of analysis, we have developed a method for representing expectations and knowledge about the cardinalities of metonymically related entities and for exploiting this information to build logical forms expressing metonymic relations, the entities related, and their cardinalities. The representation of lexically motivated knowledge is realized as an enhancement to Pustejovsky's Generative Lexicon, and the process of building logical forms takes into account overwriting of default information and mismatch of cardinality requirements. Our method enables a precise attachment of sentence complements, and it supports reference resolution in the context of metonymic expressions.
Approximate counts and quantiles over sliding windows
Authors: Arvind Arasu, Gurmeet Singh Manku
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

We consider the problem of maintaining &epsilon;-approximate counts and quantiles over a stream sliding window using limited space. We consider two types of sliding windows depending on whether the number of elements N in the window is fixed (fixed-size sliding window) or variable (variable-size sliding window). In a fixed-size sliding window, both the ends of the window slide synchronously over the stream. In a variable-size sliding window, an adversary slides the window ends independently, and therefore has the ability to vary the number of elements N in the window.We present various deterministic and randomized algorithms for approximate counts and quantiles. All of our algorithms require O(1/&epsilon; polylog(1/&epsilon;, N)) space. For quantiles, this space requirement is an improvement over the previous best bound of O(1/&epsilon;2 polylog(1/&epsilon;, N)). We believe that no previous work on space-efficient approximate counts over sliding windows exists.
Vision based robotic control
Authors: Brian Atkinson, Michael C. Duffy, Thomas Klingensmith, Robert Grabbe
Venue: Journal of Robotic Systems (2004)

The University of Colorado at Denver robotics society is constructing an autonomous ground vehicle (AGV) capable of accomplishing the Association of Unmanned Vehicle Systems International (AUVSI) competition objectives. The design presented features an engineering focus on a statistical, vision based discrete-time control system optimized for an exterior robotic vehicle. A simple robust strategy incorporates ultrasonic ranging to make this vehicle capable of negotiating the features presented in the autonomous challenge. &copy; 2004 Wiley Periodicals, Inc.
Hybrid semantic tagging for information extraction
Authors: Ronen Feldman, Benjamin Rosenfeld, Moshe Fresko, Brian D. Davison
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

The semantic web is expected to have an impact at least as big as that of the existing HTML based web, if not greater. However, the challenge lays in creating this semantic web and in converting existing web information into the semantic paradigm. One of the core technologies that can help in migration process is automatic markup, the semantic markup of content, providing the semantic tags to describe the raw content. This paper describes a hybrid statistical and knowledge-based information extraction model, able to extract entities and relations at the sentence level. The model attempts to retain and improve the high accuracy levels of knowledge-based systems while drastically reducing the amount of manual labor by relying on statistics drawn from a training corpus. The implementation of the model, called TEG (Trainable Extraction Grammar), can be adapted to any IE domain by writing a suitable set of rules in a SCFG (Stochastic Context Free Grammar) based extraction language, and training them using an annotated corpus. The experiments show that our hybrid approach outperforms both purely statistical and purely knowledge-based systems, while requiring orders of magnitude less manual rule writing and smaller amount of training data. We also demonstrate the robustness of our system under conditions of poor training data quality. This makes the system very suitable for converting legacy web pages to semantic web pages.
Stable and Responsive Six-Degree-of-Freedom Haptic Manipulation Using Implicit Integration
Authors: Miguel A. Otaduy, Ming C. Lin
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this paper we present a novel approach for simulating the rigid body dynamics of a haptically manipulated object using implicit integration. Our formulation requires the linearization of contact and manipulation forces, and it provides higher stability and responsiveness than previous methods. The linearization of contact forces, coupled with fast, perceptually based collision detection algorithms, enables us to perform highly stable and responsive6-degree-of-freedom haptic rendering of complex polygonal models.
Menu Selection with a Rotary Device Founded on Haptic and/or Graphic Information
Authors: Camilla Grane, Peter Bengtsson
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The purpose of the study reported in this paper was to compare three different types of interfaces providing: haptic information, graphic information, or combined haptic and graphic information in an easy menu selection task. The results suggested that the combined haptic and graphic interface was preferable to the graphic interface regarding accuracy, while both interfaces were fundamentally equal concerning completion time. The results also indicated that the combined haptic and graphic interface was less mentally demanding than either the graphic or the haptic interface. Solely haptic feedback obtained, without exception, worse results than the other cases.
Two dimensional reordering of functional test data for compression by ATE
Authors: Hamidreza Hashempour, Fabrizio Lombardi
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

This paper presents a novel approach for compressing functional test data in Automatic Test Equipment (ATE). A practical technique is presented for 2 Dimensional (2D) reordering of test data in which additionally to test vector reordering, column reordering is also applied. An ATE based approach to extract the original test vectors from the 2D ordered data is presented. The advantage of the approach is substantiated using the figure of merit of entropy for the 2D ordered test data of ISCAS benchmark circuits.
Bloom Filter-Based XML Packets Filtering for Millions of Path Queries
Authors: Xueqing Gong, Weining Qian, Ying Yan, Aoying Zhou
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem [2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One important challenge is that the number of path queries is huge. It is necessary to take an efficient data structure representing path queries. Another challenge is that these path queries usually vary with time. The maintenance of path queries determines the flexibility and capacity of a filtering system. In this paper, we introduce a novel approximate method for XML data filtering, which uses Bloom filters representing path queries. In this method, millions of path queries can be stored efficiently. At the same time, it is easy to deal with the change of these path queries. To improve the filtering performance, we introduce a new data structure, Prefix Filters, to decrease the number of candidate paths. Experiments show that our Bloom filter-based method takes less time to build routing table than automaton-based method. And our method has a good performance with acceptable false positive when filtering XML packets of relatively small depth with millions of path queries.
Measurement-based end to end latency performance prediction for SLA verification
Authors: C. M. Leung, J. A. Schormans
Venue: Journal of Systems and Software (2005)

End-to-end delay is one of the important metrics used to define perceived quality of service. Measurement is a fundamental tool of network management to assess the performance of the network. The conventional approach to measure the performance metrics is on an intrusive basis that may cause extra-burden to the network. In contrast to this, our scheme can be considered as non-intrusive. The main idea relies on the knowledge of the queuing behaviour. The queue length is non-intrusively monitored, and then we capture the parameters of the queue state distribution of every queue along the path in order to deduce the end-to-end delay performance.
ACAI: agent-based context-aware infrastructure for spontaneous applications
Authors: M. Khedr, A. Karmouch
Venue: Journal of Network and Computer Applications (2005)

The vision of people amalgamated with their surroundings in a spontaneous way created a new, context-aware era of human-computer interaction. The goal is to provide an infrastructure that can understand the current situation and act on that understanding. Context-awareness means that people, services and artifacts in an environment are integrated in a homogeneous manner in order to provide seamless service while still preserving privacy. To evolve from a passive state to an active pervasive state, the infrastructure must be able to support uniform context representation, to reason about context, to offer context-based service discovery, and to support a context management and communication protocol. In this paper, we present ACAI, an innovative Agent-based Context Aware infrastructure, equipped with the capabilities required to maintain spontaneous applications both locally and across different domains. We describe our ontology for modeling context that provides a common understanding of what context means and facilitates context inference. We propose a multi-agent framework that parallels the infrastructure design in order to assist in the development and runtime provisioning of spontaneous applications.
Implementation and performance of a particle-in-cell code written in Java: Research Articles
Authors: S. Markidis, G. Lapenta, W. B. VanderHeyden, Z. Budimlić
Venue: Concurrency and Computation: Practice Experience (2005)

Plasma simulation is an important example of a high-performance computing application where computer science issues are of great relevance. In a plasma, each particle, electron or ion, interacts with the external fields and with other particles in ways that can be readily and effectively emulated using object-oriented programming. However, the great cost of plasma simulations has traditionally discouraged object-oriented implementations due to their perceived inferior performance compared with classic procedural FORTRAN or C. In the present paper, we revisit this issue. We have developed a Java particle-in-cell code for plasma simulation, called Parsek. The paper considers different choices for the object orientation and tests their performance. We find that coarse-grained object orientation is faster and practically immune from any degradation compared with a standard procedural implementation (with static classes). The loss in performance for a fine-grained object orientation is a factor of about 50&percnt;, which can be almost completely eliminated using advanced Java compilation techniques. The Java code Parsek also provides an interesting realistic application of high-performance computing to compare the performance of Java with FORTRAN. We have conducted a series of tests considering various Java implementations and various FORTRAN implementations. We have also considered different computer architectures and different Java Virtual Machines and FORTRAN compilers. The conclusion is that with Parsek, object-oriented Java can reach CPU speed performances more or less comparable with procedural FORTRAN. This conclusion is remarkable and it is in agreement with the most recent benchmarks, but is at variance with widely held misconceptions about the alleged slowness of Java. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Tool integration using the web-services approach
Authors: J. D. Togni, R. P. Ribas, M. L. B. Lisboa, A. I. Reis
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

This paper proposes a protocol for data exchange to allow the communication of specialized tools with Eletronic Design Automation (EDA) frameworks. The BICO (BasIc type COnversor) protocol is based on SOAP, a Web-Service technology. The aim of BICO is to support interoperability, integration and cooperation between scripting and general-purpose languages, with minimum programming effort. The BICO protocol is able to automatically encode and decode data structures used as parameters of requests and replies of services implemented in different languages. Beyond the coder and decoder (CODEC) itself, a helper tool for the creation of the definitions needed by the protocol and some basic communication mechanisms is provided. Case studies are used to demonstrate the integration of specialized tools with commercial frameworks. The proposed protocol achieves interoperability with a simple and easy-to-learn mechanism and yet is very efficient for the purposes it was designed. The proposed integration method has learning costs affordable by university and small developers that want their tools linked to commercial environments or frameworks.
A Study on Design and Analysis of Virtual Fixtures for Cutting in Training Environments
Authors: Rodolfo Prada, Shahram Payandeh
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The escalating use of share-controlled applications, virtual training environments and tele-manipulated devices has motivated the application of force-feedback assistance. In this paper, we present and compare a set of geometrically-based virtual fixtures that provide graphic and force-feedback assistance for path-following task. Two types of force fields (i.e. attractive and reactive) defined within the virtual fixtures were implemented. A preliminary study on these fixtures suggests improvements in performance when force cues are provided through these entities.
Advanced fault analysis in web service composition
Authors: L. Ardissono, L. Console, A. Goy, G. Petrone, C. Picardi, M. Segnan, D. Theseider Dupré
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Currently, fault management in Web Services orchestrating multiple suppliers relies on a local analysis, that does not span across individual services, thus limiting the effectiveness of recovery strategies. We propose to address this limitation by employing Model-Based Diagnosis to enhance fault analysis. In our approach, a Diagnostic Web Service is added to the set of Web Services providing the overall service, and acts as a supervisor of their execution, by identifying anomalies and explaining them in terms of faults to be repaired.
Very large-scale vehicle routing: new test problems, algorithms, and results
Authors: Feiyue Li, Bruce Golden, Edward Wasil
Venue: Computers and Operations Research (2005)

The standard vehicle routing problem was introduced in the OR/MS literature about 45 years ago. Since then, the vehicle routing problem has attracted an enormous amount of research attention. In the late 1990s, large vehicle routing problem instances with nearly 500 customers were generated and solved using metaheuristics. In this paper, we focus on very large vehicle routing problems. Our contributions are threefold. First, we present problem instances with as many as 1200 customers along with estimated solutions. Second, we introduce the variable-length neighbor list as a tool to reduce the number of unproductive computations. Third, we apply record-to-record travel with a variable-length neighbor list to 32 problem instances and obtain high-quality solutions, very quickly.
Improved approximation algorithms for geometric set cover
Authors: Kenneth L. Clarkson, Kasturi Varadarajan
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

Given a collection S of subsets of some set U, and M ⊂ U, the set cover problem is to find the smallest subcollection C ⊂ S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve, even approximately, here we consider some geometric special cases, where usually U = Rd. Combining previously known techniques [3, 4], we show that polynomial time approximation algorithms with provable performance exist, under a certain general condition: that for a random subset R ⊂ S and function f(), there is a decomposition of the complement U ∖ ∪Y ∈ R Y into an expected f(|R|) regions, each region of a particular simple form. Under this condition, a cover of size O(f(|C|)) can be found in polynomial time. Using this result, and combinatorial geometry results implying bounding functions f(c) that are nearly linear, we obtain o(log c) approximation algorithms for covering by fat triangles, by pseudodisks, by a family of fat objects, and others. Similarly, constant-factor approximations follow for similar-sized fat triangles and fat objects, and for fat wedges. With more work, we obtain constant-factor approximation algorithms for covering by unit cubes in R3, and for guarding an x-monotone polygonal chain.
Enhancing Transport Layer Capability in HAPS--Satellite Integrated Architecture
Authors: C. E. Palazzi, C. Roseti, M. Luglio, M. Gerla, M. Y. Sanadidi, J. Stepanek
Venue: Wireless Personal Communications: An International Journal (2005)

The use of HAPS/UAV to enhance telecommunication capabilities has been proposed as an effective solution to support hot spot communications in limited areas. To ensure communication capabilities even in case of emergency (earthquake, power blackout, chemical/nuclear disaster, terrorist attack), when terrestrial fixed and mobile infrastructures are damaged or become unavailable, the access to satellites represents a reliable solution with worldwide coverage, even though it may suffer from shadowing impairment, especially in an urban environment. In this paper we approach an innovative and more challenging architecture foreseeing HAPS/UAV connected to the satellite in order to enlarge coverage and to allow interconnection with very remote locations. In this scenario, we have analysed TCP-based applications proposing some innovative techniques, both at protocol and at architectural level, to improve performance. In particular, we propose the use of a PEP technique, namely splitting, to speed up window growth in spite of high latency, combined with TCP Westwood as a very efficient algorithm particularly suitable and well performing over satellite links.