Orientador: Cristiano Torezzan / Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Cientíca / Made available in DSpace on 2018-08-19T06:29:05Z (GMT). No. of bitstreams: 1 Gouvea_DrielsonDavisonSilva_M.pdf: 2943642 bytes, checksum: 7e5df67721c42a7942f4baee18f152f9 (MD5) Previous issue date: 2011 / Resumo: Neste trabalho estuda-se o problema do vetor mais próximo em reticulados. Este problema consiste em encontrar um vetor de um reticulado mais próximo de um ponto dado do Rn e é conhecido também como problema da decodificação em reticulados. Estuda-se de forma específica algoritmos para o problema do vetor mais próximo para os reticulados raízes Zn, An e Dn. Além de uma breve revisão da literatura, os algoritmos para decodificação nesses reticulados são apresentados em detalhes, incluindo exemplos e também os códigos utilizados para implementação desses métodos na linguagem do software livre Scilab. Algumas simulações numéricas foram feitas utilizando esses códigos para investigar o tempo gasto na decodificação em função da dimensão do reticulado / Abstract: In this paper we study the nearest vector problem in lattices. This problem consists in finding a vector of a lattice closest to a given point of Rn and is also known as the decoding problem in lattices. It is studied in a specific algorithms for the nearest vector problem for lattices roots Zn, An and Dn. Besides a brief review of the literature, algorithms for decoding these lattices are presented in detail, including examples and also the codes used to implement these methods in the language of the free software Scilab. Some numerical simulations were done using these codes to investigate the time spent in decoding according to the size of the lattice / Mestrado / Matemática Universitária / Mestre em Matemática Universitária

Orientador: Sueli Irene Rodrigues Costa / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Cientifica / Made available in DSpace on 2018-08-19T16:10:47Z (GMT). No. of bitstreams: 1 Jorge_GrasieleCristiane_D.pdf: 3823740 bytes, checksum: 772a88bd2136b4afb884a6e824f37bce (MD5) Previous issue date: 2012 / Resumo: O uso de códigos e reticulados em teoria da informação e na "chamada criptografia pós-quântica" vem sendo cada vez mais explorado. Neste trabalho estudamos temas relacionados a estas duas vertentes. A análise de reticulados foi feita via as métricas euclidiana e da soma. Para a métrica euclidiana, estudamos um algoritmo que procura pela treliça mínima de um reticulado com sub-reticulado ortogonal. No caso bidimensional foi possível caracterizar todos os sub-reticulados ortogonais de um reticulado racional qualquer. No estudo de reticulados via métrica da soma, trabalhamos com duas relações entre códigos e reticulados, conhecidas como "Construção A" e "Construção B". Generalizamos a Construção B para uma classe de códigos q-ários... Observação: O resumo, na íntegra, poderá ser visualizado no texto completo da tese digital / Abstract: The use of codes and lattices in Information Theory and in the so-called "Post-quantum Cryptography" has been increasingly explored. In this work we have studied topics related to these two aspects. The analysis of lattices was made via Euclidean and sum metrics. For the Euclidean metric we studied an algorithm that searches for a minimum trellis of a lattice with orthogonal sublattice. In the two-dimensional case it has been possible to characterize all orthogonal sublattices of any rational lattice. In the study of lattices via sum metric, we worked with two relations between codes and lattices, the so-called "Construction A " and "Construction B". We generalized Construction B for the class of q-ary codes...Note: The complete abstract is available with the full electronic document / Doutorado / Matematica / Doutor em Matemática

