[Home ] [Archive]   [ فارسی ]  
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Contact ::
Main Menu
Journal Information::
Articles archive::
For Authors::
For Reviewers::
Contact us::
Site Facilities::
Search in website

Advanced Search
Receive site information
Enter your Email in the following box to receive the site news and information.
:: Volume 2, Issue 1 (6-2014) ::
jgit 2014, 2(1): 1-15 Back to browse issues page
Context-Aware Network Generalization for Optimum-Path Analysis
Mahdi Rahimi * , Mohammad Reza Malek
K.N.Toosi University of Technology
Abstract:   (5527 Views)
Generalization is a prevalent concept in Cartography to which has been added new aspects such as model generalization with developments in GIS. Increasing demand for tailored and ubiquitous geospatial services like wayfinding, makes the context-aware generalization a noticeable research area in GIScience. Most of the wayfinding services use the network data model as the main spatial data model for their analyses. Whatever data or information that characterizes the situations relevant to users, systems and applications, can be considered as context. A context-aware service is as a service which can sense user, environment and device’s situations and respond to user requests concerning contexts to fulfill the user’s needs better. From the GI services perspective, the context of a query could be the location of the device, environmental settings that query is made in, the time, the activity of the user, user’s personal information, the user’s favorites and information needs, the user’s cognitive map of environment, the mode of travel, the purpose of travel and the device’s technological specifications. In this paper, we try to propose and implement a method for context-aware network generalization at the analysis level. For finding the best path, user contexts like user’s favorite streets will be used. These contexts are modeled as edge’s attributes and those edges which fulfill user’s needs, will be the generators of the Network Voronoi Diagram. With these diagrams, the network will be simplified into sub graphs using Delaunay diagram over the network. The path would be composed of the path between origin and destination to their corresponding generators and the path between generators. This method guarantees the maximum use of edges with user’s need context as well as decreasing computational cost.
Keywords: Context-Awareness, Network Generalization, Network Pruning, Network Voronoi Diagram, Sub-Network.
Full-Text [PDF 2135 kb]   (2459 Downloads)    
Type of Study: Research |
Received: 2015/07/11 | Accepted: 2015/07/11 | Published: 2015/07/11
Send email to the article author

XML   Persian Abstract   Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Rahimi M, Malek M R. Context-Aware Network Generalization for Optimum-Path Analysis. jgit 2014; 2 (1) :1-15
URL: http://jgit.kntu.ac.ir/article-1-109-en.html

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Volume 2, Issue 1 (6-2014) Back to browse issues page
نشریه علمی-پژوهشی مهندسی فناوری اطلاعات مکانی Engineering Journal of Geospatial Information Technology
Persian site map - English site map - Created in 0.05 seconds with 35 queries by YEKTAWEB 4652