Dissertations / Theses: 'Maps'

1

Angelsberg, Gilles. "Biharmonic maps /." Zürich : ETH, 2007. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17187.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lamm, Tobias. "Biharmonic maps." [S.l. : s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=974969281.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Manhart, Samuel H. "OLD MAPS." Fogler Library, University of Maine, 2002. http://www.library.umaine.edu/theses/pdf/ManhartSH2002.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Carlson, Erik. "Audio Maps." Thesis, Linköpings universitet, Institutionen för teknik och naturvetenskap, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-96206.

Full text

Abstract:

In most modern computer games, ambient soundtracks are used to enhance the immersive quality of the game. These ambient tracks are often simply stereo samples playing on repeat for as long as the player's avatar is within a simply specified – for example, within a given distance – area in the game world. This kind of ambient sound provides only the crudest form of navigational information – whether the player avatar is inside or outside the ambient source's area of effect. This thesis discusses the idea and implementation of a system that allows for arbitrarily shaped areas of effect by using painted maps. The source fields are generated from the maps in order to emulate directionality and distribution of the ambient sound. In addition, the implementation should also take the height map of the game terrain into account, and change the behaviour of the source fields accordingly. The implementation uses the OpenAL interface to position point audio sources, according to the calculations based on the input maps, for the audio output. Two different approaches to point source positioning were examined; the grid layout, where the point sources were positioned uniformly around the avatar, and the dynamic sector approach, in which the positioning depends on how big a circle sector the source field describes as seen from the avatar position. The terrain interaction uses a ray-tracing algorithm that “crawls” over the landscape to find the shortest possible straight path from avatar to source over the terrain. In the current version of the implementation, a simple intensity modification accounts for the terrain impact on sound propagation.

APA, Harvard, Vancouver, ISO, and other styles

5

Anand, Christopher Kumar. "Harmonic maps." Thesis, McGill University, 1990. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=59558.

Full text

Abstract:

After a brief introduction, we consider three main results in the existence theory of harmonic maps between manifolds. The first is the heat-equation proof of Eells and Sampson, which says that minimal harmonic maps of compact manifolds into compact manifolds with nonpositive curvature always exist. The next two results show they exist among maps of compact Riemann surfaces into compact manifolds, N, with $ pi sb2$(N) = 0. One proof uses the induced $ pi sb1$-action of Schoen and Yau; the other a perturbation of the action due to Sacks and Uhlenbeck. As required, we also develop some of the regularity theory, especially that for surfaces.

APA, Harvard, Vancouver, ISO, and other styles

6

Falcão, Renato Pinto de Queiroz. "Reasoning Maps." Florianópolis, SC, 2003. http://repositorio.ufsc.br/xmlui/handle/123456789/84814.

Full text

Abstract:

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia de Produção.
Made available in DSpace on 2012-10-20T12:45:01Z (GMT). No. of bitstreams: 1 225064.pdf: 1186448 bytes, checksum: 0c2e5acf545c7274024a1ada8d2abeb0 (MD5)
Esta dissertação apresenta uma ferramenta de apoio à decisão, baseada na Metodologia Multicritérios de Apoio à Decisão - MCDA, através do desenvolvimento de um software denominado Reasoning Maps. O software permite, de maneira integrada, a construção de mapas cognitivos, suas diversas análises topológicas e o cadastramento e análise de alternativas. Aborda um estudo de caso procurando demonstrar os recursos utilizados na criação, inicialmente, de um mapa cognitivo conciso, os diversos tipos de análises topológicas - caminhos, clusters e análise concisa, que corresponde à análise das causalidades entre conceitos do mapa. Evidencia a transformação do mapa conciso em um mapa difuso através da modelização dos graus de influência percebida pelo tomador de decisão. Procede com a entrada de medidores de performance (descritores), utilizados como parâmetro de avaliação de alternativas. Elabora o cadastro e a análise das alternativas utilizando os operadores fuzzy: Máximo, Média Ponderada, Mediana e Agregação Linear como suporte para efetivação dos cálculos. Gera relatórios das análises em tela e impressos. Permite ao decisor conhecer melhor o ambiente decisório e melhorar o nível de avaliação das alternativas. Formula conclusões e faz sugestões visando o aperfeiçoamento do estudo, no encerramento do texto. Um estudo de caso foi empregado para teste do software em uma situação real de apoio à decisão e é também descrito ao longo da dissertação.

APA, Harvard, Vancouver, ISO, and other styles

7

Vassoler, Geraldo Angelo. "MERGE MAPS : um mecanismo computacional para mesclagem de mapas conceituais." reponame:Repositório Institucional da UFES, 2014. http://repositorio.ufes.br/handle/10/2000.

Full text

Abstract:

Submitted by Maykon Nascimento (maykon.albani@hotmail.com) on 2016-06-21T18:33:30Z No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Dissertacao Geraldo Azevedo Vassoler.pdf: 2335913 bytes, checksum: e840199d74841a1ee3bde19fa5533a08 (MD5)
Approved for entry into archive by Patricia Barros (patricia.barros@ufes.br) on 2016-07-01T13:52:40Z (GMT) No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Dissertacao Geraldo Azevedo Vassoler.pdf: 2335913 bytes, checksum: e840199d74841a1ee3bde19fa5533a08 (MD5)
Made available in DSpace on 2016-07-01T13:52:40Z (GMT). No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Dissertacao Geraldo Azevedo Vassoler.pdf: 2335913 bytes, checksum: e840199d74841a1ee3bde19fa5533a08 (MD5)
Mapas Conceituais são representações gráficas do conhecimento acerca de um dado domínio frequentemente utilizadas em abordagens pedagógicas com finalidade de promover aprendizagens significativas e de representar e organizar um conjunto de significados em uma estrutura proposicional. Nesse processo de aprendizagem, os mapas conceituais podem ser considerados como meios para identificar conceitos e seus significados, dando origem ao conhecimento de forma explícita. Porém, o acompanhamento desse aprendizado é realizado de forma lenta e individual, no qual num contexto coletivo, não se pode mensurar o conhecimento de uma turma em um dado conhecimento. Esta dissertação propõe uma abordagem focada na importância da mesclagem de mapas conceituais e suas implicações no acompanhamento e na avaliação de desempenho de turmas em contextos gerais. Uma solução computacional foi desenvolvida para realizar automaticamente a mesclagem, a fim de promover uma melhor avaliação coletiva por parte dos docentes.
Concept maps are graphical representations of knowledge about a given domain often used in pedagogical approaches with the purpose of promoting meaningful learning and to represent and organize a set of meanings in a propositional framework. In this learning process, concept maps can be considered as a means to identify concepts and their meanings, giving rise to knowledge explicitly. However, monitoring of this learning is performed slowly and individually, in which a collective context, one cannot measure knowledge of a class in a given knowledge. This dissertation proposes a focus on the importance of the fusion of concept maps and their implications in monitoring and evaluating the performance of groups in general contexts approach. A computational solution is designed to automatically perform the merger in order to promote a better collective assessment by teachers. Keywords: Concept maps, merging of maps, assessment of Learning e WordNet.

APA, Harvard, Vancouver, ISO, and other styles

8

VASSOLER, G. A. "MERGE MAPS Um Mecanismo Computacional para Fusão de Mapas Conceituais." Universidade Federal do Espírito Santo, 2014. http://repositorio.ufes.br/handle/10/4265.

Full text

Abstract:

Made available in DSpace on 2016-08-29T15:33:18Z (GMT). No. of bitstreams: 1 tese_7978_Dissertação_Geraldo.pdf: 2335913 bytes, checksum: e840199d74841a1ee3bde19fa5533a08 (MD5) Previous issue date: 2014-09-04
Mapas Conceituais são representações gráficas do conhecimento acerca de um dado domínio freqüentemente utilizadas em abordagens pedagógicas com finalidade de promover aprendizagens significativas. Nesta pesquisa é discutida a importância da fusão de mapas conceituais e suas implicações no acompanhamento e na avaliação de desempenho de turmas em contextos gerais. Uma ferramenta computacional é modelada (MERGE MAPS) e uma prova de conceito é apresentada. Espera-se que, quando se trata de um mesmo domínio de conhecimento, ocorram diversas repetições de conceitos e relações presentes nas versões individualizadas dos mapas, mesmo que representados por meio de sinônimos. Portanto, no processo de fusão deve-se prever e identificar a ocorrência desses fatos. Tal informação pode ser valiosa para o docente pois esses conceitos e relações que se repetem nas diversas versões individualizadas dos mapas podem ser considerados como representações do conhecimento médio da turma, sendo esse um dos fatores que tornam a fusão um serviço relevante para os mapas conceituais. O conhecimento médio da turma pode apontar para o docente, por exemplo, em que grau está o entendimento geral de uma turma dos assuntos que estão sendo trabalhados em sala de aula. Permite identificar, também, aqueles conceitos ainda não formalizados pelos discentes, indicando assim que precisam ser melhor explorados. A fusão de diferentes mapas permite ainda obter uma descrição mais precisa de um determinado domínio de conhecimento. Diferentes textos podem ser descritos por meio de mapas.

APA, Harvard, Vancouver, ISO, and other styles

9

Van, Horn R. Brooks III. "Procedural Reduction Maps." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/14484.

Full text

Abstract:

Procedural textures and image textures are commonplace in graphics today, finding uses in such places as animated movies and video games. Unlike image texture maps, procedural textures typically suffer from minification aliasing. I present a method that, given a procedural texture on a surface, automatically creates an anti-aliased version of the procedural texture. The new procedural texture maintains the original textures details, but reduces minification aliasing artifacts. This new algorithm creates an image pyramid similar to MIP-Maps to represent the texture. Whereas a MIP-Map stores per-texel color, however, my texture hierarchy stores weighted sums of reflectance functions, allowing a wider-range of effects to be anti-aliased. The stored reflectance functions are automatically selected based on an analysis of the different functions found over the surface. When the texture is viewed at close range, the original texture is used, but as the texture footprint grows, the algorithm gradually replaces the textures result with an anti-aliased one. This results in faster development time for writing procedural textures as well as higher visual fidelity and faster rendering. With the optional addition of authoring guidelines, the analysis phase can be sped up by as much as two orders of magnitude. Furthermore, I developed a method for handling pre-filtered integration of reflectance functions to anti-alias specular highlights. The normal-centric BRDF (NBRDF) allows for fast evaluation over a range of normals appearing on the surface of an object. The NBRDF is easy to implement on the GPU for real-time results and can be combined with procedural reduction maps for real-time procedural texture minification anti-aliasing.

APA, Harvard, Vancouver, ISO, and other styles

10

Ray, Gourab. "Hyperbolic random maps." Thesis, University of British Columbia, 2014. http://hdl.handle.net/2429/48417.

Full text

Abstract:

Random planar maps have been an object of utmost interest over the last decade and half since the pioneering works of Benjamini and Schramm, Angel and Schramm and Chassaing and Schaeffer. These maps serve as models of random surfaces, the study of which is very important with motivations from physics, combinatorics and random geometry. Uniform infinite planar maps, introduced by Angel and Schramm, which are obtained as local limits of uniform finite maps embedded in the sphere, serve as a very important discrete model of infinite random surfaces. Recently, there has been growing interest to create and understand hyperbolic versions of such uniform infinite maps and several conjectures and proposed models have been around for some time. In this thesis, we mainly address these questions from several viewpoints and gather evidence of their existence and nature. The thesis can be broadly divided into two parts. The first part is concerned with half planar maps (maps embedded in the upper half plane) which enjoy a certain domain Markov property. This is reminiscent of that of the SLE curves. Chapters 2 and 3 are mainly concerned with classi cation of such maps and their study, with a special focus on triangulations. The second part concerns investigating unicellular maps or maps with one face embedded in a high genus surface. Unicellular maps are generalizations of trees in higher genera. The main motivation is that investigating such maps will shed some light into understanding the local limit of general maps via some well-known bijective techniques. We obtain certain information about the large scale geometry of such maps in Chapter 4 and about the local limit of such maps in Chapter 5.
Science, Faculty of
Mathematics, Department of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

11

Moorut, Ben. "Labelling utility maps /." Leeds : University of Leeds, School of Computer Studies, 2008. http://www.comp.leeds.ac.uk/fyproj/reports/0708/Moorut.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Clark, Lyndsey. "Maps with holes." Thesis, University of Manchester, 2016. https://www.research.manchester.ac.uk/portal/en/theses/maps-with-holes(d68c4488-4b73-455c-ba48-d2110e068d88).html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Drumm, Jill Marie. "MAPS OF EXODUS." FIU Digital Commons, 2006. http://digitalcommons.fiu.edu/etd/3088.

Full text

Abstract:

MAPS OF EXODUS is a poetry collection thematically unified through recurring images of wings, flight, maps, and emotional or geographic dislocation. These images emerge as interpretations of various psychological and physical mediums of escape, often signifying aspects of the archetypal journey. Influenced by Louise Glück's Wild Iris and Emily Dickinson's collected works, the poems often utilize language compressed to maximize emotional and thematic impact in spare lyrical poems. At other times the poems expand in language and form to Barbara Hamby's bountiful proportions and Theodore Roethke's vegetative abundance. The collection interweaves poems that explore the breakdown of family structures, the grieving process through recurrent pregnancy loss, domestic confusion, and a failed marriage. The latter sections shift toward poems that communicate redemption and consolation through travel, the natural world, and new relationships. Each section is interwoven with garden, greenhouse, and nature imagery to emphasize the ongoing search for renewal and regeneration.

APA, Harvard, Vancouver, ISO, and other styles

14

Ranganathan, Ananth. "Probabilistic topological maps." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/22643.

Full text

Abstract:

Thesis (Ph. D.)--Computing, Georgia Institute of Technology, 2008.
Committee Chair: Dellaert, Frank; Committee Member: Balch, Tucker; Committee Member: Christensen, Henrik; Committee Member: Kuipers, Benjamin; Committee Member: Rehg, Jim.

APA, Harvard, Vancouver, ISO, and other styles

15

Woods, Tadg Howard. "Lorentz wave maps /." view abstract or download file of text, 2001. http://wwwlib.umi.com/cr/uoregon/fullcit?p3024539.

Full text

Abstract:

Thesis (Ph. D.)--University of Oregon, 2001.
Typescript. Includes vita and abstract. Includes bibliographical references (leaves 122-123). Also available for download via the World Wide Web; free to University of Oregon users.

APA, Harvard, Vancouver, ISO, and other styles

16

Espinoza, Benjamin. "Whitney preserving maps." Morgantown, W. Va. : [West Virginia University Libraries], 2002. http://etd.wvu.edu/templates/showETD.cfm?recnum=2451.

Full text

Abstract:

Thesis (Ph. D.)--West Virginia University, 2002.
Title from document title page. Document formatted into pages; contains vii, 60 p. : ill. Includes abstract. Includes bibliographical references (p. 59-60).

APA, Harvard, Vancouver, ISO, and other styles

17

Streipel, Jakob. "Modelling the Number of Periodic Points of Quadratic Maps Using Random Maps." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-65548.

Full text

Abstract:

Since the introduction of Pollard's rho method for integer factorisation in 1975 there has been great interest in understanding the dynamics of quadratic maps over finite fields. One avenue for this, and indeed the heuristic on which Pollard bases the proof of the method's efficacy, is the idea that quadratic maps behave roughly like random maps. We explore this heuristic from the perspective of comparing the number of periodic points. We find that empirically random maps appear to model the number of periodic points of quadratic maps well, and moreover prove that the number of periodic points of random maps satisfy an interesting asymptotic behaviour that we have observed experimentally for quadratic maps.

APA, Harvard, Vancouver, ISO, and other styles

18

Pinheiro, Jose de Queiroz 1951. "Determinants of cognitive maps of the world as expressed in sketch maps." Diss., The University of Arizona, 1996. http://hdl.handle.net/10150/282105.

Full text

Abstract:

Cognitive representations of the world have been typically studied by means of either qualitative approaches or bivariate association. The sketch map technique and other strategies of data collection have been used in the past, in many instances applied to reduced sets of world nations. In the present study sketch maps of the world drawn by Brazilian university students were examined in terms of frequency of inclusion of nations to verify the combined influence of potential determinants of that inclusion. A graphical procedure was devised to differentiate shared and parochial views of the world and to simultaneously indicate possible predictive variables. The quantitative analysis of the effects of world countries' characteristics upon the inclusion of nations on the sketch maps was proposed as an additional step for a better understanding of the complex process of formation of cognitive representations of the world. Map features and other characteristics of world countries were analyzed and selected by correlational techniques, including exploratory factor analysis, to be part of multiple regression models used to account for the inclusions of nations. The exploratory regression analyses were performed on a random half of the Brazilian sample of students, according to a combined use of hierarchical analysis, based on classes of causal precedence of the independent variables, and stepwise selection within those classes. The final multiple regression equations accounted for approximately 75 percent of the variance of the dependent variable. A cross-validation procedure was then accomplished, which confirmed the results of the exploratory phase. The main influences upon the inclusion of nations by the Brazilian students were exerted by world indicators of geopolitical, military and economic power, as represented by the strategy board game "WARII" and citations of nations on a Brazilian newspaper. The second group in importance was formed by structural characteristics of the countries, such as their size and map positioning. Cultural aspects of world countries, including the involvement of the country in soccer, presented the smallest effect.

APA, Harvard, Vancouver, ISO, and other styles

19

Sadykov, Rustam. "Singularities of smooth maps." [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0004282.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Moeller, Todd Keith. "Conley-Morse Chain Maps." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7221.

Full text

Abstract:

We introduce a new class of Conley-Morse chain maps for the purpose of comparing the qualitative structure of flows across multiple scales. Conley index theory generalizes classical Morse theory as a tool for studying the dynamics of flows. The qualitative structure of a flow, given a Morse decomposition, can be stored algebraically as a set of homology groups (Conley indices) and a boundary map between the indices (a connection matrix). We show that as long as the qualitative structures of two flows agree on some, perhaps coarse, level we can construct a chain map between the corresponding chain complexes that preserves the relations between the (coarsened) Morse sets. We present elementary examples to motivate applications to data analysis.

APA, Harvard, Vancouver, ISO, and other styles

21

Naz, Asma. "3D interactive pictorial maps." Texas A&M University, 2004. http://hdl.handle.net/1969.1/1571.

Full text

Abstract:

The objective of my research is to revive and practice the art of traditional pictorial maps in 3D cartographic visualization. I have chosen to create both graphical and statistical pictorial maps which can be used for the purpose of tourism and data representation respectively. Some traditional hand-drawn and sculptural pictorial maps of famous artists have been picked out to start as a base for my work. The goal was to recreate or imitate the style, character and features of these traditional hand-drawn and sculptural maps with 3D computer graphics and to analyze how effectively 3D tools can be used to communicate map information. I also wanted to explore ways to make these maps interactive on the Web and have them accessible to a large number of viewers. The results show a number of interactive 3D pictorial maps of different countries and continents. These maps are initially built with Maya, a 3D modeling software, and converted into web pages using the Viewpoint Technology. For statistical maps, Mel scripts have been used in Maya to take input from the user and change the shape of models accordingly to represent data. These maps are interactive and navigable and are designed to be easily accessible on the Web.

APA, Harvard, Vancouver, ISO, and other styles

22

Winckler, Björn. "Renormalization of Lorenz Maps." Doctoral thesis, KTH, Matematik (Avd.), 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-34314.

Full text

Abstract:

This thesis is a study of the renormalization operator on Lorenz αmaps with a critical point. Lorenz maps arise naturally as first-return maps for three-dimensional geometric Lorenz flows. Renormalization is a tool for analyzing the microscopic geometry of dynamical systems undergoing a phase transition. In the first part we develop new tools to study the limit set of renormalization for Lorenz maps whose combinatorics satisfy a long return condition. This combinatorial condition leads to the construction of a relatively compact subset of Lorenz maps which is essentially invariant under renormalization. From here we can deduce topological properties of the limit set (e.g. existence of periodic points of renormalization) as well as measure theoretic properties of infinitely renormalizable maps (e.g. existence of uniquely ergodic Cantor attractors). After this, we show how Martens’ decompositions can be used to study the differentiable structure of the limit set of renormalization. We prove that each point in the limit set has a global two-dimensional unstable manifold which is a graph and that the intersection of an unstable manifold with the domain of renormalization is a Cantor set. All results in this part are stated for arbitrary real critical exponents α> 1. In the second part we give a computer assisted proof of the existence of a hyperbolic fixed point for the renormalization operator on Lorenz maps of the simplest possible nonunimodal combinatorial type. We then show how this can be used to deduce both universality and rigidity for maps with the same combinatorial type as the fixed point. The results in this part are only stated for critical exponenta α= 2.
QC 20110627

APA, Harvard, Vancouver, ISO, and other styles

23

Lloyd, D. Brandon Manocha Dinesh N. "Logarithmic perspective shadow maps." Chapel Hill, N.C. : University of North Carolina at Chapel Hill, 2007. http://dc.lib.unc.edu/u?/etd,1437.

Full text

Abstract:

Thesis (Ph. D.)--University of North Carolina at Chapel Hill, 2007.
Title from electronic title page (viewed Apr. 25, 2008). "... in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Computer Science." Discipline: Computer Science; Department/School: Computer Science.

APA, Harvard, Vancouver, ISO, and other styles

24

Angle, Robert Blair. "Holomorphic segre preserving maps." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2008. http://wwwlib.umi.com/cr/ucsd/fullcit?p3304234.

Full text

Abstract:

Thesis (Ph. D.)--University of California, San Diego, 2008.
Title from first page of PDF file (viewed June 19, 2008). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 96-98).

APA, Harvard, Vancouver, ISO, and other styles

25

Perryman, L. J. "Cavity growth mechanism maps." Thesis, University of Surrey, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.381676.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Tardiff, Seth Ronald 1981. "Self-organizing event maps." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/17982.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (leaves 61-62).
To take further steps along the path toward true artificial intelligence, systems must be built that are capable of learning about the world around them through observation and explanation. These systems should be flexible and robust in the style of the human brain and little precompiled knowledge should be given initially. As a step toward achieving this lofty goal, this thesis presents the self-organizing event map (SOEM) architcture. The SOEM architecture seeks to provide a way in which computers can be taught, through simple observation of the world, about typical events in a way that organized according to events that are observed by the system. In this manner, the event map produces clusters of similar events and provides an implicit representation of the regularity within the event space to which the system has been exposed. As part of this thesis, a test system that makes use of self-organizing event map architecture has been developed in conjunction with the Genesis Project at the Computer Science and Artificial Intelligence Laboratory (CSAIL) at MIT. This system receives input through a natural-language text interface and, through repreated training cycles, becomes capable of discerning between typical and exceptional events. Clusters of similar events develop within the map and these clusters act as an implicit is flexible and robust. The self-organizing event map, as a data structure, stores a plane of event models that are continually updated and form of the more commonly used (and explicit) notion of scripts and capability lists. For example, a trained map may recognize that dogs often run, but never fly. Therefore if a new input is received that describes a flying dog, the map would be capable of identifying the event as exceptional
(cont.) (or simply erroneous) and that further attention should be paid. By using clusters of similarity as an implicit representation, the self-organizing event maps presented here more accurately mimic natural memory systems and do not suffer from being tied to the limitations of a specific explicit representation of regularity.
by Seth Ronald Tardiff.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

27

Cyr, William (William B. ). "Attacks on multilinear maps." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/100302.

Full text

Abstract:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Title as it appears in MIT Commencement Exercises program, June 5, 2015: Mmultilinear maps. Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 43-44).
In this thesis, I explore the current multilinear map candidates and attacks against them. This involves analyzing the three proposals for multilinear maps which are based on ideal lattices, integers, and standard lattices. The attacks exploit the geometry of the lattices and linearity of the integers to break security. I also compare the applications of these schemes with what is required for attacks. Key agreement seems to need certain features of multilinear maps which expose vulnerabilities while other applications like indistinguishability obfuscation. I analyze the attacks against these maps and show why they are not able to break the program obfuscation application of multilinear maps.
by William Cyr.
M. Eng.