Orientador: Sueli Irene Rodrigues Costa / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica / Made available in DSpace on 2018-08-20T11:38:10Z (GMT). No. of bitstreams: 1 Ferrari_AgnaldoJose_D.pdf: 2344410 bytes, checksum: faa96ccdd8ff4ec461abc4f69d6cc999 (MD5) Previous issue date: 2012 / Resumo: Neste trabalho abordamos a construção de reticulados usando propriedades da Teoria Algébrica dos Números. Enfocamos a construção de alguns reticulados com características especiais, conhecidos na literatura, via reticulados ideais, através de uma abordagem matricial e algorítmica...Observação: O resumo, na íntegra, poderá ser visualizado no texto completo da tese digital / Abstract: In this work we approach lattice constructions using properties of algebraic number theory. One focus is on the construction of some well known lattices via ideal lattices, through a matrix and algorithmic approach...Note: The complete abstract is available with the full electronic document / Doutorado / Matematica Aplicada / Doutor em Matemática Aplicada

La tomographie consiste à reconstruire un objet nD à partir de projections (n-1)D. Cette discipline soulève plusieurs questions auxquelles la recherche essaie d’apporter des réponses. On s’intéresse dans cette thèse à trois aspects de cette problématique : 1) la reconstruction de l’image 2D à partir de projections dans un cadre rarement étudié qui est celui des sources ponctuelles ; 2) l’unicité de cette reconstruction ; 3) l'estimation d’informations concernant un objet sans passer par l'étape de reconstitution de son image. Afin d’aborder le problème de reconstruction pour la classe des ensembles convexes, nous définissons une nouvelle classe d’ensembles ayant des propriétés de convexité qu’on appelle convexité par quadrants pour des sources ponctuelles. Après une étude de cette nouvelle classe d’ensembles, nous montrons qu’elle présente des liens forts avec la classe des ensembles convexes. Nous proposons alors un algorithme de reconstruction d’ensemblesconvexes par quadrants qui, si l’unicité de la reconstruction est garantie, permet de reconstruire des ensembles convexes en un temps polynomial. Nous montrons que si une conjecture, que nous avons proposée, est vraie, les conditions de l’unicité pour les ensembles convexes par quadrants sont les mêmes que celles pour les ensembles convexes. Concernant le troisième aspect étudié dans cette thèse, nous proposons une méthode qui permet d’estimer, à partir d’une seule projection, la surface d’un ensemble 2D. Concernant l’estimation du périmètre d’un ensemble 2D, en considérant les projections par une deuxième source d’un ensemble convexe, nous obtenons deux bornes inférieures et une borne supérieure pour le périmètre de l’objet projeté. / Tomography is about reconstructing an nD object from its (n-1)D projections. This discipline addresses many questions to which research tries to provide answers. In this work, we are interested to three aspects: 1) the 2D image reconstruction from projections in a rarely studies framework that is the point sources; 2) the uniqueness of this reconstruction; 3) estimating information about an object without going through the step of reconstructing its image. To approach the problem of tomographic reconstruction for the class of convex sets, we define a new class of sets having properties of convexity called quadrant convexity for point sources. After a study of this new class of sets, we show that it presents strong links with the class of convex sets. Wepropose a reconstruction algorithm for quadrant-convex sets that, if the uniqueness of the reconstruction is guaranteed, allows the reconstruction of convex sets in polynomial time. We also show that if a conjecture we have proposed is true the conditions of uniqueness for quadrant-convex sets are the same as those for convex sets. Regarding the third aspect studied in this thesis, we focus on two quantitative properties that are the surface and the perimeter. We propose a method to estimate, from only one projection, the surface of a 2D set. We obtain two lower bounds and an upper bound for the perimeter of a projected convexobject by considering the projections from a second point source.

