Relevant bibliographies by topics / Patha / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Patha.

Dissertations / Theses on the topic 'Patha'

Author: Grafiati
Published: 5 June 2025
Last updated: 2 August 2025

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Patha.'

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

Blythe, Joe. "Doing referring in Murriny Patha conversation." Thesis, The University of Sydney, 2009. http://hdl.handle.net/2123/5388.

Full text
Abstract:
Successful communication hinges on keeping track of who and what we are talking about. For this reason, person reference sits at the heart of the social sciences. Referring to persons is an interactional process where information is transferred from current speakers to the recipients of their talk. This dissertation concerns itself with the work that is achieved through this transfer of information. The interactional approach adopted is one that combines the “micro” of conversation analysis with the “macro” of genealogically grounded anthropological linguistics. Murriny Patha, a non-Pama-Nyung
APA, Harvard, Vancouver, ISO, and other styles
2

Blythe, Joe. "Doing referring in Murriny Patha conversation." University of Sydney, 2009. http://hdl.handle.net/2123/5388.

Full text
Abstract:
Doctor of Philosophy<br>Successful communication hinges on keeping track of who and what we are talking about. For this reason, person reference sits at the heart of the social sciences. Referring to persons is an interactional process where information is transferred from current speakers to the recipients of their talk. This dissertation concerns itself with the work that is achieved through this transfer of information. The interactional approach adopted is one that combines the “micro” of conversation analysis with the “macro” of genealogically grounded anthropological linguistics. Murriny
APA, Harvard, Vancouver, ISO, and other styles
3

Seiss, Melanie [Verfasser]. "Murrinh-Patha Complex Verbs : Syntactic Theory and Computational Implementation / Melanie Seiss." Konstanz : Bibliothek der Universität Konstanz, 2015. http://d-nb.info/1113109823/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gleiss, Petra M., Josef Leydold, and Peter F. Stadler. "Minimum Path Bases and Relevant Paths." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2001. http://epub.wu.ac.at/1214/1/document.pdf.

Full text
Abstract:
Given an undirected graph G(V,E) and a vertex subset U\subseteq V the U-space is the vector space over GF(2) spanned by the paths with end-points in U and the cycles in G(V,E). We extend Vismara's algorithm to the computation of the union of all minimum length bases of the U-space. (author's abstract)<br>Series: Preprint Series / Department of Applied Statistics and Data Processing
APA, Harvard, Vancouver, ISO, and other styles
5

Asplund, Teo. "Improved Path Opening by Preselection of Paths." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-248960.

Full text
Abstract:
Enhancing long, thin, sinuous structures in images is a common problem in image analysis. Mathematical morphology is often used to solve this problem. One approach is known as the path opening. The goal of this project was to investigate whether a preselection of a limited number of paths, based on the upper skeleton of the image, could be used to find an approximate, faster path opening. In this thesis, a new, graph-based algorithm, that is the result of this investigation, is presented. The new algorithm is compared with the traditional path opening and, to some extent, with the parsimonious
APA, Harvard, Vancouver, ISO, and other styles
6

Nagubadi, RadhaKrishna. "K Shortest Path Implementation." Thesis, Linköpings universitet, Databas och informationsteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-95451.

Full text
Abstract:
The problem of computing K shortest loopless paths, or ranking of the K shortest loopless paths between a pair of given vertices in a network is a well-studied generalization of shortest path problem. The K shortest paths problem determines not only one shortest path but the K best shortest paths from s to t in an increasing order of weight of the paths. Yen’s algorithm is known to be the efficient and widely used algorithm for determining K shortest loopless paths. Here, we introduce a new algorithm by modifying the Yen’s algorithm in the following way: instead of removing the vertices and th
APA, Harvard, Vancouver, ISO, and other styles
7

Chase, Melissa. "Shortest Path Problems: Multiple Paths in a Stochastic Graph." Scholarship @ Claremont, 2003. https://scholarship.claremont.edu/hmc_theses/143.

