Descriptor: "Calcul parallèle, distribué et partagé" - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Calcul parallèle, distribué et partagé"' showing total 57 results

Start Over Descriptor "Calcul parallèle, distribué et partagé"

57 results on '"Calcul parallèle, distribué et partagé"'

1. Experiences in multiyear combined state–parameter estimation with an ecosystem model of the North Atlantic and Arctic Oceans using the Ensemble Kalman Filter

Author: Ehouarn Simon, Laurent Bertino, Annette Samuelsen, Sandrine Mouysset, Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Hjort Centre for Marine Ecosystem Dynamics (NORWAY), Nansen Environmental and Remote Sensing Center - NERSC (NORWAY), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Institut National Polytechnique (Toulouse) (Toulouse INP), Nansen Environmental and Remote Sensing Center [Bergen] (NERSC), and Hjort Center for Marine Ecosystem Dynamics
Subjects: [SDU.OCEAN]Sciences of the Universe [physics]/Ocean, Atmosphere, Ecosystem modeling, Aquatic Science, Spring bloom, Oceanography, Calcul parallèle, distribué et partagé, Sea surface temperature, Data assimilation, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Arctic, Combined state–parameter estimation, 13. Climate action, Ecosystem model, Climatology, Clustering analysis, Ensemble Kalman filter, Ecosystem, 14. Life underwater, [SDE.BE]Environmental Sciences/Biodiversity and Ecology, Ecology, Evolution, Behavior and Systematics, Sea level
Abstract: International audience; A sequence of one-year combined state–parameter estimation experiments has been conducted in a North Atlantic and Arctic Ocean configuration of the coupled physical–biogeochemical model HYCOM-NORWECOM over the period 2007–2010. The aim is to evaluate the ability of an ensemble-based data assimilation method to calibrate ecosystem model parameters in a pre-operational setting, namely the production of the MyOcean pilot reanalysis of the Arctic biology. For that purpose, four biological parameters (two phyto- and two zooplankton mortality rates) are estimated by assimilating weekly data such as, satellite-derived Sea Surface Temperature, along-track Sea Level Anomalies, ice concentrations and chlorophyll-a concentrations with an Ensemble Kalman Filter. The set of optimized parameters locally exhibits seasonal variations suggesting that time-dependent parameters should be used in ocean ecosystem models. A clustering analysis of the optimized parameters is performed in order to identify consistent ecosystem regions. In the north part of the domain, where the ecosystem model is the most reliable, most of them can be associated with Longhurst provinces and new provinces emerge in the Arctic Ocean. However, the clusters do not coincide anymore with the Longhurst provinces in the Tropics due to large model errors. Regarding the ecosystem state variables, the assimilation of satellite-derived chlorophyll concentration leads to significant reduction of the RMS errors in the observed variables during the first year, i.e. 2008, compared to a free run simulation. However, local filter divergences of the parameter component occur in 2009 and result in an increase in the RMS error at the time of the spring bloom.
Published: 2015
Full Text: View/download PDF

2. Towards Cooperative Semantic Computing: a Distributed Reasoning approach for Fog-enabled SWoT

Author: Nicolas Seydoux, Thierry Monteil, Khalil Drira, Nathalie Hernandez, Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Institut National des Sciences Appliquées - INSA (FRANCE), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT), Institut de recherche en informatique de Toulouse (IRIT), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Équipe Services et Architectures pour Réseaux Avancés (LAAS-SARA), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), MEthodes et ingénierie des Langues, des Ontologies et du DIscours (IRIT-MELODI), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), and Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1)
Subjects: Cooperative Semantic, business.product_category, Java, Computer science, Cooperative semantic computing, Distributed computing, 02 engineering and technology, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, Architectural pattern, Semantic computing, 0202 electrical engineering, electronic engineering, information engineering, SemanticWeb of Things, SWOT analysis, computer.programming_language, Building automation, Cloud-Fog processing, business.industry, Quality of service, [INFO.INFO-WB]Computer Science [cs]/Web, Computing, Semantic Web of Things, SHACL rules, 020206 networking & telecommunications, Intelligence artificielle, Distributed reasoning, Calcul parallèle, distribué et partagé, Laptop, Scalability, 020201 artificial intelligence & image processing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, computer, Informatique ubiquitaire
Abstract: International audience; The development of the Semantic Web of Things (SWoT) is challenged by the nature of IoT architectures where constrained devices are connected to powerful cloud servers in charge of processing remotely collected data. Such an architectural pattern introduces multiple bottlenecks constituting a hurdle for scalability, and degrades the QoS parameters such as response time. This hinders the development of a number of critical and time-sensitive applications. As an alternative to this Cloud-centric architecture, Fog-enabled architectures can be considered to take advantage of the myriad of devices that can be used for partially processing data circulating between the local sensors and the remote Cloud servers. The approach developed in this paper is a contribution in this direction: it aims to enable rule-based processing to be deployed closer to data sources, in order to foster the implementation of semantic-enabled applications. For this purpose, we define a dynamic deployment technique for rule-based semantic reasoning on Fog nodes. This technique has been evaluated according to a strategy improving information delivery delay to applications. The implementation in Java based on SHACL rules has been executed on a platform containing a server, a laptop and a Raspberry Pi, and is evaluated on a smart building use case where both distribution and scalability have been considered.
Published: 2018

3. Correctness by construction and style preserving reconfigurations of system of systems

