No description available.

No description available.

Due to wireless communication technologies, positioning technologies, and mobile computing develop quickly, mobile services are becoming practical and important on big spatiotemporal databases management. Mobile service users move only inside a spatial network, e.g. a road network. They often issue the K Nearest Neighbor (KNN) query to obtain data objects reachable through the road network. The challenge problem of mobile services is how to efficiently answer the data objects which user interest to the corresponding mobile users. Therefore, how to effectively modeling road networks, effectively indexing, and querying on the road networks have become a popular topic. Lu et. al. have proposed a road network model that captures the real-life road networks better than previous models. Then, based on their model, they have proposed a RNG (Road Network Grid) index for speeding up the KNN query on real-life road networks. The RNG index structure is a quad-tree structure and a point-based structure. However, in their model, they divide the double track road which U-turn is allowed at some parts. This modeling does not capture the real-life road networks accurately. Since they divide the road, this makes the number of points of the graph increase. The number of times of partitioning the graph increases. It increases the execution time of constructing the index structure. The format of the leaf node of the RNG index makes the search time increase. Moreover, the query processing on the RNG index structure has to visit the root repeatedly. This condition makes the search time increase. Therefore, in this thesis, we propose a network model that captures the real-life road networks. We do not have to divide the real-life roads when we map the real-life roads into graph. We map the real-life road networks into graph directly. Then, based on our network model, we propose an EBNA (Edge-Based Nine-Area tree) index structure to make the search time of obtaining the interest edge information quickly. The EBNA index structure is an edge-based index structure. We store all of the edge information on the leaf node. We can obtain the edge information directly. Each edge information entry has a pointer point to link edges. Links of each edge entry consist a graph. This graph makes the KNN query processing visit the root only one time. From our simulation result, we show that the performance of constructing the EBNA index is better than constructing the RNG index and the performance of the KNN query processing by using EBNA index is better than the KNN query processing by using RNG index.

Made available in DSpace on 2014-06-11T19:30:31Z (GMT). No. of bitstreams: 0 Previous issue date: 2007-05-31Bitstream added on 2014-06-13T18:40:50Z : No. of bitstreams: 1 vale_gm_dr_prud.pdf: 4712235 bytes, checksum: 3c9fc355145e1b53a82a40d43c327b83 (MD5) / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Atualmente, uma das mais importantes tecnologias de informação são os Sistemas de Informações Geográficas (SIG). Um SIG é destinado ao armazenamento, análise e exibição tanto de dados espaciais quanto dados não espaciais. Conseqüentemente, a fim de que um SIG possa funcionar de forma eficiente, são necessárias ferramentas que forneçam dinamismo na aquisição da informação, quando de sua construção ou atualização. A Fotogrametria Digital está entre as possíveis fontes de informação espacial. A fim de aumentar a densidade e velocidade na aquisição de tais informações, um maior grau de automatização das técnicas fotogramétricas é buscado. Seguindo esta tendência, este trabalho apresenta uma metodologia de complementação automática da malha viária rural. Esta metodologia divide-se em três passos básicos: 1) ordenação dos segmentos desconexos e desordenados de rodovia que compõem cada rodovia presente na imagem, via otimização em grafos; estes segmentos são previamente extraídos por uma metodologia de extração automática de segmentos de rodovia; 2) reconstrução das falhas de extração inerentes a cada rodovia, constituída no passo 1; e 3) reconhecimento e delineamento dos cruzamentos de rodovias. Na primeira etapa, os segmentos de rodovia são ordenados em ordem decrescente de comprimento e os pontos extremos de seus eixos médios são utilizados na construção de um grafo completo, no qual os nós e arestas são, respectivamente, os pontos extremos e as possíveis ligações entre eles. A partir deste grafo inicial estruturas chamadas árvores de permutações são geradas, possuindo como raízes os pontos extremos do atual segmento de rodovia mais longo (base). A busca ocorre à esquerda e à direita do atual segmento mais longo. / Nowadays, GIS (Geographical Information systems) is one of the most important information technologies. GIS is designed to store, analyze, and display spatial data as well non-spatial data. Consequently, in order to have a GIS working properly, it is necessary powerful tools for GIS data acquisition and updating. Digital Photogrammetry is one of the most important fields in spatial information data capture. In order to increase the density and the speed of spatial information capture processes, it is necessary to developed new photogrammetric tools with higher automation level. Following this tendency, this work proposes an automatic completion methodology of rural road networks. This methodology is subdivided into three basic steps: 1) ordering of disconnected and disordered road segments that belong to each road in the image by graph optimization; the road segments are previously extracted by a preexisting methodology for automatic road segment extraction; 2) reconstruction of the extraction gaps identified by the step 1; and 3) recognizing and delineation of the road crossings. In the first step, the road segments are ordered in decreasing order of length and the road segment centerline endpoints are used to construct a complete graph, where their nodes and edges are endpoints and relations between them, respectively. This graph are used to derive structures called permutation trees, having as roots the endpoints of the current longest road centerline segment (base). The searching is accomplished on the left and right sides of the current longest road segment. During the search procedure, two heuristics are used: the searching direction and the collinearity constraints. The tree edges that satisfy both heuristics are weighed by a weighing function that embodies geometric, radiometric, and topological road properties.