Full text
Abstract:
Shortest path problems arise in a variety of applications ranging from transportation planning to network routing among others. One group of these problems involves finding shortest paths in graphs where the edge weights are defined by probability distributions. While some research has addressed the problem of finding a single shortest path, no research has been done on finding multiple paths in such graphs. This thesis addresses the problem of finding paths for multiple robots through a graph in which the edge weights represent the probability that each edge will fail. The objective is to fin
APA, Harvard, Vancouver, ISO, and other styles
8

Dash, Suvendu Kumar. "Context-based metrics for evaluating changes to web pages." Thesis, Texas A&M University, 2003. http://hdl.handle.net/1969.1/79.

Full text
Abstract:
The web provides a lot of fluid information but this information changes, moves, and even disappears over time. Bookmark lists, portals, and paths are collections where the building blocks are web pages, which are susceptible to these changes. A lot of research, both in industry and in academia, focuses on organizing this vast amount of data. In this thesis, I present context-based algorithms for measuring changes to a document. The methods proposed use other documents in a collection as the context for evaluating changes in the web pages. These metrics will be used in maintaining paths as th
APA, Harvard, Vancouver, ISO, and other styles
9

Chou, Chang-Chien. "Minimum traversal path of n circles path planning of circles, computing and constructing paths of circles, geometrical optimization." Saarbrücken VDM Verlag Dr. Müller, 2007. http://d-nb.info/991344146/04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cuerington, Andre M. "The shortest path problem in the plane with obstacles : bounds on path lengths and shortest paths within homotopy classes." Thesis, Monterey, California. Naval Postgraduate School, 1991. http://hdl.handle.net/10945/28532.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Lundberg, Marcus. "Path planning for autonomous vehicles using clothoid based smoothing of A* generated paths and optimal control." Thesis, KTH, Numerisk analys, NA, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-216388.

Full text
Abstract:
Autonomous vehicles is a rapidly expanding field and the need for robust and efficient path planners is high. We approach the global path- planning problem for an autonomous load carrier for quarry environments, developed at Volvo Construction Equipment, using two methods: a two- step path planning and path smoothing approach, and a method based on an optimal control formulation of the path planning problem. The two-step method is based on smoothing an initial path found by A*, an efficient grid search algorithm, by fitting a curve consisting of as few clothoid segments as possible to the A* p
APA, Harvard, Vancouver, ISO, and other styles
12

Purvis, Kelly Grant. "Assessment of beach access paths on dune vegetation and implications for dune path planning and management." Thesis, College of Charleston, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=1545049.

Full text
Abstract:
<p> The impact of beach access paths on dune vegetation was investigated on the Isle of Palms, SC. Understanding the impacts of the most direct form of disturbance in this system (beach access paths) is of increasing importance from ecological and economic perspectives. Vegetation characteristics were measured along transects in foredune, mid dune and back dune communities at set distances from beach access paths. Survey was conducted to allow comparisons between path types and materials. Results indicate that beach access paths have a significant impact on beach dune vegetation. Sand paths ca
APA, Harvard, Vancouver, ISO, and other styles
13

Muhandiramge, Ranga. "Maritime manoeuvring optimization : path planning in minefield threat environments." University of Western Australia. School of Mathematics and Statistics, 2008. http://theses.library.uwa.edu.au/adt-WU2009.0015.

Full text
Abstract:
The aim of the research project that is the subject of this thesis is to apply mathematical techniques, especially those in the area of operations research, to the problem of maritime minefield transit. We develop several minefield models applicable to different aspects of the minefield problem. These include optimal mine clearance, shortest time traversal and time constrained traversal. We hope the suite of models and tools developed will help make mine field clearance and traversal both safer and more efficient and that exposition of the models will bring a clearer understanding of the mine
APA, Harvard, Vancouver, ISO, and other styles
14

Fenwick, Joel. "Visibility-Preserving Movement for Teams - Algorithms for Walking Minimal Paths." Thesis, Griffith University, 2008. http://hdl.handle.net/10072/365582.