Author: Cédric Eichler, Khalil Drira, Thierry Monteil, Patricia Stolf, Sécurité des Données et des Systèmes (SDS), Laboratoire d'Informatique Fondamentale d'Orléans (LIFO), Université d'Orléans (UO)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université d'Orléans (UO)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA), Équipe Services et Architectures pour Réseaux Avancés (LAAS-SARA), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Système d’exploitation, systèmes répartis, de l’intergiciel à l’architecture (IRIT-SEPIA), Institut de recherche en informatique de Toulouse (IRIT), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Institut National des Sciences Appliquées de Toulouse - INSA (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Institut National des Sciences Appliquées de Centre Val de Loire - INSA (FRANCE), Université d'Orléans (FRANCE), Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse 1 Capitole (UT1)-Université Toulouse - Jean Jaurès (UT2J)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse 1 Capitole (UT1)-Université Toulouse - Jean Jaurès (UT2J), Université Toulouse 1 Capitole (UT1)-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), and Institut National Polytechnique de Toulouse - INPT (FRANCE)
Subjects: [INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR], Model checking, Theoretical computer science, Correctness, Computer science, Système d'exploitation, Réseaux et télécommunications, 02 engineering and technology, Mathematical proof, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Architectures Matérielles, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Formalisms, Theory of computation, System of systems, Graph rewriting, 020207 software engineering, Systèmes embarqués, Graph, Rewrite systems, Calcul parallèle, distribué et partagé, Grammars and context-free languages, Scalability, Formal languages and automata theory, Graph (abstract data type), [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, [INFO.INFO-OS]Computer Science [cs]/Operating Systems [cs.OS], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract: International audience; In distributed systems and dynamic environments, software architectures may evolve. A crucial issue when conducting system evolutions is to maintain the system in a consistent and functional state. As system complexity rises, manual checking or exhaustive model checking may be too time- and resource-consuming, lacking in scalability. This is particularly true with system of systems. Based on formal proofs in design-time, correctness by construction has recently emerged to efficiently guarantee system coherency.This article proposes a new method for the construction and specification of correct by construction system reconfigurations. Such transformations are characterized by graph rewriting rules that necessarily preserve the coherency of a system. We firstly propose operators on graph transformations and show that they conserve their correctness. Given a system specified by a graph grammar, these operators can be leveraged to construct correct transformations. We show in particular that any correct configuration can be reached starting from any other one without inconsistent intermediate step, using such transformations only.
Published: 2018
Full Text: View/download PDF

4. Parallel solution of the discretized and linearized G-heat equation

Author: Ming Chau, Pierre Spiteri, Amar Ouaoua, Hacène Boutabia, Traitement et Compréhension d’Images (IRIT-TCI), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Institut National Polytechnique (Toulouse) (Toulouse INP), Université Badji Mokhtar - Annaba [Annaba] (UBMA), Advanced Solutions Accelerator (ASA), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Advanced Solutions Accelerator - ASA (FRANCE), Université Badji Mokhtar - Annaba (ALGERIA), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: Parallel computing, Scale (ratio), Discretization, Computer Networks and Communications, Computer science, Relaxation methods, 02 engineering and technology, 01 natural sciences, Measure (mathematics), Domain (mathematical analysis), 0203 mechanical engineering, Financial application, Convergence (routing), Applied mathematics, 0101 mathematics, Algebraic number, Asynchronous iteration, 010101 applied mathematics, Calcul parallèle, distribué et partagé, 020303 mechanical engineering & transports, G-heat equation, Hardware and Architecture, Bounded function, Heat equation, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Software
Abstract: International audience; The present study deals with the numerical solution of the G-heat equation. Since the G-heat equation is defined in an unbounded domain, we firstly state that the solution of the G-heat equation defined in a bounded domain converges to the solution of the G-heat equation when the measure of the domain tends to infinity. Moreover, after time discretisation by an implicit time marching scheme, we define a method of linearisation of each stationary problem, which leads to the solution of a large scale algebraic system. A unified approach analysis of the convergence of the sequential and parallel relaxation methods is given. Finally, we present the results of numerical experiments.
Published: 2018
Full Text: View/download PDF

5. Lock-Free Search Data Structures: Throughput Modeling with Poisson Processes

Author: Atalar, Aras, Renaud-Goud, Paul, Tsigas, Philippas, Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Chalmers University of Technology (SWEDEN), Institut de Recherche en Informatique de Toulouse - IRIT (Toulouse, France), Chalmers University of Technology [Göteborg], Système d’exploitation, systèmes répartis, de l’intergiciel à l’architecture (IRIT-SEPIA), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Université Toulouse - Jean Jaurès (UT2J), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: 020203 distributed computing, 000 Computer science, knowledge, general works, Performance, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Algorithme et structure de données, Modeling, 020207 software engineering, Performance et fiabilité, 02 engineering and technology, Calcul parallèle, distribué et partagé, [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], Lock-free, Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Search data structures, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Analysis
Abstract: International audience; This paper considers the modeling and the analysis of the performance of lock-free concurrentsearch data structures. Our analysis considers such lock-free data structures that are utilizedthrough a sequence of operations which are generated with a memoryless and stationary accesspattern. Our main contribution is a new way of analyzing lock-free concurrent search datastructures: our execution model matches with the behavior that we observe in practice andachieves good throughput predictions.Search data structures are formed of basic blocks, usually referred to as nodes, which can beaccessed by two kinds of events, characterized by their latencies; (i) CAS events originated as aresult of modifications of the search data structure (ii) Read events that occur during traversals.An operation triggers a set of events, and the running time of an operation is computed as thesum of the latencies of these events. We identify the factors that impact the latency of suchevents on a multi-core shared memory system. The main challenge (though not the only one) isthat the latency of each event mainly depends on the state of the caches at the time when it istriggered, and the state of caches is changing due to events that are triggered by the operationsof any thread in the system. Accordingly, the latency of an event is determined by the orderingof the events on the timeline.Search data structures are usually designed to accommodate a large number of nodes, whichmakes the occurrence of an event on a given node rare at any given time. In this context, wemodel the events on each node as Poisson processes from which we can extract the frequency andprobabilistic ordering of events that are used to estimate the expected latency of an operation,and in turn the throughput. We have validated our analysis on several fundamental lock-freesearch data structures such as linked lists, hash tables, skip lists and binary trees.
Published: 2018

6. On the use of the energy norm in trust-region and adaptive cubic regularization subproblems

Author: Youssef Diouane, Serge Gratton, El Houcine Bergou, Mathématiques et Informatique Appliquées du Génome à l'Environnement [Jouy-En-Josas] (MaIAGE), Institut National de la Recherche Agronomique (INRA), Département d'Ingénierie des Systèmes Complexes (DISC), Institut Supérieur de l'Aéronautique et de l'Espace (ISAE-SUPAERO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1)-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées, Algorithmes Parallèles et Optimisation (IRIT-APO), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Institut National Polytechnique (Toulouse) (Toulouse INP), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Institut Supérieur de l'Aéronautique et de l'Espace - ISAE-SUPAERO (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: Hessian matrix, Control and Optimization, Optimization problem, 0211 other engineering and technologies, 010103 numerical & computational mathematics, 02 engineering and technology, Positive-definite matrix, Energy norm, 01 natural sciences, Regularization (mathematics), Adaptive regularized framework using cubics, Nonlinear programming, Combinatorics, symbols.namesake, Applied mathematics, 0101 mathematics, Conjugate gradient, Mathematics, Trust region, 021103 operations research, Line search, Applied Mathematics, Krylov subspace, Unconstrained optimization, Calcul parallèle, distribué et partagé, Computational Mathematics, Trust-region algorithm, Nonlinear optimization, symbols, Krylov subspace methods, Line search algorithm, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract: International audience; We consider solving unconstrained optimization problems by means of two popular globalization techniques: trust-region (TR) algorithms and adaptive regularized framework using cubics (ARC). Both techniques require the solution of a so-called ``subproblem'' in which a trial step is computed by solving an optimization problem involving an approximation of the objective function, called ``the model". The latter is supposed to be adequate in a neighborhood of the current iterate. In this paper, we address an important practical question related with the choice of the norm for defining the neighborhood. More precisely, assuming here that the Hessian $B$ of the model is symmetric positive definite, we propose the use of the so-called ``energy norm'' -- defined by $\|x\|_B= \sqrt{x^TBx}$ for all $x \in \real^n$ -- in both TR and ARC techniques. We show that the use of this norm induces remarkable relations between the trial step of both methods that can be used to obtain efficient practical algorithms. We furthermore consider the use of truncated Krylov subspace methods to obtain an approximate trial step for large scale optimization. Within the energy norm, we obtain line search algorithms along the Newton direction, with a special backtracking strategy and an acceptability condition in the spirit of TR/ARC methods. The new line search algorithm, derived by ARC, enjoys a worst-case iteration complexity of $\mathcal{O}(\epsilon^{-3/2})$. We show the good potential of the energy norm on a set of numerical experiments.
Published: 2017
Full Text: View/download PDF

7. On the Complexity of the Block Low-Rank Multifrontal Factorization

Author: Jean-Yves L'Excellent, Théo Mary, Alfredo Buttari, Patrick R. Amestoy, Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Centre National de la Recherche Scientifique (CNRS), Optimisation des ressources : modèles, algorithmes et ordonnancement (ROMA), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Laboratoire de l'Informatique du Parallélisme (LIP), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées, Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Normale Supérieure de Lyon - ENS de Lyon (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Institut National de la Recherche en Informatique et en Automatique - INRIA (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Université Claude Bernard-Lyon I - UCBL (FRANCE), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: Rank (linear algebra), 65F05, Property (programming), 010103 numerical & computational mathematics, 010502 geochemistry & geophysics, 15A23, 01 natural sciences, 65Y20, Reduction (complexity), Factorization, multifrontal factorization, 65F50, [INFO]Computer Science [cs], Multifrontal factorization, 0101 mathematics, [MATH]Mathematics [math], 0105 earth and related environmental sciences, Mathematics, Block (data storage), 65N30, Applied Mathematics, Order (ring theory), sparse linear algebra, Sparse linear algebra, Solver, Algebra, Calcul parallèle, distribué et partagé, Block low-rank, Computational Mathematics, Elliptic partial differential equation, Block Low-Rank AMS subject classifications 15A06, Block Low-Rank
Abstract: International audience; Matrices coming from elliptic Partial Differential Equations have been shown to have a low-rank property: well defined off-diagonal blocks of their Schur complements can be approximated by low-rank products and this property can be efficiently exploited in multifrontal solvers to provide a substantial reduction of their complexity. Among the possible low-rank formats, the Block Low-Rank format (BLR) is easy to use in a general purpose multifrontal solver and has been shown to provide significant gains compared to full-rank on practical applications. However, unlike hierarchical formats, such as H and HSS, its theoretical complexity was unknown. In this paper, we extend the theoretical work done on hierarchical matrices in order to compute the theoretical complexity of the BLR multifrontal factorization. We then present several variants of the BLR multifrontal factorization, depending on the strategies used to perform the updates in the frontal matrices and on the constraints on how numerical pivoting is handled. We show how these variants can further reduce the complexity of the factorization. In the best case (3D, constant ranks), we obtain a complexity of the order of O(n^4/3). We provide an experimental study with numerical results to support our complexity bounds.
Published: 2017
Full Text: View/download PDF

8. Large-scale 3D EM modeling with a Block Low-Rank multifrontal direct solver

Author: Théo Mary, Piyoosh Jaysaval, Patrick R. Amestoy, Jean-Yves L'Excellent, Sébastien de la Kethulle de Ryhove, Alfredo Buttari, Daniil V. Shantsev, emgs [Oslo], Department of Physics [Oslo], Faculty of Mathematics and Natural Sciences [Oslo], University of Oslo (UiO)-University of Oslo (UiO), Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées, Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Centre National de la Recherche Scientifique (CNRS), Optimisation des ressources : modèles, algorithmes et ordonnancement (ROMA), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon), Laboratoire de l'Informatique du Parallélisme (LIP), Université Toulouse III - Paul Sabatier (UT3), Université Toulouse 1 Capitole (UT1)-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Université de Toulouse (UT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Institut National de la Recherche en Informatique et en Automatique - INRIA (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), University of Texas at Austin (USA), University of Oslo (NORWAY), Institut de Recherche en Informatique de Toulouse - IRIT (Toulouse, France), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: Floating point, Discretization, Rank (linear algebra), Computer science, 010103 numerical & computational mathematics, 010502 geochemistry & geophysics, 01 natural sciences, Numerical solutions, Matrix decomposition, Computational science, Factorization, Geochemistry and Petrology, Numerical approximations and analysis, [INFO]Computer Science [cs], 0101 mathematics, 0105 earth and related environmental sciences, Block (data storage), Linear system, Solver, Electromagnetic theory, Calcul parallèle, distribué et partagé, Geophysics, Numerical modelling, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Marine electromagnetics, Controlled source electromagnetics (CSEM)
Abstract: International audience; We put forward the idea of using a Block Low-Rank (BLR) multifrontal direct solver to efficiently solve the linear systems of equations arising from a finite-difference discretization of the frequency-domain Maxwell equations for 3-D electromagnetic (EM) problems. The solver uses a low-rank representation for the off-diagonal blocks of the intermediate dense matrices arising in the multifrontal method to reduce the computational load. A numerical threshold, the so-called BLR threshold, controlling the accuracy of low-rank representations was optimized by balancing errors in the computed EM fields against savings in floating point operations (flops). Simulations were carried out over large-scale 3-D resistivity models representing typical scenarios for marine controlled-source EM surveys, and in particular the SEG SEAM model which contains an irregular salt body. The flop count, size of factor matrices and elapsed run time for matrix factorization are reduced dramatically by using BLR representations and can go down to, respectively, 10, 30 and 40 per cent of their full-rank values for our largest system with N = 20.6 million unknowns. The reductions are almost independent of the number of MPI tasks and threads at least up to 90 × 10 = 900 cores. The BLR savings increase for larger systems, which reduces the factorization flop complexity from O(N2) for the full-rank solver to O(Nm) with m = 1.4–1.6. The BLR savings are significantly larger for deep-water environments that exclude the highly resistive air layer from the computational domain. A study in a scenario where simulations are required at multiple source locations shows that the BLR solver can become competitive in comparison to iterative solvers as an engine for 3-D controlled-source electromagnetic Gauss–Newton inversion that requires forward modelling for a few thousand right-hand sides.
Published: 2017
Full Text: View/download PDF

9. Non-intrusive Coupling: Recent Advances and Scalable Nonlinear Domain Decomposition

Author: Jean-Charles Passieux, Stéphane Guinard, Mickaël Duval, Michel Salaün, Airbus (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut Supérieur de l'Aéronautique et de l'Espace - ISAE-SUPAERO (FRANCE), Département de Mécanique des Structures et Matériaux - DMSM (Toulouse, France), Institut Clément Ader (ICA), Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-IMT École nationale supérieure des Mines d'Albi-Carmaux (IMT Mines Albi), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut Supérieur de l'Aéronautique et de l'Espace (ISAE-SUPAERO), EADS Innovation Works [Toulouse], EADS - European Aeronautic Defense and Space, ANR-12-MONU-0002,ICARE,Interfaces Généralisées et Couplage non intrusif : application de codes de recherche au sein de codes industriels pour l'analyse de structures fortement non linéaires(2012), Institut Supérieur de l'Aéronautique et de l'Espace (ISAE-SUPAERO)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-IMT École nationale supérieure des Mines d'Albi-Carmaux (IMT Mines Albi), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)
Subjects: Finite element method, Computer science, Distributed computing, Message Passing Interface, 010103 numerical & computational mathematics, 01 natural sciences, [PHYS.MECA.STRU]Physics [physics]/Mechanics [physics]/Structural mechanics [physics.class-ph], Software, Operator (computer programming), Code (cryptography), Domain decomposition method, 0101 mathematics, Non-intrusive Coupling, Domain Decomposition, Non-intrusive, Multi-scale, Software coupling, business.industry, Applied Mathematics, Domain decomposition methods, Mécanique, Computer Science Applications, Calcul parallèle, distribué et partagé, 010101 applied mathematics, Mécanique des structures, Test case, Computer engineering, Coupling (computer programming), [SPI.MECA.STRU]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Structural mechanics [physics.class-ph], Finite Element Method, Coupling Algorithms, Scalability, business
Abstract: International audience; This paper provides a detailed review of the global/local non-intrusive coupling algorithm. Such method allows to alter a global finite element model, without actually modifying its corresponding numerical operator. We also look into improvement of the initial algorithm (Quasi-Newton and dynamic relaxation), and provide comparison based on several relevant test cases. Innovative examples and advanced applications of the non-intrusive coupling algorithm are provided, granting a handy framework for both researchers and engineers willing to make use of such process. Finally, a novel nonlinear domain decomposition method is derived from the global/local non-intrusive coupling strategy, without the need to use a parallel code or software. Such method being intended to large scale analysis, we show its scalability. Jointly, an efficient high level Message Passing Interface coupling framework is also proposed, granting an universal and flexible way for easy software coupling. A sample code is also given.
Published: 2014
Full Text: View/download PDF

10. Shared-Memory Parallelism and Low-Rank Approximation Techniques Applied to Direct Solvers in FEM Simulation

Author: Alfredo Buttari, Valene Pellissier, Jean-Yves L'Excellent, Mohamed W. Sid-Lakhdar, Cristian Pozza, Patrick R. Amestoy, Guillaume Joslin, Clement Weisbecker, Michele Forzan, Remy Perrin, Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Centre National de la Recherche Scientifique (CNRS), Centre Européen de Recherche et de Formation Avancée en Calcul Scientifique (CERFACS), Optimisation des ressources : modèles, algorithmes et ordonnancement (ROMA), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), École normale supérieure de Lyon (ENS de Lyon), Dipartimento di Ingegneria Civile Edile ed Ambientale [Padova] (ICEA), Università degli Studi di Padova = University of Padua (Unipd), Cedrat Technologies, Centre National d'Études Spatiales - CNES (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Normale Supérieure de Lyon - ENS de Lyon (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), CEDRAT TECHNOLOGIES (FRANCE), Università degli Studi di Padova (ITALY), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, CERFACS, École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), École normale supérieure - Lyon (ENS Lyon), Universita degli Studi di Padova, and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: Memory Management, FEM Simulation, Computer science, Parallel Processing, Finite Element Analysis, Low-rank approximation, 010103 numerical & computational mathematics, Parallel computing, 01 natural sciences, Induction Heating, Electrical Engineering Computing, ACM: G.: Mathematics of Computing, Matrix (mathematics), 0103 physical sciences, 0101 mathematics, Electrical and Electronic Engineering, Multicore Parallelization, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS, Sparse matrix, 010302 applied physics, Multi-core processor, Approximation theory, Parallel Sparse Direct Solver, Low-Rank Representations, Approximation Theory, Shared-Memory Parallelism, Linear Systems, Electromagnetic Heating, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.3: Numerical Linear Algebra, Eddy Currents, Mathematics Computing, Matrix Algebra, Solver, Large Size, Finite element method, Electronic, Optical and Magnetic Materials, Calcul parallèle, distribué et partagé, Sparse Matrices, Memory management, Shared memory, Test Matrices, Multiprocessing Systems, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], FEMs
Abstract: International audience; In this paper, the performance of a parallel sparse direct solver on a shared memory multicore system is presented. Large size test matrices arising from finite element simulation of induction heating industrial applications are used in order to evaluate the performance improvements due to low-rank representations and multicore parallelization
Published: 2014
Full Text: View/download PDF

11. Segmentation of cDNA Microarray Images using Parallel Spectral Clustering

Author: Joseph Noailles, Ronan Guivarch, Sandrine Mouysset, Daniel Ruiz, Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), and Université Toulouse 1 Capitole - UT1 (FRANCE)
Subjects: Microarray, Computer science, computer.software_genre, Image Segmentation, lcsh:QA75.5-76.95, Microarray image, Spectral clustering, Segmentation, Domain decomposition, Domain Decomposition, General Environmental Science, Image segmentation, business.industry, Spectral Clustering, Locality, General Engineering, Domain decomposition methods, Pattern recognition, Quantitative Biology::Genomics, Expression (mathematics), Calcul parallèle, distribué et partagé, ComputingMethodologies_PATTERNRECOGNITION, Gene chip analysis, General Earth and Planetary Sciences, A priori and a posteriori, Data mining, Artificial intelligence, lcsh:Electronic computers. Computer science, business, Microarray Image, computer
Abstract: Microarray technology generates large amounts of expression level of genes to be analyzed simultaneously. This analysis implies microarray image segmentation to extract the quantitative information from spots. Spectral clustering is one of the most relevant unsupervised methods able to gather data without a priori information on shapes or locality. We propose and test on microarray images a parallel strategy for the Spectral Clustering method based on domain decomposition with a criterion to determine the number of clusters.
Published: 2013

12. High Confidence Intervals Applied to Aircraft Altitude Prediction

Author: Mohammad Ghasemi Hamed, Richard Alligier, David Gianazza, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), Institut Mines-Télécom [Paris] (IMT)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL), ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien (MAIAA), Ecole Nationale de l'Aviation Civile (ENAC), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT), Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Nationale de l'Aviation Civile - ENAC (FRANCE), Ecole Nationale Supérieure de Techniques Avancées - ENSTA (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Institut de Recherche en Informatique de Toulouse - IRIT (Toulouse, France), and Institut National Polytechnique de Toulouse - INPT (FRANCE)
Subjects: Engineering, Tolerance Intervals, 02 engineering and technology, Robust confidence intervals, Tolerance intervals, Bonferroni inequality, 0502 economics and business, Statistics, 0202 electrical engineering, electronic engineering, information engineering, Point-mass model, High Confidence Interval Prediction, Aircraft Trajectory Prediction, 050210 logistics & transportation, High-confidence-interval prediction, business.industry, Mechanical Engineering, 020208 electrical & electronic engineering, 05 social sciences, Air traffic management, Conditional probability distribution, Aircraft trajectory prediction, Confidence interval, Computer Science Applications, Quantile regression, Calcul parallèle, distribué et partagé, BADA, Automotive Engineering, Climb, Quantile Regression, Tolerance interval, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Point-mass Model, business, Confidence and prediction bands
Abstract: This paper describes the application of high-confidence-interval prediction methods to the aircraft trajectory prediction problem, more specifically to the altitude prediction during climb. We are interested in methods for finding two-sided intervals that contain, with a specified confidence, at least a desired proportion of the conditional distribution of the response variable. This paper introduces two-sided Bonferroni-quantile confidence intervals, which is a new method for obtaining high-confidence two-sided intervals in quantile regression. This paper also uses the Bonferroni inequality to propose a new method for obtaining tolerance intervals in least squares regression. The latter has the advantages of being reliable, fast, and easy to calculate. We compare physical point-mass models to the introduced models on an air traffic management data set composed of traffic at major French airports. Experimental results show that the proposed interval prediction models perform significantly better than the conventional point-mass model currently used in most trajectory predictors. When comparing with a recent state-of-the-art point-mass model with adaptive mass estimation, the proposed methods give altitude intervals that are slightly wider but more reliable.
Published: 2016
Full Text: View/download PDF

13. Predicting Aircraft Descent Length with Machine Learning

Author: Alligier, Richard, Gianazza, David, Durand, Nicolas, Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Nationale de l'Aviation Civile - ENAC (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien (MAIAA), Ecole Nationale de l'Aviation Civile (ENAC), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, FAA, and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: Machine Learning, Calcul parallèle, distribué et partagé, BADA, Machine learning, Descent, aircraft trajectory prediction, descent, Aircraft trajectory prediction, [SPI.AUTO]Engineering Sciences [physics]/Automatic
Abstract: International audience; Predicting aircraft trajectories is a key element in the detection and resolution of air traffic conflicts. In this paper, we focus on the ground-based prediction of final descents toward the destination airport. Several Machine Learning methods – ridge regression, neural networks, and gradient-boosting machine – are applied to the prediction of descents toward Toulouse airport (France), and compared with a baseline method relying on the Eurocontrol Base of Aircraft Data (BADA). Using a dataset of 15,802 Mode-S radar trajectories of 11 different aircraft types, we build models which predict the total descent length from the cruise altitude to a given final altitude. Our results show that the Machine Learning methods improve the root mean square error on the predicted descent length of at least 20 % for the ridge regression, and up to 24 % for the gradient-boosting machine, when compared with the baseline BADA method.
Published: 2016

14. A second-order globally convergent direct-search method and its worst-case complexity

Author: Clément W. Royer, Luís Nunes Vicente, Serge Gratton, Centre National de la Recherche Scientifique - CNRS (FRANCE), Universidade de Coimbra (PORTUGAL), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Institut National Polytechnique (Toulouse) (Toulouse INP), Center for Mathematics [Coimbra] (CMUC), and University of Coimbra [Portugal] (UC)
Subjects: Hessian matrix, Smoothness, Mathematical optimization, 021103 operations research, Control and Optimization, Applied Mathematics, 0211 other engineering and technologies, Derivative-free optimization, 010103 numerical & computational mathematics, 02 engineering and technology, Management Science and Operations Research, 01 natural sciences, Measure (mathematics), Direct search, Calcul parallèle, distribué et partagé, symbols.namesake, Iterated function, Convergence (routing), Worst-case complexity, symbols, 0101 mathematics, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Gradient descent, Mathematics
Abstract: International audience; Direct-search algorithms form one of the main classes of algorithms for smooth unconstrained derivative-free optimization, due to their simplicity and their well-established convergence results. They proceed by iteratively looking for improvement along some vectors or directions. In the presence of smoothness, first-order global convergence comes from the ability of the vectors to approximate the steepest descent direction, which can be quantified by a first-order criticality (cosine) measure. The use of a set of vectors with a positive cosine measure together with the imposition of a sufficient decrease condition to accept new iterates leads to a convergence result as well as a worst-case complexity bound. In this paper, we present a second-order study of a general class of direct-search methods. We start by proving a weak second-order convergence result related to a criticality measure defined along the directions used throughout the iterations. Extensions of this result to obtain a true second-order optimality one are discussed, one possibility being a method using approximate Hessian eigenvectors as directions (which is proved to be truly second-order globally convergent). Numerically guaranteeing such a convergence can be rather expensive to ensure, as it is indicated by the worst-case complexity analysis provided in this paper, but turns out to be appropriate for some pathological examples.
Published: 2015
Full Text: View/download PDF

15. 3D frequency-domain seismic modeling with a Parallel BLR multifrontal direct solver

Author: Romain Brossier, Ludovic Métivier, Jean Virieux, Théo Mary, Jean-Yves L'Excellent, Alain Miniussi, Alfredo Buttari, Clement Weisbecker, Stéphane Operto, Patrick R. Amestoy, Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Institut National Polytechnique (Toulouse) (Toulouse INP), Institut des Sciences de la Terre (ISTerre), Université Joseph Fourier - Grenoble 1 (UJF)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-Institut national des sciences de l'Univers (INSU - CNRS)-Institut de recherche pour le développement [IRD] : UR219-PRES Université de Grenoble-Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry])-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Optimisation des ressources : modèles, algorithmes et ordonnancement (ROMA), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Equations aux Dérivées Partielles (EDP), Laboratoire Jean Kuntzmann (LJK), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS), Observatoire de la Côte d'Azur, COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Université Côte d'Azur (UCA), Géoazur (GEOAZUR 7329), Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire de la Côte d'Azur, COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Université Côte d'Azur (UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD [France-Sud]), Livermore Software Technology Corporation [Livermore] (LSTC), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux - IFSTTAR (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Institut National de la Recherche en Informatique et en Automatique - INRIA (FRANCE), Institut de Recherche pour le Développement - IRD (FRANCE), Université Nice Sophia Antipolis (FRANCE), Observatoire de la Côte d'Azur (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Université Joseph Fourier Grenoble 1 - UJF (FRANCE), Université de Savoie Mont Blanc - USMB (FRANCE), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF), Université Côte d'Azur (UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), Université Côte d'Azur (UCA)-Institut national des sciences de l'Univers (INSU - CNRS)-Institut de Recherche pour le Développement (IRD [France-Sud])-Centre National de la Recherche Scientifique (CNRS)-Observatoire de la Côte d'Azur, Université Côte d'Azur (UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), Université Toulouse 1 Capitole (UT1)-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry])-PRES Université de Grenoble-Institut de recherche pour le développement [IRD] : UR219-Institut national des sciences de l'Univers (INSU - CNRS)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-Université Joseph Fourier - Grenoble 1 (UJF), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), Université Côte d'Azur (UCA), Université Côte d'Azur (UCA)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD [France-Sud]), Institut national des sciences de l'Univers (INSU - CNRS)-Institut de Recherche pour le Développement (IRD [France-Sud])-Centre National de la Recherche Scientifique (CNRS)-Observatoire de la Côte d'Azur, and Université Côte d'Azur (UCA)-Université Côte d'Azur (UCA)
Subjects: Finite difference, Wave propagation, Computer science, [SDU.STU]Sciences of the Universe [physics]/Earth Sciences, Inversion (meteorology), 010103 numerical & computational mathematics, Parallel computing, Solver, 010502 geochemistry & geophysics, Wave equation, 01 natural sciences, Calcul parallèle, distribué et partagé, Frequency-domain, Seismic modeling, Frequency domain, Programming, 0101 mathematics, Algebraic number, Approximate solution, Full waveform, ComputingMilieux_MISCELLANEOUS, 0105 earth and related environmental sciences, 3D
Abstract: Three-dimensional frequency-domain full waveform inversion (FWI) of fixed-spread data can be efficiently performed in the visco-acoustic approximation when seismic modeling is based on a sparse direct solver. We present a parallel algebraic Block Low-Rank (BLR) multifrontal solver which provides an approximate solution of the time-harmonic wave equation with a reduced operation count, memory demand, and volume of communication relative to the full-rank solver. We analyze the parallel efficiency and the accuracy of the solver with a realistic FWI case study from the Valhall oil field.
Published: 2015

