Exploring the concepts of long range aerial transport of microorganisms is the main motivation of this study. For this purpose we use theories and concepts of dynamical systems in the context of geophysical fluid systems. We apply powerful notions such as finite-time Lyapunov exponent (FTLE) and the associated Lagrangian coherent structures (LCS) and we attempt to provide mathematical explanations and frameworks for some applied questions which are based on realistic concerns of atmospheric transport phenomena. Accordingly, we quantify the accuracy of prediction of FTLE-LCS features and we determine the sensitivity of such predictions to forecasting parameters. In addition, we consider the spatiotemporal resolution of the operational data sets and we propose the concept of probabilistic source and destination regions which leads to the definition of stochastic FTLE fields. Moreover, we put forward the idea of using ensemble forecasting to quantify the uncertainty of the forecast results. Finally, we investigate the statistical properties of localized measurements of atmospheric microbial structure and their connections to the concept of local FTLE time-series. Results of this study would pave the way for more efficient models and management strategies for the spread of infectious diseases affecting plants, domestic animals, and humans. / Ph. D.

Le résumé n'est pas disponible. / Le résumé n'est pas disponible.

No description available.

L'objectif de ce travail de thèse est d'étudier d'une part les spécificités de la commande nerveuse lors de la contraction excentrique en explorant les mécanismes impliqués au niveau spinal et d'autre part d'examiner les mécanismes nerveux responsables de la plasticité du système neuromusculaire après un entraînement de force excentrique sous-maximal. A travers ce travail de thèse, nous mettons en évidence la contribution de l'inhibition récurrente à la réduction de l'activation musculaire classiquement observée lors de la contraction excentrique. Par ailleurs, nous montrons que l'inhibition récurrente est majorée lors des contractions sous-maximales indépendamment du mode de contraction. Ces résultats soulignent le rôle important de l'inhibition récurrente dans la spécificité de la commande nerveuse lors de la contraction excentrique. Nous confirmons que le pilotage nerveux de la contraction excentrique peut être modulé par l'entraînement de force excentrique même si les modulations de l'excitabilité spinale semblent dépendre des caractéristiques de l'entraînement. / The purpose of this PhD research is, on the one hand, to study the neural drive specificities during eccentric contractions by exploring the neural mechanisms involved at spinal level and, on the other hand, to examine the neural mechanisms responsible for the modulations of neuromuscular system following a strength submaximal eccentric training. Through this PhD research we highlight the contribution of recurrent inhibition by the Renshaw cell to the decrease of muscular activation typically observed during eccentric contraction. Furthermore, we show that recurrent inhibition is enhanced during submaximal contractions regardless of the contraction type. These results emphasize the important role of recurrent inhibition in the specificity of neural control during eccentric contractions. We confirm that the neural drive of the eccentric contraction may be modulated by eccentric strength training although modulations of spinal excitability seem to depend on the characteristics of training.

Made available in DSpace on 2016-03-15T19:37:57Z (GMT). No. of bitstreams: 1 RICHARD JOHN LINTULAHTI OLANDIM.pdf: 2276167 bytes, checksum: 0d3c0536034c612074740ab02558a1be (MD5) Previous issue date: 2015-06-25 / In Brazil, the broadcasting system for television content in high definition is the ISDB-Tb. Although robust, the content transmission in this system, like in any radio frequency propagation, can suffer from external attenuating factors, such as distortion by multipath propagation. One of the techniques used in radio communications for minimizing the effects of this type of distortion is the spatial diversity reception, which uses multiple antennas connected to a single receiver. The signals, received by different antennas, are combined, in a technique known as MRC or Maximal Ratio Combiner, so that the output signal-to-noise ratio is greater than the individual signal-to-noise ratios, allowing the successfully decoding of the received content, even though the individual signal in each antenna does not have sufficient quality to be decoded independently. This study aims to establish a method of spatial diversity in receiving television signals in ISDB-Tb, pondering between the advantages and disadvantages of their use in edge regions of coverage, where the reception of the Brazilian digital TV system is not yet total. / No Brasil, o sistema de radiodifusão para conteúdos televisivos em alta definição é o ISDB-Tb. Apesar de robusto, a transmissão de conteúdos neste sistema, como qualquer propagação em radiofrequência, pode sofrer com fatores externos atenuantes, como por exemplo a distorção por propagação em multi-percurso. Uma das técnicas utilizadas em radiocomunicação para que se minimizem os efeitos deste tipo de distorção é a diversidade espacial na recepção, que utiliza múltiplas antenas conectadas a um mesmo receptor. Os sinais, recebidos pelas diferentes antenas, são trabalhados em uma técnica conhecida como MRC ou Combinação de Máxima Razão, de modo que a relação sinal-ruído de saída seja maior do que as relações sinal-ruído individuais, permitindo a decodificação do conteúdo com sucesso, mesmo que os sinais individuais em cada antena não tenham qualidade suficiente para serem decodificados independentemente. Este estudo tem como objetivo propor um método de diversidade espacial na recepção de sinais televisivos no padrão brasileiro ISDB-Tb, ponderando entre as vantagens e desvantagens de sua utilização em regiões de borda de cobertura, onde a recepção do sistema brasileiro de TV digital ainda não é total.