Full text
Abstract:
There is a large body of research into finding short (if not shortest) paths in a wide variety of environments including graphs, polygons and the two dimensional plane with polygonal obstacles, to name just a few. Much of this research has been focussed on moving a single (possibly complex) entity through the environment under a variety of cost metrics. In recent years, relatively inexpensive robots have become more accessible, ranging from basic kits to complete units such as the Sony AiboTM. At the same time, virtual environments have been increasing in sophistication. For the past decade or
APA, Harvard, Vancouver, ISO, and other styles
15

Swartzentruber, Levi Daniel. "Improving path planning of unmanned aerial vehicles in an immersive environment using meta-paths and terrain information." [Ames, Iowa : Iowa State University], 2009. 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:1468138.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

HASEGAWA, Hiroshi, and Ken-ichi SATO. "Prospects and Challenges of Multi-Layer Optical Networks." Institute of Electronics, Information and Communication Engineers, 2007. http://hdl.handle.net/2237/14981.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Allen, Emily. "Combinatorial Interpretations Of Generalizations Of Catalan Numbers And Ballot Numbers." Research Showcase @ CMU, 2014. http://repository.cmu.edu/dissertations/366.

Full text
Abstract:
The super Catalan numbers T(m,n) = (2m)!(2n)!=2m!n!(m+n)! are integers which generalize the Catalan numbers. Since 1874, when Eugene Catalan discovered these numbers, many mathematicians have tried to find their combinatorial interpretation. This dissertation is dedicated to this open problem. In Chapter 1 we review known results on T (m,n) and their q-analog polynomials. In Chapter 2 we give a weighted interpretation for T(m,n) in terms of 2-Motzkin paths of length m+n2 and a reformulation of this interpretation in terms of Dyck paths. We then convert our weighted interpretation into a conven
APA, Harvard, Vancouver, ISO, and other styles
18

John, Mervyn. "Critical path analysis using simulation techniques and selection of lean tools to multiple critical paths based on cost factor." Thesis, Wichita State University, 2011. http://hdl.handle.net/10057/5180.

Full text
Abstract:
A production system converts raw materials into finished goods by various processes. The processes could occur parallel in order to reduce the time taken to complete the processes. Critical path in production systems is the maximum time taken to complete processes occurring in parallel. Identifying critical paths are important because, in order to improve the cycle time emphasis needs to be given to the critical path. Critical path is usually a single path in deterministic processing times. Due to variability more than one path might tend to be critical within the same system. The initial part
APA, Harvard, Vancouver, ISO, and other styles
19

Bott, M. P. "A new, robust, and generic method for the quick creation of smooth paths and near time-optimal path tracking." Thesis, University of St Andrews, 2011. http://hdl.handle.net/10023/2095.

Full text
Abstract:
Robotics has been the subject of academic study from as early as 1948. For much of this time, study has focused on very specific applications in very well controlled environments. For example, the first commercial robots (1961) were introduced in order to improve the efficiency of production lines. The tasks undertaken by these robots were simple, and all that was required of a control algorithm was speed, repetitiveness and reliability in these environments. Now however, robots are being used to move around autonomously in increasingly unpredictable environments, and the need for robotic cont
APA, Harvard, Vancouver, ISO, and other styles
20

Bodet, Sophie. "Le film colorié : techniques et esthétiques." Paris 8, 2000. http://www.theses.fr/2000PA081671.

Full text
Abstract:
Le coloriage des films etudie dans ce travail se situe essentiellement durant la periode anterieure aux annees trente. Une premiere partie decrit la mise en oeuvre du coloriage entre 1892 et 1929, la seconde etudie sur cette meme periode le corpus concerne. L'environnement de la pratique est aborde en partant des principales influences dont celle de la lanterne magique. Les aspects techniques et esthetiques du travail d'emile reynaud sont l'objet d'un chapitre specifique auquel succede l'inventaire des multiples ateliers ou s'effectuait le coloriage des films. Ce fonctionnement artisanal va et
APA, Harvard, Vancouver, ISO, and other styles
21

