Thesis (Ph. D.)--University of Wisconsin--Madison, 1976. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Bibliographical references.

The popular tourist destination island of Koh Phi Phi Don, Thailand was heavily affected by the Indian Ocean Tsunami in December 2004, which resulted in a destroyed tourism infrastructure and complete downturn of tourism. Extensive recovery and rebuilding work by emerging community groups, returned locals, international volunteers and Thai government units provided an efficient but hasty reconstruction of the destination. Ethnographic research conducted in the community provided insights into the complex stakeholder interactions and their roles and influences on the reconstruction of the community. The community�s level of vulnerability on Koh Phi Phi Don was influenced by social processes and interactions during the destination�s recovery process as the various stakeholders (e.g. government vs. locals) had differing perceptions of the island�s economic, environmental and social vulnerability. These disputes are grounded in different social time processes, particularly illustrated through land law disputes among locals, landowners and the government. Other factors which influenced the reconstruction of Koh Phi Phi as a tourist destination were pre-tsunami conditions (past overdevelopment), the empowerment of the community, the reconstructed place identity, various anniversary celebrations and the early warning system. A model is suggested to illustrate and discuss Koh Phi Phi Don as a disaster destination, which provides insights into the dynamics which govern a destination�s post-disaster recovery period. Thus, it illustrates how stakeholder interaction is influenced by distinct understandings of the multiple notions of vulnerability. Furthermore, this study establishes essential links between disaster and tourism theories and suggests an extended tourism disaster management framework, which calls for an inclusion of post-recovery processes.

The popular tourist destination island of Koh Phi Phi Don, Thailand was heavily affected by the Indian Ocean Tsunami in December 2004, which resulted in a destroyed tourism infrastructure and complete downturn of tourism. Extensive recovery and rebuilding work by emerging community groups, returned locals, international volunteers and Thai government units provided an efficient but hasty reconstruction of the destination. Ethnographic research conducted in the community provided insights into the complex stakeholder interactions and their roles and influences on the reconstruction of the community. The community�s level of vulnerability on Koh Phi Phi Don was influenced by social processes and interactions during the destination�s recovery process as the various stakeholders (e.g. government vs. locals) had differing perceptions of the island�s economic, environmental and social vulnerability. These disputes are grounded in different social time processes, particularly illustrated through land law disputes among locals, landowners and the government. Other factors which influenced the reconstruction of Koh Phi Phi as a tourist destination were pre-tsunami conditions (past overdevelopment), the empowerment of the community, the reconstructed place identity, various anniversary celebrations and the early warning system. A model is suggested to illustrate and discuss Koh Phi Phi Don as a disaster destination, which provides insights into the dynamics which govern a destination�s post-disaster recovery period. Thus, it illustrates how stakeholder interaction is influenced by distinct understandings of the multiple notions of vulnerability. Furthermore, this study establishes essential links between disaster and tourism theories and suggests an extended tourism disaster management framework, which calls for an inclusion of post-recovery processes.

In his paper “Framing Moral Intuitions” (Sinnott-Armstrong 2008), Sinnott-Armstrong argues that three studies which he cites provide evidence of unreliability in all moral intuitions in all circumstances. Therefore, he argues that all of one’s moral intuitions require inferential confirmation for justification. I argue that the studies do not strike me as evidence for this conclusion. Thus, anyone who reads the studies and is not struck that they are evidence for this conclusion can have justified moral intuitions without inferential confirmation. Further, arguments are given for why Sinnott-Armstrong’s arguments fail to show that all moral intuitions are unreliable in all circumstances. Finally an argument is given which shows that even if one accepts the master argument, it need not lead to moral scepticism.

In his paper “Framing Moral Intuitions” (Sinnott-Armstrong 2008), Sinnott-Armstrong argues that three studies which he cites provide evidence of unreliability in all moral intuitions in all circumstances. Therefore, he argues that all of one’s moral intuitions require inferential confirmation for justification. I argue that the studies do not strike me as evidence for this conclusion. Thus, anyone who reads the studies and is not struck that they are evidence for this conclusion can have justified moral intuitions without inferential confirmation. Further, arguments are given for why Sinnott-Armstrong’s arguments fail to show that all moral intuitions are unreliable in all circumstances. Finally an argument is given which shows that even if one accepts the master argument, it need not lead to moral scepticism.

