Submitted by Sarah Morganna Matos Marinho (sarah.momm@gmail.com) on 2015-04-30T14:02:36Z No. of bitstreams: 1 Marinho, Sarah. Como são os laços do capitalismo brasileiro?.pdf: 5894212 bytes, checksum: b21e82cd1bbbfcf9fd6fec3cafe9196f (MD5) / Approved for entry into archive by Suzinei Teles Garcia Garcia (suzinei.garcia@fgv.br) on 2015-04-30T18:42:44Z (GMT) No. of bitstreams: 1 Marinho, Sarah. Como são os laços do capitalismo brasileiro?.pdf: 5894212 bytes, checksum: b21e82cd1bbbfcf9fd6fec3cafe9196f (MD5) / Made available in DSpace on 2015-05-04T12:38:06Z (GMT). No. of bitstreams: 1 Marinho, Sarah. Como são os laços do capitalismo brasileiro?.pdf: 5894212 bytes, checksum: b21e82cd1bbbfcf9fd6fec3cafe9196f (MD5) Previous issue date: 2015-04-01 / O BNDES tem o objetivo de financiar empreendimentos que se relacionem com o desenvolvimento do país, sendo uma de suas modalidades o investimento por subscrição de ações. De um lado, tem-se que as regras elaboradas na estruturação societária de uma empresa podem variar de acordo com a origem do financiamento obtido, em função dos interesses que os diferentes investidores procuram proteger a partir da separação entre a sua propriedade e o controle. Por outro lado, o cenário econômico brasileiro passou por mudanças profundas nos últimos 60 anos, já que o modelo de industrialização baseado no dirigismo estatal – que marcou as décadas de 1950 a 1980 – transformou-se com o movimento de desestatização dos anos 1990. O Estado não se afastou da propriedade empresarial, mas atua agora principalmente como acionista minoritário. Hoje, paira dúvida acerca, em primeiro lugar, das reais motivações que levam determinadas empresas a receber participação do Sistema BNDES. Além disso, há pouca compreensão sobre os veículos jurídicos que viabilizam essas relações público-privadas. A partir de algumas pesquisas sobre o banco, conclui-se que a atuação da sua subsidiária de participações, a BNDESPAR, não ultrapassa objetivos de maximização de valor dos seus ativos. Não se descartou, no entanto, que a função do banco de desenvolvimento – incluindo a do seu braço de renda variável – fosse implementar políticas industriais, por mais que falhas pudessem vir a ocorrer nesse intento, reconhecido como um processo experimental. Assim, revelou-se quais interesses as regras de governança corporativa das companhias abertas financiadas pela BNDESPAR por participação acomodam para a subsidiária, elucidando-se importantes características do modelo contemporâneo de atuação empresarial do Estado e lançando-se luz sobre os objetivos que o levam a investir diretamente como acionista no cenário atual. No caso da BNDESPAR, trata-se de agente em busca de equilíbrio entre a maximização de retornos e a política industrial. De uma maneira mais geral, o BNDES procura ser auto-sustentável – como pré-requisito para existir e cumprir sua missão –, tratando sua subsidiária como a principal personagem desse objetivo dentro do Sistema. A BNDESPAR, por sua vez, acabou por se tornar executora de política voltada a apoiar a negociação das companhias brasileiras no mercado de capitais – atividade emanada da sua própria burocracia. / BNDES has the objective of financing projects related to Brazil’s development and equity purchases are one of its types of investment. On one hand, rules drawn up in a company’s corporate governance structure can vary according to the capital’s origin, since different interests that different investors seek to protect emerge from the separation of their property from the corporate control. On the other hand, Brazilian economic scenario went trough deep changes over the last 60 years, considering that the industrialization model based on State intervention, mainstream between the 1950s and the 1980s, was transformed by the privatization movement in the 1990s. This change, however, did not eliminate the State in corporate property: now it only acts more commonly as a minority shareholder. The present time is marked by doubt over the real motivation that leads some companies to receive equity investments by the BNDES System. Besides that, there is a lack of comprehension on the contractual vehicles that structure these public-private relations. Some researches concerning the bank indicate that its subsidiary investments would not undermine the objective for profit maximization. We have not ignored, however, that the development bank function – including its equity arm – might be executing industrial policies, even though failures are likely to occur during this effort, understood here as an experimental process. Thus, the research has revealed which BNDESPAR’s interests are protected through the corporate governance rules of the public traded companies invested, also revealing important features of the contemporary model of the State as an entrepreneur and clarifying some objectives that could lead the institution to purchase equity participations nowadays. BNDESPAR is an agent motivated by a balance pursuit between profit maximization and industrial policy purposes. Broadly speaking, BNDES seeks self-financial sustainability in order to continue and accomplish its mission, seeing its equity arm as the main executor of this objective inside its System. In this search for sustainability, BNDESPAR became executor of a policy effort for stock markets negotiation raised up among its own bureaucracy activities.