Berthod, Olivier [Verfasser]. "On institutions, paths, and routes set in stone : the construction of a bridge as a case of path instantiation / Olivier Berthod." Berlin : Freie Universität Berlin, 2011. http://d-nb.info/1026069718/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Shinn, Tong-Wook. "Combining Shortest Paths, Bottleneck Paths and Matrix Multiplication." Thesis, University of Canterbury. Computer Science and Software Engineering, 2014. http://hdl.handle.net/10092/9740.

Full text
Abstract:
We provide a formal mathematical definition of the Shortest Paths for All Flows (SP-AF) problem and provide many efficient algorithms. The SP-AF problem combines the well known Shortest Paths (SP) and Bottleneck Paths (BP) problems, and can be solved by utilising matrix multiplication. Thus in our research of the SP-AF problem, we also make a series of contributions to the underlying topics of the SP problem, the BP problem, and matrix multiplication. For the topic of matrix multiplication we show that on an n-by-n two dimensional (2D) square mesh array, two n-by-n matrices can be multiplied
APA, Harvard, Vancouver, ISO, and other styles
23

Barriga, Junco Julia Auristela, Natteri Yahaira Bereche, Medina Candy Canchumani, Martel Angeline Juarez, and Malpartida Patricia Lena. "Pacha Jar." Bachelor's thesis, Universidad Peruana de Ciencias Aplicadas (UPC), 2018. http://hdl.handle.net/10757/623997.

Full text
Abstract:
El presente proyecto se ha llevado a cabo con la finalidad de producir y vender el producto « Pacha Jar » que consta de salsas chimichurri cuyos ingredientes principales serán productos de las tres regiones del Perú iniciando con un portafolio de tres presentaciones: chimichurri de aceituna negra, chimichurri de aguaymanto y chimichurri de carambola. La presentación del producto será en envases de vidrio favoreciendo así la conservación del mismo, así como fomentando el cuidado del medio ambiente. Actualmente el mundo se encuentra más consciente de la importancia de una buena alimentación y c
APA, Harvard, Vancouver, ISO, and other styles
24

Tian, Lin. "Improved Shortest Path Algorithms by Dynamic Graph Decomposition." Thesis, University of Canterbury. Computer Science and Software Engineering, 2006. http://hdl.handle.net/10092/1196.

Full text
Abstract:
In this thesis, we introduce three new approaches for solving the single source shortest path (SSSP) problem in nearly acyclic directed graphs, and algorithms based on these approaches. In the first approach, we extend a technique of strongly connected components (sc-components) decomposition by Takaoka [23], and the generalized decomposition approach is called a higher-order decomposition. According to Takaoka's definition of acyclicity, the degree of cyclicity of a graph G, cyc(G), is defined by the maximum cardinality of the strongly connected components of G. Based on the higher-order deco
APA, Harvard, Vancouver, ISO, and other styles
25

Galbicka, Evan. "Path." VCU Scholars Compass, 2018. https://scholarscompass.vcu.edu/etd/5476.

Full text
Abstract:
Path is a collaborative system that developed over the course of five months of studio activity and continued through the duration of the exhibition. The system’s main collaborators were a land snail native to eastern North America (Neohelix albolabris), myself, and a digital cellular automaton. These prime agents interwove processes and exchanges between one another into a complex network of folded fractal feedback loops. Cyclic processes produced artifacts and infrastructures to support communication between the components and agents of Path. As a whole, Path spoke to the possibilities for i
APA, Harvard, Vancouver, ISO, and other styles
26

Ogrodnik, Marcel Bogdan. "Markovian rough paths." Thesis, Imperial College London, 2016. http://hdl.handle.net/10044/1/51500.

Full text
Abstract:
The accumulated local p-variation functional, originally presented by Cass et al. (2013), arises naturally in the theory of rough paths in estimates both for solutions to rough differential equations (RDEs), and for the higher-order terms of the signature (or Lyons lift). In stochastic examples, it has been observed that the tails of the accumulated local p-variation functional typically decay much faster than the tails of classical p-variation. This observation has been decisive, e.g. for problems involving Malliavin calculus for Gaussian rough paths as illustrated in the work by Cass et al.
APA, Harvard, Vancouver, ISO, and other styles
27