Une théorie fixé de la gravitation est loin d' être complète. La théorie plus prometteuse parmi ces théories de la gravité dans ce siècle est la relativité générale (RG), qui est toujours rencontre des obstacles par plusieurs problèmes. Les problèmes que nous soulignons dans cette thèse sont les aspects thermodynamiques et la quantification de la gravitation. Les tentatives proposées pour comprendre d'aspect thermodynamique de RG ont déjà été étudiés par la thermodynamique des trous noirs, alors que la théorie de la gravité quantique a déjà eu plusieurs des candidats, l'un d' entre eux était la gravité quantique à boucles (LQG), celui qui est la théorie base de notre travail. La théorie correcte de la gravité quantique devrait offrir une limite classique qui est correcte et consistent , ce qui évidemment , la relativité générale. / A fixed theory of gravity is far from being complete. The most promising theory of gravity in this century is general relativity (GR), which is still plagued by several problems. The problems we highlight in this thesis are the thermodynamical aspects and the quantization of gravity. Attempts to understand the termodynamical aspect of GR have already been studied through the thermodynamics of black holes, while the theory of quantum gravity has already had several candidates, one of them being the canonical loop quantum gravity (LQG), which is the base theory in our work.

No description available.

<p>The first class of problem we study deals with geometric matchings. Given a set<br />of points in the plane, we study perfect matchings of those points by straight line<br />segments so that the segments do not cross. Bottleneck matching is such a matching that minimizes the length of the longest segment. We are interested in finding a bottleneck matching of points in convex position. In the monochromatic case, where any two points are allowed to be matched, we give an O(n ²)-time algorithm for finding a bottleneck matching, improving upon previously best known algorithm of O(n ³) time complexity. We also study a bichromatic version of this problem, where each point is colored either red or blue, and only points of different color can be matched. We develop a range of tools, for dealing with bichromatic non-crossing matchings of points in convex<br />position. Combining that set of tools with a geometric analysis enable us to solve the<br />problem of finding a bottleneck matching in O(n ²) time. We also design an O(n)-time<br />algorithm for the case where the given points lie on a circle. Previously best known results were O(n 3 ) for points in convex position, and O(n log n) for points on a circle.<br />The second class of problems we study deals with dilation of geometric networks.<br />Given a polygon representing a network, and a point p in the same plane, we aim to<br />extend the network by inserting a line segment, called a feed-link, which connects<br />p to the boundary of the polygon. Once a feed link is fixed, the geometric dilation<br />of some point q on the boundary is the ratio between the length of the shortest path<br />from p to q through the extended network, and their Euclidean distance. The utility of<br />a feed-link is inversely proportional to the maximal dilation over all boundary points.<br />We give a linear time algorithm for computing the feed-link with the minimum overall<br />dilation, thus improving upon the previously known algorithm of complexity that is<br />roughly O(n log n).</p> / <p>Prva klasa problema koju proučavamo tičee se geometrijskih mečinga. Za dat skup tačaaka u ravni, posmatramo savr&scaron;ene mečinge tih tačaka spajajućii ih&nbsp; dužima koje &nbsp; se ne smeju sećui. Bottleneck mečing je takav mečing koji minimizuje dužinu najduže duži. Na&scaron; cilj je da nađemo bottleneck mečiing tačaka u konveksnom položaju.Za monohromatski slučaj, u kom je dozvoljeno upariti svaki par tačaka, dajemo algoritam vremenske složenosti O(n ²) za nalaženje bottleneck mečinga. Ovo&nbsp; je bolje od prethodno najbolji poznatog algoritam, čiija je složenost O(n ³). Takođe proučavamo bihromatsku verziju ovog problema, u kojoj je svaka tačka&nbsp; obojena ili u crveno ili u plavo, i dozvoljeno je upariti samo tačke različite boje. Razvijamo niz alata za rad sa bihromatskim nepresecajućim mečinzima tačaka u konveksnom položaju. Kombinovanje ovih alata sa geometrijskom analizom omogućava nam da re&scaron;imo problem nalaženja bottleneck mečinga u O(n ² ) vremenu. Takođe, konstrui&scaron;emo algoritam vremenske složenosti O(n) za slučaj kada&nbsp; sve date tačkke leže na krugu. Prethodno najbolji poznati algoritmi su imali složenosti&nbsp; O(n ³ ) za tačkeke u konveksnom položaju i O(n log n) za tačke na krugu.<br />Druga klasa problema koju proučaavamo tiče se dilacije u geometrijskim mrežama. Za datu mrežu predstavljenu poligonom, i tačku p u istoj ravni, želimo pro&scaron;iriti mrežu&nbsp; dodavanjem duži zvane feed-link koja povezuje p sa obodom poligona. Kada je feed- link fiksiran, defini&scaron;emo geometrijsku dilaciju neke tačke q na obodu kao odnos izme&nbsp; đu&nbsp; dužine najkraćeg puta od p do q kroz pro&scaron;irenu mrežu i njihovog Euklidskog rastojanja. Korisnost feed-linka je obrnuto proporcionalna najvećoj dilaciji od svih ta čaka na obodu poligona. Konstrui&scaron;emo algoritam linearne vremenske složenosti koji nalazi feed-link sa najmanom sveukupnom dilacijom. Ovim postižemo bolji rezultat od prethodno najboljeg poznatog algoritma složenosti približno O(n log n).</p>

