pinecone/core-2020-05-10-deduplication huggingface dataset:
Robust color contour object detection invariant to shadows

Presentado al 12th Iberoamerican Congress on Pattern Recognition (CIARP-2007) celebrado en  Valparaiso (Chile) del 13 al 16 de noviembre.In this work a new robust color and contour based object detection method in images with varying shadows is presented. The method relies on a physics-based contour detector that emphasizes material changes and a contour-based boosted classifier. The method has been tested in a sequence of outdoor color images presenting varying shadows using two classifiers, one that learns contour object features from a simple gradient detector, and another that learns from the photometric invariant contour detector. It is shown that the detection performance of the classifier trained with the photometric invariant detector is significantly higher than that of the classifier trained with gradient detector.This work was supported by projects: 'Integration of robust perception, learning, and navigation systems in mobile robotics' (J-0929), 'Ubiquitous networking robotics in urban settings' (E-00938).This work is supported in part by the Spanish Ministry of Education and Science under project DPI 2004-5414 and the EU URUS project FP6-IST-\ud
045062 to JS, MV, JAC and AS; by the Generealitat of Catalonia’s Department of Education and Universities and the European Social Fund to JS;\ud
and by the Technical University of Catalonia to MV. JAC is a Ramón y Cajal Postdoctoral Fellow.Peer Reviewe
Strongly polynomial algorithm for the intersection of a line with a polymatroid

International audienceWe present a new algorithm for the problem of determining the intersection of a half-line with a polymatroid. We then propose a second algorithm which generalizes the first algorithm and solves a parametric linear program. We prove that these two algorithms are strongly polynomial and that their running time is O ( n 8 + γ n 7 ) where γ is the time for an oracle call. The second algorithm gives a polynomial algorithm to solve the submodular function minimization problem and to compute simultaneously the strength of a network with complexity bound O ( n 8 + γ n 7 )
Theory of Principal Partitions Revisited

The theory of principal partitions of discrete systems such as graphs, matrices, matroids, and submodular systems has been developed since 1968. In the early stage of the developments during 1968–75 the principal partition was considered as a decomposition of a discrete system into its components together with a partially ordered structure of the set of the components. It then turned out that such a decomposition with a partial order on it arises from the submodularity structure pertinent to the system and it has been realized that the principal partitions are closely related to resource allocation problems with submodular structures, which are kind of dual problems. The aim of this paper is to give an overview of the developments in the theory of principal partitions and some recent extensions with special emphasis on its relation to associated resource allocation problems in order to make it better known to researchers in combinatorial optimization
Composing structural views in xADL

Experience with building an architecture for an industrial Automatic Guided Vehicle Transportation System (AGVTS) shows that several essential concerns crosscut the architectural views. To cope with this, a stronger separation proved to be necessary, i.e. using different views for different concerns. In practice this was difficult, since the support for relations between views is very limited. This makes separation of concerns in views hard, thereby increasing maintenance overhead and reducing reuse capabilities. Our claim is that specifying compositions of views is as important as specifying the views itself. This paper extends a representative architectural description language (xADL) which support for composing structural views, by introducing three relations, namely refinement, mapping, and unification. Improving separation of concerns in views and their explicit composition enhances architecture understandability and changeability. The feasibility of the relations is assessed by redesigning the AGVTS architecture. Based on a real maintenance scenario, we investigate to what extent these explicit compositions lead (or not) to enhanced architectural changeability for evolving the distribution strategy in the AGVTS system.status: publishe
Collaborative Decision Making Amongst Human and Artificial Beings

This chapter provides an overview of collaborative decision making between human and artificial beings. The chapter presents concepts, examples and scenarios that can assist in designing collaborative systems mixing humans and artificial beings as fully equal partners (FEPs). Human and artificial beings are demonstrated performing tasks cooperatively with each other, while being fully replaceable or interchangeable with other beings regardless of their biological or artificial nature. These beings are also not necessarily aware whether his/her/its game partners are human or artificial. This is not to say that FEPs are equal in decision making abilities, but rather that these partners possess an equal communication ability. As a result, a game player is not aware whether his/her game partner is a human or artificial being.   Also outlined is the collaborative process and how this process allows FEPs to collaborate in a structured manner. Once defined, a simple practical example of a collaborative FEPs system is demonstrated: the electronic meeting room. Shown step by step are the processes and values used to arrive at the final outcome, describing in detail how these human and artificial beings collaborate within the electronic meeting room.   Finally, after working through the play scenario and discussing possible future enhancements, some practical domains where collaborative FEPs are applicable in various industries are defined.   By the end of this chapter the reader should have an understanding of the following topics:  堠 Understanding the concept of human and artificial beings as collaborative fully equal partners.   堠 Be introduced to the cognitive elements of artificial beings and how these contribute to constructing a FEPs concept.   堠 Having been walked through a play scenario example of human and artificial being collaboration, will have the necessary resources to create their own play scenarios.    堠 Be aware of a number of practical applications for collaborative FEPs in industry applications such as Online Training and Education, Human Resources, Project Management, Transportation and Socially Oriented Computer Games for clinical psychology and behavioral studies.Griffith Sciences, Griffith School of EngineeringFull Tex
Assessing a distributed market infrastructure for economics-based service selection

