65 resultados para Minimal maps for coincidence
Resumo:
Amb l'evolució de les noves tecnologies, els Sistemes d'Informació Geogràfica (SIG) es basen cada vegada menys en plataformes propietàries (únicament a l'abast de grans companyies). L'objectiu que persegueix el Open Geospatial Consortium (OGC) és que tot el món pugui beneficiar-se de la informació geogràfica, fent que els serveis estiguin disponibles en qualsevol xarxa, aplicació o sistema.
Resumo:
El present treball tractarà d'aprofitar Google Maps i les eines lliures disponibles, per construir unes llibreries Javascript d'ús obert que permetin afegir serveis de persistència als serveis de cartografia ja disponibles.
Resumo:
En aquest document es recull i descriuen els treballs fets al Treball de Final de Carrera, en la especialitat de Sistemes d'Informació Geogràfica (SIG). La finalitat del projecte es utilitzar les tecnologies SIG per crear una pagina web on es representin els jaciments arqueològics del Museu de Molins de Rei de forma visual fàcil e interactiva sobre el mateix mapa. Per això es farà una web que sigui un "Mash-Up" utilitzant les les funcionalitats que proporcionen les Api de Google Maps.
Resumo:
El Museu Municipal de Molins de Rei desitja posar a la disposició dels visitants, tant presencials com virtuals, el seu fons, així com disposar d'una eina que permeti visualitzar sobre un mapa la distribució dels seus jaciments.L'usuari d'aquest projecte disposarà d'una eina que li facilitarà triar els jaciments en funció del període històric que vol consultar, accedint a través d'aquests a la documentació relativa als períodes històrics del jaciment, la de les troballes corresponents a cada període històric del jaciment i a les imatges tant del jaciment com dels objectes que s'hi han trobat.També disposarà d'una eina que li donarà les indicacions adequades per tal de poder arribar des de l'adreça que desitgi fins a la seu del museu o fins als diferents jaciments.
Resumo:
Self-organizing maps (Kohonen 1997) is a type of artificial neural network developedto explore patterns in high-dimensional multivariate data. The conventional versionof the algorithm involves the use of Euclidean metric in the process of adaptation ofthe model vectors, thus rendering in theory a whole methodology incompatible withnon-Euclidean geometries.In this contribution we explore the two main aspects of the problem:1. Whether the conventional approach using Euclidean metric can shed valid resultswith compositional data.2. If a modification of the conventional approach replacing vectorial sum and scalarmultiplication by the canonical operators in the simplex (i.e. perturbation andpowering) can converge to an adequate solution.Preliminary tests showed that both methodologies can be used on compositional data.However, the modified version of the algorithm performs poorer than the conventionalversion, in particular, when the data is pathological. Moreover, the conventional ap-proach converges faster to a solution, when data is \well-behaved".Key words: Self Organizing Map; Artificial Neural networks; Compositional data
Resumo:
Starting with logratio biplots for compositional data, which are based on the principle of subcompositional coherence, and then adding weights, as in correspondence analysis, we rediscover Lewi's spectral map and many connections to analyses of two-way tables of non-negative data. Thanks to the weighting, the method also achieves the property of distributional equivalence
Resumo:
Photo-mosaicing techniques have become popular for seafloor mapping in various marine science applications. However, the common methods cannot accurately map regions with high relief and topographical variations. Ortho-mosaicing borrowed from photogrammetry is an alternative technique that enables taking into account the 3-D shape of the terrain. A serious bottleneck is the volume of elevation information that needs to be estimated from the video data, fused, and processed for the generation of a composite ortho-photo that covers a relatively large seafloor area. We present a framework that combines the advantages of dense depth-map and 3-D feature estimation techniques based on visual motion cues. The main goal is to identify and reconstruct certain key terrain feature points that adequately represent the surface with minimal complexity in the form of piecewise planar patches. The proposed implementation utilizes local depth maps for feature selection, while tracking over several views enables 3-D reconstruction by bundle adjustment. Experimental results with synthetic and real data validate the effectiveness of the proposed approach
Resumo:
We prove that every non-constant holomorphic map&em&M&/em&&sub&g,p&/sub&→ &em&M&/em&&sub& g',p'&/sub& between moduli spaces of Riemann surfaces is a forgetful map, provided that g ≥ 6 and g' ≤ 2g-2.
Resumo:
Este trabajo final de carrera presenta la arquitectura e implementación de un entorno web para la descripción y visualización de instancias reales del TSP (Travelling Salesman Problem), a través de Google Maps, y su posterior resoluación mediante tècnicas de optimización combinatoria.
Resumo:
To perform a climatic analysis of the annual UV index (UVI) variations in Catalonia, Spain (northeast of the Iberian Peninsula), a new simple parameterization scheme is presented based on a multilayer radiative transfer model. The parameterization performs fast UVI calculations for a wide range of cloudless and snow-free situations and can be applied anywhere. The following parameters are considered: solar zenith angle, total ozone column, altitude, aerosol optical depth, and single-scattering albedo. A sensitivity analysis is presented to justify this choice with special attention to aerosol information. Comparisons with the base model show good agreement, most of all for the most common cases, giving an absolute error within 0.2 in the UVI for a wide range of cases considered. Two tests are done to show the performance of the parameterization against UVI measurements. One uses data from a high-quality spectroradiometer from Lauder, New Zealand [45.04°S, 169.684°E, 370 m above mean sea level (MSL)], where there is a low presence of aerosols. The other uses data from a Robertson–Berger-type meter from Girona, Spain (41.97°N, 2.82°E, 100 m MSL), where there is more aerosol load and where it has been possible to study the effect of aerosol information on the model versus measurement comparison. The parameterization is applied to a climatic analysis of the annual UVI variation in Catalonia, showing the contributions of solar zenith angle, ozone, and aerosols. High-resolution seasonal maps of typical UV index values in Catalonia are presented
Resumo:
Following the approach developed by Luttens (2010), we consider a model where individuals with di fferent levels of skills exert di fferent levels of e ffor. Speci fically, we propose a redistribution mechanism based on a lower bound on what every individual deserves: the so-called minimal rights (O'Neill (1982)). Our re finement of Luttens' mechanism ensures at the same time minimal rights based solidarity, participation (non-negativity) and claims feasibility. Keywords: Redistribution mechanism, Minimal rights, Solidarity, Participation, Claims feasibility. JEL classi fication: C71, D63, D71.
Resumo:
We compare two methods for visualising contingency tables and developa method called the ratio map which combines the good properties of both.The first is a biplot based on the logratio approach to compositional dataanalysis. This approach is founded on the principle of subcompositionalcoherence, which assures that results are invariant to considering subsetsof the composition. The second approach, correspondence analysis, isbased on the chi-square approach to contingency table analysis. Acornerstone of correspondence analysis is the principle of distributionalequivalence, which assures invariance in the results when rows or columnswith identical conditional proportions are merged. Both methods may bedescribed as singular value decompositions of appropriately transformedmatrices. Correspondence analysis includes a weighting of the rows andcolumns proportional to the margins of the table. If this idea of row andcolumn weights is introduced into the logratio biplot, we obtain a methodwhich obeys both principles of subcompositional coherence and distributionalequivalence.
Resumo:
An important problem in descriptive and prescriptive research in decision making is to identify regions of rationality, i.e., the areas for which heuristics are and are not effective. To map the contours of such regions, we derive probabilities that heuristics identify the best of m alternatives (m > 2) characterized by k attributes or cues (k > 1). The heuristics include a single variable (lexicographic), variations of elimination-by-aspects, equal weighting, hybrids of the preceding, and models exploiting dominance. We use twenty simulated and four empirical datasets for illustration. We further provide an overview by regressing heuristic performance on factors characterizing environments. Overall, sensible heuristics generally yield similar choices in many environments. However, selection of the appropriate heuristic can be important in some regions (e.g., if there is low inter-correlation among attributes/cues). Since our work assumes a hit or miss decision criterion, we conclude by outlining extensions for exploring the effects of different loss functions.
Resumo:
Let S be a fibred surface. We prove that the existence of morphisms from non countably many fibres to curves implies, up to base change, the existence of a rational map from S to another surface fibred over the same base reflecting the properties of the original morphisms. Under some conditions of unicity base change is not needed and one recovers exactly the initial maps.