Mirheidari, Seyed Ali. "Confused by Path: Analysis of Path Confusion Based Attacks." Doctoral thesis, Università degli studi di Trento, 2020. http://hdl.handle.net/11572/280512.

Full text
Abstract:
URL parser and normalization processes are common and important operations in different web frameworks and technologies. In recent years, security researchers have targeted these processes and discovered high impact vulnerabilities and exploitation techniques. In a different approach, we will focus on semantic disconnect among different framework-independent web technologies (e.g., browsers, proxies, cache servers, web servers) which results in different URL interpretations. We coined the term “Path Confusion” to represent this disagreement and this thesis will focus on analyzing enabling fact
APA, Harvard, Vancouver, ISO, and other styles
28

Mirheidari, Seyed Ali. "Confused by Path: Analysis of Path Confusion Based Attacks." Doctoral thesis, Università degli studi di Trento, 2020. http://hdl.handle.net/11572/280512.

Full text
Abstract:
URL parser and normalization processes are common and important operations in different web frameworks and technologies. In recent years, security researchers have targeted these processes and discovered high impact vulnerabilities and exploitation techniques. In a different approach, we will focus on semantic disconnect among different framework-independent web technologies (e.g., browsers, proxies, cache servers, web servers) which results in different URL interpretations. We coined the term “Path Confusion” to represent this disagreement and this thesis will focus on analyzing enabling fact
APA, Harvard, Vancouver, ISO, and other styles
29

Marques, Felipe de Souza. "Um algoritmo formal para remoção de redundâncias." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2003. http://hdl.handle.net/10183/8498.

Full text
Abstract:
Os algoritmos para síntese de circuitos digitais em geral visam a melhoria de uma função de custo composta de quatro critérios: área, desempenho, potência e testabilidade. Normalmente estes algoritmos conseguem uma relação de compromisso para a otimização de dois critérios. Efeitos indesejáveis também podem surgir com a otimização de um destes critérios. Por exemplo, as otimizações de desempenho podem introduzir falhas de colagem não testáveis (redundâncias) em um circuito, reduzindo a sua testabilidade. Muitos algoritmos de síntese lógica exploram propriedades específicas de determinadas funç
APA, Harvard, Vancouver, ISO, and other styles
30

Orozco, Eric 1972. "Three paths to Zion." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/30223.

Full text
Abstract:
Thesis (M. Arch.)--Massachusetts Institute of Technology, Dept. of Architecture, 2005.<br>Includes bibliographical references (p. 69-71).<br>This thesis project pursues the strategies to create urban design interventions that preserve and encourage multi-religious harmony in the contested sacred topography of Jerusalem. First, I observed the environmental and social qualities of religious coexistence by studying a pilgrimage site in Jerusalem currently shared by groups from the three monotheistic faiths, the Masjid al-Nabi Da'ud (the Mosque of the Prophet David) on Jerusalem's present-day Mt.
APA, Harvard, Vancouver, ISO, and other styles
31

Spatscheck, Oliver. "Escort: Securing scout paths." Diss., The University of Arizona, 1999. http://hdl.handle.net/10150/289020.

Full text
Abstract:
It is becoming increasingly common to find special-purpose communication devices--Information Appliances--attached to the Internet. Information appliances include network-attached disks, cameras, and displays; web and file servers; set-top boxes; application routers and firewalls. Many of these systems perform mission critical functions, like company web servers or firewalls, but are built on general purpose operating systems that do not protect them with adequate security measures. This work introduces Escort, a security architecture for the Scout operating system. Escort provides a set of m
APA, Harvard, Vancouver, ISO, and other styles
32

Iraschko, Rainer R. "Path restorable networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0012/NQ34872.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Miller, Cara M. "The path : stories." Virtual Press, 2008. http://liblink.bsu.edu/uhtbin/catkey/1391233.

