The problem of embedding a manifold in Euclidean space is considered. Manifolds are introduced in Chapter I along with other basic definitions and examples. Chapter II contains a proof of the Regular Value Theorem along with the "Easy" Whitney Embedding Theorem. In Chapter III, vector bundles are introduced and some of their properties are discussed. Chapter IV introduces the Stiefel-Whitney classes and the four properties that characterize them. Finally, in Chapter V, the Stiefel-Whitney classes are used to produce a lower bound on the dimension of Euclidean space that is needed to embed real projective space.

In this thesis, Hausdorff, packing and capacity dimensions are studied by evaluating sets in the Euclidean space R^. Also the lower entropy dimension is calculated for some Cantor sets. By incorporating technics of Munroe and of Saint Raymond and Tricot, outer measures are created. A Vitali covering theorem for packings is proved. Methods (by Taylor and Tricot, Kahane and Salem, and Schweiger) for determining the Hausdorff and capacity dimensions of sets using probability measures are discussed and extended. The packing pre-measure and measure are shown to be scaled after an affine transformation. A Cantor set constructed by L.D. Pitt is shown to be dimensionless using methods developed in this thesis. A Cantor set is constructed for which all four dimensions are different. Graph directed constructions (compositions of similitudes follow a path in a directed graph) used by Mauldin and Willjams are presented. Mauldin and Williams calculate the Hausdorff dimension, or, of the object of a graph directed construction and show that if the graph is strongly connected, then the a—Hausdorff measure is positive and finite. Similar results will be shown for the packing dimension and the packing measure. When the graph is strongly connected, there is a constant so that the constant times the Hausdorff measure is greater than or equal to the packing measure when a subset of the realization is evaluated. Self—affine Sierpinski carpets, which have been analyzed by McMullen with respect to their Hausdorff dimension and capacity dimension, are analyzed with respect to their packing dimension. Conditions under which the Hausdorff measure of the construction object is positive and finite are given.

This study has investigated navigation strategies and spatial memory in Euclidean versus non-Euclidean environments. It also had a focus on mental maps, homing abilities and past video game experiences. Two test groups traversed mazes with identical layouts, but in which the non-Euclidean version incorporated wormholes that teleported participants in an, to the participant, unobvious manner. Data such as distances, time taken, and individual routes was collected. A thematic survey regarding strategies and tests for deeming what kind of mental map the participants used were also employed. Shapiro-Wilk tests, QQ-plots, PCA, Boxplots, T-tests, Heatmaps and Mann-Whitney U tests were used depending on the suitable data. Results showed that there were no significant differences between the two test groups in terms of quantifiable data and overall strategies used, while still there were signs of better performance for both groups in some certain respects. At the look on the groups as a whole, the participants that were deemed to use cognitive topological graphs, rather than cognitive Euclidean maps, were more successful in achieving the objectives. The results imply that areas like game design can be pushed further when it comes to using abstract or non-conventional spaces created by wormholes, without having a negative effect on the players navigational abilities. The results are also consistent with prior research in the field of psychology that refers to people using both maps and graphs as a cognitive representation of space.

Submitted by Kamila Costa (kamilavasconceloscosta@gmail.com) on 2015-06-17T20:37:08Z No. of bitstreams: 1 Dissertação-Andrea M da Mota.pdf: 827395 bytes, checksum: 3b513795b0e557b49dc4814527d37611 (MD5) / Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2015-06-19T14:12:03Z (GMT) No. of bitstreams: 1 Dissertação-Andrea M da Mota.pdf: 827395 bytes, checksum: 3b513795b0e557b49dc4814527d37611 (MD5) / Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2015-06-19T14:14:29Z (GMT) No. of bitstreams: 1 Dissertação-Andrea M da Mota.pdf: 827395 bytes, checksum: 3b513795b0e557b49dc4814527d37611 (MD5) / Made available in DSpace on 2015-06-19T14:14:29Z (GMT). No. of bitstreams: 1 Dissertação-Andrea M da Mota.pdf: 827395 bytes, checksum: 3b513795b0e557b49dc4814527d37611 (MD5) Previous issue date: 2014-09-15 / CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / The objective of this notes is to prove in detail a theorem, due to Ernst Heintze and Hermann Karcher, establishing an upper bound for the volume of compact domains in a connected closed hypersurface immersed in Euclidean space E. As application we will give an alternative proof of the Alexandrov’s theorem, which states that the Euclidean spheres are the only embedded closed hypersurfaces of constant mean curvature in E. / O objetivo deste trabalho é demonstrar em detalhes um teorema devido a Ernst Heintze e Hermann Karcher que estabelece uma cota superior para o volume de domínios compactos em uma hipersuperfície conexa, fechada e mergulhada no espaço euclidiano E. Como aplicação será dada uma prova alternativa do Teorema de Alexandrov, que caracteriza as esferas euclidianas como as únicas hipersuperfícies conexas, fechadas e mergulhadas de curvatura média constante em E.

