pinecone/core-2020-05-10-deduplication huggingface dataset:
Orientation invariant features for multiclass object recognition

Presentado al 11th Iberoamerican Congress on Pattern Recognition (CIARP/2006) celebrado en Cancún (México).We present a framework for object recognition based on simple scale and orientation invariant local features that when combined with a hierarchical multiclass boosting mechanism produce robust classifiers for a limited number of object classes in cluttered backgrounds. The system extracts the most relevant features from a set of training samples and builds a hierarchical structure of them. By focusing on those features common to all trained objects, and also searching for those features particular to a reduced number of classes, and eventually, to each object class. To allow for efficient rotation invariance, we propose the use of non-Gaussian steerable filters, together with an Orientation Integral Image for a speedy computation of local orientation.This work was supported by projects: 'Integration of robust perception, learning, and navigation systems in mobile robotics' (J-0929), 'Perception, action & cognition through learning of object-action complexes.' (4915).Financial support to M. Villamizar and A. Sanfeliu comes from the EURON Network\ud
Robot Systems Research Atelier NoE-507728, and the Spanish Ministry of Education and Science project NAVROB DPI 2004-05414. J. Andrade-Cetto is a Juan de la Cierva Postdoctoral Fellow of the Spanish Ministry of Education and Science under\ud
project TIC2003-09291, and is also funded in part by the EU PACO-PLUS project FP6-2004-IST-4-27657.Peer Reviewe
Combined gene selection methods for microarray data analysis

[Abstract]: In recent years, the rapid development of DNA Microarray technology has made it possible for scientists to monitor the expression level of thousands of genes in a single experiment. As a new technology, Microarray data presents some fresh challenges to scientists since Microarray data contains a large number of genes (around tens thousands) with a small number of samples (around hundreds). Both filter and wrapper gene selection methods aim to select the most informative genes among the massive data in order to reduce the size of the expression database. Gene selection methods are used in both data preprocessing and classification stages. We have conducted some experiments on different existing gene selection methods to preprocess Microarray data for classification by benchmark algorithms SVMs and C4.5. The study suggests that the combination of filter and wrapper methods in general improve the accuracy performance of gene expression Microarray data classification. The study also indicates that not all filter gene selection methods help improve the performance of classification. The experimental results show that among tested gene selection methods, Correlation Coefficient is the best gene selection method for improving the classification accuracy on both SVMs and C4.5 classification algorithms
Making sense of the sensory data - coordinate systems by hierarchical decomposition

"The original publication is available at www.springerlink.com" Copyright SpringerHaving the right sensory channels is an important ingredient for building an autonomous agent, but we still have the problem of making sense of the sensory data for the agent. This is the basic problem of artificial intelligence. Here we propose an algebraic method for generating abstract coordinate system representations of the environment based on the agent???s actions. These internal representations can be refined and regenerated during the lifespan of the agent
A heuristic approach to semantic web services classification

The final publication is available at Springer via http://dx.doi.org/10.1007/11893011_76Proceedings of 10th International Conference, KES 2006, Bournemouth, UK, October 9-11, 2006, Part IIIWeb service technologies, and the vision of semantically-enhanced services, aim to be key enablers to further exploit the potential of the Web as a platform where units of functionality can be deployed, shared, and assembled in a much more flexible way than it is possible today. Due to the expectable growth of the number of services offered in the WWW, the need for service repositories and mechanisms for their (semi)automatic organization and discovery of services is becoming increasingly important. In this paper, we propose a heuristic-based mechanism that enables service publishers to (semi)automatically classify their services in a service taxonomy managed by a service repository.This research was supported by the Spanish Ministry of Science and Education
(TIN2005-0685) and the Ministry of Industry, Tourism and Commerce (CDTI05-
0436)
Prediction of construction litigation outcome using a split-step PSO algorithm

The nature of construction claims is highly complicated and the cost involved is high. It will be advantageous if the parties to a dispute may know with some certainty how the case would be resolved if it were taken to court. The recent advancements in artificial neural networks may render a cost-effective technique to help to predict the outcome of construction claims, on the basis of characteristics of cases and the corresponding past court decisions. In this paper, a split-step particle swarm optimization (PSO) model is applied to train perceptrons in order to predict the outcome of construction claims in Hong Kong. It combines the advantages of global search capability of PSO algorithm in the first step and the local convergence of back-propagation algorithm in the second step. It is shown that, through a real application case, its performance is much better than the benchmark backward propagation algorithm and the conventional PSO algorithm.Department of Civil and Environmental Engineering2006-2007 > Academic research: refereed > Publication in refereed journalpreprint_postprin
General discounting versus average reward