Service selection is an important issue for market-oriented\ud
Grid infrastructures. However, few results have been published on the\ud
use and evaluation of market models in deployed prototypes, making it\ud
difficult to assess their capabilities. In this paper we study the integration\ud
of an extended version of Zero Intelligence Plus (ZIP) agents in a middleware\ud
for economics-based selection of Grid services. The advantages\ud
of these agents compared to alternatives is their fairly simple messaging\ud
protocol and negotiation strategy. By deploying the middleware on\ud
several machines and running experiments we observed that services are\ud
proportionally assigned to competing traders as should be in a fair market.\ud
Furthermore, varying the environmental conditions we show that\ud
the agents are able to respond to the varying environmental constraints\ud
by adapting their market prices
Query Expansion and Interpretation to Go Beyond Semantic P2P Interoperability

International audienceIn P2P data management systems, semantic interoperability between any two peers that do not share the same ontology relyes on ontology matching. The established correspondences, i.e. the “shared” parts of the ontologies are indeed essential to exchange information. But to what extent the “unshared” part can contribute to information exchange. In this paper, we address this question. We focus on a P2P document management system, where documents and queries are represented by semantic vectors. We propose a specific query expansion step at the query initiator's side and a query interpretation step at the document provider's. Through these steps, unshared concepts contribute to evaluate the relevance of documents wrt a given query. The experiments show that the proposed method enables to correctly evaluate the relevance of a document even if concepts of a query are not shared. In some cases, we are able to find up to 90% of the documents that would be selected when all the concepts are shared
Understanding the Occurrence of Errors in Process Models based on Metrics

Business process models play an important role for the management, design, and improvement of process organizations and process-aware information systems. Despite the extensive application of process modeling in practice, there are hardly empirical results available on quality aspects of process models. This paper aims to advance the understanding of this matter by analyzing the connection between formal errors (such as deadlocks) and a set of metrics that capture various structural and behavioral aspects of a process model. In particular, we discuss the theoretical connection between errors and metrics, and provide a comprehensive validation based on an extensive sample of EPC process models from practice. Furthermore, we investigate the capability of the metrics to predict errors in a second independent sample of models. The high explanatory power of the metrics has considerable consequences for the design of future modeling guidelines and modeling tools
Comparison of Techniques for Mitigating the Effects of Illumination Variations on the Appearance of Human Target

Several techniques have been proposed to date to build colour invariants between camera views with varying illumination conditions. In this paper, we propose to improve colour invariance by using data-dependent techniques. To this aim, we compare the effectiveness of histogram stretching, illumination filtration, full histogram equalisation and controlled histogram equalisation in a video surveillance domain. All such techniques have limited computational requirements and are therefore suitable for real time implementation. Controlled histogram equalisation is a modified histogram equalisation operating under the influence of a control parameter [1]. Our empirical comparison looks at the ability of these techniques to make the global colour appearance of single human targets more matchable under illumination changes, whilst still discriminating between different people. Tests are conducted on the appearance of individuals from two camera views with greatly differing illumination conditions and invariance is evaluated through a similarity measure based upon colour histograms. In general, our results indicate that these techniques improve colour invariance; amongst them, full and controlled equalisation consistently showed the best performance
Iterative Methods for Visualization of Implicit Surfaces on GPU

The original publication is available at www.springerlink.comInternational audienceThe ray-casting of implicit surfaces on GPU has been explored in the last few years. However, until recently, they were restricted to second degree (quadrics). We present an iterative solution to ray cast cubics and quartics on GPU. Our solution targets efficient implementation, obtaining interactive rendering for thousands of surfaces per frame. We have given special attention to torus rendering since it is a useful shape for multiple CAD models. We have tested four different iterative methods, including a novel one, comparing them with classical tessellation solution
Elaborating a decentralized market information system

