Centre dedocumentation
scientifique

Computing with cognitive spatial frames of reference in GIS / Simon Scheider in Transactions in GIS, vol 22 n° 5 (October 2018)  

Public [article]  inTransactions in GIS > vol 22 n° 5 (October 2018) . - pp 1083 - 1104 Titre : Computing with cognitive spatial frames of reference in GIS Type de document : Article/Communication Auteurs : Simon Scheider, Auteur ; Jürgen Hahn, Auteur ; Paul Weiser, Auteur ; Werner Kuhn, Auteur Année de publication : 2018 Article en page(s) : pp 1083 - 1104 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique [Termes IGN] espace vectoriel [Termes IGN] logique floue [Termes IGN] modèle cognitif [Termes IGN] transformation géométrique Résumé : (Auteur) In everyday communication, people effortlessly translate between spatial cognitive frames of reference. For example, a tourist guide translates from a map (“the fountain is north‐west of the church”) into a cognitive frame for a tourist (“the fountain in front of the church”). While different types of cognitive reference frames and their relevance for language cultures have been studied in considerable depth, we still lack adequate transformation models. In this article, we argue that transformations in current Geographic Information Systems (GIS) are inappropriate to this end. Appropriate transformation models need to go beyond point discretization to take into account vague transformations, in order to deal with forms, sizes, and vagueness of spatial relations relative to ground objects. We argue that neural fields should be used to denote fuzzy positions, directions, and sizes in a particular frame. We propose fuzzy vector spaces to approximate neural field behavior with affine transformations, including fuzzy translation, rotation, and scaling, in order to efficiently transform between different cognitive perspectives. We use an implementation in Haskell to describe a geographic map from the perspective of six well‐known cognitive frames of reference. Based on these findings, we give an outlook on the principles of a “neural GIS.” Numéro de notice : A2018-570 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12318 date de publication en ligne : 11/10/2018 En ligne : https://doi.org/10.1111/tgis.12318 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92289 [article]

Panda∗: A generic and scalable framework for predictive spatio-temporal queries / Abdeltawab M. Hendawi in Geoinformatica [en ligne], vol 21 n° 2 (April - June 2017)  

Public [article]  inGeoinformatica [en ligne] > vol 21 n° 2 (April - June 2017) . - pp 175 - 208 Titre : Panda∗: A generic and scalable framework for predictive spatio-temporal queries Type de document : Article/Communication Auteurs : Abdeltawab M. Hendawi, Auteur ; Mohamed Ali, Auteur ; Mohamed F. Mokbel, Auteur Année de publication : 2017 Article en page(s) : pp 175 - 208 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] environnement de développement [Termes IGN] espace euclidien [Termes IGN] gestion de trafic [Termes IGN] objet mobile [Termes IGN] plus proche voisin (algorithme) [Termes IGN] prédiction [Termes IGN] requête spatiotemporelle Résumé : (Auteur) Predictive spatio-temporal queries are crucial in many applications. Traffic management is an example application, where predictive spatial queries are issued to anticipate jammed areas in advance. Also, location-aware advertising is another example application that targets customers expected to be in the vicinity of a shopping mall in the near future. In this paper, we introduce Panda∗, a generic framework for supporting spatial predictive queries over moving objects in Euclidean spaces. Panda∗ distinguishes itself from previous work in spatial predictive query processing by the following features: (1) Panda∗ is generic in terms of supporting commonly-used types of queries, (e.g., predictive range, KNN, aggregate queries) over stationary points of interests as well as moving objects. (2) Panda∗ employees a prediction function that provides accurate prediction even under the absence or the scarcity of the objects’ historical trajectories. (3) Panda∗ is customizable in the sense that it isolates the prediction calculation from query processing. Hence, it enables the injection and integration of user defined prediction functions within its query processing framework. (4) Panda∗ deals with uncertainties and variabilities in the expected travel time from source to destination in response to incomplete information and/or dynamic changes in the underlying Euclidean space. (5) Panda∗ provides a controllable parameter that trades low latency responses for computational resources. Experimental analysis proves the scalability of Panda∗ in evaluating a massive volume of predictive queries over large numbers of moving objects. Numéro de notice : A2017-068 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article En ligne : http://dx.doi.org/10.1007/s10707-016-0284-8 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=84295 [article]

