000 04984nam a22003615i 4500
001 305112
003 MX-SnUAN
005 20160429155935.0
007 cr nn 008mamaa
008 150903s2013 gw | o |||| 0|eng d
020 _a9783642308536
_99783642308536
024 7 _a10.1007/9783642308536
_2doi
035 _avtls000359405
039 9 _a201509030614
_bVLOAD
_c201405070245
_dVLOAD
_y201402191554
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aGA1-1776
100 1 _aDuckham, Matt.
_eautor
_9333369
245 1 0 _aDecentralized Spatial Computing :
_bFoundations of Geosensor Networks /
_cby Matt Duckham.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _axx, 320 páginas 117 ilustraciones, 16 ilustraciones en color.
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
500 _aSpringer eBooks
505 0 _aPart I Foundations of Decentralized Spatial Computing -- Chap. 1 When Computing Happens Somewhere -- Chap. 2 Formal foundations -- Chap. 3 Algorithmic foundations -- Part II Algorithms for Decentralized Spatial Computing -- Chap. 4 Neighborhood-Based Algorithms -- Chap. 5 Location-Based Algorithms -- Chap. 6 Monitoring Spatial Change Over Time -- Part III Simulating Decentralized Spatial Algorithms -- Chap. 7 Simulating Scalable Decentralized Spatial Algorithms -- Chap. 8 Simulating Robust Decentralized Spatial Algorithms -- Chap. 9 Further Topics and Technologies -- References -- App. A Discrete Mathematics Primer App. B Relational Database and SQL Primer -- Index.
520 _aComputing increasingly happens somewhere, with that geographic location important to the computational process itself. Many new and evolving spatial technologies, such as geosensor networks and smartphones, embody this trend. Conventional approaches to spatial computing are centralized, and do not account for the inherently decentralized nature of "computing somewhere": the limited, local knowledge of individual system components, and the interaction between those components at different locations. On the other hand, despite being an established topic in distributed systems, decentralized computing is not concerned with geographical constraints to the generation and movement of information. In this context, of (centralized) spatial computing and decentralized (non-spatial) computing, the key question becomes: "What makes decentralized spatial computing special?" In Part I of the book the author covers the foundational concepts, structures, and design techniques for decentralized computing with spatial and spatiotemporal information. In Part II he applies those concepts and techniques to the development of algorithms for decentralized spatial computing, stepping through a suite of increasingly sophisticated algorithms: from algorithms with minimal spatial information about their neighborhoods; to algorithms with access to more detailed spatial information, such as direction, distance, or coordinate location; to truly spatiotemporal algorithms that monitor environments that are dynamic, even using networks that are mobile or volatile. Finally, in Part III the author shows how decentralized spatial and spatiotemporal algorithms designed using the techniques explored in Part II can be simulated and tested. In particular, he investigates empirically the important properties of a decentralized spatial algorithm: its computational efficiency and its robustness to unavoidable uncertainty. Part III concludes with a survey of the opportunities for connecting decentralized spatial computing to ongoing research and emerging hot topics in related fields, such as biologically inspired computing, geovisualization, and stream computing. The book is written for students and researchers of computer science and geographic information science. Throughout the book the author's style is characterized by a focus on the broader message, explaining the process of decentralized spatial algorithm design rather than the technical details. Each chapter ends with review questions designed to test the reader's understanding of the material and to point to further work or research. The book includes short appendices on discrete mathematics and SQL. Simulation models written in NetLogo and associated source code for all the algorithms presented in the book can be found on the author's accompanying website.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783642308529
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-30853-6
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c305112
_d305112