Submitted by Paulo César Coimbra Lisbôa (pc.coimbra@gmail.com) on 2010-11-11T01:39:34Z No. of bitstreams: 1 PhD_Thesis_Coimbra_v1.pdf: 516617 bytes, checksum: c44a6f3efb7c504da91a6f20e0a95b3f (MD5) / Rejected by Andrea Virginio Machado(andrea.machado@fgv.br), reason: Conforme conversamos, peço fazer a alteração para acesso livre. Andrea on 2010-11-11T14:03:11Z (GMT) / Submitted by Paulo César Coimbra Lisbôa (pc.coimbra@gmail.com) on 2010-11-11T14:17:27Z No. of bitstreams: 1 PhD_Thesis_Coimbra_v1.pdf: 516617 bytes, checksum: c44a6f3efb7c504da91a6f20e0a95b3f (MD5) / Approved for entry into archive by Andrea Virginio Machado(andrea.machado@fgv.br) on 2010-11-16T11:21:16Z (GMT) No. of bitstreams: 1 PhD_Thesis_Coimbra_v1.pdf: 516617 bytes, checksum: c44a6f3efb7c504da91a6f20e0a95b3f (MD5) / Made available in DSpace on 2010-11-17T10:49:20Z (GMT). No. of bitstreams: 1 PhD_Thesis_Coimbra_v1.pdf: 516617 bytes, checksum: c44a6f3efb7c504da91a6f20e0a95b3f (MD5) Previous issue date: 2009-11-30 / Contaminação da confiança é um caso especial de incerteza Knightiana ou ambiguidade na qual o tomador de decisões está diante de não apenas uma única distribuição de probabilidades, mas sim de um conjunto de distribuições de probabilidades. A primeira parte desta tese tem o propósito de fornecer uma caracterização da contaminação da confiança e então apresentar um conjunto de axiomas comportamentais simples sob os quais as preferências de um tomador de decisões é representada pela utilidade esperada de Choquet com contaminação da confiança. A segunda parte desta tese apresenta duas aplicações econômicas de contaminação da confiança: a primeira delas generaliza o teorema de existência de equilíbrio de Nash de Dow e Werlang (o que permite apresentar uma solução explícita para o paradoxo segundo o qual os jogadores de um jogo do dilema dos prisioneiros com um número infinito de repetições não agem de acordo com o esperado pelo procedimento da indução retroativa) e a outra estuda o impacto da contaminação da confiança na escolha de portfolio. / Contamination of confidence is a special case of Knightian uncertainty or ambiguity in which the decision maker faces not simple probability measure but a set of probability measures. The first part of this thesis has the purpose to provide a characterization of the contamination of confidence and then present a simple set of behavioral axioms under which the decision maker’s preference is represented by the Choquet expected utility with contamination of confidence. The second part of this thesis presents two economic applications of the contamination of confidence: the first of them generalizes Dow and Werlang’s existence Theorem of Nash equilibrium under uncertainty (which enables to present an explicit solution to the paradox on which players in a finitely repeated prisoners’ dilemma breaks down backward induction) and the other studies the impact of the contamination of confidence in the portfolio choice.

