Dissertations / Theses on the topic 'Least Pth'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 45 dissertations / theses for your research on the topic 'Least Pth.'
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.
Jacmenovic, Dennis, and dennis_jacman@yahoo com au. "Optimisation of Active Microstrip Patch Antennas." RMIT University. Electrical and Computer Engineering, 2004. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20060307.144507.
Full textGarcia, Ivan. "Solving the weighted region least cost path problem using transputers." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/27274.
Full textLin, Tongling. "Path probability and an extension of least action principle to random motion." Phd thesis, Université du Maine, 2013. http://tel.archives-ouvertes.fr/tel-00795600.
Full textMartínez, Ruiz Alba. "Patent value models: partial least squares path modelling with mode C and few indicators." Doctoral thesis, Universitat Politècnica de Catalunya, 2011. http://hdl.handle.net/10803/116489.
Full textDos objetivos general fueron planteados en esta tesis. Primero, establacer un modelo PLS para el valor de las patentes e investigar las relaciones de causalidad entre las variables que determinan el valor de las patentes. Segundo, investigar el desempeño del procedimiento Partial Least Squares (PLS) Path Modelling con Modo C en el contexto de los modelos de valor de las patentes. La tesis es organizada en 10 capítulos. El Capítulo 1 presenta una introducción a la tesis que incluye los objetivos, el alcance de la investigación y la estructura del documento. El Capítulo 2 entrega una presentación general de los diferentes enfoques para valoración de patentes desde una perspectiva del cambio tecnológico. También se entregan las definiciones necesarias relacionadas con los documentos e indicadores de patentes. El Capítulo 3 describe la muestra de patentes usada en esta investigación. Se presentan los criterios utilizados para recuperar los datos, el procedimiento seguido para calcular los indicadores de patentes y la descripción estadística de la muestra. El Capítulo 4 provee una introducción a los modelos de ecuaciones estructurales (SEMs) incluyendo orígenes, antecedentes básicos y desarrollos recientes. Además se entregan los lineamientos para la especificación de los modelos y el proceso de modelamiento para SEMs. Este capítulo discute con especial énfasis la determinación de la naturaleza reflectiva o formativa de los modelos de medida. El Capítulo 5 presenta los principales algoritmos PLS: NIPALS, Regresión PLS y PLS Path Modelling. Se presentan dos implementaciones de PLS Path Modelling: los procedimientos de Lohmöller y Wold. Adicionalmente, se analyzan resultados previos relacionados con: la sensibilidad del procedimiento al valor inicial de los vectores de pesos y el esquema de ponderación, y las propiedades del algoritmo, tales como consistencia, consistencia “at large” y convergencia. También brevemente se revisan algunas extensiones del procedimiento y su relación con otros métodos. El capítulo termina describiendo las técnicas de validación. El Capítulo 6 provee evidencia acerca de la exactitud y precisión con que PLS Path Modelling con Modo C recupera valores verdaderos en SEMs con pocos indicadores por constructo. Simulaciones Monte Carlo y experimentos computacionales son llevados a cabo para estudiar el rendimiento del algoritmo. El Capítulo 7 trata la formulación y estimación de los modelos de valoración de patentes. Esto comprende la identificación y definición de las variables observables y no observables, la determinación de los bloques de variables manifiestas y las relaciones estructurales, la especificación de los modelos de primer y segundo orden del valor de las patentes y la estimación de los mismos con PLS Path Modelling. En el Capítulo 8, la evolución del valor de las patentes a través del tiempo es investigado usando SEMs longitudinales. Dos set-ups son explorados. El primer modelo longitudinal considera variables manifiestas dependientes del tiempo y el segundo incluye variables latentes dependientes del tiempo. Los SEMs son estimados usando PLS Path Modelling. En el Capítulo 9, el procedimiento Two-Step PLS Path Modelling con Modo C (TsPLS) es implementado para estudiar los efectos no lineales y de interacción entre constructos formativos. Simulaciones Monte Carlo son llevadas a cabo para generar datos y determinar la exactitud y precisión con que este enfoque recupera valores verdaderos. Este capítulo incluye una aplicación del procedimiento a los modelos de patentes. Finalmente, el Capítulo 10 provee un resumen de las conclusiones y lineamientos para futuras investigaciones. La principal contribución de esta tesis es proponer modelos PLS para el valor de las patentes, y alrededor de este objetivo, nosotros hemos también contribuido en dos áreas principales: Contribuciones en el área del Cambio Tecnológico comprenden: (1) Evidencia empírica del rol del stock de conocimiento, el alcance tecnológico y el alcance internacional como determinantes del valor de las patentes y la utilidad tecnológica. Un patrón estable de coeficientes de trayectoria fue encontrado al estimar los modelos con muestras en diferentes periodos de tiempo. (2) Conceptualizar el valor de las patentes en un valor potencial y uno reconocido. También proveer evidencia acerca de que el valor potencial es pequeño al compararlo con el valor que las patentes adquieren con posterioridad. (3) Evidencia acerca de la importancia de considerar la naturaleza longitudinal de los indicatores en el problema de valorización de patentes, especialmente de las citas recibidas, el indicador de valor más utilizado. (4) Introducir una perspectiva multidimensional en el problema de valoración de patentes. Este nuevo enfoque puede ofrecer un entendimiento robusto de las diferentes variables que determinar el valor de las patentes. Contribuciones en el área del PLS PLS Path Modelling comprenden: (5) Evidencia empírica acerca del desempeño de PLS Path Modelling con Modo C. Apropiadamente implemetado, el procedimiento puede adecuadamente capturar algunas de las complejas relaciones dinámicas en los modelos. Nuestra investigación muestra que PLS Path Modelling con Modo C se comporta de acuerdo al marco teórico establecido para los procedimientos PLS y los modelos PLS (Wold, 1982; Krämer, 2006; Hanafi, 2007; Dijkstra, 2010). Es decir, (a) las estimaciones PLS estan siempre sesgadas, (b) las relaciones internas son subestimadas, (c) las relaciones externas son sobrestimadas, (d) el Modo A carece de la propiedad de convergencia monótona, (3) el Modo B tiene la propiedad de convergencia monótona. (6) Evidencia empírica acerca de la convergencia “at large” de PLS Path Modelling con Modo A. (7) Evidencia empírica para los modelos formativos con pocos indicadores (8) Evidencia empírica del desempeño del procedimiento Two-Step PLS Path Modelling con Modo C para estimar efectos no lineales y de interacción entre constructos formativos.
Poudel, Om Prakash. "Identification of barriers and least cost paths for autonomous vehicle navigation using airborne LIDAR data." Thesis, Virginia Tech, 2007. http://hdl.handle.net/10919/43304.
Full textMaster of Science
Ekin, Cengiz. "Efficient grid based techniques for solving the weighted region least cost path problem on multicomputers." Thesis, Monterey, California. Naval Postgraduate School, 1992. http://hdl.handle.net/10945/23654.
Full textThis thesis explores the possibilities of developing fast grid parallel algorithms to solve the Weighted Region Least Cost Path problem. Two complimentary steps have been undertaken. First, an efficient sequential algorithm to solve the above problem was developed. the algorithm is a modification of a Gauss-Seidel-like algorithm for obtaining the minimum costs. The most salient feature of the algorithm is the reduction of the number of nodes and edges in cheaper regions of the grid. the reported experimental results ascertain the superiority of this algorithm with regard to computer running time at a modest reduction in the accuracy of the obtained solution. Parallel implementations of grid-based algorithms were studies. A simple grid-based variant was implemented on a network of Transputers. The overall approach is employed could be used to develop a parallel version of the above sequential algorithm on a Transputer network, combining both advantages of efficiency and parallelization.
MacFarlane, Mark J. "The Path of Least Resistance: The Failure of Humanitarianism and American Foreign Policy in Sudan." Master's thesis, University of Central Florida, 2012. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5412.
Full textID: 031001389; System requirements: World Wide Web browser and PDF reader.; Mode of access: World Wide Web.; Adviser: Ezekiel Walker.; Title from PDF title page (viewed May 24, 2013).; Thesis (M.A.)--University of Central Florida, 2012.; Includes bibliographical references (p. 123-134).
M.A.
Masters
History
Arts and Humanities
History
Seegmiller, Lindsi. "Modeling and optimization of least-cost corridors." Licentiate thesis, KTH, Geoinformatik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-291279.
Full textMed tanke på ett rutnät av celler, som vart och ett har ett värde som indikerar dess kostnad per areaenhet, är en variant av det billigaste banproblemet att hitta en korridor med en specificerad bredd som förbinder två terminaler så att dess kostnadsviktade område minimeras. Det finns en beräkningseffektiv metod för att hitta sådana korridorer, men som är fallet med konventionella rasterbaserade lägsta kostnadsspår är deras inkrementella orienteringar begränsade till ett fast antal (vanligtvis åtta ortogonala och diagonala) riktningar, och därför, oavsett nätupplösning tenderar de att avvika från de tänkbara på det euklidiska planet. Dessutom är dessa metoder begränsade till problem som finns i tvådimensionella nät och ignorerar den ständigt ökande tillgängligheten och nödvändigheten av tredimensionell rasterbaserad geografisk data. Denna avhandling försöker ta itu med problemen som belyses ovan genom att utforma och testa korridoralgoritmer till lägsta kostnad. Först föreslås en metod för att lösa det tvådimensionella rasterbaserade problemet med billigaste korridorer med minskad förvrängning genom att anpassa en distorsionsminskningsteknik som ursprungligen utformades för billigaste vägar och tillämpa den på en effektiv men distorsionsbenägen billigaste korridoralgoritm. Den föreslagna metoden för distorsionsminskning är i teorin garanterad att generera inte mindre exakta lösningar än den befintliga i polynomtid och i praktiken förväntas generera mer exakta lösningar, vilket demonstreras experimentellt med syntetiska och verkliga data. En korridor modelleras sedan på ett tredimensionellt rutnät av kostnadsvägda kubikceller eller voxels som en sekvens av uppsättningar av voxels, kallade "stadsdelar", som är ordnade i en 26-hedoral form, designar en heuristisk metod för att hitta en sekvens av sådana stadsdelar som sveper den lägsta kostnadsviktade volymen och testar dess prestanda med datorgenererade slumpmässiga data. Resultaten visar att metoden hittar en låg kostnad, om inte minst kostnad, korridor med en specificerad bredd i ett tredimensionellt kostnadsnät och har en rimlig effektivitet eftersom dess komplexitet är O (n2) där n är antalet voxlar i ingångskostnadsnätet och är oberoende av korridorbredd En stor nackdel är att korridoren som hittas kan korsa sig själv, vilket ofta inte bara är en oönskad kvalitet utan gör uppskattningen av dess kostnadsviktade volym felaktig.
QC 20210309
Agbenowosi, Newland Komla. "GIS based optimal design of sewer networks and pump stations." Thesis, Virginia Tech, 1995. http://hdl.handle.net/10919/43184.
Full textIn the planning and design of sewer networks, most of the decisions are spatially dependent because of the right of way considerations and the desire to have flow by gravity. This research addresses the application of combined optimization-geographic information system (GIS) technology in the design process. The program developed for the design uses selected manhole locations to generate the candidate potential sewer networks. The design area is delineated into subwatersheds for determining the locations for lift stations when gravity flow is not possible. Flows from upstream subwatersheds are transported to the downstream subwatersheds via a force main. The path and destination of each force main in the system is determined by applying the Dijkstra's shortest path algorithm to select the least cost path from a set of potential paths. This method seeks to minimize the total dynamic head. A modified length is used to represent the length of each link or force main segment. The modified length is the physical length of the link (representing the friction loss) plus an equivalent length (representing the static head). The least cost path for the force main is the path with the least total modified length. The design approach is applied to two areas in the town of Blacksburg, Virginia. The resulting network and the force main paths are discussed.
Master of Science
DeJong, Dale Alan. "The Path of Least Resistance: An Advanced Index Alternative to the Cultural Distance Index for Measuring International Expansion." FIU Digital Commons, 2017. http://digitalcommons.fiu.edu/etd/3483.
Full textBrundage, Emil H. "Seasonal road layout design in mountainous terrain using GIS with the side hill and least cost path methods." Thesis, San Jose State University, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10011677.
Full textSeasonal road design in mountainous terrain consists of four main phases: route selection, field investigation, surveying, and analysis. The first phase, route selection, consists of two parts: selecting control points at strategic locations, and then determining potential routes between those points. Two geographic information system (GIS) geoprocessing automations were developed to aid a road planner in determining routes between control points. Both automations utilized Environmental Systems Research Institute’s (ESRI) ArcGIS software package. The first method developed was the least cost path method, which makes use of ArcGIS’s cost path tool to find a route between points following a gradual slope. The second automation was the side hill method, which utilized a variety of ArcGIS tools to maintain a uniform grade along the side of a hill between two points. The two methods were compared and contrasted based on control point locations. The least cost path method was determined to be preferable for main thoroughfares along flat valleys and ridge lines, while the side hill method was preferable for secondary roads that could be used to access steeper ground. It was concluded that the two methods can save time and increase accuracy of GIS road features for land managers planning new seasonal roads.
Johansson, David. "An Evaluation of Shortest Path Algorithms on Real Metropolitan Area Networks." Thesis, Linköping University, Department of Computer and Information Science, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-17491.
Full textThis thesis examines some of the best known algorithms for solving the shortest point-to-point path problem, and evaluates their performance on real metropolitan area networks. The focus has mainly been on Dijkstra‟s algorithm and different variations of it, and the algorithms have been implemented in C# for the practical tests. The size of the networks used in this study varied between 358 and 2464 nodes, and both running time and representative operation counts were measured.
The results show that many different factors besides the network size affect the running time of an algorithm, such as arc-to-node ratio, path length and network structure. The queue implementation of Dijkstra‟s algorithm showed the worst performance and suffered heavily when the problem size increased. Two techniques for increasing the performance were examined: optimizing the management of labelled nodes and reducing the search space. A bidirectional Dijkstra‟s algorithm using a binary heap to store temporarily labelled nodes combines both of these techniques, and it was the algorithm that performed best of all the tested algorithms in the practical tests.
This project was initiated by Netadmin Systems i Sverige AB who needed a new path finding module for their network management system NETadmin. While this study is primarily of interest for researchers dealing with path finding problems in computer networks, it may also be useful in evaluations of path finding algorithms for road networks since the two networks share some common characteristics.
Rapley, Eve. ""Taking the path of least resistance" : a constructivist grounded theory of H.E. teacher practice enactments at a UK landbased college." Thesis, University of Bedfordshire, 2017. http://hdl.handle.net/10547/622834.
Full textMeadows, Crystal. "Determining Impediments to Gene Flow in a Natural Population of Cornus florida L. Cornaceae, Using Integrative Landscape Genetic Techniques." VCU Scholars Compass, 2011. http://scholarscompass.vcu.edu/etd/184.
Full textSpringer, Matthew Thomas. "DISPERSAL BEHAVIOR OF WHITE-TAILED DEER IN AN AGRICULTURAL LANDSCAPE." OpenSIUC, 2017. https://opensiuc.lib.siu.edu/dissertations/1389.
Full textBuck, Sine. "Determining the best location for a nature-like fishway in Gavle River, Sweden." Thesis, Högskolan i Gävle, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-15725.
Full textKlein, Sabrina J. "Spatial Relationships of Sacred and Secular Spaces of the Hopewell and Adena People, Muskingum River Valley, Ohio." Ohio University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1431086236.
Full textBrunnström, Jesper. "Online Secondary Path Modelling for Spatial Active Noise Control with Arbitrarily Spaced Arrays." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-293537.
Full textI detta projekt undersöks sekundärvägsmodellering för spatial aktiv brusreducering. Fokus ligger på minskning av brus över en tredimensionell region, för metoder utan några restriktioner när det gäller mikrofon- och högtalarplacering. Efterssom spatial brusreducering generellt kräver många kanaler, behöver både sekundärvägsmodellering samt brusreducering ha mycket låg beräkningskostnad. Metoderna för sekundärvägsmodellering är menade att användas tillsammans med en specifik spatial brusreduceringsalgoritm baserad på kärninterpolation. Genom att inkludera sekundärvägsmodellering kan den spatiala brusreduceringsmetoden operera även då sekundärvägarna är tidsvarierande. Fyra metoder för sekundärvägsmodellering är undersökta i detalj, tre av vilka är baserade på auxiliärbrusprincipen. Dessa algoritmer är beskrivna för multikanalsfallet, tillsammans med blockbaserade implementationer som utnyttjar den snabba Fouriertransformen för att drastiskt minska sina beräkningskostader. Impulssvar som kan användas för att simulera ett ljudfält är inspelade med hjälp av en programmerbar robotarm. Algoritmerna är utvärderade genom simuleringar för att visa deras respektive styrkor och svagheter. Experimenten visade att de algoritmer som använder sig av auxiliärbrus har bra konvergenskaraktäristik för både kontrollfilter och sekundärvägsestimat. Däremot, på grund av auxiliärbrusets negativa inverkan på residualbruset i rummet, är den totala brusreduceringen snarlik det den auxiliärbrusfria metoden ger. För alla algoritmer blir brusreduceringen försämrad och konvergenstiden ökad med mer än en storleksordning när sekundärvägsmodellering används, jämfört med när sekundärvägarna är kända. Det verifierades också att den spatiala brusreduceringsmetoden baserad på kärninterpolation kan reducera brus över en region även när den används tillsammans med sekundärvägsmodellering.
Murekatete, Rachel Mundeli. "An Analysis of Consequences of Land Evaluation and Path Optimization." Licentiate thesis, KTH, Geoinformatik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-235687.
Full textPlanerare som arbetar bland annat med att fatta beslut som hänsyftar till vissa lokaler använder ofta rasterbaserade geografiska informationssystem (GIS) för att sätta ett värde på marken med avseende på lämplighet eller kostnad för en viss användning. Ur en beräkningssynpunkt kan denna process ses som en transformation av en eller flera uppsättningar värden associerade med ett rutnät av celler till en annan uppsättning sådana värden genom en funktion som återspeglar ett eller flera kriterier. Medan det generellt förväntas att olika omvandlingar leder till olika "bästa" platser, har lite varit känt om hur sådana skillnader uppstår (eller inte uppstår). Exempel på sådana rumsliga beslutsproblem kan lätt hittas i litteraturen och många av dem handlar om valet av en uppsättning celler (som markanvändningen övervägs tilldelas) från en rasteryta av lämplighet eller kostnad beroende på kontext. För att underlätta GISs algoritmiska tillvägagångssätt antas det ofta att kvaliteten på uppsättningen av celler kan utvärderas som helhet genom summan av deras cellvärden. Giltigheten av detta antagande måste emellertid ifrågasättas om dessa värden mäts på en skala som inte tillåter aritmetiska transformationer. Användning av ordinal skala enligt Stevens typologi är ett exempel av detta. En fråga uppstår naturligt: Finns det ett mer matematiskt sunt och konsekvent tillvägagångssätt för att utvärdera kvaliteten på en rutt när kvaliteten på varje cell i det givna rutnätet mäts med ordinalskala? Avhandlingen försöker svara på ovanstående frågor i samband med ruttplanering genom en serie beräkningsexperiment med hjälp av ett antal slumpmässigt genererade landskapsnät med en rad olika rumsliga och icke-rumsliga strukturer. I den första uppsättningen experiment genererade vi minsta-kostnad rutter på ett antal kostnadsnät som transformerats från landskapsnätverket med hjälp av en mängd olika transformationsparametrar, och analyserade lägen och de (viktade) längderna för dessa rutter. Resultaten visar att samma par ändpunkter mycket väl kan vara sammanbundna med olika minsta-kostnad banor på olika kostnadsraster härledda från samma landskapsraster, och att variationen mellan dessa banor påverkas av hur givna värden fördelas i landskapsrastret såväl som av hur härledda värden fördelas i kostnadsrastret. Mest signifikant är att variationen tenderar att vara mindre när landskapsrastret innehåller mer distinkta grupper av celler som potentiellt lockar eller distraherar kostnadsbesparande passage, eller när kostnadsrastret innehåller ett mindre antal låg-kostnad celler. Den andra uppsättningen experiment syftar till att jämföra två optimeringsmodeller, minisum och minimax (eller maximin) sökmodeller, vilka sammanställer värdena för cellerna som är associerade med en sökväg med summanfunktionen respektive maximum (eller minimum) funktionen. Resultaten tyder på att minisumbanemodellen är effektiv om sökningen av sökvägen kan översättas till det konventionella minsta kostnadsproblemet, vilket syftar till att hitta en väg med den minsta kostnadsvägda längden mellan två terminaler på en ratio-skalad rasterkostyta, men minimax (eller maximin) banmodellen är matematiskt sundare om kostnadsvärdena mäts i ordinär skala och praktiskt användbar om problemet inte bara avser minimering av kostnad men samtidigt maximering av någon önskvärd egenskap såsom lämplighet.
QC 20181002
Kanat, Irfan Emrah. "E-government Adoption Model Based On Theory Of Planned Behavior: Empirical Investigation." Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/12610714/index.pdf.
Full textSporre, Göran. "On Some Properties of Interior Methods for Optimization." Doctoral thesis, KTH, Mathematics, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3472.
Full textThis thesis consists of four independent papers concerningdifferent aspects of interior methods for optimization. Threeof the papers focus on theoretical aspects while the fourth oneconcerns some computational experiments.
The systems of equations solved within an interior methodapplied to a convex quadratic program can be viewed as weightedlinear least-squares problems. In the first paper, it is shownthat the sequence of solutions to such problems is uniformlybounded. Further, boundedness of the solution to weightedlinear least-squares problems for more general classes ofweight matrices than the one in the convex quadraticprogramming application are obtained as a byproduct.
In many linesearch interior methods for nonconvex nonlinearprogramming, the iterates can "falsely" converge to theboundary of the region defined by the inequality constraints insuch a way that the search directions do not converge to zero,but the step lengths do. In the sec ond paper, it is shown thatthe multiplier search directions then diverge. Furthermore, thedirection of divergence is characterized in terms of thegradients of the equality constraints along with theasymptotically active inequality constraints.
The third paper gives a modification of the analytic centerproblem for the set of optimal solutions in linear semidefiniteprogramming. Unlike the normal analytic center problem, thesolution of the modified problem is the limit point of thecentral path, without any strict complementarity assumption.For the strict complementarity case, the modified problem isshown to coincide with the normal analytic center problem,which is known to give a correct characterization of the limitpoint of the central path in that case.
The final paper describes of some computational experimentsconcerning possibilities of reusing previous information whensolving system of equations arising in interior methods forlinear programming.
Keywords:Interior method, primal-dual interior method,linear programming, quadratic programming, nonlinearprogramming, semidefinite programming, weighted least-squaresproblems, central path.
Mathematics Subject Classification (2000):Primary90C51, 90C22, 65F20, 90C26, 90C05; Secondary 65K05, 90C20,90C25, 90C30.
Tsoumari, Vasiliki. "Villages and valleys: connectivity and land use in Northern Messenia during Middle and Late Helladic periods." Thesis, Uppsala universitet, Arkeologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-386457.
Full textElliot, Nicholas Bryant. "The ecology of dispersal in lions (Panthera leo)." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:0cc8101b-1048-44ef-921e-1b44a2356c7e.
Full textMasson, Marine. "Contribution à la modélisation des préférences des consommateurs en fonction de dimensions sensorielles et subjectives par les modèles d'équations structurelles.Application aux préférences des sièges conducteurs de véhicules." Thesis, Paris, AgroParisTech, 2014. http://www.theses.fr/2014AGPT0015.
Full textIn Sensory Science, preference mapping is used to explain consumers' preferences with sensory data. This PhD aims to integrate not only sensory data but also new variables that are related to consumers' perception of the product in the modelling of consumers' preferences. These variables are labelled as subjective dimensions. They address the pragmatic dimensions that cover the context of use of the products and more symbolic dimensions, such as aesthetics, modernity, originality…An exploratory study based on coffee cups was a first mean to approach the issues related to subjective dimensions. Then, all the work was done on a study of 11 car seats. The first step consisted in qualitative interviews of 16 consumers and of 2 designers. These interviews allowed identifying the subjective dimensions that characterize car seats. 110 consumers then performed a quantitative evaluation of their preferences and subjective dimensions. Finally, the seats were characterized by experts with sensory descriptors. The consumers' preferences were modelled according to both sensory data and subjective dimensions, using structural equations: the Partial Least Square Path Modeling. Four models based on preferences clustering were established. The contribution of two kinds of data differed according to the considered cluster, which led to the identification of four customer profiles. From a methodological point of view, this work provides first elements about the benefit of subjective dimensions in preference modelling. The methodology is being implemented on a food product: chocolate
Balbi, Manon. "Validation de la fonctionnalité des continuités écologiques en milieu urbain : approches plurispécifiques et multi-sites." Thesis, Rennes 1, 2017. http://www.theses.fr/2017REN1B034/document.
Full textMaintaining connectivity across urban landscape, intrinsically fragmented, is a major issue of urban biodiversity conservation. Connectivity is increasingly taken into account by policy and stakeholders, especially through the establishment of the blue-green infrastructure. Multiple mapping tools allow to detect ecological networks (highly connected areas), however their functionnal validation is often lacking. The objective of this study is to validate least cost path analysis predictions in several cities with different biological models. Studied species vary in terms of dispersal means and capacities (flight, walk, crawling) and habitat requirement (e.g. herbaceous or forested habitats). Several protocols based on movement ecology and landscape genetic are applied, focusing on replication (within and among cities) and control of inter-individual variability. Our results indicate that movement is increased in predicted ecological networks when compared with areas predicted as poorly connected: the translocated hedgehogs travelled longer distances, several passerine responded to song playback over longer distances, and moths showed increased recapture rates. Indirect analysis on the garden snail showed a weak relation between population genetic differentiation and connectivity models. This work provides scientific support for the establishment of ecological networks in urban landscapes
Wu, MeiMei. "Investigating the adoption of banking services delivered over remote channels : the case of Chinese Internet banking customers." Thesis, Loughborough University, 2012. https://dspace.lboro.ac.uk/2134/9387.
Full textGonzález, Rojas Victor Manuel. "Análisis conjunto de múltiples tablas de datos mixtos mediante PLS." Doctoral thesis, Universitat Politècnica de Catalunya, 2014. http://hdl.handle.net/10803/284659.
Full textEl contenido fundamental de esta tesis corresponde al desarrollo de los métodos GNM-NIPALS, GNM-PLS2 y GNM-RGCCA para la cuantificación de las variables cualitativas a partir de las primeras k componentes proporcionadas por los métodos apropiados en el análisis de J matrices de datos mixtos. Estos métodos denominados GNM-PLS (General Non Metric Partial Least Squares) son una extensión de los métodos NM-PLS que toman sólo la primera componente principal en la función de cuantificación. La trasformación de las variables cualitativas se lleva a cabo mediante procesos de optimización maximizando generalmente funciones de covarianza o correlación, aprovechando la flexibilidad de los algoritmos PLS y conservando las propiedades de pertenencia grupal y orden si existe; así mismo se conservan las variables métricas en su estado original excepto por estandarización. GNM-NIPALS ha sido creado para el tratamiento de una (J=1) matriz de datos mixtos mediante la cuantificación vía reconstitución tipo ACP de las variables cualitativas a partir de una función agregada de k componentes. GNM-PLS2 relaciona dos (J=2) conjuntos de datos mixtos Y~X mediante regresión PLS, cuantificando las variables cualitativas de un espacio con la función agregada de las primeras H componentes PLS del otro espacio, obtenidas por validación cruzada bajo regresión PLS2. Cuando la matriz endógena Y contiene sólo una variable de respuesta el método se denomina GNM-PLS1. Finalmente para el análisis de más de dos bloques (J>2) de datos mixtos Y~X1+...+XJ a través de sus variables latentes (LV) se implementa el método NM-RGCCA basado en el método RGCCA (Regularized Generalized Canonical Correlation Analysis) que modifica el algoritmo PLS-PM implementando el nuevo modo A y especifica las funciones de maximización de covarianzas o correlaciones asociadas al proceso. La cuantificación de las variables cualitativas en cada bloque Xj se realiza mediante la función inner Zj de dimensión J debido a la agregación de las estimaciones outer Yj. Tanto Zj como Yj estiman la componente ξj asociad al j-ésimo bloque.
Knoebel, Nathan B. "Adaptive Quaternion Control for a Miniature Tailsitter UAV." Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd2092.pdf.
Full textDittrich, Petr. "Odhad Letových Parametrů Malého Letounu." Doctoral thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-412582.
Full textGustafsson, Frans. "Elevers läsvanor : En kvalitativ studie av fyra fordonselevers läsvanor." Thesis, Högskolan Dalarna, Pedagogiskt arbete, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:du-21210.
Full textCostigliola, Francesco. "Partial Least Square – Path Modeling: metodologia, software e aplicação." Master's thesis, 2010. http://hdl.handle.net/10362/8818.
Full textO trabalho proposto enquadra-se no âmbito da estatística computacional, tendo como objectivo primário o desenvolvimento de um software estatístico para a implementação do algoritmo PLS - PM (Partial Least Square - Path Modeling). O algoritmo foi programado na sua totalidade em SAS-IML (SAS - Interactive Matrix Language) e complementado com dois módulos de simulação para a estimação da signi cância dos parâmetros do modelo. O trabalho apresenta uma parte metodológica baseada na revisão da literatura relevante no âmbito do PLS - PM. De seguida foram apresentadas todas as fases de análise e implementação do software em questão. Foram indicados sucessivos testes realizados a um conjunto de dados, utilizando o software desenvolvido e outro presente no mercado, de modo a comparar o desempenho de cada um e os resultados obtidos. A comparação dos outputs originou resultados positivos, isto é, os resultados produzidos dos dois softwares são iguais. Além dos resultados de base associados ao PLS-PM, o software criado disponibiliza uma nova técnica de simulação que permite adequar o cálculo da signi cância às exigências do investigador. Outra vantagem que o programa traz é a possibilidade de executar uma metodologia(PLS-PM) que não está implementada no ambiente SAS. Este projecto apresenta a particularidade de poder ser potenciado, tornandose uma ferramenta de arranque para desenvolvimentos futuros devido à circunst ância de ter sido desenvolvido e livremente disponibilizado para a comunidade cientí ca.
Lopes, Tiago Guia Ribeiro. "Alternative smoothing strategies in smooth partial least squares path modelling." Master's thesis, 2020. http://hdl.handle.net/10362/99737.
Full textThe assessment of nonlinear relationships in the context of Partial Least Squares Path Modelling (PLS-PM) has received a growing interest in recent years. One important contribution to this subject has been the work of Henseler, Fassot, Dijkstra and Wilson (2012) on the analysis of four different approaches to quadratic effects. The Smooth Partial Least Squares (PLSs) estimation technique studied in this work removes any assumptions on the structure of the nonlinear relationships between latent variables, by applying smoothing spline techniques to the structural model. Performance results of the PLSs show that it is a powerful tool in the context of predictive research, for instance to support the definition of targeted policies. Building from the hybrid approach to the PLS algorithm introduced by Wold (1982), we compare the performance of alternative spline designs, including natural cubic splines, P-Splines and Thin Plate Regression Splines (TPRS). For this purpose, Monte-Carlo simulations are carried with a conceptual model drawn from a comprehensive set of nonlinear relationships, in different sample sizes. All model configurations are compared using Root Mean Squared Error (RMSE) and absolute bias results. The benchmarking exercise shows that, in most contexts, P-Splines perform slightly better than TPRS and natural cubic splines.
Gao, Yuan. "Finding least-transfer path in multi-route / modal public transit system." 2008. http://purl.galileo.usg.edu/uga%5Fetd/gao%5Fyuan%5F200812%5Fms.
Full text"Algorithms for partial least squares regression." Tese, MAXWELL, 2003. http://www.maxwell.lambda.ele.puc-rio.br/cgi-bin/db2www/PRG_0991.D2W/SHOW?Cont=4362:pt&Mat=&Sys=&Nr=&Fun=&CdLinPrg=pt.
Full textHuseynli, Shahin. "Determination of the most suitable oil pipeline route using GIS least cost path analysis." Master's thesis, 2015. http://hdl.handle.net/10362/14553.
Full text"GIS and Archaeology: Bison Hunting Strategies in Southern Saskatchewan." Thesis, 2013. http://hdl.handle.net/10388/ETD-2013-06-1084.
Full textJones, Andrew Charles. "Habitat linkages and highway mitigation using spatially-explicit GIS-based models." 2012. http://hdl.handle.net/10170/529.
Full textGerezigiher, Gebru Welay. "Utilising gamification approaches to derive crowd pattern/crowd context from aerial images of major events." Master's thesis, 2018. http://hdl.handle.net/10362/33793.
Full textA large number of casualties occur during emergencies in highly-crowded public spaces of major events like annual anniversaries, religious festivals, big parties and football matches due to stampedes. It has been often observed that poor resource management is one of the key areas that could be improved to solve this problem. In this study,a geo-game-based approach has been adopted to alert responsible authorities of highly crowded regions as an early warning system and also provide them with optimal dispersal routes. In the Android-based game that was developed for this study, the players could draw polygons on real-time imageries of the area under study obtained from unmanned aerial vehicles and classify them into categories based on how crowded the region is. This data is submitted to a web server which is processed to find suitable least-cost routes by which the people in the crowded regions can be brought to safety in case of an emergency. The spatial distribution of people could be forwarded to appropriate authorities in-charge of the administration highlighting extremely crowded regions which need their attention thereby prompting redirection of security personnel. Additionally, the calculated dispersal routes could be used by them as suggestions to avoid a stampede and ensure safety in case the situation turns worse.
Lourenço, Francisco de Sousa Gago Prata. "P-IRLS-PM : a new approach to non-linear formative consctructs." Master's thesis, 2019. http://hdl.handle.net/10362/71863.
Full textThe traditional approach to PLS-PM estimated the scores of the formative latent variables as exact linear combinations of their associated manifest variables, not allowing for modelling other relationships besides the linear ones. The present study intends to overcome this limitation, introducing the P-IRLS-PM. The P-IRLS-PM is a new approach to the variance based structural equations models, which intends to widen the spectra of how the formative latent scores are represented by its associated manifest variables. Throughout this work the core concepts of the algorithm P-IRLS-PM will be introduced, followed by a Monte Carlo experiment comparing the new approach with the traditional PLS-PM.
Gómez, Jefferson Valencia. "Siting feasible water catchments for small irrigation projects in Western Honduras." Master's thesis, 2016. http://hdl.handle.net/10362/18405.
Full textIn Western Honduras, most of people live in rural areas under extreme conditions of poverty. This area is part of the Centro American dry corridor which is affected by droughts and, therefore, water scarcity. Access to water is limited; which affects human welfare and agricultural production. As a plausible solution, this thesis work provides a tool to identify feasible water catchments for small irrigation projects in Western Honduras based on Geographic Information Systems (GIS) and surface features. This tool can support decision makers to address water catchments in the study area. Two versions of this tool were developed. Both desktop and online versions allow the user to find potential sites to take water from streams through hosepipes. The suggested paths, over which these hosepipes can be installed, are modeled by using the Least-Cost Path (LCP) approach. We contrasted the results provided by the tool with two actual cases. The results showed the potential of this tool to find possible water intakes different from the current cases. In both cases, the tool was capable of finding water intakes very close to the current sites. This thesis proves that the use of GIS technologies in combination with decision rules and surface features can provide a novel solution to the real problem of water scarcity in Western Honduras.
Rademaker, Manuel Elias. "Composite-based Structural Equation Modeling." Doctoral thesis, 2020. https://doi.org/10.25972/OPUS-21593.
Full textStrukturgleichungsmodellierung (SEM) wird seit Jahrzehnten in verschiedenen Bereichen und Forschungsgebieten wie zum Beispiel der Psychologie, der Soziologie und den Wirtschaftswissenschaften verwendet und weiterentwickelt. SEM umfasst dabei die Gesamtheit einer Reihe verwandter Theorien, mathematischer Modelle, Methoden, Algorithmen und Terminologien im Zusammenhang mit der Analyse der Beziehungen zwischen theoretischen Entitäten - so genannten Konzepten -, ihrer statistischen Repräsentation - als Konstrukte bezeichnet - und Beobachtungsgrößen - üblicherweise Indikatoren, Items oder manifeste Variablen genannt. Diese Arbeit befasst sich mit Aspekten eines bestimmten Forschungszweigs innerhalb der SEM, den Komposit-basierten SEM Verfahren. Komposit-basiertes SEM ist ein Überbegriff für alle SEM Methoden, die Kompositen - d.h. gewichtete Linearkombinationen aus Beobachtungen - zur Schätzung unbekannter Größen verwenden. Der Inhalt der Arbeit basiert auf einem Arbeitspapier (Kapitel 2), einem veröffentlichten referierten Zeitschriftenartikel (Kapitel 3), einem weiteren Arbeitspapier (Kapitel 4) und einer stetig wachsenden Dokumentation, die ich für das R-Paket cSEM geschrieben habe, bzw. kontinuierlich weiterschreibe (Kapitel 5). Das Paket cSEM - geschrieben von mir und Florian Schuberth, meinem ehemaligen Kollegen an der Universität Würzburg - stellt Funktionen zur Verfügung, um lineare, nichtlineare, hierarchische und Multigruppen-Strukturgleichungsmodelle mit Hilfe von Komposit-basierten Ansätzen und Verfahren zu schätzen, zu analysieren, zu bewerten, zu testen und zu untersuchen. In Kapitel 1 gehe ich zunächst kurz auf einige der wichtigsten SEM Begriffe ein. Kapitel 2 basiert auf einem Arbeitspapier mit dem Titel „Assessing overall model fit of composite models in structural equation modeling“, das im Journal of Business Research eingereicht werden wird. Der Artikel befasst sich mit dem Thema der Bewertung der Gesamtgüte des Modells (eng. overall model fit) im Kontext des Komposit-Modells. Das Papier leistet drei zentrale Beiträge zur Literatur zu diesem Thema. Erstens wird das Konzept der Modellgüte in der SEM im Allgemeinen und der Komposit-basierten SEM im Besonderen eingehend erörtert. Zweitens wird auf gängige Fit-Indizes eingegangen und erläutert, ob und wie sie zur Beurteilung eines Komposit-Modells angewendet werden können. Drittens wird gezeigt, dass der root mean square outer residual covariance (RMS_theta) identisch mit einem anderen bekannten Index, dem standardized root mean square residual (SRMR) ist, falls der RMS_theta als Maß für die Modellanpassungsgüte verwendet werden soll. Kapitel 3 basiert auf einem in Internet Research veröffentlichten Zeitschriftenartikel mit dem Titel „Measurement error correlation within blocks of indicators in consistent partial least squares: Issues and remedies“. Der Artikel entwickelt das consistent partial least squares (PLSc) Verfahren weiter, um konsistente Parameterschätzungen für Populationsmodelle zu erhalten, deren Indikatorblöcke korrelierte Messfehler enthalten. Dies wird erreicht, indem die Korrektur für die Dämpfung (eng. attenuation), wie sie ursprünglich von PLSc angewandt wird, so modifiziert wird, dass sie a priori Annahmen über die Struktur der Messfehlerkorrelationen innerhalb der Indikatorblöcke enthält. Um die statistische Gültigkeit der Modifikation zu beurteilen, wird eine Monte Carlo Simulation durchgeführt. Das Papier wurde gemeinsam mit Florian Schuberth und Theo Dijkstra verfasst. Kapitel 4 basiert auf einem zur Veröffentlichung in Industrial Management & Data Systems anstehenden Zeitschriftenartikel mit dem Titel „Estimating and testing second order constructs using PLS-PM: the case of composites of composites“. Der Zweck dieses Artikels ist ein dreifacher: (i) Bewertung und Vergleich gängiger Ansätze zur Schätzung von Modellen, die Konstrukte zweiter Ordnung enthalten, die als Komposite von Kompositen modelliert wurden; (ii) ein zweistufiges Testverfahren vorzustellen und statistisch zu bewerten, um die allgemeine Modellanpassung solcher Modelle zu testen und (iii) auf der Grundlage unserer Ergebnisse Empfehlungen für Praktiker zu formulieren. Darüber hinaus wurde eine Monte Carlo Simulation durchgeführt, um die Ansätze in Bezug auf Fisher-Konsistenz, geschätzte Verzerrung und RMSE zu vergleichen. Das Papier wurde gemeinsam mit Florian Schuberth und Jörg Henseler verfasst. Kapitel 5 stellt das R-Paket cSEM vor. Zum Zeitpunkt der Einreichung dieser Dissertation zur Begutachtung ist cSEM im Comprehensive R Archive Network (CRAN) als Version 0.2.0 verfügbar
Crowe, Vanessa. "The path of least resistance : decorative pattern as an analogue of dis/order in everyday life : an exegesis presented in partial fulfillment of the requirements for the degree of Master of Fine Arts at Massey University, Wellington, New Zealand." 2008. http://hdl.handle.net/10179/853.
Full textFerreira, Patricia. "Breaking the Weak Governance Curse: Global Regulation and Governance Reform in Resource-rich Developing Countries." Thesis, 2012. http://hdl.handle.net/1807/33995.
Full textROW, JEFFREY. "Origins of genetic variation and population structure of foxsnakes across spatial and temporal scales." Thesis, 2011. http://hdl.handle.net/1974/6271.
Full textThesis (Ph.D, Biology) -- Queen's University, 2011-01-11 10:40:52.476
(6591728), Rui Yan. "The Development of Image Processing Algorithms in Cryo-EM." Thesis, 2019.
Find full text