16. Machine Learning and Mass Estimation Methods for Ground-Based Aircraft Climb Prediction

Author: Nicolas Durand, David Gianazza, Richard Alligier, Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Nationale de l'Aviation Civile - ENAC (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien (MAIAA), Ecole Nationale de l'Aviation Civile (ENAC), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), and Université Fédérale Toulouse Midi-Pyrénées
Subjects: Engineering, Mean squared error, Context (language use), Machine learning, computer.software_genre, Machine Learning, Set (abstract data type), [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], aircraft trajectory prediction, Mass estimation, Altitude (triangle), business.industry, Mechanical Engineering, Base (topology), Aircraft trajectory prediction, mass estimation, Computer Science Applications, Calcul parallèle, distribué et partagé, Variable (computer science), Base of aircraft data (BADA), BADA, Automotive Engineering, Trajectory, Climb, Artificial intelligence, business, computer
Abstract: International audience; In this paper, we apply Machine Learning methods to improve the aircraft climb prediction in the context of ground-based applications. Mass is a key parameter for climb prediction. As it is considered a competitive parameter by many airlines, it is currently not available to ground-based trajectory predictors. Consequently, most predictors today use a reference mass that may be different from the actual aircraft mass. In previous papers, we have introduced a least square method to estimate the mass from past trajectory points, using the physical model of the aircraft. Another mass estimation method, based on an adaptive mechanism, has also been proposed by Schultz et. al. We now introduce a new approach, where the mass is considered as the response variable of a prediction model that is learned from a set of example trajectories. This Machine Learning approach is compared with the results obtained when using the BADA (Base of Aircraft Data) reference mass or the two state-of-the-art mass estimation methods. In these experiments, 9 different aircraft types are considered. When compared with the baseline method (resp. the mass estimation methods), the Machine Learning approach reduces the RMSE (Root Mean Square Error) on the predicted altitude by at least 58 % (resp. 27 %) when assuming the speed profile to be known, and by at least 29 % (resp. 17 %) when using the BADA speed profile except for the aircraft types E145 and F100. For these types, the observed speed profile is far from the BADA speed profile.
Published: 2015
Full Text: View/download PDF

17. Geometric and numerical methods in the contrast imaging problem in nuclear magnetic resonance

Author: Olivier Cots, Bernard Bonnard, Pierre Martinon, Mathieu Claeys, Institut de Mathématiques de Bourgogne [Dijon] (IMB), Université de Bourgogne (UB)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS), Équipe Méthodes et Algorithmes en Commande (LAAS-MAC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Mathematics for Control, Transport and Applications (McTAO), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Centre de Mathématiques Appliquées - Ecole Polytechnique (CMAP), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Control, Optimization, Models, Methods and Applications for Nonlinear Dynamical Systems (Commands), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut de Mathématiques de Bourgogne [Dijon] ( IMB ), Université de Bourgogne ( UB ) -Centre National de la Recherche Scientifique ( CNRS ), Équipe Méthodes et Algorithmes en Commande ( LAAS-MAC ), Laboratoire d'analyse et d'architecture des systèmes [Toulouse] ( LAAS ), Institut National Polytechnique [Toulouse] ( INP ) -Institut National des Sciences Appliquées - Toulouse ( INSA Toulouse ), Institut National des Sciences Appliquées ( INSA ) -Institut National des Sciences Appliquées ( INSA ) -Université Paul Sabatier - Toulouse 3 ( UPS ) -Centre National de la Recherche Scientifique ( CNRS ) -Institut National Polytechnique [Toulouse] ( INP ) -Institut National des Sciences Appliquées - Toulouse ( INSA Toulouse ), Institut National des Sciences Appliquées ( INSA ) -Institut National des Sciences Appliquées ( INSA ) -Université Paul Sabatier - Toulouse 3 ( UPS ) -Centre National de la Recherche Scientifique ( CNRS ), Mathematics for Control, Transport and Applications ( McTAO ), Inria Sophia Antipolis - Méditerranée ( CRISAM ), Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ), Centre de Mathématiques Appliquées - Ecole Polytechnique ( CMAP ), École polytechnique ( X ) -Centre National de la Recherche Scientifique ( CNRS ), Control, Optimization, Models, Methods and Applications for Nonlinear Dynamical Systems ( Commands ), Centre National de la Recherche Scientifique ( CNRS ) -École polytechnique ( X ) -Unité de Mathématiques Appliquées ( UMA ), École Nationale Supérieure de Techniques Avancées ( Univ. Paris-Saclay, ENSTA ParisTech ) -École Nationale Supérieure de Techniques Avancées ( Univ. Paris-Saclay, ENSTA ParisTech ) -Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Centre de Mathématiques Appliquées - Ecole Polytechnique ( CMAP ), Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université de Bourgogne (UB), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Institut National de la Recherche en Informatique et en Automatique - INRIA (FRANCE), Institut National des Sciences Appliquées de Toulouse - INSA (FRANCE), Institut Supérieur de l'Aéronautique et de l'Espace - ISAE-SUPAERO (FRANCE), Université de Bourgogne - UB (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Ecole Polytechnique (FRANCE), Laboratoire d'Analyse et d'Architecture des Systèmes - LAAS (Toulouse, France), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: [ MATH.MATH-OC ] Mathematics [math]/Optimization and Control [math.OC], [ MATH ] Mathematics [math], Partial differential equation, business.industry, Moment optimization, [SDV.IB.IMA]Life Sciences [q-bio]/Bioengineering/Imaging, Applied Mathematics, Numerical analysis, Direct method, Geometric optimal control, Shooting and continuation techniques, Optimal control, Contrast imaging, Calcul parallèle, distribué et partagé, Nuclear magnetic resonance, Maximum principle, Software, Geometric control, Contrast imaging in NMR, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], [MATH]Mathematics [math], business, [ SDV.IB.IMA ] Life Sciences [q-bio]/Bioengineering/Imaging, Mathematics
Abstract: International audience; In this article, the contrast imaging problem in nuclear magnetic resonance is modeled as a Mayer problem in optimal control. The optimal solution can be found as an extremal, solution of the Maximum Principle and analyzed with the techniques of geometric control. This leads to a numerical investigation based on so-called indirect methods using the HamPath software. The results are then compared with a direct method implemented within the Bocop toolbox. Finally lmi techniques are used to estimate a global optimum.
Published: 2015
Full Text: View/download PDF

18. Machine Learning Applied to Airspeed Prediction During Climb

Author: Alligier, Richard, Gianazza, David, Durand, Nicolas, Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Nationale de l'Aviation Civile - ENAC (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien (MAIAA), Ecole Nationale de l'Aviation Civile (ENAC), FAA & Eurocontrol, and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: Machine Learning, Calcul parallèle, distribué et partagé, [SPI]Engineering Sciences [physics], Aircraft trajectory prediction -Speed intent, BADA, Machine learning, aircraft trajectory prediction, speed intent
Abstract: International audience; In this paper, we apply Machine Learning methods to improve the aircraft climb prediction in the context of groundbased applications. Mass and speed intent are key parameters for climb prediction. As they are considered as competitive parameters by many airlines, they are currently not available to groundbased trajectory predictors. Consequently, most predictors today use reference parameters that may be quite different from the actual ones. In our most recent paper ([1]), we have demonstrated that Machine Learning techniques provide a mass estimation significantly more precise than two state-of-the-art mass estimation methods. In this paper, we apply similar techniques to the speed intent. We first build a set of examples by adjusting CAS/Mach speed profile to each climb trajectory in our database. Then, using the adjusted values (ccas; cM) in this database, we learn a model able to predict the (cas;M) values of a new trajectory, using its past points as input. We apply this technique to actual Mode-C radar data and we consider 9 different aircraft types. When compared with the reference speed profiles provided by BADA, the reduction of the speed RMSE ranges from 36 % to 79 %, depending on the aircraft type. Using the predicted mass and speed profile, BADA is used to compute the predicted future trajectory with a 10 minute horizon. When compared with BADA used with the reference parameters, the reduction of the future altitude RMSE ranges from 45 % to 87 %.
Published: 2015

19. Parallel computation of entries of A-1

