Pas de résumé / No abstract

Cette thèse concerne l'ingénierie des systèmes complexes à partir d'une dynamique souhaitée. En particulier, nous nous intéressons aux populations d'oscillateurs et aux réseaux de régulation génétique. Dans une première partie, nous nous fondons sur une hypothèse, introduite en neurosciences, qui souligne le rôle de la synchronisation neuronale dans le traitement de l'information cognitive. Nous proposons de l'utiliser sur un plan plus large pour étudier le traitement de l'information par des populations d'oscillateurs. Nous discutons des isochrons de quelques oscillateurs classés selon leurs symétries dans l'espace des états. Cela nous permet d'avoir un critère qualitatif pour choisir un oscillateur. Par la suite, nous définissons des procédures d'impression, de lecture et de réorganisation de l'information sur une population d'oscillateurs. En perspective, nous proposons un système à couches d'oscillateurs de Wilson-Cowan. Ce système juxtapose convenablement synchronisation et désynchronisation à travers l'utilisation de deux formes de couplage: un couplage continu et un couplage par pulsation. Nous finissons en proposant une application de ce système: la détection de contours dans une image. En deuxième partie, nous proposons d'utiliser une approche par contraintes pour identifier des réseaux de régulation génétique à partir de connaissances partielles sur leur dynamique et leur structure. Le formalisme que nous utilisons est connu sous le nom de réseaux d'automates booléens à seuil ou réseaux Hopfield-semblables. Nous appliquons cette méthode, afin de déterminer le réseau de régulation de la morphogenèse florale d'Arabidopsis thaliana. Nous montrons l'absence d'unicité des solutions dans l'ensemble des modèles valides (ici, 532 modèles). Nous montrons le potentiel de cette approche dans la détermination et la classification de modèles de réseaux de régulation génétique. L'ensemble de ces travaux mène à un certain nombre d'applications, en particulier dans le développement de nouvelles méthodes de stockage de l'information et dans le design de systèmes de calcul non conventionnel. / This thesis is concerned by the engineering of complex systems from a desired dynamics. Particularly, we are interested by populations of oscillators and genetical regulatory networks. In a first part, we start from a hypothesis introduced in neuroscience, which highlight the role of neural synchronization in the cognitive processing. We propose to use this hypothesis in a more general panorama to investigate the computing with populations of oscillators. We discuss about the isochrons of few oscillators selected according to their symmetry in the state space. Therefore, we define procedures for making footprints, for reading and for reorganizing information by a population of oscillators. As a perspective, we propose a system of lattices of Wilson-Cowan oscillators organized in several interconnected layers. This system properly mixes synchronization and desynchronization by using two types of coupling : pulsed and continuous coupling. At the end of this part, we propose to use this system in order to detect the edges of an image. In the second part, we propose a constraint-based approach to determine the structure of genetic regulatory networks starting from incomplete knowledge on their structure and their dynamics. The formalism we use is widely called thresholded Boolean automata networks or Hopfield-like networks. As an proof of concept, we apply this method to determine the regulatory network of Arabidopsis thaliana flower morphogenesis. We obtain 532 valid models instead of one unique solution and then classify them by using structural robustness criteria. By this way, we showed the potential of this approach in determining and classifying thresholded Boolean automata networks like genetic regulatory networks or neural networks. This works leads to many applications, in particular the developpement and the design of new methods for processing information and the design of systems of unconventional computing.

Nous nous intéressons à l'étude de la dynamique des réseaux composés d'une multitude d'agents. Les motivations de ce travail trouvent leurs sources dans de nombreux domaines et notamment la biologie avec l'étude de l'émergence de comportements collectifs cohérents chez les animaux (vol en formation d'oiseaux migrateurs). Considérons un certain nombre d’agents (animaux) dont le comportement dynamique individuel peut être modélisé par une équation différentielle. Les agents communiquent : les liens sont représentés sous la forme d’un graphe dont les sommets sont les agents du système. Chaque agent a la connaissance de l’état des agents auxquels il est connecté et ajuste sa dynamique à l’aide de cette information. Des comportements collectifs peuvent alors émerger comme par exemple le phénomène de flocking (tous les agents se déplacent dans la même direction). Plusieurs modèles d'interaction ont été proposés, les plus connus étant le modèle de Viscek (1995) ou le modèle de Cucker-Smale (2007). L'étude de ces modèles repose généralement sur des méthodes d'analyse de stabilité des systèmes dynamiques ou des systèmes hybrides, lorsque le graphe de communication évolue dans le temps. Nous souhaitons dans cette thèse évaluer la robustesse de l'émergence de ces comportements collectifs en étudiant l'influence de divers facteurs: paramètres du modèle, topologie du graphe, nombre d'agents, présences de perturbations. Nous nous intéresserons notamment au phénomène de scission du groupe d'agents en plusieurs groupes d'agents coordonnés. / This thesis presents a study on multi-agent systems. Such systems find numerous applications such as multi-vehicle control in robotics, the design of smart distributed energy networks and the modeling of opinion dynamics. In a first part, we present new results regarding consensus theory which extend the recent work from Hendrickx and Tsitsiklis on cut-balanced consensus. Then, we apply the consensus system to the control of a fleet of vehicles. We present several results regarding velocity alignment (flocking). This study is based upon a graph robustness analysis in order to preserve the connectivity of the interaction network. This concept is of main importance in this study. In the last part, we state results froma collaborative work with a sociologist regarding the social network linked to the controversy concerning o-road motorized leisure in France. We study the link between the national and local scenes. To do so, we use large graph visualization tools and actor centrality measures.