APA, Harvard, Vancouver, ISO, and other styles

28

Shen, Yang. "Soft Shadow Mip-Maps." Thesis, The University of Utah, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10158459.

Full text

Abstract:

This document introduces the Soft Shadow Mip-Maps technique, which consists of three methods for overcoming the fundamental limitations of filtering-oriented soft shadows. Filtering-oriented soft shadowing techniques filter shadow maps with varying filter sizes determined by desired penumbra widths. Different varieties of this approach have been commonly applied in interactive and real-time applications. Nonetheless, they share some fundamental limitations. First, soft shadow filter size is not always guaranteed to be the correct size for producing the right penumbra width based on the light source size. Second, filtering with large kernels for soft shadows requires a large number of samples, thereby increasing the cost of filtering. Stochastic approximations for filtering introduce noise and prefiltering leads to inaccuracies. Finally, calculating shadows based on a single blocker estimation can produce significantly inaccurate penumbra widths when the shadow penumbras of different blockers overlap.

We discuss three methods to overcome these limitations. First, we introduce a method for computing the soft shadow filter size for a receiver with a blocker distance. Then, we present a filtering scheme based on shadow mip-maps. Mipmap-based filtering uses shadow mip-maps to efficiently generate soft shadows using a constant size filter kernel for each layer, and linear interpolation between layers. Finally, we introduce an improved blocker estimation approach. With the improved blocker estimating, we explore the shadow contribution of every blocker by calculating the light occluded by potential blockers. Hence, the calculated penumbra areas correspond to the blockers correctly. Finally, we discuss how to select filter kernels for filtering.

