The aim of this thesis is to analyze zonality of the thermal contraction crack polygons on the surface of Mars. Their morphology and its variation are analyzed in relation to the latitude of Mars. For spatial and morphological analysis were selected 64 images from the HiRISE (Mars Reconnaissance Orbiter) polychromatic camera dataset, images are covering the bandwidths proportionally. Images were first visually analyzed using HiView. 258 areas containing the thermal contraction crack polygons (with total area of 1184 km2 ) and 1036 well developed thermal contraction crack polygons were further vectorized using ArcMap. The thermal contraction crack polygons were found in every searched latitude which proves the ubiquity of permafrost. The largest amount of the thermal contraction crack polygons have been found in latitudes ±60ř and 45ř. In these latitudes were also found the largest and probably the deepest thermal contraction crack polygons (average length ranges from 42,1 - 73,6 m). The smallest polygons (average length 7,7 m) were found around the equator. "Altitude" has no effect on the spread of the thermal contraction crack polygons on Mars; however it has the effect on its morphology. The most widespread are pentagonal polygons, which occur mainly in the southern hemisphere. The next most...

No description available.

[pt] O objetivo deste trabalho é estudar uma certa classe de polígonos espaciais e provar teoremas a respeito do número mínimo de achatamentos que tais polígonos necessariamente possuem. Para tal, investigamos polígonos esféricos que não estão contidos em nenhum hemisfério fechado e deduzimos, entre vários resultados, que sob certas hipóteses tais polígonos esféricos possuem uma cota inferior não-trivial para o número de inflexões esféricas. / [en] The aim of this work is to study a certain class of spatial polygons and prove theorems on the minimal number of flattenings that such polygons must have. In order to do this, we investigate spherical polygons which are not contained in any closed hemisphere and deduce, among many results, that under certain hypotheses such spherical polygons have a nontrivial lower bound on the number of spherical inflections.

<p>Inom många tillämpningar används konforma avbildningar för att transformera tvådimensionella områden till områden med enklare utseende. Ett exempel på ett sådant område är en kanal av varierande tjocklek begränsad av en kontinuerligt deriverbar kurva. I de tillämpningar som har motiverat detta arbete, är det viktigt att dessa egenskaper bevaras i det område en approximativ konform avbildning producerar, men det är också viktigt att begränsningskurvans riktning kan kontrolleras, särkilt i kanalens båda ändar.</p><p>Denna avhandling behandlar tre olika metoder för att numeriskt konstruera konforma avbildningar mellan ett enkelt standardområde, företrädesvis det övre halvplanet eller enhetscirkeln, och ett område begränsat av en kontinuerligt deriverbar kurva, där begränsningskurvans riktning kan kontrolleras, exakt eller approximativt.</p><p>Den första metoden är en utveckling av en idé, först beskriven av Peter Henrici, där en modifierad Schwarz-Christoffel-avbildning avbildar det övre halvplanet konformt på en polygon med rundade hörn.</p><p>Med utgångspunkt i denna idé skapas en algoritm för att konstruera avbildningar på godtyckliga områden med släta randkurvor.</p><p>Den andra metoden bygger också den på Schwarz-Christoffel-avbildningen, och utnyttjar det faktum att om enhetscirkeln eller halvplanet avbildas på en polygon kommer ett område Q i det inre av dessa, som till exempel en cirkel med centrum i origo och radie mindre än 1, eller ett område i övre halvplanet begränsat av två strålar, att avbildas på ett område R i det inre av polygonen begränsat av en slät kurva. Vi utvecklar en metod för att hitta ett polygonalt område P, utanför det Omega som man önskar att skapa en avbildning för, sådant att den Schwarz-Christoffel-avbildning som avbildar enhetscirkeln eller halvplanet på P, avbildar Q på Omega.</p><p>I båda dessa fall används tangentpolygoner för att numeriskt bestämma den önskade avbildningen.</p><p>Slutligen beskrivs en metod där en av Don Marshalls så kallade zipper-algoritmer används för att skapa en avbildning mellan det övre</p><p>halvplanet och en godtycklig kanal, begränsad av släta kurvor, som i båda ändar går mot oändligheten som räta parallella linjer.</p> / <p>In many applications, conformal mappings are used to transform two-dimensional regions into simpler ones. One such region for which conformal mappings are needed is a channel bounded by continuously differentiable curves. In the applications that have motivated this work, it is important that the region an approximate conformal mapping produces, has this property, but also that the direction of the curve can be controlled, especially in the ends of the channel.</p><p>This thesis treats three different methods for numerically constructing conformal mappings between the upper half-plane or unit circle and a region bounded by a continuously differentiable curve, where the direction of the curve in a number of control points is controlled, exact or approximately.</p><p>The first method is built on an idea by Peter Henrici, where a modified Schwarz-Christoffel mapping maps the upper half-plane conformally on a polygon with rounded corners. His idea is used in an algorithm by which mappings for arbitrary regions, bounded by smooth curves are constructed.</p><p>The second method uses the fact that a Schwarz-Christoffel mapping from the upper half-plane or unit circle to a polygon maps a region Q inside the half-plane or circle, for example a circle with radius less than 1 or a sector in the half--plane, on a region Omega inside the polygon bounded by a smooth curve. Given such a region Omega, we develop methods to find a suitable outer polygon and corresponding Schwarz-Christoffel mapping that gives a mapping from Q to Omega.</p><p>Both these methods use the concept of tangent polygons to numerically determine the coefficients in the mappings.</p><p>Finally, we use one of Don Marshall's zipper algorithms to construct conformal mappings from the upper half--plane to channels bounded by arbitrary smooth curves, with the additional property that they are parallel straight lines when approaching infinity.</p>