Consider an agent interacting with an environment in cycles. In every interaction cycle the agent is rewarded for its performance. We compare the average reward U from cycle 1 to m (average value) with the future discounted reward V from cycle k to ∞ (discounted value). We consider essentially arbitrary (non-geometric) discount sequences and arbitrary reward sequences (non-MDP environments). We show that asymptotically U for m→∞ and V for k→∞ are equal, provided both limits exist. Further, if the effective horizon grows linearly with k or faster, then the existence of the limit of U implies that the limit of V exists. Conversely, if the effective horizon grows linearly with k or slower, then existence of the limit of V implies that the limit of U exists
Summa Contra Ontologiam

The final publication is available at Springer via http://dx.doi.org/10.1007/11896548_37Revised Selected Papers of EDBT 2006 Workshops PhD, DataX, IIDB, IIHA, ICSNW, QLQP, PIM, PaRMA, and Reactivity on the Web, Munich, Germany, March 26-31, 2006This paper is a critical analysis of the concept of ontology thus as it is used in contemporary computing science. It identifies three main problems with such a concept, two of which are intrinsic to it and one of which is extrinsic, so to speak, being related to the use that of ontology is made in applications.
The first problem with ontology is that the only accepted definition of its main artifact is teleological rather than structural as it would be proper in computing science. The second problem is that claiming that ontology is in any way a semantic discipline requires such a limited and outdated notion of semantic to be to all practical purposes useless. The third and final problem is that the limitations and misconceptions of ontology might make it a limiting factor, rather than a help, for many of the applications for which it is sought.
The article concludes that a profound reconsideration of the relation between computers and semantics might be overdue
Notes for the conceptual design of interfaces

The final publication is available at Springer via http://dx.doi.org/110.1007/11901181_31Proceedings of 25th International Conference on Conceptual Modeling, Tucson, AZ, USA, November 6-9, 2006.This paper presents a design method for user interfaces based on some ideas from conversation analysis. The method uses interaction diagram and it is conceived to design the overall flow of conversation between the user and the computer system in an abstract way, as an architectural prolegomenon to the designer’s choice of the actual interface elements that will be used
Representation Theory versus Workflow Patterns – The Case of BPMN

Selecting an appropriate process modeling language forms an important task within business process management projects. A wide range of process modeling languages has been developed over the last decades, leading to an obvious need for rigorous theory to assist in the evaluation and comparison of the capabilities of these languages. While academic progress in the area of process modeling language evaluation has been made on at least two premises, Representation Theory and Workflow Patterns, it remains unclear how these frameworks relate to each other. We use a generic framework for language evaluation to establish similarities and differences between these acknowledged reference frameworks and discuss how and to what extent they complement respectively substitute each other. Our line of investigation follows the case of the popular BPMN modeling language, whose evaluation from the perspectives of Representation Theory and Workflow Patterns is reconciled in this paper
Mapping RT-LOTOS specifications into Time Petri Nets

RT-LOTOS is a timed process algebra which enables compact\ud
and abstract specification of real-time systems. This paper proposes and illustrates a structural translation of RT-LOTOS terms into behaviorally equivalent (timed bisimilar) finite Time Petri nets. It is therefore possible to apply Time Petri nets verification techniques to the profit of RT-LOTOS. Our approach has been implemented in RTL2TPN, a prototype tool which takes as input an RT-LOTOS specification and outputs a TPN. The latter is verified using TINA, a TPN analyzer developed by LAAS-CNRS. The toolkit made of RTL2TPN and TINA has been positively benchmarked against previously developed RT-LOTOS verification tool
Functional Analysis of a Real-Time Protocol for Networked Control Systems

Traditional real-time control systems are tightly integrated into the industrial processes they govern.  Now, however, there is increasing interest in networked control systems.  These provide greater flexibility and cost savings by allowing real-time controllers to interact with industrial processes over existing communications networks.  New data packet queuing protocols are currently being developed to enable precise real-time control over a network with variable propagation delays.  We show how one such protocol was formally modelled using timed automata, and how model checking was used to reveal subtle aspects of the control system's dynamic behaviour
A framework for working with digitized cultural heritage artefacts

In this paper, we present our work in designing, implementing, and evaluating a set of 3D interactive spatial measurement tools in the context of Cultural Heritage Toolbox (CH Toolbox), a framework for computer-aided cultural heritage research. Our application utilizes a bi-manual, spaceball and mouse driven user interface to help the user manage visualized 3D models digitized from real artifacts. We have developed a virtual radius estimator, useful for analyzing incomplete pieces of radial artifacts, and a virtual tape measure, useful in measurement of geodesic distances between two points on the surface of an artifact. We tested the tools on the special case of pottery analysis
A Geometry Driven Reconstruction Algorithm for the Mojette Transform

International audienceThe Mojette transform is an entirely discrete form of the Radon transform developed in 1995. It is exactly invertible with both the forward and inverse transforms requiring only the addition operation. Over the last 10 years it has found many applications including image watermarking and encryption, tomographic reconstruction, robust data transmission and distributed data storage. This paper presents an elegant and efficient algorithm to directly apply the inverse Mojette transform. The method is derived from the inter-dependance of the ``rational'' projection vectors (pi,qi) which define the direction of projection over the parallel set of lines b = pil -- qik. Projection values are acquired by summing the value of image pixels, f(k,l), centered on these lines. The new inversion is up to 5 times faster than previously proposed methods and solves the redundancy issues of these methods
Recognition of Blurred Pieces of Discrete Planes

International audienceWe introduce a new discrete primitive, the blurred piece of a discrete plane, which relies on the arithmetic definition of discrete planes. It generalizes such planes, admitting that some points are missing and then permits to adapt to noisy discrete data. Two recognition algorithms of such primitives are proposed: the first one is a geometrical algorithm and minimizes the Euclidean distance and the second one relies on linear programming and minimizes the vertical distance
An integrated network management framework for inter-domain outbound traffic engineering

This paper proposes an integrated network management framework for inter-domain outbound traffic engineering. The framework consists of three functional blocks (monitoring, optimization and implementation) to make the outbound traffic engineering adaptive to network condition changes such as inter-domain traffic demand variation, inter-domain routing changes and link failures. The objective is to keep the inter-domain link utilization balanced under any of these changes while reducing service disruptions and reconfiguration overheads. Simulation results demonstrate that the proposed framework can achieve better load balancing with less service disruptions and re-configuration overheads in comparison to alternative approaches
An Ontology-Based approach to the description and execution of composite network management processes for network monitoring

Proceedings of 17th IFIP/IEEE International Workshop on Distributed Systems: Operations and Management, DSOM 2006, Dublin, Ireland, October 23-25, 2006.The final publication is available at Springer via http://dx.doi.org/10.1007/11907466_8Web service technology has been proposed to implement management interfaces of managed resources. These web services can usually be combined to perform composite processes. These composite processes can be defined with service ontologies such as OWL-S, which allows their formal description. However, other technologies, including the Web Services Business Process Execution Language (WSBPEL), provide more mature execution engines. This paper presents an approach to define and execute composite network management processes with existing technology. For this, a use case is developed in which a set of web service interfaces are defined for a network probe, and a composite process is specified using OWL-S to monitor the network load. Then, this specification is later translated to WSBPEL and interpreted by a real execution engine
Worklets: A Service-Oriented Implementation of Dynamic Flexibility in Workflows

This paper presents the realisation, using a Service Oriented Architecture, of an approach for dynamic flexibility and evolution in workflows through the support of flexible work practices, based not on proprietary frameworks, but on accepted ideas of how people actually\ud
work. A set of principles have been derived from a sound theoretical base and applied to the development of worklets, an extensible repertoire of self-contained sub-processes aligned to each task, from which a dynamic runtime selection is made depending on the context of the particular work instance
A Generic Deployment Framework for Grid Computing and Distributed Applications

The original publication is available at www.springerlink.comInternational audienceDeployment of distributed applications on large systems, and especially on grid infrastructures, becomes a more and more complex task. Grid users spend a lot of time to prepare, install and configure middleware and application binaries on nodes, and eventually start their applications. The problem is that the deployment process is composed of many heterogeneous tasks that have to be orchestrated in a specific correct order. As a consequence, the automatization of the deployment process is currently very difficult to reach. To address this problem, we propose in this paper a generic deployment framework allowing to automatize the execution of heterogeneous tasks composing the whole deployment process. Our approach is based on a reification as software components of all required deployment mechanisms or existing tools. Grid users only have to describe the configuration to deploy in a simple natural language instead of programming or scripting how the deployment process is executed. As a toy example, this framework is used to deploy CORBA component-based applications and OpenCCM middleware on one thousand nodes of the French Grid5000 infrastructure
Performance evaluation of group communication architectures in large scale systems using MPI

OTM Confederated International Conferences, CoopIS, DOA, GADA, and ODBASE 2006; Montpellier; France; 29 October 2006 through 3 November 2006Group communication is an important paradigm for fault tolerance in large scale systems. We describe various group architectures as pipelined, hierarchical, daisy and hypercube groups each consisting of separate clusters, investigate the theoretical performance bounds of these architectures and evaluate their experimental performances using MPI group communication primitives. We first derive time bounds for multicast message deliveries in these architectures and then provide tests to measure the times taken for the same operation. The multicast message delivery times are tested against the number of clusters within a group and the size of the multicast message. We conclude that daisy architecture is favorable both in terms of delivery times and message sizes theoretically and experimentally
Semantic data integration in a newspaper content management system

A newspaper content management system has to deal with a very heterogeneous information space as the experience in the Diari Segre
newspaper has shown us. The greatest problem is to harmonise the different ways the involved users (journalist, archivists...) structure the newspaper information space, i.e. news, topics, headlines, etc. Our approach is based on ontology and differentiated universes of discourse (UoD). Users interact with the system and, from this interaction, integration rules are derived. These rules are based on Description Logic ontological relations for subsumption and equivalence. They relate the different UoD and produce a shared
conceptualisation of the newspaper information domain.This work is funded by the Spanish Ministry of Science and Technology, grants FIT-150500-
2003-511, TIC2002-1948, and TIN2005-0540
More Than Wires, Pipes and Ducts: Some Lessons from Grassroots Networked Communities and Master-Planned Neighbourhoods

Community informatics research has found that the provision of technical connectivity in local neighbourhoods alone does not ensure community interaction. Externally initiated projects applied to communities by government or commercial bodies have encountered difficulties where the project’s goals do not correspond to the host community’s. Differing expectations can lead to disillusionment or rejection. Self-organised initiatives developed from within communities appear to be more aligned with residents’ goals and purposes and may not face these issues. However, such initiatives have also encountered difficulties in maintaining volunteer input and achieving technological sustainability. Valuable insights can be drawn from both cases. In this paper we review examples of each type of initiative and consider lessons that can be taken forward into new networked neighbourhood initiatives currently being developed. We consider one specific example, an inner-city master-planned residential development in Australia seeking to establish a community association to support socio-economic sustainability and governance of the local ICT infrastructure. We offer recommendations drawn from existing projects that may be applied to this site and to a wider context, and consider some implications for the future selection, deployment and maintenance of community information systems
Enabling Practical IPsec authentication for the Internet

On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops (First International Workshop on Information Security (IS'06), OTM Federated Conferences and workshops). Montpellier, Oct,/Nov. 2006There is a strong consensus about the need for IPsec, although its use is not widespread for end-to-end communications. One of the main reasons for this is the difficulty for authenticating two end-hosts that do not share a secret or do not rely on a common Certification Authority. In this paper we propose a modification to IKE to use reverse DNS and DNSSEC (named DNSSEC-to-IKE) to provide end-to-end authentication to Internet hosts that do not share any secret, without requiring the deployment of a new infrastructure. We perform a comparative analysis in terms of requirements, provided security and performance with state-of-the-art IKE authentication methods and with a recent proposal for IPv6 based on CGA. We conclude that DNSSEC-to-IKE enables the use of IPsec in a broad range of scenarios in which it was not applicable, at the price of offering slightly less security and incurring in higher performance costs.Universidad de Montpellier IIPublicad
Examining the DOS Resistance to HIP

We examine DoS resistance of the Host Identity Protocol (HIP) and discuss a technique to deny legitimate services. To demonstrate the experiment, we implement a formal model of HIP based on Timed Petri Nets and use a simulation approach provided in CPN Tools to achieve a formal analysis. By integrating adjustable puzzle difficulty, HIP can mitigate the effect of DoS attacks. However, the inability to protect against coordinated adversaries on a hash-based puzzle causes the responder to be susceptible to DoS attacks at the identity verification phase. As a result, we propose an enhanced approach by employing a time-lock puzzle instead of a hash-based scheme. Once the time-lock puzzle is adopted, the effect of coordinated attacks will be removed and the throughput from legitimate users will return to the desirable level
Homogeneity vs. Adjacency: generalising some graph decomposition algorithms

soumis à WG 2006In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are still efficient. This theory not only unifies the usual modular decomposition generalisations such as modular decomposition of directed graphs or decomposition of 2-structures, but also star cutsets and bimodular decomposition. Our general framework provides a decomposition algorithm which improves the best known algorithms for bimodular decomposition
Simultaneous Graph Embeddings with Fixed Edges

We study the problem of simultaneously embedding several graphs on the same vertex set in such a way that edges common to two or more graphs are represented by the same curve. This problem is known as simultaneously embedding graphs with fixed edges. We show that this problem is closely related to the weak realizability problem: Can a graph be drawn such that all edge crossings occur in a given set of edge pairs? By exploiting this relationship we can explain why the simultaneous embedding problem is challenging, both from a computational and a combinatorial point of view. More precisely, we prove that simultaneously embedding graphs with fixed edges is NP-complete even for three planar graphs. For two planar graphs the complexity status is still open