These approaches successively solve issues regarding shadow penumbra width calculation apparent in prior techniques. Our result shows that we can produce correct penumbra widths, as evident in our comparisons to ray-traced soft shadows. Nonetheless, the Soft Shadow Mip-Maps technique suffers from light bleeding issues. This is because our method only calculates shadows using the geometry that is available in the shadow depth map. Therefore, the occluded geometry is not taken into consideration, which leads to light bleeding. Another limitation of our method is that using lower resolution shadow mip-map layers limits the resolution of the shadow placement. As a result, when a blocker moves slowly, its shadow follows it with discrete steps, the size of which is determined by the corresponding mip-map layer resolution.

APA, Harvard, Vancouver, ISO, and other styles

29

Wilson, Mark Robert. "Historicizing Maps of Hell." Miami University Honors Theses / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=muhonors1115503544.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Khalifeh, Sasha Yasmin. "Maps for the Getaway." Bowling Green State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1428965250.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Catalano, Louisa. "On maps preserving products." Kent State University / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=kent1594320429310821.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Botbol, Nicolas. "Implicitization of rational maps." Paris 6, 2010. http://www.theses.fr/2010PA066266.

Full text

Abstract:

Motivated by the interest in computing explicit formulas for resultants and discriminants we focus on the implicitization of hypersurfaces in several contexts. Implicitization means, given a rational map f:A^n-1->A^n, to compute an implicit equation H of the closed image of im(f). This is a classical problem and there are numerous approaches to its solution (cf. SC95 and Co01). However, it turns out that the implicitization problem is computationally difficult. Our approach is based on the use of linear syzygies by means of approximation complexes, following BuJo03, BC05, and Ch06, where they develop the theory for a rational map f:P^n-1->P^n. Approximation complexes were first introduced by Herzog, Simis and Vasconcelos in HSV82 almost 30 years ago. The main obstruction for this approximation complex-based method comes from the bad behaviour of the based locus of f. Thus, it is natural to try different compatifications of A^n-1, that are better suited to the map F, in order to avoid unwanted base points. With this purpose, in this thesis we study toric compactifications T for A^n-1. First, we view T embedded in a projective space. Furthermore, we compactify the codomain inside (P^1)^n, to deal with the case of different denominators in the rational functions defining f. We also approach the implicitization problem considering the toric variety T defined by its Cox ring, without any particular projective embedding. In all this cases, we blow-up the base locus of the map and we approximate the Rees algebra R_IA of this blow-up by the symmetric algebra S_IA
Motivés par la recherche de formules explicites pour les résultants et les discriminants, on se concentre sur l'implicitisation des hypersurfaces dans plusieurs contextes. Implicitisation signifie calculer une équation implicite H de l'image fermée \overline\im(f), étant donné une application rationnelle f:A^(n-1)-> A^n. C'est un problème classique et il y a de nombreuses approches (cf. \ SC95 et Co01). Toutefois, il s'avère que le problème d'implicitisation est difficile du point de vue du calcul. Notre approche est basée sur l'utilisation des syzygies linéaires au moyen de complexes d'approximation, en suivant BuJo03, BC05, et Ch06, ou ils développent la théorie pour une application rationnelle f:P^(n-1)-> P^n. Les complexes d'approximation ont d'abord été introduits par Herzog, Simis et Vasconcelos dans HSV il y a presque 30 ans. L'obstruction principale de la méthode des complexes d'approximation vient du mauvais comportement du lieu base de f. Ainsi, il est naturel d'essayer différentes compatifications de A^(n-1), qui sont mieux adaptés à f, afin d'éviter des points base non désirés. A cet effet, dans cette thèse on étudie des compactifications toriques T de A^(n-1). Tout d'abord, on considère T plongée dans un espace projectif. En outre, on compactifie le codomaine dans (1)^n, pour faire face aux cas des dénominateurs différents dans les fonctions rationnelles qui définissent f. On a également abordé le problème implicitisation lorsque la variété torique T est définie par son anneau de Cox, sans un plongement projectif particulier. Dans tous ces cas, on éclate le lieu base de f et on approche l'algèbre de Rees R_IA par l'algèbre symétrique S_IA