Dans cette thèse, nous développons un modèle du second ordre pour la représentation des formes (courbes et surfaces) grâce à la théorie des cycles normaux. Le cycle normal d'une forme est le courant associé à son fibré normal. En introduisant des métriques à noyaux sur les cycles normaux, nous obtenons une mesure de dissimilarité entre formes qui prend en compte leurs courbures. Cette mesure est ensuite utilisée comme terme d'attache aux données dans une optique d'appariement et d'analyse de formes par les déformations. Le chapitre 1 est une revue du domaine de l'analyse de formes par les déformations. Nous insistons plus particulièrement sur la mise en place théorique et numérique du modèle de Large Deformation Diffeomorphic Metric Mapping (LDDMM). Le chapitre 2 se concentre sur la représentation des formes par les cycles normaux dans un cadre unifié qui englobe à la fois les formes continues et discrètes. Nous précisons dans quelle mesure cette représentation contient des informations de courbure. Enfin nous montrons le lien entre le cycle normal d'une forme et son varifold. Dans le chapitre 3, nous introduisons les métriques à noyaux. Ainsi, nous pouvons considérer les cycles normaux dans un espace de Hilbert avec un produit scalaire explicite. Nous détaillons ce produit scalaire dans le cas des courbes et surfaces discrètes avec certains noyaux, ainsi que le gradient associé. Nous montrons enfin que malgré le choix de noyaux simples, nous ne perdons pas toutes les informations de courbures. Le chapitre 4 utilise cette nouvelle métrique comme terme d'attache aux données dans le cadre LDDMM. Nous présentons de nombreux appariements et estimations de formes moyennes avec des courbes ou des surfaces. L'objectif de ce chapitre est d'illustrer les différentes propriétés des cycles normaux pour l'analyse des déformations sur des exemples synthétiques et réels. / In this thesis, we develop a second order model for the representation of shapes (curves or surfaces) using the theory of normal cycles. The normal cycle of a shape is the current associated with its normal bundle. Introducing kernel metrics on normal cycles, we obtain a dissimilarity measure between shapes which takes into account curvature. This measure is used as a data attachment term for a purpose of registration and shape analysis by deformations. Chapter 1 is a review of the field of shape analysis. We focus on the setting of the theoretical and numerical model of the Large Deformation Diffeomorphic Metric Mapping(LDDMM).Chapter 2 focuses on the representation of shapes with normal cycles in a unified framework that encompasses both the continuous and the discrete shapes. We specify to what extend this representation encodes curvature information. Finally, we show the link between the normal cycle of a shape and its varifold. In chapter 3, we introduce the kernel metrics, so that we can consider normal cycles in a Hilbert space with an explicit scalar product. We detail this scalar product for discrete curves and surfaces with some kernels, as well as the associated gradient. We show that even with simple kernels, we do not get rid of all the curvature informations. The chapter 4 introduces this new metric as a data attachment term in the framework of LDDMM. We present numerous registrations and mean shape estimation for curves and surfaces. The aim of this chapter is to illustrate the different properties of normal cycles for the deformations analysis on synthetic and real examples.

Dans cette thèse, nous nous intéressons à l’étude des courbes discrètes bruitées qui correspondent aux contours d’objets dans des images. Nous avons proposé plusieurs outils permettant de les analyser. Les points dominants (points dont l’estimation de la courbure est localement maximale) jouent un rôle très important dans la reconnaissance de formes et, nous avons développé une méthode non heuristique, rapide et fiable pour les détecter dans une courbe discrète. Cette méthode est une amélioration d’une méthode existante introduite par Nguyen et al. La nouvelle méthode consiste à calculer une mesure d’angle. Nous avons proposé aussi deux approches pour la simplification polygonale : une méthode automatique minimisant, et une autre fixant le nombre de sommets du polygone résultant. Ensuite, nous avons introduit un nouvel outil géométrique, nommé couverture tangentielle adaptative (ATC), reposant sur la détection des épaisseurs significatives introduites par Kerautret et al. Ces épaisseurs calculées en chaque point du contour à analyser, permettent d’estimer localement le niveau de bruit. Dans ce contexte notre algorithme de construction de la couverture tangentielle adaptative prend en considération les différents niveaux de bruits présents dans la courbe à étudier et ne nécessite pas de paramètre. Deux applications de l’ATC sont proposées en analyse d’images : d’une part la décomposition des contours d’une forme dans une image en arcs et en segments de droite et d’autre part, dans le cadre d’un projet avec une université d’Inde, autour du langage des signes et la reconnaissance des gestes de la main. Premièrement, la méthode de décomposition des courbes discrètes en arcs et en segments de droite est basée sur deux outils : la détection de points dominants en utilisant la couverture tangentielle adaptative et la représentation dans l’espace des tangentes du polygone, issue des points dominants détectés. Les expériences montrent la robustesse de la méthode w.r.t. le bruit. Deuxièmement, à partir des contours des mains extraits d’images prises par une Kinect, nous proposons différents descripteurs reposant sur des points dominants sélectionnés du contour des formes dans les images. Les descripteurs proposés, qui sont une combinaison entre descripteurs statistiques et descripteurs géométriques, sont efficaces et conviennent à la reconnaissance de gestes / In this thesis, we are interested in the study of noisy discrete curves that correspond to the contours of objects in images. We have proposed several tools to analyze them. The dominant points (points whose curvature estimation is locally maximal) play a very important role in pattern recognition and we have developed a non-heuristic, fast and reliable method to detect them in a discrete curve. This method is an improvement of an existing method introduced by Nguyen et al. The new method consists in calculating a measure of angle. We have also proposed two approaches for polygonal simplification: an automatic method minimizing, and another fixing the vertex number of the resulting polygon. Then we proposed a new geometric tool, called adaptive tangential cover ATC, based on the detection of meaningful thickness introduced by Kerautret et al. These thicknesses are calculated at each point of the contours allow to locally estimate the noise level. In this context our construction algorithm of adaptive tangential cover takes into account the different levels of noise present in the curve to be studied and does not require a parameter. Two applications of ATC in image analysis are proposed: on the one hand the decomposition of the contours of a shape in an image into arcs and right segments and on the other hand, within the framework of a project with an Indian university about the sign language and recognition of hand gestures. Firstly, the method to decompose discrete curves into arcs and straight segments is based on two tools: dominant point detection using adaptive tangential cover and tangent space representation of the polygon issued from detected dominant points. The experiments demonstrate the robustness of the method w.r.t. noise. Secondly, from the outlines of the hands extracted from images taken by a Kinect, we propose several descriptors from the selected dominant points computed from the adaptive tangential cover. The proposed descriptors, which are a combination of statistical descriptors and geometrical descriptors, are effective and suitable for gesture recognition