Centre de documentation
scientifique

Dépouillements

Continuous K-nearest neighbor query for moving objects with uncertain velocity / Y. Huang in Geoinformatica, vol 13 n° 1 (March 2009)  

Public [article]  inGeoinformatica > vol 13 n° 1 (March 2009) . - pp 1 - 25 Titre : Continuous K-nearest neighbor query for moving objects with uncertain velocity Type de document : Article/Communication Auteurs : Y. Huang, Auteur ; C.C. Chen, Auteur ; C. Lee, Auteur Année de publication : 2009 Article en page(s) : pp 1 - 25 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] base de données spatiotemporelles [Termes IGN] classification barycentrique [Termes IGN] objet mobile [Termes IGN] requête spatiale [Termes IGN] requête spatiotemporelle [Termes IGN] vitesse Résumé : (Auteur) One of the most important queries in spatio-temporal databases that aim at managing moving objects efficiently is the continuous K-nearest neighbor (CKNN) query. A CKNN query is to retrieve the K-nearest neighbors (KNNs) of a moving user at each time instant within a user-given time interval [t s , t e ]. In this paper, we investigate how to process a CKNN query efficiently. Different from the previous related works, our work relieves the past assumption, that an object moves with a fixed velocity, by allowing that the velocity of the object can vary within a known range. Due to the introduction of this uncertainty on the velocity of each object, processing a CKNN query becomes much more complicated. We will discuss the complications incurred by this uncertainty and propose a cost-effective P2 KNN algorithm to find the objects that could be the KNNs at each time instant within the given query time interval. Besides, a probability-based model is designed to quantify the possibility of each object being one of the KNNs. Comprehensive experiments demonstrate the efficiency and the effectiveness of the proposed approach. Copyright Springer Numéro de notice : A2009-003 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-007-0041-0 En ligne : https://doi.org/10.1007/s10707-007-0041-0 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29633 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-09011	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Mining long, sharable patterns in trajectories of moving objects / G. Gidofalvi in Geoinformatica, vol 13 n° 1 (March 2009)  

Public [article]  inGeoinformatica > vol 13 n° 1 (March 2009) . - pp 27 - 55 Titre : Mining long, sharable patterns in trajectories of moving objects Type de document : Article/Communication Auteurs : G. Gidofalvi, Auteur ; T.B. Pedersen, Auteur Année de publication : 2009 Article en page(s) : pp 27 - 55 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] base de données d'objets mobiles [Termes IGN] base de données spatiotemporelles [Termes IGN] exploration de données géographiques [Termes IGN] itinéraire [Termes IGN] objet mobile [Termes IGN] reconstruction d'itinéraire ou de trajectoire Résumé : (Auteur) The efficient analysis of spatio-temporal data, generated by moving objects, is an essential requirement for intelligent location-based services. Spatio-temporal rules can be found by constructing spatio-temporal baskets, from which traditional association rule mining methods can discover spatio-temporal rules. When the items in the baskets are spatio-temporal identifiers and are derived from trajectories of moving objects, the discovered rules represent frequently travelled routes. For some applications, e.g., an intelligent ridesharing application, these frequent routes are only interesting if they are long and sharable, i.e., can potentially be shared by several users. This paper presents a database projection based method for efficiently extracting such long, sharable frequent routes. The method prunes the search space by making use of the minimum length and sharable requirements and avoids the generation of the exponential number of sub-routes of long routes. Considering alternative modelling options for trajectories, leads to the development of two effective variants of the method. SQL-based implementations are described, and extensive experiments on both real life- and large-scale synthetic data show the effectiveness of the method and its variants. Copyright Springer Numéro de notice : A2009-004 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-007-0042-z En ligne : https://doi.org/10.1007/s10707-007-0042-z Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29634 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-09011	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Retrieval of Spatial Join Pattern Instances from Sensor Networks / M.L. Yiu in Geoinformatica, vol 13 n° 1 (March 2009)  