Author: Jean-Yves L'Excellent, François-Henry Rouet, Patrick R. Amestoy, Iain S. Duff, Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Ecole Nationale Supérieure d'Electrotechnique, d'Electronique, d'Informatique, d'Hydraulique et de Télécommunications (ENSEEIHT), Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université de Toulouse (UT), Centre Européen de Recherche et de Formation Avancée en Calcul Scientifique (CERFACS), STFC Rutherford Appleton Laboratory (RAL), Science and Technology Facilities Council (STFC), Optimisation des ressources : modèles, algorithmes et ordonnancement (ROMA), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Lawrence Berkeley National Laboratory [Berkeley] (LBNL), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées, CERFACS, École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), and Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL)
Subjects: Parallel computing, Parallelism (rhetoric), Computer science, Applied Mathematics, Direct method, Parallel algorithm, MathematicsofComputing_NUMERICALANALYSIS, Inverse, Sparse Linear Algebra, MUMPS, Calcul parallèle, distribué et partagé, Computational Mathematics, Matrix (mathematics), Direct methods, Code (cryptography), [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Algorithm, Sparse matrix, [INFO.INFO-MS]Computer Science [cs]/Mathematical Software [cs.MS]
Abstract: In this paper, we are concerned about computing in parallel several entries of the inverse of a large sparse matrix. We assume that the matrix has already been factorized by a direct method and that the factors are distributed. Entries are efficiently computed by exploiting sparsity of the right-hand sides and the solution vectors in the triangular solution phase. We demonstrate that in this setting, parallelism and computational efficiency are two contrasting objectives. We develop an efficient approach and show its efficacy by runs using the MUMPS code that implements a parallel multifrontal method.
Published: 2015
Full Text: View/download PDF

20. 3D+t segmentation of PET images using spectral clustering

Author: Zbib, Hiba, Kdouh, Salam, Mouysset, Sandrine, Stute, Simon, Girault, Jean-Marc, Charara, Jamal, Nassereddme, Mohammad, Mcheik, Ali, Buvat, Irene, Tauber, Clovis, Commissariat à l'Energie Atomique et aux énergies alternatives - CEA (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Institut National de la Santé et de la Recherche Médicale - INSERM (FRANCE), Lebanese University - LU (LEBANON), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Centre Hospitalier Régional Universitaire de Tours - CHU Tours (FRANCE), Université de Tours (FRANCE), Université Paris-Sud 11 (FRANCE), Imagerie et Cerveau (Tours, France), Université Libanaise, Imagerie et cerveau (iBrain - Inserm U1253 - UNIV Tours ), Université de Tours-Institut National de la Santé et de la Recherche Médicale (INSERM), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Imagerie Moléculaire in Vivo (IMIV - U1023 - ERL9218), Service Hospitalier Frédéric Joliot (SHFJ), Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Institut National de la Santé et de la Recherche Médicale (INSERM), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université de Tours (UT)-Institut National de la Santé et de la Recherche Médicale (INSERM), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Université Paris-Saclay-Direction de Recherche Fondamentale (CEA) (DRF (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), and Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Calcul parallèle, distribué et partagé, Image segmentation, Positron emission tomography, 3D+t segmentation, Physics::Medical Physics, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, Principal component analysis, PET images, Monte Carlo methods, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Medical image processing
Abstract: International audience; Segmentation of dynamic PET images is often needed to extract the time activity curve (TAC) of regions. While clustering methods have been proposed to segment the PET sequence, they are generally either sensitive to initial conditions or favor convex shaped clusters. Recently, we have proposed a deterministic and automatic spectral clustering method (AD-KSC) of PET images. It has the advantage of handling clusters with arbitrary shape in the space in which they are identified. While improved results were obtained with AD-KSC compared to other methods, its use for clinical applications is constrained to 2D+t PET data due to its computational complexity. In this paper, we propose an extension of AD-KSC to make it applicable to 3D+t PET data. First, a preprocessing step based on a recursive principle component analysis and a Global K-means approach is used to generate many small seed clusters. AD-KSC is then applied on the generated clusters to obtain the final partition of the data. We validated the method with GATE Monte Carlo simulations of Zubal head phantom. The proposed approach improved the region of interest (ROI) definition and outperformed the K-means algorithm.
Published: 2015

21. E-Biothon: an experimental platform for BioInformatics

Author: DAYDÉ, Michel, DEPARDON, Benjamin, FRANC, Alain, GIBRAT, Jean-François, GUILLIER, Romaric, KARAMI, Yasaman, PÉREZ, Christian, SUTER, Frédéric, CHABBERT, Marie, TADDESE, Bruck, THÉROND, Sylvie, Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Institut National Polytechnique (Toulouse) (Toulouse INP), SysFera [Villeurbanne], from patterns to models in computational biodiversity and biotechnology (PLEIADE), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Biodiversité, Gènes & Communautés (BioGeCo), Institut National de la Recherche Agronomique (INRA)-Université de Bordeaux (UB)-Institut National de la Recherche Agronomique (INRA), Biodiversité, Gènes & Communautés (BioGeCo), Institut National de la Recherche Agronomique (INRA)-Université de Bordeaux (UB), Mathématiques et Informatique Appliquées du Génome à l'Environnement [Jouy-En-Josas] (MaIAGE), Institut National de la Recherche Agronomique (INRA), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Algorithms and Software Architectures for Distributed and HPC Platforms (AVALON), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Biologie Computationnelle et Quantitative = Laboratory of Computational and Quantitative Biology (LCQB), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut de Biologie Paris Seine (IBPS), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS), Centre de Calcul de l'IN2P3 (CC-IN2P3), Institut National de Physique Nucléaire et de Physique des Particules du CNRS (IN2P3)-Centre National de la Recherche Scientifique (CNRS), Biologie Neurovasculaire et Mitochondriale Intégrée (BNMI), Université d'Angers (UA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), Faculté de Médecine d'Angers, Institut du développement et des ressources en informatique scientifique (IDRIS), Centre National de la Recherche Scientifique (CNRS), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse Capitole (UT Capitole), Université Fédérale Toulouse Midi-Pyrénées, École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Guillier, Romaric, Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Normale Supérieure de Lyon - ENS de Lyon (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Institut National de la Recherche Agronomique - INRA (FRANCE), Institut National de la Recherche en Informatique et en Automatique - INRIA (FRANCE), Université Pierre et Marie Curie, Paris 6 - UPMC (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Université Claude Bernard-Lyon I - UCBL (FRANCE), SysFera (FRANCE), Biodiversité Gènes et Communautés - BIOGECO (Bordeaux, France), Université Toulouse 1 Capitole (UT1)-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université Sciences et Technologies - Bordeaux 1-Université Bordeaux Segalen - Bordeaux 2-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université Sciences et Technologies - Bordeaux 1-Université Bordeaux Segalen - Bordeaux 2-Inria Bordeaux - Sud-Ouest, Institut National de la Recherche Agronomique (INRA)-Université de Bordeaux (UB)-Institut National de la Recherche Agronomique (INRA)-Université de Bordeaux (UB), Institut National de la Santé et de la Recherche Médicale (INSERM)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-Institut National de Physique Nucléaire et de Physique des Particules du CNRS (IN2P3), Centre National de la Recherche Scientifique (CNRS)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Université d'Angers (UA), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Inria Bordeaux - Sud-Ouest, Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: Parallel computing, Speedup, Computer science, Bioinformatics, Cloud computing, Electronic mail, World Wide Web, Set (abstract data type), 03 medical and health sciences, 0302 clinical medicine, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM], 030304 developmental biology, 0303 health sciences, business.industry, parallel computing, Data science, Blue gene, Calcul parallèle, distribué et partagé, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], business, Cloud, 030217 neurology & neurosurgery
Abstract: International audience; The E-Biothon platform is an experimental Cloud platform to help speed up and advance research in biology, health and environment. It is based on a Blue Gene/P system and a web portal that allow members of the bioinformatics community to easily launch their scientific applications. We describe in this paper the technical capacities of the platform, the different applications supported and finally a set of user experiences on the platform.
Published: 2015
Full Text: View/download PDF

22. Strengthening compute and data intensive capacities of Armenia

Author: Hrachya Astsatryan, Jack Dongarra, Yuri Shoukourian, Vladimir Sahakyan, Per Öster, Pierre-Henri Cros, Michel Daydé, Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), National Academy of Sciences of the Republic of Armenia (ARMENIA), CSC - IT Center for Science (FINLAND), University of Tennessee - UT (USA), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), National Academy of Sciences of the Republic of Armenia [Yerevan] (NAS RA), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées, Algorithmes Parallèles et Optimisation (IRIT-APO), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Institut National Polytechnique (Toulouse) (Toulouse INP), The University of Tennessee [Knoxville], and IT Center for Science [Espoo] (CSC)
Subjects: Big Data, Economic growth, Decision support system, Computer science, media_common.quotation_subject, Big data, ArmNGI, Armenina, 02 engineering and technology, Computer security, computer.software_genre, The Republic, State (polity), 0202 electrical engineering, electronic engineering, information engineering, E-infrastructures, media_common, Government, Armenian, business.industry, Information technology, 021001 nanoscience & nanotechnology, language.human_language, Calcul parallèle, distribué et partagé, Informatics, HPC, language, Position (finance), ASNET-AM, 020201 artificial intelligence & image processing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0210 nano-technology, business, computer
Abstract: International audience; Traditionally, Armenia has had a leading position within the computer science and Information Technology sectors in the South Caucasus region and beyond. Information Technology (IT) is also one of the fastest growing industries of the Armenian economy [1]. In 2000, the Government of Armenia recognized the IT sector as the primary constituent of the country's economic progress. Armenia is, more than ever, in need of cutting-edge and relevant e-infrastructures and e-services to tackle today's societal and scientific challenges. The Institute for Informatics and Automation Problems (IIAP) of the National Academy of Sciences of the Republic of Armenia (NAS RA) [2] is the only state supported structure for software, hardware, and brainware technologies in Armenia. The institute is responsible for Armenia's National research and education network (Academic Scientific Research Computer Network of Armenia, ASNET-AM) [3] and the National Grid Initiative (ArmNGI) [4], and provides computational and networking facilities and advanced services to users. The main objective of this article is to highlight key activities that will spur Armenia to strengthen its scientific computing capacity thanks to the analysis made of the current trends of e-Infrastructures in Europe and the USA.
Published: 2015
Full Text: View/download PDF

23. Efficient 3D frequency-domain full-waveform inversion of ocean-bottom cable data with sparse block low-rank direct solver: a real data case study from the North Sea

Author: Jean-Yves L'Excellent, Jean Virieux, Alain Miniussi, Ludovic Métivier, Alfredo Buttari, Romain Brossier, Patrick R. Amestoy, Clement Weisbecker, Stéphane Operto, Alessandra Ribodetti, Théo Mary, Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux - IFSTTAR (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Institut National de la Recherche en Informatique et en Automatique - INRIA (FRANCE), Institut de Recherche pour le Développement - IRD (FRANCE), Université Nice Sophia Antipolis (FRANCE), Observatoire de la Côte d'Azur (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Université Joseph Fourier Grenoble 1 - UJF (FRANCE), Université de Savoie Mont Blanc - USMB (FRANCE), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1)-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées, Institut National Polytechnique (Toulouse) (Toulouse INP), Institut des Sciences de la Terre (ISTerre), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry])-PRES Université de Grenoble-Institut de recherche pour le développement [IRD] : UR219-Institut national des sciences de l'Univers (INSU - CNRS)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-Université Joseph Fourier - Grenoble 1 (UJF), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Optimisation des ressources : modèles, algorithmes et ordonnancement (ROMA), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Equations aux Dérivées Partielles (EDP), Laboratoire Jean Kuntzmann (LJK), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), Observatoire de la Côte d'Azur, Université Côte d'Azur (UCA), Géoazur (GEOAZUR 7329), Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire de la Côte d'Azur, Université Côte d'Azur (UCA)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD [France-Sud]), Livermore Software Technology Corporation [Livermore] (LSTC), Algorithmes Parallèles et Optimisation (IRIT-APO), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Joseph Fourier - Grenoble 1 (UJF)-Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-Institut national des sciences de l'Univers (INSU - CNRS)-Institut de recherche pour le développement [IRD] : UR219-PRES Université de Grenoble-Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry])-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF), Université Côte d'Azur (UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), Université Côte d'Azur (UCA)-Institut national des sciences de l'Univers (INSU - CNRS)-Institut de Recherche pour le Développement (IRD [France-Sud])-Centre National de la Recherche Scientifique (CNRS)-Observatoire de la Côte d'Azur, Université Côte d'Azur (UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Université Côte d'Azur (UCA), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Université Côte d'Azur (UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD [France-Sud]), Institut national des sciences de l'Univers (INSU - CNRS)-Institut de Recherche pour le Développement (IRD [France-Sud])-Centre National de la Recherche Scientifique (CNRS)-Observatoire de la Côte d'Azur, and Université Côte d'Azur (UCA)-Université Côte d'Azur (UCA)
Subjects: Wave propagation, OBC, Computer science, Frequency band, Modeling, [SDU.STU]Sciences of the Universe [physics]/Earth Sciences, Inversion (meteorology), [PHYS.PHYS.PHYS-GEO-PH]Physics [physics]/Physics [physics]/Geophysics [physics.geo-ph], Full-waveform inversion, Solver, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, LU decomposition, law.invention, Calcul parallèle, distribué et partagé, Overburden, Frequency-domain, Wavelet, law, Frequency domain, Algorithm
Abstract: International audience; We present an application of 3D frequency-domain full waveform inversion (FWI) on ocean-bottom cable data from the North Sea. Frequency-domain seismic modeling is performed in the visco-acoustic VTI approximation with a sparse direct solver based on the multifrontal method. The computational cost of the multifrontal LU factorization is efficiently reduced with a block-low rank (BLR) approximation of the dense frontal matrices. A multiscale frequency-domain FWI is applied by successive inversions of 11 discrete frequencies in the 3.5Hz-10Hz frequency band. The velocity model built by FWI reveals short-scale features such as channels, scrapes left by drifting icebergs on the paleo-seafloor, fractures and deep reflectors below the reservoir level, although the presence of gas in the overburden. The quality of the FWI results is controlled by time-domain modeling and source wavelet estimation. Next step is the application of multi-parameter FWI with second-order optimization algorithms, which can be efficiently implemented with our frequency-domain modeling engine.
Published: 2015
Full Text: View/download PDF

24. Direct Search Based on Probabilistic Descent

Author: Serge Gratton, Luís Nunes Vicente, Zaikun Zhang, Clément W. Royer, Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Institut National Polytechnique (Toulouse) (Toulouse INP), Center for Mathematics [Coimbra] (CMUC), University of Coimbra [Portugal] (UC), Centre Européen de Recherche et de Formation Avancée en Calcul Scientifique (CERFACS), CERFACS, Centre National de la Recherche Scientifique - CNRS (FRANCE), Universidade de Coimbra (PORTUGAL), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: 021103 operations research, Matching (graph theory), 0211 other engineering and technologies, Probabilistic logic, Derivative-free optimization, 010103 numerical & computational mathematics, 02 engineering and technology, Type (model theory), 01 natural sciences, Measure (mathematics), Direct search, Theoretical Computer Science, Calcul parallèle, distribué et partagé, Bounded function, Convergence (routing), 0101 mathematics, Polling, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Algorithm, Gradient method, Software, Mathematics
Abstract: International audience; Direct-search methods are a class of popular derivative-free algorithms characterized by evaluating the objective function using a step size and a number of (polling) directions. When applied to the minimization of smooth functions, the polling directions are typically taken from positive spanning sets, which in turn must have at least n+1 vectors in an $n$-dimensional variable space. In addition, to ensure the global convergence of these algorithms, the positive spanning sets used throughout the iterations are required to be uniformly nondegenerate in the sense of having a positive (cosine) measure bounded away from zero. However, recent numerical results indicated that randomly generating the polling directions without imposing the positive spanning property can improve the performance of these methods, especially when the number of directions is chosen as considerably less than n+1. In this paper, we analyze direct-search algorithms when the polling directions are probabilistic descent, meaning that with a certain probability at least one of them is of descent type. Such a framework enjoys almost-sure global convergence. More interestingly, we will show a global decaying rate of $1/\sqrt{k}$ for the gradient size, with overwhelmingly high probability, matching the corresponding rate for the deterministic versions of the gradient method or of direct search. Our analysis helps us understand numerical behavior and the choice of the number of polling directions.
Published: 2015
Full Text: View/download PDF

25. Interactive image-based information visualization for aircraft trajectory analysis

Author: David Gianazza, Christophe Hurter, Stéphane Conversy, Alexandru Telea, Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Nationale de l'Aviation Civile - ENAC (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), University of Groningen (NETHERLANDS), Department of Mathematics and Computing Science (Groningen, Netherlands), ENAC - Equipe Informatique Interactive (LII), Ecole Nationale de l'Aviation Civile (ENAC), ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien (MAIAA), University of Groningen [Groningen], and Institut National Polytechnique de Toulouse - INPT (FRANCE)
Subjects: Computer science, trajectory manipulation, Big data, Transportation, image based techniques, ComputerApplications_COMPUTERSINOTHERSYSTEMS, 02 engineering and technology, Image Based Techniques, computer.software_genre, Domain (software engineering), Air Traffic Control, Computer graphics, Information visualization, Information Visualization, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], Civil and Structural Engineering, 050210 logistics & transportation, business.industry, Data manipulation language, 05 social sciences, 020207 software engineering, Air traffic control, Trajectory Manipulation, air traffic control, Computer Science Applications, Visualization, Metadata, Calcul parallèle, distribué et partagé, Automotive Engineering, Data mining, information visualization, business, computer
Abstract: International audience; The objective of the presented work is to present novel methods for big data exploration in the Air Traffic Control (ATC) domain. Data is formed by sets of airplane trajectories, or trails, which in turn records the positions of an aircraft in a given airspace at several time instants, and additional information such as flight height, speed, fuel consumption, and metadata (e.g. flight ID). Analyzing and understanding this time-dependent data poses several non-trivial challenges to information visualization. Materials and methods: To address this Big Data challenge, we present a set of novel methods to analyze aircraft trajectories with interactive image-based information visualization techniques.As a result, we address the scalability challenges in terms of data manipulation and open questions by presenting a set of related visual analysis methods that focus on decision-support in the ATC domain. All methods use image-based techniques, in order to outline the advantages of such techniques in our application context, and illustrated by means of use-cases from the ATC domain. Results: For each considered use-case, we outline the type of questions posed by domain experts, data involved in addressing these questions, and describe the specific image-based techniques we used to address these questions. Further, for each of the proposed techniques, we describe the visual representation and interaction mechanisms that have been used to address the above-mentioned goals. We illustrate these use-cases with real-life datasets from the ATC domain, and show how our techniques can help end-users in the ATC domain discover new insights, and solve problems, involving the presented datasets.
Published: 2014
Full Text: View/download PDF

26. Wind parameters extraction from aircraft trajectories

Author: Gennady Andrienko, Stéphane Puechmorel, Richard Alligier, Natalia Andrienko, David Gianazza, Christophe Hurter, Centre National de la Recherche Scientifique - CNRS (FRANCE), City University London (UNITED KINGDOM), Ecole Nationale de l'Aviation Civile - ENAC (FRANCE), Institut Fraunhofer-Gesellschaft (GERMANY), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Institut de Recherche en Informatique de Toulouse - IRIT (Toulouse, France), Ecole Nationale de l'Aviation Civile (ENAC), ENAC Equipe MAIAA-OPTIM (MAIA-OPTIM), ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien (MAIAA), Ecole Nationale de l'Aviation Civile (ENAC)-Ecole Nationale de l'Aviation Civile (ENAC), Fraunhofer Institute for Intelligent Analysis and Information Systems (Fraunhofer IAIS), Fraunhofer (Fraunhofer-Gesellschaft), City University London, Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), and Publica
Subjects: Engineering, Geography, Planning and Development, Wind Extraction, 02 engineering and technology, visual analytics, Data Exploration, law.invention, Relative direction, law, Control theory, 0502 economics and business, Control, 0202 electrical engineering, electronic engineering, information engineering, Radar, Simulation, Air Traffic, General Environmental Science, 050210 logistics & transportation, business.industry, Ecological Modeling, 05 social sciences, 020207 software engineering, Filter (signal processing), Air traffic control, Wind direction, air traffic control, wind extraction, Urban Studies, Calcul parallèle, distribué et partagé, Least Squares Approximation, least squares approximation, Ground speed, Visual Analytics, Curve fitting, Trajectory, data exploration, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], business
Abstract: International audience; When supervising aircraft, air traffic controllers need to know the current wind magnitude and direction since they impact every flying vessel. The wind may accelerate or slow down an aircraft, depending on its relative direction to the wind. Considering several aircraft flying in the same geographical area, one can observe how the ground speed depends on the direction followed by the aircraft. If a sufficient amount of trajectory data is available, approximately sinusoidal shapes emerge when plotting the ground speeds. These patterns characterize the wind in the observed area. After visualizing this phenomenon on recorded radar data, we propose an analytical method based on a least squares approximation to retrieve the wind direction and magnitude from the trajectories of several aircraft flying in different directions. After some preliminary tests for which the use of the algorithm is discussed, we propose an interactive procedure to extract the wind from trajectory data. In this procedure, a human operator selects appropriate subsets of radar data, performs automatic and/or manual curve fitting to extract the wind, and validates the resulting wind estimates. The operators can also assess the wind stability in time, and validate or invalidate their previous choices concerning the time interval used to filter the input data. The wind resulting from the least squares approximation is compared with two other sources - the wind data provided by Météo-France and the wind computed from on-board aircraft parameters - showing the good performance of our algorithm. The interactive procedure received positive feedback from air traffic controllers, which is reported in this paper.
Published: 2014
Full Text: View/download PDF

27. Windmill farm pattern optimization using evolutionary algorithms

Author: Nicolas Durand, Charlie Vanaret, Jean-Marc Alliot, ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien (MAIAA), Ecole Nationale de l'Aviation Civile (ENAC), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Nationale de l'Aviation Civile - ENAC (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien ( MAIAA ), Ecole Nationale de l'Aviation Civile ( ENAC ), Institut de recherche en informatique de Toulouse ( IRIT ), Institut National Polytechnique [Toulouse] ( INP ) -Université Toulouse 1 Capitole ( UT1 ) -Université Toulouse 2 ( UT2 ) -Université Paul Sabatier - Toulouse 3 ( UPS ) -Centre National de la Recherche Scientifique ( CNRS ), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: [ MATH.MATH-OC ] Mathematics [math]/Optimization and Control [math.OC], Optimization, Mathematical optimization, Computer science, 020209 energy, wind farm, 0211 other engineering and technologies, Evolutionary algorithm, ComputerApplications_COMPUTERSINOTHERSYSTEMS, 02 engineering and technology, Turbine, 0202 electrical engineering, electronic engineering, information engineering, Wind Energy, evolutionary algorithms, Simulation, 021103 operations research, Wind power, business.industry, black box optimization, Grid, Calcul parallèle, distribué et partagé, Wind Farm Layout, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], business, Energy (signal processing), Windmill
Abstract: http://www.sigevo.org/gecco-2014/; International audience; When designing a wind farm layout, we can reduce the number of variables by optimizing a pattern instead of considering the position of each turbine. In this paper we show that when reducing the problem to only two variables defining a grid, we can gain up to 3% of energy output on simple examples of wind farms dealing with many turbines (up to 1000) while dramatically reducing computation time. To achieve these results, we compared both a genetic algorithm and a differential evolution algorithm to previous results from the literature. These preliminary results should be extended to examples involving non-rectangular farm layouts and wind distributions that may require pattern deformation variables in order to increase solution diversity.
Published: 2014
Full Text: View/download PDF

28. Modeling 1D distributed-memory dense kernels for an asynchronous multifrontal sparse solver

Author: Patrick R. Amestoy, François-Henry Rouet, Wissam M. Sid-Lakhdar, Jean-Yves L'Excellent, Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Optimisation des ressources : modèles, algorithmes et ordonnancement (ROMA), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Laboratoire de l'Informatique du Parallélisme (LIP), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Lawrence Berkeley National Laboratory [Berkeley] (LBNL), Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Normale Supérieure de Lyon - ENS de Lyon (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Institut National de la Recherche en Informatique et en Automatique - INRIA (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Université Claude Bernard-Lyon I - UCBL (FRANCE), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: multrifrontal method, Computer science, Context (language use), 010103 numerical & computational mathematics, 02 engineering and technology, Parallel computing, dense and sparse matrices, System of linear equations, 01 natural sciences, Deadlock prevention and avoidance, law.invention, Matrix (mathematics), Factorization, law, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, scalability, 020203 distributed computing, Incomplete LU factorization, Solver, LU decomposition, Calcul parallèle, distribué et partagé, linear algebra, Asynchronous communication, Linear algebra, LU factorization, Distributed memory, Parallel Comuputing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract: International audience; To solve sparse systems of linear equations, multifrontal methods rely on dense partial LU decompositions of so-called frontal matrices; we consider a parallel asynchronous setting in which several frontal matrices can be factored simultaneously.In this context, to address performance and scalability issues of acyclic pipelined asynchronous factorization kernels, we study models to revisit properties of left and right-looking variants of partial $LU$ decompositions, study the use of several levels of blocking, before focusing on communication issues.The general purpose sparse solver MUMPS has been modified to implement the proposed algorithms and confirm the properties demonstrated by the models.
Published: 2014

29. Comparison of Two Ground-based Mass Estimation Methods on Real Data

Author: Alligier, Richard, Gianazza, David, Ghasemi Hamed, Mohammad, Durand, Nicolas, ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien (MAIAA), Ecole Nationale de l'Aviation Civile (ENAC), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Nationale de l'Aviation Civile - ENAC (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: Calcul parallèle, distribué et partagé, BADA, Specific power, energy rate, aircraft trajectory prediction, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Energy rate, Aircraft trajectory prediction, Mass estimation, mass estimation, specific power
Abstract: International audience; This paper focuses on the estimation of the aircraft mass in ground-based applications. Mass is a key parameter for climb prediction. It is currently not available to groundbased trajectory predictors because it is considered a competitive parameter by many airlines. There is hope that the aircraft mass might become widely available someday, but in the meantime it is possible to estimate an equivalent mass from the data already available, assuming the thrust to be known (maximum or reduced climb thrust for example). In a previous paper ([1]), two mass estimation methods were compared using simulated data. In this paper, we compare these two mass estimation methods using Mode-C radar data. Both methods estimate the aircraft mass by fitting the modeled energy rate (i.e. the power of the forces acting on the aircraft) with the energy rate observed at several points of the past trajectory. The first method, proposed by Schultz et al. ([2]), dynamically adjusts the weight parameter so as to fit the energy rate, using an adaptive sensitivity parameter to weight each observation. The second method, introduced in one of our previous publications ([1]), estimates the mass by minimizing the quadratic error on the observed energy rate, taking advantage of the polynomial expression of the modeled power when using the BADA model. The actual mass is unavailable in our radar data. However, we can use the estimated mass to compute a trajectory prediction. This prediction is then compared to the actual trajectory giving us some insight on the accuracy of the estimated mass. We have compared the obtained predictions with the ones obtained using the BADA reference mass. The root mean square error on the predicted altitude is reduced by 45 % using the least squares method. With the adaptive method this error is divided by two.
Published: 2014

30. Symmetry and Fourier descriptor : a hybrid feature for NURBS based B-Rep models retrieval

Author: Dang, Quoc Viet, Morin, Géraldine, Mouysset, Sandrine, Real Expression Artificial Life (IRIT-REVA), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Institut National Polytechnique (Toulouse) (Toulouse INP), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), and Institut National Polytechnique de Toulouse - INPT (FRANCE)
Subjects: Calcul parallèle, distribué et partagé, Computer graphics, Object modelling and computational geometry, Information search, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract: International audience; As the number of models in 3D databases grows, an efficient 3D models indexing mechanism and a similarity measure to ease model retrieval are necessary. In this paper, we present a query-by-model framework for NURBS based B-Rep models retrieval that combines partial symmetry of the object and the Fourier shape descriptor of canonical 2D projections of the 3D models. In fact, most objects are composed by similar parts up to an isometry. By detecting the dominant partial symmetry of a given NURBS based B-Rep model, we define two canonical planes from which the Fourier descriptors are extracted to measure the similarity among 3D models.
Published: 2014

31. Evaluation of the OGF GridRPC Data Management library, and study of its integration into an International Sparse Linear Algebra Expert System

Author: Ronan Guivarch, Yves Caniou, Gaël Le Mahec, Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Algorithms and Software Architectures for Distributed and HPC Platforms (AVALON), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Picardie Jules Verne (UPJV), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Normale Supérieure de Lyon - ENS de Lyon (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Université de Picardie Jules Verne (FRANCE), Institut de Recherche en Informatique de Toulouse - IRIT (Toulouse, France), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: Sparse Linear Algebra System, Database, Computer science, business.industry, Distributed computing, Data management, Interoperability, 02 engineering and technology, computer.software_genre, Replication (computing), Expert system, GridRPC, Calcul parallèle, distribué et partagé, Software portability, 020204 information systems, Server, Middleware (distributed applications), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, computer
Abstract: International audience; The Data Management API for the GridRPC describes an optional API that extends the GridRPC standard. It provides a minimal subset of functions to handle a large set of data operations, among which movement, replication, migration and stickyness. We already showed that its use leads to 1) reduced time to completion of application, since useless transfers are avoided; 2) improved feasibility of some computations, depending on the availability of services and/or storage space constraints; 3) complete code portability between two GridRPC middleware; and 4) seamless interoperability, in our example between the French GridRPC middleware DIET and the Japanese middleware Ninf, distributed on French and Japanese administrative domains respectively, leading to both of them contributing to the same calculus, their respective servers sharing only data through our implementation of the GridRPC DM API. We have extended the implementation of the library and a further integration has been made available into DIET as a back-end of its data manager Dagda. We thus present how the library is used in the International Sparse Linear Algebra Expert System GridTLSE which manages entire expertises for the user, including data transfers, tasks executions, and graphical charts, to help analysing the overall execution. GridTLSE relies on DIET to distribute computations and thus can benefit from the persistency functionalities to provide scientists with faster results when their expertises require the same input matrices. In addition, with the possibility for two middleware to interact in a seamless way as long as they’re using an implementation of the GridRPC Data Management API, new architecture of different domains can easily be integrated to the expert system and thus helps the linear algebra community.
Published: 2014
Full Text: View/download PDF