Nous proposons deux nouvelles approches pour les systèmes de recommandation et les réseaux. Dans la première partie, nous donnons d’abord un aperçu sur les systèmes de recommandation avant de nous concentrer sur les approches de rang faible pour la complétion de matrice. En nous appuyant sur une approche probabiliste, nous proposons de nouvelles fonctions de pénalité sur les valeurs singulières de la matrice de rang faible. En exploitant une représentation de modèle de mélange de cette pénalité, nous montrons qu’un ensemble de variables latentes convenablement choisi permet de développer un algorithme espérance-maximisation afin d’obtenir un maximum a posteriori de la matrice de rang faible complétée. L’algorithme résultant est un algorithme à seuillage doux itératif qui adapte de manière itérative les coefficients de réduction associés aux valeurs singulières. L’algorithme est simple à mettre en œuvre et peut s’adapter à de grandes matrices. Nous fournissons des comparaisons numériques entre notre approche et de récentes alternatives montrant l’intérêt de l’approche proposée pour la complétion de matrice à rang faible. Dans la deuxième partie, nous présentons d’abord quelques prérequis sur l’approche bayésienne non paramétrique et en particulier sur les mesures complètement aléatoires et leur extension multivariée, les mesures complètement aléatoires composées. Nous proposons ensuite un nouveau modèle statistique pour les réseaux creux qui se structurent en communautés avec chevauchement. Le modèle est basé sur la représentation du graphe comme un processus ponctuel échangeable, et généralise naturellement des modèles probabilistes existants à structure en blocs avec chevauchement au régime creux. Notre construction s’appuie sur des vecteurs de mesures complètement aléatoires, et possède des paramètres interprétables, chaque nœud étant associé un vecteur représentant son niveau d’affiliation à certaines communautés latentes. Nous développons des méthodes pour simuler cette classe de graphes aléatoires, ainsi que pour effectuer l’inférence a posteriori. Nous montrons que l’approche proposée peut récupérer une structure interprétable à partir de deux réseaux du monde réel et peut gérer des graphes avec des milliers de nœuds et des dizaines de milliers de connections. / We propose two novel approaches for recommender systems and networks. In the first part, we first give an overview of recommender systems and concentrate on the low-rank approaches for matrix completion. Building on a probabilistic approach, we propose novel penalty functions on the singular values of the low-rank matrix. By exploiting a mixture model representation of this penalty, we show that a suitably chosen set of latent variables enables to derive an expectation-maximization algorithm to obtain a maximum a posteriori estimate of the completed low-rank matrix. The resulting algorithm is an iterative soft-thresholded algorithm which iteratively adapts the shrinkage coefficients associated to the singular values. The algorithm is simple to implement and can scale to large matrices. We provide numerical comparisons between our approach and recent alternatives showing the interest of the proposed approach for low-rank matrix completion. In the second part, we first introduce some background on Bayesian nonparametrics and in particular on completely random measures (CRMs) and their multivariate extension, the compound CRMs. We then propose a novel statistical model for sparse networks with overlapping community structure. The model is based on representing the graph as an exchangeable point process, and naturally generalizes existing probabilistic models with overlapping block-structure to the sparse regime. Our construction builds on vectors of CRMs, and has interpretable parameters, each node being assigned a vector representing its level of affiliation to some latent communities. We develop methods for simulating this class of random graphs, as well as to perform posterior inference. We show that the proposed approach can recover interpretable structure from two real-world networks and can handle graphs with thousands of nodes and tens of thousands of edges.