Pattern recognition is an important area with potential applications in computer vision, Speech understanding, knowledge engineering, bio-medical data classification, earth sciences, life sciences, economics, psychology, linguistics, etc. Clustering is an unsupervised classification process corning under the area of pattern recognition. There are two types of clustering approaches: 1) Non-hierarchical methods 2) Hierarchical methods. Non-hierarchical algorithms are iterative in nature and. perform well in the context of isotropic clusters. Time-complexity of these algorithms is order of (0 (n) ) and above, Hierarchical agglomerative algorithms, on the other hand, are effective when clusters are non-isotropic. The single linkage method of hierarchical category produces a dendrogram which corresponds to the minimal spanning tree, conventional approaches are time consuming requiring O (n2 ) computational time. In this thesis we propose an intelligent partitioning scheme for generating the minimal spanning tree in the co-ordinate space. This is computationally elegant as it avoids the computation of similarity between many pairs of samples me minimal spanning tree generated can be used to produce C disjoint clusters by breaking the (C-1) longest edges in the tree. A systolic architecture has been proposed to increase the speed of the algorithm further. Simulation study has been conducted and the corresponding results are reported. The simulation package has been developed on DEC-1090 in Pascal. It is observed based on the simulation study that the parallel implementation reduces the time enormously. The number of processors required for the parallel implementation is a constant making the approach more attractive. Texture analysis and synthesis has been extensively studied in the context of computer vision, Two important approaches which have been studied extensively by researchers earlier are statistical and structural approaches, Texture is understood to be a periodic pattern with primitive sub patterns repeating in a particular fashion. This has been used to characterize texture with the help of the hierarchical data structure, tree. It is convenient to use a tree data structure as, along with the operations like merging, splitting, deleting a node, adding a node, etc, .it would be useful to handle a periodic pattern. Various functions like angular second moment, correlation etc, which are used to characterize texture have been translated into the new language of hierarchical data structure.

Let M be a finite set of random uniformly distributed points lying in a unit cube. Every four points from M make a tetrahedron and the tetrahedron can either contain some of the other points from M, or it can be empty. This diploma thesis brings an upper bound of the expected value of the number of empty tetrahedra with respect to size of M. We also show how precise is the upper bound in comparison to an approximation computed by a straightforward algorithm. In the last section we move from the three- dimensional case to a general dimension d. In the general d-dimensional case we have empty d-simplices in a d-hypercube instead of empty tetrahedra in a cube. Then we compare the upper bound for d-dimensional case to the results from another paper on this topic. 1

