Prefix-Projection Global Constraint for Sequential Pattern Mining

Sequential pattern mining under constraints is a challenging data mining task. Many efficient ad hoc methods have been developed for mining sequential patterns, but they are all suffering from a lack of genericity. Recent works have investigated Constraint Programming (CP) methods, but they are not still effective because of their encoding. In this paper, we propose a global constraint based on the projected databases principle which remedies to this drawback. Experiments show that our approach clearly outperforms CP approaches and competes well with ad hoc methods on large datasets

Open science resources for the discovery and analysis of Tara Oceans data

Pesant, Stéphane ... et. al.-- 16 pages, 5 figures, 2 tables.-- This article is contribution number 26 of the Tara Oceans ConsortiumThe Tara Oceans expedition (2009–2013) sampled contrasting ecosystems of the world oceans, collecting environmental data and plankton, from viruses to metazoans, for later analysis using modern sequencing and state-of-the-art imaging technologies. It surveyed 210 ecosystems in 20 biogeographic provinces, collecting over 35,000 samples of seawater and plankton. The interpretation of such an extensive collection of samples in their ecological context requires means to explore, assess and access raw and validated data sets. To address this challenge, the Tara Oceans Consortium offers open science resources, including the use of open access archives for nucleotides (ENA) and for environmental, biogeochemical, taxonomic and morphological data (PANGAEA), and the development of on line discovery tools and collaborative annotation tools for sequences and images. Here, we present an overview of Tara Oceans Data, and we provide detailed registries (data sets) of all campaigns (from port-to-port), stations and sampling eventsWe thank the commitment of the following people and sponsors who made this singular expedition possible: CNRS (in particular the Groupement de Recherche GDR3280), European Molecular Biology Laboratory (EMBL), Genoscope/CEA, Fund for Scientific Research—Flanders, VIB, Stazione Zoologica Anton Dohrn, UNIMIB, ANR (projects POSEIDON/ANR-09-BLAN-0348, BIOMARKS/ANR-08-BDVA- 003, PROMETHEUS/ANR-09-GENM-031, PROMETHEUS/ANR-09-PCS-GENM-217, TARAGIRUS/ANR-09-PCS-GENM-218, OCEANOMICS/ANR-11-BTBR-0008, FRANCE GENOMIQUE/ANR-10-INBS-09-08), EU FP7 (MicroB3/No.287589, IHMS/HEALTH-F4-2010-261376, MetaCardis/HEALTH-F4-2012-305312), ERC Advanced Grant Awards to CB (Diatomite: 294823) and PB (CancerBiome: 268985), Spanish Ministry of Science and Innovation grant CGL2011-26848/BOS MicroOcean PANGENOMICS to SGA, JSPS KAKENHI Grant Number 26430184 to HO, FWO, BIO5, Biosphere 2, agne`s b., the Veolia Environment Foundation, Region Bretagne, World Courier, Illumina, Cap L’Orient, the EDF Foundation EDF Diversiterre, FRB, the Prince Albert II de Monaco Foundation, Etienne Bourgois, the Tara schooner and its captain and crew. Tara Oceans would not exist without continuous support from 23 institutes (http://oceans.taraexpeditions.org)Peer Reviewe

The role of the agent's outside options in principal-agent relationships

We consider a principal-agent model of adverse selection where, in order to trade with the principal, the agent must undertake a relationship-specific investment which affects his outside option to trade, i.e. the payoff that he can obtain by trading with an alternative principal. This creates a distinction between the agent’s ex ante (before investment) and ex post (after investment) outside options to trade. We investigate the consequences of this distinction, and show that whenever an agent’s ex ante and ex post outside options differ, this may equip the principal with an additional tool for screening among different agent types, by randomizing over the probability with which trade occurs once the agent has undertaken the investment. In turn, this may enhance the efficiency of the optimal second-best contract

Revisiting the tree Constraint

International audienceThis paper revisits the tree constraint introduced in [2] which partitions the nodes of a n-nodes, m-arcs directed graph into a set of node-disjoint anti-arborescences for which only certain nodes can be tree roots. We introduce a new filtering algorithm that enforces generalized arc-consistency in O(n + m) time while the original filtering algorithm reaches O(nm) time. This result allows to tackle larger scale problems involving graph partitioning

On Matrices, Automata, and Double Counting

Matrix models are ubiquitous for constraint problems. Many such problems have a matrix of variables M, with the same constraint defined by a finite-state automaton A on each row of M and a global cardinality constraint gcc on each column of M. We give two methods for deriving, by double counting, necessary conditions on the cardinality variables of the gcc constraints from the automaton A. The first method yields linear necessary conditions and simple arithmetic constraints. The second method introduces the cardinality automaton, which abstracts the overall behaviour of all the row automata and can be encoded by a set of linear constraints. We evaluate the impact of our methods on a large set of nurse rostering problem instances

Estimating the Number of Solutions of Cardinality Constraints through range and roots Decompositions

International audienceThis paper introduces a systematic approach for estimating the number of solutions of cardinality constraints. A main difficulty of solutions counting on a specific constraint lies in the fact that it is, in general, at least as hard as developing the constraint and its propaga-tors, as it has been shown on alldifferent and gcc constraints. This paper introduces a probabilistic model to systematically estimate the number of solutions on a large family of cardinality constraints including alldifferent, nvalue, atmost, etc. Our approach is based on their decomposition into range and roots, and exhibits a general pattern to derive such estimates based on the edge density of the associated variable-value graph. Our theoretical result is finally implemented within the maxSD search heuristic, that aims at exploring first the area where there are likely more solutions

Marine microbial biodiversity, bioinformatics and biotechnology (M2B3) data reporting and service standards

Contextual data collected concurrently with molecular samples are critical to the use of metagenomics in the fields of marine biodiversity, bioinformatics and biotechnology. We present here Marine Microbial Biodiversity, Bioinformatics and Biotechnology (M2B3) standards for “Reporting” and “Serving” data. The M2B3 Reporting Standard (1) describes minimal mandatory and recommended contextual information for a marine microbial sample obtained in the epipelagic zone, (2) includes meaningful information for researchers in the oceanographic, biodiversity and molecular disciplines, and (3) can easily be adopted by any marine laboratory with minimum sampling resources. The M2B3 Service Standard defines a software interface through which these data can be discovered and explored in data repositories. The M2B3 Standards were developed by the European project Micro B3, funded under 7th Framework Programme “Ocean of Tomorrow”, and were first used with the Ocean Sampling Day initiative. We believe that these standards have value in broader marine science

Light color acclimation is a key process in the global ocean distribution of Synechococcus cyanobacteria

Understanding the functional diversity of specific microbial groups at the global scale is critical yet poorly developed. By combining the considerable knowledge accumulated through recent years on the molecular bases of photosynthetic pigment diversity in marine Synechococcus, a major phytoplanktonic organism, with the wealth of metagenomic data provided by the Tara Oceans expedition, we have been able to reliably quantify all known pigment types along its transect and provide a global distribution map. Unexpectedly, cells able to dynamically change their pigment content to match the ambient light color were ubiquitous and predominated in many environments. Altogether, our results unveiled the role of adaptation to light quality on niche partitioning in a key primary producer

Combining Symmetry Breaking and Global Constraints

Abstract. We propose a new family of constraints which combine together lexicographical ordering constraints for symmetry breaking with other common global constraints. We give a general purpose propagator for this family of constraints, and show how to improve its complexity by exploiting properties of the included global constraints.