A method for assessing generalized data accuracy with linear object resolution verification / Tadeusz Chrobak in Geocarto international, vol 32 n° 3 (March 2017)  

Public [article]  inGeocarto international > vol 32 n° 3 (March 2017) . - pp 238-256 Titre : A method for assessing generalized data accuracy with linear object resolution verification Type de document : Article/Communication Auteurs : Tadeusz Chrobak, Auteur ; Stanisław Szombara, Auteur ; Krystian Kozoł, Auteur ; Michal Lupa, Auteur Année de publication : 2017 Article en page(s) : pp 238-256 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] détection de conflit [Termes IGN] espace euclidien [Termes IGN] estimation de position [Termes IGN] généralisation automatique de données [Termes IGN] généralisation cartographique [Termes IGN] objet géographique linéaire [Termes IGN] précision cartographique [Termes IGN] simplification de contour [Vedettes matières IGN] Généralisation Résumé : (Auteur) The article is composed of two sections. In the first section, the authors describe the application of minimum line dimensions which are dependent on line shape, width and the operational scale of the map. The proposed solutions are based on the Euclidean metric space, for which the minimum dimensions of Saliszczew’s elementary triangle (Elementary triangle – is the term pertaining to model, standard triangle of least dimensions securing recognizability of a line. Its dimensions depend on scale of the map and width of the line representing it. The use of a triangle in the simplification process is as follows: triangles with sides (sections) on an arbitrary line and bases (completing the sides) are compared with lengths of the shorter side and the base of the elementary triangle.) were adapted. The second part of the article describes an application of minimum line dimensions for verifying and assessing generalized data. The authors also propose a method for determining drawing line resolution to evaluate the accuracy of algorithm simplification. Taking advantage of the proposed method, well-known simplification algorithms were compared on the basis of qualitative and quantitative evaluation. Moreover, corresponding with the methods of simplified data accuracy assessment the authors have extended these solutions with the rejected data. This procedure has allowed the identification of map areas where graphic conflicts occurred. Numéro de notice : A2017-270 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern En ligne : http://dx.doi.org/10.1080/10106049.2015.1133721 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85296 [article]

Linear Algebra / Arak M. Mathai (2017)  

Public Titre : Linear Algebra : A Course for Physicists and Engineers Type de document : Monographie Auteurs : Arak M. Mathai, Auteur ; Hans J. Haubold, Auteur Editeur : Berlin, New York : Walter de Gruyter Année de publication : 2017 Importance : 450 p. Format : 17 x 24 cm ISBN/ISSN/EAN : 978-3-11-056235-4 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Algèbre [Termes IGN] algèbre linéaire [Termes IGN] arc [Termes IGN] équation différentielle [Termes IGN] espace vectoriel [Termes IGN] matrice [Termes IGN] optimisation (mathématiques) [Termes IGN] statistique mathématique Résumé : (éditeur) In order not to intimidate students by a too abstract approach, this textbook on linear algebra is written to be easy to digest by non-mathematicians. It introduces the concepts of vector spaces and mappings between them without dwelling on statements such as theorems and proofs too much. It is also designed to be self-contained, so no other material is required for an understanding of the topics covered. As the basis for courses on space and atmospheric science, remote sensing, geographic information systems, meteorology, climate and satellite communications at UN-affiliated regional centers, various applications of the formal theory are discussed as well. These include differential equations, statistics, optimization and some engineering-motivated problems in physics. Note de contenu : 1- Vectors 2- Matrices 3- Determinants 4- Eigenvalues and eigenvectors 5- Somme applications of matrices and determinants 6- Matrix series and additional properties of matrices Numéro de notice : 25804 Affiliation des auteurs : non IGN Thématique : MATHEMATIQUE Nature : Monographie DOI : 10.1515/9783110562507 En ligne : https://doi.org/10.1515/9783110562507 Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96609

