Dans ce mémoire, nous nous intéressons aux surfaces de translation. Ce sont des surfaces compactes munies d'une métrique plate, qui possèdent des singularités coniques et sur lesquelles, on peut choisir une direction verticale. De manière équivalente, une surface de translation est aussi une 1-forme holomorphe sur une surface de Riemann. Des exemples majeurs de telles surfaces sont les surfaces obtenues par “ dépliage ” de billards rationnels.Nous identifions deux surfaces de translation images l'une de l'autre par une isométrie préservant l'orientation et la direction verticale. La classe d'une surface par cette relation d'équivalence est encore une surface de translation que l'on appelle surface réduite de la surface de départ.Nous définissons les difféomorphismes affines d'une surface de translation comme les difféomorphismes de cette surface dont la différentielle est constante. Ils forment un groupe appelé le groupe affine de la surface.Le groupe SL(2,IR) agit linéairement sur l'ensemble des surfaces de translation. Le stabilisateur de la surface réduite d'une surface de translation est appelé le groupe de Veech de la surface de translation. Les éléments du groupe de Veech sont en fait les matrices jacobiennes des difféomorphismes affines. Ce groupe est un outil indispensable dans l'étude des surfaces de translation et notre travail en est une illustration. Si le groupe de Veech est un réseau de SL(2,IR), la surface est appelée surface de Veech.L'objectif de ce mémoire est de démontrer que, sur une surface de Veech donnée, les orbites denses du groupe affine s'équirépartissent sur la surface. Nous précisons bien sûr la notion d'équirépartition utilisée. Il est important de noter que les orbites qui ne sont pas denses sont finies et qu'il y en a au plus un nombre dénombrable. Ce résultat est d'abord établi pour la surface réduite de la surface de translation et permet d'en déduire le théorème pour la surface de départ. / In this thesis, we study translation surfaces. These are compact surfaces equipped with a flat metric and conical singularities. A vertical direction is fixed. Translation surfaces are in one to one correspondence with holomorphic 1-forms on Riemann surfaces. Important examples of translation surfaces arise from unfolding billiards in rational polygons.Two translation surfaces are identified if they are obtained one from the other by an isometry preserving the orientation and the vertical direction. The equivalence class of a surface is still a translation surface called the reduced surface. Affine diffeomorphisms on a translation surface are diffeomorphisms whose differential is constant. They form a group called the affine group. The group SL(2,R) acts linearly on the set of translation surfaces. The stabilizer of the reduced surface is the Veech group of the translation surface. The elements of the Veech group are in fact the derivative of the affine diffeomorphisms. This group is of great importance in the study of translation surfaces and our work illustrate this phenomenon. If the Veech group is a lattice in SL(2,R), the surface is called a Veech surface. The goal of this thesis is to prove that dense orbit of the affine group on a Veech surface are equidistributed in the surface. One has to explain precisely what equidistribution means in this context. It is important to notice that non dense orbits are finite and that the number of these orbits is at most countable. The result is first of all established for reduced surfaces and we deduce a general result for all surfaces.

As álgebras TKK afins estendidas pertencem à classe de álgebras de Lie chamada álgebras de Lie afins estendidas do tipo $A_1$. Elas são obtidas a partir de um semi-reticulado do $\\mathbbR^n$. Estudamos a estrutura dos módulos tipo Verma sobre a álgebra TKK afim estendida para um semi-reticulado (não-reticulado) do $\\mathbbR^2$. Quando fixamos um conjunto positivo de raízes isotrópicas chamado standard encontramos quatro órbitas da subálgebra de Borel que dão origem a distintos módulos tipo Verma sobre a álgebra TKK afim estendida. Estudamos as estruturas de seus submódulos e encontramos critérios de irredutibilidade para os módulos de Verma clássico e imaginário. / The extended affine TKK Lie algebras belong to a class of Lie algebras called extended affine Lie algebras of type $A_1$. They are obtained from a semilattice on $\\mathbbR^n$. We studied the structure of the Verma type modules for the extended affine TKK algebra obtained from a semi-lattice (non-lattice) on $\\mathbbR^2$. Fixing a set of positive isotropic roots called standard we found four orbits of the Borel subalgebra each of which give distinct Verma modules for the extended affine TKK algebra. We studied the structures of their submodules and found a criteria for irreducibility for the classic and imaginary Verma modules.

In this thesis, we develop a feedback-invariant theory of local controllability for affine distributions. We begin by developing an unexplored notion in control theory that we call proper small-time local controllability (PSTLC). The notion of PSTLC is developed for an abstraction of the well-known notion of a control-affine system, which we call an affine system. Associated to every affine system is an affine distribution, an adaptation of the notion of a distribution. Roughly speaking, an affine distribution is PSTLC if the local behaviour of every affine system that locally approximates the affine distribution is locally controllable in the standard sense. We prove that, under a regularity condition, the PSTLC property can be characterized by studying control-affine systems. The main object that we use to study PSTLC is a cone of high-order tangent vectors, or variations, and these are defined using the vector fields of the affine system. To better understand these variations, we study how they depend on the jets of the vector fields by studying the Taylor expansion of a composition of flows. Some connections are made between labeled rooted trees and the coefficients appearing in the Taylor expansion of a composition of flows. Also, a relation between variations and the formal Campbell-Baker-Hausdorff formula is established. After deriving some algebraic properties of variations, we define a variational cone for an affine system and relate it to the local controllability problem. We then study the notion of neutralizable variations and give a method for constructing subspaces of variations. Finally, using the tools developed to study variations, we consider two important classes of systems: driftless and homogeneous systems. For both classes, we are able to characterize the PSTLC property. / Thesis (Ph.D, Mathematics & Statistics) -- Queen's University, 2010-01-11 20:11:45.466

Digital signal processing (DSP) is widely used in many applications spanning the spectrum from audio processing to image and video processing to radar and sonar processing. At the core of digital signal processing applications is the digital filter which are implemented in two ways, using either finite impulse response (FIR) filters or infinite impulse response (IIR) filters. The primary difference between FIR and IIR is that for FIR filters, the output is dependent only on the inputs, while for IIR filters the output is dependent on the inputs and the previous outputs. FIR filters also do not sur from stability issues stemming from the feedback of the output to the input that aect IIR filters. In this thesis, an architecture for FIR filtering based on distributed arithmetic is presented. The proposed architecture has the ability to implement large FIR filters using minimal hardware and at the same time is able to complete the FIR filtering operation in minimal amount of time and delay when compared to typical FIR filter implementations. The proposed architecture is then used to implement the fast affine projection adaptive algorithm, an algorithm that is typically used with large filter sizes. The fast affine projection algorithm has a high computational burden that limits the throughput, which in turn restricts the number of applications. However, using the proposed FIR filtering architecture, the limitations on throughput are removed. The implementation of the fast affine projection adaptive algorithm using distributed arithmetic is unique to this thesis. The constructed adaptive filter shares all the benefits of the proposed FIR filter: low hardware requirements, high speed, and minimal delay.

As álgebras TKK afins estendidas pertencem à classe de álgebras de Lie chamada álgebras de Lie afins estendidas do tipo $A_1$. Elas são obtidas a partir de um semi-reticulado do $\\mathbbR^n$. Estudamos a estrutura dos módulos tipo Verma sobre a álgebra TKK afim estendida para um semi-reticulado (não-reticulado) do $\\mathbbR^2$. Quando fixamos um conjunto positivo de raízes isotrópicas chamado standard encontramos quatro órbitas da subálgebra de Borel que dão origem a distintos módulos tipo Verma sobre a álgebra TKK afim estendida. Estudamos as estruturas de seus submódulos e encontramos critérios de irredutibilidade para os módulos de Verma clássico e imaginário. / The extended affine TKK Lie algebras belong to a class of Lie algebras called extended affine Lie algebras of type $A_1$. They are obtained from a semilattice on $\\mathbbR^n$. We studied the structure of the Verma type modules for the extended affine TKK algebra obtained from a semi-lattice (non-lattice) on $\\mathbbR^2$. Fixing a set of positive isotropic roots called standard we found four orbits of the Borel subalgebra each of which give distinct Verma modules for the extended affine TKK algebra. We studied the structures of their submodules and found a criteria for irreducibility for the classic and imaginary Verma modules.

Unmanned Aerial Vehicles (UAVs) equipped with lightweight, inexpensive cameras have grown in popularity by enabling new uses of UAV technology. However, the video retrieved from small UAVs is often unwatchable due to high frequency jitter. Beginning with an investigation of previous stabilization work, this thesis discusses the challenges of stabilizing UAV based video. It then presents a software based computer vision framework and discusses its use to develop a real-time stabilization solution. A novel approach of estimating intended video motion is then presented. Next, the thesis proceeds to extend previous target localization work by allowing the operator to easily identify targets—rather than relying solely on color segmentation—to improve reliability and applicability in real world scenarios. The resulting approach creates a low cost and easy to use solution for aerial video display and target localization.

Nous nous plaçons dans le cadre de l'analyse statique de programmes, et nous nous intéressons aux propriétés numériques, c'est a dire celles qui concernent les valeurs numériques des variables de programmes. Nous essayons en particulier de déterminer une sur-approximation garantie de l'ensemble de valeurs possibles pour chaque variable numérique utilisée dans le programme à analyser. Cette analyse statique est faite dans le cadre de la théorie de l'interprétation abstraite, théorie présentant un compromis entre les limites théoriques d'indécidabilite et de calculabilite et la précision des résultats obtenus. Nous sommes partis des travaux d'Eric Goubault et Sylvie Putot, que nous avons étendus et généralisés. Notre nouveau domaine abstrait, appelé ensembles affines contraints, combine à la fois l'efficacite de calcul des domaines à base de formes affines et le pouvoir ex- pressif des domaines relationnels classiques tels que les octogones ou les polyèdres. Le nouveau domaine a été implémenté pour mettre en évidence l'intérêt de cette combinaison, ses avantages, ses performances et ses limites par rapport aux autres domaines numériques déjà existants. Le formalisme ainsi que les résultats pra- tiques ont fait l'objet de plusieurs publications [CAV 2009, CAV 2010].

[pt] Neste trabalho, estudamos superfícies com curvatura média afim zero. Elas são chamadas de superfícies mínimas afins e para superfícies convexas, também são chamadas de superfícies máximas afins. Provamos que uma superfície mínima euclidiana também é uma superfície mínima afim se, e somente se, as linhas de curvatura da superfície mínima euclidiana conjugada são planas. Para uma superfície máxima afim, descrevemos como recuperá-la do campo de vetor conormal ao longo de uma determinada curva. Para algumas escolhas do vector conormal, a superfície máxima é singular e descrevemos as condições sob as quais as singularidades são arestas cuspidais ou swallowtails. / [en] In this work we study surfaces with zero affine mean curvature. They are called affine minimal surfaces and for convex surfaces, they are also called affine maximal surfaces. We prove that an euclidean minimal surface is also an affine minimal surface if and only if the curvature lines of the conjugate euclidean minimal surface are planar. For an affine maximal surface, we describe how to recover it from the conormal vector field along a given curve. For some choices of the conormal vector, the maximal surface is singular and we describe conditions under which the singularities are cuspidal edges or swallowtails.

No description available.