The major directions of this dissertation involve (1) the syntheses and characterization of molecular polygons incorporating sp1hybridized carbon linkers and L2Pt corners (L2 = cis-1,3-diphosphine), (2) the development of protected carbon chain complexes featuring fluorous phosphine ligands and (3) click reactions of metal terminal polyynyl complexes and further metallations of the resulting triazole rings. A brief overview is provided in Chapter I. Chapter II details the syntheses of molecular squares containing bidendate diphosphine ligands of the formula R2C(CH2PPh2)2 where R = Me, Et, n-Bu, n-Dec, Bn, and p-tolCH2 (general designation dppp*), in which the R2 groups are intended to circumvent the solubility issues encountered by others. Their syntheses involve double substitutions of the dimesylate compounds R2C(CH2OMs)2 using KPPh2. Building blocks of the formulae (dppp*)PtCl2 and (dppp*)Pt((C≡C)2H)2 are synthesized and characterized, including one crystal structure of the latter. The target complexes are accessed by reactions of (dppp*)PtCl2 with (dppp*)Pt((C≡C)2H)2 under Sonogashira type conditions. Six new squares of the formula [(R2C(CH2PPh2)2)Pt(C≡C)2]4 are characterized including two crystal structures. Further topics include approaches to higher homologues and cyclocarbon synthesis. Chapter III focuses on carbon chain complexes bearing fluorous phosphine ligands of the formula P((CH2)mRfn)3 (Rfn = (CF2)n-1CF3; m/n = 2/8, 3/8, and 3/10). Precursors of the formula trans-(C6F5)((Rfn(CH2)m)3P)2PtCl are synthesized and characterized, including one crystal structure, which reveals phase separation of the fluorous and non-fluorous domains. Reactions with butadiyne give trans-(C6F5)((Rfn(CH2)m)3P)2Pt(C≡C)2H. Oxidative homocouplings afford the target complexes trans,trans-(C6F5)((Rfn(CH2)m)3P)2Pt(C≡C)4(C6F5)(P((CH2)mRfn)3)2Pt. Cyclic voltammetry indicates irreversible oxidations of the title compounds, in contrast to partially reversible oxidations of non-fluorous analogues. Chapter IV focuses on multimetallic complexes achieved by click reactions in metal coordination spheres. The copper catalyzed click reaction between trans-(C6F5)(p-tol3P)2Pt(C≡C)2H (1) and (η5-C5H4N3)Re(CO)3 affords the bimetallic 1,2,3-triazole trans-C6F5)(p1tol3P)2PtC≡CC=CHN((η51C5H4)Re(CO)3)N=N. Further reactions with Re(CO)5OTf and Re(CO)5Br give trimetallated adducts, which represent the first species of this type. An alternative route to a trimetallic complex involves the twofold cycloaddition of the diazide (η5-C5H4N3)2Fe and 1, giving (η5-C5H4NN=N-C(trans-(C≡C)Pt(Pp-tol3)2(C6F5)=CH)2Fe. The crystal structures of the di and trimetallic complexes are compared, but attempts to achieve a fourth metallation involving the =CH groups are unsuccessful. However, when the triazolium salt [trans-(C6F5)(p-tol3P)2PtC≡CC=CHN(CH2C6H5)N=N(Me)]+ I– is treated with Ag2O and [Rh(COD)Cl]2, a =CRh adduct is obtained. The success of =CH metallation is correlated to the 1H NMR chemical shift, indicative of an electronic effect.

Baigiamajame magistro darbe nagrinėjama paprasto skylėto daugiakampio skaidymo į dalis, kurių viršūnių skaičius neviršyja nustatyto skaičiaus problema. Apibrėžiamas uždavinys ir jo svarba. Apžvelgiami egzistuojantys skaidymo algoritmai, padedantys išspręsti uždavinį, bei jų realizacijos. Pateikiamos trianguliacijos ir padalinimo į apytiksliai iškilius daugiakampius algoritmų modifikacijos, jų privalumai ir trūkumai. Įvertinamas šių modifikuotų algoritmų sudėtingumas. Eksperimentinėje dalyje pateikiami skaičiavimo eksperimentų rezultatai, jų analizė ir palyginimas su teoriniais algoritmų sudėtingumo įverčiais. Remiantis skaičiavimo eksperimentų rezultatais pateikiamos išvados ir siūlymai. / This study deals with decomposition of simple polygon with holes into components so that every piece does not exceed some defined number of vertices. We define the problem and its appliances. Existing studies and algorithms for polygon decomposition are covered. We propose modifications of polygon triangulation and approximate convex decomposition algorithms. Also the complexity analysis of both algorithms is made. In the experimental part of the work results of computing experiments are presented, analyzed and compared to the theoretical complexity bounds.

Submitted by Rosivalda Pereira (mrs.pereira@ufma.br) on 2017-08-14T17:46:24Z No. of bitstreams: 1 DanielGomesJunior.pdf: 2504797 bytes, checksum: 884299d9ce4456c07e4e57e87a6a36d9 (MD5) / Made available in DSpace on 2017-08-14T17:46:24Z (GMT). No. of bitstreams: 1 DanielGomesJunior.pdf: 2504797 bytes, checksum: 884299d9ce4456c07e4e57e87a6a36d9 (MD5) Previous issue date: 2010-07-15 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / This paper presents a study about the electric power systems visualization presenting as results: the implementation of the main visualization techniques used in the operation and control of these systems; a new representation of electrical magnitudes with the use of Thiessen polygons; and finally, the presentation of a new paradigm in information management and manipulation of the power system graphics in a three-dimensional environment. Moreover, it presents the architecture used in the construction of this threedimensional viewing environment, which in our work, enabled the creation of a virtual control room where operators can build and add to the virtual environment the wanted and available visualization in the management of the electric system, enabling the analysis of the problem from several di erent aspects. / Este trabalho apresenta um estudo sobre visualização de sistemas elétricos de potência e tem como resultados: a implementação das principais técnicas de visualização utilizadas no controle e operação destes sistemas; uma nova representação de grandezas elétricas com a utilização dos polígonos de Thiessen; e por fim, a apresentação de um novo paradigma no gerenciamento das informações e manipulação dos gréficos dos sistemas de potência em um ambiente tridimensional. Ademais, apresenta-se a arquitetura utilizada na construção deste ambiente de visualização tridimensional que, em nosso trabalho, possibilitou a criação de uma sala virtual de controle, na qual os operadores podem construir e adicionar ao ambiente virtual as visualizações desejadas e disponíveis no gerenciamento do sistema elétrico, possibilitando a análise do problema sob vários aspectos diferentes.

Made available in DSpace on 2016-04-28T20:19:53Z (GMT). No. of bitstreams: 1 2008 - Ana Maria Motta Ribeiro.pdf: 1483676 bytes, checksum: f690f9b834362b5dbb0eb9c9597a9fbd (MD5) Previous issue date: 2008-02-29 / This paper tries to analyze, in a critical way, the syndicalism in the Polo Sindical do Subm?dio S?o Francisco, inserted in a region identified by the Press as the Hemp Polygon. It intends to understand, from the field work, the insertion of the subject of the hemp plantation (criminalized) in the agenda of the Polo Sindical do Subm?dio S?o Francisco. The study intends to understand this phenomenon through a historical retrospection and an analysis about the region understood as a social-political production of territorialities. Also, it develops an attempt of explanation of the crossing between illegal agriculture and the dynamic of syndical struggle for the recovery of the version which the entity produces and legitimates as its biography in order to understand how and by whom the justification of that crossing is built. In this process of sociological undoing of the Hemp Polygon, it is shown how, when and through which means the subject of the illegal cultivation enters the agenda of the entity. / Esta TESE tenta analisar de modo cr?tico o sindicalismo do P?lo Sindical do Subm?dio S?o Francisco inserido numa regi?o identificada pela M?dia como o Pol?gono da Maconha . Pretende compreender, a partir de pesquisa de campo, a entrada do tema do plantio de maconha (criminalizado) na agenda do P?lo Sindical do Subm?dio S?o Francisco. O estudo pretende entender esse fen?meno atrav?s de uma retrospectiva hist?rica e de uma an?lise sobre a regi?o entendida como uma produ??o s?cio pol?tica de territorialidades. Tamb?m desenvolve uma tentativa de explica??o do cruzamento entre agricultura il?cita e a din?mica da luta sindical, pela recupera??o da vers?o que a entidade produz e legitima como sua biografia para entender como ? elaborada e por quem, a justificativa desse cruzamento. Neste processo de desconstru??o sociol?gica do Pol?gono da Maconha, se destaca como, quando e atrav?s de que media??es o tema do cultivo il?cito entra na agenda da entidade.

Inom många tillämpningar används konforma avbildningar för att transformera tvådimensionella områden till områden med enklare utseende. Ett exempel på ett sådant område är en kanal av varierande tjocklek begränsad av en kontinuerligt deriverbar kurva. I de tillämpningar som har motiverat detta arbete, är det viktigt att dessa egenskaper bevaras i det område en approximativ konform avbildning producerar, men det är också viktigt att begränsningskurvans riktning kan kontrolleras, särkilt i kanalens båda ändar. Denna avhandling behandlar tre olika metoder för att numeriskt konstruera konforma avbildningar mellan ett enkelt standardområde, företrädesvis det övre halvplanet eller enhetscirkeln, och ett område begränsat av en kontinuerligt deriverbar kurva, där begränsningskurvans riktning kan kontrolleras, exakt eller approximativt. Den första metoden är en utveckling av en idé, först beskriven av Peter Henrici, där en modifierad Schwarz-Christoffel-avbildning avbildar det övre halvplanet konformt på en polygon med rundade hörn. Med utgångspunkt i denna idé skapas en algoritm för att konstruera avbildningar på godtyckliga områden med släta randkurvor. Den andra metoden bygger också den på Schwarz-Christoffel-avbildningen, och utnyttjar det faktum att om enhetscirkeln eller halvplanet avbildas på en polygon kommer ett område Q i det inre av dessa, som till exempel en cirkel med centrum i origo och radie mindre än 1, eller ett område i övre halvplanet begränsat av två strålar, att avbildas på ett område R i det inre av polygonen begränsat av en slät kurva. Vi utvecklar en metod för att hitta ett polygonalt område P, utanför det Omega som man önskar att skapa en avbildning för, sådant att den Schwarz-Christoffel-avbildning som avbildar enhetscirkeln eller halvplanet på P, avbildar Q på Omega. I båda dessa fall används tangentpolygoner för att numeriskt bestämma den önskade avbildningen. Slutligen beskrivs en metod där en av Don Marshalls så kallade zipper-algoritmer används för att skapa en avbildning mellan det övre halvplanet och en godtycklig kanal, begränsad av släta kurvor, som i båda ändar går mot oändligheten som räta parallella linjer. / In many applications, conformal mappings are used to transform two-dimensional regions into simpler ones. One such region for which conformal mappings are needed is a channel bounded by continuously differentiable curves. In the applications that have motivated this work, it is important that the region an approximate conformal mapping produces, has this property, but also that the direction of the curve can be controlled, especially in the ends of the channel. This thesis treats three different methods for numerically constructing conformal mappings between the upper half-plane or unit circle and a region bounded by a continuously differentiable curve, where the direction of the curve in a number of control points is controlled, exact or approximately. The first method is built on an idea by Peter Henrici, where a modified Schwarz-Christoffel mapping maps the upper half-plane conformally on a polygon with rounded corners. His idea is used in an algorithm by which mappings for arbitrary regions, bounded by smooth curves are constructed. The second method uses the fact that a Schwarz-Christoffel mapping from the upper half-plane or unit circle to a polygon maps a region Q inside the half-plane or circle, for example a circle with radius less than 1 or a sector in the half--plane, on a region Omega inside the polygon bounded by a smooth curve. Given such a region Omega, we develop methods to find a suitable outer polygon and corresponding Schwarz-Christoffel mapping that gives a mapping from Q to Omega. Both these methods use the concept of tangent polygons to numerically determine the coefficients in the mappings. Finally, we use one of Don Marshall's zipper algorithms to construct conformal mappings from the upper half--plane to channels bounded by arbitrary smooth curves, with the additional property that they are parallel straight lines when approaching infinity.

There are few methods available for the spatial-temporal analysis of polygon data. This research develops a new method for spatial-temporal analysis of moving polygons (STAMP). Using an event-based framework, polygons from neighboring time periods are related by spatial overlap and proximity. The proximity spatial relation is defined by an application specific distance threshold. STAMP is demonstrated in the spatial-temporal analysis of a wildfire burning over small spatial and temporal scales, and in the spatial-temporal analysis of mountain pine beetle (Dendroctonus ponderosae Coleoptera: Hopkins) movement patterns over large spatial and temporal scales. The mountain pine beetle analysis found that short range movement patterns of mountain pine beetles occurred at different beetle population levels. Spot proliferation occurred most when beetle presence was increasing slowly, perhaps moving into new areas for the first time. When beetle presence increased rapidly, local expansion, or spot growth, was a more common movement pattern. In the Pine Pass study area. long range dispersal markedly extended the northeast border of the mountain pine beetle range.