Aquesta tesi estudia com estimar la distribució de les variables regionalitzades l'espai mostral i l'escala de les quals admeten una estructura d'espai Euclidià. Apliquem el principi del treball en coordenades: triem una base ortonormal, fem estadística sobre les coordenades de les dades, i apliquem els output a la base per tal de recuperar un resultat en el mateix espai original. Aplicant-ho a les variables regionalitzades, obtenim una aproximació única consistent, que generalitza les conegudes propietats de les tècniques de kriging a diversos espais mostrals: dades reals, positives o composicionals (vectors de components positives amb suma constant) són tractades com casos particulars. D'aquesta manera, es generalitza la geostadística lineal, i s'ofereix solucions a coneguts problemes de la no-lineal, tot adaptant la mesura i els criteris de representativitat (i.e., mitjanes) a les dades tractades. L'estimador per a dades positives coincideix amb una mitjana geomètrica ponderada, equivalent a l'estimació de la mediana, sense cap dels problemes del clàssic kriging lognormal. El cas composicional ofereix solucions equivalents, però a més permet estimar vectors de probabilitat multinomial. Amb una aproximació bayesiana preliminar, el kriging de composicions esdevé també una alternativa consistent al kriging indicador. Aquesta tècnica s'empra per estimar funcions de probabilitat de variables qualsevol, malgrat que sovint ofereix estimacions negatives, cosa que s'evita amb l'alternativa proposada. La utilitat d'aquest conjunt de tècniques es comprova estudiant la contaminació per amoníac a una estació de control automàtic de la qualitat de l'aigua de la conca de la Tordera, i es conclou que només fent servir les tècniques proposades hom pot detectar en quins instants l'amoni es transforma en amoníac en una concentració superior a la legalment permesa. / This Thesis presents an estimation procedure for the distribution of regionalized variables with sample space and scale admitting an Euclidean structure. We apply the principle of working on coordinates: choose an orthonormal basis; do statistics on the coordinates of your observations on that basis; and, by applying the output to the basis, you will recover a result within the original space. Applying this procedure to regionalized variables, we obtain a unified, consistent method, with the same properties of classical linear kriging techniques, but valid for several sample spaces: real data, positive data and compositions (vectors of positive components summing up to a constant) are regarded as particular cases. In this way we generalize the linear kriging techniques, and offer a solution to several well-known problems of the non-linear ones, by adapting the measure of the space and the averaging criterion (the way means are computed) to the data. The obtained estimator for positive variables is a weighted geometric mean, equivalent to estimate the median, which has none of the drawback of classical lognormal kriging. For compositional data, equivalent results are obtained, but which also serve to treat multinomial probability vectors. By combining this with a preliminary Bayesian estimation, our kriging for compositions become also a valid alternative to indicator kriging, without its order-relation problems (i.e. the rather-usual negative estimates of some probabilities). These techniques are validated by studying the ammonia pollution hazard in an automatic water quality control station placed in a small Mediterranean river. Only the proposed techniques allow us to assess when the secondary pollution by ammonia exceeds the existing legal threshold.

Στην παρούσα διδακτορική διατριβή μελετάμε τρία Προβλήματα που αναφέρονται στην Ψευδο-Ευκλείδεια Γεωμετρία. Στα δύο πρώτα Κεφάλαια, Κεφάλαιο 1 και Κεφάλαιο 2 αναφέρουμε γνωστά αποτελέσματα και περιγράφουμε βασικές έννοιες της Ρημάννιας και Ψευδό - Ρημάννιας Γεωμετρίας. Στο Κεφάλαιο 3 μελετάμε επιφάνειες εκ περιστροφής στον τρισδιάστατο Lorentz - Minkowski χώρο ικανοποιώντας δοσμένη γεωμετρική συνθήκη. Στο Κεφάλαιο 4 βρίσκουμε όλες τις κανονικές μορφές του τελεστή σχήματος των τρισδιάστατων υπερεπιφανειών τύπου (-, +, -) του τετρασδιάστατου Ψευδο - Ευκλείδειου χώρου τύπου (-, +, -, +). Τέλος, στο Κεφάλαιο 5 μελετάμε τη σχέση που υπάρχει μεταξύ των διαρμονικών και ελαχιστικών υπερεπιφανειών που αναφέρθηκαν στο Κεφάλαιο 4, χρησιμοποιώντας τον τελεστή σχήματός τους. Ειδικότερα, αποδεικνύουμε ότι κάθε τέτοια διαρμονική υπερεπιφάνεια είναι ελαχιστική. / In the present PH.D. thesis we study three problems referred in the pseudo-Euclidean geometry. In the first two chapters, Chapter 1 and Chapter 2, we review known results and describe the basic notions of the Riemannian and Pseudo-Riemannian geometry. In Chapter 3, we study surfaces of revolution of the three dimensional Lorentz-Minkowski space satisfying given geometric condition. In Chapter 4, we find all the canonical forms of the shape operator of the three dimensional hypersurfaces of signature (-, +, -) of the four dimensional pseudo-Euclidean space of signature (-, +, -, +). Finally, in Chapter 5, we study the relation which exists between the biharmonic and minimal hypersurfaces referred in Chapter 4, by using their shape operator. Precisely, we prove that every such biharmonic hypersurface is minimal.