APA, Harvard, Vancouver, ISO, and other styles

33

Mewes, Daniel, and Ch Jacobi. "Analyzing Arctic surface temperatures with Self Organizing-Maps: Influence of the maps size." Universität Leipzig, 2018. https://ul.qucosa.de/id/qucosa%3A31794.

Full text

Abstract:

We use ERA-Interim reanalysis data of 2 meter temperature to perform a pattern analysis of the Arctic temperatures exploiting an artificial neural network called Self Organizing-Map (SOM). The SOM method is used as a cluster analysis tool where the number of clusters has to be specified by the user. The different sized SOMs are analyzed in terms of how the size changes the representation of specific features. The results confirm that the larger the SOM is chosen the larger will be the root mean square error (RMSE) for the given SOM, which is followed by the fact that a larger number of patterns can reproduce more specific features for the temperature.
Wir benutzten das künstliche neuronale Netzwerk Self Organizing-Map (SOM), um eine Musteranalyse von ERA-Interim Reanalysedaten durchzuführen. Es wurden SOMs mit verschiedener Musteranzahl verglichen. Die Ergebnisse zeigen, dass SOMs mit einer größeren Musteranzahl deutlich spezifischere Muster produzieren im Vergleich zu SOMs mit geringen Musteranzahlen. Dies zeigt sich unter anderem in der Betrachtung der mittleren quadratischen Abweichung (RMSE) der Muster zu den zugeordneten ERA Daten.