Dans une première partie de cette thèse, nous donnons des minorations universelles ne dépendant que de la dimension – explicites, de trois invariants globaux des quotients des espaces hyperboliques quaternioniques : leur rayon maximal, leur volume, ainsi que leur caractéristique d’Euler. Nous donnons également une majoration de leur constante de Margulis, montrant que celle-ci décroit au moins comme une puissance négative de la dimension. Dans une seconde partie, nous étudions un réseau remarquable des isométries du plan hyperbolique quaternionique, le groupe modulaire d’Hurwitz. Nous montrons en particulier qu’il est engendré par quatres éléments, et construisons un domaine fondamental pour le sous-groupe des isométries de ce réseau qui stabilisent un point à l’infini. / In the first part of this thesis, we derive explicit universal – that is, depending only on the dimension – lower bounds on three global invariants of quaternionic hyperbolic sapces : their maximal radius, their volume, and their Euler caracteristic. We also exhibit an upper bound on their Margulis constant, showing that this last quantity decreases at least like a negative power of the dimension. In the second part, we study a specific lattice of isometries of the quaternionic hyperbolic plane : the Hurwitz modular group. In particular, we show that this group is generated by four elements, and we construct a fundamental domain for the subgroup of isometries of this lattice stabilising a point on the boundary of the quaternionic hyperbolic plane.

