Centre de documentation
scientifique

Dépouillements

Controlling patterns of geospatial phenomena / Tomasz F. Stepinski in Geoinformatica, vol 15 n° 3 (July 2011)  

Public [article]  inGeoinformatica > vol 15 n° 3 (July 2011) . - pp 399 - 416 Titre : Controlling patterns of geospatial phenomena Type de document : Article/Communication Auteurs : Tomasz F. Stepinski, Auteur ; W. Ding, Auteur ; C. Eick, Auteur Année de publication : 2011 Article en page(s) : pp 399 - 416 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] analyse spatiale [Termes IGN] exploration de données géographiques [Termes IGN] phénomène géographique [Termes IGN] relation topologique Résumé : (Auteur) Modeling spatially distributed phenomena in terms of its controlling factors is a recurring problem in geoscience. Most efforts concentrate on predicting the value of response variable in terms of controlling variables either through a physical model or a regression model. However, many geospatial systems comprises complex, nonlinear, and spatially non-uniform relationships, making it difficult to even formulate a viable model. This paper focuses on spatial partitioning of controlling variables that are attributed to a particular range of a response variable. Thus, the presented method surveys spatially distributed relationships between predictors and response. The method is based on association analysis technique of identifying emerging patterns, which are extended in order to be applied more effectively to geospatial data sets. The outcome of the method is a list of spatial footprints, each characterized by a unique “controlling pattern”—a list of specific values of predictors that locally correlate with a specified value of response variable. Mapping the controlling footprints reveals geographic regionalization of relationship between predictors and response. The data mining underpinnings of the method are given and its application to a real world problem is demonstrated using an expository example focusing on determining variety of environmental associations of high vegetation density across the continental United States. Numéro de notice : A2011-206 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-010-0107-2 Date de publication en ligne : 29/01/2010 En ligne : https://doi.org/10.1007/s10707-010-0107-2 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30984 [article]

Exemplaires(1)

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

The elements of probabilistic time geography / Stephan Winter in Geoinformatica, vol 15 n° 3 (July 2011)  

Public [article]  inGeoinformatica > vol 15 n° 3 (July 2011) . - pp 417 - 434 Titre : The elements of probabilistic time geography Type de document : Article/Communication Auteurs : Stephan Winter, Auteur ; Z. Yin, Auteur Année de publication : 2011 Article en page(s) : pp 417 - 434 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] agent (intelligence artificielle) [Termes IGN] comportement [Termes IGN] distribution, loi de [Termes IGN] données spatiotemporelles [Termes IGN] géopositionnement [Termes IGN] représentation du temps [Termes IGN] Time-geography Résumé : (Auteur) Time geography uses space–time volumes to represent the possible locations of a mobile agent over time in a x–y–t space. A volume is a qualitative representation of the fact that the agent is at a particular time ti inside of the volume’s base at ti . Space–time volumes enable qualitative analysis such as potential encounters between agents. In this paper the qualitative statements of time geography will be quantified. For this purpose an agent’s possible locations are modeled from a stochastic perspective. It is shown that probability is not equally distributed in a space–time volume, i.e., a quantitative analysis cannot be based simply on proportions of intersections. The actual probability distribution depends on the degree of a priori knowledge about the agent’s behavior. This paper starts with the standard assumption of time geography (no further knowledge), and develops the appropriate probability distribution by three equivalent approaches. With such a model any analysis of the location of an agent, or relations between the locations of two agents, can be improved in expressiveness as well as accuracy. Numéro de notice : A2011-207 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-010-0108-1 Date de publication en ligne : 13/04/2010 En ligne : https://doi.org/10.1007/s10707-010-0108-1 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30985 [article]

Exemplaires(1)

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

Mining boundary effects in areally referenced spatial data using the Bayesian information criterion / Sudipto Banerjee in Geoinformatica, vol 15 n° 3 (July 2011)  