Fundação de Amparo a Pesquisa do Estado de Minas Gerais / This work investigates the operation of three phase induction motors in field weakening and high speed regions. Maximum torque per ampère is imposed by using an indirect vector control strategy. Mathematical models that accounts for magnetic saturation is used for simulations and adjustment of controllers used in control algorithm. The driving structure is characterized by the use of VSI static converter with sinusoidal PWM switching strategy and a vector control technique based on orthogonal components. Investigations resulted in the development of a digital simulation using discrete models that turned out generic and reliable, and an experimental system using a low cost fixed point DSP platform. Simulated and experimental results are included and shown the robustness and efficiency of the proposed control system under different operating conditions. / O presente trabalho tem como objetivo estudar a operação de motores de indução trifásicos em regime de enfraquecimento de campo e altas velocidades, com maximização do conjugado por ampère, através de um sistema de acionamento vetorial. Para tanto, foi utilizado uma modelagem matemática completa, por fase, que emprega o conceito de função harmônica magnética e considera as componentes, fundamental e de terceiro harmônico do fluxo de entreferro. A estrutura de acionamento caracteriza-se pela utilização de um inversor de tensão PWM senoidal e da técnica de controle vetorial, esta baseada em componentes ortogonais. A evolução do trabalho resultou no desenvolvimento de uma plataforma de simulação computacional baseada em modelos discretos que é bastante genérica e confiável, e um sistema experimental utilizando um processador digital de sinais de baixo custo com aritmética de ponto fixo. Os resultados de simulação e experimentais que avaliam a eficiência do sistema de controle proposto sob diversas condições de operação e efeitos de dessintonia são apresentados e apontam para robustez do método. / Doutor em Ciências

Em ecologia, o comportamento dos animais é freqüentemente estudado para entender melhor suas preferências por diferentes tipos de alimento e habitat. O presente trabalho esta relacionado a este tópico, dividindo-se em três capítulos. O primeiro capitulo refere-se à estimação da função da probabilidade da seleção de recurso (RSPF) comparado com um modelo de escolha discreta (DCM) com uma escolha, usando as estatísticas qui-quadrado para obter as estimativas. As melhores estimativas foram obtidas pelo método DCM com uma escolha. No entanto, os animais não fazem a sua seleção baseados apenas em uma escolha. Com RSPF, as estimativas de máxima verossimilhança, usadas pela regressão logística ainda não atingiram os objetivos, já que os animais têm mais de uma escolha. R e o software Minitab e a linguagem de programação Fortran foram usados para obter os resultados deste capítulo. No segundo capítulo discutimos mais a verossimilhança do primeiro capítulo. Uma nova verossimilhança para a RSPF é apresentada, a qual considera as unidades usadas e não usadas, e métodos de bootstrapping paramétrico e não paramétrico são usados para estudar o viés e a variância dos estimadores dos parâmetros, usando o programa FORTRAN para obter os resultados. No terceiro capítulo, a nova verossimilhança apresentada no capítulo 2 é usada com um modelo de escolha discreta, para resolver parte do problema apresentado no primeiro capítulo. A estrutura de encaixe é proposta para modelar a seleção de habitat de 28 corujas manchadas (Strix occidentalis), assim como a uma generalização do modelo logit encaixado, usando a maximização da utilidade aleatória e a RSPF aleatória. Métodos de otimização numérica, e o sistema computacional SAS, são usados para estimar os parâmetros de estrutura de encaixe. / In ecology, the behavior of animals is often studied to better understand their preferences for different types of habitat and food. The present work is concerned with this topic. It is divided into three chapters. The first concerns the estimation of a resource selection probability function (RSPF) compared with a discrete choice model (DCM) using chi-squared to obtain estimates. The best estimates were obtained by the DCM method. Nevertheless, animals were not selected based on choice alone. With RSPF, the maximum likelihood estimates used with the logistic regression still did not reach the objectives, since the animals have more than one choice. R and Minitab software and the FORTRAN programming language were used for the computations in this chapter. The second chapter discusses further the likelihood presented in the first chapter. A new likelihood for a RSPF is presented, which takes into account the units used and not used, and parametric and non-parametric bootstrapping are employed to study the bias and variance of parameter estimators, using a FORTRAN program for the calculations. In the third chapter, the new likelihood presented in chapter 2, with a discrete choice model is used to resolve a part of the problem presented in the first chapter. A nested structure is proposed for modelling selection by 28 spotted owls (Strix occidentalis) as well as a generalized nested logit model using random utility maximization and a random RSPF. Numerical optimization methods and the SAS system were employed to estimate the nested structural parameters.

Resource allocation in wireless networks is one of the most studied class of problems. Generally, these problems are formulated as utility maximization problems under relevant constraints. The challenges posed by these problems vary widely depending on the nature of the utility function under consideration. Recently, the widespread prevalence of wireless devices prompted researchers and engineers to delve into the security issues of wireless communication. As compared to the wired medium, ensuring security for the wireless medium is more challenging mainly due to the broadcast nature of the transmission. But the ongoing research on physical layer security promises robust and reliable security schemes for wireless communication. Contrary to conventional cryptographic schemes, physical layer security techniques are impregnable as the security is ensured by the inherent randomness present in the wireless medium. In this thesis, we consider several wireless scenarios and propose secrecy enhancing resource allocation schemes for them in the first few chapters. We initially address the problem of secure transmission by following the conventional approach in the secrecy literature|secrecy rate maximization. Needless to say, in these chapters, secrecy rate is the utility function and the constraints are posed by the available power budget. Then we consider a pragmatic approach where we target the signal-to-noise ratio (SNR) of participating nodes and ensure information secrecy by appropriately constraining the SNRs of those nodes. In those SNR based formulations, SNR at the destination is the utility function and we are interested in maximizing it. In the last two chapters, we study two scenarios in a non-secrecy setting. In one of them, end-to-end data rate is the utility, whereas, in the other one, two utility functions|based on revenue generated|are defined for two rational agents in a game-theoretic setting. In the second chapter, we study parallel independent Gaussian channels with imperfect channel state information (CSI) for the eavesdropper. Firstly, we evaluate the probability of zero secrecy rate in this system for (i) given instantaneous channel conditions and (ii) a Rayleigh fading scenario. Secondly, when non-zero secrecy is achievable in the low SNR regime, we aim to solve a robust power allocation problem which minimizes the outage probability at a target secrecy rate. In the third, fourth and fifth chapters, we consider scenarios where the source node transmits a message to the destination using M parallel amplify-and-forward (AF) relays in the presence of a single or multiple eavesdroppers. The third chapter addresses the problem of the maximum achievable secrecy rate for two specific network models: (a) degraded eavesdropper channel with complex channel gain and (b) scaled eavesdropper channel with real-valued channel gains. In the fourth chapter, we consider the SNR based approach and address two problems: (i) SNR maximization at the destination and (ii) Total relay power minimization. In the fifth chapter, we assume that the relay nodes are untrusted and to counter them, we deliberately introduce artificial noise in the source message. For this model, we propose and solve SNR maximization problems for the following two scenarios: (i) Total power constraint on all the relay nodes and (ii) Individual power constraints on each of the relay nodes. In the sixth chapter, we address the problem of passive eavesdroppers in multi-hop wire-less networks using the technique of friendly jamming. Assuming decode-and-forward (DF) relaying, we consider a scheduling and power allocation (PA) problem for a multiple-source multiple-sink scenario so that eavesdroppers are jammed, and source-destination throughput targets are met. When channel state information (CSI) of all the node are available, we intend to minimize the total power consumption of all the transmitting nodes. In the absence of eavesdroppers CSI, we minimize vulnerability region of the network. In chapter seven, the problem of cooperative beamforming for maximizing the achievable data rate of two-hop amplify-and-forward (AF) network (in the absence of eavesdropper(s)) is considered. Along with an individual power constraint on each of the relay nodes, we consider a weighted sum power constraint. To solve this problem, we propose a novel algorithm based on the Quadratic Eigenvalue Problem (QEP) and discuss its convergence. In chapter eight, we study a Stackelberg game between a base station and a multi-antenna power beacon for wireless energy harvesting in a multiple sensor node scenario. Assuming imperfect CSI between the sensor nodes and the power beacon, we propose a utility function that is based on throughput non-outage probability at the base station. We find the optimal strategies for the base station and the power beacon that maximize their respective utility functions.

Introduction: No Fixed-Dose Combination (FDC) formulations currently exist for pediatric tuberculosis (TB) treatment. Earlier work implemented, in the software NONMEM, a rational method for optimizing design and individualization of pediatric anti-TB FDC formulations based on patient body weight, but issues with parameter estimation, dosage strata heterogeneity and representative pharmacokinetics remained. Aim: To further develop the rational model-based methodology aiding the selection of appropriate FDC formulation designs and dosage regimens, in pediatric TB treatment. Materials and Methods: Optimization of the method with respect to the estimation of body weight breakpoints was sought. Heterogeneity of dosage groups with respect to treatment efficiency was sought to be improved. Recently published pediatric pharmacokinetic parameters were implemented and the model translated to MATLAB, where also the performance was evaluated by stochastic estimation and graphical visualization. Results: A logistic function was found better suited as an approximation of breakpoints. None of the estimation methods implemented in NONMEM were more suitable than the originally used FO method. Homogenization of dosage group treatment efficiency could not be solved. MATLAB translation was successful but required stochastic estimations and highlighted high densities of local minima. Representative pharmacokinetics were successfully implemented. Conclusions: NONMEM was found suboptimal for the task due to problems with discontinuities and heterogeneity, but a stepwise method with representative pharmacokinetics were successfully implemented. MATLAB showed more promise in the search for a method also addressing the heterogeneity issue.

Depuis la publication de l'ouvrage de Choquet (1955), la théorie d'espérance non linéaire a attiré avec grand intérêt des chercheurs pour ses applications potentielles dans les problèmes d'incertitude, les mesures de risque et le super-hedging en finance. Shige Peng a construit une sorte d'espérance entièrement non linéaire dynamiquement cohérente par l'approche des EDP. Un cas important d'espérance non linéaire cohérente en temps est la G-espérance, dans laquelle le processus canonique correspondant (B_{t})_{t≥0} est appelé G-mouvement brownien et joue un rôle analogue au processus de Wiener classique. L'objectif de cette thèse est d'étudier, dans le cadre de la G-espérance, certaines équations différentielles stochastiques rétrogrades (G-EDSR) à croissance quadratique avec applications aux problèmes de maximisation d'utilité robuste avec incertitude sur les modèles, certaines équations différentielles stochastiques (G-EDS) réfléchies et équations différentielles stochastiques rétrogrades réfléchies avec générateurs lipschitziens. On considère d'abord des G-EDSRs à croissance quadratique. Dans le Chapitre 2 nous fournissons un resultat d'existence et unicité pour des G-EDSRs à croissance quadratique. D'une part, nous établissons des estimations a priori en appliquant le théorème de type Girsanov, d'où l'on en déduit l'unicité. D'autre part, pour prouver l'existence de solutions, nous avons d'abord construit des solutions pour des G-EDSRs discretes en résolvant des EDPs non-linéaires correspondantes, puis des solutions pour les G-EDSRs quadratiques générales dans les espaces de Banach. Dans le Chapitre 3 nous appliquons les G-EDSRs quadratiques aux problèmes de maximisation d'utilité robuste. Nous donnons une caratérisation de la fonction valeur et une stratégie optimale pour les fonctions d'utilité exponentielle, puissance et logarithmique. Dans le Chapitre 4, nous traitons des G-EDSs réfléchies multidimensionnelles. Nous examinons d'abord la méthode de pénalisation pour résoudre des problèmes de Skorokhod déterministes dans des domaines non convexes et établissons des estimations pour des fonctions α-Hölder continues. A l'aide de ces résultats obtenus pour des problèmes déterministes, nous définissons le G-mouvement Brownien réfléchi et prouvons son existence et son unicité dans un espace de Banach. Ensuite, nous prouvons l'existence et l'unicité de solution pour les G-EDSRs multidimensionnelles réfléchies via un argument de point fixe. Dans le Chapitre 5, nous étudions l'existence et l'unicité pour les équations différentielles stochastiques rétrogrades réfléchies dirigées par un G-mouvement brownien lorsque la barrière S est un processus de G-Itô. / Since the publication of Choquet's (1955) book, the theory of nonlinear expectation has attracted great interest from researchers for its potential applications in uncertainty problems, risk measures and super-hedging in finance. Shige Peng has constructed a kind of fully nonlinear expectation dynamically coherent by the PDE approach. An important case of time-consistent nonlinear expectation is G-expectation, in which the corresponding canonical process (B_{t})_{t≥0} is called G-Brownian motion and plays a similar role to the classical Wiener process. The objective of this thesis is to study, in the framework of the G-expectation, some backward stochastic differential equations (G-BSDE) under a quadratic growth condition on their coefficients with applications to robust utility maximization problems with uncertainty on models, Reflected stochastic differential equations (reflected G-SDE) and reflected backward stochastic differential equations with Lipschitz coefficients (reflected G-BSDE). We first consider G-BSDE with quadratic growth. In Chapter 2 we provide a result of existence and uniqueness for quadratic G-BSDEs. On the one hand, we establish a priori estimates by applying the Girsanov-type theorem, from which we deduce the uniqueness. On the other hand, to prove the existence of solutions, we first constructed solutions for discrete G-BSDEs by solving corresponding nonlinear PDEs, then solutions for the general quadratic G-BSDEs in the spaces of Banach. In Chapter 3 we apply quadratic G-BSDE to robust utility maximization problems. We give a characterization of the value function and an optimal strategy for exponential, power and logarithmic utility functions. In Chapter 4, we discuss multidimensional reflected G-SDE. We first examine the penalization method to solve deterministic Skorokhod problems in non-convex domains and establish estimates for continuous α-Hölder functions. Using these results for deterministic problems, we define the reflected G-Brownian motion and prove its existence and its uniqueness in a Banach space. Then we prove the existence and uniqueness of the solution for the multidimensional reflected G-SDE via a fixed point argument. In Chapter 5, we study the existence and uniqueness of the reflected backward stochastic differential equations driven by a G-Brownian motion when the obstacle S is a G-Itô process.