We prove that there exist three distinct, comprehensive classes of (formal) contexts with polynomially many concepts. Namely: contexts which are nowhere dense, of bounded breadth or highly convex. Already present in G. Birkhoff's classic monograph is the notion of breadth of a lattice; it equals the number of atoms of a largest boolean suborder. Even though it is natural to define the breadth of a context as being that of its concept lattice, this idea had not been exploited before. We do this and establish many equivalences. Amongst them, it is shown that the breadth of a context equals the size of its largest minimal generator, its largest contranominal-scale subcontext, as well as the Vapnik-Chervonenkis dimension of both its system of extents and of intents. The polynomiality of the aforementioned classes is proven via upper bounds (also known as majorants) for the number of maximal bipartite cliques in bipartite graphs. These are results obtained by various authors in the last decades. The fact that they yield statements about formal contexts is a reward for investigating how two established fields interact, specifically Formal Concept Analysis (FCA) and graph theory. We improve considerably the breadth bound. Such improvement is twofold: besides giving a much tighter expression, we prove that it limits the number of minimal generators. This is strictly more general than upper bounding the quantity of concepts. Indeed, it automatically implies a bound on these, as well as on the number of proper premises. A corollary is that this improved result is a bound for the number of implications in the canonical basis too. With respect to the quantity of concepts, this sharper majorant is shown to be best possible. Such fact is established by constructing contexts whose concept lattices exhibit exactly that many elements. These structures are termed, respectively, extremal contexts and extremal lattices. The usual procedure of taking the standard context allows one to work interchangeably with either one of these two extremal structures. Extremal lattices are equivalently defined as finite lattices which have as many elements as possible, under the condition that they obey two upper limits: one for its number of join-irreducibles, other for its breadth. Subsequently, these structures are characterized in two ways. Our first characterization is done using the lattice perspective. Initially, we construct extremal lattices by the iterated operation of finding smaller, extremal subsemilattices and duplicating their elements. Then, it is shown that every extremal lattice must be obtained through a recursive application of this construction principle. A byproduct of this contribution is that extremal lattices are always meet-distributive. Despite the fact that this approach is revealing, the vicinity of its findings contains unanswered combinatorial questions which are relevant. Most notably, the number of meet-irreducibles of extremal lattices escapes from control when this construction is conducted. Aiming to get a grip on the number of meet-irreducibles, we succeed at proving an alternative characterization of these structures. This second approach is based on implication logic, and exposes an interesting link between number of proper premises, pseudo-extents and concepts. A guiding idea in this scenario is to use implications to construct lattices. It turns out that constructing extremal structures with this method is simpler, in the sense that a recursive application of the construction principle is not needed. Moreover, we obtain with ease a general, explicit formula for the Whitney numbers of extremal lattices. This reveals that they are unimodal, too. Like the first, this second construction method is shown to be characteristic. A particular case of the construction is able to force - with precision - a high number of (in the sense of "exponentially many'') meet-irreducibles. Such occasional explosion of meet-irreducibles motivates a generalization of the notion of extremal lattices. This is done by means of considering a more refined partition of the class of all finite lattices. In this finer-grained setting, each extremal class consists of lattices with bounded breadth, number of join irreducibles and meet-irreducibles as well. The generalized problem of finding the maximum number of concepts reveals itself to be challenging. Instead of attempting to classify these structures completely, we pose questions inspired by Turán's seminal result in extremal combinatorics. Most prominently: do extremal lattices (in this more general sense) have the maximum permitted breadth? We show a general statement in this setting: for every choice of limits (breadth, number of join-irreducibles and meet-irreducibles), we produce some extremal lattice with the maximum permitted breadth. The tools which underpin all the intuitions in this scenario are hypergraphs and exact set covers. In a rather unexpected, but interesting turn of events, we obtain for free a simple and interesting theorem about the general existence of "rich'' subcontexts. Precisely: every context contains an object/attribute pair which, after removed, results in a context with at least half the original number of concepts.

[pt] Iniciamos o trabalho com uma revisão da classificação de álgebras de Lie semi-simples sobre corposo algebraicamente fechados de caracteristica zero a traves dos Diagramas de Dyinkin. Posteriormente estudamos sigma - sistemas normais e classificamos eles a traves de diagramas de Satake. Finalmente estudamos a estrutura das formas reais de álgebras de Lie semi-simples complexas, explicitando a conexão com os diagramas de Satake e fornecenendo assim uma classificação das mesmas. / [en] We begin the work with a review of the classification of semisimple Lie algebras over an algebraically field of characteristic zero through the Dyinkin Diagrams. Subsequently we study sigma - normal systems and classify them through Satake diagrams. Finally we study the structure of the real forms of complex semi-simple Lie algebras, explaining the connection with the Satake diagrams and thus providing a classification of them.

We prove that there exist three distinct, comprehensive classes of (formal) contexts with polynomially many concepts. Namely: contexts which are nowhere dense, of bounded breadth or highly convex. Already present in G. Birkhoff's classic monograph is the notion of breadth of a lattice; it equals the number of atoms of a largest boolean suborder. Even though it is natural to define the breadth of a context as being that of its concept lattice, this idea had not been exploited before. We do this and establish many equivalences. Amongst them, it is shown that the breadth of a context equals the size of its largest minimal generator, its largest contranominal-scale subcontext, as well as the Vapnik-Chervonenkis dimension of both its system of extents and of intents. The polynomiality of the aforementioned classes is proven via upper bounds (also known as majorants) for the number of maximal bipartite cliques in bipartite graphs. These are results obtained by various authors in the last decades. The fact that they yield statements about formal contexts is a reward for investigating how two established fields interact, specifically Formal Concept Analysis (FCA) and graph theory. We improve considerably the breadth bound. Such improvement is twofold: besides giving a much tighter expression, we prove that it limits the number of minimal generators. This is strictly more general than upper bounding the quantity of concepts. Indeed, it automatically implies a bound on these, as well as on the number of proper premises. A corollary is that this improved result is a bound for the number of implications in the canonical basis too. With respect to the quantity of concepts, this sharper majorant is shown to be best possible. Such fact is established by constructing contexts whose concept lattices exhibit exactly that many elements. These structures are termed, respectively, extremal contexts and extremal lattices. The usual procedure of taking the standard context allows one to work interchangeably with either one of these two extremal structures. Extremal lattices are equivalently defined as finite lattices which have as many elements as possible, under the condition that they obey two upper limits: one for its number of join-irreducibles, other for its breadth. Subsequently, these structures are characterized in two ways. Our first characterization is done using the lattice perspective. Initially, we construct extremal lattices by the iterated operation of finding smaller, extremal subsemilattices and duplicating their elements. Then, it is shown that every extremal lattice must be obtained through a recursive application of this construction principle. A byproduct of this contribution is that extremal lattices are always meet-distributive. Despite the fact that this approach is revealing, the vicinity of its findings contains unanswered combinatorial questions which are relevant. Most notably, the number of meet-irreducibles of extremal lattices escapes from control when this construction is conducted. Aiming to get a grip on the number of meet-irreducibles, we succeed at proving an alternative characterization of these structures. This second approach is based on implication logic, and exposes an interesting link between number of proper premises, pseudo-extents and concepts. A guiding idea in this scenario is to use implications to construct lattices. It turns out that constructing extremal structures with this method is simpler, in the sense that a recursive application of the construction principle is not needed. Moreover, we obtain with ease a general, explicit formula for the Whitney numbers of extremal lattices. This reveals that they are unimodal, too. Like the first, this second construction method is shown to be characteristic. A particular case of the construction is able to force - with precision - a high number of (in the sense of "exponentially many'') meet-irreducibles. Such occasional explosion of meet-irreducibles motivates a generalization of the notion of extremal lattices. This is done by means of considering a more refined partition of the class of all finite lattices. In this finer-grained setting, each extremal class consists of lattices with bounded breadth, number of join irreducibles and meet-irreducibles as well. The generalized problem of finding the maximum number of concepts reveals itself to be challenging. Instead of attempting to classify these structures completely, we pose questions inspired by Turán's seminal result in extremal combinatorics. Most prominently: do extremal lattices (in this more general sense) have the maximum permitted breadth? We show a general statement in this setting: for every choice of limits (breadth, number of join-irreducibles and meet-irreducibles), we produce some extremal lattice with the maximum permitted breadth. The tools which underpin all the intuitions in this scenario are hypergraphs and exact set covers. In a rather unexpected, but interesting turn of events, we obtain for free a simple and interesting theorem about the general existence of "rich'' subcontexts. Precisely: every context contains an object/attribute pair which, after removed, results in a context with at least half the original number of concepts.

This thesis is an account of our study of two branches of dynamical systems theory, namely the mean and pointwise ergodic theory. In our work on mean ergodic theorems, we investigate the spectral theory of integrable actions of a locally compact abelian group on a locally convex vector space. We start with an analysis of various spectral subspaces induced by the action of the group. This is applied to analyse the spectral theory of operators on the space generated by measures on the group. We apply these results to derive general Tauberian theorems that apply to arbitrary locally compact abelian groups acting on a large class of locally convex vector spaces which includes Fr echet spaces. We show how these theorems simplify the derivation of Mean Ergodic theorems. Next we turn to the topic of pointwise ergodic theorems. We analyse the Transfer Principle, which is used to generate weak type maximal inequalities for ergodic operators, and extend it to the general case of -compact locally compact Hausdor groups acting measure-preservingly on - nite measure spaces. We show how the techniques developed here generate various weak type maximal inequalities on di erent Banach function spaces, and how the properties of these function spaces in- uence the weak type inequalities that can be obtained. Finally, we demonstrate how the techniques developed imply almost sure pointwise convergence of a wide class of ergodic averages. Our investigations of these two parts of ergodic theory are uni ed by the techniques used - locally convex vector spaces, harmonic analysis, measure theory - and by the strong interaction of the nal results, which are obtained in greater generality than hitherto achieved. / PhD (Mathematics), North-West University, Potchefstroom Campus, 2014