32. Alignement de modèles 3d paramétriques BRep basé sur la détection de symétries partielles. Application à l'indexation 3D

Author: Dang, Quoc Viet, Mouysset, Sandrine, Morin, Géraldine, Institut National Polytechnique de Toulouse - INPT (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Real Expression Artificial Life (IRIT-REVA), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Algorithmes Parallèles et Optimisation (IRIT-APO), and Institut National Polytechnique (Toulouse) (Toulouse INP)
Subjects: Calcul parallèle, distribué et partagé, NURBS, Détection de symétrie, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Alignement 3D, B-Rep, Isométrie
Abstract: National audience; Cet article présente une méthode originale d’alignement d’objets 3D modélisés par des B-Rep basés NURBS en identifiant les symétries partielles au sein de ces objets. L’alignement des objets 3D est une étape importante de pré-traitement pour la recherche et l’indexation : une méthode d’alignement fiable est nécessaire. Étant donné un modèle 3D, la pose normalisée de l’objet est définie par trois plans canoniques. Nous identifions le premier plan canonique par un algorithme efficace de détection de la symétrie partielle dominante en utilisant une approche de mise en correspondance des faces. Un autre algorithme basé sur l’aire de projection détermine les deux plans restants. Notre méthode est ensuite appliquée à la recherche des objets 3D dans une répertoire des modèles B-Rep basés NURBS.
Published: 2014

33. Riemannian metrics on 2D-manifolds related to the Euler-Poinsot rigid body motion

Author: Olivier Cots, Bernard Bonnard, Nataliya Shcherbakova, Jean-Baptiste Pomet, Institut de Mathématiques de Bourgogne [Dijon] (IMB), Université de Bourgogne (UB)-Centre National de la Recherche Scientifique (CNRS), Mathematics for Control, Transport and Applications (McTAO), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire de génie chimique [ancien site de Basso-Cambo] (LGC), Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT), Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université de Bourgogne (UB), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées, Institut de Mathématiques de Bourgogne [Dijon] ( IMB ), Université de Bourgogne ( UB ) -Centre National de la Recherche Scientifique ( CNRS ), Mathematics for Control, Transport and Applications ( McTAO ), Inria Sophia Antipolis - Méditerranée ( CRISAM ), Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ), Laboratoire de génie chimique ( LGC ), Institut National Polytechnique [Toulouse] ( INP ) -Université Paul Sabatier - Toulouse 3 ( UPS ) -Centre National de la Recherche Scientifique ( CNRS ), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Institut National de la Recherche en Informatique et en Automatique - INRIA (FRANCE), Université de Bourgogne - UB (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: [ MATH.MATH-OC ] Mathematics [math]/Optimization and Control [math.OC], Control and Optimization, Mathematical analysis, Conjugate points, Rigid body, Spins dynamics, Mechanical system, Calcul parallèle, distribué et partagé, Conjugate locus on surfaces of revolution, Computational Mathematics, symbols.namesake, Control and Systems Engineering, Serret-Andoyer metric, Euler's formula, symbols, Ising model, Euler-Poinsot rigid body motion, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Locus (mathematics), Surface of revolution, Mathematics, Conjugate
Abstract: to appear; International audience; The Euler-Poinsot rigid body motion is a standard mechanical system and is a model for left-invariant Riemannian metric on SO(3). In this article using the Serret-Andoyer variables we parameterize the solutions and compute the Jacobi fields in relation with the conjugate locus evaluation. Moreover the metric can be restricted to a 2D-surface and the conjugate points of this metric are evaluated using recent work on surfaces of revolution. Another related 2D-metric on S2 associated to the dynamics of spin particles with Ising coupling is analysed using both geometric techniques and numerical simulations.
Published: 2014
Full Text: View/download PDF

34. Geometric Numerical Methods and Results in the Control Imaging Problem in Nuclear Magnetic Resonance

Author: Bernard Bonnard, Olivier Cots, Centre National de la Recherche Scientifique - CNRS (FRANCE), Université de Bourgogne - UB (FRANCE), Institut de Mathématiques de Bourgogne [Dijon] (IMB), Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université de Bourgogne (UB), Institut de Mathématiques de Bourgogne [Dijon] ( IMB ), and Université de Bourgogne ( UB ) -Centre National de la Recherche Scientifique ( CNRS )
Subjects: Code (set theory), Applied Mathematics, Numerical analysis, Mathematical analysis, Order (ring theory), 16. Peace & justice, Optimal control, Contrast imaging, Contrast Imaging In NMR, Hamiltonian system, Set (abstract data type), Calcul parallèle, distribué et partagé, Continuation, Nuclear magnetic resonance, [ INFO.INFO-DC ] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Shooting And Continuation Methods, Modeling and Simulation, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Mathematics, Geometric Optimal Control
Abstract: International audience; The purpose of this paper is to present numerical methods and results about the contrast imaging problem in nuclear magnetic resonance which corresponds to a Mayer problem in optimal control. The candidates as minimizers are selected among a set of extremals, solutions of a Hamiltonian system given by the Pontryagin Maximum Principle and sufficient second order conditions are described. They form the geometric foundations of the HAMPATH code which combines shooting and continuation methods, see Ref. 9. The main contribution of this paper is to present a numerical analysis of the contrast imaging problem in NMR in the case of deoxygenated/oxygenated blood samples as an application of the aforementioned techniques.
Published: 2014
Full Text: View/download PDF

35. Riemannian metrics on 2D manifolds related to the Euler-Poinsot rigid body problem

Author: Bernard Bonnard, Olivier Cots, Nataliya Shcherbakova, Institut de Mathématiques de Bourgogne [Dijon] ( IMB ), Université de Bourgogne ( UB ) -Centre National de la Recherche Scientifique ( CNRS ), Inria Sophia Antipolis - Méditerranée ( CRISAM ), Institut National de Recherche en Informatique et en Automatique ( Inria ), Institut de recherche en informatique de Toulouse ( IRIT ), Institut National Polytechnique [Toulouse] ( INP ) -Université Toulouse 1 Capitole ( UT1 ) -Université Toulouse - Jean Jaurès ( UT2J ) -Université Paul Sabatier - Toulouse 3 ( UPS ) -Centre National de la Recherche Scientifique ( CNRS ), Laboratoire de génie chimique ( LGC ), Institut National Polytechnique [Toulouse] ( INP ) -Université Paul Sabatier - Toulouse 3 ( UPS ) -Centre National de la Recherche Scientifique ( CNRS ), Mathematics for Control, Transport and Applications ( McTAO ), Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ), Institut de Mathématiques de Bourgogne [Dijon] (IMB), Université de Bourgogne (UB)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC), Mathematics for Control, Transport and Applications (McTAO), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire de génie chimique [ancien site de Basso-Cambo] (LGC), Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées, Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université de Bourgogne (UB), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Institut National de Recherche en Informatique et en Automatique (Inria), Université Toulouse 1 Capitole (UT1)-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Institut National de la Recherche en Informatique et en Automatique - INRIA (FRANCE), Université de Bourgogne - UB (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Université de Bourgogne (UB)-Centre National de la Recherche Scientifique (CNRS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT), Université de Toulouse (UT)-Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: [ MATH.MATH-OC ] Mathematics [math]/Optimization and Control [math.OC], Standards, Equations, Structure (category theory), Trajectory, 01 natural sciences, symbols.namesake, [ INFO.INFO-DC ] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Jacobian matrices, 0101 mathematics, Trajectory (fluid mechanics), Mathematics, Measurement, Spins, Numerical analysis, 010102 general mathematics, Mathematical analysis, Vectors, Rigid body, Optimal control, Calcul parallèle, distribué et partagé, 010101 applied mathematics, Metric (mathematics), Euler's formula, symbols, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract: International audience; The Euler-Poinsot rigid body problem is a well known model of left-invariant metrics on SO(3). In the present paper we discuss the properties of two related reduced 2D models: the sub-Riemanian metric of a system of three coupled spins and the Riemannian metric associated to the Euler- Poinsot problem via the Serret-Andoyer reduction. We explicitly construct Jacobi fields and explain the structure of conjugate loci in the Riemannian case and give the first numerical results for the spin dynamics case.
Published: 2013

36. Energy minimization problem in two-level dissipative quantum control: meridian case

Author: Bernard Bonnard, Nataliya Shcherbakova, Olivier Cots, Université de Bourgogne ( UB ), Institut de recherche en informatique de Toulouse ( IRIT ), Institut National Polytechnique [Toulouse] ( INP ) -Université Toulouse 1 Capitole ( UT1 ) -Université Toulouse - Jean Jaurès ( UT2J ) -Université Paul Sabatier - Toulouse 3 ( UPS ) -Centre National de la Recherche Scientifique ( CNRS ), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Université de Bourgogne - UB (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Université de Bourgogne (UB), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Institut National Polytechnique (Toulouse) (Toulouse INP), and Institut National Polytechnique de Toulouse - INPT (FRANCE)
Subjects: Statistics and Probability, Integrable system, Optimal Control, General Mathematics, Energy minimization, 01 natural sciences, Pontryagin's minimum principle, symbols.namesake, [ INFO.INFO-DC ] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0103 physical sciences, Optimality Conditions, Quantum system, 0101 mathematics, 010306 general physics, Mathematics, Hamiltonian mechanics, Applied Mathematics, 010102 general mathematics, Mathematical analysis, Dissipation, Optimal control, Quantum Systems, Calcul parallèle, distribué et partagé, Dissipative system, symbols, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract: International audience; We analyze the energy-minimizing problem for a two-level dissipative quantum system described by the Kossakowsky-Lindblad equation. According to the Pontryagin Maximum Principle (PMP), minimizers can be selected among normal and abnormal extremals whose dynamics are classified according to the values of the dissipation parameters. Our aim is to improve our previous analysis concerning 2D solutions in the case where the Hamiltonian dynamics are integrable.
Published: 2013
Full Text: View/download PDF

37. Comparison of Numerical Methods in the Contrast Imaging Problem in NMR

Author: Olivier Cots, Mathieu Claeys, Pierre Martinon, Bernard Bonnard, Institut de Mathématiques de Bourgogne [Dijon] ( IMB ), Université de Bourgogne ( UB ) -Centre National de la Recherche Scientifique ( CNRS ), Équipe Méthodes et Algorithmes en Commande ( LAAS-MAC ), Laboratoire d'analyse et d'architecture des systèmes [Toulouse] ( LAAS ), Institut National Polytechnique [Toulouse] ( INP ) -Institut National des Sciences Appliquées - Toulouse ( INSA Toulouse ), Institut National des Sciences Appliquées ( INSA ) -Institut National des Sciences Appliquées ( INSA ) -Université Paul Sabatier - Toulouse 3 ( UPS ) -Centre National de la Recherche Scientifique ( CNRS ) -Institut National Polytechnique [Toulouse] ( INP ) -Institut National des Sciences Appliquées - Toulouse ( INSA Toulouse ), Institut National des Sciences Appliquées ( INSA ) -Institut National des Sciences Appliquées ( INSA ) -Université Paul Sabatier - Toulouse 3 ( UPS ) -Centre National de la Recherche Scientifique ( CNRS ), Mathematics for Control, Transport and Applications ( McTAO ), Inria Sophia Antipolis - Méditerranée ( CRISAM ), Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ), Centre de Mathématiques Appliquées - Ecole Polytechnique ( CMAP ), École polytechnique ( X ) -Centre National de la Recherche Scientifique ( CNRS ), Control, Optimization, Models, Methods and Applications for Nonlinear Dynamical Systems ( Commands ), École polytechnique ( X ) -Centre National de la Recherche Scientifique ( CNRS ) -École polytechnique ( X ) -Centre National de la Recherche Scientifique ( CNRS ) -Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Unité de Mathématiques Appliquées ( UMA ), École Nationale Supérieure de Techniques Avancées ( Univ. Paris-Saclay, ENSTA ParisTech ) -École Nationale Supérieure de Techniques Avancées ( Univ. Paris-Saclay, ENSTA ParisTech ), Institut de Mathématiques de Bourgogne [Dijon] (IMB), Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université de Bourgogne (UB), Équipe Méthodes et Algorithmes en Commande (LAAS-MAC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Mathematics for Control, Transport and Applications (McTAO), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Centre de Mathématiques Appliquées - Ecole Polytechnique (CMAP), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Control, Optimization, Models, Methods and Applications for Nonlinear Dynamical Systems (Commands), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Université de Bourgogne (UB)-Centre National de la Recherche Scientifique (CNRS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Institut National de la Recherche en Informatique et en Automatique - INRIA (FRANCE), Institut National des Sciences Appliquées de Toulouse - INSA (FRANCE), Université de Bourgogne - UB (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Martinon, Pierre, and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: Optimization, [ MATH.MATH-OC ] Mathematics [math]/Optimization and Control [math.OC], 0209 industrial biotechnology, Mathematical optimization, 010103 numerical & computational mathematics, 02 engineering and technology, Contrast imaging, 01 natural sciences, Nuclear magnetic resonance, Magnetic resonance imaging, 020901 industrial engineering & automation, Software, Maximum principle, Applied mathematics, 0101 mathematics, Geometric programming, Mathematics, business.industry, Numerical analysis, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], Vectors, Optimal control, Calcul parallèle, distribué et partagé, Moment (mathematics), Direct methods, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], business
Abstract: International audience; In this article, the contrast imaging problem in nuclear magnetic resonance is modeled as a Mayer problem in optimal control. A first synthesis of locally optimal solutions is given in the single-input case using geometric methods based on Pontryagin's maximum principle. We then compare these results using direct methods and a moment-based approach, and make a first step towards global optimality. Finally, some preliminary results are given in the bi-input case.
Published: 2013

38. Learning the aircraft mass and thrust to improve the ground-based trajectory prediction of climbing flights

Author: David Gianazza, Nicolas Durand, Richard Alligier, ENAC Equipe MAIAA-OPTIM (MAIA-OPTIM), ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien (MAIAA), Ecole Nationale de l'Aviation Civile (ENAC)-Ecole Nationale de l'Aviation Civile (ENAC), Ecole Nationale de l'Aviation Civile (ENAC), and Ecole Nationale de l'Aviation Civile - ENAC (FRANCE)
Subjects: Engineering, Transportation, Thrust, 02 engineering and technology, Mass Estimation, law.invention, Machine Learning, Acceleration, 0203 mechanical engineering, law, 0502 economics and business, energy rate, aircraft trajectory prediction, Aircraft Trajectory Prediction, Radar, Aerospace engineering, thrust law, Rate of climb, Civil and Structural Engineering, 050210 logistics & transportation, 020301 aerospace & aeronautics, business.industry, 05 social sciences, Air traffic control, mass estimation, Computer Science Applications, Power (physics), Calcul parallèle, distribué et partagé, machine learning, Thrust Law, BADA, Automotive Engineering, Trajectory, Climb, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Energy Rate, business
Abstract: International audience; Ground-based aircraft trajectory prediction is a major concern in air traffic control and management. A safe and efficient prediction is a prerequisite to the implementation of automated tools that detect and solve conflicts between trajectories. This paper focuses on the climb phase, because predictions are much less accurate in this phase than in the cruising phase. Trajectory prediction usually relies on a point-mass model of the forces acting on the aircraft to predict the successive points of the future trajectory. The longitudinal acceleration and climb rate are determined by an equation relating the modeled power of the forces to the kinetic and potential energy rate. Using such a model requires knowledge of the aircraft state (mass, current thrust setting, position, velocity, etc.), atmospheric conditions (wind, temperature) and aircraft intent (thrust law, speed intent). Most of this information is not available to ground-based systems. In this paper, we improve the trajectory prediction accuracy by learning some of the unknown point-mass model parameters from past observations. These unknown parameters, mass and thrust, are adjusted by fitting the modeled specific power to the observed energy rate. The thrust law is learned from historical data, and the mass is estimated on past trajectory points. The adjusted parameters are not meant to be exact, however they are designed so as to improve the energy rate prediction. The performances of the proposed method are compared with the results of standard model-based methods relying on the Eurocontrol Base of Aircraft DAta (BADA), using two months of radar track records and weather data.
Published: 2013
Full Text: View/download PDF

39. Segmentation of dynamic PET images with kinetic spectral clustering

Author: Sandrine Mouysset, Jean-Marc Girault, Irène Buvat, Simon Stute, Hiba Zbib, Sylvie Chalon, Clovis Tauber, Joseph Noailles, Jamal Charara, Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse Capitole (UT Capitole), Université Fédérale Toulouse Midi-Pyrénées, Imagerie et cerveau (iBrain - Inserm U1253 - UNIV Tours ), Université de Tours (UT)-Institut National de la Santé et de la Recherche Médicale (INSERM), Departement of Physics & Electronics (Hadath, Lebanon), National Council for Scientific Research = Conseil national de la recherche scientifique du Liban [Lebanon] (CNRS-L), Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Imagerie et Modélisation en Neurobiologie et Cancérologie (IMNC (UMR_8165)), Université Paris-Sud - Paris 11 (UP11)-Institut National de Physique Nucléaire et de Physique des Particules du CNRS (IN2P3)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), (OATAO), Open Archive Toulouse Archive Ouverte, Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Université de Tours-Institut National de la Santé et de la Recherche Médicale (INSERM), Commissariat à l'Energie Atomique et aux énergies alternatives - CEA (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Institut National de la Santé et de la Recherche Médicale - INSERM (FRANCE), Université de Paris Diderot - Paris 7 (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Centre Hospitalier Régional Universitaire de Tours - CHU Tours (FRANCE), Université de Tours (FRANCE), Université Paris-Sud 11 (FRANCE), Imagerie et Modélisation en Neurobiologie et Cancérologie - IMNC (Orsay, France), and Institut National Polytechnique de Toulouse - INPT (FRANCE)
Subjects: Fluorine Radioisotopes, Correlation clustering, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, Clustering, 030218 nuclear medicine & medical imaging, 03 medical and health sciences, Segmentation, 0302 clinical medicine, Dynamic imaging, Spectral clustering, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Image Processing, Computer-Assisted, Animals, Radiology, Nuclear Medicine and imaging, Computer vision, Positron emission images, Cluster analysis, Image resolution, Mathematics, Radiological and Ultrasound Technology, business.industry, Segmentation-based object categorization, Phantoms, Imaging, Pattern recognition, Real image, Rats, Calcul parallèle, distribué et partagé, Kinetics, PET, ComputingMethodologies_PATTERNRECOGNITION, Pyrimidines, Positron-Emission Tomography, Pyrazoles, Artificial intelligence, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Laplacian matrix, business, Monte Carlo Method, 030217 neurology & neurosurgery, Algorithms
Abstract: Segmentationis often required for the analysis ofdynamicpositron emission tomography (PET)images. However, noise and low spatial resolution make it a difficult task and several supervised and unsupervised methods have been proposed in the literature to perform thesegmentationbased on semi-automaticclusteringof the time activity curves of voxels. In this paper we propose a new method based onspectralclusteringthat does not require any prior information on the shape of clusters in the space in which they are identified. In our approach, the p-dimensional data, where p is the number of time frames, is first mapped into a high dimensional space and thenclusteringis performed in a low-dimensional space of the Laplacian matrix. An estimation of the bounds for the scale parameter involved in thespectralclusteringis derived. The method is assessed usingdynamicbrainPETimagessimulated with GATE and results on realimagesare presented. We demonstrate the usefulness of the method and its superior performance over three otherclusteringmethods from the literature. The proposed approach appears as a promising pre-processing tool before parametric map calculation or ROI-based quantification tasks.
Published: 2013
Full Text: View/download PDF

40. Optimized spectral clustering for segmentation of dynamic PET images

Author: Jean-Marc Girault, Sandrine Mouysset, Laurent Galineau, Clovis Tauber, Irène Buvat, Hiba Zbib, Simon Stute, Sylvie Chalon, Jamal Charara, Lebanese University [Beirut] (LU), Imagerie et cerveau (iBrain - Inserm U1253 - UNIV Tours ), Université de Tours (UT)-Institut National de la Santé et de la Recherche Médicale (INSERM), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Université Toulouse III - Paul Sabatier (UT3), Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Imagerie et Modélisation en Neurobiologie et Cancérologie (IMNC (UMR_8165)), Université Paris-Sud - Paris 11 (UP11)-Institut National de Physique Nucléaire et de Physique des Particules du CNRS (IN2P3)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Commissariat à l'Energie Atomique et aux énergies alternatives - CEA (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Institut National de la Santé et de la Recherche Médicale - INSERM (FRANCE), Lebanese University - LU (LEBANON), Université de Paris Diderot - Paris 7 (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Centre Hospitalier Régional Universitaire de Tours - CHU Tours (FRANCE), Université de Tours (FRANCE), Université Paris-Sud 11 (FRANCE), Imagerie et Cerveau (Tours, France), and Imagerie et Modélisation en Neurobiologie et Cancérologie - IMNC (Orsay, France)
Subjects: Image segmentation, Positron emission tomography, Clustering algorithms, Computer science, business.industry, Segmentation-based object categorization, Probabilistic logic, Pattern recognition, Indexes, Spectral clustering, Weighting, Calcul parallèle, distribué et partagé, Manuals, Segmentation, Computer vision, Artificial intelligence, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, Cluster analysis, Kinetic theory, Noise, Global optimization
Abstract: he quantification of dynamic PET images requires the definition of regions of interest. The manual delineation is a time consuming and unreproducible process due to the poor resolution of PET images. Approaches were proposed in the literature to classify the kinetic profiles of voxels, however, they are generally either sensitive to initial conditions or favor convex shaped clusters. Recently we have proposed a kinetic spectral clustering (KSC) method for segmentation of dynamic PET images that has the advantage of handling clusters with arbitrary shape in the space in which they are identified. However, its use for clinical applications is still hindered by the manual setting of several parameters. In this paper, we propose an extension of KSC to make it automatic (ASC). A new unsupervised clustering criterion is tailored and a global optimization by a probabilistic metaheuristic algorithm is used to select the scale parameter and the weighting factors involved in the method. We validate our approach with GATE Monte Carlo simulations. Results obtained with ASC compare closely with those obtained with optimal manual parameterization of KSC, and outperform those obtained with two other approaches from the literature.
Published: 2013
Full Text: View/download PDF

41. Optimal time control to swing-up the inverted pendulum-cart in open-loop form

Author: Abdelkader Merakeb, Frédéric Messine, Farida Achemine, Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées, Traitement et Compréhension d’Images (IRIT-TCI), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut National Polytechnique de Toulouse - INPT (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: 0209 industrial biotechnology, Double pendulum, Open-loop controller, 02 engineering and technology, Fuzzy control system, Unstable equilibrium, 01 natural sciences, Inverted pendulum, Calcul parallèle, distribué et partagé, Physics::Popular Physics, 020901 industrial engineering & automation, Double inverted pendulum, Control theory, Control system, 0103 physical sciences, Time optimal control, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Bang–bang control, 010301 acoustics, Bang-Bang structure, Inverted Pendulum, Mathematics, Swing-up control
Abstract: National audience; This work deals with simulation on an Inverted Pendulum (IP). The control strategy of an IP is split into two main control phases: (i) swing-up control to bring back the pendulum from the downward position to the upward one, and (ii) upright stabilization control to maintain the pendulum to the upright vertical position. In the case (ii), a feedback or a neuro-fuzzy controller is used to stabilize the pendulum cart, while in the first case (i), a non-linear controller based on the energy of the pendulum is used in order to reach the desired performance with a minimum number of swings. Our contribution is to present a simulation using MatLab of time-optimal control system for swinging-up the pendulum, with a single control law in an open-loop form. From the bang-bang structure of the time-optimal control resulting from the necessary condition of the Pontryagin Maximum Principle, the solution obtained from direct discretization method is adjusted by using Newton based method.
Published: 2013

42. A better alternative to dynamic programming for offline energy optimization in hybrid-electric vehicles

Author: Stephane Caux, Sandra Ulrich Ngueveu, Mouloud Guemri, Frédéric Messine, LAboratoire PLasma et Conversion d'Energie (LAPLACE), Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées, Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes (LAAS-ROC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse 1 Capitole (UT1), COmmande et DIAgnostic des Systèmes Electriques (LAPLACE-CODIASE), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse III - Paul Sabatier (UT3), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse 1 Capitole (UT1)-Université Toulouse - Jean Jaurès (UT2J)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse 1 Capitole (UT1)-Université Toulouse - Jean Jaurès (UT2J), Université Toulouse 1 Capitole (UT1)-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), and Institut National Polytechnique de Toulouse - INPT (FRANCE)
Subjects: 0209 industrial biotechnology, Engineering, Mathematical optimization, Lower bound, business.industry, Energy management, 020208 electrical & electronic engineering, 02 engineering and technology, Energy minimization, 7. Clean energy, Upper and lower bounds, Electronic mail, Dynamic programming, Calcul parallèle, distribué et partagé, 020901 industrial engineering & automation, Hybrid-electric vehicles, 0202 electrical engineering, electronic engineering, information engineering, Fuel efficiency, Heuristics, Global optimization, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business
Abstract: International audience; This article focusses on the well-known problem of energy management for hybrid-electric vehicles. Although researches on this problem have recently intensified. Dynamic programming (DP) is still considered as the reference method because it obtains the best solutions of the literature so far, even though it requires a significant computational time. This article however, describes two heuristic-global-optimization-based algorithms that not only require less computational time than DP, but also produce better solutions, with significantly lower fuel consumption cost.
Published: 2013
Full Text: View/download PDF

43. On the Easy Use of Scientific Computing Services for Large Scale Linear Algebra and Parallel Decision Making with the P-Grade Portal

Author: Ronan Guivarch, Michel Daydé, Hrachya Astsatryan, Harutyun Terzyan, Levon Hovhannisyan, Yuri Shoukouryan, Vladimir Sahakyan, Aurélie Hurault, Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), National Academy of Sciences of the Republic of Armenia (ARMENIA), State Engineering University of Armenia - SEUA (ARMENIA), Institute for Informatics and Automation Problems, NAS of Armenia, Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Institut National Polytechnique (Toulouse) (Toulouse INP), Assistance à la Certification d’Applications DIstribuées et Embarquées (IRIT-ACADIE), Institut de recherche en informatique de Toulouse ( IRIT ), Institut National Polytechnique [Toulouse] ( INP ) -Université Toulouse 1 Capitole ( UT1 ) -Université Toulouse 2 ( UT2 ) -Université Paul Sabatier - Toulouse 3 ( UPS ) -Centre National de la Recherche Scientifique ( CNRS ), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UPS (FRANCE), Institute for Informatics and Automation Problems - IIAP (Yerevan, Armenie), and Institut de Recherche en Informatique de Toulouse - IRIT (Toulouse, France)
Subjects: Computer Networks and Communications, Iterative method, Computer science, Interface (computing), Distributed computing, Parallel Decision Making, Cloud computing, 010103 numerical & computational mathematics, 02 engineering and technology, computer.software_genre, 01 natural sciences, Computational science, [ INFO.INFO-DC ] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, Advanced Trading, Block (data storage), Sparse Linear Algebra Solvers, business.industry, P-grade Portal, Grid, Calcul parallèle, distribué et partagé, Grid computing, Hardware and Architecture, Linear algebra, 020201 artificial intelligence & image processing, Single sign-on, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, computer, Software, Information Systems
Abstract: International audience; Scientific research is becoming increasingly dependent on the large-scale analysis of data using distributed computing infrastructures (Grid, cloud, GPU, etc.). Scientific computing (Petitet et al. 1999) aims at constructing mathematical models and numerical solution techniques for solving problems arising in science and engineering. In this paper, we describe the services of an integrated portal based on the P-Grade (Parallel Grid Run-time and Application Development Environment) portal (http://www.p-grade.hu) that enables the solution of large-scale linear systems of equations using direct solvers, makes easier the use of parallel block iterative algorithm and provides an interface for parallel decision making algorithms. The ultimate goal is to develop a single sign on integrated multi-service environment providing an easy access to different kind of mathematical calculations and algorithms to be performed on hybrid distributed computing infrastructures combining the benefits of large clusters, Grid or cloud, when needed.
Published: 2013
Full Text: View/download PDF

44. Optimization of the control of a doubly fed induction machine

Author: Maria Pietrzak David, Jules Gillet, Frédéric Messine, LAboratoire PLasma et Conversion d'Energie (LAPLACE), Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées, Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), and Institut National Polytechnique de Toulouse - INPT (FRANCE)
Subjects: Optimization, Engineering, Control (management), 02 engineering and technology, 01 natural sciences, Control theory, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, MATLAB, computer.programming_language, Machine control, Direct shooting method, 010302 applied physics, Ideal 3 phases voltage inverter, business.industry, 020208 electrical & electronic engineering, Open-loop controller, Control engineering, Solver, Optimal control, Energetic efficiency, Copper loss, Open loop static V/f control, Calcul parallèle, distribué et partagé, Doubly fed induction machine (DFIM), Control system, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, computer
Abstract: National audience; This paper focuses on finding an optimal control for a doubly fed induction machine (DFIM) in motor mode. Our purpose is not to improve the quality of the DFIM functioning but to find a method to improve it. Thus we will start with a fixed system made by a DFIM and two ideal 3 phases voltage inverter with an open loop static V/f control. A method will demonstrate its efficiency to improve that control for the copper loss. This method is based on direct shooting techniques associated with a MATLAB optimization solver:fmincon.
Published: 2013
Full Text: View/download PDF

45. Simultaneous analysis of large INTEGRAL/SPI datasets: optimizing the computation of the solution and its variance using sparse matrix algorithms

Author: Bouchet, L., Amestoy, P., Buttari, A., Rouet, F. -H., Chauvin, M., Institut de recherche en astrophysique et planétologie (IRAP), Institut national des sciences de l'Univers (INSU - CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Observatoire Midi-Pyrénées (OMP), Météo France-Centre National d'Études Spatiales [Toulouse] (CNES)-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Météo France-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Centre National de la Recherche Scientifique (CNRS), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Lawrence Berkeley National Laboratory [Berkeley] (LBNL), Centre National d'Études Spatiales - CNES (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Institut de Recherche pour le Développement - IRD (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Météo France (FRANCE), University of California - UC Berkeley (USA), Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire Midi-Pyrénées (OMP), Institut de Recherche pour le Développement (IRD)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Météo-France -Institut de Recherche pour le Développement (IRD)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Météo-France -Centre National de la Recherche Scientifique (CNRS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: Techniques: Miscellaneous, General [Gamma-Rays], Imaging Spectroscopy [Techniques], Gamma-Rays: General, FOS: Physical sciences, Miscellaneous [Techniques], Data Analysis [Methods], Techniques: Imaging Spectroscopy, Calcul parallèle, distribué et partagé, Methods: Data Analysis, Methods: Numerical, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Astrophysics - Instrumentation and Methods for Astrophysics, Instrumentation and Methods for Astrophysics (astro-ph.IM), Numerical [Methods]
Abstract: Nowadays, analyzing and reducing the ever larger astronomical datasets is becoming a crucial challenge, especially for long cumulated observation times. The INTEGRAL/SPI X-gamma-ray spectrometer is an instrument for which it is essential to process many exposures at the same time in order to increase the low signal-to-noise ratio of the weakest sources. In this context, the conventional methods for data reduction are inefficient and sometimes not feasible at all. Processing several years of data simultaneously requires computing not only the solution of a large system of equations, but also the associated uncertainties. We aim at reducing the computation time and the memory usage. Since the SPI transfer function is sparse, we have used some popular methods for the solution of large sparse linear systems; we briefly review these methods. We use the Multifrontal Massively Parallel Solver (MUMPS) to compute the solution of the system of equations. We also need to compute the variance of the solution, which amounts to computing selected entries of the inverse of the sparse matrix corresponding to our linear system. This can be achieved through one of the latest features of the MUMPS software that has been partly motivated by this work. In this paper we provide a brief presentation of this feature and evaluate its effectiveness on astrophysical problems requiring the processing of large datasets simultaneously, such as the study of the entire emission of the Galaxy. We used these algorithms to solve the large sparse systems arising from SPI data processing and to obtain both their solutions and the associated variances. In conclusion, thanks to these newly developed tools, processing large datasets arising from SPI is now feasible with both a reasonable execution time and a low memory usage., 13 pages, 5 figures
Published: 2013
Full Text: View/download PDF

46. Similarity Detection for Free-Form Parametric Models

Author: Dang, Quoc Viet, Mouysset, Sandrine, Morin, Géraldine, Skala, Václav, Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Visual Objects from Reality To Expression (IRIT-VORTEX), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, and Algorithmes Parallèles et Optimisation (IRIT-APO)
Subjects: Parametric surfaces, parametrické plochy, similarity detection, Similarity detection, Isometry, isometrie, Calcul parallèle, distribué et partagé, parametric surfaces, isometry, Spectral clustering, detekce podobnosti, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], shlukování, clustering
Abstract: International audience; In this article, we propose a framework for detecting local similarities in free-form parametric models, in particular on B-Splines or NURBS based B-reps: patches similar up to an approximated isometry are identified. Many recent articles have tackled similarity detection on 3D objects, in particular on 3D meshes. The parametric B-splines, or NURBS models are standard in the CAD (Computer Aided Design) industry, and similarity detection opens the door to interesting applications in this domain, such as model editing, objects comparison or efficient coding. Our contributions are twofold: we adapt the current technique called votes transformation space for parametric surfaces and we improve the identification of isometries. First, an orientation technique independent of the parameterization permits to identify direct versus indirect transformations. Second, the validation step is generalized to extend to the whole B-rep. Then, by classifying the isometries according to their fixed points, we simplify the clustering step. We also apply an unsupervised spectral clustering method which improves the results but also automatically estimates the number of clusters.
Published: 2013

47. Preventing Premature Convergence and Proving the Optimality in Evolutionary Algorithms

Author: Jean-Baptiste Gotteland, Jean-Marc Alliot, Charlie Vanaret, Nicolas Durand, Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Nationale de l'Aviation Civile - ENAC (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Institut de Recherche en Informatique de Toulouse - IRIT (Toulouse, France), ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien (MAIAA), Ecole Nationale de l'Aviation Civile (ENAC), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: Mathematical optimization, 021103 operations research, Branch and bound, 0211 other engineering and technologies, Evolutionary algorithm, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Hybrid algorithm, Numeric Computing, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Maxima and minima, Calcul parallèle, distribué et partagé, Local optimum, Differential evolution, 0202 electrical engineering, electronic engineering, information engineering, Benchmark (computing), 020201 artificial intelligence & image processing, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Mathematics, Premature convergence
Abstract: http://ea2013.inria.fr//proceedings.pdf; International audience; Evolutionary Algorithms (EA) usually carry out an efficient exploration of the search-space, but get often trapped in local minima and do not prove the optimality of the solution. Interval-based techniques, on the other hand, yield a numerical proof of optimality of the solution. However, they may fail to converge within a reasonable time due to their inability to quickly compute a good approximation of the global minimum and their exponential complexity. The contribution of this paper is a hybrid algorithm called Charibde in which a particular EA, Differential Evolution, cooperates with a Branch and Bound algorithm endowed with interval propagation techniques. It prevents premature convergence toward local optima and outperforms both deterministic and stochastic existing approaches. We demonstrate its efficiency on a benchmark of highly multimodal problems, for which we provide previously unknown global minima and certification of optimality.
Published: 2013

48. Statistical prediction of aircraft trajectory : regression methods vs point-mass model

Author: Ghasemi Hamed, Mohammad, Gianazza, David, Serrurier, Mathieu, Durand, Nicolas, Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Nationale de l'Aviation Civile - ENAC (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), ENAC Equipe MAIAA-OPTIM (MAIA-OPTIM), ENAC - Laboratoire de Mathématiques Appliquées, Informatique et Automatique pour l'Aérien (MAIAA), Ecole Nationale de l'Aviation Civile (ENAC)-Ecole Nationale de l'Aviation Civile (ENAC), Ecole Nationale de l'Aviation Civile (ENAC), Algorithmes Parallèles et Optimisation (IRIT-APO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, and Argumentation, Décision, Raisonnement, Incertitude et Apprentissage (IRIT-ADRIA)
Subjects: Calcul parallèle, distribué et partagé, point-mass model, BADA, linear regression, aircraft trajectory prediction, Point-mass model, Loess, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Linear regression, neural networks, Aircraft trajectory prediction, Neural networks
Abstract: International audience; Ground-based aircraft trajectory prediction is a critical issue for air traffic management. A safe and efficient prediction is a prerequisite for the implementation of automated tools that detect and solve conflicts between trajectories. Moreover, regarding the safety constraints, it could be more reasonable to predict intervals rather than precise aircraft positions . In this paper, a standard point-mass model and statistical regression method is used to predict the altitude of climbing aircraft. In addition to the standard linear regression model, two common non-linear regression methods, neural networks and Loess are used. A dataset is extracted from two months of radar and meteorological recordings, and several potential explanatory variables are computed for every sampled climb segment. A Principal Component Analysis allows us to reduce the dimensionality of the problems, using only a subset of principal components as input to the regression methods. The prediction models are scored by performing a 10-fold cross-validation. Statistical regression results method appears promising. The experiment part shows that the proposed regression models are much more efficient than the standard point-mass model. The prediction intervals obtained by our methods have the advantage of being more reliable and narrower than those found by point-mass model.
Published: 2013

49. Ground-based Estimation of Aircraft Mass, Adaptive vs. Least Squares Method

Author: Alligier, Richard, Gianazza, David, Durand, Nicolas, Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Nationale de l'Aviation Civile - ENAC (FRANCE), Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), and Institut National Polytechnique de Toulouse - INPT (FRANCE)
Subjects: Calcul parallèle, distribué et partagé, Least squares, Aircraft trajectory prediction, Mass estimation
Abstract: Ground-based aircraft trajectory prediction is a major concern in air traffic control and management. A safe and efficient prediction is a prerequisite to the implementation of automated tools that detect and solve conflicts between trajectories. This paper focuses on the climb phase, because predictions are much less accurate in this phase than in the cruising phase. Trajectory prediction usually relies on a point-mass model of the forces acting on the aircraft to predict the successive points of the future trajectory. The longitudinal acceleration and climb rate are determined by an equation relating the modeled power of the forces to the kinetic and potential energy rate. Using such a model requires knowledge of the aircraft state (mass, current thrust setting, position, velocity, etc.), atmospheric conditions (wind, temperature) and aircraft intent (thrust law, speed intent). Most of this information is not available to ground-based systems. In this paper, we improve the trajectory prediction accuracy by learning an unknown point-mass model parameter from past observations. This unknown parameter, the mass, is adjusted by fitting the modeled specific power to the observed energy rate. Two methods addressing this issue has been recently published. In this paper, we describe an improvement of the mass estimation method presented in one of them. Using a set of trajectories, the robustness of the two methods is compared by adding a noise on the observed variables.
Published: 2013

50. Towards exascale with the ANR / JST japanese-french project FP3C (Framework and Programming for Post- Petascale Computing)

Author: Antoniu, Gabriel, Boku, Taisuke, Calvin, Christophe, Codognet, Philippe, Daydé, Michel, Emad, Nahid, Ishikawa, Yuyaka, Matsuoka, Satoshi, Nakajima, Kengo, Nakashima, Hiroshi, Namyst, Raymond, Petiton, Serge, Sakurai, Tetsuya, Sato, Mitsuhisa, Commissariat à l'Energie Atomique et aux énergies alternatives - CEA (FRANCE), Centre National de la Recherche Scientifique - CNRS (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Institut National de la Recherche en Informatique et en Automatique - INRIA (FRANCE), Université Pierre et Marie Curie, Paris 6 - UPMC (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Université de Versailles Saint-Quentin-en-Yvelines -UVSQ (FRANCE), Keio University (JAPAN), Kyoto University (JAPAN), National Institute of Informatics - NII (JAPAN), Tokyo Institute of Technology - Tokyo Tech (JAPAN), University of Tokyo (JAPAN), University of Tsukuba (JAPAN), Université Paris-Sud 11 (FRANCE), Japanese French Laboratory for Informatics (Tokyo, Japon), Laboratoire Bordelais de Recherche en Informatique - LaBRI (Bordeaux, France), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
Subjects: Calcul parallèle, distribué et partagé, Runtime system, Exascale computing, Many-core processors, Numerical algorithms- Parallel programming languages, GPU
Abstract: The Japanese-french project FP3C targets the post-petascale and the next generation of exascale systems. Its goal is to study the software technologies, languages and programming models to achieve the performance promised by post-petascale computing. The project consortium regroups some of the HPC key players in Japan and in France: * Universities of Kyoto, Tokyo and Tsukuba, Tokyo Institute of Technology, Japanese- French Laboratory on Informatics * CEA Saclay, CNRS (IRIT and PRISM), INRIA (Bordeaux, Rennes and Saclay), with a strong connection with RIKEN AICS at Kobe in Japan. The ability to efficiently program and exploit these future high performance systems is considered as a strategical issue by all research national agencies worldwide. The exascale computers are expected to a large-scale highly hierarchical architecture with many-core processsors possibly mixed with accelerators with up to millions of cores and threads. As a consequence, existing operating and runtime systems, languages, programming paradigms and parallel algorithms would have, at best, to be adapted, and may become often obsolete. Exploiting these ultra large-scale parallelsystems will require runtime systems allowing the management of huge amount of distributed data, minimizing the energy consumption, and exhibiting fault resilient properties. In addition to these features, accelerating technology, based on GPGPU and many-core processors, are also crucial issues for post-petascale computing systems. Efficient exploitation (programing, execution) of large scale systems is an important challenge. The hierarchical nature of these architecture and the scalability issues (parallelization at different level: intra / inter computational nodes composed of many core processors and/or accelerators) complexifies the algorithm design. Existing programming framework and runtime systems together with new approaches should be examined, experimented andevaluated. Benchmarks and libraries adapted to the post-petascale systems will have to be proposed. The FP3C project aims at defining a framework for high performance computing on the road to exascale. We cover most of the issues related to the emergence of post- petascale computing: from high level languages to efficient exploitation of the underlying architecture at the runtime level or using specific extensions for accelerators. Our approach is illustrated with experiments on a set of numerical codes (including numerical libraries) that can be seen as a benchmark. One of the goal of the project is to proceed to experiments on some of the most recent computers available in Europe (e.g. CURIE Computer at TGCC/France) and in Japan (e.g. K Computer at Kobe).
Published: 2013

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

Select search scope, currently: Articles Catalog books, media & more in Jio Institute collections Articles journal articles & other e-resources

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Journal

Database

Publisher

57 results on '"Calcul parallèle, distribué et partagé"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources