<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Applied Mathematics |</title><link>https://example.com/tags/applied-mathematics/</link><atom:link href="https://example.com/tags/applied-mathematics/index.xml" rel="self" type="application/rss+xml"/><description>Applied Mathematics</description><generator>HugoBlox Kit (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sun, 15 Feb 2026 00:00:00 +0000</lastBuildDate><image><url>https://example.com/media/icon_hu_702a800cd775dbac.png</url><title>Applied Mathematics</title><link>https://example.com/tags/applied-mathematics/</link></image><item><title>TDA-Based Legacy Modernization</title><link>https://example.com/projects/tda_legacy/</link><pubDate>Sun, 15 Feb 2026 00:00:00 +0000</pubDate><guid>https://example.com/projects/tda_legacy/</guid><description>&lt;p&gt;An architectural intelligence engine that utilizes Topological Data Analysis (TDA) to map and disentangle massive legacy monoliths.&lt;/p&gt;
&lt;h3 id="core-methodology"&gt;Core Methodology&lt;/h3&gt;
&lt;p&gt;This tool addresses the complexity of a &lt;strong&gt;2GB legacy monolithic codebase&lt;/strong&gt; by treating code dependencies as a high-dimensional point cloud. By applying &lt;strong&gt;Graph Theory&lt;/strong&gt; and &lt;strong&gt;TDA&lt;/strong&gt;, the engine identifies critical modularization boundaries and hidden bottlenecks that traditional static analysis tools miss.&lt;/p&gt;
&lt;h3 id="impact--performance"&gt;Impact &amp;amp; Performance&lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;Migration Velocity:&lt;/strong&gt; Achieved a &lt;strong&gt;10x increase&lt;/strong&gt; in migration speed through automated boundary detection.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Architectural Mapping:&lt;/strong&gt; Developed a TDA-based engine to visualize complex code dependencies across thousands of files.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Stack:&lt;/strong&gt; Python, &lt;strong&gt;.NET (Roslyn API)&lt;/strong&gt;, and advanced Graph Theory algorithms.&lt;/li&gt;
&lt;/ul&gt;</description></item></channel></rss>