Cette thèse est composée de deux parties indépendantes : la première partie traite des équations différentielles stochastiques dans le cadre de la G-espérance, tandis que la deuxième partie présente les résultats obtenus pour les équations différentielles stochastiques du seconde ordre. Dans un premier temps, on considère les intégrales stochastiques par rapport à un processus croissant, et on donne une extension de la formule d'Itô dans le cadre de la G-espérance. Ensuite, on étudie une classe d'équations différentielles stochastiques réfléchies unidimensionnelles dirigées par un G-mouvement brownien. Dans la suite, en utilisant une méthode de localisation, on prouve l'existence et l'unicité de solutions pour les équations différentielles stochastiques dirigées par un G-mouvement brownien, dont les coefficients sont localement lipschitziens. Enfin, dans le même cadre, on discute des problèmes de réflexion multidimensionnelle et on fournit quelques résultats de convergence. Dans un deuxième temps, on étudie une classe d'équations différentielles stochastiques rétrogrades du seconde ordre à croissance quadratique. Le but de ce travail est de généraliser le résultat obtenu par Possamaï et Zhou en 2012. On montre aussi l'existence et l'unicité des solutions pour ces équations, mais sous des hypothèses plus faibles. De plus, ce résultat théorique est appliqué aux problèmes de maximisation robuste de l'utilité du portefeuille en finance. / This thesis consists of two relatively independent parts : the first part concerns stochastic differential equations in the framework of the G-expectation, while the second part deals with a class of second order backward stochastic differential equations. In the first part, we first consider stochastic integrals with respect to an increasing process and give an extension of Itô's formula in the G-framework. Then, we study a class of scalar valued reflected stochastic differential equations driven by G-Brownian motion. Subsequently, we prove the existence and the uniqueness of solutions for some locally Lipschitz stochastic differential equations driven by G-Brownian motion. At the end of this part, we consider multidimensional reflected problems in the G-framework, and some convergence results are obtained. In the second part, we study the wellposedness of a class of second order backward stochastic differential equations (2BSDEs) under a quadratic growth condition on their coefficients. The aim of this part is to generalize a wellposedness result for quadratic 2BSDEs by Possamaï and Zhou in 2012. In this thesis, we work under some usual assumptions and deduce the existence and uniqueness theorem as well. Moreover, this theoretical result for quadratic 2BSDEs is applied to solve some robust utility maximization problems in finance.