APA, Harvard, Vancouver, ISO, and other styles

34

Wang, Xiaoguang. "Dynamics of McMullen maps and Thurston-type theorems for rational maps with rotation domains." Angers, 2011. http://www.theses.fr/2011ANGE0067.

Full text

Abstract:

Cette thèse comporte essentiellement deux parties. La première concerne la connexité locale des ensembles de Julia des fractions rationnelles. Nous utilisons les puzzles de Yoccoz pour étudier les applications de McMullen et montrons que la frontière du bassin de l'infini est toujours une courbe de Jordan. Ceci donne une réponse positive à une question de Devaney. Nous montrons également que ces ensembles de Julia sont localement connexes sauf pour certains cas spéciaux. La deuxième partie concerne la théorie de Thurston sur une caractérisation des fractions rationnelles. Nous établissons un théorème de décomposition : tout revêtement ramifié ayant un domaine de rotation se décompose, suivant une multicourbe, en un nombre fini d'applications de Siegel et de Thurston, tel que les combinatoires et le problème de réalisation rationnelle de ces pièces décomposées dominent essentiellement ceux de l'application originale. En guise d'application, nous démontrons un théorème à la Thurston pour une classe de fractions rationnelles ayant des anneaux d'Herman
The thesis mainly consists of two subjects : the first subject relates to the local connectivity of Julia sets for rational maps. We develop Yoccoz puzzle techniques to study McMullen maps and show that the boundary of the bassin of infinity is always a Jordan curve if the Julia set is not a Cantor set. This give a positive answer to a question of Devaney. We also show the Julia set of McMullen is locally connected except some special cases. The second concerns with Thurston's theory on characterization of rational maps. We establish a "decomposition theorem" : every branched covering with rotation domains can be decomposed along a stable multicurve into finitely many Siegel maps or Thurston maps, such that the combinatorics and rational realizations of these resulting maps essentially dominate the original one. As an application, we prove a Thurston type theorem for a class rational maps with Herman rings

