<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="https://clawiki.isnew.info/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="https://clawiki.isnew.info/feed.php">
        <title>CLAWRIM Wiki</title>
        <description>The Computational Lab for Advanced Water Resources Informatics and Modeling</description>
        <link>https://clawiki.isnew.info/</link>
        <image rdf:resource="https://clawiki.isnew.info/_media/wiki/logo.png" />
       <dc:date>2026-04-22T01:00:53+00:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://clawiki.isnew.info/projects/fast_flow_accumulation?rev=1722744738&amp;do=diff"/>
                <rdf:li rdf:resource="https://clawiki.isnew.info/projects/open_source_canopy_classification?rev=1722747968&amp;do=diff"/>
                <rdf:li rdf:resource="https://clawiki.isnew.info/projects/efficient_longest_flow_path_algorithm?rev=1722747968&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="https://clawiki.isnew.info/_media/wiki/logo.png">
        <title>CLAWRIM Wiki</title>
        <link>https://clawiki.isnew.info/</link>
        <url>https://clawiki.isnew.info/_media/wiki/logo.png</url>
    </image>
    <item rdf:about="https://clawiki.isnew.info/projects/fast_flow_accumulation?rev=1722744738&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2024-08-04T04:12:18+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>Fast flow accumulation</title>
        <link>https://clawiki.isnew.info/projects/fast_flow_accumulation?rev=1722744738&amp;do=diff</link>
        <description>Fast flow accumulation

This project will improve the speed of flow accumulation.

MEFA



Preliminary results

	*  Systems
		*  Linux 4.14.39 with SSD and 16GB RAM on Yoga 370
		*  ArcGIS on UNG Windows with SSD and 32GB RAM

	*  Data: Texas drain raster from</description>
    </item>
    <item rdf:about="https://clawiki.isnew.info/projects/open_source_canopy_classification?rev=1722747968&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2024-08-04T05:06:08+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>Open source canopy classification</title>
        <link>https://clawiki.isnew.info/projects/open_source_canopy_classification?rev=1722747968&amp;do=diff</link>
        <description>Open source canopy classification

Workspace

[Downtown Atlanta, GA classified]

This project is parallel research to the GFC canopy assessment by 
Owen Smith for Dr. Cho&#039;s GISC 4903 - Special Topics in GIS  .
Its focus is on creating an open source canopy classification system designed 
specifically to utilize NAIP imagery
within an efficient Python module built on 
Scikit-learn, 
GDAL, and</description>
    </item>
    <item rdf:about="https://clawiki.isnew.info/projects/efficient_longest_flow_path_algorithm?rev=1722747968&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2024-08-04T05:06:08+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>Efficient longest flow path algorithm</title>
        <link>https://clawiki.isnew.info/projects/efficient_longest_flow_path_algorithm?rev=1722747968&amp;do=diff</link>
        <description>Efficient longest flow path algorithm

Workspace

r.accumulate



\[
\def\LFP{\overrightarrow{\text{LFP}}}
\def\FP{\overrightarrow{\text{FP}}}
\def\FL{\text{FL}}
\def\DFL{\text{DFL}}
\def\UFL{\text{UFL}}
\def\LFL{\text{LFL}}
\]

A flow path $\FP_i$ is the watercourse between a pair of two points $i$ within the watershed and the longest flow path $\LFP$ is defined as

\[
  \LFP\in\left\{\FP_i\;:\;\left|\FP_i\right|\geq\left|\FP_j\right|\;\forall i\neq j\right\}.
\]

The longest flow path plays an…</description>
    </item>
</rdf:RDF>
