To see the other types of publications on this topic, follow the link: Distance map.
Dissertations / Theses on the topic 'Distance map'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Distance map.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Ranjitkar, Hari Sagar, and Sudip Karki. "Comparison of A*, Euclidean and Manhattan distance using Influence map in MS. Pac-Man." Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-11800.
Full textAbstract:
Context An influence map and potential fields are used for finding path in domain of Robotics and Gaming in AI. Various distance measures can be used to find influence maps and potential fields. However, these distance measures have not been compared yet. ObjectivesIn this paper, we have proposed a new algorithm suitable to find an optimal point in parameters space from random parameter spaces. Finally, comparisons are made among three popular distance measures to find the most efficient. Methodology For our RQ1 and RQ2, we have implemented a mix of qualitative and quantitative approach and for RQ3, we have used quantitative approach. Results A* distance measure in influence maps is more efficient compared to Euclidean and Manhattan in potential fields. Conclusions Our proposed algorithm is suitable to find optimal point and explores huge parameter space. A* distance in influence maps is highly efficient compared to Euclidean and Manhattan distance in potentials fields. Euclidean and Manhattan distance performed relatively similar whereas A* distance performed better than them in terms of score in Ms. Pac-Man (See Appendix A).
2
Ottenby, Nore. "Focal Operations with Network Distance Based Neighbourhoods : Implementation, Application and Visualization." Thesis, KTH, Geoinformatik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-170018.
Full textAbstract:
In spatial analysis, many operations are performed considering the neighbouring locations of a feature. The standard definition of a neighbourhood is an area confined by geometrical length and direction with respect to its focus. When allocating a location for a service, the population distribution is often considered. Standard GIS software includes tools for computations with uniform neighbourhoods, usually equal sized circles. These tools can be used for distribution analysis. Many geographic studies used as basis for city planning decisions use distance as an evaluator. It is a frequent occurrence that the actual distance is approximated using factored straight-line distance. For great distances and large datasets, this is a sufficient means of evaluation, whilst for smaller distances for specific locations, it poses major drawbacks. For distribution analysis in a network space, the neighbourhood would need to be derived from the local set of network features, creating a unique neighbourhood for each location. The neighbourhood can then be used to overlay other datasets to perform analysis of features within the network space. This report describes the application of network distance based neighbourhoods to design a tool, Network Location Analysis, for calculating focal statistics for use as a city planning decision support. The tool has been implemented as a workflow of ArcGIS tools scripted as a Python toolbox. The input required by the tool is a population point layer and a vector network dataset. The output is a grid of points with population statistics as attributes and corresponding neighbourhoods generalized as polygons. The tool has been tested by comparing it to standard focal operations implemented in ArcGIS and by applying it to the dataset used when conducting a study on the location of a new metro station using conventional ArcGIS tools. The results have been analysed and visualized and compared to data used in the study. The result concludes that Network Location Analysis surpasses conventional ArcGIS tools when conducting analysis on features in a network. It derives an accurate set of sum and proximity statistics for all locations within the processing extent, enabling analysis on the population distribution throughout the area and for specific points. The output is intuitive, manageable and can be visualized as raster or by displaying the neighbourhoods as polygons and can be used to evaluate population distribution and network connectivity. The drawbacks of the tool are its lack of robustness, its rigidity to input and the inefficient implementation causing execution time to be unpractical.
3
Dalin, Magnus, and Stina Måhl. "Radar Distance Positioning System : A Particle Filter Approach." Thesis, Linköping University, Department of Electrical Engineering, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-9475.
Full textAbstract:
Abstract
Positioning at sea has been important through all times. Thousands of years ago sea men used the stars to navigate. Today GPS is the most used positioning system at sea. In this thesis an alternative positioning method is described and evaluated. The advantage with the method is that it is independent of external systems which make it harder to interfere with than GPS. By calculating the distance to land using radar echoes (measured from the ship), and compare the distances to a digital sea chart a position can be estimated. There are several problems that have to be solved when using this method. The distance calculation and the comparison with the sea chart result in a non-linear system. One way to handle this non-linearity is the particle filter, which is used in this thesis. When using authentic radar data to estimate a position from an area of 784 km2, the system can isolate a small region around the correct position in two iterations. The system also manages to estimate the position with the same precision as GPS when the ship is moving.
4
Emil, Segerbäck. "Shape Representation Using a Volume Coverage Model." Thesis, Linköpings universitet, Informationskodning, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-166727.
Full textAbstract:
Geometric shapes can be represented in a variety of different ways. A distancemap is a map from points to distances. This can be used as a shape representationwhich can be created through a process known as a distance transform. This the-sis project tests a method for three-dimensional distance transforms using frac-tional volume coverage. This method produces distance maps with subvoxel dis-tance values. The result which is achieved is clearly better than what would beexpected from a binary distance transform and similar to the one known fromprevious work. The resulting code has been published under a free and opensource software license.The developed code is available under a GPL license here https://gitlab.com/Emiluren/3d-distance-transform
5
Malod-Dognin, Noël. "Protein structure comparison : from contact map overlap maximisation to distance-based alignment search tool." Rennes 1, 2010. http://www.theses.fr/2010REN1S015.
Full textAbstract:
In molecular biology, a fruitful assumption is that proteins sharing close three dimensional structures may share a common function and in most cases derive from a same ancestor. Computing the similarity between two protein structures is therefore a crucial task and has been extensively investigated. Among all the proposed methods, we focus on the similarity measure called Contact Map Overlap maximisation (CMO), mainly because it provides scores which can be used for obtaining good automatic classifications of the protein structures. In this thesis, comparing two protein structures is modelled as finding specific sub-graphs in specific k-partite graphs called alignment graphs. Then, we model CMO as a kind of maximum edge induced sub-graph problem in alignment graphs, for which we conceive an exact solver which outperforms the other CMO algorithms from the literature. Even though we succeeded to accelerate CMO, the procedure still stays too much time consuming for large database comparisons. To further accelerate CMO, we propose a hierarchical approach for CMO which is based on the secondary structure of the proteins. Finally, although CMO is a very good scoring scheme, the alignments it provides frequently posses big root mean square deviation values. To overcome this weakness, we propose a new comparison method based on internal distances which we call DAST (for Distance-based Alignment Search Tool). It is modelled as a maximum clique problem in alignment graphs, for which we design a dedicated solver with very good performancesUne hypothèse féconde de la biologie structurale est que les protéines partageant des structures tri-dimensionnelles similaires sont susceptibles de partager des fonctions similaires et de provenir d'un ancêtre commun. Déterminer la similarité entre deux structures protéiques est une tâche importante qui à été largement étudiée. Parmi toutes les méthodes proposées, nous nous intéressons à la mesure de similarité appelée Maximisation du Recouvrement de Cartes de Contacts (CMO). Dans cette thèse, nous proposons un cadre général pour modéliser la comparaison de deux structures protéiques dans des graphes k-partis spécifiques appelés graphes d'alignements. Puis, nous modélisons CMO comme une recherche de sous-graphe maximum induit par les arêtes dans des graphes d'alignements, problème pour lequel nous proposons un solveur exact qui surpasse les autres algorithmes de la littérature. Cependant, la procédure d'alignement requière encore trop de temps de calculs pour envisager des comparaisons à grande échelle. Afin d'accélérer davantage CMO, nous proposons une approche hiérarchique basée sur les structures secondaires. Enfin, bien que CMO soit une très bonne mesure de similarité, les alignements qu'elle fournit possèdent souvent de fortes valeurs de déviation (RMSD). Pour palier à cette faiblesse, nous proposons une nouvelle méthode de comparaison basée sur les distances internes que nous appelons DAST. Elle est modélisée comme une recherche de clique maximum dans des graphes d'alignements, pour laquelle nous présentons un solveur dédié montrant de très bonnes performances
6
Adamsson, Gustav. "Fast and Approximate Text Rendering Using Distance Fields." Thesis, Linköpings universitet, Informationskodning, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-121592.
Full textAbstract:
Distance field text rendering has many advantages compared to most other text renderingsolutions. Two of the advantages are the possibility to scale the glyphs without losing the crisp edge and less memory consumption. A drawback with distance field text renderingcan be high distance field generation time. The solution for fast distance field text renderingin this thesis generates the distance fields by drawing distance gradients locally over the outlines of the glyphs. This method is much faster than the old exact methods for generating distance fields that often includes multiple passes over the whole image. Using the solution for text rendering proposed in this thesis results in good looking text that is generated on the fly. The distance fields are generated on a mobile device in less than 10 ms for most of the glyphs in good quality which is less than the time between two frames.
7
Pillamari, Jayachandran. "Parallelization of backward deleted distance calculation in graph based features using Hadoop." Kansas State University, 2013. http://hdl.handle.net/2097/15433.
Full textAbstract:
Master of ScienceDepartment of Computing & Information Sciences
Daniel Andresen
The current project presents an approach to parallelize the calculation of Backward Deleted Distance (BDD) in Graph Based Features (GBF) computation using Hadoop. In this project the issues concerned with the calculation of BDD are identified and parallel computing technologies like Hadoop are applied to solve them. The project introduces a new algorithm to parallelize the APSP problem in BDD calculation using Hadoop Map Reduce feature. The project is implemented in Java and Hadoop technologies. The aim of this project is to parallelize the calculation of BDD thereby reducing GBF computation time. The process of BDD calculation is examined to identify the key places where it could be parallelized. Since the BDD calculation involves calculating the shortest paths between all pairs of given users, it can viewed as All Pairs Shortest Path (APSP) problem. The internal structure and implementation of Hadoop Map-Reduce framework is studied and applied to the process of APSP problem. The GBF features are one of the features set used in the Ontology classifiers. In the current project, GBF features are used to predict the friendship relationship between the users whose direct link is deleted. The computation involves calculating BDD between all pairs of users. The BDD for a user pair represents the shortest path between them when their direct link is deleted. In real terms, it is the shortest distance between them other than the direct path. The project uses train and test data sets consisting of positive instances and negative instances. The positive instances consist of user pairs having a friendship link between them whereas the negative instances do not have any direct link between them. Apache Hadoop is a latest emerging technology in the market introduced for scalable, distributed computing across clusters of computers. It has a Map Reduce framework used for developing applications which process large amounts of data in parallel on large clusters. The project is developed and implemented successfully and has the best time complexity. The project is tested for its reliability and performance. Different data sets are used in this testing by considering various factors and typical graph representations. The test results were analyzed to predict the behavior of the system. The test results show that the system has best speedup and considerably decreased the processing time from 10 hours to 20 minutes which is rewarding.
8
Hjelm, Andersson Patrick. "Binär matchning av bilder med hjälp av vektorer från deneuklidiska avståndstransformen." Thesis, Linköping University, Department of Electrical Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2440.
Full textAbstract:
This thesis shows the result from investigations of methods that use distance vectors when matching pictures. The distance vectors are available in a distance map made by the Euclidean Distance Transform. The investigated methods use the two characteristic features of the distance vector when matching pictures, length and direction. The length of the vector is used to calculate a value of how good a match is and the direction of the vector is used to predict a transformation to get a better match. The results shows that the number of calculation steps that are used during a search can be reduced compared to matching methods that only uses the distance during the matching.
9
Emberger, Simon. "Algorithmes, architecture et éléments optiques pour l'acquisition embarquées d'images totalement focalisées et annotées en distance." Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2017. http://www.theses.fr/2017IMTA0055/document.
Full textAbstract:
L'acquisition de la profondeur d'une scène en plus de son image est une caractéristique souhaitable pour de nombreuses applications qui dépendent de l'environnement proche. L'état de l'art dans le domaine de l'extraction de profondeur propose de nombreuses méthodes, mais très peu sont réellement adaptées aux systèmes embarqués miniaturisés. Certaines parce qu'elles sont trop encombrantes en raison de leur système optique, d'autres parce qu'elles nécessitent une calibration délicate, ou des méthodes de reconstructions difficilement implantables dans un système embarqué. Dans cette thèse nous nous concentrons sur des méthodes a faible complexité matérielle afin de proposer une solution algorithmique et optique pour réaliser un capteur permettant à la fois d'extraire la profondeur de la scène, de fournir une évaluation de pertinence de cette mesure et de proposer des images focalisées en tout point. Dans ce sens, nous montrons que les algorithmes du type Depth from Focus (DfF) sont les plus adaptés à ces contraintes. Ce procédé consiste à acquérir un cube d'images multi-focus d'une même scène pour différentes distances de focalisation. Les images sont analysées afin d'annoter chacune des zones de la scène d'un indice relatif à sa profondeur estimée. Cet indice est utilisé pour reconstruire une image nette en tout point.Nous avons travaillé sur la notion de netteté afin de proposer des solutions peu complexes, uniquement basées sur des additions et comparaisons, et de fait, facilement adaptables pour un portage sur une architecture matérielle. La solution proposée effectue une analyse bidirectionnelle de contraste local puis combine les meilleures estimations de profondeur en fin de traitement. Elle se décline en trois approches avec une restriction de la complexité de plus en plus forte et ainsi une aptitude de plus en plus marquée pour l'embarqué. Pour chaque méthode, des cartes de profondeurs et de confiances sont établies, ainsi qu'une image totalement focalisée constituée d'éléments issus de l'ensemble du cube multi-focus. Ces approches sont comparées en qualité et en complexité à d'autres méthodes de l'état de l'art de complexité similaire. Une architecture est proposée pour une implantation matérielle de la solution la plus prometteuse. La conception de ces algorithmes soulève le problème de la qualité d'image. Il est en effet primordial d'avoir une évolution remarquable du contraste ainsi qu'une invariance de la scène lors de la capture du cube multi-focus. Un effet très souvent négligé dans ce type d'approche est le zoom parasite provoqué par la lentille responsable de la variation de focus. Ce zoom de focalisation fragilise l'aspect invariance de la scène et provoque l'apparition d'artefacts sur les trois informations Profondeur, Image et Confiance. La recherche d'optiques adaptées au DfF constitue donc un second axe de ces travaux. Nous avons évalué des lentilles liquides industrielles et des lentilles modales expérimentales à cristaux liquides nématiques conçues durant cette thèse. Ces technologies ont été comparées en termes de rapidité, de qualité d'image, d'intensité de zoom de focalisation engendré, de tension d'alimentation et enfin de qualité des cartes de profondeur extraites et des images totalement focalisées reconstruites.La lentille et l'algorithme répondant le mieux à cette problématique DfF embarqué ont ensuite été évalués via le portage sur une plateforme de développement CPU-GPU permettant l'acquisition d'images et de cartes de profondeurs et de confiances en temps réelAcquiring the depth of a scene in addition to its image is a desirable feature for many applications which depend on the near environment. The state of the art in the field of depth extraction offers many methods, but very few are well adapted to small embedded systems. Some of them are too cumbersome because of their large optical system. Others might require a delicate calibration or processing methods which are difficult to implement in an embedded system. In this PhD thesis, we focus on methods with low hardware complexity in order to propose algorithms and optical solutions that extract the depth of the scene, provide a relevance evaluation of this measurement and produce all-in-focus images. We show that Depth from Focus (DfF) algorithms are the most adapted to embedded electronics constraints. This method consists in acquiring a cube of multi-focus images of the same scene for different focusing distances. The images are analyzed in order to annotate each zone of the scene with an index relative to its estimated depth. This index is then used to build an all in focus image. We worked on the sharpness criterion in order to propose low complexity solutions, only based on additions and comparisons, easily adaptable on a hardware architecture. The proposed solution uses bidirectional local contrast analysis and then combines the most relevant depth estimations based on detection confidence at the end of treatment. It is declined in three approaches which need less and less processing and thus make them more and more adapted for a final embedded solution. For each method, depth and confidence maps are established, as well as an all-in-focus image composed of elements from the entire multi-focus cube. These approaches are compared in quality and complexity with other state-of-the-art methods which present similar complexity. A hardware implementation of the best solution is proposed. The design of these algorithms raises the problem of image quality. It is indeed essential to have a remarkable contrast evolution as well as a motionless scene during the capture of the multi-focus cube. A very often neglected effect in this type of approach is the parasitic zoom caused by the lens motion during a focus variation. This "focal zoom" weakens the invariance aspect of the scene and causes artifacts on the depth and confidence maps and on the all in focus image. The search for optics adapted to DfF is thus a second line of research in this work. We have evaluated industrial liquid lenses and experimental nematic liquid crystal modal lenses designed during this thesis. These technologies were compared in terms of speed, image quality, generated focal zoom intensity, power supply voltage and finally the quality of extracted depth maps and reconstructed all in focus images. The lens and the algorithm which best suited this embedded DfF issue were then evaluated on a CPU-GPU development platform allowing real time acquisition of depth maps, confidence maps and all in focus images
10
Wong, Mark. "Comparison of heat maps showing residence price generated using interpolation methods." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-214110.
Full textAbstract:
In this report we attempt to provide insights in how interpolation can be used for creating heat maps showing residence prices for different residence markets in Sweden. More specifically, three interpolation methods are implemented and are then used on three Swedish residence markets. These three residence markets are of varying characteristics such as size and residence type. Data of residence sales and the physical definitions of the residence markets were collected. As residence sales are never identical, residence sales were preprocessed to make them comparable. For comparison, a so-called external predictor was used as an extra parameter for the interpolation method. In this report, distance to nearest public transportation was used as an external predictor. The interpolated heat maps were compared and evaluated using both quantitative and qualitative approaches. Results show that each interpolation method has its own strengths and weaknesses, and that using an external predictor results in better heat maps compared to only using residence price as predictor. Kriging was found to be the most robust method and consistently resulted in the best interpolated heat maps for all residence markets. On the other hand, it was also the most time-consuming interpolation method.Den här rapporten försöker ge insikter i hur interpolation kan användas för att skapa färgdiagram över bostadspriser för olika bostadsmarknader i Sverige. Mer specifikt implementeras tre interpolationsmetoder som sedan används på tre olika svenska bostadsmarknader. Dessa tre bostadsmarknader är av olika karaktär med hänsyn till storlek och bostadstyp. Bostadsförsäljningsdata och de fysiska definitionerna för bostadsmarknaderna samlades in. Eftersom bostadsförsäljningar aldrig är identiska, behandlas de först i syfte att göra dem jämförbara. En extern indikator, vilket är en extra parameter för interpolationsmetoder, undersöktes även. I den här rapporten användes avståndet till närmaste kollektiva transportmedel som extern indikator. De interpolerade färgdiagrammen jämfördes och utvärderades både med en kvantiativ och en kvalitativ metod. Resultaten visar att varje interpolationsmetod har sina styrkor och svagheter och att användandet av en extern indikator alltid renderade i ett bättre färgdiagram jämfört med att endast använda bostadspris som indikator. Kriging bedöms vara den mest robusta interpolationsmetoden och interpolerade även de bästa färgdiagrammen för alla bostadsmarknader. Samtidigt var det även den mest tidskrävande interpolationsmetoden.
11
Vavroš, Ondřej. "Měření vzdálenosti stereoskopickým senzorem." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2015. http://www.nusl.cz/ntk/nusl-220333.
Full textAbstract:
This master's thesis will take us through theoretical procedure that allows us to determine the distance of an object by stereoscopic sensor. Part of this work presents the description of the steps to achieve image of objects, calibraton and rectification. At the next part our study provides an overview of algortihms for creating disparity maps and determining the distance of the object from sensor. In the following part of thesis deals with the implementation of these processes into aplication which aim is to measure the distance.
12
Yildirim, Fatma Nur. "Représentations matricielles des fibres finies d’applications rationnelles et problèmes de distances." Thesis, Université Côte d'Azur, 2020. http://www.theses.fr/2020COAZ4004.
Full textAbstract:
Dans cette thèse, de nouvelles représentations matricielles des fibres finies d'applications rationnelles sont introduites et étudiées d'un point de vue théorique mais aussi pratique avec l'objectif de traiter des problèmes de distances, notamment les deux problèmes suivant : l'implicitisation des courbes rationnnelles algébriques en dimension arbitraire et la détermination des projetés orthogonaux d'un point sur une surface rationnelle algébrique en dimension trois. Les noyaux à gauche de ces représentations matrices, après évaluation en un point p de l'espace ambiant sont reliés aux pré-images du point p par l'application rationnelle considérée. De plus, ces matrices peuvent être pré-calculées et les pré-images d'un point p peuvent être calculées approximativement de manière efficace et robuste grâce aux outils d'algèbre linéaire. Dans le deuxième chapitre, une nouvelle famille des représentations matricielles est proposée pour les courbes algébriques rationnelles. Elle est basée sur le concept de "quadriques mobiles" associées aux courbes parametrées. Elle fournit une extension non linéaire des représentations matricielles qui sont obtenues au moyen du concept plus classique de "plans mobiles" associés à une paramétrisation. Ces matrices fournissent ainsi de nouvelles représentations implicites plus compactes pour les courbes rationnelles algébriques. Leurs entrées sont composées de formes linéaires et quadratiques en les variables de l'espace ambiant et leur rang chute exactement sur la courbe considérée. De plus, pour une courbe rationnelle générale de degré d ces nouvelles matrices sont deux fois plus petites en taille que les matrices, plus classiques, qui n'utilisent que des plans mobiles, et donc dont les entrées sont exclusivement composées de formes linéaires. Dans le troisième chapitre, le calcul des projetés orthogonaux d'un point sur une surface rationnelle algébrique dans l'espace projectif de dimension trois est étudié comme un problème d'inversion, plus précisément comme le calcul des fibre finies d'applications rationnelles génériquement finies et dominantes : les congruences des droites normales à une surface algébrique rationnelle. Une analyse fine des modules de relations (syzygies) associés à ces congruences est tout d'abord menée, puis utilisée pour construire des matrices eliminantes qui fournissent des représentations universelles de ces fibres finies. De plus, ces matrices dependent linéairement des variables de l'espace ambiant de dimension trois et elles peuvent être pré-calculées pour une surface algébrique rationnelle donnée. Enfin, l'appendice de cette thèse décrit les résultats obtenus lors d'un séjour de recherche mené chez le partenaire industriel Missler Software. Deux problèmes de distance en dimension trois ont été étudiés : le calcul de la distance entre un cercle et une droite puis le calcul de la distance entre un arc de cercle et un segment de droiteIn this thesis, implicit matrix-based representations of finite fibers of rational maps are studied theoretically and computationally for two problems: implicitization of rational algebraic curves in arbitrary dimension and orthogonal projections of a point onto an rational algebraic surface in three dimensional space. The proposed matrices have the property that their cokernels at a given point p in the target space of the rational map are in relation with the pre-images of the p via this rational map. In addition, these matrices can be pre-computed so that the pre-images of such a point p can be approximately computed by means of fast and robust numerical linear algebra tools. In the second chapter, a new family of implicit matrix representations is introduced for algebraic curves. It relies on the use of moving quadrics following curve parameterizations and provides a high-order extension of the implicit matrix representations built from their linear counterparts, the moving planes. Such matrices offer new, more compact, implicit representations of rational curves. Their entries are filled by linear and quadratic forms in the space variables and their ranks drop exactly on the curve. Typically, for a general rational curve of degree d we obtain a matrix whose size is half of the size of the corresponding matrix obtained with the moving planes method. In the third chapter, the problem of computing the orthogonal projections of a point onto a rational algebraic surface embedded in three dimensional projective space is turned into the problem of computing the finite fibers of a generically finite dominant rational map: a congruence of normal lines to the rational surface. Then, an in-depth study of certain syzygy modules associated to such a congruence is presented and applied to build elimination matrices that provide universal representations of its finite fibers, under some genericity assumptions. Moreover, these matrices depend linearly in the variables of the three dimensional space and can be pre-computed for a given rational surface. Lastly, the appendix of this thesis reports on a three-month industrial secondment at the company Missler Software where two distance problems are treated : distance between a circle and a line in 3D and distance between an arc of a circle and a segment of a line in three dimensional space
13
Peck, Riley D. "Seasonal Habitat Selection by Greater Sage Grouse in Strawberry Valley Utah." BYU ScholarsArchive, 2011. https://scholarsarchive.byu.edu/etd/3180.
Full textAbstract:
This study examined winter habitat use and nesting ecology of greater sage grouse (Centrocercus urophasianus) in Strawberry Valley (SV), Utah located in the north-central part of the state. We monitored sage grouse with the aid of radio telemetry throughout the year, but specifically used information from the winter and nesting periods for this study. Our study provided evidence that sage grouse show fidelity to nesting areas in subsequent years regardless of nest success. We found only 57% of our nests located within the 3 km distance from an active lek typically used to delineate critical nesting habitat. We suggest a more conservative distance of 10 km for our study area. Whenever possible, we urge consideration of nest-area fidelity in conservation planning across the range of greater sage grouse. We also evaluated winter-habitat selection at multiple spatial scales. Sage grouse in our study area selected gradual slopes with high amounts of sagebrush exposed above the snow. We produced a map that identified suitable winter habitat for sage grouse in our study area. This map highlighted core areas that should be conserved and will provide a basis for management decisions affecting Strawberry Valley, Utah.
14
Gumos, Aleksander Karol. "Modelling the Cross-Country Trafficability with Geographical Information Systems." Thesis, Linköping University, Department of Computer and Information Science, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-313.
Full textAbstract:
The main objectives of this work were to investigate Geographical Information Systems techniques for modelling a cross-country trafficability. To accomplished stated tasks, reciprocal relationships between the soil deposits, local hydrology, geology and geomorphology were studied in relation to the study area in South-Eastern Sweden.
Growing awareness of nowadays users of GIS in general is being concentrated on understanding an importance of soil conditions changed after cross-country trafficability. Therefore, in this thesis, constructing of the Soil Knowledge Database introduced to the genuine geological soil textural classes a new, modified geotechnical division with desirable for off-road ground reasoning measurable factors, like soil permeability, capillarity or Atterberg’s consistency limits.
Digital Elevation Model, the driving force for landscape studies in the thesis, was carefully examined together with the complementary datasets of the investigated area. Testing of the elevation data was done in association to the hydrological modelling, which resulted with the Wetness Index map. The three distinguishable soil wetness conditions: dry, moist and wet, were obtained, and used consequently for creation of the static ground conditions map, a visible medium of soils susceptibility to for example machine compaction.
The work resulted with a conceptual scheme for cross-country trafficability modelling, which was put into effect while modeling in GIS. As a final outcome, by combining all processed data together, derivatives were incorporated and draped over the rendered 3D animating scene. A visually aided simulation enabled to concretized theoretical, hypothetical and experimental outcomes into one coherent model of apprised under Multicriterial Evaluation techniques standardized factor maps for ground vehicle maneuverability. Also further steps of research were proposed.
15
Sooful, Jayren Jugpal. "Automated phoneme mapping for cross-language speech recognition." Diss., Pretoria [s.n.], 2004. http://upetd.up.ac.za/thesis/available/etd-01112005-131128.
Full text
16
Macháček, Jan. "Fokusovací techniky optického měření 3D vlastností." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2021. http://www.nusl.cz/ntk/nusl-442511.
Full textAbstract:
This thesis deals with optical distance measurement and 3D scene measurement using focusing techniques with focus on confocal microscopy, depth from focus and depth from defocus. Theoretical part of the thesis is about different approaches to depth map generation and also about micro image defocusing technique for measuring refractive index of transparent materials. Then the camera calibration for focused techniques is described. In the next part of the thesis is described experimentally verification of depth from focus and depth from defocus techniques. For the first technique are shown results of depth map generation and for the second technique is shown comparison between measured distance values and real distance values. Finally, the discussed techniques are compared and evaluated.
17
Jayaraman, Balaji Dinakarpandian Deendayal. "Hierarchical representation of protein folding patterns based on contact map distances." Diss., UMK access, 2006.
Find full textAbstract:
Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2006."A thesis in computer science." Typescript. Advisor: Deendayal Dinakarpandian. Vita. Title from "catalog record" of the print edition Description based on contents viewed Jan. 29, 2007. Includes bibliographical references (leaves 47-49). Online version of the print edition.
18
Timmerman, Lindsay Marie. "Jealousy expression in long-distance romantic relationships /." Full text (PDF) from UMI/Dissertation Abstracts International, 2001. http://wwwlib.umi.com/cr/utexas/fullcit?p3008459.
Full text
19
McLaughlin, Jeremy P. "A statistical analysis of the effect of the Navy's Tuition Assistance program do distance learning classes make a difference? /." Thesis, Monterey, California : Naval Postgraduate School, 2010. http://edocs.nps.edu/npspubs/scholarly/theses/2010/Mar/10Mar%5FMcLaughlin.pdf.
Full textAbstract:
Thesis (M.S. in Manpower Systems Analysis)--Naval Postgraduate School, March 2010.Thesis Advisor(s): Mehay, Stephen. ; Pema, Elda. "March 2010." Author(s) subject terms: Tuition Assistance (TA) Program, retention, performance, Distance Learning (DL), method of instruction, passing rates. Includes bibliographical references (p. 71-72). Also available in print.
20
Kasikci, Ilker. "Effect Of Gap Distance On The Mechanical Properties And Cross-sectional Characteristics Of The Mig-mag Butt Welds." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/1027283/index.pdf.
Full textAbstract:
This study was undertaken with the objective of determining the effect of gap distance on the weld bead geometry and the mechanical properties of the weldments. Low-alloyed and low carbon steel plates were welded under different conditions where each weldment had different gap distance and weld bead grooves. The influences of welding parameters namely, welding speed, current and voltage on the weld bead were examined in terms of weld bead penetration and heat affected zone and weld metal zone hardness variations.
21
Keeratipranon, Narongdech. "Robot navigation in sensor space." Queensland University of Technology, 2009. http://eprints.qut.edu.au/29316/.
Full textAbstract:
This thesis investigates the problem of robot navigation using only landmark bearings. The proposed system allows a robot to move to a ground target location specified by the sensor values observed at this ground target posi- tion. The control actions are computed based on the difference between the current landmark bearings and the target landmark bearings. No Cartesian coordinates with respect to the ground are computed by the control system. The robot navigates using solely information from the bearing sensor space. Most existing robot navigation systems require a ground frame (2D Cartesian coordinate system) in order to navigate from a ground point A to a ground point B. The commonly used sensors such as laser range scanner, sonar, infrared, and vision do not directly provide the 2D ground coordi- nates of the robot. The existing systems use the sensor measurements to localise the robot with respect to a map, a set of 2D coordinates of the objects of interest. It is more natural to navigate between the points in the sensor space corresponding to A and B without requiring the Cartesian map and the localisation process. Research on animals has revealed how insects are able to exploit very limited computational and memory resources to successfully navigate to a desired destination without computing Cartesian positions. For example, a honeybee balances the left and right optical flows to navigate in a nar- row corridor. Unlike many other ants, Cataglyphis bicolor does not secrete pheromone trails in order to find its way home but instead uses the sun as a compass to keep track of its home direction vector. The home vector can be inaccurate, so the ant also uses landmark recognition. More precisely, it takes snapshots and compass headings of some landmarks. To return home, the ant tries to line up the landmarks exactly as they were before it started wandering. This thesis introduces a navigation method based on reflex actions in sensor space. The sensor vector is made of the bearings of some landmarks, and the reflex action is a gradient descent with respect to the distance in sensor space between the current sensor vector and the target sensor vec- tor. Our theoretical analysis shows that except for some fully characterized pathological cases, any point is reachable from any other point by reflex action in the bearing sensor space provided the environment contains three landmarks and is free of obstacles. The trajectories of a robot using reflex navigation, like other image- based visual control strategies, do not correspond necessarily to the shortest paths on the ground, because the sensor error is minimized, not the moving distance on the ground. However, we show that the use of a sequence of waypoints in sensor space can address this problem. In order to identify relevant waypoints, we train a Self Organising Map (SOM) from a set of observations uniformly distributed with respect to the ground. This SOM provides a sense of location to the robot, and allows a form of path planning in sensor space. The navigation proposed system is analysed theoretically, and evaluated both in simulation and with experiments on a real robot.
22
Ben, Jamaa-Joussemet Salma. "Codage-décodage source-canal conjoint des codes arithmétiques : application au décodage robuste des vidéos codées H.264." Paris 11, 2006. http://www.theses.fr/2006PA112331.
Full textAbstract:
Cette thèse s'inscrit dans le contexte du codage/décodage source-canal conjoint (CSCC/DSCC) des codes arithmétiques (CA). Nous nous intéressons au décodage robuste des trames codées par CABAC, une version du CA adoptée dans des standards tels que le H. 264. Nous proposons un estimateur au sens du maximum a posteriori, sans approximations, prenant compte les contraintes d'une implémentation réaliste du CA. Pour l'évaluation de cet estimateur, nous utilisons les techniques de décodage séquentiel, qui posent, en revanche, des problèmes de complexité. Nous développons alors un critère objectif de décision permettant d'ajuster le compromis complexité-efficacité. Ensuite, nous nous intéressons à la caractérisation analytique de la robustesse des schémas de CSCC utilisant le CA. Dans ce but, nous représentons le CA par une machine à états finis pour générer un treillis bi-dimensionnel adapté à un décodage Viterbi. Ce treillis permet de calculer la distance libre et le spectre des distances du CA. Les outils analytiques développés sont exploitées pour concevoir un schéma de CSCC optimisé de manière à minimiser asymptotiquement la probabilité d'erreur symboleThis thesis deals with joint source-channel coding and decoding (JSCC/JSCD) schemes involving arithmetic codes (AC). First, we develop a JSCD technique based on MAP estimation of CABAC encoded data. This estimator is considered to be exact as it is evaluated without approximations and with respect of the constraints imposed by an actual implementation of AC. The evaluation of the proposed MAP estimator is achieved using an improved sequential decoding technique, allowing to adjust the decoder complexity-efficiency trade-off. The purpose of the second part of this thesis is to provide analytical tools to predict and evaluate the effectiveness of the redundancy introduced by the JSCC schemes into AC. Integer binary AC is then modelled by a reduced-state automaton to obtain a bit-clock trellis. Distance spectra are then derived. The obtained distance properties provide an objective criteria that are then exploited to design efficient error-correcting arithmetic codes
23
Lagadec, Marc James. "A man or a mouse? : developing effective teaching using technology for distance education, an evaluative study." Thesis, University of Southampton, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.294693.
Full text
24
Lehéricy, Thomas. "Cycles séparants, isopérimétrie et modifications de distances dans les grandes cartes planaires aléatoires." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLS476/document.
Full textAbstract:
Les cartes planaires sont des graphes planaires dessinés sur la sphère et vus à déformation près. De nombreuses propriétés des cartes sont supposées universelles, dans le sens où elles ne dépendent pas des détails du modèle choisi. Nous commençons par établir une inégalité isopérimétrique dans la quadrangulation infinie du plan. Nous confirmons également une conjecture de Krikun portant sur la longueur des cycles les plus courts séparant la boule de rayon $r$ de l'infini. Dans un deuxième temps, nous nous intéressons à l'effet de modifications de distances sur la géométrie à grande échelle des quadrangulations uniformes, élargissant la classe d'universalité de la carte brownienne. Nous montrons également que la bijection de Tutte, entre quadrangulations et cartes planaires, est asymptotiquement une isométrie. Enfin, nous établissons une borne supérieure sur le temps de mélange de la marche aléatoire dans les cartes aléatoiresPlanar maps are planar graphs drawn on the sphere and seen up to deformation. Many properties of maps are conjectured to be universal, in the sense that they do not depend on the details of the model.We begin by establishing an isoperimetric inequality in the infinite quadrangulation of the plane. We also confirm a conjecture by Krikun concerning the length of the shortest cycles separating the ball of radius $r$ from infinity. We then consider the effect of modifications of distances on the large-scale geometry of uniform quadrangulations, extending the universality class of the Brownian map. We also show that the Tutte bijection, between quadrangulations and planar maps, is asymptotically an isometry. Finally, we establish an upper bound on the mixing time of the random walk in random maps
25
Zhang, Zengzhe. "Fast propagation of messages in VANETs and the impact of vehicles as obstacles on signal propagation." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/10514.
Full textAbstract:
Vehicular Ad hoc NETworks (VANETs), an emerging technology, use vehicles as nodes to form a mobile ad hoc network for the dissemination of safety and entertainment messages. The thesis provides a scheme for the fast propagation of messages in VANETs and evaluates the impact of vehicles as obstacles on signal propagation. An improved scheme for intermediate node selection in DBA-MAC (Dynamic Backbone Assisted MAC) is proposed, which consists of a CW (Contention Window) constraint scheme and an updated criterion of suitability. A performance comparison shows that messages in the proposed scheme propagate faster than in DBA-MAC. The CW constraint scheme is also applicable in VANET protocols which adapt the CW mechanism to communicate the suitability of vehicles for acting as intermediate nodes. Additionally, the mathematical models for DBAMAC and the proposal are established, which indicate the probability of candidates to be chosen over alternatives in the intermediate node selection. A novel metric - delay taking into account the effect of formation time(DEFT) - is proposed. DEFT combines the network formation time and propagation delay. It shows the impact of network formation on propagation latency. The configuration for optimal performance can be acquired using the proposed DEFT. In order to evaluate the proposals, a novel distribution of vehicle location is proposed. In the proposed distribution, the security distances between adjacent vehicles in the same lane are considered. The estimation of vehicles’ location can be more practical and accurate using the proposed distribution. In the wide body of the VANET literature, it is assumed that all the vehicles within the radio range of a transmitter are able to receive the signal. Yet, in practice, the vehicles as obstacles between the transmitter and the receiver affect the signal propagation significantly. This thesis presents the impact of these obstacles on the network connectivity and system performance of the protocols. The results and the analysis show that neglecting obstacles in practice leads to a significant degree of error in the estimation of system performance. In practice, tall vehicles forward messages in a more efficient way than do lower vehicles since they are free from the obstacle effect. An improved scheme is proposed, in which the height of vehicles is used as a factor to determine their suitability for message forwarding.
26
Sy, Mohameth François. "Utilisation d'ontologies comme support à la recherche et à la navigation dans une collection de documents." Thesis, Montpellier 2, 2012. http://www.theses.fr/2012MON20211/document.
Full textAbstract:
Les ontologies offrent une modélisation des connaissances d'un domaine basée sur une hiérarchie des concepts clefs de ce domaine. Leur utilisation dans le cadre des Systèmes de Recherche d'Information (SRI), tant pour indexer les documents que pour exprimer une requête, permet notamment d'éviter les ambiguïtés du langage naturel qui pénalisent les SRI classiques. Les travaux de cette thèse portent essentiellement sur l'utilisation d'ontologies lors du processus d'appariement durant lequel les SRI ordonnent les documents d'une collection en fonction de leur pertinence par rapport à une requête utilisateur. Nous proposons de calculer cette pertinence à l'aide d'une stratégie d'agrégation de scores élémentaires entre chaque document et chaque concept de la requête. Cette agrégation, simple et intuitive, intègre un modèle de préférences dépendant de l'utilisateur et une mesure de similarité sémantique associée à l'ontologie. L'intérêt majeur de cette approche est qu'elle permet d'expliquer à l'utilisateur pourquoi notre SRI, OBIRS, estime que les documents qu'il a sélectionnés sont pertinents. Nous proposons de renforcer cette justification grâce à une visualisation originale où les résultats sont représentés par des pictogrammes, résumant leurs pertinences élémentaires, puis disposés sur une carte sémantique en fonction de leur pertinence globale. La Recherche d'Information étant un processus itératif, il est nécessaire de permettre à l'utilisateur d'interagir avec le SRI, de comprendre et d'évaluer les résultats et de le guider dans sa reformulation de requête. Nous proposons une stratégie de reformulation de requêtes conceptuelles basée sur la transposition d'une méthode éprouvée dans le cadre de SRI vectoriels. La reformulation devient alors un problème d'optimisation utilisant les retours faits par l'utilisateur sur les premiers résultats proposés comme base d'apprentissage. Nous avons développé une heuristique permettant de s'approcher d'une requête optimale en ne testant qu'un sous-espace des requêtes conceptuelles possibles. Nous montrons que l'identification efficace des concepts de ce sous-espace découle de deux propriétés qu'une grande partie des mesures de similarité sémantique vérifient, et qui suffisent à garantir la connexité du voisinage sémantique d'un concept.Les modèles que nous proposons sont validés tant sur la base de performances obtenues sur des jeux de tests standards, que sur la base de cas d'études impliquant des experts biologistesDomain ontologies provide a knowledge model where the main concepts of a domain are organized through hierarchical relationships. In conceptual Information Retrieval Systems (IRS), where they are used to index documents as well as to formulate a query, their use allows to overcome some ambiguities of classical IRSs based on natural language processes.One of the contributions of this study consists in the use of ontologies within IRSs, in particular to assess the relevance of documents with respect to a given query. For this matching process, a simple and intuitive aggregation approach is proposed, that incorporates user dependent preferences model on one hand, and semantic similarity measures attached to a domain ontology on the other hand. This matching strategy allows justifying the relevance of the results to the user. To complete this explanation, semantic maps are built, to help the user to grasp the results at a glance. Documents are displayed as icons that detail their elementary scores. They are organized so that their graphical distance on the map reflects their relevance to a query represented as a probe. As Information Retrieval is an iterative process, it is necessary to involve the users in the control loop of the results relevancy in order to better specify their information needs. Inspired by experienced strategies in vector models, we propose, in the context of conceptual IRS, to formalize ontology based relevance feedback. This strategy consists in searching a conceptual query that optimizes a tradeoff between relevant documents closeness and irrelevant documents remoteness, modeled through an objective function. From a set of concepts of interest, a heuristic is proposed that efficiently builds a near optimal query. This heuristic relies on two simple properties of semantic similarities that are proved to ensure semantic neighborhood connectivity. Hence, only an excerpt of the ontology dag structure is explored during query reformulation.These approaches have been implemented in OBIRS, our ontological based IRS and validated in two ways: automatic assessment based on standard collections of tests, and case studies involving experts from biomedical domain
27
Zúñiga, Mardones Rodrigo. "Dicotomías no excluyentes: el mal como proceso de seducción en Estrella distante de Roberto Bolaño." Tesis, Universidad de Chile, 2010. http://repositorio.uchile.cl/handle/2250/109929.
Full text
28
Feinberg, Emily Johnson Katherine. "A prototype analysis of missing in a geographically separated relationship validation, correlates, and implications /." Diss., Connect to the thesis, 2005. http://hdl.handle.net/10066/739.
Full text
29
Richbourg, John Allen. "Concept Mapping as a Tool for Enhancing Self-Paced Learning in a Distance Scenario." ScholarWorks, 2015. https://scholarworks.waldenu.edu/dissertations/599.
Full textAbstract:
Researchers have determined that concept maps serve as effective tools in the traditional science classroom. The purpose of this experimental study was to investigate concept mapping as a tool for student knowledge acquisition in 10th grade science for students in distance learning situations. Research questions were designed to investigate the influence of concept mapping on rate and quality of student knowledge acquisition and retention. This study was a pretest-posttest 2-group comparison study, constructivist in nature and based on the theory of cognitive learning. Participants included 36 students in the 10th grade at an inner-city school in the United States. Control and treatment groups participated in completing pre and posttesting to establish standards for initial understanding and knowledge acquired. Pretest scores were used in a 2-tailed t test to establish equivalence between groups at the beginning of the study. ANOVA was used with test gains to determine differences between treatment and control groups. Cronbach's alpha was conducted to test for concept map interrater reliability. A 2-tailed t test for matched groups was used with concept map scores and treatment group test gains to determine any relationship. No statistically significant relationship between the use of concept maps and distance learning was found. Recommendations for future research include a wider age range for participants and investigations of academic areas such as reading, writing, mathematics, and language acquisition, native and foreign. Implications for positive social change include research with altered parameters to identify an existing tool that may be used by students in the traditional classroom as well as in distance-learning scenarios.
30
Sabo, Silvio. "Hur man kan användaGoogle Maps API:er för att beräkna och analysera restidskvoter." Thesis, Linnéuniversitetet, Institutionen för datavetenskap och medieteknik (DM), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-75140.
Full textAbstract:
Denna rapport avhandlar ett arbete inom ämnet datavetenskap och handlarom utvecklingen av ett system för att studera restidkvoten för sträckor somtrafikeras av Västtrafik, som är en av Sveriges största regionalakollektivtrafikmyndigheter. Restidskvoten anges som förhållandet mellanrestiden med kollektivtrafik och att resa med personbil ([restidkollektivtrafik] / [restid biltrafik]). Med detta som grund har ett system föratt inhämta data om restider med hjälp av Google Maps Directions API samtberäkna restidskvoter och annan metadata utifrån denna insamlade dataskapats. Systemet används till att göra dagliga körningar och lagrar inhämtaddata i en databas hos Västtrafik. Till systemet finns också en dashboard somkan användas för att göra sökningar i databasen som byggts upp och på såsätt hämta, visualisera och analysera önskad data. Restidsdata förkollektivtrafik som erhållits från Google har i stickprov jämförts medrestidsdata från Västtrafik och även om det fanns några avvikelser så stämdede väl överens. Därav dras slutsatsen att data från Google går att använda tillatt beräkna och analysera restidskvoter.
31
Glas, Jenny. "“För annars har man ju fått harve på här...” : Distansutbildningens betydelse för boende i Vilhelmina kommun." Thesis, Umeå universitet, Institutionen för geografi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-171585.
Full textAbstract:
There is a risk of skilled labour shortages in rural areas in Sweden due to demographic change. Distance education is one manner to meet those challenges. This study focuses on people's experiences of distance education in a rural municipality and what it meant to them. The study is based on interviews with people who have completed higher education through distance learning in the Vilhelmina municipality and is compared with previous studies. The results show that career opportunities and personal development within the municipality are highlighted as valuable outcomes of distance education.
32
Åkerberg, Maria, and Helena Larsson. ""När man jobbar hemifrån då vill man att det ska synas att man gör ett bra jobb" : En intervjustudie om medarbetares upplevda arbetssituation på distans." Thesis, Stockholms universitet, Sociologiska institutionen, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-193439.
Full textAbstract:
Företag genomgår ständigt organisationsförändringar för att anpassa sig efter det som sker i omvärlden. En pandemi kom att förändra hela världssamhället år 2020, något som skakade om de flesta organisationer och dess medarbetare. En av de anpassningar som organisationer världen över tvingats till under pandemin är att anställda behöver arbeta på distans. Syftet med studien är att undersöka hur medarbetare inom white collar-yrken upplever sin arbetssituation på distans som införts till följd av corona-pandemin. För att nå studiens syfte genomfördes semistrukturerade intervjuer med sju medarbetare inom den svenska arbetsmarknaden. Medarbetarna som intervjuades verkar inom olika arbetsområden, statligt- och privat med syfte att bredda studiens resultat. Trots detta upplevde samtliga respondenter sina arbetssituationer likvärdigt. I resultatet lyfts individernas upplevelse avseende krav, kontroll och stöd i förhållande till det förändrade arbetssättet. Det nya arbetssättet bedrivs på distans, alltså hemifrån och inte på den fysiska arbetsplatsen. I resultatet lyfts även att stöd från chefer utgör en betydande faktor. Resultatet visade att medarbetarna inom white collar-yrkena inte upplever någon större förändring i sin arbetssituation. Däremot har gränsdragningen mellan arbetsliv och privatliv blivit alltmer diffus.
33
Girton, Jeffrey M. "United I Stand: An Investigation of Power Distance Value and Endorsement of the Great Man Theory Through American Social Identities." Antioch University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=antioch1571322381565998.
Full text
34
de, Warrenne Waller Christopher Scott. "Distance and dealings between the Christian and God in the poetry of George Herbert : 'wilt thou meet arms with man?'." Thesis, University of Bristol, 2015. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687448.
Full textAbstract:
This dissertation argues that George Herbert's poetry explores the theme of the Christian's distance from God and evaluates different paths that might overcome that distance. Herbert's explorations are informed by their historical context in which emerging secular learning and the post-Reformation culture unsettled traditional ideas about sacredness and access to the divine. A range of contemporaneous theological and spiritual discourses (especially those of Calvin and Perkins) that attempt to understand the Christian's dealing with God are analysed in the first chapter, where I contextualise Herbert's writing in relation to other Protestant articulations of religious experience - notably the experience of the Holy Spirit. I show how Herbert privileges the rite of the eucharist as an experiential path to God rather than the experience of the Holy Spirit in preaching celebrated by other Protestants. Chapter 2 examines the conceptual basis of God's remoteness: the metaphysical distinction between the material and the immaterial modes of being which underlies Herbert's vision of man composed of body and soul. Herbert's exploration of human agency reveals an ontological dualism under strain in his culture which was questioning its rational basis. Herbert does not seek rational solutions to these difficulties but literary resolutions. Chapter 3 highlights the manner in which Herbert's work evinces fears that Renaissance reason was too worldly in its orientation. By way of reaction, he attempts, not without ambivalence, to affirm the primacy of Christian faith as a path to God. I examine Herbert's use of Bible typology to reach God in Chapter 4. Despite typology's fruitful spiritual potential, it does not always bring sacred meaning or solace to The Temple's speakers. This failure is explained with reference, on the one hand, to the contemporaneous critical intellectual culture (particularly regarding Renaissance intellectuals' understanding of Scripture; an understanding that could challenge basic Christian teaching) and, on the other hand, to an underlying anxiety about the loss of certain features of pre-Reformation spirituality that formerly provided a sense of the proximity of the sacred. Herbert celebrates Scripture as a quasi-mystical means of approaching God but, again, not unambiguously. Chapter 5 discusses Herbert's language of rebellious complaints "about God's distance. Here I show how this language encroaches upon controversies about the sacred symbol of the cross, highlights the naivety of the worldview of the book of Job and spills over into the speaker's vociferous blaming of God for cruelly distancing Himself from pious Christians. The idea that Herbert's technique of writing God a voice is blasphemous (as maintained by some critics) is discussed in Chapter 6. I argue that this fictional device, which effectively brings God onto the page, does not constitute an offence to orthodoxy since Herbert's skilful use of divine speech often leads the speaker towards doctrinal correction rather than doctrinal deviation. Chapter 7 argues that Herbert's idea of the Church (a motif profoundly embedded in his poetic project)holds out the firmest promise for attaining divine proximity. For the Church to fulfil such a role it must be consensual and Conformist. But Herbert's consensualism does not exclude muted attacks on radical Protestants. His evocation of divine presence in the material church building feeds into his literary Temple which celebrates sacred space, sacred rites and sacred time. Yet even that Church-related access to God is has its limits.
35
Powell, Caitlin E. "Man Pain in the Man Booker Prize: A Quantitative Approach to Contemporary Canon Formation." Scholarship @ Claremont, 2014. http://scholarship.claremont.edu/scripps_theses/425.
Full textAbstract:
This project examines the corpus of novels that have been nominated for the Man Booker Prize and, using the prize as a creator of a contemporary literary canon, attempts to develop a model of a contemporary best text. Using the distant reading techniques proposed by digital humanities scholar Franco Moretti to track and graph a variety of formal and structural variables across the corpus of nominees, it becomes apparent that the kind of novel that typically wins the Booker Prize and thus the kind of novel that qualifies as a contemporary best text fits a distinct mold. These novels are solemn, serious texts written by British or Irish men, and the stories they tell concern young British or Irish men struggling, often alone, in pain, and under the threat of impending age, through a brutal, violent, and amoral world.
36
Bergonso, Carlos Alberto Ter?ariol. "M?todo para avalia??o de aspectos de camada f?sica e MAC de redes 802.11." Pontif?cia Universidade Cat?lica de Campinas, 2012. http://tede.bibliotecadigital.puc-campinas.edu.br:8080/jspui/handle/tede/529.
Full textAbstract:
Made available in DSpace on 2016-04-04T18:31:34Z (GMT). No. of bitstreams: 1
Carlos Alberto Tercariol Bergonso.pdf: 948199 bytes, checksum: 9baee66f05960fc08d06f925a9ea859a (MD5)
Previous issue date: 2012-12-07The present dissertation proposes a 802.11 network evaluation sequence which can be adopted, independently of the equipment used at the network. The log-distance path loss model is used for the environment characterization (by the model ? parameter) where the network is evaluated. The specific objectives of each evaluation stage are presented and contextualized. The full proposal has initial steps related to the information determination which will be used as references of equipment location and data, and of network performance. Those reference data will be later compared to the handled data obtained from measurements related to the physical and MAC (Medium Access Control) layer performance and behavior, as well as to the transport layer. By the end, one stage to consolidate the measured data is necessary in order to determine a single final result, weigh up according to the specific objectives of the network and/or equipment evaluation. However, the work focus is at the equipment data obtaining stage and at the lower layers (physical and MAC) performance/behavior determination, so that evaluation methods are developed for those two stages. It is demonstrated that the effective transmission physical layer data rates vary much more than what is expected due to the interpretation of the data provided by equipment manufactors. And that better performance could be obtained from complex networks, which made use of multiple access points, installed at unfavorable propagation environments, depending upon the network project.
A presente disserta??o prop?e uma sequ?ncia de avalia??o para redes 802.11 que pode ser adotada, independentemente de quais s?o os equipamentos utilizados na rede. O modelo de log-distance path loss ? utilizado para caracteriza??o do ambiente (pelo par?metro ? do modelo) em que a rede ? avaliada. Os objetivos espec?ficos de cada uma das etapas de avalia??o s?o apresentadas e contextualizadas. A proposta, em sua totalidade, apresenta etapas iniciais relacionadas ? determina??o de informa??es que ser?o usadas como refer?ncias de localidade e desempenho de rede, e de dados dos equipamentos. Esses dados de refer?ncia ser?o posteriormente comparados com os dados coletados e tratados de medi??es realizadas em rela??o ao desempenho e comportamento das camadas f?sicas e MAC (Medium Access Control) e da camada de transporte. Por fim, uma etapa de consolida??o dos resultados das medi??es ? necess?ria para se obter um resultado final ?nico, composto de forma a ponderar de acordo com o(s) objetivo(s) espec?fico(s) de avalia??o da rede e/ou equipamento. O foco dessa disserta??o, contudo, est? na obten??o de dados dos equipamentos, de desempenho e comportamento das camadas inferiores (f?sica e MAC), de forma que para essas etapas, m?todos de avalia??o s?o desenvolvidos. ? demonstrado que as taxas de transmiss?o de dados efetivamente praticadas na camada f?sica variam muito mais que o esperado em fun??o da interpreta??o dos dados fornecidos pelos fabricantes de equipamentos. E que, dependendo do projeto da rede, pode-se obter melhores desempenhos em ambientes de propaga??o desfavor?vel que utilizam m?ltiplos pontos de acesso.
37
Tilius, Laimutis. "Nuotolinio mokymosi technologijų analizė ir taikymas neformaliajame ugdyme." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2009. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2009~D_20090828_134545-45637.
Full textAbstract:
Magistro baigiamajame darbe nagrinėjamos nuotolinio mokymo technologijos ir jų taikymas bendrojo lavinimo mokyklų neformaliajame ugdyme. Panaudojus sukauptą patirtį ir pritaikius įgytas žinias, parengiau programinę įrangą tinkančią naudoti bendrojo lavinimo mokyklų neformaliojo ugdymo informacinių technologijų užsiėmimams organizuoti. Naudojant parengtą programinę įrangą yra galimybė sudominti mokinius savo krašte esančiais kultūros objektais ir jiems patiems leisti skleisti Pasauliui apie savo krašto paveldo objektus, fotografijas ir video siužetus.The master's degree work makes the research of the technologies of distance learning in the field of non-formal education at general education schools. On the base of the gained personal experience and knowledge the programme software for computer activities has been successfully created and used to organize non-formal education at general education schools. This software gives a lot of opportunities to make students getting more interested in the cultural heritage of their native land and helps to spread information over the world.
38
Berglund, Henrik, and Kevin Karlsson. "Rewatchers - Användarcentrerad IT-systemutveckling - Hur man man med hjälp av användarcentrerade metoder utveckla ett IT-System mot globala användare på distans?" Thesis, Örebro universitet, Handelshögskolan vid Örebro Universitet, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-61056.
Full text
39
Ngo, Quoc-Tuong. "Généralisation des précodeurs basés sur la distance minimale pour les systèmes MIMO à multiplexage spatial." Rennes 1, 2012. http://www.theses.fr/2012REN1E001.
Full textAbstract:
Dans cette thèse, nous avons utilisé la théorie des matrices et les propriétés d’algèbre linéaire pour concevoir de nouveaux précodeurs MIMO basés sur la distance euclidienne minimale (max-dmin) entre les points des constellations reçues. À cause de la grande complexité de résolution engendrée par le nombre d’antennes et le nombre de symboles dans la constellation utilisée, ce type de précodeur n’existait auparavant que pour 2 voies d’émission et des modulations simples. Nous l’avons dans un premier temps étendu à la modulation MAQ-16, avant de généraliser le concept pour toute modulation MAQ. L’utilisation des fonctions trigonométriques a ensuite permis une nouvelle représentation du canal à l’aide de deux angles, ouvrant la voie à un précodeur dmin pour trois voies de données. Grâce à ce schéma, une extension non-optimale du précodeur max-dmin pour un nombre impair de flux de symboles utilisant des modulations MAQ est obtenue. Lorsqu’une détection par maximum de vraisemblance est utilisée, le nombre de voisins fournissant la distance minimale est également très important pour le calcul du TEB. Pour prendre en compte ce paramètre, un nouveau précodeur, sans rotation possible, est considéré, menant à une expression moins complexe et un espace de solutions restreint. Enfin, une approximation de la distance minimale a été dérivée en maximisant la valeur minimale des éléments diagonaux de la matrice maximisant le RSB. L'avantage majeur de cette conception est que la solution est disponible pour toute modulation MAQ rectangulaire et pour tout nombre de flux de symbolesIn this thesis, we studied the efficient non-diagonal precoder based on the maximization of the minimum Euclidean distance (max-dmin) between two received data vectors. Because the complexity of the optimized solutions depends on the number of antennas and the modulation order, the max-dmin precoder was only available in closed-form for two independent data-streams with low-order modulations. Therefore, we firstly extended this solution for two 16-QAM symbols and then generalized the concept to any rectangular QAM modulation. By using trigonometric functions, a new virtual MIMO channel representation thanks to two channel angles, allows the parameterization of the max-dmin precoder and the optimization of the distance for three parallel data streams. Thanks to this scheme, an extension for an odd number of data-streams using QAM modulations is obtained. Not only the minimum Euclidean distance but also the number of neighbors providing it has an important role in reducing the error probability when an ML detection is considered at the receiver. Aiming at reducing this number of neighbors, a new precoder in which the rotation parameter has no influence is proposed, leading to less complex processing and a smaller space of solutions. Finally, an approximation of the minimum distance was derived by maximizing the minimum diagonal element of the SNR-like matrix. The major advantage of this design is that the solution can be available for all rectangular QAM-modulation and any number of datastreams
40
Lundgren, Sørli Vanja. "In a Man´s World : Tolkninger av lovbrudd gjort i langtransportens yrkeskontekst." Doctoral thesis, Stockholm University, Department of Criminology, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-520.
Full textAbstract:
Criminological studies have shown that economical and/or occupational crimes are committed within all examined trades and occupations. This is also a fact in the gendered occupational context the Norwegian and Swedish long-distance trucking trade constitutes. This dissertation sets out to determine, by qualitative in-depth interviews with 24 interviewees and field observations, what certain gaining occupational and economical crimes mean to trade actors and how to interpret the meaning criminologically. A hermeneutical orientation constitutes the methodological and epistemological basis of the interpretation.
Analysis of the material shows two central consistent patterns in the interpretations made by interviewees and other trade actors:
1) The actors´ explanations of why law violations are committed. These are influenced by the actors´ view of how wide the specific violations are spread and influence the violation’s acceptability.
2) The actors´ normative evaluation of the law violations. The actors construct normative distinctions between normal, acceptable and unacceptable actions. The distinction is influenced by how the law violations are explained and how widespread they are considered to be.
The first pattern; actors interpretation of why law violations are committed, corresponds with explanations in established criminological theories. The actors’ explanations are discussed as techniques of neutralisation. However, explanations of cause of actions are established also in the discourse of trade-actors who do not violate laws, and a deeper interpretation is called for. A discussion about law violations, based on interviewees discourse, as caused by criminogenic structures are developed. The actors identify the structures as criminogenic and this discourse of coersive structures implies conservation of law violations as part of normality. An interpretation of why several but not all individuals violate laws even if the law violations considers to be normal and acceptable, is developed in terms of differential association.
However, solely use of established theoretical perspectives is not a sufficient interpretation of the law violations; the perspective of interpretation indicated by the second pattern will then be lost. Why is law violations considered both normal and deviant? This dissertation applies a gender-theoretical perspective and argues that actors constitute masculinity through acceptable law violations and that masculinity and normality are correlated. A cultural discourse of borders between normality and deviance is conserved and processed, and the actors discourses of law violations as without victims and as a necessity to continue as truckers, are central in the normalization of normative borders.
41
Terçariol, César Augusto Sangaletti. ""Resultados analíticos para as distribuições estatísticas relacionadas à caminhada determinista do turista sem memória: efeito da dimensionalidade do sistema e modelos de campo médio"." Universidade de São Paulo, 2004. http://www.teses.usp.br/teses/disponiveis/59/59135/tde-29092005-191004/.
Full textAbstract:
Considere um meio caracterizado por $N$ pontos cujas coordenadas são geradas aleatoriamente de maneira uniforme nas arestas unitárias de um hipercubo $d$-dimensional. Um caminhante parte de cada ponto deste meio desordenado e se movimenta obedecendo à regra determinista de ir para o ponto mais próximo que não tenha sido visitado nos últimos $mu$ passos. Este processo foi denominado de caminhada determinista do turista. Cada trajetória gerada por esta dinâmica possui uma parte inicial não-periódica de $t$ passos (transiente) e uma parte final periódica de $p$ passos (atrator). As probabilidades de vizinhança são expressas através da fórmula de Cox, que é parametrizada pela função beta incompleta normalizada $I_d = I_{1/4}[1/2,(d+1)/2]$. Enfati-zamos aqui que a distribuição relevante é $S_{mu,d}^{(N)}(t,p)$, a distribuição conjunta de $t$ e $p$, que tem como casos particulares as distribuições marginais, previamente estudadas. O objetivo deste estudo é obter analiticamente estas distribuições para a caminhada determinista do turista sem memória no espaço euclideano, no modelo de distâncias aleatórias (que corresponde ao limite $d
ightarrow infty$) e no modelo de mapeamento aleatório (que é um caso limite das redes de Kauffman). As distribuições analíticas obtidas foram validadas através de experimentos numéricos. A distribuição conjunta de tempos de transiente e período de atratores, no limite termodinâmico para uma dimensionalidade arbitrária vale: $S_{1,d}^{(infty)}(t,p) = [Gamma(1+I_d^{-1}) cdot (t+I_d^{-1})/Gamma(t+p+I_d^{-1})] cdot delta_{p,2}$, onde $t=0,1,2,ldots,infty$; $Gamma(z)$ é a função gama e $delta_{i,j}$ é o delta de Kronecker. A caminhada determinista do turista sem memória no modelo de mapeamento aleatório produz uma distribuição de períodos não-trivial ($S_{0,rm}^{(N)}(p) propto p^{-1}$), que é obtida de $S_{0,rm}^{(N)}(t,p) = Gamma(N)/{Gamma[N+1-(t+p)]N^{t+p}}$, onde enfatizamos que o número de pontos explorados $n_e=t+p$ é a grandeza fundamental nos problemas considerados.Consider a medium characterized by $N$ points whose coordinates are randomly generated by a uniform distribution along the unitary edges of a $d$-dimensional hypercube. A walker leaves from each point of this disordered medium and moves according to the deterministic rule to go the nearest point which has not been visited in the preceding $mu$ steps. This process has been called the deterministic tourist walk. Each trajectory generated by this dynamics has an initial non-periodic part of $t$ steps (transient) and a final periodic part of $p$ steps (attractor). The neighborhood probabilities are given by the Cox formula, which is parameterized by the normalized incomplete beta function $I_d = I_{1/4}[1/2,(d+1)/2]$. Here we stress that the relevant distribution is the joint $t$ and $p$ distribution $S_{mu,d}^{(N)}(t,p)$, which has as particular cases, the marginal distributions previously studied. The objective of this study is to obtain analytically these distributions for the memoryless deterministic tourist walk in the euclidean space, random link model (which corresponds to $d ightarrow infty$ limit) and random map model (which is a limiting case of the Kauffman model). The obtained distributions have been validated by numerical experiments. The joint transient time and attractor period distribution in the thermodynamic limit for an arbitrary dimensionality is: $S_{1,d}^{(infty)}(t,p) = [Gamma(1+I_d^{-1}) cdot (t+I_d^{-1})/Gamma(t+p+I_d^{-1})] cdot delta_{p,2}$, where $t=0,1,2,ldots,infty$; $Gamma(z)$ is the gamma function and $delta_{i,j}$ is the Kronecker's delta. The memoryless deterministic tourist walk in the random map leads to a non-trivial cycle distribution ($S_{0,rm}^{(N)}(p) propto p^{-1}$), which is obtained from $S_{0,rm}^{(N)}(t,p) = Gamma(N)/{Gamma[N+1-(t+p)]N^{t+p}}$, where we stress that the number of explored points $n_e=t+p$ is the fundamental quantity in the considered problems.
42
Terçariol, César Augusto Sangaletti. "Caminhadas deterministas parcialmente auto-repulsivas: resultados analíticos para o efeito da memória do turista na exploração de meios desordenados." Universidade de São Paulo, 2008. http://www.teses.usp.br/teses/disponiveis/59/59135/tde-18122009-153031/.
Full textAbstract:
Considere um meio desordenado constituído por $N$ pontos cujas coordenadas são geradas aleatoriamente de maneira uniforme e independente nas arestas unitárias de um hipercubo $d$-dimensional. As probabilidades de vizinhança entre os pares de pontos deste meio são expressas através da fórmula de Cox. Um caminhante parte de um dado ponto deste meio desordenado e se movimenta obedecendo à regra determinista de ir para o ponto mais próximo que não tenha sido visitado nos últimos $\\mu$ passos. Este processo foi denominado de caminhada determinista do turista. Cada trajetória gerada por esta dinâmica possui uma parte inicial não-periódica de $t$ passos (transiente) e uma parte final periódica de $p$ passos (atrator). Neste trabalho, obtemos analiticamente algumas distribuições estatísticas para a caminhada determinista do turista com memória $\\mu$ arbitrária em sistemas unidimensionais e com memória $\\mu=2$ no modelo Random Link (que corresponde ao limite $d ightarrow 1$). Estes resultados nos permitiram compreender o papel da memória no comportamento exploratório do turista e explicar a equivalência não-trivial entre o modelo Random Link e o modelo Random Map (que é um caso limite das redes de Kauffman). Enfatizamos que o número de pontos explorados pelo turista é a grandeza fundamental nos problemas considerados. As distribuições analíticas obtidas foram validadas através de experimentos numéricos. Também obtivemos uma dedução alternativa para a fórmula de Cox, apresentando os resultados finais em termos de distribuições estatísticas elementares.Consider a medium characterized by $N$ points whose coordinates are randomly and independently generated by a uniform distribution along the unitary edges of a $d$-dimensional hypercube. The neighborhood probabilities between any pair of points in this medium are given by the Cox formula. A walker leaves from each point of this disordered medium and moves according to the deterministic rule to go the nearest point which has not been visited in the preceding $\\mu$ steps. This process has been called the deterministic tourist walk. Each trajectory generated by this dynamics has an initial non-periodic part of $t$ steps (transient) and a final periodic part of $p$ steps (attractor). In this work, we obtain analytically some statistical distributions for the deterministic tourist walk with arbitrary memory $\\mu$ in one-dimensional systems and with memory $\\mu=2$ in the random link model (which corresponds to $d ightarrow 1$ limit). These results enable us to understand the main role played by the memory on the tourist\'s exploratory behavior and explain the non-trivial equivalence between the random link model and the random map model (which is a limiting case of the Kauffman model). We stress that the number of explored points is the fundamental quantity in the considered problems. The obtained distributions have been validated by numerical experiments. We also obtain an alternative derivation for the Cox formula, writing the final results in terms of known statistical distributions.
43
Burlac, Leonid, and Nikolaos Giannakis. "Benford’s Law: Analysis of the trustworthiness of COVID-19 reporting in the context of different political regimes." Thesis, Mälardalens högskola, Akademin för utbildning, kultur och kommunikation, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-54560.
Full textAbstract:
In order for governments and demographers to, among other things, design policies and pensionplans, as well as for insurance companies to offer policies that serve general public, having reliable mortality data plays a crucial role. The academic world works actively in developing tools (models and methods) that can, based on collected mortality data, forecast future death rates in the observed population. Obviously, to be able to rely on the predicated data one needs a reliable source of existing mortality data. In the light of the ongoing COVID-19 pandemic, reliability of certain death-case reporting has been questioned. In this thesis, the Benford’s Law is used to evaluate how well countries with authoritarian regimes (Azerbaijan, Belarus),and with democratic regimes (Greece, Serbia, Sweden), report their COVID-19 cases to theworldwide public. Statistical tests such as the Chi-squared test, mean absolute deviation, and the distribution distance were used to obtain the results needed to form our conclusions. During our testing, we found that countries with democratic regimes do conform better to the Benford’s law than the authoritarian ones.
44
Bubani, Elia. "Homeomorphic extension of Quasi-Isometries and Iteration Theory." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/23243/.
Full textAbstract:
Starting from the Riemann Mapping Theorem it arises the interest for
biholomorphisms over domains in one or several complex variables. Poincar´e
showed that there is no analytic isomorphism between the Polydisc and the
unit ball already in C^2. The previous fact may suggest that biholomorphic
domains are a class of such well-behaved sets that could extend some regularity of the biholomorpshism until their respective boundaries. A very influent
approach was faced by Fefferman (published in the year 1974), by
proving that every biholomorphism between bounded strongly pseudoconvex
domains with
smooth boundaries extends as a diffeomorphism to the closures of the domains. In this work is quoted a classical result that presents
an isometry respect to the Bergman metric between biholomorphic domains
and he noticed an interesting behaviour of geodesics when they are going to
the boundary of a considered domain.
The first part of this thesis mainly follows Abate’s work aiming to show the homeomorphic extension of a biholomorphism between C^2-smooth strongly pseudoconvex domains.
The second part of this thesis mainly follows the work of Bracci, Gaussier and
Zimmer aiming to show the homeomorphic extension of a Quasi-Isometric homeomorphisms to the End compactifications of the respective domains.
Other consequences are related to extend the Denjoy-Wolff
Theorem for domains in several complex variables and present the Denjoy-Wolff behaviour
for commuting holomorphic selfmaps with no fixed point in the domain itself.
45
Birochi, Renê. "O mapa de valor da indústria de e-learning no Brasil, segundo critérios de valor percebido." Universidade de São Paulo, 2003. http://www.teses.usp.br/teses/disponiveis/12/12139/tde-26052009-111527/.
Full textAbstract:
Foram estudados os principais fatores de valor percebido pelo mercado em relação aos produtos e serviços oferecidos pelas empresas fornecedoras de insumos de E-Learning. O estudo desses fatores, relacionados aos respectivos segmentos que compõem essa indústria, permitiu posicionar as principais empresas (uma em cada segmento) que se adequaram melhor a esses fatores de valor percebido. Foi realizada também uma revisão da literatura, para definir o conceito de E-Learning, descrevendo suas diversas aplicações e organizando-as em quatro aspectos: o pedagógico, o tecnológico, o gerencial e o relativo ao negócio dessa atividade. Propôs-se, também, um mapa de valor dessa indústria, tratando de segmentá-lo. O conceito de valor foi estudado, considerando-o dentro da perspectiva da percepção do cliente, ou seja, foram abordados os aspectos relativos aos critérios que constituem o valor percebido. Finalmente, foi aplicada uma pesquisa de campo a um grupo de especialistas da indústria de E-Learning, com o objetivo de classificar os principais fatores de valor percebido pelo mercado, avaliar um fornecedor em cada segmento de atuação e selecionar aquele que atendeu melhor aos critérios de percepção de valor. Os resultados obtidos por meio da análise das respostas dos especialistas apontaram caminhos para a realização de novos estudos sobre o negócio E-Learning, além de estabelecer critérios importantes relativos às principais empresas fornecedoras dessa indústria.This Masters Degree Dissertation studies the main factors of market perceived value in relation to products and services offered by E-Learning input supplying companies. The study of such factors, related to the segments which comprise this industry, enabled us to identify the main companies one of each segment which best adapted to selected perceived value factors. Initially a literature review was carried out, aiming at defining the concept of E-Learning, describing its different applications and organizing it in four axes of main coordinates: the pedagogical aspect, the technological aspect, the management aspect and the business aspect of the activity. Another aim of such a literature review was understanding the development of this industry, through companies which comprise it, and then propose a value map of such an industry, dividing it into segments with the support of studies on this topic. The third step of this review was a focus on the concept of value. It was therefore adopted a theoretical line which considers value within the clients perception perspective. In other words, the focus was on aspects related to the criteria which comprise the so-called perceived value. Finally, a field research was carried out along with a group of E-Learning experts, with the following aims: ranking the main factors of market perceived values, in order to assess a supplier in each segment; and selecting only one company, in each of the segments, which best fits the perceived value criteria previously obtained. The results obtained by the consolidation and analysis of the experts answers pointed out ways to carry out new studies on the E-Learning business point of view, as well as establish important criteria about the main supplying companies of this industry.
46
Karlsson, Sara, and Halimi Fjona Ibishi. ""Man känner sig lite mer... distant" : En kvalitativ intervjustudie av gymnasieelevers psykiska välmående underdistansundervisningen i samband med Covid-19 pandemin." Thesis, Högskolan i Halmstad, Akademin för lärande, humaniora och samhälle, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-44873.
Full textAbstract:
Denna studie syftar till att undersöka elevers välmående under distansundervisningen i samband med Covid-19 pandemin. Vid studiens genomförande har distansundervisningen pågått under ett års tid. Till studien har Vygorskijs teori om sociokulturellt lärande utgjort en stor del, även gränsteori och det salutogena perspektivet på hälsa. Metoden har bestått av kvalitativa, semistrukturerade intervjuer med åtta gymnasieelever i årskurs 3 vid studieförberedande program på två olika gymnasieskolor. Genom en hypotetiskt-deduktiv metod har vi utgått från fem kategorier; studiemiljö, stöd och hjälp, sociala relationer, fysisk aktivitet och mående. Med hjälp av vår insamlade empiri, vår tidigare forskning samt teorier har vi undersökt hur elevernas psykiska välmående påverkats av distansundervisningen med fokus på de fem kategorierna. Vårt resultat visar att det finns en påverkan hos eleverna samtidigt elevsvaren är av stor variation. En del av eleverna ansåg att distansen har givit dem positiva effekter då den inneburit en frihet för dem medan andra elever ansåg att effekterna av distansundervisningen var negativa. De negativa följder som kunnat urskiljas ur vår empiri är en minskad energi och brist på rutiner. Utifrån de varierade resultatet dras slutsatserna att distansundervisningen har en påverkan på eleverna, men att denna påverkan kan vara varierande. Utifrån empirin tenderar rutiner och tydlig struktur att höra ihop med positiva effekter av distansundervisningen medan det motsatta, brist på rutiner och struktur, verkar vara likt med en negativ påverkan.
47
Wodlin, Sofia, and Linnea Nyström. "“Hur ska man tackla en motgång om man inte kan klappa lite på axeln och säga att det kommer lösa sig?” : En kvalitativ studie om chefers upplevelse av ledarskap på distans." Thesis, Linköpings universitet, Institutionen för beteendevetenskap och lärande, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148977.
Full textAbstract:
Syftet med uppsatsen är att skapa en ökad förståelse för ledarskap på distans ur ett chefsperspektiv. Syftet undersöktes genom två frågeställningar som behandlar hur chefer bedriver sitt ledarskap på distans samt hur dessa chefer upplever sitt ledarskap. Genom en i huvudsak induktiv ansats med deduktiva inslag och kvalitativa semi-strukturerade intervjuer undersöktes uppsatsens ämne. Den insamlade empirin analyserades genom meningskoncentrering och skapade sex huvudsakliga teman som är; Kommunikationsverktyg, Krav i det dagliga arbetet, Relation till medarbetarna, Det egna ledarskapet, Digitalisering samt Tankar om kompetensbrist. De fynd som framkommit visar hur cheferna bedriver sitt arbete genom virtuella kommunikationsmedel där de föredrar de medel som i större grad kan spegla det fysiska mötet. Majoriteten av cheferna upplever fler möjligheter än begränsningar med sina arbeten och menar att ledarskap på distans har potentialen att lösa en rad problem, såsom problematiken med kompetensbrist.
48
Lima, Rommel Wladimir de. "Mapa de Conte?dos e Mapa de Depend?ncias:Ferramentas Pedag?gicas para uma Metodologia de Planejamento baseada em Objetivos Educacionais e sua Implementa??o em um Ambiente Virtual de Aprendizagem." Universidade Federal do Rio Grande do Norte, 2009. http://repositorio.ufrn.br:8080/jspui/handle/123456789/15144.
Full textAbstract:
Made available in DSpace on 2014-12-17T14:54:55Z (GMT). No. of bitstreams: 1
RommelWL_TESE.pdf: 2044651 bytes, checksum: e312d872467a37414bea30914a0fdd60 (MD5)
Previous issue date: 2009-06-01Furthered mainly by new technologies, the expansion of distance education has created a demand for tools and methodologies to enhance teaching techniques based on proven pedagogical theories. Such methodologies must also be applied in the so-called Virtual Learning Environments. The aim of this work is to present a planning methodology based on known pedagogical theories which contributes to the incorporation of assessment in the process of teaching and learning. With this in mind, the pertinent literature was reviewed in order to identify the key pedagogical concepts needed to the definition of this methodology and a descriptive approach was used to establish current relations between this conceptual framework and distance education. As a result of this procedure, the Contents Map and the Dependence Map were specified and implemented, two teaching tools that promote the planning of a course by taking into account assessment still in this early stage. Inserted on Moodle, the developed tools were tested in a course of distance learning for practical observation of the involved concepts. It could be verified that the methodology proposed by the above-mentioned tools is in fact helpful in course planning and in strengthening educational assessment, placing the student as central element in the process of teaching and learning
Com a expans?o da Educa??o a Dist?ncia, promovida principalmente pelos novos recursos tecnol?gicos, existe atualmente uma procura por ferramentas e metodologias que possibilitem trabalhar o ensino-aprendizagem, de acordo com teorias pedag?gicas consolidadas e que possam ser inseridas nos Ambientes Virtuais de Aprendizagem. O objetivo deste trabalho ? apresentar uma metodologia de planejamento, baseada em teorias pedag?gicas j? comprovadas, e que contribua para a inser??o da avalia??o no processo de ensino-aprendizagem. Para isso foi realizada uma revis?o da literatura para identifica??o dos conceitos pedag?gicos necess?rios ? defini??o da metodologia e utilizado um m?todo descritivo no estabelecimento das rela??es existentes entre esses conceitos e a Educa??o a Dist?ncia. Como resultado desse processo, foram especificados e implementados o Mapa de Conte?dos e o Mapa de Depend?ncias, duas ferramentas pedag?gicas que promovem o planejamento de uma disciplina e possibilitam pensar a avalia??o ainda nessa fase. Implementadas no Moodle, as ferramentas desenvolvidas foram testadas em uma disciplina a dist?ncia para observa??o, na pr?tica, dos conceitos implementados. Com isso, foi poss?vel verificar que a metodologia de planejamento proposta, atrav?s das ferramentas desenvolvidas, auxilia no planejamento da disciplina e no processo de avalia??o do aluno, contribuindo para inser??o da avalia??o no processo de ensino-aprendizagem e colocando o aluno como elemento central desse processo
49
Nordlöv, Anna. "Incorporating GIS in urban planning : Quantifying accessibility to sociotopic user values for use in urban planning and citizen dialogue – a case study of Årstafältet, Stockholm." Thesis, KTH, Geoinformatik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231027.
Full textAbstract:
There exists a debate regarding where to build new housing in increasingly denser cities today. Often it is the green spaces that must be sacrificed which lead to conflicts among decision makers and citizens. Although, some sources claim (Byrne et al., 2010; Van Herzele & Wiedemann, 2003) that it is not only the fact that there is a green area close to you that matters; but rather which values that piece of green land offers you as a citizen. Values of parks can be described as the features or attributes the park area possess that inspire people to go to and stay there. In Stockholm, Sweden these values are connected to sociotopes, a delimited area containing a set of user values with social meaning (Ståhle, 2006). User values thus describes an activity or an experience that is present at a location. There exists a lack of and a desire for more detailed mapping of user values of green areas as well as a potential need for finding an efficient method for aiding in citizen dialogue when green areas are planned for urban development. The purpose of this thesis is thus to try to incorporate geographical information science (GIS) in urban planning by investigating if it is possible to measure the physical accessibility of user values of a green area before and after its urban development in lines with the recommendations on accessibility from the municipality. Then, try to create a visual tool to be used in the designing phase of urban planning and in citizen dialogue when developing a new urban area. To do this, a case study was done of Årstafältet, a green area in Stockholm that is planned for urban development and improvement of existing and creation of new user values. By using GIS, the user values were defined spatially, and geographical data based on the study area currently as well as after the development where found or created based on descriptions of the new area in planning documents. Accessibility was defined as the physical distance a resident must walk from their home to the closest access point of a user value. Based on previous research, 1000m was deemed the largest distance a resident can walk to be considered a potential user of a user value. An access analysis was made for all residents within the study area to the closest access point of every user value. The results of the analysis were visualized in two ways, one regarding urban design and another regarding citizen dialogue in the form of bivariate maps and a GIS web application. Apart from the visual maps, some numerical results regarding distance, distance change and number of accessed user values were calculated. The maps point out the areas that are mostly affected both in the negative and positive sense. More research needs to be done to decide the best way of deriving and using the numerical measures. Because of the many assumptions and generalizations made in the study it is difficult to make any overall conclusions about the accessibility of user values at Årstafältet. What is more interesting is the reception by people in the field of GIS and urban planning; which was in general positive. They noted upon the important aspect of concretize the design phase of the urban planning process, which often is based on feeling, and create a solid ground to base more informed decisions upon. The visualization methods presented were well received as tools for enabling more people access into the planning process as well as an easy way of exploring geographical data. Also, the possibility to extend this type of access analysis beyond sociotopic user values was deemed as very useful. Lastly, they expressed that this type of analysis is desired by the workers in the field and highly relevant in today’s urban planning process.
50
Wilske, Josefin, and Irma Gojak. "Principalansvar vid distansarbete : Hur tillämpas arbetsgivarens skadeståndsrättsliga ansvar för skador dennes anställda vållar mot tredje man i tjänst vid arbete på distans?" Thesis, Linköpings universitet, Filosofiska fakulteten, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-179014.
Full textAbstract:
Enligt 3 kap. 1 § skadeståndslagen har arbetsgivaren principalansvar när dennes arbetstagare vållar skada mot tredje man, vilket betyder att arbetsgivaren åläggs det skadeståndsrättsliga ansvaret. I och med covid-19-pandemin har allt fler människor arbetat på distans för att stoppa smittspridningen. Studier visar att trenden att arbeta på distans kommer att fortsätta även efter pandemins slut. Med möjligheten och friheten att arbeta på distans följer även risken att arbetsgivarens möjligheter att övervaka och kontrollera dennes arbetstagares arbete minskar. Distansarbete har resulterat i en mer komplicerad gränsdragning gällande rekvisitet i tjänst i 3 kap. 1 § SkL. Vi redogör för hur arbetsgivares principalansvar tillämpas när arbetstagaren arbetar på distans. Vår uppsats inleds med en kortare beskrivning av covid-19-pandemin som började mars 2020. Grunderna för principalansvaret och dess skadeståndsrättsliga principer beskrivs i uppsatsen. En stor del av vår uppsats baseras på en redogörelse av rättsfall där principalansvar förelegat för att kunna undersöka var gränsen för principalansvar går. I många av rättsfallen diskuteras om en arbetstagare anses ha varit i tjänst när denne begått skadegörande handlingar. Vi redogör i för var gränsen går för när någon anses vara i tjänst. Sammanfattningsvis har arbetsgivaren ett långtgående principalansvar. Den slutsats vi har dragit, efter att ha applicerat gällande rätt på distanssituationer, är att det inte finns en stor skillnad när det gäller arbetsgivarens skadeståndsrättsliga ansvar mellan när arbetstagaren arbetar på plats och när denne arbetar på distans. Principalansvar är beroende av omständigheterna och vi ser ett mönster att domstolarna lägger större vikt vid sambandet till arbetsuppgifterna än om det skett under arbetstid eller i arbetslokal. Eftersom frågan gällande principalansvar vid distansarbete inte har tagits upp i svensk domstol än, är det för tidigt att veta hur domstolarna kommer att tolka omständigheten att arbeta på distans.