APA, Harvard, Vancouver, ISO, and other styles

35

Bolelli, Maria Virginia. "Diffusion Maps for Dimensionality Reduction." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/18246/.

Full text

Abstract:

In this thesis we present the diffusion maps, a framework based on diffusion processes for finding meaningful geometric descriptions of data sets. A diffusion process can be described via an iterative application of the heat kernel which has two main characteristics: it satisfies a Markov semigroup property and its level sets encode all geometric features of the space. This process, well known in regular manifolds, has been extended to general data set by Coifman and Lafon. They define a diffusion kernel starting from the geometric properties of the data and their density properties. This kernel will be a compact operator, and the projection on its eigenvectors at different instant of time, provides a family of embeddings of a dataset into a suitable Euclidean space. The projection on the first eigenvectors, naturally leads to a dimensionality reduction algorithm. Numerical implementation is provided on different data set.

APA, Harvard, Vancouver, ISO, and other styles

36

Tuttle, Alexander. "Saliency Maps using Channel Representations." Thesis, Linköping University, Department of Electrical Engineering, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-53734.

Full text

Abstract:

In this thesis an algorithm for producing saliency maps as well as an algorithm for detecting salient regions based on the saliency map was developed. The saliency values are computed as center-surround differences and a local descriptor called the region p-channel is used to represent center and surround respectively. An integral image representation called the integral p-channel is used to speed up extraction of the local descriptor for any given image region. The center-surround difference is calculated as either histogram or p-channel dissimilarities.

