Dissertations / Theses on the topic 'Mapping Problem'
To see the other types of publications on this topic, follow the link: Mapping Problem.
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 'Mapping Problem.'
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
Fletcher, George H. L. "On the data mapping problem." [Bloomington, Ind.] : Indiana University, 2007. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3276692.
Full text
2
Balavendran, Joseph Rani Deepika. "Gamification to Solve a Mapping Problem in Electrical Engineering." Thesis, University of North Texas, 2020. https://digital.library.unt.edu/ark:/67531/metadc1703330/.
Full textAbstract:
Coarse-Grained Reconfigurable Architectures (CGRAs) are promising in developing high performance low-power portable applications. In this research, we crowdsource a mapping problem using gamification to harnass human intelligence. A scientific puzzle game, Untangled, was developed to solve a mapping problem by encapsulating architectural characteristics. The primary motive of this research is to draw insights from the mapping solutions of players who possess innate abilities like decision-making, creative problem-solving, recognizing patterns, and learning from experience. In this dissertation, an extensive analysis was conducted to investigate how players' computational skills help to solve an open-ended problem with different constraints. From this analysis, we discovered a few common strategies among players, and subsequently, a library of dictionaries containing identified patterns from players' solutions was developed. The findings help to propose a better version of the game that incorporates these techniques recognized from the experience of players. In the future, an updated version of the game that can be developed may help low-performance players to provide better solutions for a mapping problem. Eventually, these solutions may help to develop efficient mapping algorithms, In addition, this research can be an exemplar for future researchers who want to crowdsource such electrical engineering problems and this approach can also be applied to other domains.
3
Phinjaroenphan, Panu, and s2118294@student rmit edu au. "An Efficient, Practical, Portable Mapping Technique on Computational Grids." RMIT University. Computer Science and Information Technology, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080516.145808.
Full textAbstract:
Grid computing provides a powerful, virtual parallel system known as a computational Grid on which users can run parallel applications to solve problems quickly. However, users must be careful to allocate tasks to nodes properly because improper allocation of only one task could result in lengthy executions of applications, or even worse, applications could crash. This allocation problem is called the mapping problem, and an entity that tackles this problem is called a mapper. In this thesis, we aim to develop an efficient, practical, portable mapper. To study the mapping problem, researchers often make unrealistic assumptions such as that nodes of Grids are always reliable, that execution times of tasks assigned to nodes are known a priori, or that detailed information of parallel applications is always known. As a result, the practicality and portability of mappers developed in such conditions are uncertain. Our review of related work suggested that a more efficient tool is required to study this problem; therefore, we developed GMap, a simulator researchers/developers can use to develop practical, portable mappers. The fact that nodes are not always reliable leads to the development of an algorithm for predicting the reliability of nodes and a predictor for identifying reliable nodes of Grids. Experimental results showed that the predictor reduced the chance of failures in executions of applications by half. The facts that execution times of tasks assigned to nodes are not known a priori and that detailed information of parallel applications is not alw ays known, lead to the evaluation of five nearest-neighbour (nn) execution time estimators: k-nn smoothing, k-nn, adaptive k-nn, one-nn, and adaptive one-nn. Experimental results showed that adaptive k-nn was the most efficient one. We also implemented the predictor and the estimator in GMap. Using GMap, we could reliably compare the efficiency of six mapping algorithms: Min-min, Max-min, Genetic Algorithms, Simulated Annealing, Tabu Search, and Quick-quality Map, with none of the preceding unrealistic assumptions. Experimental results showed that Quick-quality Map was the most efficient one. As a result of these findings, we achieved our goal in developing an efficient, practical, portable mapper.
4
Ramineni, Narahari. "Tree Restructuring Approach to Mapping Problem in Cellular Architecture FPGAS." PDXScholar, 1995. https://pdxscholar.library.pdx.edu/open_access_etds/4914.
Full textAbstract:
This thesis presents a new technique for mapping combinational circuits to Fine-Grain Cellular-Architecture FPGAs. We represent the netlist as the binary tree with decision variables associated with each node of the tree. The functionality of the tree nodes is chosen based on the target FPGA architecture. The proposed tree restructuring algorithms preserve local connectivity and allow direct mapping of the trees to the cellular array, thus eliminating the traditional routing phase. Also, predictability of the signal delays is a very important advantage of the developed approach. The developed bus-assignment algorithm efficiently utilizes the medium distance routing resources (buses). The method is general and can be used for any Fine Grain CA-type FPGA. To demonstrate our techniques, ATMEL 6000 series FPGA was used as a target architecture. The area and delay comparison between our methods and commercial tools is presented using a set of MCNC benchmarks. Final layouts of the implemented designs are included. Results show that the proposed techniques outperform the available commercial tools for ATMEL 6000 FPGAs, both in area and delay optimization.
5
Mu, Wangshu, and Wangshu Mu. "Geocomputational Approaches to Improve Problem Solution in Spatial Optimization: A Case Study of the p-Median Problem." Diss., The University of Arizona, 2018. http://hdl.handle.net/10150/626752.
Full textAbstract:
The p-Median problem (PMP) is one of the most widely applied location problems in urban and regional planning to support spatial decision-making. As an NP-hard problem, the PMP remains challenging to solve optimally, especially for large-sized problems. This research focuses on developing geocomputational approaches to improve the effectiveness and efficiency of solving the PMP. This research also examines existing PMP methods applied to choropleth mapping and proposes a new approach to address issues associated with uncertainty.
Chapter 2 introduces a new algorithm that solves the PMP more effectively. In this chapter, a method called the spatial-knowledge enhanced Teitz and Bart heuristic (STB) is proposed to improve the classic Teitz and Bart (TB) heuristic.. The STB heuristic prioritizes candidate facility sites to be examined in the solution set based on the spatial distribution of demand and candidate facility sites. Tests based on a range of PMPs demonstrate the effectiveness of the STB heuristic.
Chapter 3 provides a high performance computing (HPC) based heuristic, Random Sampling and Spatial Voting (RSSV), to solve large PMPs. Instead of solving a large-sized PMP directly, RSSV solves multiple sub-PMPs with each sub-PMP containing a subset of facility and demand sites. Combining all the sub-PMP solutions, a spatial voting strategy is introduced to select candidate facility sites to construct a PMP for obtaining the final problem solution. The RSSV algorithm is well-suited to the parallel structure of the HPC platform. Tests with the BIRCH dataset show that RSSV provides high-quality solutions and reduces computing time significantly. Tests also demonstrate the dynamic scalability of the algorithm; it can start with a small amount of computing resources and scale up or down when the availability of computing resources changes.
Chapter 4 provides a new classification scheme to draw choropleth maps when data contain uncertainty. Considering that units in the same class on a choropleth map are assigned the same color or pattern, the new approach assumes the existence of a representative value for each class. A maximum likelihood estimation (MLE) based approach is developed to determine class breaks so that the overall within-class deviation is minimized while considering uncertainty. Different methods, including mixed integer programming, dynamic programming, and an interchange heuristic, are developed to solve the new classification problem. The proposed mapping approach is then applied to map two American Community Survey datasets. The effectiveness of the new approach is demonstrated, and the linkage of the approach with the PMP method and the Jenks Natural Breaks is discussed.
6
Leung, Wing-sum. "Applying computer-mediated concept mapping on problem-based learning in biology." Click to view the E-thesis via HKUTO, 2003. http://sunzi.lib.hku.hk/hkuto/record/B40040318.
Full text
7
Leung, Wing-sum, and 梁穎琛. "Applying computer-mediated concept mapping on problem-based learning in biology." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2003. http://hub.hku.hk/bib/B40040318.
Full text
8
Wu, Bian, and 吴忭. "Supporting problem solving and knowledge construction using a dual-mapping learning environment." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hdl.handle.net/10722/197136.
Full textAbstract:
Problem-Based Learning (PBL) has been widely adopted as an important approach to medical education in order to help students master knowledge by solving authentic problems. However, the effect of PBL on students’ construction of a well-organized knowledge base is found not satisfactory. It is assumed that learning a concept found in a problem will automatically result in that concept being used to solve other problems, which is not always the case. Knowledge gained from practice is found difficult to retain and reuse as a result of contextualization and dynamic aspects of actual problem-solving practice. Reciprocity between practice and knowledge has been insufficiently investigated in existing studies.
The purpose of this study was to address the challenge by aligning knowledge construction with problem solving through the design of a computer-based cognitive tool and implementation of the tool into an online learning environment. The tool consists of the argument mapping technique to represent the problem-solving processes and the concept mapping technique to represent the knowledge constructed from the problem-solving experience, so called dual-mapping tool.
This study adopted a design-based research paradigm with two rounds of design and evaluation to explore how the proposed dual-mapping learning (DML) environment could be designed to externalize and connect the problem-solving and knowledge-construction processes and to evaluate how effectively the DML environment could support PBL.
The design of the DML environment was underpinned by the cognitive apprenticeship model, which is widely used in situated learning contexts such as PBL. The model highlights the importance of offering an authentic learning context, externalizing complex cognitive processes, and providing expert guidance on learning processes. Accordingly, the proposed DML environment consists of an authentic problem context for exploration, a dual-mapping tool for articulation and reflection of problem-solving and knowledge-construction processes, and expert support for modeling, coaching, and scaffolding these complex processes.
The evaluation study aimed to investigate the effectiveness of the DML environment in terms of its acceptance by students, students’ problem-solving and knowledge-construction performances, and its impact on learning emotions and motivation to learn. Medical students from two medical schools in Mainland China participated in the study to use the DML environment. Multiple-source data was collected from questionnaire surveys, pre-and post-competency tests, semi-structured interviews, and log file data of online learning records, and was analyzed through descriptive statistical analysis, analysis of means, correlation analysis, analysis of variance, and content analysis. The evaluation results suggested that the students found the DML environment useful, and that the DML environment was effective in improving clinical problem-solving and medical-knowledge construction performance, as well as activating positive emotions and motivation in PBL.
The findings of the study have practical implications for educators and learning technology designers as well as theoretical implications for educational researchers.published_or_final_version
Education
Doctoral
Doctor of Philosophy
9
Rosato, Matthew J. "Applying conformal mapping to the vertex correspondence problem for 3D face models." Diss., Online access via UMI:, 2007.
Find full text
10
Lin, Xinyi. "A machine learning based approach for the link-to-system mapping problem." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-214852.
Full textAbstract:
The quality of mobile communication is related to signal transmissions. Early detection of the errors in transmissions may reduce the time delay of communications. The traditional error detection methods are not accurate enough. Therefore, in this report, a machine learning based approach is proposed for the link-to-system mapping problem, which can predict the outcomes (received correctly or not) of the link-level simulations without knowing the exact signals that are being transmitted. In this method, the transmission state is assumed to be a function of the features of a channel environment like the interference and the noise, the relative motion between the transmitter and the receiver and this function is obtained using a machine learning method. The training dataset is generated by simulations of the channel environment. Logistic regression, support vector machine and neural networks are the three algorithms implemented in this thesis. Experimental results show that all three algorithms work well compared to traditional methods. Neural networks provide the best results for this problem. Furthermore, the neural network model is tested with a dataset consisting of features of ten different channel environments, which verified the generalization ability of the model.
11
Venturella, Michael Anthony. "Modal Analysis of the Ice-Structure Interaction Problem." Thesis, Virginia Tech, 2008. http://hdl.handle.net/10919/31749.
Full textAbstract:
In the present study, the author builds upon the single degree of freedom ice-structure interaction model initially proposed by Matlock, et al. (1969, 1971). The model created by Matlock, et al. (1969, 1971), assumed that the primary response of the structure would be in its fundamental mode of vibration. In order to glean a greater physical understanding of ice-structure interaction phenomena, it was critical that this study set out to develop a multi-mode forced response for the pier when a moving ice floe makes contact at a specific vertical pier location. Modal analysis is used in which the response of each mode is superposed to find the full modal response of the entire length of a pier subject to incremental ice loading. This incremental ice loading includes ice fracture points as well as loss of contact between ice and structure. In this model, the physical system is a bottom supported pier modeled as a cantilever beam. The frequencies at which vibration naturally occurs, and the mode shapes which the vibrating pier assumes, are properties which can be determined analytically and thus a more precise picture of pier vibration under ice loading is presented. Realistic conditions such as ice accumulation on the pier modeled as a point mass and uncertainties in the ice characteristics are introduced in order to provide a stochastic response. The impact of number of modes in modeling is studied as well as dynamics due to fluctuations of ice impact height as a result of typical tidal fluctuations. A Poincaré based analysis following on the research of Karr, et al. (1992) is employed to identify any periodic behavior of the system response. Recurrence plotting is also utilized to further define any existing structure of the ice-structure interaction time series for low and high speed floes. The intention of this work is to provide a foundation for future research coupling multiple piers and connecting structure for a comprehensive ice-wind-structural dynamics model.Master of Science
12
Arvanitogiannis, Andreas. "Mapping the substrate for brain stimulation reward, new approaches to an old problem." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0005/NQ40304.pdf.
Full text
13
Davoren, Mark. "A structural approach to the mapping problem in parallel discrete event logic simulations." Thesis, University of Edinburgh, 1989. http://hdl.handle.net/1842/14748.
Full text
14
Lee, Jong Won. "Effect of gis learning on spatial ability." Diss., Texas A&M University, 2003. http://hdl.handle.net/1969.1/3896.
Full textAbstract:
This research used a spatial skills test and cognitive-mapping test to examine the effect of GIS learning on the spatial ability and spatial problem solving of college students. A total of 80 participants, undergraduate students at Texas A&M University, completed pre- and post- spatial skills tests administered during the 2003 fall semester. Analysis of changes in the students test scores revealed that GIS learning could help students improve their spatial ability. Strong correlations existed between the participants spatial ability and their performance in the GIS course. The research also found that spatial ability improvement linked to GIS learning was not significantly related to differences in gender or to academic major (geography majors vs. science and engineering majors). A total of 64 participants, recruited from students enrolled in Introduction to GIS and Computer Cartography at Texas A&M University, completed pre- and post- cognitive-mapping tests administered during the 2003 fall semester. Students performance on the cognitive-mapping test was used to measure their spatial problem solving. The study assumed that the analysis of the individual map-drawing strategies would reveal information about the cognitive processes participants used to solve their spatial tasks. The participants were requested to draw a map that could help their best friends find their way to three nearby commercial locations. The map-drawing process was videotaped in order to allow the researcher to classify subjects map-drawing strategies. The study identified two distinctive map-drawing strategies: hierarchical and regional. Strategies were classified as hierarchical when subjects began by drawing the main road network across the entire map, and as regional when they completed mapping sub-areas before moving on to another sub-area. After completion of a GIS course, a significant number of participants (about half) changed their map-drawing strategies. However, more research is necessary to address why these changes in strategy came about.
15
Boga, Sreekanth Roppel Thaddeus A. "Vision-enhanced localization for cooperative robotics." Auburn, Ala., 2009. http://hdl.handle.net/10415/1970.
Full text
16
Svensson, Depraetere Xavier. "Application of new particle-based solutions to the Simultaneous Localization and Mapping (SLAM) problem." Thesis, KTH, Matematisk statistik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-212999.
Full textAbstract:
In this thesis, we explore novel solutions to the Simultaneous Localization and Mapping (SLAM) problem based on particle filtering and smoothing methods. In essence, the SLAM problem constitutes of two interdependent tasks: map building and tracking. Three solution methods utilizing different smoothing techniques are explored. The smoothing methods used are fixed lag smoothing (FLS), forward-only forward-filtering backward-smoothing (forward-only FFBSm) and the particle-based, rapid incremental smoother (PaRIS). In conjunction with these smoothing techniques the well-established Expectation-Maximization (EM) algorithm is used to produce maximum-likelihood estimates of the map. The three solution method are then evaluated and compared in a simulated setting.I detta examensarbete utforskas nya lösningar till Simultaneous Localization and Mapping (SLAM) problemet baserat på partikelfilter- och partikelglättnings-metoder. I sin grund består SLAM problemet av två av varandra beroende uppgifter: kartläggning och spårning. Tre lösningsmetoder som använder olika glättnings-metoder appliceras för att lösa dessa uppgifter. Dessa glättningsmetoder är fixed lag smoothing (FLS), forward-only forward-filtering backward-smoothing (forward-only FFBSm) och the particle-based, rapid incremental smoother (PaRIS). I samband med dessa glättningstekniker används den väletablerade Expectation-Maximization (EM) algoritmen för att skapa maximum-likelihood skattningar av kartan. De tre lösningsmetoderna utvärderas sedan och jämförs i en simulerad miljö.
17
Mitschele-Thiel, Andreas. "Die DSPL-Entwicklungsumgebung : Ein automatischer Ansatz zur Abbildung und effizienten Realisierung dedizierter Anwendungen auf parallele Systeme /." Düsseldorf : VDI Verlag, 1994. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=006538464&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.
Full text
18
McClure, Sarah A. "Using cognitive mapping to describe the family members experiences of living with a problem gambler." access full-text online access from Digital Dissertation Consortium, 2006. http://libweb.cityu.edu.hk/cgi-bin/er/db/ddcdiss.pl?1439658.
Full textAbstract:
Thesis (M.P.H.)--Southern Connecticut State University, 2006.Page(s) missing in number only; text follows. Page(s) were scanned as received. Adviser: Sandra Bulmer. Includes bibliographical references.
19
Rinke, Sebastian. "Analysis and Adaption of Graph Mapping Algorithms for Regular Graph Topologies." Master's thesis, Universitätsbibliothek Chemnitz, 2009. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200901453.
Full textAbstract:
The Message Passing Interface (MPI) standard defines virtual topologies that can be applied to systems
of cooperating processes. Among issues regarding a more convenient namespace this may be used to
optimize the placement of MPI processes in order to reduce communication time. That means, the
processes with their main communication paths represent a graph that has to be cost efficiently mapped
onto the graph representing the actual communication network. In this context, this work analyses
and compares state-of-the-art task mapping strategies with respect to running time and their quality
of solutions to the MPI mapping problem. In particular, the focus is on generic strategies that can
be used for arbitrary process/network topologies although, here, the topologies of interest are regular
ones, where the number of processes is greater than the number of processors in the underlying physical
network. Additionally, different measures of mapping quality are discussed and a close correspondence
between the most appropriate, the weighted edge cut, and program execution time is shown. In order
to investigate how mapping quality affects MPI program execution time, some mapping strategies have
been incorporated into Open MPI. Finally, benchmark results prove that optimized process-to-processor
mappings can improve program execution time by up to 60%, compared to the default mapping in many
MPI implementations (linear mapping). The findings in this work can serve as reference not only for MPI
implementors, but also for researchers investigating static process-to-processor mappings, in general.
20
Singprasong, Rachanee. "A framework for rapid problem assessment in healthcare delivery systems." Thesis, Brunel University, 2012. http://bura.brunel.ac.uk/handle/2438/7617.
Full textAbstract:
Problems in healthcare are difficult to comprehend due to complexity, involvement of multiple stakeholders in decision making and fragmented structure of delivery systems. Major Problem Structuring Methods (PSMs) have been used to aid problem understanding which, in principle, can provide greater clarity to strategic problems and engage diverse decision makers using transparent representation that capture differing perceptions of problems. In reality, PSMs can be difficult in accurately representing problems, limited in highlighting improvement opportunities due to non-intuitive visual representations and requirements for facilitators and stakeholders to be experts in tools used. This research aims to address this gap by developing a framework, taking into account characteristics of healthcare delivery systems, advantages and limitations of PSMs with an aim of providing accurate and holistic representation of delivery workflow, so as to promote problem understanding in a rapid manner. The framework, termed CARE, first establishes nature of problem and a commonly agreed problem statement along with an understanding of stakeholder involvement and operating regulations. It then sets specific guidelines for data collection, representation, verification and validation from stakeholders and provides methodology for data analysis which allows facilitator insight into possible flaws in workflow. A case study approach is used to test effectiveness of CARE across two different healthcare settings, each involving a different nature of problem. Implementation of CARE leads to improved participation and ownership amongst stakeholders, ease of facilitation during individual or multidisciplinary meetings, intuitive and informative representation of workflow, minimized time and effort for implementation and minimized dependencies on learning new tools and terminologies. A post mortem indicates the positive impact of CARE on services rendered to the patients, leading to an increase in patient satisfaction and workflow efficiencies. The research concludes by noting the contributions and lessons learnt from this research for healthcare practitioners and possible future work.
21
Gyöngy, Miklós. "Passive cavitation mapping for monitoring ultrasound therapy." Thesis, University of Oxford, 2010. http://ora.ox.ac.uk/objects/uuid:af6f3c5a-bec5-4378-a617-c89d2b16d95d.
Full textAbstract:
Cavitation is a phenomenon present during many ultrasound therapies, including the thermal ablation of malignant tissue using high intensity focused ultrasound (HIFU). Inertial cavitation, in particular, has been previously shown to result in increased heat deposition and to be associated with broadband noise emissions that can be readily monitored using a passive receiver without interference from the main ultrasound signal. The present work demonstrates how an array of passive receivers can be used to generate maps of cavitation distribution during HIFU exposure, uncovering a new potential method of monitoring HIFU treatment. Using a commercially available ultrasound system (z.one, Zonare, USA), pulse transmission can be switched off and data from 64 elements of an array can be simultaneously acquired to generate passive maps of acoustic source power. For the present work, a 38 mm aperture 5-10 MHz linear array was used, with the 64 elements chosen to span the entire aperture. Theory and simulations were used to show the spatial resolution of the system, the latter showing that the broadband nature of inertial cavitation makes passive maps robust to interference between cavitating bubbles. Passive source mapping was first applied to wire scatterers, demonstrating the ability of the system to resolve broadband sources. With the array transversely placed to the HIFU axis, high-resolution passive maps are generated, and emissions from several cavitating bubbles are resolved. The sensitivity of passive mapping during HIFU exposure is compared with that of an active cavitation detector following exposure. The array was then placed within a rectangular opening in the centre of the HIFU transducer, providing a geometric setup that could be used clinically to monitor HIFU treatment. Cavitation was instigated in continuous and disjoint regions in agar tissue mimicking gel, with the expected regions of cavitation validating the passive maps obtained. Finally, passive maps were generated for samples of ox liver exposed to HIFU. The onset of inertial cavitation as detected by the passive mapping approach was found to provide a much more robust indicator of lesioning than post-exposure B-mode hyperecho, which is in current clinical use. Passive maps based on the broadband component of the received signal were able to localize the lesions both transversely and axially, however cavitation is generally indicated 5 mm prefocal to the lesions. Further work is needed to establish the source of this discrepancy. It is believed that with use of an appropriately designed cavitation detection array, passive mapping will represent a major advance in ultrasound-guided HIFU therapy. Not only can it be utilized in real-time during HIFU exposure, without the need to turn the therapeutic ultrasound field off, but it has also been shown in the context of the present work to provide a strong indicator of successful lesioning and high signal-to-noise compared to conventional B-mode ultrasound techniques.
22
Ku, Wendy April. "Using concept maps to explore the conceptual knowledge of technology students an exploratory study /." Columbus, Ohio : Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1193763566.
Full text
23
Altun, Halis. "Evaluation of neural learning in a MLP NN for an acoustic-to-articulatory mapping problem using different training pattern vector characteristics." Thesis, University of Nottingham, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.263405.
Full text
24
Atha-Weldon, Cindy Shira Simcha. "Thought team use of a perspective-taking strategy to enhance personal problem solving while thinking, writing, or mapping /." Fort Worth, Tex. : Texas Christian University, 2006. http://etd.tcu.edu/etdfiles/available/etd-05092006-161318/unrestricted/atha-weldon.pdf.
Full text
25
Sanguino, Diana Carolina. "Using Contingency Mapping to Decrease Problem Behavior and Increase Social Communication Skills in Children with Autism." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5120.
Full textAbstract:
Abstract
Social communication skills play a central role in the developmental outcomes for young children with autism. Due to deficits in social communication skills, many young children with autism develop problem behavior. Providing these children with the right tools to communicate properly may decrease their problem behavior. This study examines the impact of contingency mapping intervention on problem behavior and functional communication skills in three children with autism, using a multiple-baseline design. Before implementation of contingency mapping, verbal contingency was implemented in the first phase of intervention, which was associated with minimal increases in communication skills and decreases in problem behavior across children. Further increases in communication skills and decreases in problem behavior in the contingency mapping condition indicate that the use of the contingency map as a visual aid may be an effective way to augment the effects of contingency instruction.
26
Ipolitova, Ksenia, and Henna Karvinen. "Evaluating options in design process : Mapping the historical overview of prototyping tools from the 1930's to 2020's at Saab." Thesis, Linköpings universitet, Företagsekonomi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-139165.
Full text
27
Brennan, Susan Catherine. "Cinematic Adaptation and the Problem of Citizenship: Mapping Women’s Diasporic Authorship in a Post-9/11 World." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1274451713.
Full text
28
Maier, Konradin, and Volker Stix. "A Semi-Automated Approach for Structuring Multi Criteria Decision Problems." Elsevier, 2013. http://dx.doi.org/10.1016/j.ejor.2012.10.018.
Full textAbstract:
This article seeks to enhance multi criteria decision making by providing a scientic approach for decomposing and structuring decision problems. We propose a process, based on concept mapping, which integrates group creativity techniques, card sorting procedures, quantitative data analysis and algorithmic automatization to construct meaningful and complete hierarchies of criteria. The
algorithmic aspect is covered by a newly proposed recursive cluster algorithm, which automatically generates hierarchies from card sorting data. Based on comparison with another basic algorithm and empirical engineered and real-case test data, we validate that our process efficiently produces reasonable hierarchies of descriptive elements like goal- or problem-criteria. (authors' abstract)
29
Solomon, Tracy L. "Early development of strategies for mapping symbol-referent relations : what do young children understand about scale models?" Thesis, University of St Andrews, 2001. http://hdl.handle.net/10023/13142.
Full textAbstract:
The research reported here investigated the nature of young children's understanding of a novel symbol-a scale model. Children witnessed the hiding of a small toy in a scale model of a room and were then required to search for an analogous larger toy that had been surreptitiously hidden in the actual room. At issue was whether children succeed by attending to the target location (object strategy), to the spatial location of the target location (spatial strategy), or to both types of information. It has been suggested that at three years of age (the age at which children first succeed on the task) children succeed by recognizing the correspondence between analogous objects in the two spaces (Bence & Presson, 1997; Blades & Cooke, 1994; Perner, 1991; Lillard, 1993) but that an understanding of the model as a whole as a representation of the room necessitates also attending to the spatial relations between the objects (Perner, 1991; Lillard, 1993). In five Experiments, children participated in versions of the model task that varied in the type of information (object and/or spatial) available to solve the task. The results revealed that although, in general, children rely primarily on the identity of the individual objects to find the hidden toy, the spatial relations between the objects may also influence task success. Furthermore, there was strong evidence of individual differences in children's strategies which appeared to be linked to sex, with girls attending primarily to the identity of the objects and boys demonstrating a fledgling ability to approach the model spatially. Some children also appeared to label the target object but the labeling strategy could not account for girls' tendency to attend to the objects more than boys. It is suggested that characterizations of an abrupt shift between three and four years of age in the ability to interpret the model as a whole as a representation of the room may be misleading. There may be multiple developmental routes to the gradual acquisition of an explicit understanding of a scale model as a symbol for the space it is intended to represent.
30
Lera, Castro Isaac. "Ontology Matching based On Class Context: to solve interoperability problem at Semantic Web." Doctoral thesis, Universitat de les Illes Balears, 2012. http://hdl.handle.net/10803/84074.
Full textAbstract:
When we look at the amount of resources to convert formats to other formats, that is to say, to make information systems useful, it is the time when we realise that our communication model is inefficient. The transformation of information, as well as the transformation of energy, remains inefficient for the efficiency of the converters. In this work, we propose a new way to ``convert'' information, we propose a mapping algorithm of semantic information based on the context of the information in order to redefine the framework where this paradigm merges with multiple techniques. Our main goal is to offer a new view where we can make further progress and, ultimately, streamline and minimize the communication chain in integration process
31
Gharabaghi, Sara. "Quantitative Susceptibility Mapping (QSM) Reconstruction from MRI Phase Data." Wright State University / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=wright1610018553822445.
Full text
32
Haupt, Friederike Sophie. "The component mapping problem: an investigation of grammatical function reanalysis in differing experimental contexts using event related brain potentials /." Leipzig : Max Planck Institute for Human Cognitive and Brain Sciences, 2008. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=017029143&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.
Full text
33
Koryciński, Martin. "Optimalizace nabídkového procesu." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2010. http://www.nusl.cz/ntk/nusl-229233.
Full textAbstract:
This master’s thesis concerns optimization of quotation process. It describes mapping of value stream by VSM Method (value stream mapping) in practical way in order to minimize cost. Further on it describes three points of view method when surveying and modifying process. It analyses process on three levels and describes suitable solution which makes process smoother and more effective. At the conclusion of this diploma project belongs evaluation of realised solutions and measures that need to be taken in future.
34
Cortes, Elisabet Eir. "Mapping articulatory parameters on formant patterns : From articulations to acoustics non-stop." Thesis, Stockholms universitet, Avdelningen för fonetik, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-43427.
Full textAbstract:
The traditional way of estimating the formant frequencies from articulatory data presupposes knowledge of how the vocal tract cross-sectional area varies for a given articulatory shape (Fant 1960/1970). Accordingly, in order to derive the formant pattern of a given articulation, the three-dimensional shape of the vocal tract (VT) needs to be known. In the past cross-sectional areas have typically been derived by means of ‘d-to-A rules’ that use the mid-sagittal cross-distance d at each point along the VT to produce a corresponding cross-sectional area A. X-ray and MRI data have been used to calibrate such rules (Heinz & Stevens 1964, Sundberg et al. 1987, Ericsdotter 2005). Although this procedure has produced many useful results it is time consuming and laborious. It is speaker-specific. It presupposes access to information on the three-dimensional shape of the VT, which is not experimentally readily accessible. Such observations raise the question whether sufficiently accurate alternative approaches can be developed. Is it possible to go straight from articulatory data to formant frequencies without having to construct a cross-sectional area function? If such methods could be developed it would have many uses both in phonetics and practical applications. This paper reports an attempt to map the time variations of selected articulatory parameters from X-ray profiles directly on the formant tracks using multiple regression analysis. Preliminary results for F1 indicate that multiple regression analysis can indeed be useful for making such predictions. The prospects of extending the present analyses to other formants are discussed.
35
Smaller, J. T. "Nuclear rivalry and bounded vision : An investigation of conflict resolution techniques and a development of cognitive mapping in relation to the problem of disarmament." Thesis, University of Bradford, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.381063.
Full text
36
Malla, Tika Kumari. "Case Studies to Learn Human Mapping Strategies in a Variety of Coarse-Grained Reconfigurable Architectures." Thesis, University of North Texas, 2017. https://digital.library.unt.edu/ark:/67531/metadc984195/.
Full textAbstract:
Computer hardware and algorithm design have seen significant progress over the years. It is also seen that there are several domains in which humans are more efficient than computers. For example in image recognition, image tagging, natural language understanding and processing, humans often find complicated algorithms quite easy to grasp. This thesis presents the different case studies to learn human mapping strategy to solve the mapping problem in the area of coarse-grained reconfigurable architectures (CGRAs). To achieve optimum level performance and consume less energy in CGRAs, place and route problem has always been a major concern. Making use of human characteristics can be helpful in problems as such, through pattern recognition and experience. Therefore to conduct the case studies a computer mapping game called UNTANGLED was analyzed as a medium to convey insights of human mapping strategies in a variety of architectures. The purpose of this research was to learn from humans so that we can come up with better algorithms to outperform the existing algorithms. We observed how human strategies vary as we present them with different architectures, different architectures with constraints, different visualization as well as how the quality of solution changes with experience. In this work all the case studies obtained from exploiting human strategies provide useful feedback that can improve upon existing algorithms. These insights can be adapted to find the best architectural solution for a particular domain and for future research directions for mapping onto mesh-and- stripe based CGRAs.
37
Nicola, Jérémy. "Robust, precise and reliable simultaneous localization and mapping for and underwater robot. Comparison and combination of probabilistic and set-membership methods for the SLAM problem." Thesis, Brest, 2017. http://www.theses.fr/2017BRES0066/document.
Full textAbstract:
Dans cette thèse on s'intéresse au problème de la localisation d'un robot sous-marin et de la cartographie en simultané d'un jeu de balises acoustiques installées sur le fond marin, en utilisant un distance-mètre acoustique et une centrale inertielle. Nous nous focalisons sur les deux approches principales utilisées pour résoudre ce type de problème: le filtrage de Kalman et le filtrage ensembliste basé sur l'analyse par intervalles. Le filtre de Kalman est optimal quand les équations d'état du robot sont linéaires et les bruits sont additifs, Gaussiens. Le filtrage par intervalles ne modélise pas les incertitudes dans un cadre probabiliste, et ne fait qu'une seule hypothèse sur leur nature: elles sont bornées. De plus, l'approche utilisant les intervalles permet la propagation rigoureuse des incertitudes, même quand les équations sont non linéaires. Cela résulte en une estimation hautement fiable, au prix d'une précision réduite. Nous montrons que dans un contexte sous-marin, quand le robot est équipé avec une centrale inertielle de haute précision, une partie des équations du SLAM peut raisonnablement être considérée comme linéaire avec un bruit Gaussien additif, en faisant le terrain de jeu idéal d'un filtre de Kalman. De l'autre côté, les équations liées aux observations du distance-mètre acoustique sont bien plus problématiques: le système n'est pas observable, les équations sont non linéaires, et les outliers sont fréquents. Ces conditions sont idéales pour une approche à erreur bornées basée sur l'analyse par intervalles. En prenant avantage des propriétés des bruits Gaussiens, cette thèse réconcilie le traitement probabiliste et ensembliste des incertitudes pour les systèmes aussi bien linéaires que non linéaires sujets à des bruits Gaussiens additifs. En raisonnant de manière géométrique, nous sommes capables d'exprimer la partie des équations du filtre de Kalman modélisant la dynamique du véhicule dans un cadre ensembliste. De la même manière, un traitement plus rigoureux et précis des incertitudes est décrit pour la partie des équations du filtre de Kalman liée aux mesures de distances. Ces outils peuvent ensuite être combinés pour obtenir un algorithme de SLAM qui est fiable, précis et robuste. Certaines des méthodes développées dans cette thèse sont illustrées sur des données réellesIn this thesis, we work on the problem of simultaneously localizing an underwater robot while mapping a set of acoustic beacons lying on the seafloor, using an acoustic range-meter and an inertial navigation system. We focus on the two main approaches classically used to solve this type of problem: Kalman filtering and set-membership filtering using interval analysis. The Kalman filter is optimal when the state equations of the robot are linear, and the noises are additive, white and Gaussian. The interval-based filter do not model uncertainties in a probabilistic framework, and makes only one assumption about their nature: they are bounded. Moreover, the interval-based approach allows to rigorously propagate the uncertainties, even when the equations are non-linear. This results in a high reliability in the set estimate, at the cost of a reduced precision.We show that in a subsea context, when the robot is equipped with a high precision inertial navigation system, a part of the SLAM equations can reasonably be seen as linear with additive Gaussian noise, making it the ideal playground of a Kalman filter. On the other hand, the equations related to the acoustic range-meter are much more problematic: the system is not observable, the equations are non-linear, and the outliers are frequent. These conditions are ideal for a set-based approach using interval analysis.By taking advantage of the properties of Gaussian noises, this thesis reconciles the probabilistic and set-membership processing of uncertainties for both linear and non-linear systems with additive Gaussian noises. By reasoning geometrically, we are able to express the part of the Kalman filter equations linked to the dynamics of the vehicle in a set-membership context. In the same way, a more rigorous and precise treatment of uncertainties is described for the part of the Kalman filter linked to the range-measurements. These two tools can then be combined to obtain a SLAM algorithm that is reliable, precise and robust. Some of the methods developed during this thesis are demonstrated on real data
38
Imbert, Michel. "Combinatoire des revêtements : cellulation des espaces de Hurwitz." Université Joseph Fourier (Grenoble), 1998. http://www.theses.fr/1998GRE10228.
Full textAbstract:
L'objet de cette these est l'etude combinatoire des revetements entre surfaces de riemann et de leurs espaces modulaires : les espaces de hurwitz. Les methodes utilisees sont graphiques : nous utilisons largement le concept de graphe epais. Nous donnons un algorithme de calcul des lacets d'homologie d'un tel graphe. Nous montrons le theoreme d'existence de riemann au niveau des graphes epais. Nous detaillons le processus, du a j. L. Harer et m. Kontsevich, realisant un graphe epais a n faces muni de longueurs d'aretes en une surface de riemann compacte privee de n piqures. Ce processus, bijectif par le theoreme de strebel, mene a une decomposition cellulaire connue et fondamentale des espaces de modules de surfaces de riemann compactes de genre fixe et privees de n piqures. Nous sommes alors en mesure de preciser la variation de la structure complexe en fonction des longueurs d'aretes (ce qui donne la continuite du processus), et de generaliser le processus aux revetements de surfaces de riemann compactes. Cela conduit a la decomposition cellulaire des espaces de hurwitz. Nous etudions un exemple ou l'espace de hurwitz s'identifie a une courbe modulaire. L'etude des revetements cycliques des tores permet de relier l'espace de hurwitz correspondant a des espaces de modules definis par e. Witten dans le cadre d'une conjecture generalisant celle demontree par m. Kontsevich. L'extension des resultats aux compactifications des espaces de modules et de hurwitz s'appuie sur le phenomene de retraction de boucles d'un graphe epais ne bordant pas des faces.
39
Tsiminaki, Vagia. "Appearance Modelling for 4D Representations." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM083/document.
Full textAbstract:
Ces dernières années ont vu l'émergence de la capture des modèles spatio-temporels (modélisation 4D) à partir d'images réelles, avec de nombreuses applications dans les domaines de post-production pour le cinéma, la science des sports, les études sociales, le divertissement, l'industrie de la publicité. A partir de plusieurs séquences vidéos, enregistrées à partir de points de vue variés, la modélisation 4D à partir de vidéos utilise des modèles spatio-temporels pour extraire des informations sur la géométrie et l'apparence de scènes réelles, permettant de les enregistrer et de les reproduire. Cette thèse traite du problème de la modélisation d'apparence.La disponibilité des donnée d'images offre de grands potentiels pour les reconstructions haute fidélité, mais nécessite des méthodes plus élaborées. En outre, les applications du monde réel nécessitent des rendus rapides et des flux réduits de données. Mais l'obtention de représentations d'apparence compactes, indépendantes du point de vue, et à grande résolution est toujours un problème ouvert.Pour obtenir ces caractéristiques, nous exprimons l'information visuelle de l'objet capturé dans un espace de texture commun. Les observations multi-caméra sont considérées comme des réalisations de l'apparence commune et un modèle linéaire est introduit pour matérialiser cette relation. Le modèle linéaire d'apparence proposé permet une première étude du problème de l'estimation d'apparence dans le cas multi-vue et expose les sources variées de bruit et les limitations intrinsèques du modèle.Basé sur ces observations, et afin d'exploiter l'information visuelle de la manière la plus efficace, nous améliorons la méthode en y intégrant un modèle de super-résolution 2D. Le modèle simule le procédé de capture d'image avec une concaténation d'opérations linéaires, générant les observation d'image des différents points de vue et permettant d'exploiter la redondance. Le problème de super-résolution multi-vue résultant est résolu par inférence bayésienne et une représentation haute-résolution d'apparence est fournie permettant de reproduire la texture de l'objet capturé avec grand détail.La composante temporelle est intégrée par la suite au modèle pour permettre d'y recouper l'information visuelle commune sous-jacente. En considérant des petits intervalles de temps ou l'apparence de l'objet ne change pas drastiquement, une représentation super-résolue cohérente temporellement est introduite. Elle explique l'ensemble des images de l'objet capturé dans cet intervalle. Grâce à l'inférence statistique Bayésienne, l'apparence construite permet des rendus avec une grande précision à partir de point de vue nouveau et à des instants différent dans l'intervalle de temps prédéfini.Pour améliorer l'estimation d'apparence d'avantage, l'inter-dépendance de la géométrie et de la photométrie est étudiée et exploitée. Les modélisations de la géométrie et de l'apparence sont unifiées dans le framework de super-résolution permettant une amélioration géométrique globale, ce qui donne à son tour une amélioration importante de l'apparence.Finalement pour encoder la variabilité de l'apparence dynamique des objets subissant plusieurs mouvements, une représentation indépendante du point de vue s'appuyant sur l'analyse en composantes principales est introduite. Cette représentation décompose la variabilité sous-jacente d'apparence en texture propres et déformations propres. La méthode proposée permet de reproduire les apparences de manière précise avec des représentation compactes. Il permet également l'interpolation et la complétion des apparences.Cette étude montre que la représentation compacte, indépendante du point de vue, et super-résolue proposée permet de confronter les nouvelles réalités du problème de modélisation d'apparence. Elle représente un contribution vers des représentations d'apparence 4D haute-qualité et ouvre de nouvelles directions de recherche dans ce domaineCapturing spatio-temporal models (4D modelling) from real world imagery has received a growing interest during the last years urged by the increasing demands of real-world applications and the tremendous amount of easily accessible image data. The general objective is to produce realistic representations of the world from captured video sequences. Although geometric modelling has already reached a high level of maturity, the appearance aspect has not been fully explored. The current thesis addresses the problem of appearance modelling for realistic spatio-temporal representations. We propose a view-independent, high resolution appearance representation that successfully encodes the high visual variability of objects under various movements.First, we introduce a common appearance space to express all the available visual information from the captured images. In this space we define the representation of the global appearance of the subject. We then introduce a linear image formation model to simulate the capturing process and to express the multi-camera observations as different realizations of the common appearance. Identifying that the principle of Super-Resolution technique governs also our multi-view scenario, we extend the image generative model to accommodate it. In our work, we use Bayesian inference to solve for the super-resolved common appearance.Second, we propose a temporally coherent appearance representation. We extend the image formation model to generateimages of the subject captured in a small time interval. Our starting point is the observation thatthe appearance of the subject does not change dramatically in a predefined small time interval and the visual information from each view and each frame corresponds to the same appearance representation.We use Bayesian inference to exploit the visual redundant as well as the hidden non-redundant information across time, in order to obtain an appearance representation with fine details.Third, we leverage the interdependency of geometry and photometry and use it toestimate appearance and geometry in a joint manner. We show that by jointly estimating both, we are able to enhance the geometry globally that in turn leads to a significant appearance improvement.Finally, to further encode the dynamic appearance variability of objects that undergo several movements, we cast the appearance modelling as a dimensionality reduction problem. We propose a view-independent representation which builds on PCA and decomposesthe underlying appearance variability into Eigen textures and Eigen warps. The proposed framework is shown to accurately reproduce appearances with compact representations and to resolve appearance interpolation and completion tasks
40
Zhu, Lei. "On Visualizing Branched Surface: an Angle/Area Preserving Approach." Diss., Available online, Georgia Institute of Technology, 2004, 2004. http://etd.gatech.edu/theses/available/etd-09142004-114941/.
Full textAbstract:
Thesis (Ph. D.)--Biomedical Engineering, Georgia Institute of Technology, 2006.Anthony J. Yezzi, Committee Member ; James Gruden, Committee Member ; Allen Tannenbaum, Committee Chair ; May D. Wang, Committee Member ; Oskar Skrinjar, Committee Member. Vita. Includes bibliographical references.
41
Mumey, Brendan Marshall. "Some computational problems from genomic mapping /." Thesis, Connect to this title online; UW restricted, 1997. http://hdl.handle.net/1773/6932.
Full text
42
Kasikara, Gulin. "Progresses In Parallel Random Number Generators." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606651/index.pdf.
Full textAbstract:
Monte Carlo simulations are embarrassingly parallel in nature, so having a parallel and efficient random number generator becomes crucial. To have a parallel generator with uncorrelated processors, parallelization methods are implemented together with a binary tree mapping. Although, this method has considerable advantages, because of the constraints arising from the binary tree structure, a situation defined as problem of falling off the tree occurs. In this thesis, a new spawning method that is based on binary tree traversal and new spawn processor appointment is proposed to use when falling off the tree problem is encountered. With this method, it is seen that, spawning operation becomes more costly but the independency of parallel processors is guaranteed. In Monte Carlo simulations, random number generation time should be unperceivable when compared with the execution time of the whole simulation. That is whylinear congruential generators with Mersenne prime moduli are used. In highly branching Monte Carlo simulations, cost of parameterization also gains importance and it becomes reasonable to consider other types of primes or other parallelization methods that provide different balance between parameterization cost and random number generation cost. With this idea in mind, in this thesis, for improving performance of linear congruential generators, two approaches are proposed. First one is using Sophie-Germain primes as moduli and second one is using a hybrid method combining both parameterization and splitting techniques. Performance consequences of Sophie-Germain primes over Mersenne primes are shown through graphics. It is observed that for some cases proposed approaches have better performance consequences.
43
Williams, Stefan Bernard. "Efficient Solutions to Autonomous Mapping and Navigation Problems." University of Sydney. Aerospace, Mechanical and Mechatronic Engineering, 2002. http://hdl.handle.net/2123/809.
Full textAbstract:
This thesis deals with the Simultaneous Localisation and Mapping algorithm as it pertains to the deployment of mobile systems in unknown environments. Simultaneous Localisation and Mapping (SLAM) as defined in this thesis is the process of concurrently building up a map of the environment and using this map to obtain improved estimates of the location of the vehicle. In essence, the vehicle relies on its ability to extract useful navigation information from the data returned by its sensors. The vehicle typically starts at an unknown location with no a priori knowledge of landmark locations. From relative observations of landmarks, it simultaneously computes an estimate of vehicle location and an estimate of landmark locations. While continuing in motion, the vehicle builds a complete map of landmarks and uses these to provide continuous estimates of the vehicle location. The potential for this type of navigation system for autonomous systems operating in unknown environments is enormous. One significant obstacle on the road to the implementation and deployment of large scale SLAM algorithms is the computational effort required to maintain the correlation information between features in the map and between the features and the vehicle. Performing the update of the covariance matrix is of O(n�) for a straightforward implementation of the Kalman Filter. In the case of the SLAM algorithm, this complexity can be reduced to O(n�) given the sparse nature of typical observations. Even so, this implies that the computational effort will grow with the square of the number of features maintained in the map. For maps containing more than a few tens of features, this computational burden will quickly make the update intractable - especially if the observation rates are high. An effective map-management technique is therefore required in order to help manage this complexity. The major contributions of this thesis arise from the formulation of a new approach to the mapping of terrain features that provides improved computational efficiency in the SLAM algorithm. Rather than incorporating every observation directly into the global map of the environment, the Constrained Local Submap Filter (CLSF) relies on creating an independent, local submap of the features in the immediate vicinity of the vehicle. This local submap is then periodically fused into the global map of the environment. This representation is shown to reduce the computational complexity of maintaining the global map estimates as well as improving the data association process by allowing the association decisions to be deferred until an improved local picture of the environment is available. This approach also lends itself well to three natural extensions to the representation that are also outlined in the thesis. These include the prospect of deploying multi-vehicle SLAM, the Constrained Relative Submap Filter and a novel feature initialisation technique. Results of this work are presented both in simulation and using real data collected during deployment of a submersible vehicle equipped with scanning sonar.
44
Williams, Stefan Bernard. "Efficient solutions to autonomous mapping and navigation problems." Connect to full text, 2001. http://hdl.handle.net/2123/809.
Full textAbstract:
Thesis (Ph. D.)--University of Sydney, 2002.Title from title screen (viewed Apr. 24, 2008). Submitted in fulfilment of the requirements for the degree of Doctor of Philosophy to the Australian Centre for Field Robotics, Dept. of Mechanical and Mechatronic Engineering, Faculty of Engineering. Degree awarded 2002; thesis submitted 2001. Includes bibliography. Also available in print form.
45
Patias, Petros Georgios. "Application of random field theory in mapping problems /." The Ohio State University, 1987. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487332636477491.
Full text
46
Heaton, Michelle G. "A Pedagogy of Hope: Levers of Change in Transformative Place-based Learning Systems." Antioch University / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=antioch1588265231971143.
Full text
47
Djordjevic, Ivana. "Mapping medieval translation : methodological problems and a case study." Thesis, McGill University, 2002. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=82856.
Full textAbstract:
The extent to which translation moulded Middle English romance as an emerging genre remains largely unexamined. In this dissertation I identify the principal methodological difficulties that have prevented scholars from giving due attention to this problem, and offer a case study in which I look at how translational procedures shaped the romance of Sir Beves of Hampton, a translation of the Anglo-Norman Boeve de Haumtone .Having outlined the practical difficulties posed by the intricate textual tradition of Boeve and Beves, the multilingualism of medieval England, and the scarcity of concrete evidence regarding the audience for Middle English romance, I focus on methodological issues: the inability of equivalence-based definitions of translation to accommodate medieval translation practice, the futility of attempts to demarcate translation from adaptation, and the difficulty of integrating different textual levels in the study of translations.
In the first two analytical chapters of the dissertation I concentrate on those aspects of Beves that can best highlight the importance of translation processes in the constitution of the genre. I begin by examining the way in which the translator dealt with the most important translational constraints, some of which, like language, were beyond his control, while others, such as versification, were partly self-imposed. I then proceed to study the workings of the so-called laws of translation (explicitation, simplification, and repertorization) in the process whereby Boeve became Beves. The analyses carried out in these two chapters allow me to contest the received opinion according to which the author of Beves treated his original very freely. I show that, on the contrary, the distinctive features of the Middle English text result from a constant productive tension between source and target.
My study ends with an analysis of what happens when the translator's impulse to be faithful to his source is frustrated by the inaccessibility of the socio-historical context of the original. I examine the most closely translated sections of the poem to show how unrecognized topical references are flattened into literary cliches, which bring into the text their own generic connotations and disassemble some of the carefully constructed thematic parallels and analogies of the Anglo-Norman romance.
48
Michlowitz, Jason Lawrence. "A methodology for mapping programming languages to programming problems /." View online, 2006. http://ecommons.txstate.edu/cscitad/2.
Full text
49
Stephenson, Paul R. "Evaluation and solutions of key problems in Fourier fringe analysis." Thesis, Liverpool John Moores University, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.262106.
Full text
50
Ravon, Gwladys. "Problèmes inverses pour la cartographie optique cardiaque." Thesis, Bordeaux, 2015. http://www.theses.fr/2015BORD0118/document.
Full textAbstract:
Depuis les années 80 la cartographie optique est devenu un outil important pour l'étude et la compréhension des arythmies cardiaques. Cette expérience permet la visualisation de flux de fluorescence à la surface du tissu ; fluorescence qui est directement liée au potentiel transmembranaire. Dans les observations en surface se cachent des informations sur la distribution en trois dimensions de ce potentiel. Nous souhaitons exploiter ces informations surfaciques afin de reconstruire le front de dépolarisation dans l'épaisseur. Pour cela nous avons développé une méthode basée sur la résolution d'un problème inverse. Le modèle direct est composée de deux équations de diffusion et d'une paramétrisation du front de dépolarisation. La résolution du problème inverse permet l'identification des caractéristiques du front. La méthode a été testée sur des données in silico avec différentes manières de caractériser le front (sphère qui croît au cours du temps, équation eikonale). Les résultats obtenus sont très satisfaisants et comparés à une méthode développée par Khait et al. [1]. Le passage à l'étude sur données expérimentales a mis en évidence un problème au niveau du modèle. Nous détaillons ici les pistes explorées pour améliorer le modèle : illumination constante, paramètres optiques, précision de l'approximation de diffusion. Plusieurs problèmes inverses sont considérés dans ce manuscrit, ce qui implique plusieurs fonctionnelles à minimiser et plusieurs gradients associés. Pour chaque cas, le calcul du gradient est explicité, le plus souvent par la méthode de l'adjoint. La méthode développée a aussi été appliquée à des données autres que la cartographie optique cardiaqueSince the 80's optical mapping has become an important tool for the study and the understanding of cardiac arythmias. This experiment allows the visualization of fluorescence fluxes through tissue surface. The fluorescence is directly related to the transmembrane potential. Information about its three-dimension distribution is hidden in the data on the surfaces. Our aim is to exploit this surface measurements to reconstruct the depolarization front in the thickness. For that purpose we developed a method based on the resolution of an inverse problem. The forward problem is made of two diffusion equations and the parametrization of the wavefront. The inverse problem resolution enables the identification of the front characteristics. The method has been tested on in silico data with different ways to parameter the front (expanding sphere, eikonal equation). The obtained results are very satisfying, and compared to a method derived by Khait et al. [1]. Moving to experimental data put in light an incoherence in the model. We detail the possible causes we explored to improve the model : constant illumination, optical parameters, accuracy of the diffusion approximation. Several inverse problems are considered in this manuscript, that involves several cost functions and associated gradients. For each case, the calculation of the gradient is explicit, often with the gradient method. The presented method was also applied on data other than cardiac optical mapping