Public [article]  inGeoinformatica > vol 15 n° 3 (July 2011) . - pp 435 - 454 Titre : Mining boundary effects in areally referenced spatial data using the Bayesian information criterion Type de document : Article/Communication Auteurs : Sudipto Banerjee, Auteur ; A. Mcbean, Auteur Année de publication : 2011 Article en page(s) : pp 435 - 454 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] auto-régression [Termes IGN] données localisées numériques [Termes IGN] estimation bayesienne [Termes IGN] image aérienne [Termes IGN] limite indéterminée [Termes IGN] Minnesota (Etats-Unis) [Termes IGN] modèle statistique [Termes IGN] santé Résumé : (Auteur) Statistical models for areal data are primarily used for smoothing maps revealing spatial trends. Subsequent interest often resides in the formal identification of ‘boundaries’ on the map. Here boundaries refer to ‘difference boundaries’, representing significant differences between adjacent regions. Recently, Lu and Carlin (Geogr Anal 37:265–285, 2005) discussed a Bayesian framework to carry out edge detection employing a spatial hierarchical model that is estimated using Markov chain Monte Carlo (MCMC) methods. Here we offer an alternative that avoids MCMC and is easier to implement. Our approach resembles a model comparison problem where the models correspond to different underlying edge configurations across which we wish to smooth (or not). We incorporate these edge configurations in spatially autoregressive models and demonstrate how the Bayesian Information Criteria (BIC) can be used to detect difference boundaries in the map. We illustrate our methods with a Minnesota Pneumonia and Influenza Hospitalization dataset to elicit boundaries detected from the different models. Numéro de notice : A2011-208 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-010-0109-0 Date de publication en ligne : 18/06/2010 En ligne : https://doi.org/10.1007/s10707-010-0109-0 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30986 [article]

Exemplaires(1)

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

A data model and query language for spatio-temporal decision support / L. Gomez in Geoinformatica, vol 15 n° 3 (July 2011)  

Public [article]  inGeoinformatica > vol 15 n° 3 (July 2011) . - pp 455 - 496 Titre : A data model and query language for spatio-temporal decision support Type de document : Article/Communication Auteurs : L. Gomez, Auteur ; Bart Kuijpers, Auteur ; A. Vaisman, Auteur Année de publication : 2011 Article en page(s) : pp 455 - 496 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] aide à la décision [Termes IGN] analyse spatio-temporelle [Termes IGN] base de données spatiotemporelles [Termes IGN] langage de requête [Termes IGN] modèle conceptuel de données localisées [Termes IGN] objet mobile [Termes IGN] OLAP [Termes IGN] requête spatiotemporelle [Termes IGN] SOLAP [Termes IGN] SQL [Termes IGN] système d'information géographique Résumé : (Auteur) In recent years, applications aimed at exploring and analyzing spatial data have emerged, powered by the increasing need of software that integrates Geographic Information Systems (GIS) and On-Line Analytical Processing (OLAP). These applications have been called SOLAP (Spatial OLAP). In previous work, the authors have introduced Piet, a system based on a formal data model that integrates in a single framework GIS, OLAP (On-Line Analytical Processing), and Moving Object data. Real-world problems are inherently spatio-temporal. Thus, in this paper we present a data model that extends Piet, allowing tracking the history of spatial data in the GIS layers. We present a formal study of the two typical ways of introducing time into Piet: timestamping the thematic layers in the GIS, and timestamping the spatial objects in each layer. We denote these strategies snapshot-based and timestamp-based representations, respectively, following well-known terminology borrowed from temporal databases. We present and discuss the formal model for both alternatives. Based on the timestamp-based representation, we introduce a formal First-Order spatio-temporal query language, which we denote Lt, able to express spatio-temporal queries over GIS, OLAP, and trajectory data. Finally, we discuss implementation issues, the update operators that must be supported by the model, and sketch a temporal extension to Piet-QL, the SQL-like query language that supports Piet. Numéro de notice : A2011-209 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-010-0110-7 Date de publication en ligne : 17/06/2010 En ligne : https://doi.org/10.1007/s10707-010-0110-7 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30987 [article]

Exemplaires(1)

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

Spatiotemporal pattern queries / M. Sakr in Geoinformatica, vol 15 n° 3 (July 2011)  

Public [article]  inGeoinformatica > vol 15 n° 3 (July 2011) . - pp 497 - 540 Titre : Spatiotemporal pattern queries Type de document : Article/Communication Auteurs : M. Sakr, Auteur ; Ralf Hartmut Güting, Auteur Année de publication : 2011 Article en page(s) : pp 497 - 540 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] base de données spatiotemporelles [Termes IGN] C++ [Termes IGN] langage de requête [Termes IGN] module d'extension [Termes IGN] objet mobile [Termes IGN] requête spatiotemporelle [Termes IGN] SQL [Termes IGN] système de gestion de base de données Résumé : (Auteur) This paper presents a novel approach to express and evaluate the complex class of queries in moving object databases called spatiotemporal pattern queries (STP queries). That is, one can specify temporal order constraints on the fulfillment of several predicates. This is in contrast to a standard spatiotemporal query that is composed of a single predicate. We propose a language design for spatiotemporal pattern queries in the context of spatiotemporal DBMSs. The design builds on the well established concept of lifted predicates. Hence, unlike previous approaches, patterns are neither restricted to specific sets of predicates, nor to specific moving object types. The proposed language can express arbitrarily complex patterns that involve various types of spatiotemporal operations such as range, metric, topological, set operations, aggregations, distance, direction, and boolean operations. This work covers the language integration in SQL, the evaluation of the queries, and the integration with the query optimizer. We also propose a simple language for defining the temporal constraints. The approach allows for queries that were never available. We provide a complete implementation in C++ and Prolog in the context of the Secondo platform. The implementation is made publicly available online as a Secondo Plugin, which also includes automatic scripts for repeating the experiments in this paper. Numéro de notice : A2011-210 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-010-0114-3 Date de publication en ligne : 12/08/2010 En ligne : https://doi.org/10.1007/s10707-010-0114-3 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30988 [article]