Depuis une vingtaine d’années, la résolution de problèmes d’optimisation globale non convexes avec contraintes a connu un formidable essor. Les algorithmes de branch and bound basée sur l’analyse d’intervalles ont su trouver leur place, car ils ont l’avantage de prouver l’optimalité de la solution de façon déterministe, avec un niveau de certitude pouvant aller jusqu’à la précision machine. Cependant, la complexité exponentielle en temps et en mémoire de ces algorithmes induit une limite intrinsèque, c’est pourquoi il est toujours nécessaire d’améliorer les techniques actuelles. Dans cette thèse, nous avons développé de nouvelles arithmétiques basées sur l’arithmétique d’intervalles et l’arithmétique affine, afin de calculer des minorants et des majorants de meilleure qualité de fonctions explicites sur un intervalle. Nous avons ensuite développé une nouvelle méthode automatique de construction de relaxations linéaires. Cette construction est basée sur l’arithmétique affine et procède par surcharge des opérateurs. Les programmes linéaires ainsi générés ont exactement le même nombre de variables et de contraintes d’inégalité que les problèmes originaux, les contraintes d’égalité étant remplacées par deux inégalités. Cette nouvelle procédure permet de calculer des minorants fiables et des certificats d’infaisabilité pour chaque sous-domaine à chaque itération de notre algorithme de branch and bound par intervalles. De nombreux tests numériques issus du site COCONUT viennent confirmer l’efficacité de cette approche. Un autre aspect de cette thèse a été l’étude d’une extension de ce type d’algorithmes en introduisant une limite sur mémoire disponible. L’idée principale de cette approche est de proposer un processus inverse de l’optimisation par le biais d’un principe métaheuristique : plutôt que d’améliorer des solutions locales à l’aide de métaheuristiques telles que les algorithmes Taboo ou VNS, nous partons d’une méthode exacte et nous la modifions en une heuristique. De cette façon, la qualité de la solution trouvée peut être évaluée. Une étude de la complexité de ce principe métaheuristique a également été effectuée. Enfin, pour finir l’étude, nous avons appliqué notre algorithme à la résolution de problème en géométrie plane, ainsi qu’à la résolution d’un problème de dimensionnement de moteur électrique. Les résultats obtenus ont permis de confirmer l’intérêt de ce type d’algorithme, en résolvant des problèmes ouverts sur les polygones convexes et proposant des structures innovantes en génie électrique. / Since about thirty years, interval Branch and Bound algorithms are increasingly used to solve constrained global optimization problems in a deterministic way. Such algorithms are reliable, i.e., they provide an optimal solution and its value with guaranteed bounds on the error, or a proof that the problem under study is infeasible. Other approaches to global optimization, while useful and often less time-consuming than interval methods, do not provide such a guarantee. However, the exponential complexity in time and memory of interval Branch and Bound algorithms implies a limitation, so it is always necessary to improve these methods. In this thesis, we have developed new arithmetics based on interval arithmetic and affine arithmetic, to compute better lower and upper bounds of a factorable function over an interval. An automatic method for constructing linear relaxations of constrained global optimization problems is proposed. Such a construction is based on affine and interval arithmetics and uses operator overloading. These linear programs have exactly the same numbers of variables and of inequality constraints as the given problems. Each equality constraint is replaced by two inequalities. This new procedure for computing reliable bounds and certificates of infeasibility is inserted into a classical interval Branch and Bound algorithm. Extensive computation experiments, made on a sample of test problems from the COCONUT database, prove its effectiveness. Another aspect is the study of an extension of such a global optimization code by limiting the available memory. The main idea of this new kind of metaheuristique is to propose a reverse process of optimization via heuristics : rather than improving local solutions by using metaheuristics such as Taboo or VNS, we begin with an exact method and we modify it into a heuristic one. In such a way, the quality of the solution could be evaluated. Moreover, a study of the complexity of this metaheurisque has been done. Finally, we applied our algorithm to solve open problem in geometry, and to solve a design problem of an electric motor. The results have confirmed the usefulness of this kind of algorithms, solving open problems on convex polygons and offering innovative structures in electrical engineering.