MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Fast Mapping onto Census Blocks

Author(s)
Kepner, Jeremy; Kipf, Andreas; Engwirda, Darren; Vembar, Navin; Jones, Michael; Milechin, Lauren; Gadepally, Vijay; Hill, Chris; Kraska, Tim; Arcand, William; Bestor, David; Bergeron, William; Byun, Chansup; Hubbell, Matthew; Houle, Michael; Kirby, Andrew; Klein, Anna; Mullen, Julie; Prout, Andrew; Reuther, Albert; Rosa, Antonio; Samsi, Sid; Yee, Charles; Michaleas, Peter; ... Show more Show less
Thumbnail
DownloadAccepted version (1.813Mb)
Open Access Policy

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
© 2020 IEEE. Pandemic measures such as social distancing and contact tracing can be enhanced by rapidly integrating dynamic location data and demographic data. Projecting billions of longitude and latitude locations onto hundreds of thousands of highly irregular demographic census block polygons is computationally challenging in both research and deployment contexts. This paper describes two approaches labeled 'simple' and 'fast'. The simple approach can be implemented in any scripting language (Matlab/Octave, Python, Julia, R) and is easily integrated and customized to a variety of research goals. This simple approach uses a novel combination of hierarchy, sparse bounding boxes, polygon crossing-number, vectorization, and parallel processing to achieve 100,000,000+ projections per second on 100 servers. The simple approach is compact, does not increase data storage requirements, and is applicable to any country or region. The fast approach exploits the thread, vector, and memory optimizations that are possible using a low-level language (C++) and achieves similar performance on a single server. This paper details these approaches with the goal of enabling the broader community to quickly integrate location and demographic data.
Date issued
2020
URI
https://hdl.handle.net/1721.1/143729
Department
Lincoln Laboratory; Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; MIT-IBM Watson AI Lab; Massachusetts Institute of Technology. Department of Earth, Atmospheric, and Planetary Sciences
Journal
2020 IEEE High Performance Extreme Computing Conference, HPEC 2020
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Kepner, Jeremy, Kipf, Andreas, Engwirda, Darren, Vembar, Navin, Jones, Michael et al. 2020. "Fast Mapping onto Census Blocks." 2020 IEEE High Performance Extreme Computing Conference, HPEC 2020.
Version: Author's final manuscript

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.