École doctorale de Mathématiques et Informatique (Bordeaux)
Overview
Works:  318 works in 319 publications in 2 languages and 466 library holdings 

Roles:  996, Editor, Degree grantor 
Classifications:  QA37.2, 510 
Publication Timeline
.
Most widely held works by
École doctorale de Mathématiques et Informatique (Bordeaux)
Leçons de mathématiques d'aujourd'hui by
JeanPierre Kahane(
Book
)
2 editions published between 2007 and 2012 in French and held by 100 WorldCat member libraries worldwide
2 editions published between 2007 and 2012 in French and held by 100 WorldCat member libraries worldwide
Leçons de mathématiques d'aujourd'hui(
Book
)
1 edition published in 2010 in French and held by 49 WorldCat member libraries worldwide
1 edition published in 2010 in French and held by 49 WorldCat member libraries worldwide
Conception et analyse de schémas d'ordre très élevé distribuant le résidu application à la mécanique des fluides by
Adam Larat(
)
1 edition published in 2009 in French and held by 2 WorldCat member libraries worldwide
La simulation numérique est aujourd'hui un outils majeur dans la conception des objets aérodynamiques, que ce soit dans l'aéronautique, l'automobile, l'industrie navale, etc... Un des défis majeurs pour repousser les limites des codes de simulation est d'améliorer leur précision, tout en utilisant une quantité fixe de ressources (puissance et/ou temps de calcul). Cet objectif peut être atteint par deux approches différentes, soit en construisant une discrétisation fournissant sur un maillage donné une solution d'ordre très élevé, soit en construisant un schéma compact et massivement parallèlisable, de manière à minimiser le temps de calcul en distribuant le problème sur un grand nombre de processeurs. Dans cette thèse, nous tentons de rassembler ces deux approches par le développement et l'implémentation de Schéma Distribuant le Résidu (RDS) d'ordre très élevé et de compacité maximale. Ce manuscrit commence par un rappel des principaux résultats mathématiques concernant les Lois de Conservation hyperboliques (CLs). Le but de cette première partie est de mettre en évidence les propriétés des solutions analytiques que nous cherchons à approcher, de manière à injecter ces propriétés dans celles de la solution discrète recherchée. Nous décrivons ensuite les trois étapes principales de la construction d'un schéma RD d'ordre très élevé :  la représentation polynomiale d'ordre très élevé de la solution sur des polygones et des polyèdres;  la description de méthodes distribuant le résidu de faible ordre, compactes et conservatives, consistantes avec une représentation polynomiale des données de très haut degré. Parmi elles, une attention particulière est donnée à la plus simple, issue d'une généralisation du schéma de LaxFriedrichs (\LxF);  la mise en place d'une procédure préservant la positivité qui transforme tout schéma stable et linéaire, en un schéma non linéaire d'ordre très élevé, capturant les chocs de manière non oscillante. Dans le manuscrit, nous montrons que les schémas obtenus par cette procédure sont consistants avec la CL considérée, qu'ils sont stables en norme $\L^{\infty}$ et qu'ils ont la bonne erreur de troncature. Même si tous ces développements théoriques ne sont démontrés que dans le cas de CLs scalaires, des remarques au sujet des problèmes vectoriels sont faites dès que cela est possible. Malheureusement, lorsqu'on considère le schéma \LxF, le problème algébrique non linéaire associé à la recherche de la solution stationnaire est en général mal posé. En particulier, on observe l'apparition de modes parasites de haute fréquence dans les régions de faible gradient. Ceuxci sont éliminés grâce à un terme supplémentaire de stabilisation dont les effets et l'évaluation numérique sont précisément détaillés. Enfin, nous nous intéressons à une discrétisation correcte des conditions limites pour le schéma d'ordre élevé proposé. Cette théorie est ensuite illustrée sur des cas test scalaires bidimensionnels simples. Afin de montrer la généralité de notre approche, des maillages composés uniquement de triangles et des maillages hybrides, composés de triangles et de quandrangles, sont utilisés. Les résultats obtenus par ces tests confirment ce qui est attendu par la théorie et mettent en avant certains avantages des maillages hybrides. Nous considérons ensuite des solutions bidimensionnelles des équations d'Euler de la dynamique des gaz. Les résultats sont assez bons, mais on perd les pentes de convergence attendues dès que des conditions limite de paroi sont utilisées. Ce problème nécessite encore d'être étudié. Nous présentons alors l'implémentation parallèle du schéma. Celleci est analysée et illustrée à travers des cas test tridimensionnel de grande taille
1 edition published in 2009 in French and held by 2 WorldCat member libraries worldwide
La simulation numérique est aujourd'hui un outils majeur dans la conception des objets aérodynamiques, que ce soit dans l'aéronautique, l'automobile, l'industrie navale, etc... Un des défis majeurs pour repousser les limites des codes de simulation est d'améliorer leur précision, tout en utilisant une quantité fixe de ressources (puissance et/ou temps de calcul). Cet objectif peut être atteint par deux approches différentes, soit en construisant une discrétisation fournissant sur un maillage donné une solution d'ordre très élevé, soit en construisant un schéma compact et massivement parallèlisable, de manière à minimiser le temps de calcul en distribuant le problème sur un grand nombre de processeurs. Dans cette thèse, nous tentons de rassembler ces deux approches par le développement et l'implémentation de Schéma Distribuant le Résidu (RDS) d'ordre très élevé et de compacité maximale. Ce manuscrit commence par un rappel des principaux résultats mathématiques concernant les Lois de Conservation hyperboliques (CLs). Le but de cette première partie est de mettre en évidence les propriétés des solutions analytiques que nous cherchons à approcher, de manière à injecter ces propriétés dans celles de la solution discrète recherchée. Nous décrivons ensuite les trois étapes principales de la construction d'un schéma RD d'ordre très élevé :  la représentation polynomiale d'ordre très élevé de la solution sur des polygones et des polyèdres;  la description de méthodes distribuant le résidu de faible ordre, compactes et conservatives, consistantes avec une représentation polynomiale des données de très haut degré. Parmi elles, une attention particulière est donnée à la plus simple, issue d'une généralisation du schéma de LaxFriedrichs (\LxF);  la mise en place d'une procédure préservant la positivité qui transforme tout schéma stable et linéaire, en un schéma non linéaire d'ordre très élevé, capturant les chocs de manière non oscillante. Dans le manuscrit, nous montrons que les schémas obtenus par cette procédure sont consistants avec la CL considérée, qu'ils sont stables en norme $\L^{\infty}$ et qu'ils ont la bonne erreur de troncature. Même si tous ces développements théoriques ne sont démontrés que dans le cas de CLs scalaires, des remarques au sujet des problèmes vectoriels sont faites dès que cela est possible. Malheureusement, lorsqu'on considère le schéma \LxF, le problème algébrique non linéaire associé à la recherche de la solution stationnaire est en général mal posé. En particulier, on observe l'apparition de modes parasites de haute fréquence dans les régions de faible gradient. Ceuxci sont éliminés grâce à un terme supplémentaire de stabilisation dont les effets et l'évaluation numérique sont précisément détaillés. Enfin, nous nous intéressons à une discrétisation correcte des conditions limites pour le schéma d'ordre élevé proposé. Cette théorie est ensuite illustrée sur des cas test scalaires bidimensionnels simples. Afin de montrer la généralité de notre approche, des maillages composés uniquement de triangles et des maillages hybrides, composés de triangles et de quandrangles, sont utilisés. Les résultats obtenus par ces tests confirment ce qui est attendu par la théorie et mettent en avant certains avantages des maillages hybrides. Nous considérons ensuite des solutions bidimensionnelles des équations d'Euler de la dynamique des gaz. Les résultats sont assez bons, mais on perd les pentes de convergence attendues dès que des conditions limite de paroi sont utilisées. Ce problème nécessite encore d'être étudié. Nous présentons alors l'implémentation parallèle du schéma. Celleci est analysée et illustrée à travers des cas test tridimensionnel de grande taille
Polynominalité des coefficients de structures des algèbres de doublesclasses by
Omar Tout(
)
1 edition published in 2014 in French and held by 1 WorldCat member library worldwide
In this thesis we studied the structure coefficients and especially their dependence on n in the case of a sequence of doubleclass algebras. The first chapter is dedicated to the study of the structure coefficients in the general cases of centers of group algebras and doubleclass algebras. We recall in it the representation theory of finite groups and its link with structure coefficients. We show also that the study of the structure coefficients of doubleclass algebras is related to the theory of Gelfand pairs and zonal spherical functions by giving, in the case of Gelfand pairs, a theorem similar to that of Frobenius which writes the structure coefficients of the doubleclass algebra associated to a Gelfand pair in terms of zonal spherical functions. In the second chapter, we recall the Farahat and Higman's theorem about the polynomiality of the structure coefficients of the center of the symmetric group algebra as well as the Ivanov and Kerov's approach to prove this theorem. We give a combinatorial proof to the polynomiality property of the structure coefficients of the Hecke algebra of thepair (S2n, Bn) in the third chapter. Our proof uses a universal algebra which projects on the Hecke algebra of (S2n, Bn) for each n. We show that this universal algebra is isomorphic to the algebra of 2shifted symmetric functions. In the fourth and last chapter we build a general framework which gives us the form of the structure coefficients in the case of a sequence of doubleclass algebras. This framework implies the polynomiality property of the structure coefficients of both the center of the symmetric group algebra and the Hecke algebra of (S2n, Bn). In addition, we give a polynomiality property for the structure coefficients of both the center of the hyperoctahedral group algebra and the doubleclass algebra of diag (Sn1) in Sn x Sopp n1
1 edition published in 2014 in French and held by 1 WorldCat member library worldwide
In this thesis we studied the structure coefficients and especially their dependence on n in the case of a sequence of doubleclass algebras. The first chapter is dedicated to the study of the structure coefficients in the general cases of centers of group algebras and doubleclass algebras. We recall in it the representation theory of finite groups and its link with structure coefficients. We show also that the study of the structure coefficients of doubleclass algebras is related to the theory of Gelfand pairs and zonal spherical functions by giving, in the case of Gelfand pairs, a theorem similar to that of Frobenius which writes the structure coefficients of the doubleclass algebra associated to a Gelfand pair in terms of zonal spherical functions. In the second chapter, we recall the Farahat and Higman's theorem about the polynomiality of the structure coefficients of the center of the symmetric group algebra as well as the Ivanov and Kerov's approach to prove this theorem. We give a combinatorial proof to the polynomiality property of the structure coefficients of the Hecke algebra of thepair (S2n, Bn) in the third chapter. Our proof uses a universal algebra which projects on the Hecke algebra of (S2n, Bn) for each n. We show that this universal algebra is isomorphic to the algebra of 2shifted symmetric functions. In the fourth and last chapter we build a general framework which gives us the form of the structure coefficients in the case of a sequence of doubleclass algebras. This framework implies the polynomiality property of the structure coefficients of both the center of the symmetric group algebra and the Hecke algebra of (S2n, Bn). In addition, we give a polynomiality property for the structure coefficients of both the center of the hyperoctahedral group algebra and the doubleclass algebra of diag (Sn1) in Sn x Sopp n1
Analysis, structure and organization of complex networks by
Faraz Zaidi(
)
1 edition published in 2010 in English and held by 1 WorldCat member library worldwide
La Science des réseaux est apparue comme un domaine d'étude fondamental pour modéliser un grand nombre de systèmes synthétiques ou du monde réel.La découverte du graphe petit monde et du graphe sans échelle dans ces réseaux a révolutionné la façon d'étudier, d'analyser, de modéliser et de traiter ces réseaux. Dans cette thèse, nous nous intéressons à l'étude des réseaux ayant ces propriétés et souvent qualifiés de réseaux complexes.A notre avis, les recherches menées dans ce domaine peuvent être regroupées en quatre catégories: l'analyse, la structure, le processus/organisation et la visualisation.Nous abordons des problèmes relatifs à chacune de ces catégories tout au long de cette thèse. (...)
1 edition published in 2010 in English and held by 1 WorldCat member library worldwide
La Science des réseaux est apparue comme un domaine d'étude fondamental pour modéliser un grand nombre de systèmes synthétiques ou du monde réel.La découverte du graphe petit monde et du graphe sans échelle dans ces réseaux a révolutionné la façon d'étudier, d'analyser, de modéliser et de traiter ces réseaux. Dans cette thèse, nous nous intéressons à l'étude des réseaux ayant ces propriétés et souvent qualifiés de réseaux complexes.A notre avis, les recherches menées dans ce domaine peuvent être regroupées en quatre catégories: l'analyse, la structure, le processus/organisation et la visualisation.Nous abordons des problèmes relatifs à chacune de ces catégories tout au long de cette thèse. (...)
Contrôle de la dynamique de la leucémie myéloïde chronique par Imatinib by
Chahrazed Benosman(
)
1 edition published in 2010 in French and held by 1 WorldCat member library worldwide
Modelling hematopoiesis represents a feature of our research. Hematopoietic stem cells (HSC) are undifferentiated cells, located in bone marrow, with unique abilities of selfrenewal and differentiation (production of white cells, red blood cells and platelets).The process of hematopoiesis often exhibits abnormalities causing hematological diseases. In modelling Chronic Myeloid Leukemia (CML), a frequent hematological disease, we represent hematopoiesis of normal and leukemic cells by means of ordinary differential equations (ODE). Homeostasis of normal and leukemic cells are supposed to be different and depend on some lines of normal and leukemic HSC. We analyze the global dynamics of the model to obtain the conditions for regeneration of hematopoiesis and persistence of CML. We prove as well that normal and leukemic cells can not coexist for a long time. Imatinib is the main treatment of CML, with posology varying from 400 to 1000 mg per day. Some affected individuals respond to therapy with various levels being hematologic, cytogenetic and molecular. Therapy fails in two cases: the patient takes a long time to react, then suboptimal response occurs; or the patient resists after an initial response. Determining the optimal dosage required to reduce leukemic cells is another challenge. We approach therapy effects as an optimal control problem to minimize the cost of treatment and the level of leukemic cells. Suboptimal response, resistance and recovery forms are obtained through the influence of imatinib onto the division and mortality rates of leukemic cells. Hematopoiesis can be investigated according to age of cells. An agestructured system, describing the evolution of normal and leukemic HSC shows that the division rate of leukemic HSC plays a crucial role when determining the optimal control. When controlling the growth of cells under interspecific competition within normal and leukemic HSC, we prove that optimal dosage is related to homeostasis of leukemic HSC
1 edition published in 2010 in French and held by 1 WorldCat member library worldwide
Modelling hematopoiesis represents a feature of our research. Hematopoietic stem cells (HSC) are undifferentiated cells, located in bone marrow, with unique abilities of selfrenewal and differentiation (production of white cells, red blood cells and platelets).The process of hematopoiesis often exhibits abnormalities causing hematological diseases. In modelling Chronic Myeloid Leukemia (CML), a frequent hematological disease, we represent hematopoiesis of normal and leukemic cells by means of ordinary differential equations (ODE). Homeostasis of normal and leukemic cells are supposed to be different and depend on some lines of normal and leukemic HSC. We analyze the global dynamics of the model to obtain the conditions for regeneration of hematopoiesis and persistence of CML. We prove as well that normal and leukemic cells can not coexist for a long time. Imatinib is the main treatment of CML, with posology varying from 400 to 1000 mg per day. Some affected individuals respond to therapy with various levels being hematologic, cytogenetic and molecular. Therapy fails in two cases: the patient takes a long time to react, then suboptimal response occurs; or the patient resists after an initial response. Determining the optimal dosage required to reduce leukemic cells is another challenge. We approach therapy effects as an optimal control problem to minimize the cost of treatment and the level of leukemic cells. Suboptimal response, resistance and recovery forms are obtained through the influence of imatinib onto the division and mortality rates of leukemic cells. Hematopoiesis can be investigated according to age of cells. An agestructured system, describing the evolution of normal and leukemic HSC shows that the division rate of leukemic HSC plays a crucial role when determining the optimal control. When controlling the growth of cells under interspecific competition within normal and leukemic HSC, we prove that optimal dosage is related to homeostasis of leukemic HSC
Approximation numérique sur maillage cartésien de lois de conservation écoulements compressibles et élasticité non linéaire by
Yannick Gorsse(
)
1 edition published in 2012 in French and held by 1 WorldCat member library worldwide
We are interested in numerical simulation of compressible flows with interfaces. Theses interfaces can separatea fluid and a rigid solid, two fluids with differents constitutive law, or a fluid and an elastic solid. First, we havedevelopped an immersed boundary method to impose precisely a non penetration condition at the border of anobstacle. Then, a sharp interface method for compressible multimaterials have been studied and validated. Theimmersed boundary method of the first part is applied in this context
1 edition published in 2012 in French and held by 1 WorldCat member library worldwide
We are interested in numerical simulation of compressible flows with interfaces. Theses interfaces can separatea fluid and a rigid solid, two fluids with differents constitutive law, or a fluid and an elastic solid. First, we havedevelopped an immersed boundary method to impose precisely a non penetration condition at the border of anobstacle. Then, a sharp interface method for compressible multimaterials have been studied and validated. Theimmersed boundary method of the first part is applied in this context
Contribution à la modélisation de l'écoulement dans un compresseur centrifuge et développement de critères d'optimisation by
Paul Le Sausse(
)
1 edition published in 2014 in French and held by 1 WorldCat member library worldwide
This thesis is the result of a partnership between the company Johnson Controls and the university Bordeaux1. The objective is part of a project to develop innovative heat pump and involves the design of a high head centrifugal compressor. To do this, a numerical model is created to simulate the flow in this kind of compressor. To observe industriel deadlines, a first geometry was established by iterative changes of various parameters in analysing induced effiencies. The flow was then studied further, especially to better understand the onset of flow separation. Finally, a study of unsteady flow in the diffuser was performed. Beyond the physical phenomena investigated and comprehended during this process, it is firstly a methodology that values this work
1 edition published in 2014 in French and held by 1 WorldCat member library worldwide
This thesis is the result of a partnership between the company Johnson Controls and the university Bordeaux1. The objective is part of a project to develop innovative heat pump and involves the design of a high head centrifugal compressor. To do this, a numerical model is created to simulate the flow in this kind of compressor. To observe industriel deadlines, a first geometry was established by iterative changes of various parameters in analysing induced effiencies. The flow was then studied further, especially to better understand the onset of flow separation. Finally, a study of unsteady flow in the diffuser was performed. Beyond the physical phenomena investigated and comprehended during this process, it is firstly a methodology that values this work
Securing wireless sensor and vehicular networks by
Wafa Ben Jaballah(
)
1 edition published in 2014 in English and held by 1 WorldCat member library worldwide
Wireless sensor and vehicular networks play an important role in critical military and civil applications, and pervade our daily life. However, security concerns constitute a potential stumbling block to the impeding wide deployment of sensor networks and vehicular communications. This dissertation studies communication security for Wireless Sensor Networks (WSNs), and vehicular communication. To this aim, we address four important aspects. The first study addresses broadcast authentication in WSNs. We focus on key disclosure based schemes. We demonstrate that key disclosure delay induces an authentication delay, which could lead to a memory DoS attack. We then propose two broadcastauthentication protocols for WSNs, which overcome the security vulnerability of existingsolutions. The proposed schemes guarantee the efficient management of receiver's buffer, by employing a staggered authentication mechanism, and a Bloom filter data structure to reduce the communication overhead. We also validate our protocols under the AVISPA model checking tool, and we evaluate them with experiments under TinyOS. Our findings are that these protocols provide source authentication service while respecting the WSN constraints.The second study addresses the storage issue in WSNs, in particular the Delayed AuthenticationCompromise attack (DAC). We first demonstrate that recently proposed schemes, which also address the DAC issue are vulnerable to two kinds of attacks: switch command attack (where an adversary pretends to "switch" two messages over time), and drop command attack (where an adversary just pretends to "hide" a message sent from the broadcaster). As a countermeasure against these attacks, we propose a new solution for broadcast authentication. Our analysis shows that our solution is effective in detecting both switch command and drop command attack, andat the same timeis more efficient (in terms of both communication and computation) than the state of the art solutions.In the third study, we address key management security in WSNs. We present novel symmetrickeybased authentication schemes which exhibit low computation and communication authentication overhead. Our schemes are built upon the integration of a reputation mechanism, a Bloom filter, and a key binary tree for the distribution and updating of the auxviii thentication keys. Our schemes are lightweight and efficient with respect to communication and energy overhead. The fourth study addresses security in vehicular communications. We focus on fast multi hop broadcast applications. We analyze the security threats of state of the art vehicular based safety applications. We demonstrate that these schemes are vulnerable to the position cheating attack, the replay broadcast message attack, and the interrupting forwarding attack. Then, we propose countermeasures for these threats. We hence propose a complete solution which is both fast and secure in broadcasting safety related messages: Fast and Secure Multihop Broadcast Algorithm (FSMBA). Finally, we confirm the efficiency and feasibility of our proposals using an extensive set of simulations under NS2 Simulator
1 edition published in 2014 in English and held by 1 WorldCat member library worldwide
Wireless sensor and vehicular networks play an important role in critical military and civil applications, and pervade our daily life. However, security concerns constitute a potential stumbling block to the impeding wide deployment of sensor networks and vehicular communications. This dissertation studies communication security for Wireless Sensor Networks (WSNs), and vehicular communication. To this aim, we address four important aspects. The first study addresses broadcast authentication in WSNs. We focus on key disclosure based schemes. We demonstrate that key disclosure delay induces an authentication delay, which could lead to a memory DoS attack. We then propose two broadcastauthentication protocols for WSNs, which overcome the security vulnerability of existingsolutions. The proposed schemes guarantee the efficient management of receiver's buffer, by employing a staggered authentication mechanism, and a Bloom filter data structure to reduce the communication overhead. We also validate our protocols under the AVISPA model checking tool, and we evaluate them with experiments under TinyOS. Our findings are that these protocols provide source authentication service while respecting the WSN constraints.The second study addresses the storage issue in WSNs, in particular the Delayed AuthenticationCompromise attack (DAC). We first demonstrate that recently proposed schemes, which also address the DAC issue are vulnerable to two kinds of attacks: switch command attack (where an adversary pretends to "switch" two messages over time), and drop command attack (where an adversary just pretends to "hide" a message sent from the broadcaster). As a countermeasure against these attacks, we propose a new solution for broadcast authentication. Our analysis shows that our solution is effective in detecting both switch command and drop command attack, andat the same timeis more efficient (in terms of both communication and computation) than the state of the art solutions.In the third study, we address key management security in WSNs. We present novel symmetrickeybased authentication schemes which exhibit low computation and communication authentication overhead. Our schemes are built upon the integration of a reputation mechanism, a Bloom filter, and a key binary tree for the distribution and updating of the auxviii thentication keys. Our schemes are lightweight and efficient with respect to communication and energy overhead. The fourth study addresses security in vehicular communications. We focus on fast multi hop broadcast applications. We analyze the security threats of state of the art vehicular based safety applications. We demonstrate that these schemes are vulnerable to the position cheating attack, the replay broadcast message attack, and the interrupting forwarding attack. Then, we propose countermeasures for these threats. We hence propose a complete solution which is both fast and secure in broadcasting safety related messages: Fast and Secure Multihop Broadcast Algorithm (FSMBA). Finally, we confirm the efficiency and feasibility of our proposals using an extensive set of simulations under NS2 Simulator
Mise au point d'un formalisme syntaxique de haut niveau pour le traitement automatique des langues by
Jerome Kirman(
)
1 edition published in 2015 in French and held by 1 WorldCat member library worldwide
The goal of computational linguistics is to provide a formal account linguistical knowledge, and to produce algorithmic tools for natural languageprocessing. Often, this is done in a socalled generative framework, where grammars describe sets of valid sentences by iteratively applying some set of rewrite rules. Another approach, based on model theory, describes instead grammaticality as a set of wellformedness logical constraints, relying on deep links between logic and automata in order to produce efficient parsers. This thesis favors the latter approach. Making use of several existing results in theoretical computer science, we propose a tool for linguistical description that is both expressive and designed to facilitate grammar engineering. It first tackles the abstract structure of sentences, providing a logical language based on lexical properties of words in order to concisely describe the set of grammaticaly valid sentences. It then draws the link between these abstract structures and their representations (both in syntax and semantics), through the use of linearization rules that rely on logic and lambdacalculus. Then in order to validate this proposal, we use it to model various linguistic phenomenas, ending with a specific focus on languages that include free word order phenomenas (that is, sentences which allow the free reordering of some of their words or syntagmas while keeping their meaning), and on their algorithmic complexity
1 edition published in 2015 in French and held by 1 WorldCat member library worldwide
The goal of computational linguistics is to provide a formal account linguistical knowledge, and to produce algorithmic tools for natural languageprocessing. Often, this is done in a socalled generative framework, where grammars describe sets of valid sentences by iteratively applying some set of rewrite rules. Another approach, based on model theory, describes instead grammaticality as a set of wellformedness logical constraints, relying on deep links between logic and automata in order to produce efficient parsers. This thesis favors the latter approach. Making use of several existing results in theoretical computer science, we propose a tool for linguistical description that is both expressive and designed to facilitate grammar engineering. It first tackles the abstract structure of sentences, providing a logical language based on lexical properties of words in order to concisely describe the set of grammaticaly valid sentences. It then draws the link between these abstract structures and their representations (both in syntax and semantics), through the use of linearization rules that rely on logic and lambdacalculus. Then in order to validate this proposal, we use it to model various linguistic phenomenas, ending with a specific focus on languages that include free word order phenomenas (that is, sentences which allow the free reordering of some of their words or syntagmas while keeping their meaning), and on their algorithmic complexity
Circular coloring and acyclic choosability of graphs by
Nicolas Roussel(
)
1 edition published in 2009 in English and held by 1 WorldCat member library worldwide
In this thesis, we study the circular coloring of planar graphs. Upper bounds have been given for graphs with bounded maximum degree, with bounded girth, that is the length of its smallest cycle, with missing cycles, and so on. It has also been studied for graphs with bounded maximum average degree. Here we give new upper bounds for that latter case. We also study the total coloring and ($d,1$)total labeling of a few infinite families of graphs and describe the new concept of circular ($d,1$)total labeling of graphs. In the last part, we will discuss conditions for a planar graph to be acyclically $4$choosable
1 edition published in 2009 in English and held by 1 WorldCat member library worldwide
In this thesis, we study the circular coloring of planar graphs. Upper bounds have been given for graphs with bounded maximum degree, with bounded girth, that is the length of its smallest cycle, with missing cycles, and so on. It has also been studied for graphs with bounded maximum average degree. Here we give new upper bounds for that latter case. We also study the total coloring and ($d,1$)total labeling of a few infinite families of graphs and describe the new concept of circular ($d,1$)total labeling of graphs. In the last part, we will discuss conditions for a planar graph to be acyclically $4$choosable
Dépendances fonctionnelles extraction et exploitation by
Eve Garnaud(
)
1 edition published in 2013 in French and held by 1 WorldCat member library worldwide
Les dépendances fonctionnelles fournissent une information sémantique sur les données d'une table en mettant en lumière les liens de corrélation qui les unient. Dans cette thèse, nous traitons du problème de l'extraction de ces dépendances en proposant un contexte unifié permettant la découverte de n'importe quel type de dépendances fonctionnelles (dépendances de clé, dépendances fonctionnelles conditionnelles, que la validité soit complète ou approximative). Notre algorithme, ParaCoDe, s'exécute en parallèle sur les candidats, réduisant ainsi le temps global de calcul. De ce fait, il est très compétitif visàvis des approches séquentielles connues à ce jour. Les dépendances satisfaites sur une table nous servent à résoudre le problème de la matérialisation partielle du cube de données. Nous présentons une caractérisation de la solution optimale dans laquelle le coût de chaque requête est borné par un seuil de performance fixé préalablement et dont la taille est minimale. Cette spécification de la solution donne un cadre unique pour décrire et donc comparer formellement les techniques de résumé de cubes de données
1 edition published in 2013 in French and held by 1 WorldCat member library worldwide
Les dépendances fonctionnelles fournissent une information sémantique sur les données d'une table en mettant en lumière les liens de corrélation qui les unient. Dans cette thèse, nous traitons du problème de l'extraction de ces dépendances en proposant un contexte unifié permettant la découverte de n'importe quel type de dépendances fonctionnelles (dépendances de clé, dépendances fonctionnelles conditionnelles, que la validité soit complète ou approximative). Notre algorithme, ParaCoDe, s'exécute en parallèle sur les candidats, réduisant ainsi le temps global de calcul. De ce fait, il est très compétitif visàvis des approches séquentielles connues à ce jour. Les dépendances satisfaites sur une table nous servent à résoudre le problème de la matérialisation partielle du cube de données. Nous présentons une caractérisation de la solution optimale dans laquelle le coût de chaque requête est borné par un seuil de performance fixé préalablement et dont la taille est minimale. Cette spécification de la solution donne un cadre unique pour décrire et donc comparer formellement les techniques de résumé de cubes de données
Analysis of 3D objects at multiple scales application to shape matching by
Nicolas Mellado(
)
1 edition published in 2012 in English and held by 1 WorldCat member library worldwide
Over the last decades, the evolution of acquisition techniques yields the generalization of detailed 3D objects, represented as huge point sets composed of millions of vertices. The complexity of the involved data often requires to analyze them for the extraction and characterization of pertinent structures, which are potentially defined at multiple scales. Amongthe wide variety of methods proposed to analyze digital signals, the scalespace analysis istoday a standard for the study of 2D curves and images. However, its adaptation to 3D dataleads to instabilities and requires connectivity information, which is not directly availablewhen dealing with point sets.In this thesis, we present a new multiscale analysis framework that we call the GrowingLeast Squares (GLS). It consists of a robust local geometric descriptor that can be evaluatedon point sets at multiple scales using an efficient secondorder fitting procedure. We proposeto analytically differentiate this descriptor to extract continuously the pertinent structuresin scalespace. We show that this representation and the associated toolbox define an efficient way to analyze 3D objects represented as point sets at multiple scales. To this end, we demonstrate its relevance in various application scenarios.A challenging application is the analysis of acquired 3D objects coming from the CulturalHeritage field. In this thesis, we study a realworld dataset composed of the fragments ofthe statues that were surrounding the legendary Alexandria Lighthouse. In particular, wefocus on the problem of fractured object reassembly, consisting of few fragments (up to aboutten), but with missing parts due to erosion or deterioration. We propose a semiautomaticformalism to combine both the archaeologist's knowledge and the accuracy of geometricmatching algorithms during the reassembly process. We use it to design two systems, andwe show their efficiency in concrete cases
1 edition published in 2012 in English and held by 1 WorldCat member library worldwide
Over the last decades, the evolution of acquisition techniques yields the generalization of detailed 3D objects, represented as huge point sets composed of millions of vertices. The complexity of the involved data often requires to analyze them for the extraction and characterization of pertinent structures, which are potentially defined at multiple scales. Amongthe wide variety of methods proposed to analyze digital signals, the scalespace analysis istoday a standard for the study of 2D curves and images. However, its adaptation to 3D dataleads to instabilities and requires connectivity information, which is not directly availablewhen dealing with point sets.In this thesis, we present a new multiscale analysis framework that we call the GrowingLeast Squares (GLS). It consists of a robust local geometric descriptor that can be evaluatedon point sets at multiple scales using an efficient secondorder fitting procedure. We proposeto analytically differentiate this descriptor to extract continuously the pertinent structuresin scalespace. We show that this representation and the associated toolbox define an efficient way to analyze 3D objects represented as point sets at multiple scales. To this end, we demonstrate its relevance in various application scenarios.A challenging application is the analysis of acquired 3D objects coming from the CulturalHeritage field. In this thesis, we study a realworld dataset composed of the fragments ofthe statues that were surrounding the legendary Alexandria Lighthouse. In particular, wefocus on the problem of fractured object reassembly, consisting of few fragments (up to aboutten), but with missing parts due to erosion or deterioration. We propose a semiautomaticformalism to combine both the archaeologist's knowledge and the accuracy of geometricmatching algorithms during the reassembly process. We use it to design two systems, andwe show their efficiency in concrete cases
Quelques problèmes de dynamique linéaire dans les espaces de Banach by
JeanMatthieu Augé(
)
1 edition published in 2012 in French and held by 1 WorldCat member library worldwide
This work is mainly devoted to some problems of linear dynamics in Banach spaces. In particular, we answer a recent question of Hajek and Smith by constructing, in any separable Banach space, a bounded operator such that its orbits tending to infinity form a set which is neither empty, nor dense. We also connect the behaviour of bounded operators with the asymptotic modulus of smoothness
1 edition published in 2012 in French and held by 1 WorldCat member library worldwide
This work is mainly devoted to some problems of linear dynamics in Banach spaces. In particular, we answer a recent question of Hajek and Smith by constructing, in any separable Banach space, a bounded operator such that its orbits tending to infinity form a set which is neither empty, nor dense. We also connect the behaviour of bounded operators with the asymptotic modulus of smoothness
Analyse semiclassique des opérateurs périodiques perturbés by
Youssef Sbai(
)
1 edition published in 2015 in French and held by 1 WorldCat member library worldwide
This Ph.D thesis deals with some spectral properties of two specific classes of two periodic operators. We are firstly interested in the model periodic perturbed by operator depending on a small semiclassical constant. We obtain an asymptotic behavior of the eigenvalue counting function in the spectral gaps with scharp remainder estimate. The second model studied in this thesis is a twodimensional periodic elliptic second order operator perturbed by operator depending on a large coupling constant. We also give the description of the counting function of eigenvalues when the coupling constant tends to infinity. The last part of this thesis highlights the study the spectrum of a Schrödinger operator perturbed by a fast oscillatingdecaying potential depending on a small parameter
1 edition published in 2015 in French and held by 1 WorldCat member library worldwide
This Ph.D thesis deals with some spectral properties of two specific classes of two periodic operators. We are firstly interested in the model periodic perturbed by operator depending on a small semiclassical constant. We obtain an asymptotic behavior of the eigenvalue counting function in the spectral gaps with scharp remainder estimate. The second model studied in this thesis is a twodimensional periodic elliptic second order operator perturbed by operator depending on a large coupling constant. We also give the description of the counting function of eigenvalues when the coupling constant tends to infinity. The last part of this thesis highlights the study the spectrum of a Schrödinger operator perturbed by a fast oscillatingdecaying potential depending on a small parameter
Réduction de dimension en apprentissage supervisé applications à l'étude de l'activité cérébrale by
Laurent Vezard(
)
1 edition published in 2013 in French and held by 1 WorldCat member library worldwide
The aim of this work is to develop a method able to automatically determine the alertness state of humans. Such a task is relevant to diverse domains, where a person is expected or required to be in a particular state. For instance, pilots, security personnel or medical personnel are expected to be in a highly alert state, and this method could help to confirm this or detect possible problems. In this work, electroencephalographic data (EEG) of 58 subjects in two distinct vigilance states (state of high and low alertness) were collected via a cap with $58$ electrodes. Thus, a binary classification problem is considered. In order to use of this work on a realworld applications, it is necessary to build a prediction method that requires only a small number of sensors (electrodes) in order to minimize the time needed by the cap installation and the cap cost. During this thesis, several approaches have been developed. A first approach involves use of a preprocessing method for EEG signals based on the use of a discrete wavelet decomposition in order to extract the energy of each frequency in the signal. Then, a linear regression is performed on the energies of some of these frequencies and the slope of this regression is retained. A genetic algorithm (GA) is used to optimize the selection of frequencies on which the regression is performed. Moreover, the GA is used to select a single electrode .A second approach is based on the use of the Common Spatial Pattern method (CSP). This method allows to define linear combinations of the original variables to obtain useful synthetic signals for the task classification. In this work, a GA and a sequential search method have been proposed to select a subset of electrode which are keep in the CSP calculation.Finally, a sparse CSP algorithm, based on the use of existing work in the sparse principal component analysis, was developed.The results of the different approaches are detailed and compared. This work allows us to obtaining a reliable model to obtain fast prediction of the alertness of a new individual
1 edition published in 2013 in French and held by 1 WorldCat member library worldwide
The aim of this work is to develop a method able to automatically determine the alertness state of humans. Such a task is relevant to diverse domains, where a person is expected or required to be in a particular state. For instance, pilots, security personnel or medical personnel are expected to be in a highly alert state, and this method could help to confirm this or detect possible problems. In this work, electroencephalographic data (EEG) of 58 subjects in two distinct vigilance states (state of high and low alertness) were collected via a cap with $58$ electrodes. Thus, a binary classification problem is considered. In order to use of this work on a realworld applications, it is necessary to build a prediction method that requires only a small number of sensors (electrodes) in order to minimize the time needed by the cap installation and the cap cost. During this thesis, several approaches have been developed. A first approach involves use of a preprocessing method for EEG signals based on the use of a discrete wavelet decomposition in order to extract the energy of each frequency in the signal. Then, a linear regression is performed on the energies of some of these frequencies and the slope of this regression is retained. A genetic algorithm (GA) is used to optimize the selection of frequencies on which the regression is performed. Moreover, the GA is used to select a single electrode .A second approach is based on the use of the Common Spatial Pattern method (CSP). This method allows to define linear combinations of the original variables to obtain useful synthetic signals for the task classification. In this work, a GA and a sequential search method have been proposed to select a subset of electrode which are keep in the CSP calculation.Finally, a sparse CSP algorithm, based on the use of existing work in the sparse principal component analysis, was developed.The results of the different approaches are detailed and compared. This work allows us to obtaining a reliable model to obtain fast prediction of the alertness of a new individual
Extraction des utilisations typiques à partir de données hétérogènes en vue d'optimiser la maintenance d'une flotte de
véhicules by
Asma Ben Zakour(
)
1 edition published in 2012 in French and held by 1 WorldCat member library worldwide
The present work is part of an industrial project driven by 2MoRO Solutions company.It aims to develop a high value service enabling aircraft operators to optimize their maintenance actions.Given the large amount of data available around aircraft exploitation, we aim to analyse the historical events recorded with each aircraft in order to extract maintenance forecasting. Theresults are used to integrate and consolidate maintenance tasks in order to minimize aircraft downtime and risk of failure. The proposed method involves three steps : (i) streamlining information in order to combinethem, (ii) organizing this data for easy analysis and (iii) an extraction step of useful knowledgein the form of interesting sequences. [...]
1 edition published in 2012 in French and held by 1 WorldCat member library worldwide
The present work is part of an industrial project driven by 2MoRO Solutions company.It aims to develop a high value service enabling aircraft operators to optimize their maintenance actions.Given the large amount of data available around aircraft exploitation, we aim to analyse the historical events recorded with each aircraft in order to extract maintenance forecasting. Theresults are used to integrate and consolidate maintenance tasks in order to minimize aircraft downtime and risk of failure. The proposed method involves three steps : (i) streamlining information in order to combinethem, (ii) organizing this data for easy analysis and (iii) an extraction step of useful knowledgein the form of interesting sequences. [...]
Opérateurs de composition sur les espaces de fonctions holomorphes de plusieurs variables complexes universalité dans les
espaces de Banach et de Fréchet by
Stéphane Charpentier(
)
1 edition published in 2010 in French and held by 1 WorldCat member library worldwide
In the first part of my thesis, a result on the existence of a closed infinitedimensional subspace, whose nonzero elements are universal series, is given in Banach and Fréchet spaces framework.The second part is devoted to the study of composition operators on spaces of several variables analytic functions. First, the spectrum and the dynamics of hyperbolic composition operators acting on Hardy spaces on the ball are completely described.Second, continuity and compactness of composition operators on HardyOrlicz and BergmanOrlicz spaces on the ball are characterized. In particular, we deduce from the treatment of the continuity that there exists a class of Orlicz functions which define HardyOrlicz and BergmanOrlicz spaces, on which every composition operator is bounded
1 edition published in 2010 in French and held by 1 WorldCat member library worldwide
In the first part of my thesis, a result on the existence of a closed infinitedimensional subspace, whose nonzero elements are universal series, is given in Banach and Fréchet spaces framework.The second part is devoted to the study of composition operators on spaces of several variables analytic functions. First, the spectrum and the dynamics of hyperbolic composition operators acting on Hardy spaces on the ball are completely described.Second, continuity and compactness of composition operators on HardyOrlicz and BergmanOrlicz spaces on the ball are characterized. In particular, we deduce from the treatment of the continuity that there exists a class of Orlicz functions which define HardyOrlicz and BergmanOrlicz spaces, on which every composition operator is bounded
Les systèmes cognitifs dans les réseaux autonomes une méthode d'apprentissage distribué et collaboratif situé dans le
plan de connaissance pour l'autoadaptation by
Maïssa Mbaye(
)
1 edition published in 2009 in French and held by 1 WorldCat member library worldwide
One of the major challenges for decades to come, in the field of information technologies and the communication, is realization of autonomic paradigm. It aims to enable network equipments to selfmanage, enable them to selfconfigure, selfoptimize, selfprotect and selfheal according to highlevel objectives of their designers. Major architectures of autonomic networking are based on closed control loop allowing selfadapting (selfconfiguring and selfoptimizing) of the network equipment according to the events which arise on their environment. Knowledge plane is one approach, very emphasis these last years by researchers, which suggests the use of the cognitive systems (machine learning and the reasoning) to realize closed control loop. However, although the major autonomic architectures integrate machine learning modules as functional block, few researches are really interested in the contents of these blocks. It is in this context that we made a study on the potential contribution machine learning and proposed a method of distributed and collaborative machine learning. We propose a formalization selfadapting problem in term of learning configuration strategies (stateactions) problem. This formalization allows us to define a strategies machine learning method for selfadapting which is based on the history observed transitions and uses inductive logic programming to discover new strategies from those already discovered. We defined, also a knowledge sharing algorithm which makes network components collaborate to improve learning process. Finally, we tested our approach in DiffServ context and showed its transposition on multimedia streaming in 802.11 wireless networks
1 edition published in 2009 in French and held by 1 WorldCat member library worldwide
One of the major challenges for decades to come, in the field of information technologies and the communication, is realization of autonomic paradigm. It aims to enable network equipments to selfmanage, enable them to selfconfigure, selfoptimize, selfprotect and selfheal according to highlevel objectives of their designers. Major architectures of autonomic networking are based on closed control loop allowing selfadapting (selfconfiguring and selfoptimizing) of the network equipment according to the events which arise on their environment. Knowledge plane is one approach, very emphasis these last years by researchers, which suggests the use of the cognitive systems (machine learning and the reasoning) to realize closed control loop. However, although the major autonomic architectures integrate machine learning modules as functional block, few researches are really interested in the contents of these blocks. It is in this context that we made a study on the potential contribution machine learning and proposed a method of distributed and collaborative machine learning. We propose a formalization selfadapting problem in term of learning configuration strategies (stateactions) problem. This formalization allows us to define a strategies machine learning method for selfadapting which is based on the history observed transitions and uses inductive logic programming to discover new strategies from those already discovered. We defined, also a knowledge sharing algorithm which makes network components collaborate to improve learning process. Finally, we tested our approach in DiffServ context and showed its transposition on multimedia streaming in 802.11 wireless networks
Segmentation spatiotemporelle et indexation vidéo dans le domaine des représentations hiérarchiques by
Claire Morand(
)
1 edition published in 2009 in French and held by 1 WorldCat member library worldwide
This thesis aims at proposing a solution of scalable objectbased indexing of HD video flow compressed by MJPEG2000. In this context, on the one hand, we work in the hierarchical transform domain of the 9/7 Daubechies' wavelets and, on the other hand, the scalable representation implies to search for multiscale methods, from low to high resolution. The first part of this manuscript is dedicated to the definition of a method for automatic extraction of objects having their own motion. It is based on a combination of a robust global motion estimation with a morphological color segmentation at low resolution. The obtained result is then refined following the data order of the scalable flow. The second part is the definition of an object descriptor which is based on the multiscale histograms of the wavelet coefficients. Finally, the performances of the proposed method are evaluated in the context of scalable contentbased queries
1 edition published in 2009 in French and held by 1 WorldCat member library worldwide
This thesis aims at proposing a solution of scalable objectbased indexing of HD video flow compressed by MJPEG2000. In this context, on the one hand, we work in the hierarchical transform domain of the 9/7 Daubechies' wavelets and, on the other hand, the scalable representation implies to search for multiscale methods, from low to high resolution. The first part of this manuscript is dedicated to the definition of a method for automatic extraction of objects having their own motion. It is based on a combination of a robust global motion estimation with a morphological color segmentation at low resolution. The obtained result is then refined following the data order of the scalable flow. The second part is the definition of an object descriptor which is based on the multiscale histograms of the wavelet coefficients. Finally, the performances of the proposed method are evaluated in the context of scalable contentbased queries
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Université de Bordeaux I. Degree grantor
 Charpentier, Éric (1963 ...). Editor
 Laboratoire Bordelais de Recherche en Informatique Degree grantor
 Nikolski, Nikolaï Kapitonovitch (1940 ...). Editor
 Institut de Mathématiques de Bordeaux Degree grantor
 Université de Bordeaux (2014....). Degree grantor
 Bayart, Frédéric (1975....). Thesis advisor
 Krief, Francine Opponent Thesis advisor
 Iollo, Angelo (1966....). Opponent Thesis advisor
 Namyst, Raymond (1969....). Thesis advisor
Associated Subjects
Alternative Names
École doctorale 039
École doctorale 39
École doctorale de Mathématiques et Informatique (Talence ; Gironde)
École doctorale Mathématiques et Informatique (Bordeaux)
École doctorale Mathématiques et Informatique (Talence ; Gironde)
ED 039
ED 39
ED039
ED39
Mathématiques et Informatique (Bordeaux)
Mathématiques et Informatique (Talence ; Gironde)
Université Bordeaux I. UFR de Mathématiques et Informatique
Université de Bordeaux 1. École doctorale de Mathématiques et Informatique
Université de Bordeaux. École doctorale de Mathématiques et Informatique
Université de Bordeaux I, École doctorale de mathématiques et informatique
Languages