Resumo: Atualmente, uma das mais importantes tecnologias de informação são os Sistemas de Informações Geográficas (SIG). Um SIG é destinado ao armazenamento, análise e exibição tanto de dados espaciais quanto dados não espaciais. Conseqüentemente, a fim de que um SIG possa funcionar de forma eficiente, são necessárias ferramentas que forneçam dinamismo na aquisição da informação, quando de sua construção ou atualização. A Fotogrametria Digital está entre as possíveis fontes de informação espacial. A fim de aumentar a densidade e velocidade na aquisição de tais informações, um maior grau de automatização das técnicas fotogramétricas é buscado. Seguindo esta tendência, este trabalho apresenta uma metodologia de complementação automática da malha viária rural. Esta metodologia divide-se em três passos básicos: 1) ordenação dos segmentos desconexos e desordenados de rodovia que compõem cada rodovia presente na imagem, via otimização em grafos; estes segmentos são previamente extraídos por uma metodologia de extração automática de segmentos de rodovia; 2) reconstrução das falhas de extração inerentes a cada rodovia, constituída no passo 1; e 3) reconhecimento e delineamento dos cruzamentos de rodovias. Na primeira etapa, os segmentos de rodovia são ordenados em ordem decrescente de comprimento e os pontos extremos de seus eixos médios são utilizados na construção de um grafo completo, no qual os nós e arestas são, respectivamente, os pontos extremos e as possíveis ligações entre eles. A partir deste grafo inicial estruturas chamadas árvores de permutações são geradas, possuindo como raízes os pontos extremos do atual segmento de rodovia mais longo (base). A busca ocorre à esquerda e à direita do atual segmento mais longo. / Abstract: Nowadays, GIS (Geographical Information systems) is one of the most important information technologies. GIS is designed to store, analyze, and display spatial data as well non-spatial data. Consequently, in order to have a GIS working properly, it is necessary powerful tools for GIS data acquisition and updating. Digital Photogrammetry is one of the most important fields in spatial information data capture. In order to increase the density and the speed of spatial information capture processes, it is necessary to developed new photogrammetric tools with higher automation level. Following this tendency, this work proposes an automatic completion methodology of rural road networks. This methodology is subdivided into three basic steps: 1) ordering of disconnected and disordered road segments that belong to each road in the image by graph optimization; the road segments are previously extracted by a preexisting methodology for automatic road segment extraction; 2) reconstruction of the extraction gaps identified by the step 1; and 3) recognizing and delineation of the road crossings. In the first step, the road segments are ordered in decreasing order of length and the road segment centerline endpoints are used to construct a complete graph, where their nodes and edges are endpoints and relations between them, respectively. This graph are used to derive structures called permutation trees, having as roots the endpoints of the current longest road centerline segment (base). The searching is accomplished on the left and right sides of the current longest road segment. During the search procedure, two heuristics are used: the searching direction and the collinearity constraints. The tree edges that satisfy both heuristics are weighed by a weighing function that embodies geometric, radiometric, and topological road properties. / Orientador: Aluir Porfírio Dal Poz / Coorientador: Messias Meneguette Jr. / Banca: Júlio Kiyoshi Hasegawa / Banca: Aylton Pagamisse / Banca: Raul Queiroz Feitosa / Banca: Paulo Morelato França / Doutor

No description available.

No description available.

This paper investigates the feasibility of the construction of a sustainable mixed-use development from a 1950's commercial plaza. The specific commercial plaza under investigation was University Plaza in Dundas, Ontario. Incorporating sustainable building techniques, such as higher density housing, clean energy generating technologies, energy efficiency, and water conservation, a more sustainable design for the plaza was accomplished. To become more pedestrian friendly, pedestrian areas were incorporated into the design, as well as a rapid transit terminal. Using rough construction estimates, it was determined that redevelopment would cost $67.9 million± 20% with a simple payback period of 7.8 years. Using the time value of money, a discounted payback period between 9.6 and 16.0 years was determined. As a result, the re-development project was deemed economically feasible to a reasonable degree. / Thesis / Master of Engineering (MEngr)

Thesis. (M. Tech. (Faculty of Engineering and Technology, Dept. of Civil Engineering))--Vaal University of Technology, 2011 / In the past thirty years there has been a rapid deterioration of the road network in South Africa. As an attempt to address this challenge, a study was conducted on R34 between Vrede and Bothmas Pass Border. The aim of the study was to develop a pavement management system for road network maintenance to serve as a decision support tool to assist to improve the efficiency of making decisions, provide feedback as to the consequences of these decisions, ensure consistency of decisions made at different levels and improve the effectiveness of all decisions in terms of efficiency of results. The study focused on developing and testing pavement management system for road network maintenance. Consequently, visual condition inspections, non-destructive and semi-destructive tests were conducted on the field, data acquired, processed and analysed in accordance with guidelines stipulated in the Draft Technical Recommendations for Highways (TRH) 22 in order to draw conclusions. The data acquired included the surfacing assessments, structural assessments, functional assessments, traffic surveys, riding quality, falling weight deflectometer, mechanical rutting, material investigations and dynamic cone penetration. After analysis of the data, visual condition index was then calculated to be 40%. Visual condition index was then used to determine the action required towards rehabilitating the road. After consultation with guidelines contained in the TRH22, it was concluded that the pavement treatment needed for the road was Rehabilitation. It was then concluded that PMS developed would provide key performance indicators to assist with decision support system and that it is also suitable for road network applications ranging from national roads, provincial roads, regional or district arterial and collector / distributor networks in SA. The municipalities and other road maintenance agencies were then recommended to utilise the “easy to use” developed pavement management system as a decision support tool in their maintenance programmes.

GPS technology has been embedded into portable, low-cost electronic devices nowadays to track the movements of mobile objects. This implication has greatly impacted the transportation field by creating a novel and rich source of traffic data on the road network. Although the promise offered by GPS devices to overcome problems like underreporting, respondent fatigue, inaccuracies and other human errors in data collection is significant; the technology is still relatively new that it raises many issues for potential users. These issues tend to revolve around the following areas: reliability, data processing and the related application. This thesis aims to study the GPS tracking form the methodological, technical and practical aspects. It first evaluates the reliability of GPS based traffic data based on data from an experiment containing three different traffic modes (car, bike and bus) traveling along the road network. It then outline the general procedure for processing GPS tracking data and discuss related issues that are uncovered by using real-world GPS tracking data of 316 cars. Thirdly, it investigates the influence of road network density in finding optimal location for enhancing travel efficiency and decreasing travel cost. The results show that the geographical positioning is reliable. Velocity is slightly underestimated, whereas altitude measurements are unreliable.Post processing techniques with auxiliary information is found necessary and important when solving the inaccuracy of GPS data. The densities of the road network influence the finding of optimal locations. The influence will stabilize at a certain level and do not deteriorate when the node density is higher.