Exemplaires(1)

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

The partial sequenced route query with traveling rules in road networks / H. Chen in Geoinformatica, vol 15 n° 3 (July 2011)  

Public [article]  inGeoinformatica > vol 15 n° 3 (July 2011) . - pp 541 - 569 Titre : The partial sequenced route query with traveling rules in road networks Type de document : Article/Communication Auteurs : H. Chen, Auteur ; W. Ku, Auteur ; M. Sun, Auteur ; R. Zimmermann, Auteur Année de publication : 2011 Article en page(s) : pp 541 - 569 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] calcul d'itinéraire [Termes IGN] itinéraire [Termes IGN] point d'intérêt [Termes IGN] requête spatiale [Termes IGN] réseau routier [Termes IGN] service fondé sur la position Résumé : (Auteur) In modern geographic information systems, route search represents an important class of queries. In route search related applications, users may want to define a number of traveling rules (traveling preferences) when they plan their trips. However, these traveling rules are not considered in most existing techniques. In this paper, we propose a novel spatial query type, the multi-rule partial sequenced route (MRPSR) query, which enables efficient trip planning with user defined traveling rules. The MRPSR query provides a unified framework that subsumes the well-known trip planning query (TPQ) and the optimal sequenced route (OSR) query. The difficulty in answering MRPSR queries lies in how to integrate multiple choices of points-of-interest (POI) with traveling rules when searching for satisfying routes. We prove that MRPSR query is NP-hard and then provide three algorithms by mapping traveling rules to an activity on vertex network. Afterwards, we extend all the proposed algorithms to road networks. By utilizing both real and synthetic POI datasets, we investigate the performance of our algorithms. The results of extensive simulations show that our algorithms are able to answer MRPSR queries effectively and efficiently with underlying road networks. Compared to the Light Optimal Route Discoverer (LORD) based brute-force solution, the response time of our algorithms is significantly reduced while the distances of the computed routes are only slightly longer than the shortest route. Numéro de notice : A2011-211 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-010-0115-2 Date de publication en ligne : 03/09/2010 En ligne : https://doi.org/10.1007/s10707-010-0115-2 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30989 [article]

Exemplaires(1)

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

Query-aware location anonymization for road networks / C. Chow in Geoinformatica, vol 15 n° 3 (July 2011)  

Public [article]  inGeoinformatica > vol 15 n° 3 (July 2011) . - pp 571 - 607 Titre : Query-aware location anonymization for road networks Type de document : Article/Communication Auteurs : C. Chow, Auteur ; M. Mokbel, Auteur ; Jie Bao, Auteur ; X. Liu, Auteur Année de publication : 2011 Article en page(s) : pp 571 - 607 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] espace euclidien [Termes IGN] requête spatiale [Termes IGN] réseau routier [Termes IGN] service fondé sur la position Résumé : (Auteur) Recently, several techniques have been proposed to protect the user location privacy for location-based services in the Euclidean space. Applying these techniques directly to the road network environment would lead to privacy leakage and inefficient query processing. In this paper, we propose a new location anonymization algorithm that is designed specifically for the road network environment. Our algorithm relies on the commonly used concept of spatial cloaking, where a user location is cloaked into a set of connected road segments of a minimum total length L including at least K users. Our algorithm is “query-aware” as it takes into account the query execution cost at a database server and the query quality, i.e., the number of objects returned to users by the database server, during the location anonymization process. In particular, we develop a new cost function that balances between the query execution cost and the query quality. Then, we introduce two versions of our algorithm, namely, pure greedy and randomized greedy, that aim to minimize the developed cost function and satisfy the user specified privacy requirements. To accommodate intervals with a high workload, we introduce a shared execution paradigm that boosts the scalability of our location anonymization algorithm and the database server to support large numbers of queries received in a short time period. Extensive experimental results show that our algorithms are more efficient and scalable than the state-of-the-art technique, in terms of both query execution cost and query quality. The results also show that our algorithms have very strong resilience to two privacy attacks, namely, the replay attack and the center-of-cloaked-area attack. Numéro de notice : A2011-212 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-010-0117-0 Date de publication en ligne : 06/11/2010 En ligne : https://doi.org/10.1007/s10707-010-0117-0 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=30990 [article]

Exemplaires(1)

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