Ground truth was collected using human subjects and the algorithm’s ability to detect salient regions was evaluated against this ground truth. The algorithm was also compared to another saliency algorithm.

Two different center-surround interpretations are tested, as well as several p-channel and histogram dissimilarity measures. The results show that for all tested settings the best performing dissimilarity measure is the so called diffusion distance. The performance comparison showed that the algorithm developed in this thesis outperforms the algorithm against which it was compared, both with respect to region detection and saliency ranking of regions. It can be concluded that the algorithm shows promising results and further investigation of the algorithm is recommended. A list of suggested approaches for further research is provided.

APA, Harvard, Vancouver, ISO, and other styles

37

Dilmen, Derya Itir. "Gis Based Tsunami Inundation Maps." Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/12610771/index.pdf.

Full text

Abstract:

In this thesis, detailed tsunami numerical modeling study was applied to the selected case studies, Fethiye town (Turkey) and Kiparissia-Zakintos-Pylos (Greece) in Mediterranean, using rupture-specific tsunami sources which can generate tsunamis in Mediterranean. As a first step of the study, the general database of Fethiye and Kiparissia-Zakintos-Pylos were integrated to GIS-based environment to organize, analyze and display reliable data from different sources. Secondly, for each earthquake scenario, the tsunami propagation and coastal amplifications were computed by TUNAMI N3 to evaluate the coastal amplifications of tsunamis and understand the tsunami propagation for the cases. As the final step, a study of inundation areas of probable tsunamis in these regions was performed. Available results were used to understand the effects of tsunamis and assist in developing mitigation strategies. Methods and results were presented and discussed.