A Decentralized Market Information System (DMIS) that aggregates and provides information about markets is an important component for achieving markets in Grid and Peer-to-Peer systems. The proposed work is the development of a framework for the DMIS, which fulfils the economic provision within the main technical requirements like scalability towards nodes and data attributes and robustness against failures. The proposed work also allows obtaining results concerning the trade-off between economic benefits and technical costs. Introducing dynamic adaptive processes promises improvements in efficiency with regards to distributed queries and routing structures. This research proposal presents and discusses the research questions and challenges, the current knowledge and the research methodology proposed for the development of the DMIS framework.Peer Reviewe
Modular Web Queries — From Rules to Stores

Even with all the progress in Semantic technology, accessing Web
data remains a challenging issue with new Web query languages and approaches
appearing regularly. Yet most of these languages, including W3C approaches
such as XQuery and SPARQL, do little to cope with the explosion of the data
size and schemata diversity and richness on the Web. In this paper we propose
a straightforward step toward the improvement of this situation that is simple to
realize and yet effective: Advanced module systems that make partitioning of (a)
the evaluation and (b) the conceptual design of complex Web queries possible.
They provide the query programmer with a powerful, but easy to use high-level
abstraction for packaging, encapsulating, and reusing conceptually related parts
(in our case, rules) of a Web query. The proposed module system combines ease
of use thanks to a simple core concept, the partitioning of rules and their consequences
in flexible “stores”, with ease of deployment thanks to a reduction
semantics. We focus on extending the rule-based Semantic Web query language
Xcerpt with such a module system though the same approach can be applied to
other (rule-based) languages as well.
Information-theoretic security without an honest majority

We present six multiparty protocols with information-theoretic security that
tolerate an arbitrary number of corrupt participants. All protocols assume
pairwise authentic private channels and a broadcast channel (in a single case,
we require a simultaneous broadcast channel). We give protocols for veto, vote,
anonymous bit transmission, collision detection, notification and anonymous
message transmission. Not assuming an honest majority, in most cases, a single
corrupt participant can make the protocol abort. All protocols achieve
functionality never obtained before without the use of either computational
assumptions or of an honest majority.Comment: 15 pages, to appear in Proceedings of ASIACRYPT 200
Anonymous quantum communication

We present the first protocol for the anonymous transmission of a quantum
state that is information-theoretically secure against an active adversary,
without any assumption on the number of corrupt participants. The anonymity of
the sender and receiver is perfectly preserved, and the privacy of the quantum
state is protected except with exponentially small probability. Even though a
single corrupt participant can cause the protocol to abort, the quantum state
can only be destroyed with exponentially small probability: if the protocol
succeeds, the state is transferred to the receiver and otherwise it remains in
the hands of the sender (provided the receiver is honest).Comment: 11 pages, to appear in Proceedings of ASIACRYPT, 200
Applying MCRDR to a multidisciplinary domain

This paper details updated results concerning an implementation of a Multiple Classification Ripple Down Rules (MCRDR) system which can be used to provide quality Decision Support Services to pharmacists practicing medication reviews (MRs), particularly for high risk patients. The system was trained on 126 genuine cases by an expert in the field; over the course of 19 hours the system had learned 268 rules and was considered to encompass over 80% of the domain. Furthermore, the system was found able to improve the quality and consistency of the medication review reports produced, as it was shown that there was a high incidence of missed classifications under normal conditions, which were repaired by the system automatically. However, shortcomings were identified including an inability to handle absent data, and shortcomings concerning standardization in the domain, proposals to solve these shortcomings are included
Advances in Local Search for Satisfiability

In this paper we describe a stochastic local search (SLS)  procedure for finding satisfying models of satisfiable propositional for-  mulae. This new algorithm, gNovelty+, draws on the features of two  other WalkSAT family algorithms: R+AdaptNovelty+ and G2WSAT,  while also successfully employing a dynamic local search (DLS) clause  weighting heuristic to further improve performance.  gNovelty+ was a Gold Medal winner in the random category of the 2007  SAT competition. In this paper we present a detailed description of the  algorithm and extend the SAT competition results via an empirical study  of the effects of problem structure and parameter tuning on the perfor-  mance of gNovelty+. The study also compares gNovelty+ with two of the  most representative WalkSAT-based solvers: G2WSAT, AdaptNovelty+  ,  and two of the most representative DLS solvers: RSAPS and PAWS.  Our new results augment the SAT competition results and show that  gNovelty+ is also highly competitive in the domain of solving structured  satisfiability problems in comparison with other SLS techniques.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Temporal Extensions to Defeasible Logic

In this paper, we extend Defeasible Logic (a computationally-oriented non-monotonic logic) in order to deal with temporalised rules. In particular, we extend the logic to cope with durative facts, as well as with delays between the antecedent and the consequent of rules. We showed that the extended temporalised framework is suitable to model different types of causal relations which have been identified by the specialised literature. We also prove that the computational properties of the original logic are still retained by the extended approach
Automated intelligent abundance analysis of scallop \ud
survey video footage

Underwater video is increasingly being pursued as a low impact alternative to traditional techniques (such as trawls and dredges) for determining abundance and size frequency of target species. Our research focuses on automatically annotating survey scallop video footage using artificial intelligence techniques. We use a multi-layered approach which implements an attention selection process followed by sub-image segmentation and classification. Initial attention selection is performed using the University of Southern California's (USCs) iLab Neuromorphic Visual Toolkit (iNVT). Once the iNVT has determined regions of potential interest we use image segmentation and feature extraction techniques to produce data suitable for analysis within the Weka machine learning workbench environment
Weight Redistribution for Unweighted MAX-SAT

Many real-world problems are over-constrained and require  search techniques adapted to optimising cost functions rather than search-  ing for consistency. This makes the MAX-SAT problem an important  area of research for the satisility (SAT) community. In this study we  perform an empirical analysis of several of the best performing SAT local  search techniques in the domain of unweighted MAX-SAT. In particular,  we test two of the most recently developed SAT clause weight redistri-  bution algorithms, DDFW and DDFW+, against three more well-known  techniques (RSAPS, AdaptNovelty+ and PAWS). Based on an empir-  ical study across a range of previously studied problems we conclude  that DDFW is the most promising algorithm in terms of robust average  performance.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Protein structure alignment using maximum cliques and local search

The protein structure alignment problem addresses the question of  measuring the degree of similarity, in three-dimensional structure, of two proteins.  The representation of each protein using a simple contact map allows the  correspondence graph for the protein pair to be generated and the maximum  clique within this graph provides a measure of the structural similarity between  the two proteins. This study uses a recently developed maximum clique algorithm,  Phased Local Search (PLS), to locate the maximum cliques within correspondence  graphs.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Information Flow Testing

International audienceNoninterference, which is an information flow property, is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. Noninterference verification mechanisms are usually based on static analyses and, to a lesser extent, on dynamic analyses. In contrast to those works, this paper proposes an information flow testing mechanism. This mechanism is sound from the point of view of noninterference. It is based on standard testing techniques and on a combination of dynamic and static analyses. Concretely, a semantics integrating a dynamic information flow analysis is proposed. This analysis makes use of static analyses results. This special semantics is built such that, once a path coverage property has been achieved on a program, a sound conclusion regarding the noninterfering behavior of the program can be established
Spectropolarimetry of the Deep Impact target comet 9P/Tempel 1 with HiVIS

Spectropolarimetry of the Deep Impact target, comet 9P/ Tempel 1, was performed during the impact event on July 4th, 2005 with the HiVIS Spectropolarimeter and the AEOS 3.67m telescope on Haleakala, Maui. We observed atypical polarization spectra that changed significantly in the few hours after the impact. The polarization is sensitive to the geometry, size and composition of the scattering particles. Our first measurement, beginning 8 minutes after impact and centered at 6:30UT, showed a polarization of 4% at 650 nm falling to 3% at 950 nm. The next observation, centered an hour later, showed a polarization of 7% at 650 nm falling to 2% at 950nm. This corresponds to a spectropolarimetric gradient, or slope, of 0.9% per 1000 Angstroms 40 minutes after impact, decreasing to a slope of -2.3% per 1000 Angstroms 75 minutes after impact. Both are atypical blue polarization slopes. The polarization values of 4% and 7% at 650nm are typical for comets at this scattering angle, whereas the low polarization of 2% and 3% at 950nm is not. This, combined with the IR spectroscopy performed by a number of observers during the event, suggests an increase in size, number, and crystallinity of the individual silicate particles (monomers) that are a constituant of the dust particles (aggregates) in the ejecta