Full text
Abstract:
This collection of short stories explores the depths of human emotions as seemingly unrelated characters in an Indiana community react to tragedies, including death, divorce, abuse, financial struggles, and assault. Each character experiences intense isolation and hopelessness, and some question the presence of a God who would allow such suffering. Not only are the protagonists' stories unique, but the characters themselves are diverse, encompassing different ages, genders, races, and class levels. Each story is linked by a cause-and-effect in which one person's reaction to grief creates trage
APA, Harvard, Vancouver, ISO, and other styles
34

De, Smith Michael John. "Distance and path." Thesis, University College London (University of London), 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.408458.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Calhoun, Marie Elizabeth. "Path and Place." Thesis, Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/53059.

Full text
Abstract:
“Path and Place” is the design of an ‘infill’ building, primarily residential, on a vacant site in New York City. The central concern was an attempt to satisfy the elusive criteria for a home as a special place. Secondarily, it was important enhance the community with a lively place. Emphasis was placed on access to outdoor areas such as the courtyards, roof gardens, and balconies. ln these areas. it is possible to have a range of interaction among residents and neighbors. One may be an observer of the public scene, or a participant in a shared garden, or a shopper in a public market. The s
APA, Harvard, Vancouver, ISO, and other styles
36

El, Kateb Nada. "Carving the Path." Thesis, KTH, Arkitektur, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-298492.

Full text
Abstract:
This project investigates the role of the built environment in securing our practical and social needs. This is done based on research in the context of Cairo, Egypt. Banati foundation is an organisation established in 2010 which works on the rehabilitation and social reintegration of children in street situations in Cairo. This project takes Banati Foundation as its case study, offering architectural solutions to its process of social and psychological rehabilitation.This project required thorough research methodologies including primary fieldwork such as interviews and site visits, making it
APA, Harvard, Vancouver, ISO, and other styles
37

Song, Bo. "The Transcendental Path." Doctoral thesis, Humboldt-Universität zu Berlin, 2019. http://dx.doi.org/10.18452/19648.

Full text
Abstract:
Die vorliegende Arbeit beschäftigt sich mit Kants Projekt der transzendentalen Deduktion der reinen Verstandesbegriffe hinsichtlich ihrer Fragen, Annahmen, und Argumente. Anders als viele Interpreten schlage ich vor, dass Kants Fragestellung in der transzendentalen Deduktion im metaphysischen Sinne meta-semantisch ist. Indem er alle möglichen konkurrierenden Theorien ablehnt, zeigt Kant überzeugend die Notwendigkeit seiner kopernikanischen Lösung und die Plausibilität der Auffassung von „keiner notwendigen Verknüpfung ohne notwendige Instanziierung“. Ich werde argumentiert, dass Kant verschied
APA, Harvard, Vancouver, ISO, and other styles
38

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 text
Abstract:
Planners who are involved in locational decision making often use raster-based geographic information systems (GIS) to quantify the value of land in terms of suitability or cost for a certain use. From a computational point of view, this process can be seen as a transformation of one or more sets of values associated with a grid of cells into another set of such values through a function reflecting one or more criteria. While it is generally anticipated that different transformations lead to different ‘best’ locations, little has been known on how such differences arise (or do not arise). Exam
APA, Harvard, Vancouver, ISO, and other styles
39

Giusti, Igor. "The Transformation of the Body Through Spiritual Somatic Liquid-like Phenomena in the Path to Enlightenment, or Union with God, in Eight Mystical Paths| A Comparative Analysis." Thesis, California Institute of Integral Studies, 2019. http://pqdtopen.proquest.com/#viewpdf?dispub=13427835.

Full text
Abstract:
<p> What if it was possible to attain enlightenment, or union with God, in the physical body? What if instead of using meditation or prayer to merely transcend embodied existence, practitioners were to transform the experience of their body in order to bring a sense of transcendence into their very physicality and the world itself? These questions are timely. There is much dialogue around the relationship of enlightenment, or union with God, and the body. Using a hermeneutic methodology, this study first explores 8 spiritual concepts (in 8 different spiritual traditions) that refer to subtle s
APA, Harvard, Vancouver, ISO, and other styles
40

Yamada, Y., H. Hasegawa, and K. Sato. "Survivable hierarchical optical path networks employing waveband and wavelength path protection." IEEE, 2009. http://hdl.handle.net/2237/13985.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Magrans, Fontrodona Francesc Xavier. "Vibroacoustic coupling and transmission paths." Doctoral thesis, Universitat Politècnica de Catalunya, 2018. http://hdl.handle.net/10803/664633.

Full text
Abstract:
This dissertation deals with four topics. The first three are in the same environment, the transmission paths. The fourth refers to the synthesis of subsystems and more specifically to two subsystems linked by any number of elastic elements. In the first topic it is proved that the solution of any linear mechanical system can be expressed as a linear combination of signal transmission paths. This is done in the framework of the Global Transfer Direct Transfer (GTDT) formulation for vibroacoustic problems. Transmission paths are expressed as powers of the transfer matrix. The key idea of the
APA, Harvard, Vancouver, ISO, and other styles
42

Zhao, Hong Jun. "Towards online shortest paths computation." Thesis, University of Macau, 2011. http://umaclib3.umac.mo/record=b2550689.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Chénier, Christian. "Shortest paths in weighted polygons." Thesis, University of Ottawa (Canada), 1996. http://hdl.handle.net/10393/10034.

Full text
Abstract:
Consider a polygon P and two points $p,\ q\in P.$ Suppose that to move from p to q, we can travel along the edges of P or through the interior of P. Assume that the speed at which we can travel along the edges of P is one unit per second, and the travel speed through the interior of P is 1/s units per seconds ($s>1$). The problem consists of finding the shortest path between p and q. We solve this problem in O(n) time for convex polygons. For simple polygons, we show two algorithms. The first algorithm runs in O(E log n) time using O(E) space (where E is the size of the visibility of P). The s
APA, Harvard, Vancouver, ISO, and other styles
44

Sheppardson, Laura. "Disjoint paths in planar graphs." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/29862.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Gao, Guo-Gang. "Planning shortest paths amongst discs." Thesis, McGill University, 1988. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=64080.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Arrayas, Manuel. "Optimal paths and large fluctuations." Thesis, Lancaster University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286978.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Victoir, Nicolas B. "From cubature to rough paths." Thesis, University of Oxford, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.270187.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Moffat, Alistair. "Fast algorithms for shortest paths." Thesis, University of Canterbury. Computer Science, 1985. http://hdl.handle.net/10092/7926.

Full text
Abstract:
The problem of finding all shortest paths in a non-negatively weighted directed graph is addressed, and a number of new algorithms for solving this problem on a graph of n vertices and m edges are given. The first of these requires in the worst case min { 2mn, nᶟ } + O(n²˙⁵ ) addition and binary comparisons on path and edge costs, improving the previous bound (Dantzig, 1960) of n³ + O(n²logn) operations in a computational model where addition and comparison are the only operations permitted on path costs. The second algorithm presented, and the main result of this thesis, has an expected
APA, Harvard, Vancouver, ISO, and other styles
49

Watson, Derrick L. "Poietic hermeneutics : making local paths." Thesis, University of Chester, 2017. http://hdl.handle.net/10034/620601.

Full text
Abstract:
This thesis argues for poietic hermeneutics as a work of gathering and re-siting which intervenes in the local material-discursive site. This is an interruptive tactic of the local church, seeking the flourishing of here through transitory, non-hegemonic acts of re-making. In developing this tactic I draw a critique of a practical theology discourse which, I argue, masks acts of making, with a consequent loss of attentiveness to materiality and a normative commitment to the development of practices internal to the church and the practitioner.
APA, Harvard, Vancouver, ISO, and other styles
50

Parandehgheibi, Marzieh. "Survivable paths in multilayer networks." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/72646.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center; and, (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (p. 75-77).<br>We consider the problem of protection in multilayer networks. In single-layer net- works, a pair of disjoint paths
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Patha' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography