Centre de documentation
scientifique

Dépouillements

Evaluating the benefits of multimodal interface design for compass-a mobile GIS / J. Doyle in Geoinformatica, vol 14 n° 2 (April 2010)  

Public [article]  inGeoinformatica > vol 14 n° 2 (April 2010) . - pp 135 - 162 Titre : Evaluating the benefits of multimodal interface design for compass-a mobile GIS Type de document : Article/Communication Auteurs : J. Doyle, Auteur ; Michela Bertolotto, Auteur ; D. Wilson, Auteur Année de publication : 2010 Article en page(s) : pp 135 - 162 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique [Termes IGN] interface multimodale [Termes IGN] interface utilisateur [Termes IGN] positionnement par GNSS [Termes IGN] service fondé sur la position [Termes IGN] SIG nomade [Termes IGN] utilisateur nomade Résumé : (Auteur) The context of mobility raises many issues for geospatial applications providing location-based services. Mobile device limitations, such as small user interface footprint and pen input whilst in motion, result in information overload on such devices and interfaces which are difficult to navigate and interact with. This has become a major issue as mobile GIS applications are now being used by a wide group of users, including novice users such as tourists, for whom it is essential to provide easy-to-use applications. Despite this, comparatively little research has been conducted to address the mobility problem. We are particularly concerned with the limited interaction techniques available to users of mobile GIS which play a primary role in contributing to the complexity of using such an application whilst mobile. As such, our research focuses on multimodal interfaces as a means to present users with a wider choice of modalities for interacting with mobile GIS applications. Multimodal interaction is particularly advantageous in a mobile context, enabling users of location-based applications to choose the mode of input that best suits their current task and location. The focus of this article concerns a comprehensive user study which demonstrates the benefits of multimodal interfaces for mobile geospatial applications. Copyright Springer Numéro de notice : A2010-063 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-009-0079-2 Date de publication en ligne : 10/03/2009 En ligne : https://doi.org/10.1007/s10707-009-0079-2 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30259 [article]

Exemplaires(1)

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

Efficient evaluation of continuous spatio-temporal queries on moving objects whith uncertain velocity / Y. Huang in Geoinformatica, vol 14 n° 2 (April 2010)  

Public [article]  inGeoinformatica > vol 14 n° 2 (April 2010) . - pp 163 - 200 Titre : Efficient evaluation of continuous spatio-temporal queries on moving objects whith uncertain velocity Type de document : Article/Communication Auteurs : Y. Huang, Auteur ; C. Lee, Auteur Année de publication : 2010 Article en page(s) : pp 163 - 200 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] classification barycentrique [Termes IGN] distance euclidienne [Termes IGN] objet mobile [Termes IGN] requête continue [Termes IGN] requête spatiotemporelle [Termes IGN] vitesse Résumé : (Auteur) Continuous Range (CR) query and Continuous K-Nearest Neighbor (CKNN) query are two important types of spatio-temporal queries. Given a time interval [ts , te ] and a moving query object q, a CR query is to find the moving objects whose Euclidean distances to q are within a user-given distance at each time instant within [ts , te ]. A CKNN query is to retrieve the K-Nearest Neighbors (KNNs) of this query object q at each time instant within [ts , te ]. In this paper, we investigate how to process these spatio-temporal queries efficiently under the situation that the velocity of each object is not fixed. This uncertainty on the velocity of object inevitably results in high complexity in processing spatio-temporal queries. We will discuss the complications incurred by this uncertainty and propose two algorithms, namely the Possibility-based possible within objects searching algorithm and the Possibility-based possible KNN searching algorithm, for the CR query and the CKNN query, respectively. A Possibility-based model is designed accordingly to quantify the possibility of each object being the result of a CR query or a CKNN query. Comprehensive experiments are performed to demonstrate the effectiveness and the efficiency of the proposed approaches. Copyright Springer Numéro de notice : A2010-064 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-009-0081-8 Date de publication en ligne : 23/04/2009 En ligne : https://doi.org/10.1007/s10707-009-0081-8 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30260 [article]

Exemplaires(1)

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

Semantic-based pruning of redundant and uninteresting frequent geographic patterns / Vania Bogorny in Geoinformatica, vol 14 n° 2 (April 2010)  

Public [article]  inGeoinformatica > vol 14 n° 2 (April 2010) . - pp 201 - 220 Titre : Semantic-based pruning of redundant and uninteresting frequent geographic patterns Type de document : Article/Communication Auteurs : Vania Bogorny, Auteur ; J. Valiati, Auteur ; L. Alvares, Auteur Année de publication : 2010 Article en page(s) : pp 201 - 220 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] base de données localisées [Termes IGN] exploration de données géographiques [Termes IGN] modèle sémantique de données [Termes IGN] regroupement de données [Termes IGN] sémantique Résumé : (Auteur) In geographic association rule mining many patterns are either redundant or contain well known geographic domain associations explicitly represented in knowledge resources such as geographic database schemas and geo-ontologies. Existing spatial association rule mining algorithms are Apriori-like, and therefore generate a large amount of redundant patterns. For non-spatial data, the closed frequent pattern mining technique has been introduced to remove redundant patterns. This approach, however, does not warrant the elimination of both redundant and well known geographic dependences when mining geographic databases. This paper presents a novel method for pruning both redundant and well known geographic dependences, by pushing semantics into the pattern mining task. Experiments with real geographic databases have demonstrated a significant reduction of the total amount of patterns and the efficiency of the method. Copyright Springer Numéro de notice : A2010-065 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-009-0082-7 Date de publication en ligne : 06/05/2009 En ligne : https://doi.org/10.1007/s10707-009-0082-7 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30261 [article]

Exemplaires(1)

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

Mastering map : scale balancing workloads display and geometry change in multi-scale mapping / Cynthia A. Brewer in Geoinformatica, vol 14 n° 2 (April 2010)  

Public [article]  inGeoinformatica > vol 14 n° 2 (April 2010) . - pp 221 - 239 Titre : Mastering map : scale balancing workloads display and geometry change in multi-scale mapping Type de document : Article/Communication Auteurs : Cynthia A. Brewer, Auteur ; Barbara P. Buttenfield, Auteur Année de publication : 2010 Article en page(s) : pp 221 - 239 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] base de données cartographiques [Termes IGN] base de données multi-représentation [Termes IGN] conception cartographique [Termes IGN] données multiéchelles [Termes IGN] échelle cartographique [Termes IGN] généralisation cartographique automatisée [Termes IGN] précision des données [Termes IGN] qualité cartographique Résumé : (Auteur) This paper builds on a body of European research on multiple resolution data bases (MRDBs), defining a conceptual framework for managing tasks in a multi-scale mapping project. The framework establishes a workload incorporating task difficulty, time to complete a task, required level of expertise, required resources, etc. Project managers must balance the workload among tasks with lower and higher complexity to produce a high quality cartographic product on time and within budget. We argue for increased emphasis on the role of symbol design, which often carries a lower workload than multi-scale mapping based primarily on geometry change. Countering expectations that combining symbol change with geometry change will increase workloads, we argue that in many cases, integration of the two can reduce workloads overall. To demonstrate our points, we describe two case studies drawn from a recent multi-scale mapping and database building project for Ada County, Idaho. We extend the concept of workload balancing, demonstrating that insertion of Level of Detail (LoD) datasets at intermediate scales can further reduce the workload. Previous work proposing LoDs has not reported empirical assessment, and we encourage small and large mapping organizations to contribute to such an effort. Copyright Springer Numéro de notice : A2010-066 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-009-0083-6 Date de publication en ligne : 06/05/2009 En ligne : https://doi.org/10.1007/s10707-009-0083-6 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30262 [article]

Exemplaires(1)

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

Algorithms for constrained k-nearest neighbor queries over moving object trajectories / Yunjun Gao in Geoinformatica, vol 14 n° 2 (April 2010)  

Public [article]  inGeoinformatica > vol 14 n° 2 (April 2010) . - pp 241 - 276 Titre : Algorithms for constrained k-nearest neighbor queries over moving object trajectories Type de document : Article/Communication Auteurs : Yunjun Gao, Auteur ; B. Zheng, Auteur ; G. Chen, Auteur ; Qi Li, Auteur Année de publication : 2010 Article en page(s) : pp 241 - 276 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] arbre-R [Termes IGN] base de données d'objets mobiles [Termes IGN] base de données spatiotemporelles [Termes IGN] classification barycentrique [Termes IGN] objet mobile [Termes IGN] processus spatial [Termes IGN] programmation par contraintes [Termes IGN] requête spatiale Résumé : (Auteur) An important query for spatio-temporal databases is to find nearest trajectories of moving objects. Existing work on this topic focuses on the closest trajectories in the whole data space. In this paper, we introduce and solve constrained k-nearest neighbor (CkNN) queries and historical continuous CkNN (HCCkNN) queries on R-tree-like structures storing historical information about moving object trajectories. Given a trajectory set D, a query object (point or trajectory) q, a temporal extent T, and a constrained region CR, (i) a CkNN query over trajectories retrieves from D within T, the k (? 1) trajectories that lie closest to q and intersect (or are enclosed by) CR; and (ii) an HCCkNN query on trajectories retrieves the constrained k nearest neighbors (CkNNs) of q at any time instance of T. We propose a suite of algorithms for processing CkNN queries and HCCkNN queries respectively, with different properties and advantages. In particular, we thoroughly investigate two types of CkNN queries, i.e., CkNNP and CkNNT, which are defined with respect to stationary query points and moving query trajectories, respectively; and two types of HCCkNN queries, namely, HCCkNNP and HCCkNNT, which are continuous counterparts of CkNNP and CkNNT, respectively. Our methods utilize an existing data-partitioning index for trajectory data (i.e., TB-tree) to achieve low I/O and CPU cost. Extensive experiments with both real and synthetic datasets demonstrate the performance of the proposed algorithms in terms of efficiency and scalability. Copyright Springer Numéro de notice : A2010-067 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-009-0084-5 Date de publication en ligne : 28/04/2009 En ligne : https://doi.org/10.1007/s10707-009-0084-5 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30263 [article]

Exemplaires(1)

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