Public [article]  inGeoinformatica > vol 13 n° 1 (March 2009) . - pp 57 - 84 Titre : Retrieval of Spatial Join Pattern Instances from Sensor Networks Type de document : Article/Communication Auteurs : M.L. Yiu, Auteur ; Nikos Mamoulis, Auteur ; S. Bakiras, Auteur Année de publication : 2009 Article en page(s) : pp 57 - 84 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] coût [Termes IGN] jointure spatiale [Termes IGN] protocole [Termes IGN] réseau de capteurs [Termes IGN] voisinage (relation topologique) Résumé : (Auteur) We study the continuous evaluation of spatial join queries and extensions thereof, defined by interesting combinations of sensor readings (events) that co-occur in a spatial neighborhood. An example of such a pattern is “a high temperature reading in the vicinity of at least four high-pressure readings”. We devise protocols for ‘in-network’ evaluation of this class of queries, aiming at the minimization of power consumption. In addition, we develop cost models that suggest the appropriateness of each protocol, based on various factors, including selectivity of query elements, energy requirements for sensing, and network topology. Finally, we experimentally compare the effectiveness of the proposed solutions on an experimental platform that emulates real sensor networks. Copyright Springer Numéro de notice : A2009-005 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE/SOCIETE NUMERIQUE Nature : Article DOI : 10.1007/s10707-007-0043-y En ligne : https://doi.org/10.1007/s10707-007-0043-y Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29635 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-09011	RAB	Revue	Centre de documentation	En réserve L003	Disponible

The effects of navigation sensors and spatial road network data quality on the performance of map matching algorithms / M. Quddus in Geoinformatica, vol 13 n° 1 (March 2009)  

Public [article]  inGeoinformatica > vol 13 n° 1 (March 2009) . - pp 85 - 108 Titre : The effects of navigation sensors and spatial road network data quality on the performance of map matching algorithms Type de document : Article/Communication Auteurs : M. Quddus, Auteur ; R. Noland, Auteur ; W. Ochieng, Auteur Année de publication : 2009 Article en page(s) : pp 85 - 108 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Navigation et positionnement [Termes IGN] appariement de cartes [Termes IGN] cohérence des données [Termes IGN] géonavigateur [Termes IGN] GPS assisté pour la navigation (technologies) [Termes IGN] milieu urbain [Termes IGN] performance [Termes IGN] phase GPS [Termes IGN] récepteur GPS [Termes IGN] réseau routier Résumé : (Auteur) Map matching algorithms are utilised to support the navigation module of advanced transport telematics systems. The objective of this paper is to develop a framework to quantify the effects of spatial road network data and navigation sensor data on the performance of map matching algorithms. Three map matching algorithms are tested with different spatial road network data (map scale 1:1,250; 1:2,500 and 1:50,000) and navigation sensor data (global positioning system (GPS) and GPS augmented with deduced reckoning) in order to quantify their performance. The algorithms are applied to different road networks of varying complexity. The performance of the algorithms is then assessed for a suburban road network using high precision positioning data obtained from GPS carrier phase observables. The results show that there are considerable effects of spatial road network data on the performance of map matching algorithms. For an urban road network, the results suggest that both the quality of spatial road network data and the type of navigation system affect the link identification performance of map matching algorithms. Copyright Springer Numéro de notice : A2009-006 Affiliation des auteurs : non IGN Thématique : POSITIONNEMENT Nature : Article DOI : 10.1007/s10707-007-0044-x En ligne : https://doi.org/10.1007/s10707-007-0044-x Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29636 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-09011	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Evaluation and Implementation of the OGC Web Processing Service for Use in Client-Side GIS / C. Michaelis in Geoinformatica, vol 13 n° 1 (March 2009)  

Public [article]  inGeoinformatica > vol 13 n° 1 (March 2009) . - pp 109 - 120 Titre : Evaluation and Implementation of the OGC Web Processing Service for Use in Client-Side GIS Type de document : Article/Communication Auteurs : C. Michaelis, Auteur ; D. Ames, Auteur Année de publication : 2009 Article en page(s) : pp 109 - 120 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] spécification de processus [Termes IGN] standard OGC [Termes IGN] système d'information géographique [Termes IGN] traitement de données [Termes IGN] Web Processing Service Résumé : (Auteur) The Open Geospatial Consortium Web Processing Service specification is intended as a solution for creating and distributing web-based functions. This paper seeks to evaluate the WPS specification with respect to feasibility and utility, to identify areas for improvement, and to provide a demonstration implementation approach including a client-side tool and a server-side wrapping technique for exposing geoprocessing functionality through WPS using an asynchronous approach. Challenges with the WPS specification, some of which are already being addressed in the newest WPS revisions, are discussed together with proposed solutions. Several potential enhancements to the WPS proposal are introduced and considered, including a mechanism to guide client applications in prompting for correct data and a means to list the data available on a server. Copyright Springer Numéro de notice : A2009-007 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-008-0048-1 En ligne : https://doi.org/article/10.1007/s10707-008-0048-1 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29637 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-09011	RAB	Revue	Centre de documentation	En réserve L003	Disponible