Sorry, you need to enable JavaScript to visit this website.
Share

Publications

Publications

CMAP Theses  are available by following this link:
Discover CMAP theses

Listed below, are sorted by year, the publications appearing in the HAL open archive.

2013

  • Actuator and sensor fault detection, isolation and identification in nonlinear dynamical systems, with an application to a waste water treatment plant
    • Methnani Salowa
    • Lafont Frédéric
    • Gauthier Jean-Paul
    • Damak Tarak
    • Toumi Ahmed
    , 2013. no abstract
  • Stabilization of persistently excited linear systems
    • Chitour Yacine
    • Mazanti Guilherme
    • Sigalotti Mario
    , 2013, pp.85-120. This chapter presents recent developments on the stabilization of persistently excited linear systems. The first section of the chapter deals with finite-dimensional systems and gives two main results on stabilization, concerning neutrally stable systems and systems whose eigenvalues all have non-positive real parts. It also presents a result stating the existence of persistently excited systems for which the pair (A, b) is controllable but that cannot be stabilized by means of a linear state feedback. The second section presents some results for infinite-dimensional systems to the case of systems defined by a linear operator A which generates a strongly continuous contraction semigroup, with applications to Schrödinger's equation and the wave equation. The final section discusses some problems that remain open, giving some preliminary results in certain cases. (10.1002/9781118639856.ch4)
    DOI : 10.1002/9781118639856.ch4
  • Ecologie prédictive & changement planétaire
    • Austerlitz Frédéric
    • Blum Michael
    • Calba Sarah
    • Chave Jérôme
    • Choisy Marc
    • Coreau Audrey
    • Devictor Vincent
    • Doyen Luc
    • Dray Stéphane
    • Duputié Anne
    • Eveillard Damien
    • Faure Denis
    • Favier Charly
    • Gaggiotti Oscar
    • Galtier Nicolas
    • Garnier Éric
    • Gimenez Olivier
    • Guis Helene
    • Herbreteau Vincent
    • Huneman Philippe
    • Jabot Franck
    • Jarne Philippe
    • Joly Dominique
    • Julliard Romain
    • Kéfi Sonia
    • Kergoat Gael
    • Lacroix Gerard
    • Lagadeuc Yvan
    • Lavorel Sandra
    • Le Gaillard Jean-François
    • Le Gall Line
    • Loreau Michel
    • Maris Virginie
    • Morand Serge
    • Morin Xavier
    • Morlon Hélène
    • Mouquet Nicolas
    • Pinay Gilles
    • Pottier Julien
    • Pradel Roger
    • Ronce Ophélie
    • Schurr Frank
    • Simonet Pascal
    • Teplitsky Céline
    • Thuiller Wilfried
    • Tran Anne-Lise
    • Venner Samuel
    , 2013, hors s\'{e}rie, pp.9-44.
  • The Factorization method applied to cracks with impedance boundary conditions
    • Boukari Yosra
    • Haddar Houssem
    Inverse Problems and Imaging, AIMS American Institute of Mathematical Sciences, 2013, 7 (4). We use the Factorization method to retrieve the shape of cracks with impedance boundary conditions from farfields associated with incident plane waves at a fixed fre- quency. This work is an extension of the study initiated by Kirsch and Ritter [Inverse Problems, 16, pp. 89-105, 2000] where the case of sound soft cracks is considered. We address here the scalar problem and provide theoretical validation of the method when the impedance boundary conditions hold on both sides of the crack. We then deduce an inversion algorithm and present some validating numerical results in the case of simply and multiply connected cracks.
  • An adaptive sparse grid semi-lagrangian scheme for first order Hamilton-Jacobi Bellman equations
    • Bokanowski Olivier
    • Garcke Jochen
    • Griebel Michael
    • Klompmaker Irene
    Journal of Scientific Computing, Springer Verlag, 2013, 55, pp.pp. 575-605. We propose a semi-Lagrangian scheme using a spatially adaptive sparse grid to deal with non-linear time-dependent Hamilton-Jacobi Bellman equations. We focus in particular on front propagation models in higher dimensions which are related to control problems. We test the numerical efficiency of the method on several benchmark problems up to space dimension d = 8, and give evidence of convergence towards the exact viscosity solution. In addition, we study how the complexity and precision scale with the dimension of the problem. (10.1007/s10915-012-9648-x)
    DOI : 10.1007/s10915-012-9648-x
  • Tumor Growth Parameters Estimation and Source Localization From a Unique Time Point: Application to Low-grade Gliomas
    • Rekik Islem
    • Allassonnière Stéphanie
    • Clatz Olivier
    • Geremia Ezequiel
    • Stretton Erin
    • Delingette Hervé
    • Ayache Nicholas
    Computer Vision and Image Understanding, Elsevier, 2013, 117 (3), pp.238--249. Coupling time series of MR Images with reaction-di usion-based models has provided interesting ways to better understand the proliferative-invasive as- pect of glial cells in tumors. In this paper, we address a di erent formulation of the inverse problem: from a single time point image of a non-swollen brain tumor, estimate the tumor source location and the di usivity ratio between white and grey matter, while exploring the possibility to predict the further extent of the observed tumor at later time points in low-grade gliomas. The synthetic and clinical results show the stability of the located source and its varying distance from the tumor barycenter and how the estimated ratio controls the spikiness of the tumor. (10.1016/j.cviu.2012.11.001)
    DOI : 10.1016/j.cviu.2012.11.001
  • Minimal external representations of tropical polyhedra
    • Allamigeon Xavier
    • Katz R.D.
    Journal of Combinatorial Theory, Series A, Elsevier, 2013, 120 (4), pp.907-940. (10.1016/j.jcta.2013.01.011)
    DOI : 10.1016/j.jcta.2013.01.011
  • Is the Distance Geometry Problem in NP?
    • Beeker Nathanael
    • Gaubert Stéphane
    • Glusa Christian
    • Liberti Leo
    , 2013, pp.85-93. (10.1007/978-1-4614-5128-0_5)
    DOI : 10.1007/978-1-4614-5128-0_5
  • A decomposition technique for pursuit evasion games with many pursuers
    • Festa Adriano
    • Vinter Richard
    , 2013. Here we present a decomposition technique for a class of differential games. The technique consists in a decomposition of the target set which produces, for geometrical reasons, a decomposition in the dimensionality of the problem. Using some elements of Hamilton-Jacobi equations theory, we find a relation between the regularity of the solution and the possibility to decompose the problem. We use this technique to solve a pursuit evasion game with multiple agents.
  • Lipschitz classification of almost-Riemannian distances on compact oriented surfaces
    • Boscain Ugo
    • Charlot Grégoire
    • Ghezzi Roberta
    • Sigalotti Mario
    The Journal of Geometric Analysis, Springer, 2013, 23, pp.438-455. Two-dimensional almost-Riemannian structures are generalized Riemannian structures on surfaces for which a local orthonormal frame is given by a Lie bracket generating pair of vector fields that can become collinear. We consider the Carnot--Caratheodory distance canonically associated with an almost-Riemannian structure and study the problem of Lipschitz equivalence between two such distances on the same compact oriented surface. We analyse the generic case, allowing in particular for the presence of tangency points, i.e., points where two generators of the distribution and their Lie bracket are linearly dependent. The main result of the paper provides a characterization of the Lipschitz equivalence class of an almost-Riemannian distance in terms of a labelled graph associated with it. (10.1007/s12220-011-9262-4)
    DOI : 10.1007/s12220-011-9262-4
  • Shape dependent controllability of a quantum transistor
    • Méhats Florian
    • Privat Yannick
    • Sigalotti Mario
    , 2013, pp.1253-1258.
  • Méthodes de Monte-Carlo et processus stochastiques
    • Gobet Emmanuel
    , 2013, pp.258. La méthode de Monte-Carlo, qui tire son nom du fameux casino à Monaco, s’est développée de manière spectaculaire depuis 60 ans : elle figure parmi les 10 algorithmes ayant eu le plus d’influence sur le développement et la pratique de la science et de l’ingénierie au xxe siècle. En fait, il n’existe pas une méthode de Monte-Carlo mais des méthodes de Monte-Carlo. La 1re partie de l’ouvrage dresse un panorama de l’existant, puis détaille les outils de base pour la simulation de variables aléatoires, les résultats de convergence les plus courants et les techniques d’accélération des méthodes de Monte-Carlo. Puis, la 2e partie aborde la simulation des équations différentielles stochastiques (processus à évolution linéaire dérivant du mouvement brownien), dont les applications en biologie, chimie, économie, finance, géophysique, mécanique des fluides, neuroscience etc. sont importantes. L’objectif principal est le calcul d’espérance de leurs trajectoires. Cela donne, via les formules de Feynman-Kac, des solutions probabilistes aux équations aux dérivées partielles : ce lien remarquable permet de résoudre, par simulations Monte-Carlo, ces équations en toute dimension. Enfin, la 3e partie, la plus originale, traite des processus stochastiques ayant des évolutions non-linéaires (modélisant des interactions variées), comme les équations du contrôle stochastique, les diffusions branchantes, les équations stochastiques de McKean-Vlasov, avec des applications fondamentales en plein développement. Nous présentons notamment quelques idées importantes d’apprentissage statistique, dont le couplage aux méthodes de Monte-Carlo (via les régressions empiriques) conduit à des algorithmes des plus performants. Dans cet ouvrage, nous mettons en avant les grands principes de simulation efficace, avec une présentation exigeant le moins de préalables mathématiques. Le niveau prérequis à la lecture de ce cours est celui de Master 1, ou 2e année d’école d’ingénieurs. Cet ouvrage intéressera aussi des étudiants plus avancés ou des enseignants-chercheurs, souhaitant dégager l’essentiel des outils sophistiqués pour la simulation de processus stochastiques linéaires et non-linéaires.
  • Faddeev eigenfunctions for multipoint potentials
    • Grinevich Piotr
    • Novikov Roman
    Eurasian Journal of Mathematical and Computer Applications, Eurasian National University, Kazakhstan (Nur-Sultan), 2013, 1 (2), pp.76-91. We present explicit formulas for the Faddeev eigenfunctions and related generalized scattering data for multipoint potentials in two and three dimensions. For single point potentials in 3D such formulas were obtained in an old unpublished work of L.D. Faddeev. For single point potentials in 2D such formulas were given recently in [P.G. Grinevich, R.G. Novikov, Physics Letters A,376,(2012),1102-1106].
  • Stochastic Simulation and Monte Carlo Methods. Mathematical Foundations of Stochastic Simulation.
    • Talay Denis
    • Graham Carl
    , 2013, 68, pp.268.
  • Spatiotemporal Dynamic Simulation of Acute Perfusion/Diffusion Ischemic Stroke Lesions Evolution: A Pilot Study Derived from Longitudinal MR Patient Data
    • Rekik Islem
    • Allassonnière Stéphanie
    • Durrleman Stanley
    • Carpenter Trevor
    • Wardlaw Joanna M
    Computational and Mathematical Methods in Medicine, Hindawi Publishing Corporation, 2013. The spatiotemporal evolution of stroke lesions, from acute injury to final tissue damage, is complex. Diffusion-weighted (DWI) and perfusion-weighted (PWI) imaging is commonly used to detect early ischemic changes and attempts to distinguish between permanently damaged and salvageable tissues. To date, 2D and 3D measures of diffusion/perfusion regions at individual timepoints have been widely used but may underestimate the true lesion spatio-temporal dynamics. Currently there is no spatio-temporal 4D dynamic model that simulates the continuous evolution of ischemic stroke from MR images. We determined whether a 4D current-based diffeomorphic model, developed in the field of statistical modeling for measuring the variability of anatomical surfaces, could estimate patient-specific spatio-temporal continuous evolution for MR PWI (measured as mean transit time, (MTT)) and DWI lesions. In our representative pilot sample, the model fitted the data well. Our dynamic analysis of lesion evolution showed different patterns; for example, some DWI/PWI dynamic changes corresponded with DWI lesion expansion into PWI lesions, but other patterns were much more complex and diverse. There was wide variation in the time when the final tissue damage was reached after stroke for DWI and MTT (10.1155/2013/283593)
    DOI : 10.1155/2013/283593
  • Normal forms and invariants for 2-dimensional almost-Riemannian structures
    • Boscain Ugo
    • Charlot Grégoire
    • Ghezzi Roberta
    Differential Geometry and its Applications, Elsevier, 2013, 31 (1), pp.41-62. 2-Dimensional almost-Riemannian structures are generalized Riemannian structures on surfaces for which a local orthonormal frame is given by a Lie bracket generating pair of vector fields that can become collinear. Generically, there are three types of points: Riemannian points where the two vector fields are linearly independent, Grushin points where the two vector fields are collinear but their Lie bracket is not, and tangency points where the two vector fields and their Lie bracket are collinear and the missing direction is obtained with one more bracket. In this paper we consider the problem of finding normal forms and functional invariants at each type of point. We also require that functional invariants are "complete" in the sense that they permit to recognize locally isometric structures. The problem happens to be equivalent to the one of finding a smooth canonical parameterized curve passing through the point and being transversal to the distribution. For Riemannian points such that the gradient of the Gaussian curvature K is different from zero, we use the level set of K as support of the parameterized curve. For Riemannian points such that the gradient of the curvature vanishes (and under additional generic conditions), we use a curve which is found by looking for crests and valleys of the curvature. For Grushin points we use the set where the vector fields are parallel. Tangency points are the most complicated to deal with. The cut locus from the tangency point is not a good candidate as canonical parameterized curve since it is known to be non-smooth. Thus, we analyse the cut locus from the singular set and we prove that it is not smooth either. A good candidate appears to be a curve which is found by looking for crests and valleys of the Gaussian curvature. We prove that the support of such a curve is uniquely determined and has a canonical parametrization (10.1016/j.difgeo.2012.10.001)
    DOI : 10.1016/j.difgeo.2012.10.001
  • Asymptotic enumeration of Eulerian circuits for graphs with strong mixing properties
    • Isaev Mikhail
    Izvestiya RAN. Serya Matematicheskaya, 2013, 77 (6), pp.45-70. We prove an asymptotic formula for the number of Eulerian circuits for graphs with strong mixing properties and with vertices having even degrees. The exact value is determined up to the multiplicative error $O(n^{-1/2+\varepsilon})$, where $n$ is the number of vertices
  • New global stability estimates for monochromatic inverse acoustic scattering
    • Isaev Mikhail
    • Novikov Roman
    SIAM Journal on Mathematical Analysis, Society for Industrial and Applied Mathematics, 2013, 45 (3), pp.1495-1504. We give new global stability estimates for monochromatic inverse acoustic scattering. These estimates essentially improve estimates of [P. Hahner, T. Hohage, SIAM J. Math. Anal., 33(3), 2001, 670-685] and can be considered as a solution of an open problem formulated in the aforementioned work.
  • Analysis of the factorization method for a general class of boundary conditions
    • Chamaillard Mathieu
    • Chaulet Nicolas
    • Haddar Houssem
    Journal of Inverse and Ill-posed Problems, De Gruyter, 2013. We analyze the factorization method (introduced by Kirsch in 1998 to solve inverse scattering problems at fixed frequency from the farfield operator) for a general class of boundary conditions that generalizes impedance boundary conditions. For instance, when the surface impedance operator is of pseudo-differential type, our main result stipulates that the factorization method works if the order of this operator is different from one and the operator is Fredholm of index zero with non negative imaginary part. We also provide some validating numerical examples for boundary operators of second order with discussion on the choice of the testing function. (10.1515/jip-2013-0013)
    DOI : 10.1515/jip-2013-0013
  • Path Planning and Ground Control Station Simulator for UAV
    • Ajami Alain
    • Balmat Jean-François
    • Gauthier Jean-Paul
    • Maillot Thibault
    , 2013, pp.1-13. no abstract
  • Partition-Based Conditional Density Estimation
    • Cohen Serge X.
    • Le Pennec Erwan
    ESAIM: Probability and Statistics, EDP Sciences, 2013, 17, pp.672--697. (10.1051/ps/2012017)
    DOI : 10.1051/ps/2012017
  • Optimally swimming stokesian robots
    • Alouges François
    • Desimone Antonio
    • Heltai Luca
    • Lefebvre-Lepot Aline
    • Merlet Benoît
    Discrete and Continuous Dynamical Systems - Series B, American Institute of Mathematical Sciences, 2013, 18 (5), pp.1189-1215. We study self-propelled stokesian robots composed of assemblies of balls, in dimensions 2 and 3, and prove that they are able to control their position and orientation. This is a result of controllability, and its proof relies on applying Chow's theorem in an analytic framework, similar to what has been done in [3] for an axisymmetric system swimming along the axis of symmetry. We generalize the analyticity result given in [3] to the situation where the swimmers can move either in a plane or in three-dimensional space, hence experiencing also rotations. We then focus our attention on energetically optimal strokes, which we are able to compute numerically. Some examples of computed optimal strokes are discussed in detail. (10.3934/dcdsb.2013.18.1189)
    DOI : 10.3934/dcdsb.2013.18.1189
  • Direct competition results from strong competiton for limited resource
    • Mirrahimi Sepideh
    • Perthame Benoît
    • Wakano Joe Yuichiro
    Journal of Mathematical Biology, Springer, 2013, pp.0303-6812. We study a model of competition for resource through a chemostat-type model where species consume the common resource that is constantly supplied. We assume that the species and resources are characterized by a continuous trait. As already proved, this model, although more complicated than the usual Lotka-Volterra direct competition model, describes competitive interactions leading to concentrated distributions of species in continuous trait space. Here we assume a very fast dynamics for the supply of the resource and a fast dynamics for death and uptake rates. In this regime we show that factors that are independent of the resource competition become as important as the competition efficiency and that the direct competition model is a good approximation of the chemostat. Assuming these two timescales allows us to establish a mathematically rigorous proof showing that our resource-competition model with continuous traits converges to a direct competition model. We also show that the two timescales assumption is required to mathematically justify the corresponding classic result on a model consisting of only finite number of species and resources (MacArthur, R. Theor. Popul. Biol. 1970:1, 1-11). This is performed through asymptotic analysis, introducing different scales for the resource renewal rate and the uptake rate. The mathematical difficulty relies in a possible initial layer for the resource dynamics. The chemostat model comes with a global convex Lyapunov functional. We show that the particular form of the competition kernel derived from the uptake kernel, satisfies a positivity property which is known to be necessary for the direct competition model to enjoy the related Lyapunov functional. (10.1007/s00285-013-0659-5)
    DOI : 10.1007/s00285-013-0659-5
  • Preliminary control variates to improve empirical regression methods
    • Benzineb Tarik
    • Gobet Emmanuel
    Monte Carlo Methods and Applications, De Gruyter, 2013, 19 (4), pp.331--354. We design a variance reduction method to reduce the estimation error in regression problems. It is based on an appropriate use of other known regression functions. Theoretical estimates are supporting this improvement and numerical experiments are illustrating the efficiency of the method.
  • A Formula for Popp’s Volume in Sub-Riemannian Geometry
    • Barilari Davide
    • Rizzi Luca
    Analysis and Geometry in Metric Spaces, Versita, 2013, 1. For an equiregular sub-Riemannian manifold M, Popp's volume is a smooth volume which is canonically associated with the sub-Riemannian structure, and it is a natural generalization of the Riemannian one. In this paper we prove a general formula for Popp's volume, written in terms of a frame adapted to the sub-Riemannian distribution. As a first application of this result, we prove an explicit formula for the canonical sub-Laplacian, namely the one associated with Popp's volume. Finally, we discuss sub-Riemannian isometries, and we prove that they preserve Popp's volume. We also show that, under some hypotheses on the action of the isometry group of M, Popp's volume is essentially the unique volume with such a property. (10.2478/agms-2012-0004)
    DOI : 10.2478/agms-2012-0004