Submitted by Marlene Santos (marlene.bc.ufg@gmail.com) on 2016-05-05T20:05:47Z No. of bitstreams: 2 Tese - Rosane Gomes Pereira - 2016.pdf: 1460804 bytes, checksum: bde81076cac51b848a33cb0c0f768798 (MD5) license_rdf: 19874 bytes, checksum: 38cb62ef53e6f513db2fb7e337df6485 (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2016-05-06T11:39:46Z (GMT) No. of bitstreams: 2 Tese - Rosane Gomes Pereira - 2016.pdf: 1460804 bytes, checksum: bde81076cac51b848a33cb0c0f768798 (MD5) license_rdf: 19874 bytes, checksum: 38cb62ef53e6f513db2fb7e337df6485 (MD5) / Made available in DSpace on 2016-05-06T11:39:46Z (GMT). No. of bitstreams: 2 Tese - Rosane Gomes Pereira - 2016.pdf: 1460804 bytes, checksum: bde81076cac51b848a33cb0c0f768798 (MD5) license_rdf: 19874 bytes, checksum: 38cb62ef53e6f513db2fb7e337df6485 (MD5) Previous issue date: 2016-03-08 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / In this work, we study eigenvalues of poly-drifting laplacian on compact Riemannian manifolds with boundary (possibly empty). Here, we bring a universal inequality for the eigenvalues of the poly-drifting operator on compact domains in an Euclidean spaceRn. Besides,weintroduce universal inequalities for eigenvalues of poly-drifting operator on compact domains in a unit n-sphere Sn. We give an universal inequality for lower order eigenvalues of the poly-drifting operator inRn and Sn. Moreover, we prove an universal inequality type Ashbaugh and Benguria for the drifting Laplacian on Riemannian manifold immersed in an unit sphere or a projective space. Let be a bounded domain in a n-dimensional Euclidean space Rn. We study eigenvalues of an eigenvalue problem of a system of elliptic equations of the drifting laplacian 8>><>>: L u+ (r(divu)􀀀r divu) = 􀀀¯ u; in ; uj@ = 0 Estimates for eigenvalues of the above eigenvalue problem are obtained. Furthermore, a universal inequality for lower order eigenvalues of the problem is also derived. / Neste trabalho, estudamos autovalores do polidrifting Laplaciano em variedades Riemannianas compactas com fronteira (possivelmente vazia). Aqui, trazemos uma desigualdade universal para autovalores do polidrifting operador em domínios compactos no espaço Euclidiano Rn. Além disso, introduzimos desigualdades universais para autovalores do polidrifting operador em domínios compactos na n-esfera unitária Sn. Fornecemos uma estimativa para autovalores de ordem inferior do polidrifting operador emRn e Sn. Mais ainda, provamos uma desigualdade universal do tipo Ashbaugh-Benguria para o drifting Laplacianoem variedades Riemannianas imersas em uma esfera unitária ou no espaço projetivo. Seja um domínio limitado no n-dimensional espaço Euclidiano Rn. Estudamos autovalores de um problema de autovalores de um sistema de equações elípticas do drifting Laplaciano 8>><>>: L u+ (r(divu)􀀀r divu) = 􀀀¯ u; in ; uj@ = 0 Estimativas para autovalores do problema de autovalores acima são obtidas. Além disso, uma desigualdade universal de ordem inferior também é encontrada.

No description available.