Poussés par les réglementations « anti-pollution », les industriels automobiles sont incités à développer des véhicules plus propres et sobres en consommation. Ces dernières années, la dépollution des véhicules n'a cessée d'être améliorée, en optimisant le traitement des polluants des moteurs actuels, mais aussi en développant des solutions alternatives. C'est dans ce contexte que les deux études ont étés menées. Cette étude s'est d'abord intéressée à l'optimisation du fonctionnement du catalyseur trois voies. Ce système est le principal organe de dépollution des motorisations essence, il est capable de convertir les trois principaux polluants réglementés (oxydes d'azote, monoxyde de carbone et hydrocarbures imbrûlés) en gaz non nocifs pour la santé. On s'est intéressé à la modélisation orientée contrôle de ce réacteur chimique, le modèle développé à permis d'élaborer les outils nécessaires au contrôleur pour lui permettre de prendre en compte les dynamiques internes du catalyseur trois voies. L'étude s'est ensuite focalisée sur le contrôle multivariable robuste d'une chaîne d'air turbocompressée d'un moteur essence selon les approches des systèmes linéaires à commutation et à paramètres variant. Le contrôle robuste permet au système de chaîne d'air d'admettre au plus juste la quantité d'air admis dans la chambre de combustion en prenant en compte les éventuelles perturbations. / Forced by more and more severe normative, automotive industrials have to develop clean and energy-efficient vehicles. During the last decades, after-treatment system has been improved and alternative solutions have been found. The two presented studies have been lead in this context. The first study has been focused on the performance optimization of the three ways catalyst. This after-treatment system is able to convert the three main pollutants limited by the normative (nitrogen oxides, carbon monoxide and unburned hydrocarbon) into harmless gases. The purpose of this study is to develop a mathematical reduced order model for the three ways catalyst focused on the oxygen storage-release dynamics. From this model, an observer for the oxygen storage rate estimation has been developed. Based on this tool, three ways catalyst converter controller will be able to take into account the internal dynamics. The second study deals with the multivariable robust control of a supercharged air path system for a spark ignition engine according to two approaches: the switched linear system and the linear parameter varying system. With robust control, the air path system will inject the right amount of air entering the combustion chamber by taking into account possible disruptions.

Resumo: A topologia do estado nativo de uma proteína desempenha um papel crucial no processo de enovelamento. Neste trabalho uma nova aproximação utilizando aspectos topol ogicos para investigar a evolução protéica e apresentada. O modelo utiliza uma rede c ubica 3 3 3 de 27 monômeros e um mapa de conexões entre diferentes conformações em espa co de fase estrutural e de sequência. Desenhamos a melhor sequência não frustrada para cada uma das 103346 conformações maximamente compactas usando um algorítimo que maximiza o número de tipos de monômeros na sequência. Isto significa que cada sequência não pode possuir contatos desfavor aveis. O n umero m aximo de tipos de monômeros e 5. A sequência-conformação e considerada \protein-like" se ela tem uma unica conformação de mais baixa energia, alem de acessibilidade e robustez. De todas as conformações maximamente compactas, somente 4; 75% geraram sequências \protein-like', o qual são o alvo neste estudo. Com esses dados realizamos simulações de Monte Carlo (MC) no qual examinamos as melhores sequêencias estruturas baseando-se no ZScore. A simulação e iniciada com uma sequência aleatória no qual e testada em todas as conformações, seguindo as regras estipuladas por MC. Se o ZScore aumenta, assumimos que a nova conformação e mais estável que a anterior. Esse processo e repetido até que as sequências otimamente desenhadas (com mais alto ZScore) são alcançadas. Mantendo as trajetórias originadas via MC, um mapa de conectividade sequências-estruturas e obtido. Os resultados mostram trajetórias conectadas com estruturas com baixos valores de ZScore. O aumento do ZScore ao longo da simulação conduz a um pequeno grupo de conformações preferenciais. O modelo sugere um funil de estruturas para a evolução de proteínas no qual as estruturas do fundo estão associadas com o ii \motif" de uma proteína... (Resumo completo, clicar acesso eletrônico abaixo) / Abstract: The topology of a protein native state plays a crucial role in the folding process. In this work a new approach using topological aspects to investigate the protein evolutions is presented. The model uses the 27-mer in a cubic lattice of 3 3 3, and a conection map between di erent conformations is found in the sequence and structural phase space. We designed the best unfrustrated sequence for each of the 103346 maximally compact conformation, using an algorithm that maximizes the number for monomers types in the sequence. This means that each sequence cannot have unfavorable contacts. The maximum number of types of monomer is 5. The sequence-conformation is considered protein-like if it has a unique lowest energy conformation, accessible and robust . Out of all maximally compact conformations, only 4,75% generated protein-like sequence, with are targeted in this study. With this data we performed a Monte Carlo simulations in which we probe for better sequence-structure based on Zscore. The simulation start which a random sequence and it is tested all conformations, nding its conformations according to the Monte Carlo rules. If the Zscore increases, we assume that the new conformation is more stable than the previous. This process is repeated until the optimally designed sequence (with the highest Zscore) is reached. Keeping track of all the Monte Carlo trajectories, a map of conectivity of sequence-structures is obtained. The results shows trajectories connected with structures of low Zscore values. The increase of Zscore along of the simulation leads to a small group of preferred conformations. The model suggest a funnel like structure for folding evolution, in which the structures at the bottom of the funnel are associated with the motif of a protein. This result can be a possible iv explanation for the restricted number of conformations compared to the large number of sequences... (Complete abstract click electronic access below) / Orientador: Vitor Barbanti Pereira Leite / Coorientador: Jorge Chahine / Banca: Alexandre Souto Martinez / Banca: Antonio Caliri / Banca: Antonio Francisco Pereira de Araújo / Banca: José Roberto Ruggiero / Doutor

Made available in DSpace on 2015-03-03T15:07:31Z (GMT). No. of bitstreams: 1 KuriosIPMQ.pdf: 875895 bytes, checksum: e5d1081ef123fc325214ccd9a2fee411 (MD5) Previous issue date: 2008-11-20 / Neste trabalho, um controlador adaptativo backstepping a estrutura vari?vel (Variable Structure Adaptive Backstepping Controller, VS-ABC) ? apresentado para plantas monovari?veis, lineares e invariantes no tempo com grau relativo unit?rio. Ao inv?s das tradicionais leis integrais para estima??o dos par?metros da planta, leis chaveadas s?o utilizadas com o objetivo de aumentar a robustez em rela??o a incertezas param?tricas e dist?rbios externos, bem como melhorar o desempenho transit?rio do sistema. Adicionalmente, o projeto do novo controlador ? mais intuitivo quando comparado ao controlador backstepping original, uma vez que os rel?s introduzidos apresentam amplitudes diretamente relacionadas com os par?metros nominais da planta. Esta nova abordagem, com uso de estrutura vari?vel, tamb?m reduz a complexidade das implementa??es pr?ticas, motivando a utiliza??o de componentes industriais, tais como, FPGAs (Field Programmable Gate Arrays ), MCUs (Microcontrollers) e DSPs (Digital Signal Processors). Simula??es preliminares para um sistema inst?vel de primeira e segunda ordem s?o apresentadas de modo a corroborar os estudos. Um dos exemplos de Rohrs ? ainda abordado atrav?s de simula??es, para os dois cen?rios adaptativos: o controlador backstepping adaptativo original e o VS-ABC

Made available in DSpace on 2014-12-17T14:54:46Z (GMT). No. of bitstreams: 1 JosenaldeBO.pdf: 1494350 bytes, checksum: 7c76ccebcfe52ebc97b3be9b7982ebd0 (MD5) Previous issue date: 2007-12-14 / In this thesis, it is developed the robustness and stability analysis of a variable structure model reference adaptive controller considering the presence of disturbances and unmodeled dynamics. The controller is applied to uncertain, monovariable, linear time-invariant plants with relative degree one, and its development is based on the indirect adaptive control. In the direct approach, well known in the literature, the switching laws are designed for the controller parameters. In the indirect one, they are designed for the plant parameters and, thus, the selection of the relays upper bounds becomes more intuitive, whereas they are related to physical parameters, which present uncertainties that can be known easier, such as resistances, capacitances, inertia moments and friction coefficients. Two versions for the controller algorithm with the stability analysis are presented. The global asymptotic stability with respect to a compact set is guaranteed for both cases. Simulation results under adverse operation conditions in order to verify the theoretical results and to show the performance and robustness of the proposed controller are showed. Moreover, for practical purposes, some simplifications on the original algorithm are developed / Nesta tese ? desenvolvida a an?lise de estabilidade e robustez ? din?mica n?o modelada e ?s perturba??es externas de um controlador adaptativo por modelo de refer?ncia e estrutura vari?vel aplicado a plantas incertas, monovari?veis, lineares e invariantes no tempo com grau relativo unit?rio. O projeto de tal controlador ? baseado na abordagem indireta do controle adaptativo. Na abordagem direta, j? amplamente conhecida na literatura, as leis chaveadas s?o projetadas diretamente para os par?metros do controlador. Na abordagem indireta, as mesmas s?o projetadas para os par?metros da planta e, conseq?entemente, o dimensionamento das amplitudes dos rel?s torna-se mais intuitivo, tendo em vista estarem associadas a par?metros f?sicos, os quais apresentam incertezas que podem ser conhecidas mais facilmente, tais como resist?ncias, capacit?ncias, momentos de in?rcia e coeficientes de atrito. S?o apresentadas duas vers?es para o algoritmo do controlador, sendo suas an?lises de estabilidade desenvolvidas, assim como resultados de simula??o sob condi??es de opera??o adversas para verificar os resultados te?ricos obtidos e ilustrar o desempenho e a robustez do controlador proposto. A estabilidade assint?tica global com respeito a um conjunto compacto ? garantida em ambos os casos. Adicionalmente, para fins de aplicabilidade pr?tica, s?o desenvolvidas algumas simplifica??es no algoritmo original

Made available in DSpace on 2014-12-17T14:55:00Z (GMT). No. of bitstreams: 1 MarceloBS.pdf: 1886256 bytes, checksum: 468aa0bf31f319166e37328a170c3b50 (MD5) Previous issue date: 2007-10-19 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior / In this work, the variable structure adaptive pole placement controller (VS-APPC) robustness and performance are evaluated and this algorithm is applied in a motor control system. The controller robustness evaluation will be done through simulations, where will be introduced in the system the following adversities: time delay, actuator response boundeds, disturbances, parametric variation and unmodeled dynamics. The VS-APPC will be compared with PI control, pole placement control (PPC) and adaptive pole placement controller (APPC). The VS-APPC will be simulated to track a step and a sine reference. It will be applied in a three-phase induction motor control system to track a sine signal in the stator reference frame. Simulation and experimental results will prove the efficiency and robustness of this control strategy / Neste trabalho, a robustez e o desempenho do controlador adaptativo por posicionamento de p?los e estrutura vari?vel (VS-APPC) s?o avaliados e este algoritmo ? aplicado em um sistema de controle de um motor. A avalia??o de robustez deste controlador ser? realizada atrav?s de simul??es, onde ser?o introduzidas as seguintes adversidades no sistema: atraso de transporte, limites da resposta no atuador, perturba??es, varia??o param?trica e din?mica n?o modelada. O VS-APPC ser? comparado com o controlador PI, com o controlador por posicionamento de p?los (PPC) e com o controlador adaptativo por posicionamento de p?los (APPC). O VS-APPC ser? simulado para rastrear uma refer?ncia degrau e senoidal. Ser? tamb?m aplicado no sistema de controle de um motor de indu??o trif?sico para rastrear um sinal senoidal no referencial estat?rico. Os resultados das simula??es e experimentais comprovar?o a efici?ncia e robustez desta estrat?gia de controle

Made available in DSpace on 2014-12-17T14:55:03Z (GMT). No. of bitstreams: 1 OscarGF.pdf: 1901439 bytes, checksum: f8f1a37dca7a69d726f7a9453cbf0a98 (MD5) Previous issue date: 2004-03-05 / This work develops a robustness analysis with respect to the modeling errors, being applied to the strategies of indirect control using Artificial Neural Networks - ANN s, belong to the multilayer feedforward perceptron class with on-line training based on gradient method (backpropagation). The presented schemes are called Indirect Hybrid Control and Indirect Neural Control. They are presented two Robustness Theorems, being one for each proposed indirect control scheme, which allow the computation of the maximum steady-state control error that will occur due to the modeling error what is caused by the neural identifier, either for the closed loop configuration having a conventional controller - Indirect Hybrid Control, or for the closed loop configuration having a neural controller - Indirect Neural Control. Considering that the robustness analysis is restrict only to the steady-state plant behavior, this work also includes a stability analysis transcription that is suitable for multilayer perceptron class of ANN s trained with backpropagation algorithm, to assure the convergence and stability of the used neural systems. By other side, the boundness of the initial transient behavior is assured by the assumption that the plant is BIBO (Bounded Input, Bounded Output) stable. The Robustness Theorems were tested on the proposed indirect control strategies, while applied to regulation control of simulated examples using nonlinear plants, and its results are presented / Este trabalho utiliza as Redes Neurais Multicamadas - RNM s, totalmente com treinamento em tempo real (on-line), no desenvolvimento de duas estrat?gias de controle indireto. Os esquemas propostos denominam-se Controle H?brido Indireto e Controle Neural Indireto. Todo o treinamento dos neurodispositivos - o identificador da planta e o controlador, quando presentes na malha de controle indireto, ? realizado com um m?nimo de atraso computacional, de modo a contemplar o controle de plantas com pequenos per?odos de amostragem. S?o apresentados Teoremas de Estabilidade para garantia da converg?ncia dos dispositivos neurais, assim como foram feitas considera??es para adequar o m?todo de acelera??o da converg?ncia h-adaptativo utilizado ?s condi??es de estabilidade. Para cada esquema de controle indireto foi desenvolvido um teorema que permite calcular o m?ximo erro permanente (steady-state error) que poder? ocorrer em fun??o da toler?ncia previamente especificada para converg?ncia dos dispositivos neurais usados na malha de controle, desde que a estabilidade seja garantida. Estes teoremas foram denominados de Teoremas da Robustez e constituem a principal contribui??o deste trabalho. As condi??es de estabilidade e robustez foram testadas para as estrat?gias de Controle H?brido Indireto e de Controle Neural Indireto, sendo apresentados os resultados obtidos na simula??o computacional do controle de regula??o de plantas n?o-lineares, BIBO (Bounded Input, Bounded Output) est?veis

Nous nous intéressons dans ce travail au guidage optimal des usagers dans un réseau routier. Plus précisément, nous nous focalisons sur les stratégies adaptatives de guidage avec des garanties en termes de fiabilité des temps de parcours, et en termes de robustesse de ces stratégies. Nous nous basons sur une approche stochastique où des distributions de probabilités sont associées aux temps de parcours sur les liens du réseau. Le guidage est adaptatif et individuel. L'objectif de ce travail de recherche est le développement de stratégies « robustes » de guidage des usagers dans un réseau de transport routier. Une stratégie de guidage d’un nœud origine vers un nœud destination est dite robuste, ici, si elle minimise la détérioration de sa valeur maximale calculée au départ de l’origine, contre d’éventuelles reconfigurations du réseau dues à des coupures de liens (accidents, travaux, etc.) La valeur de la stratégie de guidage est maximisée par rapport à la moyenne et à la fiabilité des temps de parcours associées à la stratégie. Deux principales parties sont distinguées dans ce travail. Nous commençons par l’aspect statique du guidage, où la dynamique du trafic n’est pas prise en compte. Nous proposons une extension d’une approche existante de guidage, pour tenir compte de la robustesse des itinéraires calculés. Dans une deuxième étape, nous combinons notre nouvel algorithme avec un modèle microscopique du trafic pour avoir l’effet de la dynamique du trafic sur le calcul d’itinéraires robustes / In this work, we are interested in the optimal guidance of users on road networks. More precisely, we are focused on the adaptive strategies of guidance with guarantees in terms of the travel time reliability and in terms of the robustness of the strategies. We base here on a stochastic approach, where probability distributions are associated to travel times on the links of the network. The guidance is adaptive and user-based. The objective of this work is the development of "robust" strategies for user guidance in a road network. A guidance strategy is said to be robust, here, if it minimizes the deterioration of its maximum value calculated at the origin, against eventual reconfigurations of the network due to link failures (accidents, works, etc.) The value of a guidance strategy is maximized with respect to the mean travel time and its reliability. Two main parts are distinguished in this work. We start with the static aspect of the guidance, where the traffic dynamics are not taken into account. We propose an extension of an existing guidance approach, to take into account the robustness of the calculated itineraries. In a second step, we combine our new guidance algorithm with a microscopic traffic model in order to have the effect of the traffic dynamics on the robust route calculation