En écologie des populations, les distributions spatiales d'espèces sont étudiées afin d'inférer l'existence de processus sous-jacents, tels que les interactions intra- et interspécifiques et les réponses des espèces à l'hétérogénéité de l'environnement. Nous proposons d'analyser les données spatiales multi-spécifiques sous l'angle des assemblages d'espèces, que nous considérons en termes d'abondances absolues et non de diversité des espèces. Les assemblages d'espèces sont une des signatures des interactions spatiales locales des espèces entre elles et avec leur environnement. L'étude des assemblages d'espèces peut permettre de détecter plusieurs types d'équilibres spatialisés et de les associer à l'effet de variables environnementales. Les assemblages d'espèces sont définis ici par classification non spatiale des observations multivariées d'abondances d'espèces. Les méthodes de classification basées sur les modèles de mélange ont été choisies afin d'avoir une mesure de l'incertitude de la classification et de modéliser un assemblage par une loi de probabilité multivariée. Dans ce cadre, nous proposons : 1. une méthode d'analyse exploratoire de données spatiales multivariées d'abondances d'espèces, qui permet de détecter des assemblages d'espèces par classification, de les cartographier et d'analyser leur structure spatiale. Des lois usuelles, telle que la Gaussienne multivariée, sont utilisées pour modéliser les assemblages, 2. un modèle hiérarchique pour les assemblages d'abondances lorsque les lois usuelles ne suffisent pas. Ce modèle peut facilement s'adapter à des données contenant des variables de types différents, qui sont fréquemment rencontrées en écologie, 3. une méthode de classification de données contenant des variables de types différents basée sur des mélanges de lois à structure hiérarchique (définies en 2.). Deux applications en écologie ont guidé et illustré ce travail : l'étude à petite échelle des assemblages de deux espèces de pucerons sur des feuilles de clémentinier et l'étude à large échelle des assemblages d'une plante hôte, le plantain lancéolé, et de son pathogène, l'oïdium, sur les îles Aland en Finlande / In population ecology, species spatial patterns are studied in order to infer the existence of underlying processes, such as interactions within and between species, and species response to environmental heterogeneity. We propose to analyze spatial multi-species data by defining species abundance assemblages. Species assemblages are one of the signatures of the local spatial interactions between species and with their environment. Species assemblages are defined here by a non spatial classification of the multivariate observations of species abundances. Model-based clustering procedures using mixture models were chosen in order to have an estimation of the classification uncertainty and to model an assemblage by a multivariate probability distribution. We propose : 1. An exploratory tool for the study of spatial multivariate observations of species abundances, which defines species assemblages by a model-based clustering procedure, and then maps and analyzes the spatial structure of the assemblages. Common distributions, such as the multivariate Gaussian, are used to model the assemblages. 2. A hierarchical model for abundance assemblages which cannot be modeled with common distributions. This model can be easily adapted to mixed mode data, which are frequent in ecology. 3. A clustering procedure for mixed-mode data based on mixtures of hierarchical models. Two ecological case-studies guided and illustrated this work: the small-scale study of the assemblages of two aphid species on leaves of Citrus trees, and the large-scale study of the assemblages of a host plant, Plantago lanceolata, and its pathogen, the powdery mildew, on the Aland islands in south-west Finland