APA, Harvard, Vancouver, ISO, and other styles

38

Axelsson, Thomas. "Långa skuggor med shadow maps." Thesis, Högskolan i Skövde, Institutionen för kommunikation och information, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-4976.

Full text

Abstract:

Skuggor i 3D-miljöer är ett mycket efterforskat område, och detta arbete koncentrerar sig på shadow map-algoritmen. Det finns ett problem med denna algoritm, för då en shadow map projiceras på en yta som är större än sig själv så bildas stora trappstegseffekter, vilket kallas aliasing. Problemet som har undersökts är hur olika shadow map-algoritmer i en miljö med långa skuggor beter sig, där ett minimerat antal artefakter så som brus och aliasing är synligt. För detta undersöktes Percentage-Closer Filtering (PCF), som är en variant av shadow map, med olika samplingstekniker – och även en vidarebyggnad med Percentage-Closer Soft Shadow (PCSS) implementerades. Mätningar av realism och brusmängd genomfördes med en användarstudie. Prestandan mättes i klockcykler. Resultatet visade att PCF med samplingstekniken Edge Tap Smoothing kan vara den algoritm som lämpar sig bäst i situationer med långa skuggor i en 3D-miljö; detta för att den interpolerar mellan de projicerade texlarna.

APA, Harvard, Vancouver, ISO, and other styles

39

Goodman, Oliver A. "Metrized laminations and quasisymmetric maps." Thesis, University of Warwick, 1989. http://wrap.warwick.ac.uk/100508/.

Full text

Abstract:

Teichmuller space is defined as a space of hyperbolic structures on a surface rather than as a space of conformal structures. Earthquakes are defined and we see how they correspond to hyperbolic structures, via homeomorphisms of the circle. Metrised laminations are defined and we obtain a correspondence with earthquakes. We deduce a correspondence between measured laminations and earthquakes. We define uniform boundedness of earthquakes and show that such earthquakes are surjective. Quasisymmetric maps are defined and investigated. We show that an earthquake is uniformly bounded if and only if its boundary mapping is quasisymmetric. Finally we show how a uniformly bounded earthquake can be approximated, in a natural fashion, by a bi-Lipechits diffeomorphism.

APA, Harvard, Vancouver, ISO, and other styles

40

Saadé, Elie S. "Triangulating contours in large maps." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0003/MQ29773.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Beane, Robbie Allen. "Inverse limits of permutation maps." Diss., Rolla, Mo. : Missouri University of Science and Technology, 2008. http://scholarsmine.mst.edu/thesis/pdf/Beane_09007dcc804f93c9.pdf.

Full text

Abstract:

Thesis (Ph. D.)--Missouri University of Science and Technology, 2008.
Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed May 9, 2008) Includes bibliographical references (p. 71-73).

APA, Harvard, Vancouver, ISO, and other styles

42

Cheong, Chi-weng. "Separating maps between function spaces." Click to view the E-thesis via HKUTO, 2008. http://sunzi.lib.hku.hk/hkuto/record/b40203347.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Horihata, Kazuhiro. "The evolution of harmonic maps /." Sendai : Univ, 1999. http://www.loc.gov/catdir/toc/fy0706/2006438743.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Nguyen, Bich-Ngoc Cao. "Induced maps in Galois cohomology." Thesis, University of British Columbia, 2011. http://hdl.handle.net/2429/36848.

Full text

Abstract:

Galois cohomology is an important tool in algebra that can be used to classify isomorphism classes of algebraic objects over a field. In this thesis, we show that many objects of interest in algebra can be described in cohomological terms. Some objects that we discuss include quadratic forms, Pfister forms, G-crossed product algebras, and tuples of central simple algebras. We also provide cohomological interpretation to some induced maps that naturally occur in short exact sequences.

APA, Harvard, Vancouver, ISO, and other styles

45

Krause, Uwe. "Videos related to the maps." Universität Potsdam, 2012. http://opus.kobv.de/ubp/volltexte/2013/6574/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Scherer, Artur. "Decoherent histories and quantum maps." Thesis, Royal Holloway, University of London, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.417055.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Kobak, Piotr Z. "Quaternionic geometry and harmonic maps." Thesis, University of Oxford, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.357422.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Xu, Xu. "Nonlinear systems and cellular maps." Thesis, University of Sheffield, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.538077.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Chandran, Manjari. "Assessing the quality of maps." Thesis, University of Oxford, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531959.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Chin, Wai-yi, and 錢慧儀. "Linear maps preserving the spectrum?" Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B31225834.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Maps'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles