Tesis sobre el tema "Coverage problem"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Coverage problem".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Hoesel, Stan Van y Albert Wagelmans. "On the P-coverage Problem on the Real Line". Massachusetts Institute of Technology, Operations Research Center, 1991. http://hdl.handle.net/1721.1/5221.
Texto completoBaydogan, Mustafa Gokce. "Energy Efficient Coverage And Connectivity Problem In Wireless Sensor Networks". Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12609688/index.pdf.
Texto completoSambhara, Chaitanya. "P-Percent Coverage in Wireless Sensor Networks". Digital Archive @ GSU, 2008. http://digitalarchive.gsu.edu/cs_theses/56.
Texto completoOrbay, Berk. "An Interactive Evolutionary Algorithm For The Multiobjective Relocation Problem With Partial Coverage". Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613196/index.pdf.
Texto completoYin, Li. "Sensor network coverage and data aggregation problem: solutions toward the maximum lifetime". Diss., Rolla, Mo. : University of Missouri-Rolla, 2007. http://scholarsmine.mst.edu/thesis/pdf/Yin_09007dcc803c1aa0.pdf.
Texto completoVita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed November 26, 2007) Includes bibliographical references (p. 51-55).
Vu, Chinh Trung. "An Energy-Efficient Distributed Algorithm for k-Coverage Problem in Wireless Sensor Networks". Digital Archive @ GSU, 2007. http://digitalarchive.gsu.edu/cs_theses/40.
Texto completoToreyen, Ozgun. "Hierarchical Maximal Covering Location Problem With Referral In The Presence Of Partial Coverage". Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12608771/index.pdf.
Texto completoHsieh, Pei-Shan y Pei-Shan Hsieh. "Investigating the Maximal Coverage by Point-based Surrogate Model for Spatial Facility Location Problem". Diss., The University of Arizona, 2016. http://hdl.handle.net/10150/623182.
Texto completoDuldig, Paul. "The extent of private health insurance coverage in Australia : public problem or private choice? /". Title page, contents and introduction only, 1985. http://web4.library.adelaide.edu.au/theses/09EC/09ecd881.pdf.
Texto completoSilav, Ahmet. "Bi-objective Facility Location Problems In The Presence Of Partial Coverage". Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/2/12610681/index.pdf.
Texto completoRahim, Fatih. "A Variable Neighborhood Search Procedure For The Combined Location With Partial Coverage And Selective Traveling Salesman Problem". Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/3/12611949/index.pdf.
Texto completoVu, Chinh Trung. "Distributed Energy-Efficient Solutions for Area Coverage Problems in Wireless Sensor Networks". Digital Archive @ GSU, 2009. http://digitalarchive.gsu.edu/cs_diss/37.
Texto completoWei, Hu. "SOLVING CONTINUOUS SPACE LOCATION PROBLEMS". The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1205514715.
Texto completoZhang, Xiao. "Confidence Intervals for Population Size in a Capture-Recapture Problem". Digital Commons @ East Tennessee State University, 2007. https://dc.etsu.edu/etd/2022.
Texto completoPazand, Babak. "Location-free node scheduling schemes for energy efficient, fault tolerant and adaptive sensing in wireless sensor networks". University of Western Australia. School of Computer Science and Software Engineering, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0185.
Texto completoDürr, Hans-Bernd. "Distributed Positioning of Autonomous Mobile Sensors with Application to the Coverage Problem : A Game Theoretic Approach to Multi-Agent Systems". Thesis, KTH, Reglerteknik, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-105128.
Texto completoKaraman, Mesut. "A Genetic Algorithm For The Multi-level Maximal Covering Ambulance Location Problem". Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/3/12610099/index.pdf.
Texto completoresponsiveness&rsquo
and &lsquo
preparedness&rsquo
, are searched for
and our approaches with multi-level coverage are compared against the multiple coverage approaches in terms of these performance measures.
Kantharaj, Krithica. "Evaluating Coverage Models for Emergency Services: A Case Study of Emergency Siren Placement in Lucas County, OH". University of Toledo / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1384525360.
Texto completoPolat, Esra. "A Location And Routing-with-profit Problem In Glass Recycling". Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12610221/index.pdf.
Texto completoAguiar, Alexei Barbosa de. "Tackling the problem of dynamic coverage and connectivity in wireless sensor networks with an extended version of the generate an dsolve methodology". Universidade de Fortaleza, 2009. http://dspace.unifor.br/handle/tede/84413.
Texto completoWireless sensor networks (WSNs) are very usefull in a wide range of applications. However, the sensor nodes that composes these WSNs are very limited devices. Their batteries cannot supply energy for a lifetime as long as desired. In a particular scenario, the areas where these devices are deployed are inaccessible so these batteries replacements are unfeasible. In this situation the energy consumption plays a very important role and must be well optimized. Recent literature presented an integer programming model for optimizing this energy consumption. The Generate and Solve is a new hybrid methodology. The integrative collaboration of Genetic Algorithms and Linear Integer Programming merged their strong points and offered excellent results on cutting and packing problem domains. However, its original implementation had some problems which limits the results, one of them is the density explosion. This methodology has been adapted and enhanced to fix these problems and extend the capacity of this model to larger problem instances. Thus, the WSN lifetime can be much longer than before. Comparing the results against literature, the WSN lifetime planned by Generate and Solve is 150% longer and it is capable of handling problem instances with a number of sensor nodes 125% larger. Keywords: Wireless sensor networks, Optimization, Hybridization, Genetic Algorithms, Linear Integer Programming.
Redes de sensores sem fios (RSSF) são muito úteis em uma ampla gama de aplicações. Entretanto, os nós sensores que compõem essas RSSF's são dispositivos muito limitados. Suas baterias não podem suprir a energia de uma vida útil tão longa quanto desejada. Em um cenário particular, as áreas nas quais estes dispositivos são instalados são inacessíveis, logo, as trocas dessas baterias são inviáveis. Nesta situação, o consumo de energia tem um papel muito importante e deve ser bem otimizado. Uma literatura recente apresentou um modelo de programação inteira para otimizar este consumo de energia. A Gerar e Resolver é uma nova metodologia híbrida. A colaboração integrativa entre algoritmos genéticos e programação linera inteira fundiu os seus pontos fortes e ofereceu exelentes resultados em domínios de cortes e empacotamento. Entretanto, sua implementação original teve alguns problemas os quais limitam os resultados, um deles é a explosão da densidade. Esta metodologia foi adaptada e melhorada para corrigir esses problemas e extender a capacidade deste modelo para instancias de problemas maiores. Desta forma, a vida útil da RSSF pode ser bem maior que anteriormente. Comparando os resultados com a literatura, o tempo de vida da RSSF planejada pela Gerar e Resolver é 150% mais longa e ela é capaz de lidar com instâncias de problemas com um número de nós sensores 125% maior. Palavras-chave: Redes de sensores sem fios, Otimização, Hibridização, Algorítmos Genéticos, Programação Linear Inteira.
Araújo, André Ricardo Melo. "Heurísticas para o problema de cobertura em redes de sensores sem fio hierárquicas com sorvedouro móvel". Universidade Federal do Amazonas, 2013. http://tede.ufam.edu.br/handle/tede/2906.
Texto completoFAPEAM - Fundação de Amparo à Pesquisa do Estado do Amazonas
Wireless Sensor Network (WSN) is a special kind of ad hoc networks composed of devices capable of processing, storing, sensing the environment, and transmitting data via wireless communication interface. The sensor nodes have several limitations, among them the capacity of energy because to the reduced size. For this reason, many searches have been done with a view to improving the energy consumption of sensor nodes. This work aims to address the Problem of Coverage, Clustering and Routing with Mobile Sink (PCAR-SM, in portuguese Problema de Cobertura, Agrupamento e Roteamento com Sorvedouro Móvel) in WSN with mobile sink consisting of: given a set of sensor nodes and a monitoring area, develop algorithms to find the best subset of sensor nodes to cover the monitoring area, group them in a smaller number of clusters and find the shortest route to mobile sink navigate. The PCAR-SM is a strategy used to reduce the energy consumption of sensor nodes, data collisions, interference and redundant data in networks with high concentration of sensor nodes per area. The purpose of this paper is to solve each problem separately and together, in order to evaluate the impact of each problem on the other. The Coverage Problem has been solved with two metaheuristics: an Genetic Algorithm (GA) and a Greedy Randomized Adaptive Search Procedure (GRASP) algorithm. In the latter we used two representations of solution: (a) representation by sensor, where each element of the solution vector represents a sensor node that must be switched on or off; (b) representation by demand, where each element of the solution vector represents a demand point will indicate which sensor node cover it. The AG uses only the representation by demand. The computational results for Coverage Problem used the benchmark of Beasley s OR Library and it was possible seen that the GRASP with representation by demand achieved better results than the GA and the GRASP with representation by sensor when the optimization criterion is to minimize the total cost of each sensor node used in the solution. For Clustering Problem was created approach of virtual grids. In this approach, we divide the area into grids and clusters are formed by a set of adjacent grids (maximum 5 grids in group) forming a cross schematic. The aim of the problem is to minimize the number of clusters in the area. With this approach, we can model the Clustering Problem as a Set Cover Problem (SCP) without overlapping (an element does not belong to more than one set), which was treated by a greedy heuristic called Greedy Clustering Algorithm (GCA). The virtual grids proved to be a good solution because it is simple to identify a node which grid it belongs. Its simplicity also makes it a appropriate method for a distributed version. The Routing Problem of sink was modeled as the Travelling Salesman Problem (TSP), where the mobile sink part of a corner of the monitoring area, runs through the area visiting all clusters and returns to the starting point. For this, we propose two greedy approaches based on nearest neighbor, the Routing Greedy Algorithm - Center (RGA-C) and Routing Greedy Algorithm - Border (RGA-B). The route of the sink was also solved by a heuristic based on algorithm Centralized Spatial Partitioning (CSP). In CSP approach, the route is fixed and reminds the movement of a snake. The results show that fixed route produces a path with smaller size compared to the greedy heuristic for TSP. We analyze also the PCAR-SM, creating heuristic strategies. The union of the Clustering Problem and Routing Problem proved more beneficial in relation to the size of the sink s route. The union of Coverage Problem and Clustering Problem only proved beneficial when the communication radius was about 3,9 times greater than the sensing radius. Our results show that solve problems together allows some changes in the algorithms will lead to better results.
As Redes de Sensores Sem Fio (RSSFs) são um tipo especial de redes ad hoc constituídas por dispositivos capazes de processar, armazenar, sensoriar o ambiente e transmitir dados via interface de comunicação sem fio, denominados nós sensores. Os nós sensores possuem várias limitações, dentre elas, a capacidade de energia devido ao tamanho reduzido. Por isto, muitas pesquisas foram feitas tendo em vista a melhoria no consumo de energia dos nós sensores. Este trabalho tem como objetivo tratar o Problema de Cobertura, Agrupamento e Roteamento com Sorvedouro Móvel (PCAR-SM) em RSSF com nó sorvedouro móvel, que consiste em: dado um conjunto de nós sensores e uma área de monitoramento, desenvolver algoritmos para encontrar o melhor subconjunto de nós sensores que cubra a área de monitoramento, juntá-los no menor número de grupos possíveis e encontrar a menor rota para um nó sorvedouro móvel percorrer. O PCAR-SM é uma estratégia utilizada para diminuir o consumo de energia dos nós sensores, a colisão de dados, as interferências e os dados redundantes em redes com alta concentração de nós sensores por área. A proposta deste trabalho é resolver cada problema separadamente e em conjunto, de modo a avaliar o impacto de cada problema na solução do outro. O Problema de Cobertura foi resolvido com duas metaheurísticas: um Algoritmo Genético (AG) e um algoritmo Greedy Randomized Adaptive Search Procedure (GRASP). Neste último foram utilizadas duas representações de solução: (a) representação por sensor, onde cada elemento do vetor de solução representa um nó sensor que estará ligado ou desligado; (b) representação por demanda, onde cada elemento do vetor de solução representa um ponto de demanda no qual indicará qual o nó sensor o cobre. O AG utiliza apenas a representação por demanda. Os resultados computacionais para o Problema de Cobertura utilizaram o benchmark da Beasley s OR Library e foi possível constatar que o GRASP com representação por demanda obteve melhores resultados que o AG e o GRASP com representação por sensor quando o critério de otimização é minimizar a soma total dos custos de cada nó sensor utilizado na solução. Para o Problema de Agrupamento foi criada uma abordagem de grades virtuais. Nesta abordagem dividimos a área em grades e os grupos são formados por um conjunto de grades adjacentes (no máximo 5 grades) formando um esquema de cruz. O objetivo do problema é minimizar o número de grupos na área. A partir desta abordagem, pode-se modelar o Problema de Agrupamento como um Problema de Cobertura de Conjuntos (PCC) sem sobreposição (um elemento não pertence a mais de um conjunto), que foi tratada por uma heurística gulosa denominada Greedy Clustering Algorithm (GCA). Os grades virtuais provou ser uma boa solução por ser simples para um nó identificar a qual grade ele pertence. Sua simplicidade ainda o torna uma método adequado para uma versão distribuída. O Problema de Roteamento do nó sorvedouro foi modelado como o Problema do Caixeiro Viajante (PCV), onde o nó sorvedouro móvel parte de um canto da área de monitoramento, percorre a área visitando todos os grupos e retorna ao ponto inicial. Para isto, propomos duas abordagens gulosas baseadas no vizinho mais próximo, o Routing Greedy Algorithm - Center (RGA-C) e o Routing Greedy Algorithm - Border (RGA-B). A rota do nó sorvedouro também foi resolvida por uma heurística baseada no algoritmo Centralized Spatial Partitioning (CSP). Na abordagem CSP, a rota é fixa e lembra o movimento de uma cobra. Os resultados mostram que a rota fixa gera um percurso com tamanho menor em comparação com as heurísticas gulosas para o PCV. Analisamos, ainda, o PCAR-SM, criando estratégias heurísticas. Aunião dos Problema de Agrupamento e Roteamento, provou ser mais benéfica em relação ao tamanho da rota do nó sorvedouro, já a união do Problema de Cobertura com o Problema de Agrupamento só mostrou ser benéfica quando o raio de comunicação era aproximadamente 3, 9 vezes maior que o raio de sensoriamento. Nossos resultados, mostram que resolver os problemas em conjunto permite que algumas mudanças nos algoritmos levem a melhores resultados.
Hua, Liyan. "Shortest Path - Capacitated Maximum Covering Problems". The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1275477591.
Texto completoConradi, Michael C. "The social construction of squeegee kids as a law and order problem in neo-conservative Ontario, a content analysis of press coverage, 1995-1998". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ60674.pdf.
Texto completoMohammad, Maruf. "Cellular diagnostic systems using hidden Markov models". Diss., Virginia Tech, 2003. http://hdl.handle.net/10919/29520.
Texto completoPh. D.
Mohammad, Maruf H. "Cellular diagnostic systems using hidden Markov models". Diss., Virginia Tech, 2006. http://hdl.handle.net/10919/29520.
Texto completoPh. D.
Matos, Inês Pereira de. "Limited range coverage problems". Doctoral thesis, Universidade de Aveiro, 2009. http://hdl.handle.net/10773/2946.
Texto completoTal como o título indica, esta tese estuda problemas de cobertura com alcance limitado. Dado um conjunto de antenas (ou qualquer outro dispositivo sem fios capaz de receber ou transmitir sinais), o objectivo deste trabalho é calcular o alcance mínimo das antenas de modo a que estas cubram completamente um caminho entre dois pontos numa região. Um caminho que apresente estas características é um itinerário seguro. A definição de cobertura é variável e depende da aplicação a que se destina. No caso de situações críticas como o controlo de fogos ou cenários militares, a definição de cobertura recorre à utilização de mais do que uma antena para aumentar a eficácia deste tipo de vigilância. No entanto, o alcance das antenas deverá ser minimizado de modo a manter a vigilância activa o maior tempo possível. Consequentemente, esta tese está centrada na resolução deste problema de optimização e na obtenção de uma solução particular para cada caso. Embora este problema de optimização tenha sido investigado como um problema de cobertura, é possível estabelecer um paralelismo entre problemas de cobertura e problemas de iluminação e vigilância, que são habitualmente designados como problemas da Galeria de Arte. Para converter um problema de cobertura num de iluminação basta considerar um conjunto de luzes em vez de um conjunto de antenas e submetê-lo a restrições idênticas. O principal tema do conjunto de problemas da Galeria de Arte abordado nesta tese é a 1-boa iluminação. Diz-se que um objecto está 1-bem iluminado por um conjunto de luzes se o invólucro convexo destas contém o objecto, tornando assim este conceito num tipo de iluminação de qualidade. O objectivo desta parte do trabalho é então minimizar o alcance das luzes de modo a manter uma iluminação de qualidade. São também apresentadas duas variantes da 1-boa iluminação: a iluminação ortogonal e a boa !-iluminação. Esta última tem aplicações em problemas de profundidade e visualização de dados, temas que são frequentemente abordados em estatística. A resolução destes problemas usando o diagrama de Voronoi Envolvente (uma variante do diagrama de Voronoi adaptada a problemas de boa iluminação) é também proposta nesta tese.
As the title implies, this thesis studies limited range coverage problems. Given a set of antennas (or any wireless device able to send or receive some sort of signal), the objective of the discussion that follows is to calculate the antennas’ minimum range so that a path between two points within a region is covered by the antennas, a path known as a safe route. The definition of coverage is variable and depends on the applications. In some instances, for example, when monitoring is critical as in the case of fires or military, the definition of coverage necessarily involves the use of multiple antennas to increase the effectiveness of monitoring. However, it is also desirable to extend a network’s lifespan, normally achieved by minimising the antennas’ range. Therefore the focus of this thesis will be the resolution of this dual problem and an affective solution is offered for each case. Although this question has been researched as an issue of coverage, it is also possible to establish a relation between coverage and illumination and visibility, known as Art Gallery problems. To conceptualise coverage problems as Art Gallery problems, all that is needed is to consider a set of lights instead of a set of antennas, which are subject to a similar set of restrictions. The main focus of the Art Gallery problems addressed in this thesis is 1-good illumination. An object is 1-well illuminated if it is fully contained by the convex hull of a set of lights, making this a type of quality illumination. The objective of the discussion that follows is therefore to minimise the lights’ range whilst maintaining a quality illumination. Moreover, two variants of 1-good illumination are also presented: orthogonal good illumination and good ! -illumination. The latter being related to data depth problems and data visualisation that are frequently used in statistics. The resolution of these problems using the Embracing Voronoi diagram (a variant of Voronoi diagrams adapted to good illumination) is also discussed in this thesis.
Deshpande, Ajay A. "Coverage problems in mobile sensing". Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/46485.
Texto completoIncludes bibliographical references (p. 177-183).
Sensor-networks can today measure physical phenomena at spatial and temporal scales that were not achievable earlier, and have shown promise in monitoring the environment, structures, agricultural fields and so on. A key challenge in sensor-networks is the coordination of four actions across the network: measurement (sensing), communication, motion and computation. The term coverage is applied to the central question of how well a sensor-network senses some phenomenon to make inferences. More formally, a coverage problem involves finding an arrangement of sensors that optimizes a coverage metric. In this thesis we examine coverage in the context of three sensing modalities. The literature on the topic has thus far focused largely on coverage problems with the first modality: static event-detection sensors, which detect purely binary events in their immediate vicinity based on thresholds. However, coverage problems for sensors which measure physical quantities like temperature, pressure, chemical concentrations, light intensity and so on in a network configuration have received limited attention in the literature. We refer to this second modality of sensors as estimation sensors; local estimates from such sensors can be used to reconstruct a field. Third, there has been recent interest in deploying sensors on mobile platforms. Mobility has the effect of increasing the effectiveness of sensing actions. We further classify sensor mobility into incidental and intentional motion. Incidentally mobile sensors move passively under the influence of the environment, for instance, a floating sensor drifting in the sea. We define intentional mobility as the ability to control the location and trajectory of the sensor, for example by mounting it on a mobile robot. We build our analysis on a series of cases. We first analyze coverage and connectivity of a network of floating sensors in rivers using simulations and experimental data, and give guidelines for sensor-network design. Second, we examine intentional mobility and detection sensors.
(cont.) We examine the problem of covering indoor and outdoor pathways with reconfigurable camera sensor-networks. We propose and validate an empirical model for detection behavior of cameras. We propose a distributed algorithm for reconfiguring locations of cameras to maximize detection performance. Finally, we examine more general strategies for the placement of estimation sensors and ask when and where to take samples in order to estimate an unknown spatiotemporal field with tolerable estimation errors. We discuss various classes of error-tolerant sensor arrangements for trigonometric polynomial fields.
by Ajay A. Deshpande.
Ph.D.
Fajčík, Martin. "Automatizace verifikace pomocí neuronových sítí". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363776.
Texto completoMatos, Daniel Ribeiro. "Um algoritmos distribuÃdo para escalonamento de sensores em RSSF". Universidade Federal do CearÃ, 2013. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12187.
Texto completoRedes de Sensores Sem Fio (RSSF) sÃo utilizadas em diversos tipos de aplicaÃÃes: desde casas inteligentes a aplicaÃÃes militares. RSSF possuem, em geral, severas restriÃÃes energÃticas - um sensor geralmente possui uma quantidade limitada de bateria e este nÃo à substituÃvel. Os sensores podem possuir uma certa redundÃncia de uma Ãrea sensoreada, uma vez que, quando os sensores sÃo distribuÃdos de forma aleatÃria, alguns sensores acabam ficando muito prÃximos, ou mesmo quando sÃo depositados de maneira determinÃstica, uma certa redundÃncia à necessÃria para prever a falha de alguns destes sensores. Neste trabalho, propomos um algoritmo distribuÃdo que faz um escalonamento de sensores ativos, de forma a reduzir a redundÃncia dos dados coletados e aumentar o tempo de vida da rede de sensores.
Wireless Sensor Networks (WSNs) are used in a lot of applications: from smart homes to military enviromnets. In general, WSNs has severe energy restrictions - a sensor usualy has a limited batery and itâs not replaceable. Distributing the sensor in a random mander can lead to a redundancy of some areas and this is desirable to support fail of some sensors. In this work, we propose an distributed algorithm to schedule active sensors to reduce the redundancy of data obtainned by the network and prolong the network lifetime.
Michel, David. "All Negative on the Western Front: Analyzing the Sentiment of the Russian News Coverage of Sweden with Generic and Domain-Specific Multinomial Naive Bayes and Support Vector Machines Classifiers". Thesis, Uppsala universitet, Institutionen för lingvistik och filologi, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-447398.
Texto completoKaldé, Nassim. "Robotic Coverage and Exploration as Sequential Decision-Making Problems". Thesis, Université de Lorraine, 2017. http://www.theses.fr/2017LORR0276/document.
Texto completoThe ability to intelligently navigate in an unknown environment is essential for mobile robots (Obstacle Avoidance (OA)). This is needed to explore and build a map of the environment (Active Mapping (AM)); this map will then support other tasks such as patrolling (Active Coverage (AC)). In this thesis, we focus on decision-making to plan the moves of autonomous robots in order to navigate, cover, or explore the environment. Therefore, we rely on the framework of Sequential Decision-Making (SDM) in Artificial Intelligence to propose two contributions that address: (1) decision processes for AC and AM and (2) long-term planning for AC. Furthermore, mobile robots recently started sharing physical spaces with humans to provide services such as cleaning the house. In such cases, robot behavior should adapt to dynamic aspects of the world. In this thesis, we are interested in deploying autonomous robots in such environments. Therefore, we propose two other contributions that address: (3) short-term AM in crowded environments and (4) clearest path OA in ambient environments
Matos, Daniel Ribeiro. "Um algoritmos distribuído para escalonamento de sensores em RSSF". reponame:Repositório Institucional da UFC, 2013. http://www.repositorio.ufc.br/handle/riufc/13353.
Texto completoSubmitted by Daniel Eduardo Alencar da Silva (dealencar.silva@gmail.com) on 2015-01-23T18:29:56Z No. of bitstreams: 1 2013_dis_drmatos.pdf: 2537544 bytes, checksum: 870eae75ce068b1ef961e23307dda2a9 (MD5)
Approved for entry into archive by Rocilda Sales(rocilda@ufc.br) on 2015-09-23T16:27:30Z (GMT) No. of bitstreams: 1 2013_dis_drmatos.pdf: 2537544 bytes, checksum: 870eae75ce068b1ef961e23307dda2a9 (MD5)
Made available in DSpace on 2015-09-23T16:27:30Z (GMT). No. of bitstreams: 1 2013_dis_drmatos.pdf: 2537544 bytes, checksum: 870eae75ce068b1ef961e23307dda2a9 (MD5) Previous issue date: 2013
Wireless Sensor Networks (WSNs) are used in a lot of applications: from smart homes to military enviromnets. In general, WSNs has severe energy restrictions - a sensor usualy has a limited batery and it’s not replaceable. Distributing the sensor in a random mander can lead to a redundancy of some areas and this is desirable to support fail of some sensors. In this work, we propose an distributed algorithm to schedule active sensors to reduce the redundancy of data obtainned by the network and prolong the network lifetime.
Redes de Sensores Sem Fio (RSSF) são utilizadas em diversos tipos de aplicações: desde casas inteligentes a aplicações militares. RSSF possuem, em geral, severas restrições energéticas - um sensor geralmente possui uma quantidade limitada de bateria e este não é substituível. Os sensores podem possuir uma certa redundância de uma área sensoreada, uma vez que, quando os sensores são distribuídos de forma aleatória, alguns sensores acabam ficando muito próximos, ou mesmo quando são depositados de maneira determinística, uma certa redundância é necessária para prever a falha de alguns destes sensores. Neste trabalho, propomos um algoritmo distribuído que faz um escalonamento de sensores ativos, de forma a reduzir a redundância dos dados coletados e aumentar o tempo de vida da rede de sensores.
Yazdan, Panah Arian. "Nonuniform Coverage with Time-Varying Risk Density Function". Thesis, Université d'Ottawa / University of Ottawa, 2015. http://hdl.handle.net/10393/33007.
Texto completoBadau, Estera-Tabita. "De la mise à l’épreuve de l’alimentation par l’antibiorésistance au développement des concepts sans antibiotique et One Health ˸ publicisation et communication en France et aux États-Unis". Thesis, Sorbonne Paris Cité, 2019. http://www.theses.fr/2019USPCA039.
Texto completoIn a cross-country perspective between France and the United States, this research analyses the process of publicizing the links between antibiotic resistance and food, as well as its contribution to the development of the antibiotic free production and the implementation of the One Health approach. Starting with the awareness of the antibiotic use in livestock consequences, the study relies on the pragmatist approach of the constitution of the public problems. It is based on wide corpora composed by documents published between 1980 and 2016 (written press, institutional literature and semi-directive interviews). The analysis method uses textometric tools derived from discourse analysis and focuses on the emergence of formulas that name the problem, its causes and its solutions. The comparison uncovers an opposite process between the two countries. In France, this process is part of a top-down approach and is characterized by a late publicization following the European and international health authorities’ initiatives. The consumer associations taking over the problem, as well as the agri-food actors’ commitment to the antibiotic free production, is very recent. In the United States, this process reveals a bottom-up model following a non-governmental organizations public constitution taking over the problem. Their mobilization has contributed to the development of the antibiotic free breeding programs, as well as to place the problem on the government agenda that launched a national plan in a One Health approach
Mohammad, Hossein Fallah Mostafa. "Coordinated Deployment of Multiple Autonomous Agents in Area Coverage Problems with Evolving Risk". Thesis, Université d'Ottawa / University of Ottawa, 2015. http://hdl.handle.net/10393/33164.
Texto completoEno, Daniel R. "Noninformative Prior Bayesian Analysis for Statistical Calibration Problems". Diss., Virginia Tech, 1999. http://hdl.handle.net/10919/27140.
Texto completoPh. D.
Ouedraogo, Lisa-Marie [Verfasser]. "Approaching Universal Health Coverage in Kenya : the Potential of integrating Community Based Health Insurance Schemes / Lisa-Marie Ouedraogo". Greifswald : Universitätsbibliothek Greifswald, 2017. http://d-nb.info/1129900789/34.
Texto completode, Menil Victoria. "Under-cover in Kenya : the contribution of non-state actors to mental health coverage". Thesis, London School of Economics and Political Science (University of London), 2014. http://etheses.lse.ac.uk/1017/.
Texto completoVieira, Deborah Luisa Detânico. "Planejamento da cobertura de redes móveis de quarta geração através de metaheurística híbrida". Universidade do Vale do Rio dos Sinos, 2017. http://www.repositorio.jesuita.org.br/handle/UNISINOS/6994.
Texto completoMade available in DSpace on 2018-04-12T13:49:50Z (GMT). No. of bitstreams: 1 Deborah Luisa Detânico Vieira_.pdf: 1504339 bytes, checksum: 49a2adc770aff79d216c818e22dea099 (MD5) Previous issue date: 2017-05-17
Nenhuma
Com a crescente demanda de serviços de voz e, principalmente, dados móveis se fez necessário o desenvolvimento das tecnologias de quarta geração (4G). O padrão Long Term Evolution (LTE), desenvolvido pela Third Generation Partnership Project (3GPP), foi escolhido pela International Telecommunications Union (ITU) como tecnologia para atender os requisitos da quarta geração de serviços móveis. Para as operadoras inserirem esta nova tecnologia em suas redes existentes, se faz necessário um estudo meticuloso de planejamento, muito embora, na prática, este planejamento seja desenvolvido de forma empírica. O problema de planejamento de redes é conhecido e bem estudado no ramo da computação, conhecido como problema de recobrimento de conjuntos e classificado, pela sua complexidade, como NP-difícil. Dadas as características diferenciadas da arquitetura da rede do LTE, este trabalho busca resolver o problema de planejamento de redes de quarta geração (4G), utilizando uma modelagem matemática aplicada a uma metaheurística híbrida, composta de Algoritmo Genético e Busca Tabu. Almejase resolver o problema de cobertura de uma determinada região, cobrindo a maior área possível com o menor número possível de Base Stations (BS), visando ao planejamento com maior assertividade e redução do custo de implantação da rede 4G.
With the constantly demand of voice services and mostly in mobile data, there was the need the development of the mobile services of fourth generation (4G). The pattern Long Term Evolution, developed by the Third Generation Partnership Project (3GPP) was chosen by the International Telecommunications Union (ITU) as technology to attend the requirements of the fourth generation of mobile services. For the mobile operators introduce and apply this new generation in their own existing networks, they need to do an extensive research and planning, even if, in practical means, it is applied using the empirical way. The network planning problem is widely known and studied in computing area as set-covering problem ans classified as NPhard. Due the unique characteristics of network architecture of LTE, this work aims to solve the mobile’s fourth generation planning problem using a mathematics modelling apply to a hybrid metaheuristics, composed with Genetic Algorithm and Tabu Search. It aims solve the coverage problem of a specific region, covering the largest area possible with the fewest number of Base Sations (BS) possible, seeking the best compliance and cost reduction of the LTE network deployment.
Göppel, Christine [Verfasser]. "Universal and equitable health coverage for adults aged 50 years or older with chronic illness in middle income countries / Christine Göppel". Berlin : Medizinische Fakultät Charité - Universitätsmedizin Berlin, 2017. http://d-nb.info/1133074596/34.
Texto completoWatanabe, Kohei. "Measuring bias in international news : a large-scale analysis of news agency coverage of the Ukraine crisis". Thesis, London School of Economics and Political Science (University of London), 2017. http://etheses.lse.ac.uk/3658/.
Texto completoZu, Guo. "Framing Pollution: An Analysis of the Coverage of Air Pollution in China in 2013 by ChinaDaily.com". Ohio University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1429698709.
Texto completoGallmann, Elena. "A critical appraisal of coverage and resource allocation decisions through the use of health technology assessment : evidence on orphan drugs from four countries". Thesis, London School of Economics and Political Science (University of London), 2015. http://etheses.lse.ac.uk/3433/.
Texto completoMueller, John Frederick. "An analysis of the correspondence of environmental coverage in Ohio's six major metropolitan newspapers to citizen perception of environmental problems". Ohio : Ohio University, 2006. http://www.ohiolink.edu/etd/view.cgi?ohiou1145420206.
Texto completoMueller, John F. "An Analysis of the Correspondence of Environmental Coverage in Ohio's Six Major Metropolitan Newspapers to Citizen Perception of Environmental Problems". Ohio University / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1145420206.
Texto completoCottle, Simon. "Television coverage of the inner city : an examination of the professional journalist's practices and production domain and their impact upon the public portrayal of the problems and issues of the inner city". Thesis, University of Leicester, 1990. http://hdl.handle.net/2381/34622.
Texto completoTong, Daoqin. "Continuous space facility location for covering spatial demand objects". Columbus, Ohio : Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1186686117.
Texto completoNguyen, Ngo Minh Thang. "Test case generation for Symbolic Distributed System Models : Application to Trickle based IoT Protocol". Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLC092.
Texto completoDistributed systems are composed of many distant subsystems. In order to achieve a common task, subsystems communicate both with the local environment by external messages and with other subsystems by internal messages through a communication network. In practice, distributed systems are likely to reveal many kinds of errors, so that we need to test them before reaching a certain level of confidence in them. However, testing distributed systems is complicated due to their intrinsic characteristics. Without global clocks, subsystems cannot synchronize messages, leading to non-deterministic situations.Model-Based Testing (MBT) aims at checking whether the behavior of a system under test (SUT) is consistent with its model, specifying expected behaviors. MBT is useful for two main steps: test case generation and verdict computation. In this thesis, we are mainly interested in the generation of test cases for distributed systems.To specify the desired behaviors, we use Timed Input Output Symbolic Transition Systems (TIOSTS), provided with symbolic execution techniques to derive behaviors of the distributed system. Moreover, we assume that in addition to external messages, a local test case observes internal messages received and sent by the co-localized subsystem. Our testing framework includes several steps: selecting a global test purpose using symbolic execution on the global system, projecting the global test purpose to obtain a local test purpose per subsystem, deriving unitary test case per subsystem. Then, test execution consists of executing local test cases by submitting data compatible following a local test purpose and computing a test verdict on the fly. Finally, we apply our testing framework to a case study issued from a protocol popular in the context of IoT
Kao, Jen-Hung y 高仁宏. "The Distribution Coverage Problem". Thesis, 2003. http://ndltd.ncl.edu.tw/handle/mf9g8e.
Texto completo中原大學
數學研究所
91
In natural, many things have rich mathematical structure. In this thesis, a possible method for constructing structures of natural is described. We first give the definition of distribution coverage, and our main topic: the ideal distribution coverage problem. These problems is trying to find the maximum volume when a distribution D is given. We provide proofs when |D| = 2,3, 4, and other results additionally. We also develop a algorithm, which performs for finding the coordinates of a distribution D.
Yang, Lan-Chih y 楊蘭智. "Sensor Deployment Algorithm for k-Angle Coverage Problem". Thesis, 2009. http://ndltd.ncl.edu.tw/handle/97375955554304512259.
Texto completo國立清華大學
資訊工程學系
97
Coverage problem is one of the most fundamental problems in wireless sensor networks since it reflects the sensing quality of a sensor network. Several coverage problems have been studied for different applications such as [1], [2] studies the coverage problem, and [12] discussed the barrier coverage problems. However, these works assume the sensor has Omni-directional sensing model which is not suitable in many applications such as video surveillance systems consisting of directional video sensors. In this thesis, we study a new coverage problem in wireless sensor networks. The k-angle coverage problem considers the problem using directional sensors which can only cover a limited angle and range. Given a set of targets to be monitored, the goal is to deploy minimal number of sensors to k-angle cover all the targets. We present a greedy algorithm to solve this problem. For this algorithm, we define three contribution functions to determine the location to deploy sensor. The proposed method greedily selects a maximal contribution location to deploy a sensor until the entire targets are k-angle covered. Simulation results exhibit the characteristic and performance of our algorithm. Based on the proposed algorithm, we develop a toolkit for emulating sensor deployment.