HAL-UNICE
Not a member yet
30584 research outputs found
Sort by
Imagerie lithosphérique par inversion de formes d’ondes télésismiques – Application aux Alpes Occidentales
No full textIn this thesis, a full-waveform inversion (FWI) algorithm is developed with the aim to image the elastic properties (Vp, Vs and density) of 3D lithospheric models from teleseismic recordings with a spatial resolution of the order of the wavelength. Seismic modeling is performed with a wavefield injection hybrid approach. A first simulation is performed in a global radially symmetric Earth with the AxiSEM code to compute the wavefields on the borders of the lithospheric target. Then, these wavefields are propagated in the target with the spectral finite-element method. After linearization, the inverse problem is solved with a quasi-Newton (1-BFGS) optimization algorithm. The sensitivity of the teleseismic FWI to the experimental setup (subsurface parameterization, initial model, sampling and geometry of the station layout) is first assessed with a realistic synthetic model of the Western Alps. The method is finally applied to nine events of the CIFALPS experiment carried out in the Western Alps, up to a frequency of 0.2Hz. Reliable models of P and S wave speeds and density reveal with an unprecedented resolution the crustal and lithospheric structures of the Alpine Belt, in particular the geometry of the Ivrea body, and the European and Adriatic Mohos. Deeper, two slow velocity anomalies beneath the Western Alps are imaged in the mantle. The first, to the west of the chain, is interpreted as the signature of an asthenospheric upwelling, the second near the location of the Ivrea body indicates the European slab break-off. The study supports the hypothesis of the European continental crust subduction and confirms the possible tearing of the European slab.Dans cette thèse, un algorithme d'inversion de formes d'ondes (FWI) est développé pour l'imagerie 3D des paramètres élastiques de la lithosphère à partir des enregistrements télésismiques dans le but d'accroître la résolution des images lithosphériques. La modélisation sismique est effectuée par un méthode hybride d'injection de champ d'ondes. Une première modélisation est effectuée dans une Terre globale avec le logiciel AxiSEM pour déterminer les champs d’ondes aux bords de la cible lithosphérique. Ces solutions sont ensuite propagées dans cette cible par une méthode aux éléments finis spectraux. Le problème inverse est résolu avec un algorithme d’optimisation locale de type quasi-Newton (l-BFGS). La sensibilité de la méthode à la configuration expérimentale (paramétrisation du milieu, modèle initial, géométrie et échantillonnage du dispositif de capteurs) est tout d’abord analysée avec un modèle synthétique réaliste des Alpes Occidentales. L’algorithme est finalement appliqué à neuf événements de la campagne CIFALPS dans les Alpes occidentales jusqu’à une fréquence de 0.2Hz. Les modèles de vitesses P et S et de densité révèlent les grandes structures lithosphériques de la chaîne alpine, en particulier le corps d’Ivrée et la géométrie des Moho européen et adriatique. Plus profondément, deux anomalies de vitesses lentes sont imagées dans le manteau et sont interprétées comme la signature d’une remontée asthénosphérique et la localisation du détachement du panneau plongeant européen. Ces résultats corroborent l’hypothèse d’une subduction continentale de la croûte européenne et d’une éventuelle déchirure du panneau plongeant européen lors de la phase de collision
Deepwater fold-and-thrust belt along New Caledonia's western margin: relation to post-obduction vertical motions
No full textInternational audienceClassically, deepwater fold-and-thrust belts are classified in two main types, depending if they result from near- or far-field stresses and the understanding of their driving and triggering mechanism is poorly known. We present a geophysical dataset off the western margin of New Caledonia (SW Pacific) that reveals deformed structures of a deepwater fold-and-thrust belt that we interpret as a near-field gravity-driven system, which is not located at a rifted passive margin. The main factor triggering deformation is inferred to be oversteepening of the margin slope by post-obduction isostatic rebound. Onshore erosion of abnormally-dense obducted material, combined with sediment loading in the adjacent basin, has induced vertical motions that have caused oversteepening of the margin. Detailed morpho-bathymetric, seismic stratigraphic and structural analysis reveals that the fold-and-thrust belt extends 200 km along the margin, and 50 km into the New Caledonia Trough. Deformation is rooted at depths greater than 5 km beneath the seafloor, affects an area of 3500 km2, and involves a sediment volume of approximately 13 000 km3. This deformed belt is organized into an imbricate fan system of faults, and one out-of-sequence thrust fault affects the seabed. The thrust faults are deeply rooted in the basin along a low-angle floor thrust and connected to New Caledonia Island along a major detachment. This study not only provides a better knowledge of the New Caledonia margin, but also provides new insight into the mechanisms that trigger deepwater fold-and-thrust belts
Deux bases de données, aucune référence de prix. Comment observer les prix immobiliers en France avec DVF et Perval ?
No full textInternational audienc
Maintaining Balanced Trees for Structured Distributed Streaming Systems
No full textInternational audienceIn this paper, we propose and analyze a simple local algorithm to balance a tree. The motivation comes from live distributed streaming systems in which a source diffuses a content to peers via a tree, a node forwarding the data to its children. Such systems are subject to a high churn, peers frequently joining and leaving the system. It is thus crucial to be able to repair the diffusion tree to allow an efficient data distribution. In particular, due to bandwidth limitations, an efficient diffusion tree must ensure that node degrees are bounded. Moreover, to minimize the delay of the streaming, the depth of the diffusion tree must also be controlled. We propose here a simple distributed repair algorithm in which each node carries out local operations based on its degree and on the subtree sizes of its children. In a synchronous setting, we first prove that starting from any n-node tree our process converges to a balanced binary tree in O(n 2) rounds. We then describe a more restrictive model, adding a small extra information to each node, under which we adapt our algorithm to converge in Θ(n log n) rounds
Algorithmes polynomiaux paramétrés pour des classes de graphes de largeur de clique bornée
No full textParameterized complexity theory has enabled a refined classification of the difficulty of NP-hard optimization problems on graphs with respect to key structural properties, and so to a better understanding of their true difficulties. More recently, hardness results for problems in P were achieved using reasonable complexity theoretic assumptions such as: Strong Exponential Time Hypothesis (SETH), 3SUM and All-Pairs Shortest-Paths (APSP). According to these assumptions, many graph theoretic problems do not admit truly subquadratic algorithms, nor even truly subcubic algorithms (Williams and Williams, FOCS 2010 and Abboud, Grandoni, Williams, SODA 2015). A central technique used to tackle the difficulty of the above mentioned problems is fixed-parameter algorithms for polynomial-time problems with polynomial dependency in the fixed parameter (P-FPT). This technique was introduced by Abboud, Williams and Wang in SODA 2016 and continued by Husfeldt (IPEC 2016) and Fomin et al. (SODA 2017), using the treewidth as a parameter. Applying this technique to clique-width, another important graph parameter, remained to be done. In this paper we study several graph theoretic problems for which hardness results exist such as cycle problems (triangle detection, triangle counting, girth, diameter), distance problems (diameter, eccentricities, Gromov hyperbolicity, betweenness centrality) and maximum matching. We provide hardness results and fully polynomial FPT algorithms, using clique-width and some of its upper-bounds as parameters (split-width, modular-width and -sparseness). We believe that our most important result is an -time algorithm for computing a maximum matching where is either the modular-width or the -sparseness. The latter generalizes many algorithms that have been introduced so far for specific subclasses such as cographs, -lite graphs, -extendible graphs and -tidy graphs. Our algorithms are based on preprocessing methods using modular decomposition, split decomposition and primeval decomposition. Thus they can also be generalized to some graph classes with unbounded clique-width
A new approach for the construction of a Wasserstein diffusion
No full textWe propose in this paper a construction of a diffusion process on the space of probability measures with a second-order moment. This process was introduced in several papers by Konarovskyi (see e.g. "A system of coalescing heavy diffusion particles on the real line", 2017) and consists of the limit when tends to of a system of coalescing and mass-carrying particles. It has properties analogous to those of a standard Euclidean Brownian motion, in a sense that we will precise in this paper. We also compare it to the Wasserstein diffusion on constructed by von Renesse and Sturm (see Entropic measure and Wasserstein diffusion). We obtain that process by the construction of a system of particles having short-range interactions and by letting the range of interactions tend to zero. This construction can be seen as an approximation of the singular process of Konarovskyi by a sequence of smoother processes
Déconvolution en ligne d'images hyperspectrales pour les imageurs de type pushbroom
No full textInternational audienceCet article s'intéresse à la conception d'une méthode séquentielle de déconvolution d'images hyperspectrales acquises par un imageur pushbroom. À partir de l'écriture sous forme séquentielle de l'image floutée, on propose un algorithme de type LMS (least mean squares) par bloc glissant qui inclut des termes de régularisation spatiale et spectrale. Les performances de l'algorithme sont illustrées sur des données réelles. Abstract – This paper introduces a framework based on the least mean squares (LMS) algorithm for sequential deconvolution of hyperspectral images acquired by pushbroom imaging systems. Considering a sequential model of image blurring phenomenon, we derive a sliding-block regularized LMS algorithm with spatial and spectral regularizers. The performance of the algorithm is evaluated using real hyperspectral data
Recent, climate-driven river incision rate fluctuations in the Mercantour crystalline massif, southern French Alps
No full textInternational audienceWe present a new geomorphological analysis of the Tinee River tributaries in the southern French Alps based on numerical inverse and forward modelling of their longitudinal profiles. We model their relative uplift history with respect to the main channel, hence the incision rate history of this channel. Inverse models show that all tributaries have consistent incision rate histories with alternating high and low values. A comparison with global temperature curves shows that these variations correlate with quaternary climate changes. We suggest that during warm periods, a wave of regressive erosion propagates in the Tinee River, while its tributaries deeply incise their substratum to catch up with the falling base level. We also show that the post 140 ka history of this landscape evolution is dominated by fluvial incision. We then perform forward models of river incision and simulate the incision of the Tinee River system over a time span of 600 ka. This model allows us to extract time and space incision rate variations of the Tinee River. With a background of a few mm.yr(-1), incision rate can increase up to more than 1 cm yr(-1) during short periods of time due to climatic oscillations. This result is compatible with published cosmogenic nuclide based dating, which evidenced incision rates from 0.2 to 24 mm yr(-1). The part of the channel located between 12 and 20 km downstream from the source has undergone several periods of rapid incision rates, which could explain the steep hillslopes and the triggering of a landslide similar to 10 ka ago. (C) 2017 Elsevier Ltd. All rights reserved
Using numerical plant models and phenotypic correlation space to design achievable ideotypes
No full textUMR AGAP - équipe AFEF - Architecture et fonctionnement des espèces fruitièresNumerical plant models can predict the outcome of plant traits modifications resulting from genetic variations, on plant performance, by simulating physiological processes and their interaction with the environment. Optimization methods complement those models to design ideotypes, i.e. ideal values of a set of plant traits resulting in optimal adaptation for given combinations of environment and management, mainly through the maximization of a performance criteria (e.g. yield, light interception). As use of simulation models gains momentum in plant breeding, numerical experiments must be carefully engineered to provide accurate and attainable results, rooting them in biological reality. Here, we propose a multi-objective optimization formulation that includes a metric of performance, returned by the numerical model, and a metric of feasibility, accounting for correlations between traits based on field observations. We applied this approach to two contrasting models: a process-based crop model of sunflower and a functional-structural plant model of apple trees. In both cases, the method successfully characterized key plant traits and identified a continuum of optimal solutions, ranging from the most feasible to the most efficient.The present study thus provides successful proof of concept for this enhanced modeling approach, which identified paths for desirable trait modification, including direction and intensity