Location K-anonymity in indoor spaces / Joon-Seok Kim in Geoinformatica [en ligne], vol 20 n° 3 (July - September 2016)  

Public [article]  inGeoinformatica [en ligne] > vol 20 n° 3 (July - September 2016) . - pp 415–451 Titre : Location K-anonymity in indoor spaces Type de document : Article/Communication Auteurs : Joon-Seok Kim, Auteur ; Ki-Joune Li, Auteur Année de publication : 2016 Article en page(s) : pp 415–451 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] anonymisation [Termes IGN] classification barycentrique [Termes IGN] espace euclidien [Termes IGN] graphe [Termes IGN] positionnement en intérieur [Termes IGN] protection de la vie privée [Termes IGN] service fondé sur la position Résumé : (auteur) With the expansion of wireless-communication infrastructure and the evolution of indoor positioning technologies, the demand for location-based services (LBS) has been increasing in indoor as well as outdoor spaces. However, we should consider a significant challenge regarding the location privacy for realizing indoor LBS. To avoid violations of location privacy, much research has been performed, and location K-anonymity has been intensively studied to blur a user location with a cloaking region involving at least K−1 locations of other persons. Owing to the differences between indoor and outdoor spaces, it is, however, difficult to apply this approach directly in an indoor space. First, the definition of the distance metric in indoor space is different from that in Euclidean and road-network spaces. Second, a bounding region, which is a general form of an anonymizing spatial region (ASR) in Euclidean space, does not respect the locality property in indoor space, where movement is constrained by building components. Therefore, we introduce the concept of indoor location K-anonymity in this paper. Then, we investigate the requirements of ASR in indoor spaces and propose novel methods to determine the ASR, considering hierarchical structures of the indoor space. While indoor ASRs are determined at the anonymizer, we also propose processing methods for r-range queries and k-nearest-neighbor queries at a location-based service provider. We validate our methods with experimental analysis of query-processing performance and resilience against attacks in indoor spaces. Numéro de notice : A2016-377 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article En ligne : http://dx.doi.org/10.1007/s10707-015-0241-y Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81144 [article]

Mappes et temporalités : la logique mappologique à l'épreuve de la topochronie / Régis Keerle in Cartes & Géomatique, n° 225 (septembre 2015) 

Permalink

On reverse-k-nearest-neighbor joins / Tobias Emrich in Geoinformatica [en ligne], vol 19 n° 2 (April - June 2015)  

Permalink

Efficient continuous top-k spatial keyword queries on road networks / Long Guo in Geoinformatica [en ligne], vol 19 n° 1 (January - March 2015)  

Permalink

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

Permalink

Morphologie urbaine et réseau : Etude des discontinuités et des ruptures induites par le réseau de circulation à l'aide du modèle Remus / Dominique Badariotti in Revue internationale de géomatique, vol 19 n° 1 (mars – mai 2009)

Permalink

Detection of multi-scale clusters in network space / S. Shiode in International journal of geographical information science IJGIS, vol 23 n° 1-2 (january 2009)

Permalink

Sensitivity analysis of spatially aggregated responses: a gradient-based method / F. Pantus in International journal of geographical information science IJGIS, vol 22 n° 4-5 (april 2008)

Permalink

Étude comparative de différentes méthodes d'estimation / Samuel Nahmani (2008)

Permalink

Mathématiques pour la modélisation géométrique, la représentation 3D et la synthèse d'images / L. Garnier (2007)

Permalink

Algèbre linéaire et géométrie / Luc Jolivet (2005)

Permalink