home.social

#catchments β€” Public Fediverse posts

Live and recent posts from across the Fediverse tagged #catchments, aggregated by home.social.

  1. Physically-Based Hydrologic Modeling Using GRASS GIS - r.topmodel [tutorial]
    --
    workshop.isnew.info/omu-2024-r <-- link to technical resource / workshop / tutorial
    --
    β€œThis workshop will introduce r.topmodel (Cho 2000), the GRASS GIS module for a physically-based hydrologic model called TOPMODEL (Beven 1984)..."
    #GIS #spatial #mapping #water #hydrology #Hydrologic #model #Modeling #GRASS #GRASSGIS #topmodel #workshop #tutorial #onlinelearning #TopographyModel #catchments #R #SAGA #module #ISPSO #particleswarmoptimization #algorithm #continuingeducation

  2. Avoid Backtracking And Burn Your Inputs - CONUS-Scale Watershed Delineation Using OpenMP
    --
    doi.org/10.1016/j.envsoft.2024 <-- shared paper
    --
    β€œHIGHLIGHTS
    β€’ A memory-efficient watershed delineation algorithm was introduced.
    β€’ The new algorithm uses a node-skipping depth-first search to save memory.
    β€’ Both input and output data are stored in a shared matrix to reduce required memory.
    β€’ It performed 95% faster than its CPU benchmark algorithm using 33% less memory.
    β€’ It can solve 50% larger problems than what the CPU benchmark algorithm can handle..."
    #GIS #spatial #mapping #hydrology #water #code #algorithm #watershed #delineation #OpenMP #opensource #memory #efficient #CPU #benchmark #MESHED #model #modeling #largescale #catchments

  3. Avoid Backtracking And Burn Your Inputs - CONUS-Scale Watershed Delineation Using OpenMP
    --
    doi.org/10.1016/j.envsoft.2024 <-- shared paper
    --
    β€œHIGHLIGHTS
    β€’ A memory-efficient watershed delineation algorithm was introduced.
    β€’ The new algorithm uses a node-skipping depth-first search to save memory.
    β€’ Both input and output data are stored in a shared matrix to reduce required memory.
    β€’ It performed 95% faster than its CPU benchmark algorithm using 33% less memory.
    β€’ It can solve 50% larger problems than what the CPU benchmark algorithm can handle..."
    #GIS #spatial #mapping #hydrology #water #code #algorithm #watershed #delineation #OpenMP #opensource #memory #efficient #CPU #benchmark #MESHED #model #modeling #largescale #catchments

  4. Avoid Backtracking And Burn Your Inputs - CONUS-Scale Watershed Delineation Using OpenMP
    --
    doi.org/10.1016/j.envsoft.2024 <-- shared paper
    --
    β€œHIGHLIGHTS
    β€’ A memory-efficient watershed delineation algorithm was introduced.
    β€’ The new algorithm uses a node-skipping depth-first search to save memory.
    β€’ Both input and output data are stored in a shared matrix to reduce required memory.
    β€’ It performed 95% faster than its CPU benchmark algorithm using 33% less memory.
    β€’ It can solve 50% larger problems than what the CPU benchmark algorithm can handle..."
    #GIS #spatial #mapping #hydrology #water #code #algorithm #watershed #delineation #OpenMP #opensource #memory #efficient #CPU #benchmark #MESHED #model #modeling #largescale #catchments

  5. Avoid Backtracking And Burn Your Inputs - CONUS-Scale Watershed Delineation Using OpenMP
    --
    doi.org/10.1016/j.envsoft.2024 <-- shared paper
    --
    β€œHIGHLIGHTS
    β€’ A memory-efficient watershed delineation algorithm was introduced.
    β€’ The new algorithm uses a node-skipping depth-first search to save memory.
    β€’ Both input and output data are stored in a shared matrix to reduce required memory.
    β€’ It performed 95% faster than its CPU benchmark algorithm using 33% less memory.
    β€’ It can solve 50% larger problems than what the CPU benchmark algorithm can handle..."
    #GIS #spatial #mapping #hydrology #water #code #algorithm #watershed #delineation #OpenMP #opensource #memory #efficient #CPU #benchmark #MESHED #model #modeling #largescale #catchments

  6. Avoid Backtracking And Burn Your Inputs - CONUS-Scale Watershed Delineation Using OpenMP
    --
    doi.org/10.1016/j.envsoft.2024 <-- shared paper
    --
    β€œHIGHLIGHTS
    β€’ A memory-efficient watershed delineation algorithm was introduced.
    β€’ The new algorithm uses a node-skipping depth-first search to save memory.
    β€’ Both input and output data are stored in a shared matrix to reduce required memory.
    β€’ It performed 95% faster than its CPU benchmark algorithm using 33% less memory.
    β€’ It can solve 50% larger problems than what the CPU benchmark algorithm can handle..."