University, Diss., 2000--Dortmund. / Dateiformat: PDF.

No description available.

Esta dissertação oferece uma introdução às já conhecidas álgebras de Krichever-Novikov se restringindo aos exemplos abordados previamente em Bremner (1995), Cox (2013), Cox e Jurisich (2013), Cox, Futorny e Martins (2014), Bueno, Cox e Furtony (2009), e as definições de estruturas que podem auxiliar a estudar estes espaços, incluindo álgebras de Lie afins, álgebras de loop e módulos de Verma. Considerando K uma álgebra de Krichever-Novikov do tipo 4-ponto, 3-ponto, elíptica ou DJKM e suas respectivas subálgebras de Heisenberg K\' = K hK , onde hK é a subálgebra de Cartan de K , nos Teoremas 3.2.3, 3.4.3, 3.6.3 e 3.8.3 são apresentados critérios explícitos de irredutibilidade para K\'-módulos do tipo -Verma. / This work gives an introduction to the already known Krichever-Novikov algebras limited only to the examples approached before in Bremner (1995), Cox (2013), Cox e Jurisich (2013), Cox, Futorny and Martins (2014), Bueno, Cox and Furtony (2009), and the structures definitions that could help us to study these spaces, including affine Lie algebras, loop algebras and Verma modules. Let K be a 4-point, 3-point, elliptic or DJKM Krichever-Novikov algebra and its respective Heisenberg subalgebras K\' = K hK , where hK is the K Cartan subalgebra. In the Theorems 3.2.3, 3.4.3, 3.6.3 and 3.8.3 we will give a explicit irreducibility criteria for -Verma K\'-modules.

Lors de cette thèse, nous nous sommes focalisés sur le calcul à haute performance, dans le domaine très précis des simulations de Monte Carlo appliquées à la physique des hautes énergies, et plus particulièrement, aux simulations pour la propagation de particules dans un milieu. Les simulations de Monte Carlo sont des simulations particulièrement consommatrices en ressources, temps de calcul, capacité mémoire. Dans le cas précis sur lequel nous nous sommes penchés, la première simulation de Monte Carlo existante prenait plus de temps à simuler le phénomène physique que le phénomène lui-même n’en prenait pour se dérouler dans les conditions expérimentales. Cela posait donc un sévère problème de performance. L’objectif technique minimal était d’avoir une simulation prenant autant de temps que le phénomène réel observé, l’objectif maximal était d’avoir une simulation bien plus rapide. En effet, ces simulations sont importantes pour vérifier la bonne compréhension de ce qui est observé dans les conditions expérimentales. Plus nous disposons d’échantillons statistiques simulés, meilleurs sont les résultats. Cet état initial des simulations ouvrait donc de nombreuses perspectives d’un point de vue optimisation et calcul à haute performance. Par ailleurs, dans notre cas, le gain de performance étant proprement inutile s’il n’est pas accompagné d’une reproductibilité des résultats, la reproductibilité numérique de la simulation est de ce fait un aspect que nous devons prendre en compte.C’est ainsi que dans le cadre de cette thèse, après un état de l’art sur le profilage, l’optimisation et la reproductibilité, nous avons proposé plusieurs stratégies visant à obtenir plus de performances pour nos simulations. Dans tous les cas, les optimisations proposées étaient précédées d’un profilage. On n’optimise jamais sans avoir profilé. Par la suite, nous nous intéressés à la création d’un profileur parallèle en programmation orientée aspect pour nos besoins très spécifiques, enfin, nous avons considéré la problématique de nos simulations sous un angle nouveau : plutôt que d’optimiser une simulation existante, nous avons proposé des méthodes permettant d’en créer une nouvelle, très spécifique à notre domaine, qui soit d’emblée reproductible, statistiquement correcte et qui puisse passer à l’échelle. Dans toutes les propositions, de façon transverse, nous nous sommes intéressés aux architectures multicore et manycore d’Intel pour évaluer les performances à travers une architecture orientée serveur et une architecture orientée calcul à haute performance. Ainsi, grâce à la mise en application de nos propositions, nous avons pu optimiser une des simulations de Monte Carlo, nous permettant d’obtenir un gain de performance de l’ordre de 400X, une fois optimisée et parallélisée sur un nœud de calcul avec 32 cœurs physiques. De même, nous avons pu proposer l’implémentation d’un profileur, programmé à l’aide d’aspects et capable de gérer le parallélisme à la fois de la machine sur laquelle il est exécuté mais aussi de l’application qu’il profile. De plus, parce qu’il emploi les aspects, il est portable et n’est pas fixé à une architecture matérielle en particulier. Enfin, nous avons implémenté la simulation prévue pour être reproductible, performante et ayant des résultats statistiquement viables. Nous avons pu constater que ces objectifs étaient atteints quelle que soit l’architecture cible pour l’exécution. Cela nous a permis de valider notamment notre méthode de vérification de la reproductibilité numérique d’une simulation. / During this thesis, we focused on High Performance Computing, specifically on Monte Carlo simulations applied to High Energy Physics. We worked on simulations dedicated to the propagation of particles through matter. Monte Carlo simulations require significant CPU time and memory footprint. Our first Monte Carlo simulation was taking more time to simulate the physical phenomenon than the said phenomenon required to happen in the experimental conditions. It raised a real performance issue. The minimal technical aim of the thesis was to have a simulation requiring as much time as the real observed phenomenon. Our maximal target was to have a much faster simulation. Indeed, these simulations are critical to asses our correct understanding of what is observed during experimentation. The more we have simulated statistics samples, the better are our results. This initial state of our simulation was allowing numerous perspectives regarding optimisation, and high performance computing. Furthermore, in our case, increasing the performance of the simulation was pointless if it was at the cost of losing results reproducibility. The numerical reproducibility of the simulation was then an aspect we had to take into account. In this manuscript, after a state of the art about profiling, optimisation and reproducibility, we proposed several strategies to gain more performance in our simulations. In each case, all the proposed optimisations followed a profiling step. One never optimises without having profiled first. Then, we looked at the design of a parallel profiler using aspect-oriented programming for our specific needs. Finally, we took a new look at the issues raised by our Monte Carlo simulations: instead of optimising existing simulations, we proposed methods for developing a new simulation from scratch, having in mind it is for High Performance Computing and it has to be statistically sound, reproducible and scalable. In all our proposals, we looked at both multicore and manycore architectures from Intel to benchmark the performance on server-oriented architecture and High Performance Computing oriented architecture. Through the implementation of our proposals, we were able to optimise one of the Monte Carlo simulations, permitting us to achieve a 400X speedup, once optimised and parallelised on a computing node with 32 physical cores. We were also able to implement a profiler with aspects, able to deal with the parallelism of its computer and of the application it profiles. Moreover, because it relies on aspects, it is portable and not tied to any specific architecture. Finally, we implemented the simulation designed to be reproducible, scalable and to have statistically sound results. We observed that these goals could be achieved, whatever the target architecture for execution. This enabled us to assess our method for validating the numerical reproducibility of a simulation.

Esta dissertação oferece uma introdução às já conhecidas álgebras de Krichever-Novikov se restringindo aos exemplos abordados previamente em Bremner (1995), Cox (2013), Cox e Jurisich (2013), Cox, Futorny e Martins (2014), Bueno, Cox e Furtony (2009), e as definições de estruturas que podem auxiliar a estudar estes espaços, incluindo álgebras de Lie afins, álgebras de loop e módulos de Verma. Considerando K uma álgebra de Krichever-Novikov do tipo 4-ponto, 3-ponto, elíptica ou DJKM e suas respectivas subálgebras de Heisenberg K\' = K hK , onde hK é a subálgebra de Cartan de K , nos Teoremas 3.2.3, 3.4.3, 3.6.3 e 3.8.3 são apresentados critérios explícitos de irredutibilidade para K\'-módulos do tipo -Verma. / This work gives an introduction to the already known Krichever-Novikov algebras limited only to the examples approached before in Bremner (1995), Cox (2013), Cox e Jurisich (2013), Cox, Futorny and Martins (2014), Bueno, Cox and Furtony (2009), and the structures definitions that could help us to study these spaces, including affine Lie algebras, loop algebras and Verma modules. Let K be a 4-point, 3-point, elliptic or DJKM Krichever-Novikov algebra and its respective Heisenberg subalgebras K\' = K hK , where hK is the K Cartan subalgebra. In the Theorems 3.2.3, 3.4.3, 3.6.3 and 3.8.3 we will give a explicit irreducibility criteria for -Verma K\'-modules.