<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:dcterms="http://purl.org/dc/terms/"
 xmlns:cc="http://web.resource.org/cc/"
 xmlns:prism="http://prismstandard.org/namespaces/basic/2.0/"
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns:admin="http://webns.net/mvcb/"
 xmlns:content="http://purl.org/rss/1.0/modules/content/">
    <channel rdf:about="https://www.mdpi.com/rss/journal/appliedmath">
		<title>AppliedMath</title>
		<description>Latest open access articles published in AppliedMath at https://www.mdpi.com/journal/appliedmath</description>
		<link>https://www.mdpi.com/journal/appliedmath</link>
		<admin:generatorAgent rdf:resource="https://www.mdpi.com/journal/appliedmath"/>
		<admin:errorReportsTo rdf:resource="mailto:support@mdpi.com"/>
		<dc:publisher>MDPI</dc:publisher>
		<dc:language>en</dc:language>
		<dc:rights>Creative Commons Attribution (CC-BY)</dc:rights>
						<prism:copyright>MDPI</prism:copyright>
		<prism:rightsAgent>support@mdpi.com</prism:rightsAgent>
		<image rdf:resource="https://pub.mdpi-res.com/img/design/mdpi-pub-logo.png?13cf3b5bd783e021?1784622445"/>
				<items>
			<rdf:Seq>
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/118" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/117" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/116" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/115" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/114" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/113" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/112" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/111" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/110" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/109" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/108" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/107" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/106" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/105" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/104" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/103" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/102" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/7/101" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/100" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/99" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/98" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/97" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/96" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/95" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/94" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/93" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/92" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/91" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/90" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/89" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/88" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/87" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/86" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/85" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/84" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/83" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/6/82" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/81" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/80" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/79" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/78" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/77" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/76" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/75" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/74" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/73" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/72" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/71" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/70" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/69" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/68" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/67" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/66" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/65" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/5/64" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/4/63" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/4/62" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/4/61" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/4/60" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/4/59" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/4/58" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/4/57" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/4/56" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/4/55" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/4/54" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/4/53" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/4/52" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/51" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/50" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/49" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/48" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/47" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/46" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/45" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/44" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/43" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/42" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/41" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/40" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/39" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/38" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/37" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/36" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/3/35" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/34" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/33" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/32" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/31" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/30" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/29" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/28" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/27" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/26" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/25" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/24" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/23" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/22" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/21" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/20" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2673-9909/6/2/19" />
                    	</rdf:Seq>
		</items>
				<cc:license rdf:resource="https://creativecommons.org/licenses/by/4.0/" />
	</channel>

        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/118">

	<title>AppliedMath, Vol. 6, Pages 118: ETDRK4&amp;ndash;Chebyshev Collocation for the Generalized Burgers&amp;ndash;Huxley Equation: Machine-Precision Benchmarks and a Corrected Exact Solution</title>
	<link>https://www.mdpi.com/2673-9909/6/7/118</link>
	<description>The generalized Burgers&amp;amp;ndash;Huxley (gBH) equation arises as a canonical model in nerve-pulse propagation (generalizing the Hodgkin&amp;amp;ndash;Huxley/FitzHugh&amp;amp;ndash;Nagumo excitable-media framework), in population dynamics with Allee-threshold reaction kinetics, and in nonlinear wave propagation in dispersive media; accurate benchmark solutions are essential for quantitative predictions in these domains. We couple the fourth-order exponential time differencing scheme ETDRK4 with a Chebyshev collocation spatial discretization and a linear boundary-lifting procedure to solve the gBH equation on a bounded interval with non-homogeneous Dirichlet data. On the canonical Ismail&amp;amp;ndash;Raslan&amp;amp;ndash;Rabboh travelling-wave benchmark the scheme attains L&amp;amp;infin; errors at the level of floating-point round-off (&amp;amp;sim;10&amp;amp;minus;19 absolute, &amp;amp;sim;10&amp;amp;minus;15 relative) with as few as N=2 collocation points and a single time step of size &amp;amp;Delta;t=1.0&amp;amp;mdash;that is, three total nodes and one ETDRK4 advance. In strongly nonlinear regimes (&amp;amp;gamma;=0.1,&amp;amp;nbsp;0.3,&amp;amp;nbsp;0.5,&amp;amp;nbsp;0.9) the scheme exhibits approximately O(&amp;amp;Delta;t2.45) temporal convergence across all four parameter values, consistent with the classical Hochbruck&amp;amp;ndash;Ostermann order reduction for exponential integrators on parabolic PDEs with non-homogeneous Dirichlet data. Used as a high-accuracy probe, the scheme provides a diagnostic of independent interest: the wave-speed formula of Wang, Zhu and Lu, still appearing as the exact-solution benchmark in numerical studies as recently as 2020, does not satisfy the partial differential equation. The corrected formula stated by Deng and verified symbolically by Appadu and Tijani is the unique value that makes the travelling-wave ansatz a genuine solution. We derive the residual associated with Wang&amp;amp;rsquo;s formula in closed form, R=&amp;amp;gamma;A12(A2&amp;amp;minus;A2W)(1&amp;amp;minus;v2), and show both analytically and numerically that reported errors for schemes benchmarked against Wang&amp;amp;rsquo;s formula coincide with the analytical wave-profile gap &amp;amp;gamma;A12|A2&amp;amp;minus;A2W| rather than with true scheme accuracy. At the Ismail benchmark this gap equals 3.748&amp;amp;times;10&amp;amp;minus;7, which matches the N- and &amp;amp;Delta;t-independent plateau observed when the scheme is measured against Wang&amp;amp;rsquo;s profile. In the nerve-pulse and excitable-media interpretation, the two formulas correspond to action-potential propagation speeds of opposite sign at the Ismail benchmark, underscoring that the correction is not a mere algebraic curiosity but changes the qualitative physical prediction of the model.</description>
	<pubDate>2026-07-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 118: ETDRK4&amp;ndash;Chebyshev Collocation for the Generalized Burgers&amp;ndash;Huxley Equation: Machine-Precision Benchmarks and a Corrected Exact Solution</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/118">doi: 10.3390/appliedmath6070118</a></p>
	<p>Authors:
		Ronobir Chandra Sarker
		Shelly Arora
		Atiqur Rahman
		Mahede- Ul-Hassan
		Sharandeep Singh Pandher
		</p>
	<p>The generalized Burgers&amp;amp;ndash;Huxley (gBH) equation arises as a canonical model in nerve-pulse propagation (generalizing the Hodgkin&amp;amp;ndash;Huxley/FitzHugh&amp;amp;ndash;Nagumo excitable-media framework), in population dynamics with Allee-threshold reaction kinetics, and in nonlinear wave propagation in dispersive media; accurate benchmark solutions are essential for quantitative predictions in these domains. We couple the fourth-order exponential time differencing scheme ETDRK4 with a Chebyshev collocation spatial discretization and a linear boundary-lifting procedure to solve the gBH equation on a bounded interval with non-homogeneous Dirichlet data. On the canonical Ismail&amp;amp;ndash;Raslan&amp;amp;ndash;Rabboh travelling-wave benchmark the scheme attains L&amp;amp;infin; errors at the level of floating-point round-off (&amp;amp;sim;10&amp;amp;minus;19 absolute, &amp;amp;sim;10&amp;amp;minus;15 relative) with as few as N=2 collocation points and a single time step of size &amp;amp;Delta;t=1.0&amp;amp;mdash;that is, three total nodes and one ETDRK4 advance. In strongly nonlinear regimes (&amp;amp;gamma;=0.1,&amp;amp;nbsp;0.3,&amp;amp;nbsp;0.5,&amp;amp;nbsp;0.9) the scheme exhibits approximately O(&amp;amp;Delta;t2.45) temporal convergence across all four parameter values, consistent with the classical Hochbruck&amp;amp;ndash;Ostermann order reduction for exponential integrators on parabolic PDEs with non-homogeneous Dirichlet data. Used as a high-accuracy probe, the scheme provides a diagnostic of independent interest: the wave-speed formula of Wang, Zhu and Lu, still appearing as the exact-solution benchmark in numerical studies as recently as 2020, does not satisfy the partial differential equation. The corrected formula stated by Deng and verified symbolically by Appadu and Tijani is the unique value that makes the travelling-wave ansatz a genuine solution. We derive the residual associated with Wang&amp;amp;rsquo;s formula in closed form, R=&amp;amp;gamma;A12(A2&amp;amp;minus;A2W)(1&amp;amp;minus;v2), and show both analytically and numerically that reported errors for schemes benchmarked against Wang&amp;amp;rsquo;s formula coincide with the analytical wave-profile gap &amp;amp;gamma;A12|A2&amp;amp;minus;A2W| rather than with true scheme accuracy. At the Ismail benchmark this gap equals 3.748&amp;amp;times;10&amp;amp;minus;7, which matches the N- and &amp;amp;Delta;t-independent plateau observed when the scheme is measured against Wang&amp;amp;rsquo;s profile. In the nerve-pulse and excitable-media interpretation, the two formulas correspond to action-potential propagation speeds of opposite sign at the Ismail benchmark, underscoring that the correction is not a mere algebraic curiosity but changes the qualitative physical prediction of the model.</p>
	]]></content:encoded>

	<dc:title>ETDRK4&amp;amp;ndash;Chebyshev Collocation for the Generalized Burgers&amp;amp;ndash;Huxley Equation: Machine-Precision Benchmarks and a Corrected Exact Solution</dc:title>
			<dc:creator>Ronobir Chandra Sarker</dc:creator>
			<dc:creator>Shelly Arora</dc:creator>
			<dc:creator>Atiqur Rahman</dc:creator>
			<dc:creator>Mahede- Ul-Hassan</dc:creator>
			<dc:creator>Sharandeep Singh Pandher</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070118</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-07-22</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-07-22</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>118</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070118</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/118</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/117">

	<title>AppliedMath, Vol. 6, Pages 117: Strang Splitting Combined with Periodically Fitted Adams&amp;ndash;Bashforth&amp;ndash;Moulton Method for High-Precision Simulation of Multiplicative Noise SDEs with Periodic Drift</title>
	<link>https://www.mdpi.com/2673-9909/6/7/117</link>
	<description>Many applications in finance and biology involve multiplicative noise geometric Brownian motion (GBM)-type stochastic differential equations (SDEs) whose drift carries a single dominant periodic component. Such structures arise in seasonal Black&amp;amp;ndash;Scholes option pricing, commodity derivatives with annual price cycles, and stochastic biological oscillators driven by a known frequency; the primary contribution of this paper is a high-precision numerical scheme validated on GBM-type test problems with periodic drift. This paper proposes a Strang operator splitting scheme within the Logarithmic Drift-Diffusion Splitting (LDDS) framework, which splits the SDE in y-space into a deterministic drift ODE sub-step (Step A) and an exactly solvable multiplicative diffusion sub-step (Step B). Step A employs the Periodically Fitted Adams&amp;amp;ndash;Bashforth&amp;amp;ndash;Moulton fourth-order predictor&amp;amp;ndash;corrector method (PABM4), which achieves zero local truncation error for trigonometric forcing terms by introducing additional shift terms and simultaneously imposing polynomial exactness conditions and trigonometric fitting conditions. When the Step A forcing belongs to the PABM4 exact function class F&amp;amp;omega;=span{1,t,t2,sin&amp;amp;omega;t,cos&amp;amp;omega;t}, the Strang+PABM4 scheme achieves floating-point precision saturation. We investigate three test problems: the cosine-drift GBM (Test Problem 1), the polynomial&amp;amp;ndash;trigonometric mixed drift GBM (Test Problem 2), and a dual-frequency drift applicability test (Test Problem 3). Monte Carlo strong error experiments (M=1000 paths) validate that Strang+PABM4 achieves saturation at machine precision (&amp;amp;asymp;10&amp;amp;minus;15) on Test Problems 1 and 2, improving precision by &amp;amp;asymp;102&amp;amp;times; over the best algebraically convergent reference. Test Problem 3 identifies the method&amp;amp;rsquo;s applicability boundary: when the drift contains a second frequency outside F&amp;amp;omega;, Strang+PABM4 degrades gracefully to order &amp;amp;asymp; 4 without catastrophic failure. The floating-point saturation of Strang+PABM4 is contingent on the drift belonging to F^&amp;amp;omega;; when this condition is violated, the method degrades gracefully to algebraic order &amp;amp;asymp; 4, as demonstrated in Test Problem 3.</description>
	<pubDate>2026-07-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 117: Strang Splitting Combined with Periodically Fitted Adams&amp;ndash;Bashforth&amp;ndash;Moulton Method for High-Precision Simulation of Multiplicative Noise SDEs with Periodic Drift</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/117">doi: 10.3390/appliedmath6070117</a></p>
	<p>Authors:
		Yumu Lu
		Su Hoe Yeak
		</p>
	<p>Many applications in finance and biology involve multiplicative noise geometric Brownian motion (GBM)-type stochastic differential equations (SDEs) whose drift carries a single dominant periodic component. Such structures arise in seasonal Black&amp;amp;ndash;Scholes option pricing, commodity derivatives with annual price cycles, and stochastic biological oscillators driven by a known frequency; the primary contribution of this paper is a high-precision numerical scheme validated on GBM-type test problems with periodic drift. This paper proposes a Strang operator splitting scheme within the Logarithmic Drift-Diffusion Splitting (LDDS) framework, which splits the SDE in y-space into a deterministic drift ODE sub-step (Step A) and an exactly solvable multiplicative diffusion sub-step (Step B). Step A employs the Periodically Fitted Adams&amp;amp;ndash;Bashforth&amp;amp;ndash;Moulton fourth-order predictor&amp;amp;ndash;corrector method (PABM4), which achieves zero local truncation error for trigonometric forcing terms by introducing additional shift terms and simultaneously imposing polynomial exactness conditions and trigonometric fitting conditions. When the Step A forcing belongs to the PABM4 exact function class F&amp;amp;omega;=span{1,t,t2,sin&amp;amp;omega;t,cos&amp;amp;omega;t}, the Strang+PABM4 scheme achieves floating-point precision saturation. We investigate three test problems: the cosine-drift GBM (Test Problem 1), the polynomial&amp;amp;ndash;trigonometric mixed drift GBM (Test Problem 2), and a dual-frequency drift applicability test (Test Problem 3). Monte Carlo strong error experiments (M=1000 paths) validate that Strang+PABM4 achieves saturation at machine precision (&amp;amp;asymp;10&amp;amp;minus;15) on Test Problems 1 and 2, improving precision by &amp;amp;asymp;102&amp;amp;times; over the best algebraically convergent reference. Test Problem 3 identifies the method&amp;amp;rsquo;s applicability boundary: when the drift contains a second frequency outside F&amp;amp;omega;, Strang+PABM4 degrades gracefully to order &amp;amp;asymp; 4 without catastrophic failure. The floating-point saturation of Strang+PABM4 is contingent on the drift belonging to F^&amp;amp;omega;; when this condition is violated, the method degrades gracefully to algebraic order &amp;amp;asymp; 4, as demonstrated in Test Problem 3.</p>
	]]></content:encoded>

	<dc:title>Strang Splitting Combined with Periodically Fitted Adams&amp;amp;ndash;Bashforth&amp;amp;ndash;Moulton Method for High-Precision Simulation of Multiplicative Noise SDEs with Periodic Drift</dc:title>
			<dc:creator>Yumu Lu</dc:creator>
			<dc:creator>Su Hoe Yeak</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070117</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-07-22</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-07-22</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>117</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070117</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/117</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/116">

	<title>AppliedMath, Vol. 6, Pages 116: Computing with HACCP Risk and Safety Characterizations</title>
	<link>https://www.mdpi.com/2673-9909/6/7/116</link>
	<description>The focus of this paper is the semi-quantitative approach to risk analysis in HACCP (Hazard Analysis and Critical Control Points), where we show how alternative computations in the risk matrix, combining probability and impact, can be provided based on algebraic and many-valued logical techniques. Doing so, we further show how applying such computations requires being formal concerning underlying information structures, which in turn enables being formal concerning functional representation of mappings between information structures appearing within risk analysis in risk management. Our mathematical algebraic framework also enables a more formal treatment of the duality between threat and opportunity.</description>
	<pubDate>2026-07-20</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 116: Computing with HACCP Risk and Safety Characterizations</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/116">doi: 10.3390/appliedmath6070116</a></p>
	<p>Authors:
		Darija Semenoja
		Minna Sinkkonen
		Patrik Eklund
		</p>
	<p>The focus of this paper is the semi-quantitative approach to risk analysis in HACCP (Hazard Analysis and Critical Control Points), where we show how alternative computations in the risk matrix, combining probability and impact, can be provided based on algebraic and many-valued logical techniques. Doing so, we further show how applying such computations requires being formal concerning underlying information structures, which in turn enables being formal concerning functional representation of mappings between information structures appearing within risk analysis in risk management. Our mathematical algebraic framework also enables a more formal treatment of the duality between threat and opportunity.</p>
	]]></content:encoded>

	<dc:title>Computing with HACCP Risk and Safety Characterizations</dc:title>
			<dc:creator>Darija Semenoja</dc:creator>
			<dc:creator>Minna Sinkkonen</dc:creator>
			<dc:creator>Patrik Eklund</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070116</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-07-20</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-07-20</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>116</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070116</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/116</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/115">

	<title>AppliedMath, Vol. 6, Pages 115: Research on Mathematical Modeling of Infectious Disease Spread on Cruise Ships</title>
	<link>https://www.mdpi.com/2673-9909/6/7/115</link>
	<description>Cruise ships, characterized by high density, enclosed environments and shared facilities, have become amplifiers for infectious disease outbreaks; however, predicting transmission in such settings remains challenging due to small initial case numbers. In this study, a mathematical modeling framework&amp;amp;mdash;including compartmental, small-world (SW), and scale-free (SF) network models&amp;amp;mdash;was developed to analyze the dynamics of hantavirus and norovirus transmission on recent cruise ship outbreaks. The results show that when the initial number of exposed or infected individuals is extremely small (e.g., 1&amp;amp;ndash;2 persons), disease spread is dominated by stochasticity, causing substantial variation between individual simulations and mean model predictions. Notably, SF networks exhibited lower transmission risk under these conditions, contradicting the theoretical expectation that when the population is large, SF networks facilitate the spread of disease. The compartmental model, while consistent with average simulation outcomes, failed to reliably predict any single outbreak event. In conclusion, for closed environments such as cruise ships with very few initial cases, stochastic variability is essential, and single-outbreak outcomes should be understood as highly contingent rather than deterministically predictable.</description>
	<pubDate>2026-07-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 115: Research on Mathematical Modeling of Infectious Disease Spread on Cruise Ships</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/115">doi: 10.3390/appliedmath6070115</a></p>
	<p>Authors:
		Guojin Wang
		Wei Yao
		</p>
	<p>Cruise ships, characterized by high density, enclosed environments and shared facilities, have become amplifiers for infectious disease outbreaks; however, predicting transmission in such settings remains challenging due to small initial case numbers. In this study, a mathematical modeling framework&amp;amp;mdash;including compartmental, small-world (SW), and scale-free (SF) network models&amp;amp;mdash;was developed to analyze the dynamics of hantavirus and norovirus transmission on recent cruise ship outbreaks. The results show that when the initial number of exposed or infected individuals is extremely small (e.g., 1&amp;amp;ndash;2 persons), disease spread is dominated by stochasticity, causing substantial variation between individual simulations and mean model predictions. Notably, SF networks exhibited lower transmission risk under these conditions, contradicting the theoretical expectation that when the population is large, SF networks facilitate the spread of disease. The compartmental model, while consistent with average simulation outcomes, failed to reliably predict any single outbreak event. In conclusion, for closed environments such as cruise ships with very few initial cases, stochastic variability is essential, and single-outbreak outcomes should be understood as highly contingent rather than deterministically predictable.</p>
	]]></content:encoded>

	<dc:title>Research on Mathematical Modeling of Infectious Disease Spread on Cruise Ships</dc:title>
			<dc:creator>Guojin Wang</dc:creator>
			<dc:creator>Wei Yao</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070115</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-07-17</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-07-17</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>115</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070115</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/115</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/114">

	<title>AppliedMath, Vol. 6, Pages 114: On a Procedure for Constructing A &amp;otimes; A* Matrices of a Size 3 &amp;times; 3 in Max-Plus Algebra</title>
	<link>https://www.mdpi.com/2673-9909/6/7/114</link>
	<description>This paper presents a procedure for constructing a matrix A&amp;amp;otimes;A* of a size 3&amp;amp;times;3 in max-plus algebra. The max-algebraic product of a matrix A and its conjugate (negative transpose) matrix A* always yields a pseudo skew-symmetric matrix. We address the inverse problem: given a matrix A&amp;amp;tilde; of this type, can one determine a matrix A such that A&amp;amp;otimes;A*=A&amp;amp;tilde;? A particular case involving 3&amp;amp;times;3 matrices is examined, and one procedure is explained in detail. The method illustrates how such a matrix A can be constructed column by column while also indicating directions for further generalization and computational exploration.</description>
	<pubDate>2026-07-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 114: On a Procedure for Constructing A &amp;otimes; A* Matrices of a Size 3 &amp;times; 3 in Max-Plus Algebra</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/114">doi: 10.3390/appliedmath6070114</a></p>
	<p>Authors:
		Bojana Stojčetović
		</p>
	<p>This paper presents a procedure for constructing a matrix A&amp;amp;otimes;A* of a size 3&amp;amp;times;3 in max-plus algebra. The max-algebraic product of a matrix A and its conjugate (negative transpose) matrix A* always yields a pseudo skew-symmetric matrix. We address the inverse problem: given a matrix A&amp;amp;tilde; of this type, can one determine a matrix A such that A&amp;amp;otimes;A*=A&amp;amp;tilde;? A particular case involving 3&amp;amp;times;3 matrices is examined, and one procedure is explained in detail. The method illustrates how such a matrix A can be constructed column by column while also indicating directions for further generalization and computational exploration.</p>
	]]></content:encoded>

	<dc:title>On a Procedure for Constructing A &amp;amp;otimes; A* Matrices of a Size 3 &amp;amp;times; 3 in Max-Plus Algebra</dc:title>
			<dc:creator>Bojana Stojčetović</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070114</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-07-16</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-07-16</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>114</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070114</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/114</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/113">

	<title>AppliedMath, Vol. 6, Pages 113: Machine Learning Lifecycle: A Survey</title>
	<link>https://www.mdpi.com/2673-9909/6/7/113</link>
	<description>The operationalization of machine learning (ML) introduces distinct engineering and lifecycle management challenges&amp;amp;mdash;such as extreme data dependence, silent model degradation (concept drift), and inherent non-determinism&amp;amp;mdash;which traditional software engineering workflows fail to adequately address. This systematic literature review provides a rigorous, comprehensive mapping of the ML lifecycle domain between 2015 and 2025 using the PRISMA protocol. Out of an initial pool of 12,450 articles, a highly specialized cohort of 22 primary studies was extracted, classified, and synthesized to map out contemporary Machine Learning Operations (MLOps) patterns, technical debt structures, governance models, and security vulnerabilities. To address the documented &amp;amp;ldquo;production gap,&amp;amp;rdquo; this paper formalizes the findings into a synthesized operational mapping and introduces a preliminary conceptual layout for an Adaptive Lifecycle Framework (ALF), juxtaposing it with legacy paradigms like CRISP-DM. Furthermore, we expand the scope to investigate domain-specific lifecycle complexities in healthcare systems and Large Language Model (LLM) pipelines, providing an essential evolutionary baseline for sustainable MLOps.</description>
	<pubDate>2026-07-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 113: Machine Learning Lifecycle: A Survey</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/113">doi: 10.3390/appliedmath6070113</a></p>
	<p>Authors:
		Ioannis Kosmas
		Theofanis Papadopoulos
		Christos Michalakelis
		</p>
	<p>The operationalization of machine learning (ML) introduces distinct engineering and lifecycle management challenges&amp;amp;mdash;such as extreme data dependence, silent model degradation (concept drift), and inherent non-determinism&amp;amp;mdash;which traditional software engineering workflows fail to adequately address. This systematic literature review provides a rigorous, comprehensive mapping of the ML lifecycle domain between 2015 and 2025 using the PRISMA protocol. Out of an initial pool of 12,450 articles, a highly specialized cohort of 22 primary studies was extracted, classified, and synthesized to map out contemporary Machine Learning Operations (MLOps) patterns, technical debt structures, governance models, and security vulnerabilities. To address the documented &amp;amp;ldquo;production gap,&amp;amp;rdquo; this paper formalizes the findings into a synthesized operational mapping and introduces a preliminary conceptual layout for an Adaptive Lifecycle Framework (ALF), juxtaposing it with legacy paradigms like CRISP-DM. Furthermore, we expand the scope to investigate domain-specific lifecycle complexities in healthcare systems and Large Language Model (LLM) pipelines, providing an essential evolutionary baseline for sustainable MLOps.</p>
	]]></content:encoded>

	<dc:title>Machine Learning Lifecycle: A Survey</dc:title>
			<dc:creator>Ioannis Kosmas</dc:creator>
			<dc:creator>Theofanis Papadopoulos</dc:creator>
			<dc:creator>Christos Michalakelis</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070113</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-07-15</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-07-15</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>113</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070113</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/113</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/112">

	<title>AppliedMath, Vol. 6, Pages 112: Comparative Analysis of Second- and Fourth-Order Runge&amp;ndash;Kutta Methods for Solving Chaotic Dynamical Systems</title>
	<link>https://www.mdpi.com/2673-9909/6/7/112</link>
	<description>This study presents a comparative numerical investigation of second-order and fourth-order Runge&amp;amp;ndash;Kutta methods for solving chaotic dynamical systems. The Lorenz, Genesio&amp;amp;ndash;Tesi, and R&amp;amp;ouml;ssler systems are considered because of their nonlinear behavior and high sensitivity to initial conditions. The numerical schemes investigated include the Midpoint, Improved Euler, Ralston, and fourth-order Runge&amp;amp;ndash;Kutta (RK4) methods. The performance of the methods is evaluated in terms of convergence behavior, numerical accuracy, stability characteristics, and computational cost. A stability analysis of each chaotic system is carried out through equilibrium point determination and Jacobian eigenvalue analysis. Numerical simulations are implemented in MATLAB 2023 version, and comparisons are performed using different step sizes. The results indicate that all numerical methods converge as the step size decreases; however, the RK4 method consistently provides significantly smaller errors and improved stability properties compared with the second-order schemes. The findings further demonstrate that higher-order numerical integration methods provide superior performance for highly sensitive chaotic systems where accuracy and reliability are essential.</description>
	<pubDate>2026-07-14</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 112: Comparative Analysis of Second- and Fourth-Order Runge&amp;ndash;Kutta Methods for Solving Chaotic Dynamical Systems</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/112">doi: 10.3390/appliedmath6070112</a></p>
	<p>Authors:
		Ndivhuwo Ndou
		</p>
	<p>This study presents a comparative numerical investigation of second-order and fourth-order Runge&amp;amp;ndash;Kutta methods for solving chaotic dynamical systems. The Lorenz, Genesio&amp;amp;ndash;Tesi, and R&amp;amp;ouml;ssler systems are considered because of their nonlinear behavior and high sensitivity to initial conditions. The numerical schemes investigated include the Midpoint, Improved Euler, Ralston, and fourth-order Runge&amp;amp;ndash;Kutta (RK4) methods. The performance of the methods is evaluated in terms of convergence behavior, numerical accuracy, stability characteristics, and computational cost. A stability analysis of each chaotic system is carried out through equilibrium point determination and Jacobian eigenvalue analysis. Numerical simulations are implemented in MATLAB 2023 version, and comparisons are performed using different step sizes. The results indicate that all numerical methods converge as the step size decreases; however, the RK4 method consistently provides significantly smaller errors and improved stability properties compared with the second-order schemes. The findings further demonstrate that higher-order numerical integration methods provide superior performance for highly sensitive chaotic systems where accuracy and reliability are essential.</p>
	]]></content:encoded>

	<dc:title>Comparative Analysis of Second- and Fourth-Order Runge&amp;amp;ndash;Kutta Methods for Solving Chaotic Dynamical Systems</dc:title>
			<dc:creator>Ndivhuwo Ndou</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070112</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-07-14</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-07-14</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>112</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070112</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/112</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/111">

	<title>AppliedMath, Vol. 6, Pages 111: An Improved Mathematical Approach for Ameliorated Inventory Models</title>
	<link>https://www.mdpi.com/2673-9909/6/7/111</link>
	<description>This paper solves the open problem mentioned by Lin that was published in 2026 of Algorithms to prove the uniqueness property for the solution procedure proposed by Lin. The developed mathematical verification fulfills the research gap left by Lin. Moreover, for the local maximum point near the starting point (denoted as 3&amp;amp;times;10&amp;amp;minus;7) of the amelioration inventory model, this study presents an alternative explanation to help researchers execute their numerical methods with confidence such that, without the analytical procedure developed by Lin, only a rough numerical method can help researchers locate two local maximum points.</description>
	<pubDate>2026-07-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 111: An Improved Mathematical Approach for Ameliorated Inventory Models</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/111">doi: 10.3390/appliedmath6070111</a></p>
	<p>Authors:
		Yung-Ning Cheng
		Ching-Wen Yeh
		Kuo-Chen Hung
		</p>
	<p>This paper solves the open problem mentioned by Lin that was published in 2026 of Algorithms to prove the uniqueness property for the solution procedure proposed by Lin. The developed mathematical verification fulfills the research gap left by Lin. Moreover, for the local maximum point near the starting point (denoted as 3&amp;amp;times;10&amp;amp;minus;7) of the amelioration inventory model, this study presents an alternative explanation to help researchers execute their numerical methods with confidence such that, without the analytical procedure developed by Lin, only a rough numerical method can help researchers locate two local maximum points.</p>
	]]></content:encoded>

	<dc:title>An Improved Mathematical Approach for Ameliorated Inventory Models</dc:title>
			<dc:creator>Yung-Ning Cheng</dc:creator>
			<dc:creator>Ching-Wen Yeh</dc:creator>
			<dc:creator>Kuo-Chen Hung</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070111</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-07-13</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-07-13</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>111</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070111</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/111</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/110">

	<title>AppliedMath, Vol. 6, Pages 110: Displacement-Constrained Continuum Structure Topology Optimization Based on an Improved Movable Morphable Smooth-Boundary Method</title>
	<link>https://www.mdpi.com/2673-9909/6/7/110</link>
	<description>To address jagged boundaries in conventional fixed-mesh topology optimization and the discontinuous transfer of topology information after remeshing, this study proposes an improved Movable Morphable Smooth-Boundary (MMSB) method for displacement-constrained continuum topology optimization. A topology optimization model is established using the Independent Continuous Mapping (ICM) method, with structural weight minimization as the objective and displacement as the constraint. In the proposed framework, a triangular mesh is adopted as the current analysis mesh, threshold boundary points are identified using a holographic scanning strategy, and a fixed background mesh is introduced as an intermediate carrier for topology-variable transfer before and after remeshing. Three numerical examples are used to validate the proposed method and to compare it with the original MMSB method. The results show that the proposed method produces clearer boundary representations and more distinct load-transfer paths. In Examples 1&amp;amp;ndash;3, the number of result analyses is reduced from 60 to 24, from 144 to 36, and from 112 to 24, respectively. The number of boundary movements is also reduced from 5 to 4, from 8 to 6, and from 7 to 4, respectively. Meanwhile, the final structural weights are 22.0 kg, 101.4 kg, and 1.64 kg, which are close to or slightly lower than those obtained by the original MMSB method. These results indicate that the proposed method improves topology-information continuity and boundary representation while maintaining structural performance.</description>
	<pubDate>2026-07-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 110: Displacement-Constrained Continuum Structure Topology Optimization Based on an Improved Movable Morphable Smooth-Boundary Method</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/110">doi: 10.3390/appliedmath6070110</a></p>
	<p>Authors:
		Jiazheng Du
		Bing Lin
		Hongling Ye
		Zhichao Guo
		</p>
	<p>To address jagged boundaries in conventional fixed-mesh topology optimization and the discontinuous transfer of topology information after remeshing, this study proposes an improved Movable Morphable Smooth-Boundary (MMSB) method for displacement-constrained continuum topology optimization. A topology optimization model is established using the Independent Continuous Mapping (ICM) method, with structural weight minimization as the objective and displacement as the constraint. In the proposed framework, a triangular mesh is adopted as the current analysis mesh, threshold boundary points are identified using a holographic scanning strategy, and a fixed background mesh is introduced as an intermediate carrier for topology-variable transfer before and after remeshing. Three numerical examples are used to validate the proposed method and to compare it with the original MMSB method. The results show that the proposed method produces clearer boundary representations and more distinct load-transfer paths. In Examples 1&amp;amp;ndash;3, the number of result analyses is reduced from 60 to 24, from 144 to 36, and from 112 to 24, respectively. The number of boundary movements is also reduced from 5 to 4, from 8 to 6, and from 7 to 4, respectively. Meanwhile, the final structural weights are 22.0 kg, 101.4 kg, and 1.64 kg, which are close to or slightly lower than those obtained by the original MMSB method. These results indicate that the proposed method improves topology-information continuity and boundary representation while maintaining structural performance.</p>
	]]></content:encoded>

	<dc:title>Displacement-Constrained Continuum Structure Topology Optimization Based on an Improved Movable Morphable Smooth-Boundary Method</dc:title>
			<dc:creator>Jiazheng Du</dc:creator>
			<dc:creator>Bing Lin</dc:creator>
			<dc:creator>Hongling Ye</dc:creator>
			<dc:creator>Zhichao Guo</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070110</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-07-09</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-07-09</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>110</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070110</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/110</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/109">

	<title>AppliedMath, Vol. 6, Pages 109: Fractional Complex Representation Learning with Memory Effects for Multi-Scale Knowledge Graph Modeling</title>
	<link>https://www.mdpi.com/2673-9909/6/7/109</link>
	<description>Complex-valued knowledge graph embedding (KGE) models like ComplEx effectively capture asymmetric relations but are fundamentally constrained by integer-order transformations. This restriction limits their ability to model multi-scale interactions, hierarchical correlations, and non-local semantic dependencies inherent in heterogeneous graphs. To address these limitations, this paper introduces FracComplEx, a novel fractional-order extension that embeds fractional calculus into the complex latent space. By leveraging fractional operators, the framework introduces non-local dynamics and memory-aware mechanisms to continuously generalize standard linear transformations. The core architecture employs a fractional-order parameter &amp;amp;alpha; as a controllable scaling mechanism that balances local relational details with global topology, optimizing representation smoothness and flexibility. We provide rigorous theoretical findings demonstrating that fractional transformations enhance the embedding&amp;amp;rsquo;s expressive capacity, spectral characteristics, and perturbation robustness beyond conventional integer-order benchmarks. Extensive experiments on FB15k-237, WN18RR, and CoDEx-M establish the empirical superiority of FracComplEx, yielding significant improvements in Mean Reciprocal Rank (MRR) and Hits@K metrics over classical baselines, particularly under severe structural data sparsity.</description>
	<pubDate>2026-07-03</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 109: Fractional Complex Representation Learning with Memory Effects for Multi-Scale Knowledge Graph Modeling</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/109">doi: 10.3390/appliedmath6070109</a></p>
	<p>Authors:
		Ahmed Nuino
		Omar Bahou
		Senhaji Yassine
		Mustapha Ez-zaiym
		Karim El Moutaouakil
		Savin Treanta
		</p>
	<p>Complex-valued knowledge graph embedding (KGE) models like ComplEx effectively capture asymmetric relations but are fundamentally constrained by integer-order transformations. This restriction limits their ability to model multi-scale interactions, hierarchical correlations, and non-local semantic dependencies inherent in heterogeneous graphs. To address these limitations, this paper introduces FracComplEx, a novel fractional-order extension that embeds fractional calculus into the complex latent space. By leveraging fractional operators, the framework introduces non-local dynamics and memory-aware mechanisms to continuously generalize standard linear transformations. The core architecture employs a fractional-order parameter &amp;amp;alpha; as a controllable scaling mechanism that balances local relational details with global topology, optimizing representation smoothness and flexibility. We provide rigorous theoretical findings demonstrating that fractional transformations enhance the embedding&amp;amp;rsquo;s expressive capacity, spectral characteristics, and perturbation robustness beyond conventional integer-order benchmarks. Extensive experiments on FB15k-237, WN18RR, and CoDEx-M establish the empirical superiority of FracComplEx, yielding significant improvements in Mean Reciprocal Rank (MRR) and Hits@K metrics over classical baselines, particularly under severe structural data sparsity.</p>
	]]></content:encoded>

	<dc:title>Fractional Complex Representation Learning with Memory Effects for Multi-Scale Knowledge Graph Modeling</dc:title>
			<dc:creator>Ahmed Nuino</dc:creator>
			<dc:creator>Omar Bahou</dc:creator>
			<dc:creator>Senhaji Yassine</dc:creator>
			<dc:creator>Mustapha Ez-zaiym</dc:creator>
			<dc:creator>Karim El Moutaouakil</dc:creator>
			<dc:creator>Savin Treanta</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070109</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-07-03</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-07-03</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>109</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070109</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/109</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/108">

	<title>AppliedMath, Vol. 6, Pages 108: Modeling and Dynamical Analysis of a Fractional-Order Predation Model Incorporating Disease and Cooperative Hunting</title>
	<link>https://www.mdpi.com/2673-9909/6/7/108</link>
	<description>This study constructs a novel fractional-order eco-epidemiological predator&amp;amp;ndash;prey model, in which disease spreads among predators through environmental transmission, and both cooperative hunting behavior and disease latency delay are incorporated simultaneously. Different from classical integer-order predator&amp;amp;ndash;prey models, fractional derivative is adopted to describe the memory-dependent mechanism of ecological populations, and the infection can alter the hunting strategy of diseased predators. The existence, non-negativity, and boundedness of system solutions are proved theoretically. The local stability of all equilibrium points is analyzed, and the conditions for the occurrence of Hopf bifurcation induced by latency delay are derived. Numerical simulations further verify the theoretical results, and quantitatively reveal the separate and combined effects of the fractional order, cooperative hunting coefficient, and latency delay on the dynamical evolution of the population system.</description>
	<pubDate>2026-07-02</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 108: Modeling and Dynamical Analysis of a Fractional-Order Predation Model Incorporating Disease and Cooperative Hunting</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/108">doi: 10.3390/appliedmath6070108</a></p>
	<p>Authors:
		Ahmadjan Muhammadhaji
		Hui Zhang
		</p>
	<p>This study constructs a novel fractional-order eco-epidemiological predator&amp;amp;ndash;prey model, in which disease spreads among predators through environmental transmission, and both cooperative hunting behavior and disease latency delay are incorporated simultaneously. Different from classical integer-order predator&amp;amp;ndash;prey models, fractional derivative is adopted to describe the memory-dependent mechanism of ecological populations, and the infection can alter the hunting strategy of diseased predators. The existence, non-negativity, and boundedness of system solutions are proved theoretically. The local stability of all equilibrium points is analyzed, and the conditions for the occurrence of Hopf bifurcation induced by latency delay are derived. Numerical simulations further verify the theoretical results, and quantitatively reveal the separate and combined effects of the fractional order, cooperative hunting coefficient, and latency delay on the dynamical evolution of the population system.</p>
	]]></content:encoded>

	<dc:title>Modeling and Dynamical Analysis of a Fractional-Order Predation Model Incorporating Disease and Cooperative Hunting</dc:title>
			<dc:creator>Ahmadjan Muhammadhaji</dc:creator>
			<dc:creator>Hui Zhang</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070108</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-07-02</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-07-02</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>108</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070108</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/108</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/107">

	<title>AppliedMath, Vol. 6, Pages 107: Thermodynamic Analysis of an Ideal Compressed Air Energy Storage (CAES) Cycle Integrated with a Solar Booster</title>
	<link>https://www.mdpi.com/2673-9909/6/7/107</link>
	<description>This study presents an ideal-cycle thermodynamic analysis of an advanced compressed air energy storage (A-CAES) system with single thermal energy storage (TES) and an external heat boost. The additional heat is represented by a solar heat source, although the analysis is equally applicable to other forms of externally supplied thermal energy. Following the classical thermodynamic approach used for ideal cycles such as the Brayton, Otto and Diesel cycles, the objective is to establish analytical relationships and performance bounds for the integrated system rather than to model a specific engineering configuration. Three principal performance measures are examined: the electrical round-trip coefficient of performance (CoP), the marginal thermal coefficient of performance associated with external heat addition, and the overall second-law efficiency. Closed-form analytical expressions are derived for these quantities under idealised but still practically relevant assumptions. The analysis identifies distinct operating regimes governed by the level of external heat input and establishes analytical transition conditions between them. It is shown that external heat addition can substantially increase the round-trip coefficient of performance and lead to high marginal heat-utilisation effectiveness. A rigorous upper bound on the second-law efficiency is also obtained from a complete-cycle exergy analysis, demonstrating consistency with the laws of thermodynamics. The results provide analytical insight into the fundamental thermodynamic structure of solar-assisted A-CAES systems and establish performance bounds that are independent of any particular engineering implementation.</description>
	<pubDate>2026-07-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 107: Thermodynamic Analysis of an Ideal Compressed Air Energy Storage (CAES) Cycle Integrated with a Solar Booster</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/107">doi: 10.3390/appliedmath6070107</a></p>
	<p>Authors:
		Aayush Samant
		Alexander Y. Klimenko
		Yuanshen Lu
		Mayank Kumar
		</p>
	<p>This study presents an ideal-cycle thermodynamic analysis of an advanced compressed air energy storage (A-CAES) system with single thermal energy storage (TES) and an external heat boost. The additional heat is represented by a solar heat source, although the analysis is equally applicable to other forms of externally supplied thermal energy. Following the classical thermodynamic approach used for ideal cycles such as the Brayton, Otto and Diesel cycles, the objective is to establish analytical relationships and performance bounds for the integrated system rather than to model a specific engineering configuration. Three principal performance measures are examined: the electrical round-trip coefficient of performance (CoP), the marginal thermal coefficient of performance associated with external heat addition, and the overall second-law efficiency. Closed-form analytical expressions are derived for these quantities under idealised but still practically relevant assumptions. The analysis identifies distinct operating regimes governed by the level of external heat input and establishes analytical transition conditions between them. It is shown that external heat addition can substantially increase the round-trip coefficient of performance and lead to high marginal heat-utilisation effectiveness. A rigorous upper bound on the second-law efficiency is also obtained from a complete-cycle exergy analysis, demonstrating consistency with the laws of thermodynamics. The results provide analytical insight into the fundamental thermodynamic structure of solar-assisted A-CAES systems and establish performance bounds that are independent of any particular engineering implementation.</p>
	]]></content:encoded>

	<dc:title>Thermodynamic Analysis of an Ideal Compressed Air Energy Storage (CAES) Cycle Integrated with a Solar Booster</dc:title>
			<dc:creator>Aayush Samant</dc:creator>
			<dc:creator>Alexander Y. Klimenko</dc:creator>
			<dc:creator>Yuanshen Lu</dc:creator>
			<dc:creator>Mayank Kumar</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070107</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-07-01</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-07-01</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>107</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070107</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/107</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/106">

	<title>AppliedMath, Vol. 6, Pages 106: Bootstrap-Assisted Inference for Interpretable Feature Importance in High-Dimensional Black-Box Models</title>
	<link>https://www.mdpi.com/2673-9909/6/7/106</link>
	<description>The rapid growth of high-dimensional predictive models in science and industry has intensified the need for statistically rigorous interpretability tools. Although model-agnostic feature importance methods are widely used to explain black-box models, they lack formal uncertainty quantification, leading to unreliable conclusions in high-dimensional settings where spurious correlations are common. We propose a Bootstrap-of-Bootstrap (BoB) inference framework that enables valid uncertainty quantification and hypothesis testing for any model-agnostic feature importance measure. To overcome the high computational cost of nested resampling, we develop an efficient analytical approximation based on influence function theory. The proposed approach provides calibrated confidence intervals and a stability score for each feature, strengthening the statistical foundations of explainable AI. Simulation studies and real-world applications in cancer genomics and credit risk modeling demonstrate its effectiveness, providing reliable, auditable explanations for high-stakes decision-making.</description>
	<pubDate>2026-07-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 106: Bootstrap-Assisted Inference for Interpretable Feature Importance in High-Dimensional Black-Box Models</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/106">doi: 10.3390/appliedmath6070106</a></p>
	<p>Authors:
		Ibrahim Sadok
		Hennia Douini
		Saqer Abdullah Faqih
		Ramy A. Aldallal
		</p>
	<p>The rapid growth of high-dimensional predictive models in science and industry has intensified the need for statistically rigorous interpretability tools. Although model-agnostic feature importance methods are widely used to explain black-box models, they lack formal uncertainty quantification, leading to unreliable conclusions in high-dimensional settings where spurious correlations are common. We propose a Bootstrap-of-Bootstrap (BoB) inference framework that enables valid uncertainty quantification and hypothesis testing for any model-agnostic feature importance measure. To overcome the high computational cost of nested resampling, we develop an efficient analytical approximation based on influence function theory. The proposed approach provides calibrated confidence intervals and a stability score for each feature, strengthening the statistical foundations of explainable AI. Simulation studies and real-world applications in cancer genomics and credit risk modeling demonstrate its effectiveness, providing reliable, auditable explanations for high-stakes decision-making.</p>
	]]></content:encoded>

	<dc:title>Bootstrap-Assisted Inference for Interpretable Feature Importance in High-Dimensional Black-Box Models</dc:title>
			<dc:creator>Ibrahim Sadok</dc:creator>
			<dc:creator>Hennia Douini</dc:creator>
			<dc:creator>Saqer Abdullah Faqih</dc:creator>
			<dc:creator>Ramy A. Aldallal</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070106</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-07-01</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-07-01</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>106</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070106</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/106</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/105">

	<title>AppliedMath, Vol. 6, Pages 105: A High-Strain-Rate Viscohyperelastic Constitutive Framework for Soft Biological Tissues: A Multi-Tissue Evaluation</title>
	<link>https://www.mdpi.com/2673-9909/6/7/105</link>
	<description>Viscous effects play an important role in the mechanical characterization of soft biological tissues under high-strain-rate loading. Accurate modeling of these behaviors is important for impact biomechanics, injury prediction, and crash safety analysis, in which biological tissues may experience high-strain-rate deformation. To describe the dynamic mechanical responses of soft tissues, a reliable constitutive framework is therefore needed to represent the dynamic response of soft tissues under high-strain-rate loading. The objective of this study is to develop and evaluate a viscohyperelastic constitutive framework for describing the dynamic compressive responses of multiple soft tissues. The proposed formulation is constructed within a continuum mechanics framework, in which the viscous contribution is expressed using objective invariant functions, namely J2, J6, and J7. The developed analytical formulations are calibrated against high-strain-rate experimental data from different soft biological tissues, namely porcine meniscus, bovine liver, and ovine brain tissues. To find the material model parameters, genetic algorithm optimization is used to identify the material parameters and assess the robustness of the fitting procedure. In order to assess the robustness of the proposed constitutive framework across different loading rates, a multi-objective optimization strategy is used to calibrate the model parameters by fitting multiple strain-rate-dependent responses at the same time. This approach enables the model predictive capability to be evaluated over a range of high-strain-rate conditions. These results show that the proposed framework can reasonably describe the nonlinear and rate-dependent mechanical responses of different soft tissues under dynamic compression.</description>
	<pubDate>2026-07-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 105: A High-Strain-Rate Viscohyperelastic Constitutive Framework for Soft Biological Tissues: A Multi-Tissue Evaluation</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/105">doi: 10.3390/appliedmath6070105</a></p>
	<p>Authors:
		Teng Long
		</p>
	<p>Viscous effects play an important role in the mechanical characterization of soft biological tissues under high-strain-rate loading. Accurate modeling of these behaviors is important for impact biomechanics, injury prediction, and crash safety analysis, in which biological tissues may experience high-strain-rate deformation. To describe the dynamic mechanical responses of soft tissues, a reliable constitutive framework is therefore needed to represent the dynamic response of soft tissues under high-strain-rate loading. The objective of this study is to develop and evaluate a viscohyperelastic constitutive framework for describing the dynamic compressive responses of multiple soft tissues. The proposed formulation is constructed within a continuum mechanics framework, in which the viscous contribution is expressed using objective invariant functions, namely J2, J6, and J7. The developed analytical formulations are calibrated against high-strain-rate experimental data from different soft biological tissues, namely porcine meniscus, bovine liver, and ovine brain tissues. To find the material model parameters, genetic algorithm optimization is used to identify the material parameters and assess the robustness of the fitting procedure. In order to assess the robustness of the proposed constitutive framework across different loading rates, a multi-objective optimization strategy is used to calibrate the model parameters by fitting multiple strain-rate-dependent responses at the same time. This approach enables the model predictive capability to be evaluated over a range of high-strain-rate conditions. These results show that the proposed framework can reasonably describe the nonlinear and rate-dependent mechanical responses of different soft tissues under dynamic compression.</p>
	]]></content:encoded>

	<dc:title>A High-Strain-Rate Viscohyperelastic Constitutive Framework for Soft Biological Tissues: A Multi-Tissue Evaluation</dc:title>
			<dc:creator>Teng Long</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070105</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-07-01</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-07-01</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>105</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070105</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/105</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/104">

	<title>AppliedMath, Vol. 6, Pages 104: Improved Confidence Interval Estimation for Zero-Inflated Count Data Using Transformed Two-Part Bootstrap</title>
	<link>https://www.mdpi.com/2673-9909/6/7/104</link>
	<description>This study proposes a transformed two-part bootstrap confidence interval (TTB-CI) for zero-inflated count data. The method combines a standard zero-inflated mixture formulation, parametric bootstrap, and monotone transformations to improve inference for practically meaningful estimands, including the marginal mean, zero probability, and positive-part mean. Simulation studies under zero-inflated Poisson (ZIP) and zero-inflated negative binomial (ZINB) data-generating processes show that the proposed method maintains nominal or near-nominal coverage while reducing interval width, particularly for the positive-part mean. Compared with conventional Poisson- and negative binomial-based confidence intervals, the proposed TTB-CI provides a more favorable coverage and width tradeoff and yields more informative intervals for positive count inference. These results indicate that the proposed method offers a practical and efficient confidence interval framework for zero-inflated count data.</description>
	<pubDate>2026-06-26</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 104: Improved Confidence Interval Estimation for Zero-Inflated Count Data Using Transformed Two-Part Bootstrap</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/104">doi: 10.3390/appliedmath6070104</a></p>
	<p>Authors:
		Sangsung Park
		Sunghae Jun
		</p>
	<p>This study proposes a transformed two-part bootstrap confidence interval (TTB-CI) for zero-inflated count data. The method combines a standard zero-inflated mixture formulation, parametric bootstrap, and monotone transformations to improve inference for practically meaningful estimands, including the marginal mean, zero probability, and positive-part mean. Simulation studies under zero-inflated Poisson (ZIP) and zero-inflated negative binomial (ZINB) data-generating processes show that the proposed method maintains nominal or near-nominal coverage while reducing interval width, particularly for the positive-part mean. Compared with conventional Poisson- and negative binomial-based confidence intervals, the proposed TTB-CI provides a more favorable coverage and width tradeoff and yields more informative intervals for positive count inference. These results indicate that the proposed method offers a practical and efficient confidence interval framework for zero-inflated count data.</p>
	]]></content:encoded>

	<dc:title>Improved Confidence Interval Estimation for Zero-Inflated Count Data Using Transformed Two-Part Bootstrap</dc:title>
			<dc:creator>Sangsung Park</dc:creator>
			<dc:creator>Sunghae Jun</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070104</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-26</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-26</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>104</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070104</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/104</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/103">

	<title>AppliedMath, Vol. 6, Pages 103: Metric Measure on Bipolar Fuzzy Sets: Mathematical Properties and Applications in Sentiment Analysis</title>
	<link>https://www.mdpi.com/2673-9909/6/7/103</link>
	<description>Bipolar fuzzy sets provide an effective framework for representing both positive and negative aspects of information. The necessity of a mathematically rigorous and valid distance measure in bipolar fuzzy environments motivates us to introduce a new real-valued function on the set of bipolar fuzzy sets defined over both discrete and continuous universes of discourse. The proposed function is shown to define a valid metric on the set of bipolar fuzzy sets, as it satisfies all the metric axioms. The metric induced by the real-valued function is inspired by the Canberra distance, and it can effectively quantify the dissimilarity between bipolar fuzzy sets in a normalized and interpretable manner. The practical utility of the proposed metric is demonstrated in a pattern recognition problem, where it successfully recognizes an unknown pattern using known bipolar fuzzy patterns. Using the proposed metric, a bipolar fuzzy C-means clustering algorithm is developed for sentiment analysis. The time complexity of the aforementioned algorithm is also analysed. Experiments conducted on the IMDb Movie Review Dataset demonstrate that the proposed algorithm outperforms k-means, fuzzy C-means, and intuitionistic fuzzy C-means algorithms. The proposed bipolar fuzzy C-means algorithm achieves an accuracy of 90.04%, a precision of 90.51%, a recall of 89.01%, an F1-score of 89.75%, a Root mean square error of 0.1191, and a Silhouette score of 0.75. The findings establish that the proposed metric and the associated bipolar fuzzy clustering approach provide a robust and effective framework of handling sentiment data associated with simultaneous positive and negative opinions.</description>
	<pubDate>2026-06-25</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 103: Metric Measure on Bipolar Fuzzy Sets: Mathematical Properties and Applications in Sentiment Analysis</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/103">doi: 10.3390/appliedmath6070103</a></p>
	<p>Authors:
		Janet Kez
		Mohamed Shenify
		Fokrul Alom Mazarbhuiya
		</p>
	<p>Bipolar fuzzy sets provide an effective framework for representing both positive and negative aspects of information. The necessity of a mathematically rigorous and valid distance measure in bipolar fuzzy environments motivates us to introduce a new real-valued function on the set of bipolar fuzzy sets defined over both discrete and continuous universes of discourse. The proposed function is shown to define a valid metric on the set of bipolar fuzzy sets, as it satisfies all the metric axioms. The metric induced by the real-valued function is inspired by the Canberra distance, and it can effectively quantify the dissimilarity between bipolar fuzzy sets in a normalized and interpretable manner. The practical utility of the proposed metric is demonstrated in a pattern recognition problem, where it successfully recognizes an unknown pattern using known bipolar fuzzy patterns. Using the proposed metric, a bipolar fuzzy C-means clustering algorithm is developed for sentiment analysis. The time complexity of the aforementioned algorithm is also analysed. Experiments conducted on the IMDb Movie Review Dataset demonstrate that the proposed algorithm outperforms k-means, fuzzy C-means, and intuitionistic fuzzy C-means algorithms. The proposed bipolar fuzzy C-means algorithm achieves an accuracy of 90.04%, a precision of 90.51%, a recall of 89.01%, an F1-score of 89.75%, a Root mean square error of 0.1191, and a Silhouette score of 0.75. The findings establish that the proposed metric and the associated bipolar fuzzy clustering approach provide a robust and effective framework of handling sentiment data associated with simultaneous positive and negative opinions.</p>
	]]></content:encoded>

	<dc:title>Metric Measure on Bipolar Fuzzy Sets: Mathematical Properties and Applications in Sentiment Analysis</dc:title>
			<dc:creator>Janet Kez</dc:creator>
			<dc:creator>Mohamed Shenify</dc:creator>
			<dc:creator>Fokrul Alom Mazarbhuiya</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070103</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-25</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-25</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>103</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070103</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/103</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/102">

	<title>AppliedMath, Vol. 6, Pages 102: Correction: Brezov, D. Optimizing Motion Sequences with Projective Dual Quaternions. AppliedMath 2026, 6, 80</title>
	<link>https://www.mdpi.com/2673-9909/6/7/102</link>
	<description>Reference Replacement [...]</description>
	<pubDate>2026-06-25</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 102: Correction: Brezov, D. Optimizing Motion Sequences with Projective Dual Quaternions. AppliedMath 2026, 6, 80</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/102">doi: 10.3390/appliedmath6070102</a></p>
	<p>Authors:
		Danail Brezov
		</p>
	<p>Reference Replacement [...]</p>
	]]></content:encoded>

	<dc:title>Correction: Brezov, D. Optimizing Motion Sequences with Projective Dual Quaternions. AppliedMath 2026, 6, 80</dc:title>
			<dc:creator>Danail Brezov</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070102</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-25</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-25</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Correction</prism:section>
	<prism:startingPage>102</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070102</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/102</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/7/101">

	<title>AppliedMath, Vol. 6, Pages 101: Cybertronics-Based Robust Control for Dynamic Supply Chains of AI Finished Products: A Theoretical Analysis</title>
	<link>https://www.mdpi.com/2673-9909/6/7/101</link>
	<description>This technical note aims to present a theoretical analysis for cybertronics engineering (CE) for a class of dynamic supply chains for artificial intelligence (AI)-based products, services or hybrid solutions. The cybertronics-based analysis encompasses three classes of supply chains: (1) energy-based dynamic supply chains (DSC); (2) semiconductor manufacturing and quantum supply chains; and (3) retailing of the AI-based DSC solutions generated. Considering the nonlinear nature of DSC, to provide solutions for products and services based on AI-chained supply chains, novel robust control is addressed via sliding mode control (SMC) with proper stability analysis for the DSC.</description>
	<pubDate>2026-06-24</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 101: Cybertronics-Based Robust Control for Dynamic Supply Chains of AI Finished Products: A Theoretical Analysis</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/7/101">doi: 10.3390/appliedmath6070101</a></p>
	<p>Authors:
		Yasser A. Davizon
		Alexander Mendoza-Acosta
		Rafael García-Martinez
		Aureliano Quiñonez-Ruiz
		Jaime Sanchez-Leal
		Eric D. Smith
		Neale R. Smith
		</p>
	<p>This technical note aims to present a theoretical analysis for cybertronics engineering (CE) for a class of dynamic supply chains for artificial intelligence (AI)-based products, services or hybrid solutions. The cybertronics-based analysis encompasses three classes of supply chains: (1) energy-based dynamic supply chains (DSC); (2) semiconductor manufacturing and quantum supply chains; and (3) retailing of the AI-based DSC solutions generated. Considering the nonlinear nature of DSC, to provide solutions for products and services based on AI-chained supply chains, novel robust control is addressed via sliding mode control (SMC) with proper stability analysis for the DSC.</p>
	]]></content:encoded>

	<dc:title>Cybertronics-Based Robust Control for Dynamic Supply Chains of AI Finished Products: A Theoretical Analysis</dc:title>
			<dc:creator>Yasser A. Davizon</dc:creator>
			<dc:creator>Alexander Mendoza-Acosta</dc:creator>
			<dc:creator>Rafael García-Martinez</dc:creator>
			<dc:creator>Aureliano Quiñonez-Ruiz</dc:creator>
			<dc:creator>Jaime Sanchez-Leal</dc:creator>
			<dc:creator>Eric D. Smith</dc:creator>
			<dc:creator>Neale R. Smith</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6070101</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-24</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-24</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Technical Note</prism:section>
	<prism:startingPage>101</prism:startingPage>
		<prism:doi>10.3390/appliedmath6070101</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/7/101</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/100">

	<title>AppliedMath, Vol. 6, Pages 100: A Comparison of Regression Models for Cryptocurrency Forecasting Across 14 Assets and Three Liquidity Tiers</title>
	<link>https://www.mdpi.com/2673-9909/6/6/100</link>
	<description>We compare classical and modern regression models for next-day cryptocurrency forecasting on 14 USD-denominated coins across three liquidity tiers from 2018 through 2025, and we use the resulting panel to formally test three pre-specified hypotheses. The features are a strictly past-only 28-element set; the evaluation uses expanding-window walk-forward cross-validation with nested hyperparameter tuning, stationary block-bootstrap 95% confidence intervals, and pairwise Diebold&amp;amp;ndash;Mariano tests. Methodologically, we derive a bias-variance bound that turns the &amp;amp;lsquo;no model beats the mean&amp;amp;rsquo; observation from a null finding into a predicted outcome under weak-form market efficiency. Empirically, (H1) the threshold&amp;amp;ndash;effect interaction is not supported (slope &amp;amp;minus;1.7 &amp;amp;times; 10&amp;amp;minus;4, 95% CI [&amp;amp;minus;4.8 &amp;amp;times; 10&amp;amp;minus;4, +1.4 &amp;amp;times; 10&amp;amp;minus;4], p = 0.25). (H2) Statistical loss minimisation is decoupled from risk-adjusted economic outcome: the cluster-bootstrapped 95% CI for the Spearman rank correlation between the within-ticker MAE rank and within-ticker post-cost Sharpe rank is [&amp;amp;minus;0.39, +0.10] overall, lies *strictly below zero* on the mid-cap (CI [&amp;amp;minus;0.71, &amp;amp;minus;0.04]) and long-tail (CI [&amp;amp;minus;0.26, &amp;amp;minus;0.09]) tiers, and decisively rejects perfect alignment (&amp;amp;rho; = +1) on every tier. None of the seven (ticker, model) pairs with annualised Sharpe &amp;amp;ge; 0.5 has a hit rate significantly different from 0.5; high-Sharpe outcomes reflect return skew, not directional skill&amp;amp;mdash;formally predicted by a closed-form Sharpe&amp;amp;ndash;MSE decoupling proposition we derive in Section 3.6 under non-zero return skewness. (H3) Lo&amp;amp;ndash;MacKinlay variance ratio tests show top-tier coins are indistinguishable from a random walk (|z| &amp;amp;le; 1.5 at q &amp;amp;isin; {2, 5, 10}), while mid- and long-tail tiers reject the random-walk null at q = 2 (z = &amp;amp;minus;2.36, z = &amp;amp;minus;2.60). The findings extend across two robustness layers. An AR(1)-GARCH(1,1) baseline produces R2 &amp;amp;asymp; &amp;amp;minus;0.005 on every tier and is indistinguishable from Lasso, supporting the bias-variance bound; Giacomini&amp;amp;ndash;White conditional predictive ability tests reject equal predictive ability between Lasso and tree-based models on every coin in every tier, complicating naive DM interpretations; and a forward-walking 2026-Q1 holdout&amp;amp;mdash;83 daily observations per coin entirely outside the training window&amp;amp;mdash;confirms that H1 is even more decisively null on unseen data and that the H3 efficiency conclusion holds. Together, these results give a formally tested EMH-style picture for daily crypto: no model meaningfully forecasts log-returns; statistical accuracy and trading P&amp;amp;amp;L are decoupled by an analytically derived mechanism; and weak-form efficiency is approximately satisfied in most liquid coins and in the convergence across the cross-section.</description>
	<pubDate>2026-06-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 100: A Comparison of Regression Models for Cryptocurrency Forecasting Across 14 Assets and Three Liquidity Tiers</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/100">doi: 10.3390/appliedmath6060100</a></p>
	<p>Authors:
		Gabriela Vasileva
		Dilyana Karova
		Mariyan Milev
		Penko Mitev
		</p>
	<p>We compare classical and modern regression models for next-day cryptocurrency forecasting on 14 USD-denominated coins across three liquidity tiers from 2018 through 2025, and we use the resulting panel to formally test three pre-specified hypotheses. The features are a strictly past-only 28-element set; the evaluation uses expanding-window walk-forward cross-validation with nested hyperparameter tuning, stationary block-bootstrap 95% confidence intervals, and pairwise Diebold&amp;amp;ndash;Mariano tests. Methodologically, we derive a bias-variance bound that turns the &amp;amp;lsquo;no model beats the mean&amp;amp;rsquo; observation from a null finding into a predicted outcome under weak-form market efficiency. Empirically, (H1) the threshold&amp;amp;ndash;effect interaction is not supported (slope &amp;amp;minus;1.7 &amp;amp;times; 10&amp;amp;minus;4, 95% CI [&amp;amp;minus;4.8 &amp;amp;times; 10&amp;amp;minus;4, +1.4 &amp;amp;times; 10&amp;amp;minus;4], p = 0.25). (H2) Statistical loss minimisation is decoupled from risk-adjusted economic outcome: the cluster-bootstrapped 95% CI for the Spearman rank correlation between the within-ticker MAE rank and within-ticker post-cost Sharpe rank is [&amp;amp;minus;0.39, +0.10] overall, lies *strictly below zero* on the mid-cap (CI [&amp;amp;minus;0.71, &amp;amp;minus;0.04]) and long-tail (CI [&amp;amp;minus;0.26, &amp;amp;minus;0.09]) tiers, and decisively rejects perfect alignment (&amp;amp;rho; = +1) on every tier. None of the seven (ticker, model) pairs with annualised Sharpe &amp;amp;ge; 0.5 has a hit rate significantly different from 0.5; high-Sharpe outcomes reflect return skew, not directional skill&amp;amp;mdash;formally predicted by a closed-form Sharpe&amp;amp;ndash;MSE decoupling proposition we derive in Section 3.6 under non-zero return skewness. (H3) Lo&amp;amp;ndash;MacKinlay variance ratio tests show top-tier coins are indistinguishable from a random walk (|z| &amp;amp;le; 1.5 at q &amp;amp;isin; {2, 5, 10}), while mid- and long-tail tiers reject the random-walk null at q = 2 (z = &amp;amp;minus;2.36, z = &amp;amp;minus;2.60). The findings extend across two robustness layers. An AR(1)-GARCH(1,1) baseline produces R2 &amp;amp;asymp; &amp;amp;minus;0.005 on every tier and is indistinguishable from Lasso, supporting the bias-variance bound; Giacomini&amp;amp;ndash;White conditional predictive ability tests reject equal predictive ability between Lasso and tree-based models on every coin in every tier, complicating naive DM interpretations; and a forward-walking 2026-Q1 holdout&amp;amp;mdash;83 daily observations per coin entirely outside the training window&amp;amp;mdash;confirms that H1 is even more decisively null on unseen data and that the H3 efficiency conclusion holds. Together, these results give a formally tested EMH-style picture for daily crypto: no model meaningfully forecasts log-returns; statistical accuracy and trading P&amp;amp;amp;L are decoupled by an analytically derived mechanism; and weak-form efficiency is approximately satisfied in most liquid coins and in the convergence across the cross-section.</p>
	]]></content:encoded>

	<dc:title>A Comparison of Regression Models for Cryptocurrency Forecasting Across 14 Assets and Three Liquidity Tiers</dc:title>
			<dc:creator>Gabriela Vasileva</dc:creator>
			<dc:creator>Dilyana Karova</dc:creator>
			<dc:creator>Mariyan Milev</dc:creator>
			<dc:creator>Penko Mitev</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060100</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-16</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-16</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>100</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060100</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/100</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/99">

	<title>AppliedMath, Vol. 6, Pages 99: Application of Long Short-Term Memory Neural Networks in the Audit: Evidence from the Social Protection Fund</title>
	<link>https://www.mdpi.com/2673-9909/6/6/99</link>
	<description>This paper presents a methodological framework for anomaly detection in child benefit administration based on Long Short-Term Memory (LSTM) neural networks. The content of this analysis, in general, is situated within the social (S) pillar of the environmental, social, and governance (ESG) accountability framework. We construct a framework applied to 305,338 child allowance claim records from the Fund for Child Protection of Republika Srpska, Bosnia and Herzegovina (February 2017 to December 2025), construct behavioural and demographic features at the applicant and household level, encode sequential claim histories as three-dimensional tensors, and conduct a systematic architecture sweep across six LSTM configurations. The target variable, the guardianship anomaly flag, identifies 172 anomalous records (0.056%) among 305,338 claims, and yields a class weighting ration of approximately 1515:1. Across all six configurations, ROC-AUC values range from 0.706 to 0.870 and PR-AUC from 0.002 to 0.071. The reference configuration (L1_U10_T20_he_normal, ROC-AUC = 0.870) flags 170 applications (0.37% of the test set) for priority manual review at the operational audit threshold of &amp;amp;tau;=0.05. The highest-risk application identified (anomaly probability 0.935) is characterised by a four-child household with below-poverty declared income, elevated benefit-to-income ratios, home delivery payment method, and a persistent high-risk sequential claim pattern not previously flagged by the Fund&amp;amp;rsquo;s rule-based administrative system. The results confirm that LSTM-based sequential anomaly detection is a viable and principled complement to rule-based eligibility screening in public social transfer administration.</description>
	<pubDate>2026-06-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 99: Application of Long Short-Term Memory Neural Networks in the Audit: Evidence from the Social Protection Fund</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/99">doi: 10.3390/appliedmath6060099</a></p>
	<p>Authors:
		Darko Tomaš
		Bojan Baškot
		Andrej Ševa
		Dalibor Tomaš
		</p>
	<p>This paper presents a methodological framework for anomaly detection in child benefit administration based on Long Short-Term Memory (LSTM) neural networks. The content of this analysis, in general, is situated within the social (S) pillar of the environmental, social, and governance (ESG) accountability framework. We construct a framework applied to 305,338 child allowance claim records from the Fund for Child Protection of Republika Srpska, Bosnia and Herzegovina (February 2017 to December 2025), construct behavioural and demographic features at the applicant and household level, encode sequential claim histories as three-dimensional tensors, and conduct a systematic architecture sweep across six LSTM configurations. The target variable, the guardianship anomaly flag, identifies 172 anomalous records (0.056%) among 305,338 claims, and yields a class weighting ration of approximately 1515:1. Across all six configurations, ROC-AUC values range from 0.706 to 0.870 and PR-AUC from 0.002 to 0.071. The reference configuration (L1_U10_T20_he_normal, ROC-AUC = 0.870) flags 170 applications (0.37% of the test set) for priority manual review at the operational audit threshold of &amp;amp;tau;=0.05. The highest-risk application identified (anomaly probability 0.935) is characterised by a four-child household with below-poverty declared income, elevated benefit-to-income ratios, home delivery payment method, and a persistent high-risk sequential claim pattern not previously flagged by the Fund&amp;amp;rsquo;s rule-based administrative system. The results confirm that LSTM-based sequential anomaly detection is a viable and principled complement to rule-based eligibility screening in public social transfer administration.</p>
	]]></content:encoded>

	<dc:title>Application of Long Short-Term Memory Neural Networks in the Audit: Evidence from the Social Protection Fund</dc:title>
			<dc:creator>Darko Tomaš</dc:creator>
			<dc:creator>Bojan Baškot</dc:creator>
			<dc:creator>Andrej Ševa</dc:creator>
			<dc:creator>Dalibor Tomaš</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060099</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-15</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-15</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>99</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060099</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/99</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/98">

	<title>AppliedMath, Vol. 6, Pages 98: Exact Solution of a Non-Homogeneous Fractional Differential Equation with a Variable Coefficient and Its Applications</title>
	<link>https://www.mdpi.com/2673-9909/6/6/98</link>
	<description>A non-homogeneous fractional differential equation with a variable coefficient involving a Caputo fractional derivative is considered. The equation is first transformed into an integral equation and then solved using the method of successive approximations. The obtained general solution involves a generalized Mittag&amp;amp;ndash;Leffler-type function and Meijer G-functions. Example solutions corresponding to particular choices of the non-homogeneous term are presented. As an application of the considered non-homogeneous equation, direct and inverse source problems are studied. The solutions are expressed in the form of series expansions using an orthogonal basis obtained through separation of variables. Illustrative examples for the direct and inverse problems are also presented for specific choices of the initial and final time data and the source function.</description>
	<pubDate>2026-06-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 98: Exact Solution of a Non-Homogeneous Fractional Differential Equation with a Variable Coefficient and Its Applications</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/98">doi: 10.3390/appliedmath6060098</a></p>
	<p>Authors:
		Fatma Al-Musalhi
		Nasser Al-Salti
		Erkinjon Karimov
		</p>
	<p>A non-homogeneous fractional differential equation with a variable coefficient involving a Caputo fractional derivative is considered. The equation is first transformed into an integral equation and then solved using the method of successive approximations. The obtained general solution involves a generalized Mittag&amp;amp;ndash;Leffler-type function and Meijer G-functions. Example solutions corresponding to particular choices of the non-homogeneous term are presented. As an application of the considered non-homogeneous equation, direct and inverse source problems are studied. The solutions are expressed in the form of series expansions using an orthogonal basis obtained through separation of variables. Illustrative examples for the direct and inverse problems are also presented for specific choices of the initial and final time data and the source function.</p>
	]]></content:encoded>

	<dc:title>Exact Solution of a Non-Homogeneous Fractional Differential Equation with a Variable Coefficient and Its Applications</dc:title>
			<dc:creator>Fatma Al-Musalhi</dc:creator>
			<dc:creator>Nasser Al-Salti</dc:creator>
			<dc:creator>Erkinjon Karimov</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060098</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-12</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-12</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>98</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060098</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/98</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/97">

	<title>AppliedMath, Vol. 6, Pages 97: Symmetries and B&amp;auml;cklund Transformations for the Modified Veronese Web Equation</title>
	<link>https://www.mdpi.com/2673-9909/6/6/97</link>
	<description>This paper investigates recursion operators and nonlocal symmetry structures for the modified Veronese web equation. The novelty of the work lies in the explicit construction of a direct recursion operator and its inverse in the tangent-covering framework. Starting from a compatible linear covering with a spectral parameter, we derive both operators and interpret them as auto-B&amp;amp;auml;cklund transformations for the corresponding linearized equation. We also determine the contact symmetry algebra and compute the action of the two recursion operators on its infinitesimal generators. In particular, the inverse recursion operator produces shadows of nonlocal symmetries associated with conservation-law coverings. These results provide a concrete recursive mechanism for the symmetry space of the modified Veronese web equation and clarify its covering-based nonlocal geometric structure.</description>
	<pubDate>2026-06-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 97: Symmetries and B&amp;auml;cklund Transformations for the Modified Veronese Web Equation</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/97">doi: 10.3390/appliedmath6060097</a></p>
	<p>Authors:
		Qingli Luo
		Zhe Wang
		Yufeng Zhang
		</p>
	<p>This paper investigates recursion operators and nonlocal symmetry structures for the modified Veronese web equation. The novelty of the work lies in the explicit construction of a direct recursion operator and its inverse in the tangent-covering framework. Starting from a compatible linear covering with a spectral parameter, we derive both operators and interpret them as auto-B&amp;amp;auml;cklund transformations for the corresponding linearized equation. We also determine the contact symmetry algebra and compute the action of the two recursion operators on its infinitesimal generators. In particular, the inverse recursion operator produces shadows of nonlocal symmetries associated with conservation-law coverings. These results provide a concrete recursive mechanism for the symmetry space of the modified Veronese web equation and clarify its covering-based nonlocal geometric structure.</p>
	]]></content:encoded>

	<dc:title>Symmetries and B&amp;amp;auml;cklund Transformations for the Modified Veronese Web Equation</dc:title>
			<dc:creator>Qingli Luo</dc:creator>
			<dc:creator>Zhe Wang</dc:creator>
			<dc:creator>Yufeng Zhang</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060097</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-11</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-11</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>97</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060097</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/97</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/96">

	<title>AppliedMath, Vol. 6, Pages 96: Thermal Optimization of Magneto-Nanofluid Convection in Wavy Circular Enclosure Using Response Surface Method</title>
	<link>https://www.mdpi.com/2673-9909/6/6/96</link>
	<description>This study investigates the thermal optimization of unsteady nanofluid natural convection within a quarter-circular domain with an inner wavy boundary under inclined periodic magnetic forcing. A combined finite-element method (FEM) and central composite design-based response surface methodology (RSM) is employed for optimizing both the geometric configuration and the parametric setting. For the geometric optimization, we find that the wavy-wall amplitude is the key parameter to determine the optimal configuration, followed by the inner radius and undulation number. The parametric analysis shows that strong magnetic effects suppress convection, while increasing the Rayleigh number and the nanoparticle volume fraction significantly enhances heat transport. Additionally, rising magnetic field wavelength and/or inclination angle result in a reduction in heat transmission under strong magnetic intensity. A statistical quadratic correlation equation with the help of the RSM method between Rayleigh number, Hartmann number, and nanoparticle volume fraction, and the mean Nusselt number is formulated, which gives a good match with numerical FEM analysis results in which about 99% of the variation in the response variable is predicted (R2 = 0.9975). The results obtained in this study offer valuable information along with computational efficiency in predicting the behavior of such advanced thermal systems.</description>
	<pubDate>2026-06-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 96: Thermal Optimization of Magneto-Nanofluid Convection in Wavy Circular Enclosure Using Response Surface Method</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/96">doi: 10.3390/appliedmath6060096</a></p>
	<p>Authors:
		Tarikul Islam
		Marco Martins Afonso
		Sílvio Gama
		</p>
	<p>This study investigates the thermal optimization of unsteady nanofluid natural convection within a quarter-circular domain with an inner wavy boundary under inclined periodic magnetic forcing. A combined finite-element method (FEM) and central composite design-based response surface methodology (RSM) is employed for optimizing both the geometric configuration and the parametric setting. For the geometric optimization, we find that the wavy-wall amplitude is the key parameter to determine the optimal configuration, followed by the inner radius and undulation number. The parametric analysis shows that strong magnetic effects suppress convection, while increasing the Rayleigh number and the nanoparticle volume fraction significantly enhances heat transport. Additionally, rising magnetic field wavelength and/or inclination angle result in a reduction in heat transmission under strong magnetic intensity. A statistical quadratic correlation equation with the help of the RSM method between Rayleigh number, Hartmann number, and nanoparticle volume fraction, and the mean Nusselt number is formulated, which gives a good match with numerical FEM analysis results in which about 99% of the variation in the response variable is predicted (R2 = 0.9975). The results obtained in this study offer valuable information along with computational efficiency in predicting the behavior of such advanced thermal systems.</p>
	]]></content:encoded>

	<dc:title>Thermal Optimization of Magneto-Nanofluid Convection in Wavy Circular Enclosure Using Response Surface Method</dc:title>
			<dc:creator>Tarikul Islam</dc:creator>
			<dc:creator>Marco Martins Afonso</dc:creator>
			<dc:creator>Sílvio Gama</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060096</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-11</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-11</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>96</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060096</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/96</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/95">

	<title>AppliedMath, Vol. 6, Pages 95: Layer-Wise Persistent Entropy of CT Scan Point Clouds for Lung Tumor Classification</title>
	<link>https://www.mdpi.com/2673-9909/6/6/95</link>
	<description>In this study, a layer-wise point cloud representation of CT scan images is proposed, from which persistence diagrams are constructed and persistent entropy is computed as a compact topological feature for three-class lung tumor classification. Two parallel approaches are investigated: the direct computation of persistence diagrams from CT images, and computation from subsampled point clouds derived from image intensity layers. The proposed method is evaluated on the publicly available IQ-OTH/NCCD lung cancer dataset, comprising 1097 CT scan images from 110 individuals, annotated by expert oncologists and radiologists. Classification is performed using K-Nearest Neighbors (KNN), Random Forest, Support Vector Machine, and eXtreme Gradient Boosting, and compared against Convolutional Neural Network (CNN) and traditional image feature-based methods. The persistent entropy approach applied to layer-wise subsampled point clouds achieves 97.67% accuracy, a Precision&amp;amp;ndash;Recall AUC of 96.63%, and a ROC-AUC of 99.46% using KNN, outperforming direct image-based analysis (95.91%) and achieving comparable accuracy to the CNN method (97.21%) with a computational speedup of approximately 478&amp;amp;times;. These results demonstrate that persistent homology applied to subsampled point clouds provides an accurate, mathematically interpretable, and computationally efficient alternative to deep learning for lung tumor classification.</description>
	<pubDate>2026-06-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 95: Layer-Wise Persistent Entropy of CT Scan Point Clouds for Lung Tumor Classification</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/95">doi: 10.3390/appliedmath6060095</a></p>
	<p>Authors:
		C. Jeeva Jose
		Aneesh P. Baiju
		Riya Roy
		A. Harikrishnan
		Rahul Sanju
		P. B. Vinod Kumar
		K. K. Sherly
		Rinku Jacob
		G. Sreekumar
		</p>
	<p>In this study, a layer-wise point cloud representation of CT scan images is proposed, from which persistence diagrams are constructed and persistent entropy is computed as a compact topological feature for three-class lung tumor classification. Two parallel approaches are investigated: the direct computation of persistence diagrams from CT images, and computation from subsampled point clouds derived from image intensity layers. The proposed method is evaluated on the publicly available IQ-OTH/NCCD lung cancer dataset, comprising 1097 CT scan images from 110 individuals, annotated by expert oncologists and radiologists. Classification is performed using K-Nearest Neighbors (KNN), Random Forest, Support Vector Machine, and eXtreme Gradient Boosting, and compared against Convolutional Neural Network (CNN) and traditional image feature-based methods. The persistent entropy approach applied to layer-wise subsampled point clouds achieves 97.67% accuracy, a Precision&amp;amp;ndash;Recall AUC of 96.63%, and a ROC-AUC of 99.46% using KNN, outperforming direct image-based analysis (95.91%) and achieving comparable accuracy to the CNN method (97.21%) with a computational speedup of approximately 478&amp;amp;times;. These results demonstrate that persistent homology applied to subsampled point clouds provides an accurate, mathematically interpretable, and computationally efficient alternative to deep learning for lung tumor classification.</p>
	]]></content:encoded>

	<dc:title>Layer-Wise Persistent Entropy of CT Scan Point Clouds for Lung Tumor Classification</dc:title>
			<dc:creator>C. Jeeva Jose</dc:creator>
			<dc:creator>Aneesh P. Baiju</dc:creator>
			<dc:creator>Riya Roy</dc:creator>
			<dc:creator>A. Harikrishnan</dc:creator>
			<dc:creator>Rahul Sanju</dc:creator>
			<dc:creator>P. B. Vinod Kumar</dc:creator>
			<dc:creator>K. K. Sherly</dc:creator>
			<dc:creator>Rinku Jacob</dc:creator>
			<dc:creator>G. Sreekumar</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060095</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-11</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-11</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>95</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060095</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/95</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/94">

	<title>AppliedMath, Vol. 6, Pages 94: Large Language Models as Semantic Evaluators of Embedded Correlation Substructures</title>
	<link>https://www.mdpi.com/2673-9909/6/6/94</link>
	<description>Graphical methods of correlation analysis, such as correlation n-ptychs or hotspots, focus on the identification of the strength and direction of functional relationships between sets of attributes in multidimensional datasets. Since these correlation structures only take into account values of the attributes, situations arise when the relationship is coincidental, meaning that there is no real-world causality between the values of the observed attributes but these values still exhibit significant correlation. This problem of correlation analysis as a whole motivates the need for semantic evaluation of significant relationships identified using its methods&amp;amp;mdash;a task that could potentially be time- and resource-intensive when conducted manually. However, modern results in the large language model area provide tools for the automatization of such tasks. Hence, this work focuses on the design and implementation of a novel large language model-based method for semantic evaluation of correlation structures embedded in a correlation graph, specifically correlation n-ptychs for n&amp;amp;isin;{3,&amp;amp;nbsp;4,&amp;amp;nbsp;5} and correlation hotspots. In the method, the large language model is automatically prompted to assess the semantic nature of relationships in the set of correlation substructures of the dataset, identify their real-world relevance, and visualize the result in the form of a Semantic evaluation card. The proposed approach is evaluated using two benchmarking datasets focusing on the visualization method used in the model, large language model interaction with the correlation substructures, and comparative analysis with previously used tools in the area.</description>
	<pubDate>2026-06-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 94: Large Language Models as Semantic Evaluators of Embedded Correlation Substructures</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/94">doi: 10.3390/appliedmath6060094</a></p>
	<p>Authors:
		Adam Dudáš
		Peter Babic
		</p>
	<p>Graphical methods of correlation analysis, such as correlation n-ptychs or hotspots, focus on the identification of the strength and direction of functional relationships between sets of attributes in multidimensional datasets. Since these correlation structures only take into account values of the attributes, situations arise when the relationship is coincidental, meaning that there is no real-world causality between the values of the observed attributes but these values still exhibit significant correlation. This problem of correlation analysis as a whole motivates the need for semantic evaluation of significant relationships identified using its methods&amp;amp;mdash;a task that could potentially be time- and resource-intensive when conducted manually. However, modern results in the large language model area provide tools for the automatization of such tasks. Hence, this work focuses on the design and implementation of a novel large language model-based method for semantic evaluation of correlation structures embedded in a correlation graph, specifically correlation n-ptychs for n&amp;amp;isin;{3,&amp;amp;nbsp;4,&amp;amp;nbsp;5} and correlation hotspots. In the method, the large language model is automatically prompted to assess the semantic nature of relationships in the set of correlation substructures of the dataset, identify their real-world relevance, and visualize the result in the form of a Semantic evaluation card. The proposed approach is evaluated using two benchmarking datasets focusing on the visualization method used in the model, large language model interaction with the correlation substructures, and comparative analysis with previously used tools in the area.</p>
	]]></content:encoded>

	<dc:title>Large Language Models as Semantic Evaluators of Embedded Correlation Substructures</dc:title>
			<dc:creator>Adam Dudáš</dc:creator>
			<dc:creator>Peter Babic</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060094</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-11</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-11</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>94</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060094</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/94</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/93">

	<title>AppliedMath, Vol. 6, Pages 93: Hitting Time Index for Broom Graphs</title>
	<link>https://www.mdpi.com/2673-9909/6/6/93</link>
	<description>Thehitting time index HT(G) is a recently introduced topological descriptor based on expected hitting times of a random walk on a graph. In this paper, we derive a closed-form formula for HT(G) for broom graphs Bn,d that holds for all parameters 2&amp;amp;le;d&amp;amp;le;n&amp;amp;minus;1, HT(Bn,d)=S1+S2+S3+(n&amp;amp;minus;d)&amp;amp;sum;i=1d&amp;amp;minus;1max{A(i),B(i)}, where S1,S2,S3,A(i),B(i) are explicitly defined. For d&amp;amp;ge;2 and n&amp;amp;ge;4d&amp;amp;minus;8 we derive a simpler cubic polynomial formula in n, HT(Bn,d)=n3+adn2+bdn+cd, with explicitly given coefficients ad,bd,cd depending only on d. We also consider quartic polynomial formulas for special cases.</description>
	<pubDate>2026-06-10</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 93: Hitting Time Index for Broom Graphs</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/93">doi: 10.3390/appliedmath6060093</a></p>
	<p>Authors:
		Sonja Orlić
		José Luis Palacios
		Aleksandar Petojević
		</p>
	<p>Thehitting time index HT(G) is a recently introduced topological descriptor based on expected hitting times of a random walk on a graph. In this paper, we derive a closed-form formula for HT(G) for broom graphs Bn,d that holds for all parameters 2&amp;amp;le;d&amp;amp;le;n&amp;amp;minus;1, HT(Bn,d)=S1+S2+S3+(n&amp;amp;minus;d)&amp;amp;sum;i=1d&amp;amp;minus;1max{A(i),B(i)}, where S1,S2,S3,A(i),B(i) are explicitly defined. For d&amp;amp;ge;2 and n&amp;amp;ge;4d&amp;amp;minus;8 we derive a simpler cubic polynomial formula in n, HT(Bn,d)=n3+adn2+bdn+cd, with explicitly given coefficients ad,bd,cd depending only on d. We also consider quartic polynomial formulas for special cases.</p>
	]]></content:encoded>

	<dc:title>Hitting Time Index for Broom Graphs</dc:title>
			<dc:creator>Sonja Orlić</dc:creator>
			<dc:creator>José Luis Palacios</dc:creator>
			<dc:creator>Aleksandar Petojević</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060093</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-10</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-10</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>93</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060093</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/93</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/92">

	<title>AppliedMath, Vol. 6, Pages 92: A Hybrid Multi-Objective Lemurs Optimizer-Backtracking Search Algorithm for Engineering Optimization Problems</title>
	<link>https://www.mdpi.com/2673-9909/6/6/92</link>
	<description>Multi-objective optimization plays a fundamental role in solving complex engineering design problems characterized by conflicting objectives and nonlinear constraints. In this study, a novel hybrid optimization algorithm, named Multi-objective Lemurs Optimizer-Backtracking Search Algorithm (MOLOBSA), is proposed to improve the exploration and exploitation capabilities of existing metaheuristic methods. The proposed approach integrates the global exploration ability of the Lemurs Optimizer (LO) with the efficient mutation and crossover mechanisms of the Backtracking Search Algorithm (BSA) within a multi-objective optimization framework. The effectiveness of the proposed algorithm is evaluated using the CEC2020 multimodal multi-objective benchmark suite, where its performance is assessed using the PSP and IGDX performance indicators. In addition, the proposed method was successfully applied to the multi-objective design optimization of an I-beam structure, where the objectives were to minimize the structural weight and the maximum displacement under mechanical constraints. The obtained Pareto solutions exhibit better diversity and improved trade-off characteristics compared with those produced by the baseline algorithm.</description>
	<pubDate>2026-06-10</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 92: A Hybrid Multi-Objective Lemurs Optimizer-Backtracking Search Algorithm for Engineering Optimization Problems</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/92">doi: 10.3390/appliedmath6060092</a></p>
	<p>Authors:
		Khadijetou Maaloum Din
		Rabii El Maani
		Ahmed Tchvagha Zeine
		Rachid Ellaia
		</p>
	<p>Multi-objective optimization plays a fundamental role in solving complex engineering design problems characterized by conflicting objectives and nonlinear constraints. In this study, a novel hybrid optimization algorithm, named Multi-objective Lemurs Optimizer-Backtracking Search Algorithm (MOLOBSA), is proposed to improve the exploration and exploitation capabilities of existing metaheuristic methods. The proposed approach integrates the global exploration ability of the Lemurs Optimizer (LO) with the efficient mutation and crossover mechanisms of the Backtracking Search Algorithm (BSA) within a multi-objective optimization framework. The effectiveness of the proposed algorithm is evaluated using the CEC2020 multimodal multi-objective benchmark suite, where its performance is assessed using the PSP and IGDX performance indicators. In addition, the proposed method was successfully applied to the multi-objective design optimization of an I-beam structure, where the objectives were to minimize the structural weight and the maximum displacement under mechanical constraints. The obtained Pareto solutions exhibit better diversity and improved trade-off characteristics compared with those produced by the baseline algorithm.</p>
	]]></content:encoded>

	<dc:title>A Hybrid Multi-Objective Lemurs Optimizer-Backtracking Search Algorithm for Engineering Optimization Problems</dc:title>
			<dc:creator>Khadijetou Maaloum Din</dc:creator>
			<dc:creator>Rabii El Maani</dc:creator>
			<dc:creator>Ahmed Tchvagha Zeine</dc:creator>
			<dc:creator>Rachid Ellaia</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060092</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-10</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-10</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>92</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060092</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/92</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/91">

	<title>AppliedMath, Vol. 6, Pages 91: Hamilton&amp;ndash;Jacobi&amp;ndash;Bellman-Based Optimal Effort Allocation for Student Productivity Dynamics</title>
	<link>https://www.mdpi.com/2673-9909/6/6/91</link>
	<description>The adaptive regulation of student productivity remains a challenging problem in technology-enhanced learning environments due to the continuous and uncertain nature of cognitive effort, attention, and behavioral fluctuations. While existing educational intervention models are predominantly based on discrete-time decision frameworks, they often provide limited support for the representation of stochastic productivity dynamics and continuous effort adaptation. This paper proposes a continuous-time stochastic optimal control framework for adaptive effort allocation in student productivity regulation. The learner productivity level is modeled as a bounded stochastic diffusion process evolving on the interval ([0, 1]), where the drift and diffusion coefficients depend on both effort allocation and learner-specific psychological characteristics. The control objective is formulated as the maximization of an expected cumulative productivity reward penalized by excessive cognitive effort over a finite study horizon. Using the Hamilton&amp;amp;ndash;Jacobi&amp;amp;ndash;Bellman (HJB) framework, we derive an optimal state-dependent feedback policy that dynamically adjusts effort allocation according to the current productivity level, the remaining study horizon, and the learner profile. We establish the well-posedness of the controlled stochastic dynamics and show that the productivity state remains invariant within the admissible interval. The resulting HJB equation is solved numerically using a semi-implicit finite-difference approximation combined with iterative feedback updates. Simulation experiments conducted on synthetic learner profiles illustrate the qualitative behavior of the proposed controller under heterogeneous psychological configurations. Compared with constant-effort and threshold-based heuristic strategies, the adaptive feedback policy produces smoother productivity trajectories and more stable effort allocation patterns under stochastic perturbations. The proposed framework provides a mathematically grounded approach for studying adaptive productivity regulation under uncertainty and establishes a foundation for future data-driven calibration and personalized intervention systems.</description>
	<pubDate>2026-06-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 91: Hamilton&amp;ndash;Jacobi&amp;ndash;Bellman-Based Optimal Effort Allocation for Student Productivity Dynamics</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/91">doi: 10.3390/appliedmath6060091</a></p>
	<p>Authors:
		Wafa Louafi
		Houda Tadjer
		Yacine Lafifi
		</p>
	<p>The adaptive regulation of student productivity remains a challenging problem in technology-enhanced learning environments due to the continuous and uncertain nature of cognitive effort, attention, and behavioral fluctuations. While existing educational intervention models are predominantly based on discrete-time decision frameworks, they often provide limited support for the representation of stochastic productivity dynamics and continuous effort adaptation. This paper proposes a continuous-time stochastic optimal control framework for adaptive effort allocation in student productivity regulation. The learner productivity level is modeled as a bounded stochastic diffusion process evolving on the interval ([0, 1]), where the drift and diffusion coefficients depend on both effort allocation and learner-specific psychological characteristics. The control objective is formulated as the maximization of an expected cumulative productivity reward penalized by excessive cognitive effort over a finite study horizon. Using the Hamilton&amp;amp;ndash;Jacobi&amp;amp;ndash;Bellman (HJB) framework, we derive an optimal state-dependent feedback policy that dynamically adjusts effort allocation according to the current productivity level, the remaining study horizon, and the learner profile. We establish the well-posedness of the controlled stochastic dynamics and show that the productivity state remains invariant within the admissible interval. The resulting HJB equation is solved numerically using a semi-implicit finite-difference approximation combined with iterative feedback updates. Simulation experiments conducted on synthetic learner profiles illustrate the qualitative behavior of the proposed controller under heterogeneous psychological configurations. Compared with constant-effort and threshold-based heuristic strategies, the adaptive feedback policy produces smoother productivity trajectories and more stable effort allocation patterns under stochastic perturbations. The proposed framework provides a mathematically grounded approach for studying adaptive productivity regulation under uncertainty and establishes a foundation for future data-driven calibration and personalized intervention systems.</p>
	]]></content:encoded>

	<dc:title>Hamilton&amp;amp;ndash;Jacobi&amp;amp;ndash;Bellman-Based Optimal Effort Allocation for Student Productivity Dynamics</dc:title>
			<dc:creator>Wafa Louafi</dc:creator>
			<dc:creator>Houda Tadjer</dc:creator>
			<dc:creator>Yacine Lafifi</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060091</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-09</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-09</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>91</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060091</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/91</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/90">

	<title>AppliedMath, Vol. 6, Pages 90: Mathematical Social Dynamics: Traditional and New Areas of Research</title>
	<link>https://www.mdpi.com/2673-9909/6/6/90</link>
	<description>We present a review on the application of the mathematical models for research on social processes, social structures, and actors in social systems. The scope of the review is not restricted to the classical applications of mathematics such as theory of probability, statistics, stochastic processes, differential equations, and game theory. We also discuss applications of the theory of networks for social network analysis and the numerical research on dynamics of social systems. The number of these applications has increased very fast in recent years. Special attention is given to the results from the area of sociophysics, where mathematical methodology is used to analyze social systems in cooperation with the models and concepts of physics. Another special topic in his review is connected to the results from econophysics, where the mathematical methodology and theories and methods of physics are used in the studies on the dynamics of economic systems. In addition, we give several examples for the application of mathematical methods to social systems: (a) application of difference equations to model the flow of substances in channels of networks; (b) analytical solution of nonlinear equations connected to the model of waves of popularity; (c) numerical results of the waves of popularity in a model that accounts for the change in the opinion of the supporters of the ideas for positive or negative popularity of a person, material item, or a piece of information (idea, theory, ideology, etc.) In the last case, we illustrate the effectiveness of the numerical analysis to discover new effects on the studied social system. The review ends with a large list of references. These references can be used as a guide of the way of new researchers to the large field of mathematical social dynamics.</description>
	<pubDate>2026-06-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 90: Mathematical Social Dynamics: Traditional and New Areas of Research</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/90">doi: 10.3390/appliedmath6060090</a></p>
	<p>Authors:
		Kaloyan N. Vitanov
		Nikolay K. Vitanov
		</p>
	<p>We present a review on the application of the mathematical models for research on social processes, social structures, and actors in social systems. The scope of the review is not restricted to the classical applications of mathematics such as theory of probability, statistics, stochastic processes, differential equations, and game theory. We also discuss applications of the theory of networks for social network analysis and the numerical research on dynamics of social systems. The number of these applications has increased very fast in recent years. Special attention is given to the results from the area of sociophysics, where mathematical methodology is used to analyze social systems in cooperation with the models and concepts of physics. Another special topic in his review is connected to the results from econophysics, where the mathematical methodology and theories and methods of physics are used in the studies on the dynamics of economic systems. In addition, we give several examples for the application of mathematical methods to social systems: (a) application of difference equations to model the flow of substances in channels of networks; (b) analytical solution of nonlinear equations connected to the model of waves of popularity; (c) numerical results of the waves of popularity in a model that accounts for the change in the opinion of the supporters of the ideas for positive or negative popularity of a person, material item, or a piece of information (idea, theory, ideology, etc.) In the last case, we illustrate the effectiveness of the numerical analysis to discover new effects on the studied social system. The review ends with a large list of references. These references can be used as a guide of the way of new researchers to the large field of mathematical social dynamics.</p>
	]]></content:encoded>

	<dc:title>Mathematical Social Dynamics: Traditional and New Areas of Research</dc:title>
			<dc:creator>Kaloyan N. Vitanov</dc:creator>
			<dc:creator>Nikolay K. Vitanov</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060090</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-09</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-09</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>90</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060090</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/90</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/89">

	<title>AppliedMath, Vol. 6, Pages 89: Sublinear Hierarchical Dynamical System with Cyclic Coupling</title>
	<link>https://www.mdpi.com/2673-9909/6/6/89</link>
	<description>We introduce a mathematical model describing a dynamical system made up of interdependent compartments subject to intrinsic fragility and cross-support. The dynamics are driven by the competition between hierarchical sublinear dissipation and cyclic coupling, enabling a natural interpretation of transitions between distinct regimes (e.g., resilience versus degradation, vulnerability and crisis/extinction in finance or biology). We establish the existence, uniqueness, positivity, and global continuation of solutions. We also investigate the qualitative behavior of the system by studying the stability of equilibrium points and deriving threshold conditions characterizing increasing, decreasing, and stationary regimes. Numerical simulations are provided to illustrate the theoretical results and the transition phenomena between extinction and self-sustained dynamics.</description>
	<pubDate>2026-06-06</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 89: Sublinear Hierarchical Dynamical System with Cyclic Coupling</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/89">doi: 10.3390/appliedmath6060089</a></p>
	<p>Authors:
		Adjété Lionel Wilson
		Toyo Koffi Edarh Bossou
		</p>
	<p>We introduce a mathematical model describing a dynamical system made up of interdependent compartments subject to intrinsic fragility and cross-support. The dynamics are driven by the competition between hierarchical sublinear dissipation and cyclic coupling, enabling a natural interpretation of transitions between distinct regimes (e.g., resilience versus degradation, vulnerability and crisis/extinction in finance or biology). We establish the existence, uniqueness, positivity, and global continuation of solutions. We also investigate the qualitative behavior of the system by studying the stability of equilibrium points and deriving threshold conditions characterizing increasing, decreasing, and stationary regimes. Numerical simulations are provided to illustrate the theoretical results and the transition phenomena between extinction and self-sustained dynamics.</p>
	]]></content:encoded>

	<dc:title>Sublinear Hierarchical Dynamical System with Cyclic Coupling</dc:title>
			<dc:creator>Adjété Lionel Wilson</dc:creator>
			<dc:creator>Toyo Koffi Edarh Bossou</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060089</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-06</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-06</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>89</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060089</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/89</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/88">

	<title>AppliedMath, Vol. 6, Pages 88: Regiomontanus Angle Optimization for Circular Paths</title>
	<link>https://www.mdpi.com/2673-9909/6/6/88</link>
	<description>The classical Regiomontanus problem asks for the position that maximizes the angle subtended by a fixed line segment, a problem originating in Euclidean geometry and observational astronomy. This work extends the problem to observers constrained to move along a circular path. The solution uses the geometric fact that the optimal viewpoint occurs precisely where the trajectory is tangent to an isoangle circle. This framework unifies configurations both exterior and interior to the circular path. The analytical solution is validated against direct numerical optimization, with agreement exceeding ten decimal places, and the subtended angle is shown to attain a unique maximum along each half of the circular trajectory. In the limit as the radius becomes large, the analytical result reduces to the classical linear case. Beyond its historical interest, a potential extension illustrates how this simple geometric condition can govern optimal viewing and highlights connections to modern imaging and vision systems.</description>
	<pubDate>2026-06-04</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 88: Regiomontanus Angle Optimization for Circular Paths</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/88">doi: 10.3390/appliedmath6060088</a></p>
	<p>Authors:
		Stathis Hadjidemetriou
		</p>
	<p>The classical Regiomontanus problem asks for the position that maximizes the angle subtended by a fixed line segment, a problem originating in Euclidean geometry and observational astronomy. This work extends the problem to observers constrained to move along a circular path. The solution uses the geometric fact that the optimal viewpoint occurs precisely where the trajectory is tangent to an isoangle circle. This framework unifies configurations both exterior and interior to the circular path. The analytical solution is validated against direct numerical optimization, with agreement exceeding ten decimal places, and the subtended angle is shown to attain a unique maximum along each half of the circular trajectory. In the limit as the radius becomes large, the analytical result reduces to the classical linear case. Beyond its historical interest, a potential extension illustrates how this simple geometric condition can govern optimal viewing and highlights connections to modern imaging and vision systems.</p>
	]]></content:encoded>

	<dc:title>Regiomontanus Angle Optimization for Circular Paths</dc:title>
			<dc:creator>Stathis Hadjidemetriou</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060088</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-04</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-04</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>88</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060088</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/88</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/87">

	<title>AppliedMath, Vol. 6, Pages 87: On Even 2n-Unitary Perfect Polynomials over F2</title>
	<link>https://www.mdpi.com/2673-9909/6/6/87</link>
	<description>Let k be a positive integer. A polynomial A&amp;amp;isin;F2[x] is called k-unitary perfectif the sum of the k-th powers of its distinct unitary divisors equals Ak. In this paper, we study the case k=2n and prove that every 2n-unitary perfect polynomial over F2 is even. Moreover, we completely classify all even 2n-unitary perfect polynomials having at most three distinct irreducible factors. In particular, we characterize all such polynomials of the form A=xa(x+1)bPh, where P is a Mersenne prime over F2 and a,b,h&amp;amp;isin;N. As a consequence, several explicit infinite families of k-unitary perfect polynomials over F2 are obtained.</description>
	<pubDate>2026-06-03</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 87: On Even 2n-Unitary Perfect Polynomials over F2</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/87">doi: 10.3390/appliedmath6060087</a></p>
	<p>Authors:
		Wiam Zeid
		Haissam Chehade
		Issam Kaddoura
		Yahia Awad
		</p>
	<p>Let k be a positive integer. A polynomial A&amp;amp;isin;F2[x] is called k-unitary perfectif the sum of the k-th powers of its distinct unitary divisors equals Ak. In this paper, we study the case k=2n and prove that every 2n-unitary perfect polynomial over F2 is even. Moreover, we completely classify all even 2n-unitary perfect polynomials having at most three distinct irreducible factors. In particular, we characterize all such polynomials of the form A=xa(x+1)bPh, where P is a Mersenne prime over F2 and a,b,h&amp;amp;isin;N. As a consequence, several explicit infinite families of k-unitary perfect polynomials over F2 are obtained.</p>
	]]></content:encoded>

	<dc:title>On Even 2n-Unitary Perfect Polynomials over F2</dc:title>
			<dc:creator>Wiam Zeid</dc:creator>
			<dc:creator>Haissam Chehade</dc:creator>
			<dc:creator>Issam Kaddoura</dc:creator>
			<dc:creator>Yahia Awad</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060087</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-03</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-03</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>87</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060087</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/87</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/86">

	<title>AppliedMath, Vol. 6, Pages 86: Common Fixed Point Theorems for (&amp;beta;, &amp;alpha;)-Generalized Enriched Contractions in Banach Spaces</title>
	<link>https://www.mdpi.com/2673-9909/6/6/86</link>
	<description>This paper investigates common fixed point theorems for (&amp;amp;beta;,&amp;amp;alpha;)-generalized enriched contractions in Banach spaces. We provide a corrected proof of an existing theorem on enriched contractions, thereby strengthening the reliability of results in this area. Our analysis further shows that a previously published illustrative example does not satisfy the proposed enriched contraction condition, since the condition fails for x=0,&amp;amp;nbsp;y=18, and b=45. We then introduce a generalized pair of mappings and prove two common fixed point theorems for single-valued (&amp;amp;beta;,&amp;amp;alpha;)-generalized enriched contractions under weak commutativity and compatibility conditions. Strong convergence to the unique common fixed point is established through a Mann-type iteration process, and an example is provided to validate the proposed generalizations.</description>
	<pubDate>2026-06-02</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 86: Common Fixed Point Theorems for (&amp;beta;, &amp;alpha;)-Generalized Enriched Contractions in Banach Spaces</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/86">doi: 10.3390/appliedmath6060086</a></p>
	<p>Authors:
		Rekha Panicker
		Rahul Shukla
		</p>
	<p>This paper investigates common fixed point theorems for (&amp;amp;beta;,&amp;amp;alpha;)-generalized enriched contractions in Banach spaces. We provide a corrected proof of an existing theorem on enriched contractions, thereby strengthening the reliability of results in this area. Our analysis further shows that a previously published illustrative example does not satisfy the proposed enriched contraction condition, since the condition fails for x=0,&amp;amp;nbsp;y=18, and b=45. We then introduce a generalized pair of mappings and prove two common fixed point theorems for single-valued (&amp;amp;beta;,&amp;amp;alpha;)-generalized enriched contractions under weak commutativity and compatibility conditions. Strong convergence to the unique common fixed point is established through a Mann-type iteration process, and an example is provided to validate the proposed generalizations.</p>
	]]></content:encoded>

	<dc:title>Common Fixed Point Theorems for (&amp;amp;beta;, &amp;amp;alpha;)-Generalized Enriched Contractions in Banach Spaces</dc:title>
			<dc:creator>Rekha Panicker</dc:creator>
			<dc:creator>Rahul Shukla</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060086</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-06-02</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-06-02</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>86</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060086</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/86</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/85">

	<title>AppliedMath, Vol. 6, Pages 85: Agent-Based Simulation of the Infection Risk in Variable Indoor Geometries</title>
	<link>https://www.mdpi.com/2673-9909/6/6/85</link>
	<description>In this paper, we introduce an agent-based pedestrian simulation with aerosol modeling, which we use for analyzing the risk of infection with airborne diseases, with special attention to indoor scenarios and the corresponding geometry. For our analysis, we simulate a realistic supermarket scenario, and analyze the influence of geometric factors for the risk of infection regarding aerosol concentration. Using such a defined set of geometry allows for a targeted analysis of risk factors. Specifically, we examine if angular structures bear higher viral loads than flat structures, which is confirmed by our experiments. An artificial neural network (ANN) specifically trained on simulation data is able to identify adjacent geometric structures based on aerosol concentration with up to 94% accuracy.</description>
	<pubDate>2026-05-31</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 85: Agent-Based Simulation of the Infection Risk in Variable Indoor Geometries</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/85">doi: 10.3390/appliedmath6060085</a></p>
	<p>Authors:
		Mathias Wagner
		Thomas Harweg
		Roland Linder
		Frank Weichert
		</p>
	<p>In this paper, we introduce an agent-based pedestrian simulation with aerosol modeling, which we use for analyzing the risk of infection with airborne diseases, with special attention to indoor scenarios and the corresponding geometry. For our analysis, we simulate a realistic supermarket scenario, and analyze the influence of geometric factors for the risk of infection regarding aerosol concentration. Using such a defined set of geometry allows for a targeted analysis of risk factors. Specifically, we examine if angular structures bear higher viral loads than flat structures, which is confirmed by our experiments. An artificial neural network (ANN) specifically trained on simulation data is able to identify adjacent geometric structures based on aerosol concentration with up to 94% accuracy.</p>
	]]></content:encoded>

	<dc:title>Agent-Based Simulation of the Infection Risk in Variable Indoor Geometries</dc:title>
			<dc:creator>Mathias Wagner</dc:creator>
			<dc:creator>Thomas Harweg</dc:creator>
			<dc:creator>Roland Linder</dc:creator>
			<dc:creator>Frank Weichert</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060085</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-31</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-31</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>85</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060085</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/85</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/84">

	<title>AppliedMath, Vol. 6, Pages 84: Differential System Approach to Gene Regulatory Network Modeling</title>
	<link>https://www.mdpi.com/2673-9909/6/6/84</link>
	<description>The system of ordinary differential equations that arises in models of genetic networks is considered. This system has both nonlinear and linear parts. As a nonlinear part, we use a piecewise linear function. This allows us to treat systems with multiple (up to ten) equations. Special attention is paid to the four-dimensional systems that have an attractor in the form of a periodic solution. In the final part, the 10th-dimensional system is considered, which describes a subnetwork of a larger network that arises in a practical biomedical problem.</description>
	<pubDate>2026-05-28</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 84: Differential System Approach to Gene Regulatory Network Modeling</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/84">doi: 10.3390/appliedmath6060084</a></p>
	<p>Authors:
		Olga Kozlovska
		Felix Sadyrbaev
		</p>
	<p>The system of ordinary differential equations that arises in models of genetic networks is considered. This system has both nonlinear and linear parts. As a nonlinear part, we use a piecewise linear function. This allows us to treat systems with multiple (up to ten) equations. Special attention is paid to the four-dimensional systems that have an attractor in the form of a periodic solution. In the final part, the 10th-dimensional system is considered, which describes a subnetwork of a larger network that arises in a practical biomedical problem.</p>
	]]></content:encoded>

	<dc:title>Differential System Approach to Gene Regulatory Network Modeling</dc:title>
			<dc:creator>Olga Kozlovska</dc:creator>
			<dc:creator>Felix Sadyrbaev</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060084</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-28</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-28</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>84</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060084</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/84</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/83">

	<title>AppliedMath, Vol. 6, Pages 83: Vibration Control and Optimization Using Circular Non-Homogeneity Parameters</title>
	<link>https://www.mdpi.com/2673-9909/6/6/83</link>
	<description>This study determines the time period of vibrational modes for a non-uniform orthotropic parallelogram plate, featuring a one-dimensional circular thickness variation and subjected to clamped (CCCC) edges. The authors make assumptions about the material; they assume a one-dimensional circular density variation and incorporate Poisson&amp;amp;rsquo;s ratio to address material non-uniformity. The motivation to choose circular variation in the plate parameter was due to its numerous applications in engineering and real-life applications like engine covers, rotor blades, etc. The authors also account for a parabolic temperature gradient across the plate. Utilizing the Rayleigh&amp;amp;ndash;Ritz technique, they derive the frequency equation and solve it to determine the vibration mode time periods. This study includes a convergence analysis of the plate across (CCCC) edge conditions. The primary aim is to demonstrate the advantage of selecting a variable (circular) density and Poisson&amp;amp;rsquo;s ratio simultaneously over solely varying the density parameter. The secondary aim is to show that the variable Poisson&amp;amp;rsquo;s ratio is a much better choice in comparison to variable density as a non-homogeneity parameter.</description>
	<pubDate>2026-05-25</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 83: Vibration Control and Optimization Using Circular Non-Homogeneity Parameters</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/83">doi: 10.3390/appliedmath6060083</a></p>
	<p>Authors:
		 Sapna
		Amit Sharma
		Naveen Mani
		Rahul Shukla
		</p>
	<p>This study determines the time period of vibrational modes for a non-uniform orthotropic parallelogram plate, featuring a one-dimensional circular thickness variation and subjected to clamped (CCCC) edges. The authors make assumptions about the material; they assume a one-dimensional circular density variation and incorporate Poisson&amp;amp;rsquo;s ratio to address material non-uniformity. The motivation to choose circular variation in the plate parameter was due to its numerous applications in engineering and real-life applications like engine covers, rotor blades, etc. The authors also account for a parabolic temperature gradient across the plate. Utilizing the Rayleigh&amp;amp;ndash;Ritz technique, they derive the frequency equation and solve it to determine the vibration mode time periods. This study includes a convergence analysis of the plate across (CCCC) edge conditions. The primary aim is to demonstrate the advantage of selecting a variable (circular) density and Poisson&amp;amp;rsquo;s ratio simultaneously over solely varying the density parameter. The secondary aim is to show that the variable Poisson&amp;amp;rsquo;s ratio is a much better choice in comparison to variable density as a non-homogeneity parameter.</p>
	]]></content:encoded>

	<dc:title>Vibration Control and Optimization Using Circular Non-Homogeneity Parameters</dc:title>
			<dc:creator> Sapna</dc:creator>
			<dc:creator>Amit Sharma</dc:creator>
			<dc:creator>Naveen Mani</dc:creator>
			<dc:creator>Rahul Shukla</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060083</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-25</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-25</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>83</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060083</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/83</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/6/82">

	<title>AppliedMath, Vol. 6, Pages 82: A Dynamic Framework for Defensive Pressure Assessment in Football</title>
	<link>https://www.mdpi.com/2673-9909/6/6/82</link>
	<description>This study introduces a novel physics-inspired framework to quantify defensive pressure in football from tracking data. We model defender&amp;amp;ndash;attacker interactions as a variable-mass dynamical system, translating Newtonian mechanics into operational metrics that combine spatial configuration and motion. From this formulation we derive interpretable quantities at dyad, player, and team level, including a Center of Pressure (CP), Defensive Momentum, Defensive Force, and Defensive Work. We illustrate the framework in a single-match proof-of-concept using professional optical tracking data, analysing both full-match behaviour and football-specific phases such as counter-pressing, set-pieces, and throw-ins. Results show how the proposed metrics separate persistent spatial constraint (pressure) from energetically demanding defensive actions (work), enable identification of high-cost match-ups and workload concentration, and support time-resolved descriptions of coordinated pressing sequences. The framework provides a transferable, mechanically grounded toolkit for applied defensive performance analysis and motivates future validation on larger datasets.</description>
	<pubDate>2026-05-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 82: A Dynamic Framework for Defensive Pressure Assessment in Football</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/6/82">doi: 10.3390/appliedmath6060082</a></p>
	<p>Authors:
		César Catalán
		José M. Calabuig
		Luis M. García-Raffi
		Enrique A. Sánchez-Pérez
		</p>
	<p>This study introduces a novel physics-inspired framework to quantify defensive pressure in football from tracking data. We model defender&amp;amp;ndash;attacker interactions as a variable-mass dynamical system, translating Newtonian mechanics into operational metrics that combine spatial configuration and motion. From this formulation we derive interpretable quantities at dyad, player, and team level, including a Center of Pressure (CP), Defensive Momentum, Defensive Force, and Defensive Work. We illustrate the framework in a single-match proof-of-concept using professional optical tracking data, analysing both full-match behaviour and football-specific phases such as counter-pressing, set-pieces, and throw-ins. Results show how the proposed metrics separate persistent spatial constraint (pressure) from energetically demanding defensive actions (work), enable identification of high-cost match-ups and workload concentration, and support time-resolved descriptions of coordinated pressing sequences. The framework provides a transferable, mechanically grounded toolkit for applied defensive performance analysis and motivates future validation on larger datasets.</p>
	]]></content:encoded>

	<dc:title>A Dynamic Framework for Defensive Pressure Assessment in Football</dc:title>
			<dc:creator>César Catalán</dc:creator>
			<dc:creator>José M. Calabuig</dc:creator>
			<dc:creator>Luis M. García-Raffi</dc:creator>
			<dc:creator>Enrique A. Sánchez-Pérez</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6060082</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-22</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-22</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>82</prism:startingPage>
		<prism:doi>10.3390/appliedmath6060082</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/6/82</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/81">

	<title>AppliedMath, Vol. 6, Pages 81: Rank-Poisson Transformation for Use with Count Data in Poisson Regression</title>
	<link>https://www.mdpi.com/2673-9909/6/5/81</link>
	<description>Count outcomes are commonly analyzed using Poisson regression, but empirical data often exhibit overdispersion, excess ties, heaping, or other departures from the Poisson distribution. This paper evaluates a rank-Poisson transformation, denoted poisrank, designed to map observed counts onto Poisson quantiles before fitting a Poisson regression model. Our goal is to test whether a rank-Poisson transformation offers a useful general-purpose strategy when count data do not satisfy Poisson assumptions. Using an empirical example and a Monte Carlo simulation study with Poisson, overdispersed, rounded, and gapped count distributions, we compared Poisson regression on raw counts, Poisson regression after the poisrank transformation, quasi-Poisson regression, and additional comparison approaches. Although the transformation made the marginal distribution more similar to a Poisson distribution, it generally did not outperform standard alternatives for inference. In particular, quasi-Poisson regression more consistently maintained appropriate rejection rates with overdispersion whereas poisrank tended to be conservative and often reduced power. These findings suggest that the rank-Poisson transformation is better understood as an exploratory robustness device than as a preferred replacement for established count-data methods.</description>
	<pubDate>2026-05-20</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 81: Rank-Poisson Transformation for Use with Count Data in Poisson Regression</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/81">doi: 10.3390/appliedmath6050081</a></p>
	<p>Authors:
		Daniel B. Wright
		Sage N. Stafford
		</p>
	<p>Count outcomes are commonly analyzed using Poisson regression, but empirical data often exhibit overdispersion, excess ties, heaping, or other departures from the Poisson distribution. This paper evaluates a rank-Poisson transformation, denoted poisrank, designed to map observed counts onto Poisson quantiles before fitting a Poisson regression model. Our goal is to test whether a rank-Poisson transformation offers a useful general-purpose strategy when count data do not satisfy Poisson assumptions. Using an empirical example and a Monte Carlo simulation study with Poisson, overdispersed, rounded, and gapped count distributions, we compared Poisson regression on raw counts, Poisson regression after the poisrank transformation, quasi-Poisson regression, and additional comparison approaches. Although the transformation made the marginal distribution more similar to a Poisson distribution, it generally did not outperform standard alternatives for inference. In particular, quasi-Poisson regression more consistently maintained appropriate rejection rates with overdispersion whereas poisrank tended to be conservative and often reduced power. These findings suggest that the rank-Poisson transformation is better understood as an exploratory robustness device than as a preferred replacement for established count-data methods.</p>
	]]></content:encoded>

	<dc:title>Rank-Poisson Transformation for Use with Count Data in Poisson Regression</dc:title>
			<dc:creator>Daniel B. Wright</dc:creator>
			<dc:creator>Sage N. Stafford</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050081</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-20</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-20</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>81</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050081</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/81</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/80">

	<title>AppliedMath, Vol. 6, Pages 80: Optimizing Motion Sequences with Projective Dual Quaternions</title>
	<link>https://www.mdpi.com/2673-9909/6/5/80</link>
	<description>This paper builds upon a previous study suggesting an optimization procedure for rotation sequences by introducing a fourth factor in Euler-type decompositions, thus allowing for an additional degree of freedom used both as a variational parameter and a means to avoid the gimbal lock singularity. Here, an analogous result is derived for generic rigid motions, which is of potential interest in 3D robot manipulators, aircraft, and spacecraft using gimbals to navigate in space. The idea is based on Kotelnikov&amp;amp;rsquo;s principle of transference, which extends the properties of pure rotations to arbitrary Galilean transformations, interpreted as screw motions. To do that in practice, it is convenient to use dual quaternions or their projective version, referred to as dual Rodrigues&amp;amp;rsquo; vectors. With this approach, the explicit solutions are easy to extend and therefore optimization is rather straightforward: we show, both analytically and with numerical examples, that factorizing motion into sequences of four consecutive screws is, in general, significantly more energy-efficient compared to using three.</description>
	<pubDate>2026-05-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 80: Optimizing Motion Sequences with Projective Dual Quaternions</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/80">doi: 10.3390/appliedmath6050080</a></p>
	<p>Authors:
		Danail Brezov
		</p>
	<p>This paper builds upon a previous study suggesting an optimization procedure for rotation sequences by introducing a fourth factor in Euler-type decompositions, thus allowing for an additional degree of freedom used both as a variational parameter and a means to avoid the gimbal lock singularity. Here, an analogous result is derived for generic rigid motions, which is of potential interest in 3D robot manipulators, aircraft, and spacecraft using gimbals to navigate in space. The idea is based on Kotelnikov&amp;amp;rsquo;s principle of transference, which extends the properties of pure rotations to arbitrary Galilean transformations, interpreted as screw motions. To do that in practice, it is convenient to use dual quaternions or their projective version, referred to as dual Rodrigues&amp;amp;rsquo; vectors. With this approach, the explicit solutions are easy to extend and therefore optimization is rather straightforward: we show, both analytically and with numerical examples, that factorizing motion into sequences of four consecutive screws is, in general, significantly more energy-efficient compared to using three.</p>
	]]></content:encoded>

	<dc:title>Optimizing Motion Sequences with Projective Dual Quaternions</dc:title>
			<dc:creator>Danail Brezov</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050080</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-15</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-15</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>80</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050080</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/80</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/79">

	<title>AppliedMath, Vol. 6, Pages 79: Diffusion&amp;ndash;Based Degradation Reliability Model with Imperfect Maintenance for Industrial Conveyor Belt Systems</title>
	<link>https://www.mdpi.com/2673-9909/6/5/79</link>
	<description>This study develops a stochastic degradation-based reliability framework for mechanical systems subject to interacting operational stresses and imperfect maintenance. The degradation dynamics are formulated in cumulative damage space and modeled using a geometric It&amp;amp;ocirc; diffusion process, in which the drift term incorporates a multiplicative degradation kernel representing the combined influence of load, speed, misalignment, and environmental exposure. Imperfect maintenance is represented through a continuous attenuation functional embedded within the drift structure, allowing maintenance actions to reduce degradation growth without restoring the system to an as-good-as-new condition. Using a logarithmic transformation, the multiplicative stochastic differential equation is converted into an additive diffusion process, enabling analytical treatment via It&amp;amp;ocirc;&amp;amp;rsquo;s lemma. A closed-form reliability expression is then obtained through first-passage analysis, yielding a lognormal survival function governed directly by the degradation dynamics. Numerical evaluation demonstrates physically consistent wear-out behavior and confirms the stability of the derived reliability formulation. The model further enables reliability-based maintenance optimization through preventive replacement analysis. Sensitivity results indicate that system reliability is strongly influenced by the degradation growth parameter governing the stochastic drift. The proposed framework provides a mathematically tractable connection between stochastic degradation modeling, reliability theory, and maintenance optimization. Beyond its application to conveyor belt systems, the formulation offers a general analytical structure for reliability assessment of degrading engineering systems governed by multiplicative stochastic dynamics.</description>
	<pubDate>2026-05-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 79: Diffusion&amp;ndash;Based Degradation Reliability Model with Imperfect Maintenance for Industrial Conveyor Belt Systems</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/79">doi: 10.3390/appliedmath6050079</a></p>
	<p>Authors:
		Daniel O. Aikhuele
		Shahryar Sorooshian
		Harold U. Nwosu
		</p>
	<p>This study develops a stochastic degradation-based reliability framework for mechanical systems subject to interacting operational stresses and imperfect maintenance. The degradation dynamics are formulated in cumulative damage space and modeled using a geometric It&amp;amp;ocirc; diffusion process, in which the drift term incorporates a multiplicative degradation kernel representing the combined influence of load, speed, misalignment, and environmental exposure. Imperfect maintenance is represented through a continuous attenuation functional embedded within the drift structure, allowing maintenance actions to reduce degradation growth without restoring the system to an as-good-as-new condition. Using a logarithmic transformation, the multiplicative stochastic differential equation is converted into an additive diffusion process, enabling analytical treatment via It&amp;amp;ocirc;&amp;amp;rsquo;s lemma. A closed-form reliability expression is then obtained through first-passage analysis, yielding a lognormal survival function governed directly by the degradation dynamics. Numerical evaluation demonstrates physically consistent wear-out behavior and confirms the stability of the derived reliability formulation. The model further enables reliability-based maintenance optimization through preventive replacement analysis. Sensitivity results indicate that system reliability is strongly influenced by the degradation growth parameter governing the stochastic drift. The proposed framework provides a mathematically tractable connection between stochastic degradation modeling, reliability theory, and maintenance optimization. Beyond its application to conveyor belt systems, the formulation offers a general analytical structure for reliability assessment of degrading engineering systems governed by multiplicative stochastic dynamics.</p>
	]]></content:encoded>

	<dc:title>Diffusion&amp;amp;ndash;Based Degradation Reliability Model with Imperfect Maintenance for Industrial Conveyor Belt Systems</dc:title>
			<dc:creator>Daniel O. Aikhuele</dc:creator>
			<dc:creator>Shahryar Sorooshian</dc:creator>
			<dc:creator>Harold U. Nwosu</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050079</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-15</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-15</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>79</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050079</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/79</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/78">

	<title>AppliedMath, Vol. 6, Pages 78: New Handy and Accurate Approximation for the Inverse Error Function and Cumulative Distribution Integrals with Applications</title>
	<link>https://www.mdpi.com/2673-9909/6/5/78</link>
	<description>This paper presents analytical approximations for the inverse error function, its complementary inverse, and the cumulative distribution function using the Power Series Extender Method (PSEM). The proposed expressions exhibit high accuracy over a wide portion of the domain, particularly in the central region, while maintaining a compact structure based on elementary functions. This formulation ensures practical implementation and computational efficiency without the need for specialized numerical algorithms. The use of strategically selected cancellation points further enhances the accuracy of the approximations, especially in regions of interest. As expected for this class of elementary approximations, a gradual loss of accuracy is observed near the boundaries of the domain due to the asymptotic behavior of the inverse functions. To demonstrate the effectiveness and practical relevance of the proposed expressions, two case studies are presented, involving applications in statistical analysis and engineering contexts.</description>
	<pubDate>2026-05-14</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 78: New Handy and Accurate Approximation for the Inverse Error Function and Cumulative Distribution Integrals with Applications</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/78">doi: 10.3390/appliedmath6050078</a></p>
	<p>Authors:
		Mario Alberto Sandoval-Hernandez
		Arturo Sarmiento-Reyes
		Fernando Ivan Molina-Herrera
		Hugo Jimenez-Islas
		Uriel Antonio Filobello-Nino
		Gerardo Ulises Diaz-Arango
		Francisco Marroquin-Gutierrez
		Rogelio Alejandro Callejas-Molina
		Sandra Ysabel Campos-Dominguez
		Cristian Dumay Hernandez-Garcia
		Hector Vazquez-Leal
		</p>
	<p>This paper presents analytical approximations for the inverse error function, its complementary inverse, and the cumulative distribution function using the Power Series Extender Method (PSEM). The proposed expressions exhibit high accuracy over a wide portion of the domain, particularly in the central region, while maintaining a compact structure based on elementary functions. This formulation ensures practical implementation and computational efficiency without the need for specialized numerical algorithms. The use of strategically selected cancellation points further enhances the accuracy of the approximations, especially in regions of interest. As expected for this class of elementary approximations, a gradual loss of accuracy is observed near the boundaries of the domain due to the asymptotic behavior of the inverse functions. To demonstrate the effectiveness and practical relevance of the proposed expressions, two case studies are presented, involving applications in statistical analysis and engineering contexts.</p>
	]]></content:encoded>

	<dc:title>New Handy and Accurate Approximation for the Inverse Error Function and Cumulative Distribution Integrals with Applications</dc:title>
			<dc:creator>Mario Alberto Sandoval-Hernandez</dc:creator>
			<dc:creator>Arturo Sarmiento-Reyes</dc:creator>
			<dc:creator>Fernando Ivan Molina-Herrera</dc:creator>
			<dc:creator>Hugo Jimenez-Islas</dc:creator>
			<dc:creator>Uriel Antonio Filobello-Nino</dc:creator>
			<dc:creator>Gerardo Ulises Diaz-Arango</dc:creator>
			<dc:creator>Francisco Marroquin-Gutierrez</dc:creator>
			<dc:creator>Rogelio Alejandro Callejas-Molina</dc:creator>
			<dc:creator>Sandra Ysabel Campos-Dominguez</dc:creator>
			<dc:creator>Cristian Dumay Hernandez-Garcia</dc:creator>
			<dc:creator>Hector Vazquez-Leal</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050078</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-14</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-14</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>78</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050078</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/78</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/77">

	<title>AppliedMath, Vol. 6, Pages 77: Prognostic Value of Scoring and 0-Upcrossing in Statistical Quality Control</title>
	<link>https://www.mdpi.com/2673-9909/6/5/77</link>
	<description>Rising temperatures in industrial processes are a serious alert that the system can be shifting from an In Control (InC) to an Out of Control (OutC) state, causing waste, financial losses and, eventually, disaster. Consultation in a case study analyzing the Statistical Quality Control (SQC) routines in a potato chip factory revealed that laymen dealing with data may naively spoil and misuse traditional SQC tools, downgrading the interval-scale temperature data to a simple nominal classification, true or false Negative (N) or Positive (P) symptoms that the production line is InC or OutC. Appropriate scores, negative for true N and false P, and positive for false N and true P, were designed so that their moving averages upcrossing 0 detect clusters of suspicious temperature deregulation, in order to effectively salvage the InC/OutC prognostic value of data.</description>
	<pubDate>2026-05-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 77: Prognostic Value of Scoring and 0-Upcrossing in Statistical Quality Control</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/77">doi: 10.3390/appliedmath6050077</a></p>
	<p>Authors:
		Dinis Pestana
		Maria Luísa Rocha
		</p>
	<p>Rising temperatures in industrial processes are a serious alert that the system can be shifting from an In Control (InC) to an Out of Control (OutC) state, causing waste, financial losses and, eventually, disaster. Consultation in a case study analyzing the Statistical Quality Control (SQC) routines in a potato chip factory revealed that laymen dealing with data may naively spoil and misuse traditional SQC tools, downgrading the interval-scale temperature data to a simple nominal classification, true or false Negative (N) or Positive (P) symptoms that the production line is InC or OutC. Appropriate scores, negative for true N and false P, and positive for false N and true P, were designed so that their moving averages upcrossing 0 detect clusters of suspicious temperature deregulation, in order to effectively salvage the InC/OutC prognostic value of data.</p>
	]]></content:encoded>

	<dc:title>Prognostic Value of Scoring and 0-Upcrossing in Statistical Quality Control</dc:title>
			<dc:creator>Dinis Pestana</dc:creator>
			<dc:creator>Maria Luísa Rocha</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050077</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-12</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-12</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>77</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050077</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/77</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/76">

	<title>AppliedMath, Vol. 6, Pages 76: A Reduced Analytical Formulation for Linear Elastic Behavior of Axisymmetric Shells</title>
	<link>https://www.mdpi.com/2673-9909/6/5/76</link>
	<description>A reduced analytical formulation for the linear elastic behavior of axisymmetric shells subjected to axisymmetric load distributions is presented. The mechanical response of the shell is interpreted through the interaction between two families of one&amp;amp;ndash;dimensional structural elements, namely meridian fibers and circumferential fibers, whose kinematic coupling emerges naturally from the compatibility relations of the classical Reissner&amp;amp;ndash;Mindlin shell theory. By exploiting a geometric reinterpretation of the shell kinematics in terms of auxiliary curvature radii, a simplified mechanical model is derived by neglecting the kinematic contributions associated with one of these radii, which become negligible for shells sufficiently far from the degenerative planar membrane/plate configuration. The resulting formulation leads to a reduced set of compatibility, equilibrium, and constitutive equations that preserve the essential mechanical features of the shell response while significantly simplifying the mathematical structure of the problem. Two internally constrained variants of the reduced model are introduced, corresponding, respectively, to shear&amp;amp;ndash;indeformable and inextensible meridian fibers. Within this framework, the governing equations reduce to ordinary differential equations that, for specific shell geometries such as spherical and conical shells, admit closed-form analytical solutions. Based on these reduced models, two approximate solution strategies are developed. The first relies directly on the reduced shear&amp;amp;ndash;indeformable shell formulation to describe the overall structural behavior, whereas the second combines membrane solutions with the more internally constrained shell model to capture boundary effects through a superposition procedure. The effectiveness of the proposed approaches is assessed through comparison with numerical solutions obtained from the classical Reissner&amp;amp;ndash;Mindlin axisymmetric shell model. The results show that the proposed formulations provide an accurate approximation of both displacements and stress resultants for a sufficiently large range of spherical and conical shell configurations under distributed loads.</description>
	<pubDate>2026-05-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 76: A Reduced Analytical Formulation for Linear Elastic Behavior of Axisymmetric Shells</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/76">doi: 10.3390/appliedmath6050076</a></p>
	<p>Authors:
		Remo Pacella
		Angelo Di Egidio
		</p>
	<p>A reduced analytical formulation for the linear elastic behavior of axisymmetric shells subjected to axisymmetric load distributions is presented. The mechanical response of the shell is interpreted through the interaction between two families of one&amp;amp;ndash;dimensional structural elements, namely meridian fibers and circumferential fibers, whose kinematic coupling emerges naturally from the compatibility relations of the classical Reissner&amp;amp;ndash;Mindlin shell theory. By exploiting a geometric reinterpretation of the shell kinematics in terms of auxiliary curvature radii, a simplified mechanical model is derived by neglecting the kinematic contributions associated with one of these radii, which become negligible for shells sufficiently far from the degenerative planar membrane/plate configuration. The resulting formulation leads to a reduced set of compatibility, equilibrium, and constitutive equations that preserve the essential mechanical features of the shell response while significantly simplifying the mathematical structure of the problem. Two internally constrained variants of the reduced model are introduced, corresponding, respectively, to shear&amp;amp;ndash;indeformable and inextensible meridian fibers. Within this framework, the governing equations reduce to ordinary differential equations that, for specific shell geometries such as spherical and conical shells, admit closed-form analytical solutions. Based on these reduced models, two approximate solution strategies are developed. The first relies directly on the reduced shear&amp;amp;ndash;indeformable shell formulation to describe the overall structural behavior, whereas the second combines membrane solutions with the more internally constrained shell model to capture boundary effects through a superposition procedure. The effectiveness of the proposed approaches is assessed through comparison with numerical solutions obtained from the classical Reissner&amp;amp;ndash;Mindlin axisymmetric shell model. The results show that the proposed formulations provide an accurate approximation of both displacements and stress resultants for a sufficiently large range of spherical and conical shell configurations under distributed loads.</p>
	]]></content:encoded>

	<dc:title>A Reduced Analytical Formulation for Linear Elastic Behavior of Axisymmetric Shells</dc:title>
			<dc:creator>Remo Pacella</dc:creator>
			<dc:creator>Angelo Di Egidio</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050076</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-09</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-09</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>76</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050076</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/76</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/75">

	<title>AppliedMath, Vol. 6, Pages 75: Heat Transfer in Composite Cylinders Under Harmonically Oscillating Ambient Conditions</title>
	<link>https://www.mdpi.com/2673-9909/6/5/75</link>
	<description>An analytical solution is presented for transient heat conduction in a two-layer composite cylinder subjected to outer-surface convection with a general time-dependent ambient temperature. Using Duhamel&amp;amp;rsquo;s principle, closed-form series expressions are derived and then specialized to harmonic ambient fluctuations, recovering the classical constant-ambient solution in the zero-frequency limit. A parametric study shows that the ratio of the inner layer conductivity to the conductivity of the outer layer strongly shapes interfacial gradients and mean-temperature evolution, with sensitivity concentrated at small ratios and diminishing when the ratio is larger than 0.1. Increasing Biot number accelerates the heat transfer and approaches the isothermal-surface limit as it becomes extremely large. The geometric aspect ratio is most influential when the inner layer is resistive, and becomes weak for large conductivity ratio, supporting thin-coating approximations. Under harmonic ambient fluctuations, the response rapidly reaches a periodic steady state; higher frequency decreases amplitude and increases phase lag, while larger Biot numbers amplify oscillations and reduce delay. The coupled effects of the aspect ratio and the conductivity ratio govern penetration and phase behavior.</description>
	<pubDate>2026-05-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 75: Heat Transfer in Composite Cylinders Under Harmonically Oscillating Ambient Conditions</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/75">doi: 10.3390/appliedmath6050075</a></p>
	<p>Authors:
		Rajai S. Alassar
		Mohammed Abushoshah
		Husain Al-Attas
		Said Algarni
		</p>
	<p>An analytical solution is presented for transient heat conduction in a two-layer composite cylinder subjected to outer-surface convection with a general time-dependent ambient temperature. Using Duhamel&amp;amp;rsquo;s principle, closed-form series expressions are derived and then specialized to harmonic ambient fluctuations, recovering the classical constant-ambient solution in the zero-frequency limit. A parametric study shows that the ratio of the inner layer conductivity to the conductivity of the outer layer strongly shapes interfacial gradients and mean-temperature evolution, with sensitivity concentrated at small ratios and diminishing when the ratio is larger than 0.1. Increasing Biot number accelerates the heat transfer and approaches the isothermal-surface limit as it becomes extremely large. The geometric aspect ratio is most influential when the inner layer is resistive, and becomes weak for large conductivity ratio, supporting thin-coating approximations. Under harmonic ambient fluctuations, the response rapidly reaches a periodic steady state; higher frequency decreases amplitude and increases phase lag, while larger Biot numbers amplify oscillations and reduce delay. The coupled effects of the aspect ratio and the conductivity ratio govern penetration and phase behavior.</p>
	]]></content:encoded>

	<dc:title>Heat Transfer in Composite Cylinders Under Harmonically Oscillating Ambient Conditions</dc:title>
			<dc:creator>Rajai S. Alassar</dc:creator>
			<dc:creator>Mohammed Abushoshah</dc:creator>
			<dc:creator>Husain Al-Attas</dc:creator>
			<dc:creator>Said Algarni</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050075</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-07</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-07</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>75</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050075</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/75</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/74">

	<title>AppliedMath, Vol. 6, Pages 74: An Attacker Cost Functional for Tabular Security: Spectral Geometry, Graph Coherence, and Copula Density Constraints</title>
	<link>https://www.mdpi.com/2673-9909/6/5/74</link>
	<description>Adversarial perturbations measured by &amp;amp;#8467;p norms do not reflect key structural constraints in tabular security data, including anisotropic geometry, feature dependence, and distributional plausibility. We introduce a composite attacker cost functional Catk(x,x&amp;amp;prime;)=&amp;amp;tau;max{0,m(x&amp;amp;prime;)}+&amp;amp;lambda;1&amp;amp;delta;&amp;amp;#8868;G&amp;amp;perp;(&amp;amp;gamma;)(x)&amp;amp;delta;+&amp;amp;lambda;&amp;amp;sum;j&amp;amp;omega;j|&amp;amp;delta;j|+&amp;amp;lambda;2&amp;amp;delta;&amp;amp;#8868;LH&amp;amp;delta;+&amp;amp;lambda;3logf^1(&amp;amp;#1013;)(x)&amp;amp;minus;logf^1(&amp;amp;#1013;)(x&amp;amp;prime;)+&amp;amp;sum;j&amp;amp;isin;supp(&amp;amp;delta;)cj+&amp;amp;beta;|M(supp(&amp;amp;delta;))|&amp;amp;nu;, which integrates a spectrally truncated geometric term, a graph-based coherence penalty, a smooth copula density barrier, and a superlinear module-spread term. Under spectral degeneracy of the legitimate-class covariance, we establish nonnegativity under density dominance, exact zero self-cost, lower semicontinuity, and &amp;amp;lambda;3&amp;amp;kappa;K-weak convexity of the continuous component on compact convex sets, for both affine and &amp;amp;rho;m-weakly convex scoring functions. These properties yield existence of constrained minimizers. The continuous component is locally Lipschitz, whereas the full functional is not due to the support-counting term. A component feasibility result shows that each term eliminates a distinct class of degenerate perturbations. Limiting regimes and refined evasion cost bounds are derived. An empirical instantiation on PHIUSIIL indicates that perturbations with identical &amp;amp;#8467;2 norm can incur costs differing by an order of magnitude.</description>
	<pubDate>2026-05-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 74: An Attacker Cost Functional for Tabular Security: Spectral Geometry, Graph Coherence, and Copula Density Constraints</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/74">doi: 10.3390/appliedmath6050074</a></p>
	<p>Authors:
		Julian Allagan
		Vladimir Deriglazov
		Kevin Pereyra
		Matthew Hill
		</p>
	<p>Adversarial perturbations measured by &amp;amp;#8467;p norms do not reflect key structural constraints in tabular security data, including anisotropic geometry, feature dependence, and distributional plausibility. We introduce a composite attacker cost functional Catk(x,x&amp;amp;prime;)=&amp;amp;tau;max{0,m(x&amp;amp;prime;)}+&amp;amp;lambda;1&amp;amp;delta;&amp;amp;#8868;G&amp;amp;perp;(&amp;amp;gamma;)(x)&amp;amp;delta;+&amp;amp;lambda;&amp;amp;sum;j&amp;amp;omega;j|&amp;amp;delta;j|+&amp;amp;lambda;2&amp;amp;delta;&amp;amp;#8868;LH&amp;amp;delta;+&amp;amp;lambda;3logf^1(&amp;amp;#1013;)(x)&amp;amp;minus;logf^1(&amp;amp;#1013;)(x&amp;amp;prime;)+&amp;amp;sum;j&amp;amp;isin;supp(&amp;amp;delta;)cj+&amp;amp;beta;|M(supp(&amp;amp;delta;))|&amp;amp;nu;, which integrates a spectrally truncated geometric term, a graph-based coherence penalty, a smooth copula density barrier, and a superlinear module-spread term. Under spectral degeneracy of the legitimate-class covariance, we establish nonnegativity under density dominance, exact zero self-cost, lower semicontinuity, and &amp;amp;lambda;3&amp;amp;kappa;K-weak convexity of the continuous component on compact convex sets, for both affine and &amp;amp;rho;m-weakly convex scoring functions. These properties yield existence of constrained minimizers. The continuous component is locally Lipschitz, whereas the full functional is not due to the support-counting term. A component feasibility result shows that each term eliminates a distinct class of degenerate perturbations. Limiting regimes and refined evasion cost bounds are derived. An empirical instantiation on PHIUSIIL indicates that perturbations with identical &amp;amp;#8467;2 norm can incur costs differing by an order of magnitude.</p>
	]]></content:encoded>

	<dc:title>An Attacker Cost Functional for Tabular Security: Spectral Geometry, Graph Coherence, and Copula Density Constraints</dc:title>
			<dc:creator>Julian Allagan</dc:creator>
			<dc:creator>Vladimir Deriglazov</dc:creator>
			<dc:creator>Kevin Pereyra</dc:creator>
			<dc:creator>Matthew Hill</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050074</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-07</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-07</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>74</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050074</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/74</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/73">

	<title>AppliedMath, Vol. 6, Pages 73: A Class of Bi-Bazilevi&amp;#269; Mappings Generated via Miller-Ross Type Poisson Distribution Subordinate to Chebyshev Polynomials</title>
	<link>https://www.mdpi.com/2673-9909/6/5/73</link>
	<description>Bazilevi&amp;amp;#269; mappings are considered very important in the theory of geometric mappings because they provide a way to generalize and study the properties of important classes of univalent mappings. Their importance is not only in the deepening of the theory, but also in the practical means of modeling phenomena in applied science and engineering, physics, and differential equations. This paper, in this sense, provides a new subclass of bi-Bazilevi&amp;amp;#269; mappings with the use of advanced analytical methods, Chebyshev polynomials on one side, and a Miller&amp;amp;ndash;Ross-type Poisson distribution on the other side. The Poisson distribution is considered one of the most important models of probability distributions with a large scope of application in the various sciences. The main components of this study are the definition and the study of this new class of functions, in which the initial Taylor&amp;amp;ndash;Maclaurin coefficients, in particular, q2 and q3, are determined and estimated for mappings in this subclass. Also, the classical Fekete&amp;amp;ndash;Szeg&amp;amp;ouml; problem is solved and the first-order limits of this important functional are obtained with respect to the newly introduced bi-Bazilevi&amp;amp;#269; mappings. The outcomes contribute to expanding both the theoretical and practical aspects of this type of mapping.</description>
	<pubDate>2026-05-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 73: A Class of Bi-Bazilevi&amp;#269; Mappings Generated via Miller-Ross Type Poisson Distribution Subordinate to Chebyshev Polynomials</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/73">doi: 10.3390/appliedmath6050073</a></p>
	<p>Authors:
		Saba N. Al-Khafaji
		Emad Kadhim Mouajeeb
		</p>
	<p>Bazilevi&amp;amp;#269; mappings are considered very important in the theory of geometric mappings because they provide a way to generalize and study the properties of important classes of univalent mappings. Their importance is not only in the deepening of the theory, but also in the practical means of modeling phenomena in applied science and engineering, physics, and differential equations. This paper, in this sense, provides a new subclass of bi-Bazilevi&amp;amp;#269; mappings with the use of advanced analytical methods, Chebyshev polynomials on one side, and a Miller&amp;amp;ndash;Ross-type Poisson distribution on the other side. The Poisson distribution is considered one of the most important models of probability distributions with a large scope of application in the various sciences. The main components of this study are the definition and the study of this new class of functions, in which the initial Taylor&amp;amp;ndash;Maclaurin coefficients, in particular, q2 and q3, are determined and estimated for mappings in this subclass. Also, the classical Fekete&amp;amp;ndash;Szeg&amp;amp;ouml; problem is solved and the first-order limits of this important functional are obtained with respect to the newly introduced bi-Bazilevi&amp;amp;#269; mappings. The outcomes contribute to expanding both the theoretical and practical aspects of this type of mapping.</p>
	]]></content:encoded>

	<dc:title>A Class of Bi-Bazilevi&amp;amp;#269; Mappings Generated via Miller-Ross Type Poisson Distribution Subordinate to Chebyshev Polynomials</dc:title>
			<dc:creator>Saba N. Al-Khafaji</dc:creator>
			<dc:creator>Emad Kadhim Mouajeeb</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050073</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-07</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-07</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>73</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050073</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/73</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/72">

	<title>AppliedMath, Vol. 6, Pages 72: An Analytical Approximation of Warrant Prices via GARCH Models</title>
	<link>https://www.mdpi.com/2673-9909/6/5/72</link>
	<description>A warrant is a financial derivative that grants the holder the right to purchase company shares at a predetermined price within a specified period. Generally, upon exercise, the total number of outstanding shares increases because of the issuance of new shares, reducing the stock price. In this study, an analytical formula for warrant valuation is developed without relying on the restrictive assumptions of log-normal asset return distributions or constant volatility. The model incorporates key financial variables, including the current asset price, the strike price, the risk-free interest rate, the time to maturity, and the dilution factor. To capture dynamic market conditions, asset return volatility is estimated using GARCH-type models. The performance of this analytical approach is evaluated by comparing its numerical results with those obtained using alternative methods, such as Monte Carlo simulations and the conventional warrant valuation framework. An empirical analysis based on data from the Stock Exchange of Thailand indicates that the proposed method yields improved pricing accuracy with lower estimation errors than existing benchmarks.</description>
	<pubDate>2026-05-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 72: An Analytical Approximation of Warrant Prices via GARCH Models</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/72">doi: 10.3390/appliedmath6050072</a></p>
	<p>Authors:
		Noppanon Teangthae
		Dawud Thongtha
		</p>
	<p>A warrant is a financial derivative that grants the holder the right to purchase company shares at a predetermined price within a specified period. Generally, upon exercise, the total number of outstanding shares increases because of the issuance of new shares, reducing the stock price. In this study, an analytical formula for warrant valuation is developed without relying on the restrictive assumptions of log-normal asset return distributions or constant volatility. The model incorporates key financial variables, including the current asset price, the strike price, the risk-free interest rate, the time to maturity, and the dilution factor. To capture dynamic market conditions, asset return volatility is estimated using GARCH-type models. The performance of this analytical approach is evaluated by comparing its numerical results with those obtained using alternative methods, such as Monte Carlo simulations and the conventional warrant valuation framework. An empirical analysis based on data from the Stock Exchange of Thailand indicates that the proposed method yields improved pricing accuracy with lower estimation errors than existing benchmarks.</p>
	]]></content:encoded>

	<dc:title>An Analytical Approximation of Warrant Prices via GARCH Models</dc:title>
			<dc:creator>Noppanon Teangthae</dc:creator>
			<dc:creator>Dawud Thongtha</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050072</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-07</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-07</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>72</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050072</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/72</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/71">

	<title>AppliedMath, Vol. 6, Pages 71: Application of Statistical and Machine Learning Models in Vietnam&amp;rsquo;s Energy Consumption Demand Forecasting</title>
	<link>https://www.mdpi.com/2673-9909/6/5/71</link>
	<description>Energy consumption demand forecasting plays a critical role in the planning and development of national energy security, which underpins the Vietnam&amp;amp;rsquo;s Eighth National Power Development Plan (PDP VIII) and Vietnam&amp;amp;rsquo;s ambitious Net-Zero 2050 commitment. However, this task becomes more difficult because the big data environment is filled with a lot of noise and highly fluctuating data. In order to deal with the problem, this paper evaluates five models: Linear Regression, Holt&amp;amp;rsquo;s Exponential Smoothing, PSO-GM (1,1), Support Vector Regression (SVR), and Random Forest as a benchmark to conduct a rigorous comparative analysis to identify the most accurate forecasting model. The performance was evaluated by MAE, RMSE, and MAPE indexes based on Vietnam&amp;amp;rsquo;s total primary energy demand data from 1986 to 2024. To check the accuracy of the forecasting model, this study split the data into two periods: first time for the training data (1986&amp;amp;ndash;2016), and second for the testing data set (2017&amp;amp;ndash;2024). Furthermore, a five-fold rolling-window time-series cross-validation method and Diebold&amp;amp;ndash;Mariano tests were employed to ensure the statistical robustness of the findings on the small-sample datasets (n = 39). The results decisively identified that the Holt&amp;amp;rsquo;s model as the superior framework, maintaining high stability and achieving a testing MAPE of 7.19% (training MAPE of 5.52%), while the complex machine learning benchmark shows severe over-fitting. Applying this model, Vietnam&amp;amp;rsquo;s energy demand will reach 1528.08 TWh and 1882.55 TWh in 2025 and 2030, respectively. Furthermore, this study provides empirical evidence that simpler, well-chosen statistical models can surpass complex alternatives in small-sample scenarios, offering a reliable quantitative baseline for policymakers to navigate infrastructure development and decarbonization challenges.</description>
	<pubDate>2026-05-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 71: Application of Statistical and Machine Learning Models in Vietnam&amp;rsquo;s Energy Consumption Demand Forecasting</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/71">doi: 10.3390/appliedmath6050071</a></p>
	<p>Authors:
		Van Thanh Phan
		Duc Trien Nguyen
		Ngoc Xuan Quynh Nguyen
		Xuan Hau Huynh
		</p>
	<p>Energy consumption demand forecasting plays a critical role in the planning and development of national energy security, which underpins the Vietnam&amp;amp;rsquo;s Eighth National Power Development Plan (PDP VIII) and Vietnam&amp;amp;rsquo;s ambitious Net-Zero 2050 commitment. However, this task becomes more difficult because the big data environment is filled with a lot of noise and highly fluctuating data. In order to deal with the problem, this paper evaluates five models: Linear Regression, Holt&amp;amp;rsquo;s Exponential Smoothing, PSO-GM (1,1), Support Vector Regression (SVR), and Random Forest as a benchmark to conduct a rigorous comparative analysis to identify the most accurate forecasting model. The performance was evaluated by MAE, RMSE, and MAPE indexes based on Vietnam&amp;amp;rsquo;s total primary energy demand data from 1986 to 2024. To check the accuracy of the forecasting model, this study split the data into two periods: first time for the training data (1986&amp;amp;ndash;2016), and second for the testing data set (2017&amp;amp;ndash;2024). Furthermore, a five-fold rolling-window time-series cross-validation method and Diebold&amp;amp;ndash;Mariano tests were employed to ensure the statistical robustness of the findings on the small-sample datasets (n = 39). The results decisively identified that the Holt&amp;amp;rsquo;s model as the superior framework, maintaining high stability and achieving a testing MAPE of 7.19% (training MAPE of 5.52%), while the complex machine learning benchmark shows severe over-fitting. Applying this model, Vietnam&amp;amp;rsquo;s energy demand will reach 1528.08 TWh and 1882.55 TWh in 2025 and 2030, respectively. Furthermore, this study provides empirical evidence that simpler, well-chosen statistical models can surpass complex alternatives in small-sample scenarios, offering a reliable quantitative baseline for policymakers to navigate infrastructure development and decarbonization challenges.</p>
	]]></content:encoded>

	<dc:title>Application of Statistical and Machine Learning Models in Vietnam&amp;amp;rsquo;s Energy Consumption Demand Forecasting</dc:title>
			<dc:creator>Van Thanh Phan</dc:creator>
			<dc:creator>Duc Trien Nguyen</dc:creator>
			<dc:creator>Ngoc Xuan Quynh Nguyen</dc:creator>
			<dc:creator>Xuan Hau Huynh</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050071</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-07</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-07</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>71</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050071</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/71</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/70">

	<title>AppliedMath, Vol. 6, Pages 70: Interpolative Geraghty-Type Contractions in Bicomplex-Valued Metric Spaces: Fixed Point Results, Stability Analysis, and Applications</title>
	<link>https://www.mdpi.com/2673-9909/6/5/70</link>
	<description>In this paper, we introduce and systematically study the class of interpolative Geraghty-type contractive mappings within the framework of complete bicomplex-valued metric spaces (bi-CVMS). We prove seven new results: (i) a fixed point theorem for a single interpolative Geraghty contraction; (ii) a common fixed point theorem for a pair of such mappings; (iii) a fixed point theorem for interpolative Reich&amp;amp;ndash;Rus&amp;amp;ndash;&amp;amp;#262;iri&amp;amp;#263; type contractions in bi-CVMS; (iv) a coincidence point and common fixed point theorem for weakly compatible maps; (v) a fixed point theorem for Jaggi-type hybrid contractions in bi-CVMS; (vi) a stability result for the Picard iteration associated with the main contraction; and (vii) an application theorem establishing the existence and uniqueness of solutions to a boundary value problem governed by a Caputo fractional differential equation. All results are furnished with complete proofs and non-trivial illustrative examples. Several well-known theorems&amp;amp;mdash;including those of Banach, Kannan, Reich, Geraghty, and their complex-valued analogues&amp;amp;mdash;follow as special cases. The paper significantly advances the fixed point theory in bicomplex-valued metric spaces.</description>
	<pubDate>2026-05-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 70: Interpolative Geraghty-Type Contractions in Bicomplex-Valued Metric Spaces: Fixed Point Results, Stability Analysis, and Applications</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/70">doi: 10.3390/appliedmath6050070</a></p>
	<p>Authors:
		Rakhal Das
		Satyendra Narayan
		</p>
	<p>In this paper, we introduce and systematically study the class of interpolative Geraghty-type contractive mappings within the framework of complete bicomplex-valued metric spaces (bi-CVMS). We prove seven new results: (i) a fixed point theorem for a single interpolative Geraghty contraction; (ii) a common fixed point theorem for a pair of such mappings; (iii) a fixed point theorem for interpolative Reich&amp;amp;ndash;Rus&amp;amp;ndash;&amp;amp;#262;iri&amp;amp;#263; type contractions in bi-CVMS; (iv) a coincidence point and common fixed point theorem for weakly compatible maps; (v) a fixed point theorem for Jaggi-type hybrid contractions in bi-CVMS; (vi) a stability result for the Picard iteration associated with the main contraction; and (vii) an application theorem establishing the existence and uniqueness of solutions to a boundary value problem governed by a Caputo fractional differential equation. All results are furnished with complete proofs and non-trivial illustrative examples. Several well-known theorems&amp;amp;mdash;including those of Banach, Kannan, Reich, Geraghty, and their complex-valued analogues&amp;amp;mdash;follow as special cases. The paper significantly advances the fixed point theory in bicomplex-valued metric spaces.</p>
	]]></content:encoded>

	<dc:title>Interpolative Geraghty-Type Contractions in Bicomplex-Valued Metric Spaces: Fixed Point Results, Stability Analysis, and Applications</dc:title>
			<dc:creator>Rakhal Das</dc:creator>
			<dc:creator>Satyendra Narayan</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050070</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-05-01</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-05-01</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>70</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050070</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/70</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/69">

	<title>AppliedMath, Vol. 6, Pages 69: Architecture of an AI-Driven Optoelectronic ISR UAV System with Operator-Supervised Autonomy</title>
	<link>https://www.mdpi.com/2673-9909/6/5/69</link>
	<description>This paper presents a proposed architecture for an artificial intelligence-driven unmanned aerial vehicle (UAV) system intended for tactical intelligence, surveillance, and reconnaissance (ISR) missions. The architecture brings together electro-optical imaging, long-wave infrared sensing, two-dimensional light detection and ranging (LiDAR), inertial navigation support, onboard edge computing, and resilient communication links within a unified system-level framework. Unlike many existing approaches that treat perception, autonomy, communication, and safety as loosely coupled functions, the proposed architecture combines multi-modal sensing, operator-supervised autonomy, and a safety-oriented decision validation layer intended for future integration with Ansys SCADE. The system is structured around operational and sensor-performance requirements used to justify the selection and interaction of the main onboard subsystems. At the architectural level, the proposed framework is intended to support target detection, tracking, environment awareness, and mission-level decision support under degraded visibility, constrained communication, and contested operating conditions. The paper therefore contributes a requirement-driven and safety-aware ISR UAV architecture that provides a scalable basis for future implementation, validation, and multi-UAV extension.</description>
	<pubDate>2026-04-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 69: Architecture of an AI-Driven Optoelectronic ISR UAV System with Operator-Supervised Autonomy</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/69">doi: 10.3390/appliedmath6050069</a></p>
	<p>Authors:
		Alexandru-Dragoș Adam
		Alina Nirvana Popescu
		Jair Gonzalez
		</p>
	<p>This paper presents a proposed architecture for an artificial intelligence-driven unmanned aerial vehicle (UAV) system intended for tactical intelligence, surveillance, and reconnaissance (ISR) missions. The architecture brings together electro-optical imaging, long-wave infrared sensing, two-dimensional light detection and ranging (LiDAR), inertial navigation support, onboard edge computing, and resilient communication links within a unified system-level framework. Unlike many existing approaches that treat perception, autonomy, communication, and safety as loosely coupled functions, the proposed architecture combines multi-modal sensing, operator-supervised autonomy, and a safety-oriented decision validation layer intended for future integration with Ansys SCADE. The system is structured around operational and sensor-performance requirements used to justify the selection and interaction of the main onboard subsystems. At the architectural level, the proposed framework is intended to support target detection, tracking, environment awareness, and mission-level decision support under degraded visibility, constrained communication, and contested operating conditions. The paper therefore contributes a requirement-driven and safety-aware ISR UAV architecture that provides a scalable basis for future implementation, validation, and multi-UAV extension.</p>
	]]></content:encoded>

	<dc:title>Architecture of an AI-Driven Optoelectronic ISR UAV System with Operator-Supervised Autonomy</dc:title>
			<dc:creator>Alexandru-Dragoș Adam</dc:creator>
			<dc:creator>Alina Nirvana Popescu</dc:creator>
			<dc:creator>Jair Gonzalez</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050069</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-29</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-29</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>69</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050069</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/69</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/68">

	<title>AppliedMath, Vol. 6, Pages 68: On Efficient Two-Stage Implicit Schemes for Fractional Differential Equations: Parallel OpenMP-Type Execution and Learning-Guided Initializations</title>
	<link>https://www.mdpi.com/2673-9909/6/5/68</link>
	<description>This paper presents a hybrid two-stage implicit scheme for the numerical solution of fractional initial value problems involving Caputo derivatives. The proposed formulation incorporates the nonlinear source term directly into the time-stepping procedure, leading to improved stability and accuracy compared with classical fractional implicit schemes. The resulting nonlinear systems are solved using a parallel iterative strategy based on the Weierstrass-type method, combined with OpenMP-style parallelization to ensure efficient workload distribution and accelerated convergence. In addition, a data-driven module is introduced to generate high-quality initial guesses, thereby enhancing the robustness and efficiency of the nonlinear solver. The main contributions include the development of a unified fractional-parallel-data-driven framework, improved stability properties with enlarged real-axis stability regions, and reduced computational cost through parallel implementation and informed initialization. A theoretical analysis establishes consistency, boundedness, and convergence under standard Lipschitz assumptions. Numerical experiments on representative fractional models demonstrate that the proposed schemes achieve higher accuracy and improved efficiency compared with classical implicit methods, with significant reductions in error and iteration counts. The ANN-enhanced variant further attains near machine-precision accuracy for a range of fractional orders. Overall, the proposed approach provides a robust and scalable computational framework for the efficient solution of nonlinear fractional dynamical systems.</description>
	<pubDate>2026-04-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 68: On Efficient Two-Stage Implicit Schemes for Fractional Differential Equations: Parallel OpenMP-Type Execution and Learning-Guided Initializations</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/68">doi: 10.3390/appliedmath6050068</a></p>
	<p>Authors:
		Mudassir Shams
		Bruno Carpentieri
		</p>
	<p>This paper presents a hybrid two-stage implicit scheme for the numerical solution of fractional initial value problems involving Caputo derivatives. The proposed formulation incorporates the nonlinear source term directly into the time-stepping procedure, leading to improved stability and accuracy compared with classical fractional implicit schemes. The resulting nonlinear systems are solved using a parallel iterative strategy based on the Weierstrass-type method, combined with OpenMP-style parallelization to ensure efficient workload distribution and accelerated convergence. In addition, a data-driven module is introduced to generate high-quality initial guesses, thereby enhancing the robustness and efficiency of the nonlinear solver. The main contributions include the development of a unified fractional-parallel-data-driven framework, improved stability properties with enlarged real-axis stability regions, and reduced computational cost through parallel implementation and informed initialization. A theoretical analysis establishes consistency, boundedness, and convergence under standard Lipschitz assumptions. Numerical experiments on representative fractional models demonstrate that the proposed schemes achieve higher accuracy and improved efficiency compared with classical implicit methods, with significant reductions in error and iteration counts. The ANN-enhanced variant further attains near machine-precision accuracy for a range of fractional orders. Overall, the proposed approach provides a robust and scalable computational framework for the efficient solution of nonlinear fractional dynamical systems.</p>
	]]></content:encoded>

	<dc:title>On Efficient Two-Stage Implicit Schemes for Fractional Differential Equations: Parallel OpenMP-Type Execution and Learning-Guided Initializations</dc:title>
			<dc:creator>Mudassir Shams</dc:creator>
			<dc:creator>Bruno Carpentieri</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050068</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-29</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-29</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>68</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050068</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/68</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/67">

	<title>AppliedMath, Vol. 6, Pages 67: Stability Analysis of R&amp;ouml;ssler Chaotic Attractor via the Nabla Discrete Fractional Operator: Existence, Uniqueness, Ulam&amp;ndash;Hyers Stability, and Numerical Simulation</title>
	<link>https://www.mdpi.com/2673-9909/6/5/67</link>
	<description>This research presents a fractional-order formulation and mathematical analysis of the R&amp;amp;ouml;ssler chaotic attractor. By utilizing the Nabla discrete Atangana&amp;amp;ndash;Baleanu fractional difference derivative in the Caputo sense, the classical integer-order attractor is extended into the fractional domain. The existence and uniqueness of solutions for the resulting fractional system are established via the fixed-point theorem, thereby ensuring that the recommended attractor is well-posed. Furthermore, the Ulam&amp;amp;ndash;Hyers stability is investigated within the Nabla discrete Atangana&amp;amp;ndash;Baleanu fractional difference derivative in the Caputo sense framework. For numerical investigations, an Euler numerical scheme adapted to the fractional difference derivative is developed and implemented, yielding high-quality phase portraits of a chaotic attractor. The results highlight the effectiveness of fractional-order modeling and numerical methods in capturing the dynamics and stability of the R&amp;amp;ouml;ssler chaotic system.</description>
	<pubDate>2026-04-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 67: Stability Analysis of R&amp;ouml;ssler Chaotic Attractor via the Nabla Discrete Fractional Operator: Existence, Uniqueness, Ulam&amp;ndash;Hyers Stability, and Numerical Simulation</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/67">doi: 10.3390/appliedmath6050067</a></p>
	<p>Authors:
		B. Divya
		K. Ganesan
		A. Selvam
		</p>
	<p>This research presents a fractional-order formulation and mathematical analysis of the R&amp;amp;ouml;ssler chaotic attractor. By utilizing the Nabla discrete Atangana&amp;amp;ndash;Baleanu fractional difference derivative in the Caputo sense, the classical integer-order attractor is extended into the fractional domain. The existence and uniqueness of solutions for the resulting fractional system are established via the fixed-point theorem, thereby ensuring that the recommended attractor is well-posed. Furthermore, the Ulam&amp;amp;ndash;Hyers stability is investigated within the Nabla discrete Atangana&amp;amp;ndash;Baleanu fractional difference derivative in the Caputo sense framework. For numerical investigations, an Euler numerical scheme adapted to the fractional difference derivative is developed and implemented, yielding high-quality phase portraits of a chaotic attractor. The results highlight the effectiveness of fractional-order modeling and numerical methods in capturing the dynamics and stability of the R&amp;amp;ouml;ssler chaotic system.</p>
	]]></content:encoded>

	<dc:title>Stability Analysis of R&amp;amp;ouml;ssler Chaotic Attractor via the Nabla Discrete Fractional Operator: Existence, Uniqueness, Ulam&amp;amp;ndash;Hyers Stability, and Numerical Simulation</dc:title>
			<dc:creator>B. Divya</dc:creator>
			<dc:creator>K. Ganesan</dc:creator>
			<dc:creator>A. Selvam</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050067</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-29</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-29</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>67</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050067</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/67</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/66">

	<title>AppliedMath, Vol. 6, Pages 66: Space-Time from the Perspective of Feynman Graphon Models</title>
	<link>https://www.mdpi.com/2673-9909/6/5/66</link>
	<description>The article applies the working platform of topological Hopf algebra of renormalization to address a new construction program for the fabric of space-time from the perspective of Feynman graphon models.</description>
	<pubDate>2026-04-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 66: Space-Time from the Perspective of Feynman Graphon Models</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/66">doi: 10.3390/appliedmath6050066</a></p>
	<p>Authors:
		Ali Shojaei-Fard
		</p>
	<p>The article applies the working platform of topological Hopf algebra of renormalization to address a new construction program for the fabric of space-time from the perspective of Feynman graphon models.</p>
	]]></content:encoded>

	<dc:title>Space-Time from the Perspective of Feynman Graphon Models</dc:title>
			<dc:creator>Ali Shojaei-Fard</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050066</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-29</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-29</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>66</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050066</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/66</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/65">

	<title>AppliedMath, Vol. 6, Pages 65: A Model of Ontogenetic Growth in Animals Suggests That Lifespan Is a Result of Growth</title>
	<link>https://www.mdpi.com/2673-9909/6/5/65</link>
	<description>The problem that this study is concerned with is the ontogenetic growth of humans and animals. The aim of this research is to analyze a model of the ontogenetic growth of animals. The target of the analyses is to show a link between growth and longevity. This model has implications for modelling the growth of humans as well. In this study, pigs were considered model animals for humans. Humans and pigs have a number of comparable physiological features as well as a few analogous aspects of growth. The resemblance of the biological functions leads us to think that by modelling the growth of pigs, one can gain a better look into the growth of humans. In this research, we model growth, which is operationalized as weight gain; weight loss was not considered. In this study, a discussion of the translation of the results to the growth and longevity of humans was provided. The lifespan or longevity of animals was not modelled explicitly; predictions were made in accordance with the results of the growth model. The main result of the model is that growth promotes, if not causes, longevity.</description>
	<pubDate>2026-04-27</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 65: A Model of Ontogenetic Growth in Animals Suggests That Lifespan Is a Result of Growth</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/65">doi: 10.3390/appliedmath6050065</a></p>
	<p>Authors:
		V. L. Stass
		</p>
	<p>The problem that this study is concerned with is the ontogenetic growth of humans and animals. The aim of this research is to analyze a model of the ontogenetic growth of animals. The target of the analyses is to show a link between growth and longevity. This model has implications for modelling the growth of humans as well. In this study, pigs were considered model animals for humans. Humans and pigs have a number of comparable physiological features as well as a few analogous aspects of growth. The resemblance of the biological functions leads us to think that by modelling the growth of pigs, one can gain a better look into the growth of humans. In this research, we model growth, which is operationalized as weight gain; weight loss was not considered. In this study, a discussion of the translation of the results to the growth and longevity of humans was provided. The lifespan or longevity of animals was not modelled explicitly; predictions were made in accordance with the results of the growth model. The main result of the model is that growth promotes, if not causes, longevity.</p>
	]]></content:encoded>

	<dc:title>A Model of Ontogenetic Growth in Animals Suggests That Lifespan Is a Result of Growth</dc:title>
			<dc:creator>V. L. Stass</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050065</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-27</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-27</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>65</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050065</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/65</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/5/64">

	<title>AppliedMath, Vol. 6, Pages 64: A Modular Spatial&amp;ndash;Temporal Approach for Territorial Segmentation and Short-Term Crime Prediction</title>
	<link>https://www.mdpi.com/2673-9909/6/5/64</link>
	<description>Crime forecasting in heterogeneous urban contexts remains challenging due to the combined effects of territorial heterogeneity and complex temporal dynamics. However, a large portion of the existing literature tends to address territorial segmentation and predictive modeling separately, or to combine them within unified workflows that may obscure their distinct analytical roles. This study presents a modular spatial&amp;amp;ndash;temporal analytical approach that treats territorial segmentation and short-term crime prediction as complementary but methodologically independent components. Unsupervised segmentation captures territorial heterogeneity, while a supervised ensemble model estimates short-term crime occurrence. A chronological expanding-window validation scheme is implemented, reserving the most recent period as a blind test set to prevent temporal leakage. Across municipalities, recall values in 2022 range from 0.36 to 0.77, with corresponding F1-scores ranging from 0.174 to 0.696, while blind-test recall ranges from 0.184 to 0.856, with F1-scores ranging from 0.000 to 0.784, and AUC values up to 0.88, indicating that predictive performance is context-dependent rather than uniform. The proposed approach provides a replicable and context-aware analytical approach for spatially differentiated crime risk estimation under strict forward-looking evaluation.</description>
	<pubDate>2026-04-24</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 64: A Modular Spatial&amp;ndash;Temporal Approach for Territorial Segmentation and Short-Term Crime Prediction</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/5/64">doi: 10.3390/appliedmath6050064</a></p>
	<p>Authors:
		Elvira Rolón
		José G. Méndez
		Roberto Pichardo
		</p>
	<p>Crime forecasting in heterogeneous urban contexts remains challenging due to the combined effects of territorial heterogeneity and complex temporal dynamics. However, a large portion of the existing literature tends to address territorial segmentation and predictive modeling separately, or to combine them within unified workflows that may obscure their distinct analytical roles. This study presents a modular spatial&amp;amp;ndash;temporal analytical approach that treats territorial segmentation and short-term crime prediction as complementary but methodologically independent components. Unsupervised segmentation captures territorial heterogeneity, while a supervised ensemble model estimates short-term crime occurrence. A chronological expanding-window validation scheme is implemented, reserving the most recent period as a blind test set to prevent temporal leakage. Across municipalities, recall values in 2022 range from 0.36 to 0.77, with corresponding F1-scores ranging from 0.174 to 0.696, while blind-test recall ranges from 0.184 to 0.856, with F1-scores ranging from 0.000 to 0.784, and AUC values up to 0.88, indicating that predictive performance is context-dependent rather than uniform. The proposed approach provides a replicable and context-aware analytical approach for spatially differentiated crime risk estimation under strict forward-looking evaluation.</p>
	]]></content:encoded>

	<dc:title>A Modular Spatial&amp;amp;ndash;Temporal Approach for Territorial Segmentation and Short-Term Crime Prediction</dc:title>
			<dc:creator>Elvira Rolón</dc:creator>
			<dc:creator>José G. Méndez</dc:creator>
			<dc:creator>Roberto Pichardo</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6050064</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-24</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-24</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>64</prism:startingPage>
		<prism:doi>10.3390/appliedmath6050064</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/5/64</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/4/63">

	<title>AppliedMath, Vol. 6, Pages 63: Asymptotic Solutions for Atmospheric Internal Gravity Waves Generated by a Thermal Forcing in an Anelastic Fluid Flow with Vertical Shear</title>
	<link>https://www.mdpi.com/2673-9909/6/4/63</link>
	<description>Asymptotic solutions are derived to model the development of atmospheric internal gravity waves generated by latent heating in a two-dimensional configuration involving a vertically-sheared background flow. The mathematical model comprises nonlinear partial differential equations derived from the conservation laws of fluid dynamics under the anelastic approximation where the background density and temperature vary with altitude. The latent heating is represented by a horizontally-periodic but vertically-localized nonhomogeneous forcing term in the energy conservation equation. This generates gravity waves that are considered as perturbations to the background flow and are expressed as perturbation series, with the leading-order contributions being the solutions of linearized equations. Taking into account the nonlinear terms at the next order gives expressions for the effects of the waves on the background mean flow. Due to the vertical shear, there is a critical level where momentum and energy are transferred from the wave modes to the mean flow. The asymptotic solutions show that the wave&amp;amp;ndash;mean-flow interaction is nonlocal and occurs over the range of altitudes from the thermal forcing level up the critical level. This is in contrast to what occurs in the case of waves forced by an oscillatory lower boundary, where the interaction is typically localized around the critical level. It is found that the wave drag is negative above the thermal forcing level, making the mean flow velocity more negative, but it becomes positive as the waves approach the critical level, indicating wave absorption in this region. There is wave transmission through the critical level, as well as absorption, and the extent of transmission depends on the depth of the latent heating profile. The mean potential temperature is reduced above the thermal forcing level and enhanced at the critical level, a situation that could ultimately lead to the development of convective instabilities.</description>
	<pubDate>2026-04-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 63: Asymptotic Solutions for Atmospheric Internal Gravity Waves Generated by a Thermal Forcing in an Anelastic Fluid Flow with Vertical Shear</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/4/63">doi: 10.3390/appliedmath6040063</a></p>
	<p>Authors:
		Amna M. Grgar
		Lucy J. Campbell
		</p>
	<p>Asymptotic solutions are derived to model the development of atmospheric internal gravity waves generated by latent heating in a two-dimensional configuration involving a vertically-sheared background flow. The mathematical model comprises nonlinear partial differential equations derived from the conservation laws of fluid dynamics under the anelastic approximation where the background density and temperature vary with altitude. The latent heating is represented by a horizontally-periodic but vertically-localized nonhomogeneous forcing term in the energy conservation equation. This generates gravity waves that are considered as perturbations to the background flow and are expressed as perturbation series, with the leading-order contributions being the solutions of linearized equations. Taking into account the nonlinear terms at the next order gives expressions for the effects of the waves on the background mean flow. Due to the vertical shear, there is a critical level where momentum and energy are transferred from the wave modes to the mean flow. The asymptotic solutions show that the wave&amp;amp;ndash;mean-flow interaction is nonlocal and occurs over the range of altitudes from the thermal forcing level up the critical level. This is in contrast to what occurs in the case of waves forced by an oscillatory lower boundary, where the interaction is typically localized around the critical level. It is found that the wave drag is negative above the thermal forcing level, making the mean flow velocity more negative, but it becomes positive as the waves approach the critical level, indicating wave absorption in this region. There is wave transmission through the critical level, as well as absorption, and the extent of transmission depends on the depth of the latent heating profile. The mean potential temperature is reduced above the thermal forcing level and enhanced at the critical level, a situation that could ultimately lead to the development of convective instabilities.</p>
	]]></content:encoded>

	<dc:title>Asymptotic Solutions for Atmospheric Internal Gravity Waves Generated by a Thermal Forcing in an Anelastic Fluid Flow with Vertical Shear</dc:title>
			<dc:creator>Amna M. Grgar</dc:creator>
			<dc:creator>Lucy J. Campbell</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6040063</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-16</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-16</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>63</prism:startingPage>
		<prism:doi>10.3390/appliedmath6040063</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/4/63</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/4/62">

	<title>AppliedMath, Vol. 6, Pages 62: Optimal Performance Design of Passive Power Filters Using a Multi-Objective Firefly Algorithm</title>
	<link>https://www.mdpi.com/2673-9909/6/4/62</link>
	<description>Harmonic distortion in power systems, primarily caused by nonlinear loads, leads to significant power quality issues such as increased losses, reduced power factor, and equipment malfunctions. To mitigate these effects, passive power filters (PPFs) are widely employed due to their cost-effectiveness and simplicity. This paper presents an optimized design of a single-tuned passive filter (STPF) using the Firefly Algorithm (FFA) and its multi-objective extension, the Multi-Objective Firefly Algorithm (MOFA). The optimization aims to minimize both voltage total harmonic distortion (VTHD) and power loss and to maximize the power factor (PF) while complying with IEEE 519-2014 standards. The study evaluates the proposed method under two different industrial case studies with varying system parameters and harmonic profiles. Simulation results demonstrate that the proposed FFA-based optimization outperforms the Mixed Integer Distributed Ant Colony Optimization (MIDACO) method, achieving superior VTHD reduction, power loss minimization, and power factor enhancement. The MOFA approach provides a Pareto-optimal front, offering trade-offs among competing objectives. Comparative analysis confirms the efficiency, robustness, and faster convergence of FFA-based optimization, making it a promising approach for optimal filter design in power systems.</description>
	<pubDate>2026-04-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 62: Optimal Performance Design of Passive Power Filters Using a Multi-Objective Firefly Algorithm</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/4/62">doi: 10.3390/appliedmath6040062</a></p>
	<p>Authors:
		Mahmoud B. Mahmoud
		Amira M. Salama
		Mustafa AL-Tawfiq
		Khaled H. Ibrahim
		Eslam M. Abd Elaziz
		</p>
	<p>Harmonic distortion in power systems, primarily caused by nonlinear loads, leads to significant power quality issues such as increased losses, reduced power factor, and equipment malfunctions. To mitigate these effects, passive power filters (PPFs) are widely employed due to their cost-effectiveness and simplicity. This paper presents an optimized design of a single-tuned passive filter (STPF) using the Firefly Algorithm (FFA) and its multi-objective extension, the Multi-Objective Firefly Algorithm (MOFA). The optimization aims to minimize both voltage total harmonic distortion (VTHD) and power loss and to maximize the power factor (PF) while complying with IEEE 519-2014 standards. The study evaluates the proposed method under two different industrial case studies with varying system parameters and harmonic profiles. Simulation results demonstrate that the proposed FFA-based optimization outperforms the Mixed Integer Distributed Ant Colony Optimization (MIDACO) method, achieving superior VTHD reduction, power loss minimization, and power factor enhancement. The MOFA approach provides a Pareto-optimal front, offering trade-offs among competing objectives. Comparative analysis confirms the efficiency, robustness, and faster convergence of FFA-based optimization, making it a promising approach for optimal filter design in power systems.</p>
	]]></content:encoded>

	<dc:title>Optimal Performance Design of Passive Power Filters Using a Multi-Objective Firefly Algorithm</dc:title>
			<dc:creator>Mahmoud B. Mahmoud</dc:creator>
			<dc:creator>Amira M. Salama</dc:creator>
			<dc:creator>Mustafa AL-Tawfiq</dc:creator>
			<dc:creator>Khaled H. Ibrahim</dc:creator>
			<dc:creator>Eslam M. Abd Elaziz</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6040062</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-16</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-16</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>62</prism:startingPage>
		<prism:doi>10.3390/appliedmath6040062</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/4/62</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/4/61">

	<title>AppliedMath, Vol. 6, Pages 61: Canonical Fixed Points of Recursive Preference Functors: A Categorical Approach to Hierarchies of Ambiguity</title>
	<link>https://www.mdpi.com/2673-9909/6/4/61</link>
	<description>We develop a categorical framework for modeling recursive uncertainty over preferences in decision theory. Classical models of ambiguity allow for uncertainty over outcomes or beliefs but usually rely on finite or exogenously truncated representations when agents face uncertainty about their own evaluative criteria. Given that such recursive preference formation generates an infinite hierarchy that may not stabilize at any finite level, we introduce a contractive von Neumann&amp;amp;ndash;Morgenstern utility functor on a category of compact metric spaces enriched over complete metric spaces, and establish the existence and uniqueness of its canonical fixed point. This fixed point is interpreted as a universal preference space that contains all levels of recursive ambiguity in a consistent and metrically stable form. We further extend the construction to multi-utility representations and discuss its relation to existing models of ambiguity and universal choice spaces. This framework offers a minimal unified representation of recursive preference structures.</description>
	<pubDate>2026-04-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 61: Canonical Fixed Points of Recursive Preference Functors: A Categorical Approach to Hierarchies of Ambiguity</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/4/61">doi: 10.3390/appliedmath6040061</a></p>
	<p>Authors:
		Stelios Arvanitis
		Pantelis Argyropoulos
		Spyros Vassilakis
		</p>
	<p>We develop a categorical framework for modeling recursive uncertainty over preferences in decision theory. Classical models of ambiguity allow for uncertainty over outcomes or beliefs but usually rely on finite or exogenously truncated representations when agents face uncertainty about their own evaluative criteria. Given that such recursive preference formation generates an infinite hierarchy that may not stabilize at any finite level, we introduce a contractive von Neumann&amp;amp;ndash;Morgenstern utility functor on a category of compact metric spaces enriched over complete metric spaces, and establish the existence and uniqueness of its canonical fixed point. This fixed point is interpreted as a universal preference space that contains all levels of recursive ambiguity in a consistent and metrically stable form. We further extend the construction to multi-utility representations and discuss its relation to existing models of ambiguity and universal choice spaces. This framework offers a minimal unified representation of recursive preference structures.</p>
	]]></content:encoded>

	<dc:title>Canonical Fixed Points of Recursive Preference Functors: A Categorical Approach to Hierarchies of Ambiguity</dc:title>
			<dc:creator>Stelios Arvanitis</dc:creator>
			<dc:creator>Pantelis Argyropoulos</dc:creator>
			<dc:creator>Spyros Vassilakis</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6040061</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-15</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-15</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>61</prism:startingPage>
		<prism:doi>10.3390/appliedmath6040061</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/4/61</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/4/60">

	<title>AppliedMath, Vol. 6, Pages 60: The New Polynomial Single Parameter Distribution: Properties, Bayesian and Non-Bayesian Inference with Real-Data Applications</title>
	<link>https://www.mdpi.com/2673-9909/6/4/60</link>
	<description>A novel flexible single-parameter polynomial distribution is presented in this study. The forms of hazard rate and density functions are examined. Additionally, exact formulas for a number of numerical characteristics of distributions are obtained. Stochastic ordering, the moment technique, the maximum likelihood, and a Bayesian analysis of this novel distribution based on type II censored data are used to derive the extreme order statistics. We construct Bayes estimators and the associated posterior risks using a variety of loss functions, such as the generalized quadratic, entropy, and Linex functions. Since tractable analytical formulations of these estimators are unattainable, we suggest using a simulation technique based on Markov chain Monte-Carlo (MCMC) to examine their performance. Furthermore, we construct maximum likelihood estimators given initial values for the model&amp;amp;rsquo;s parameters. Additionally, we use integrated mean square error and Pitman&amp;amp;rsquo;s proximity criteria to compare their performance with that of the Bayesian estimators. Lastly, we apply the new family to many real-world datasets to show its versatility, and we model cancer survival data using this new distribution to explain our methodology.</description>
	<pubDate>2026-04-10</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 60: The New Polynomial Single Parameter Distribution: Properties, Bayesian and Non-Bayesian Inference with Real-Data Applications</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/4/60">doi: 10.3390/appliedmath6040060</a></p>
	<p>Authors:
		Meriem Keddali
		Hamida Talhi
		Mohammed Amine Meraou
		Ali Slimani
		</p>
	<p>A novel flexible single-parameter polynomial distribution is presented in this study. The forms of hazard rate and density functions are examined. Additionally, exact formulas for a number of numerical characteristics of distributions are obtained. Stochastic ordering, the moment technique, the maximum likelihood, and a Bayesian analysis of this novel distribution based on type II censored data are used to derive the extreme order statistics. We construct Bayes estimators and the associated posterior risks using a variety of loss functions, such as the generalized quadratic, entropy, and Linex functions. Since tractable analytical formulations of these estimators are unattainable, we suggest using a simulation technique based on Markov chain Monte-Carlo (MCMC) to examine their performance. Furthermore, we construct maximum likelihood estimators given initial values for the model&amp;amp;rsquo;s parameters. Additionally, we use integrated mean square error and Pitman&amp;amp;rsquo;s proximity criteria to compare their performance with that of the Bayesian estimators. Lastly, we apply the new family to many real-world datasets to show its versatility, and we model cancer survival data using this new distribution to explain our methodology.</p>
	]]></content:encoded>

	<dc:title>The New Polynomial Single Parameter Distribution: Properties, Bayesian and Non-Bayesian Inference with Real-Data Applications</dc:title>
			<dc:creator>Meriem Keddali</dc:creator>
			<dc:creator>Hamida Talhi</dc:creator>
			<dc:creator>Mohammed Amine Meraou</dc:creator>
			<dc:creator>Ali Slimani</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6040060</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-10</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-10</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>60</prism:startingPage>
		<prism:doi>10.3390/appliedmath6040060</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/4/60</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/4/59">

	<title>AppliedMath, Vol. 6, Pages 59: Mathematical Model Analysis of Substance Abuse and Hepatitis B Co-Existence with Control Interventions</title>
	<link>https://www.mdpi.com/2673-9909/6/4/59</link>
	<description>Substance abuse addictions and hepatitis B infections are two major public health problems facing humanity globally, especially in areas where the two problems co-exist. A mathematical model was used in this work to study the co-dynamics of substance abuse addictions and hepatitis B infections and investigate their possible control strategies. The mathematical features of the model, such as the disease-free equilibrium, endemic equilibrium, and basic reproduction number, were computed. The stability analysis of the disease-free equilibrium and endemic equilibrium was conducted analytically. The impact of multiple control measures, including public enlightenment, rehabilitation of individuals with substance abuse disorders, treatment of persons infected with hepatitis B, and vaccination of susceptible individuals, was examined numerically. The study reveals how co-existence fundamentally alters system behavior and control effectiveness and offers new insights for designing effective control management strategies.</description>
	<pubDate>2026-04-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 59: Mathematical Model Analysis of Substance Abuse and Hepatitis B Co-Existence with Control Interventions</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/4/59">doi: 10.3390/appliedmath6040059</a></p>
	<p>Authors:
		Obiora Cornelius Collins
		Oludolapo Akanni Olanrewaju
		</p>
	<p>Substance abuse addictions and hepatitis B infections are two major public health problems facing humanity globally, especially in areas where the two problems co-exist. A mathematical model was used in this work to study the co-dynamics of substance abuse addictions and hepatitis B infections and investigate their possible control strategies. The mathematical features of the model, such as the disease-free equilibrium, endemic equilibrium, and basic reproduction number, were computed. The stability analysis of the disease-free equilibrium and endemic equilibrium was conducted analytically. The impact of multiple control measures, including public enlightenment, rehabilitation of individuals with substance abuse disorders, treatment of persons infected with hepatitis B, and vaccination of susceptible individuals, was examined numerically. The study reveals how co-existence fundamentally alters system behavior and control effectiveness and offers new insights for designing effective control management strategies.</p>
	]]></content:encoded>

	<dc:title>Mathematical Model Analysis of Substance Abuse and Hepatitis B Co-Existence with Control Interventions</dc:title>
			<dc:creator>Obiora Cornelius Collins</dc:creator>
			<dc:creator>Oludolapo Akanni Olanrewaju</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6040059</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-09</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-09</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>59</prism:startingPage>
		<prism:doi>10.3390/appliedmath6040059</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/4/59</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/4/58">

	<title>AppliedMath, Vol. 6, Pages 58: A New Algorithm for Finding Initial Basic Feasible Solutions of Transportation Problems</title>
	<link>https://www.mdpi.com/2673-9909/6/4/58</link>
	<description>This study introduces a deterministic fractional-penalty refinement of Vogel&amp;amp;rsquo;s Approximation Method (VAM) for generating high-quality initial basic feasible solutions (IBFS) in classical transportation problems. Unlike the traditional additive regret measure employed in VAM, the proposed method uses a multiplicative contrast ratio between the two smallest admissible costs in each row and column. This modification preserves the allocation structure of VAM while introducing scale-invariant prioritization that improves sensitivity to relative cost differences.The method was evaluated on thirty-four benchmark transportation problems drawn from the literature and self-constructed large-scale instances (up to 10&amp;amp;times;20). Performance was assessed using percentage optimality gaps relative to optimal solutions obtained via the Stepping&amp;amp;ndash;Stone and MODI procedures. Across all instances, the proposed approach achieved a mean optimality gap of 2.78%, compared to 5.22% for classical VAM, 14.97% for the Least Cost Method (LCM), and 45.78% for the Northwest Corner Method (NWCM). Dispersion of deviations was also reduced, indicating improved robustness across heterogeneous cost structures Statistical validation confirms the improvement over VAM: the paired t-test yielded t=&amp;amp;minus;3.17 (p=0.00163, one-sided), and the Wilcoxon signed-rank test produced p=6.10&amp;amp;times;10&amp;amp;minus;5. Computational experiments further show that the refinement does not increase runtime relative to classical IBFS procedures.The proposed method therefore constitutes a structured enhancement of VAM that improves initial solution quality while maintaining computational simplicity.</description>
	<pubDate>2026-04-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 58: A New Algorithm for Finding Initial Basic Feasible Solutions of Transportation Problems</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/4/58">doi: 10.3390/appliedmath6040058</a></p>
	<p>Authors:
		Douglas Kwasi Boah
		Suleman Abudu Fiele
		Christian John Etwire
		</p>
	<p>This study introduces a deterministic fractional-penalty refinement of Vogel&amp;amp;rsquo;s Approximation Method (VAM) for generating high-quality initial basic feasible solutions (IBFS) in classical transportation problems. Unlike the traditional additive regret measure employed in VAM, the proposed method uses a multiplicative contrast ratio between the two smallest admissible costs in each row and column. This modification preserves the allocation structure of VAM while introducing scale-invariant prioritization that improves sensitivity to relative cost differences.The method was evaluated on thirty-four benchmark transportation problems drawn from the literature and self-constructed large-scale instances (up to 10&amp;amp;times;20). Performance was assessed using percentage optimality gaps relative to optimal solutions obtained via the Stepping&amp;amp;ndash;Stone and MODI procedures. Across all instances, the proposed approach achieved a mean optimality gap of 2.78%, compared to 5.22% for classical VAM, 14.97% for the Least Cost Method (LCM), and 45.78% for the Northwest Corner Method (NWCM). Dispersion of deviations was also reduced, indicating improved robustness across heterogeneous cost structures Statistical validation confirms the improvement over VAM: the paired t-test yielded t=&amp;amp;minus;3.17 (p=0.00163, one-sided), and the Wilcoxon signed-rank test produced p=6.10&amp;amp;times;10&amp;amp;minus;5. Computational experiments further show that the refinement does not increase runtime relative to classical IBFS procedures.The proposed method therefore constitutes a structured enhancement of VAM that improves initial solution quality while maintaining computational simplicity.</p>
	]]></content:encoded>

	<dc:title>A New Algorithm for Finding Initial Basic Feasible Solutions of Transportation Problems</dc:title>
			<dc:creator>Douglas Kwasi Boah</dc:creator>
			<dc:creator>Suleman Abudu Fiele</dc:creator>
			<dc:creator>Christian John Etwire</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6040058</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-09</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-09</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>58</prism:startingPage>
		<prism:doi>10.3390/appliedmath6040058</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/4/58</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/4/57">

	<title>AppliedMath, Vol. 6, Pages 57: Interconnections Between Financial Markets and Crypto-Asset Markets</title>
	<link>https://www.mdpi.com/2673-9909/6/4/57</link>
	<description>Crypto-asset markets have been rapidly evolving during the past years, being under the spotlight of a diverse set of actors in the financial ecosystem, including investors, financial institutions, regulators and academics. Their potential interconnections with the traditional financial markets are important, and identifying them can provide useful insight in a diversity of areas such as risk contagion and mitigation, price formation, portfolio management and regulatory framework design. In order to identify such interconnections, various lines of research are followed. Specifically, the correlation between prominent stock market indices and crypto-assets from 2018 to 2025 is examined, while their volatility is also evaluated. Furthermore, the relevant effect of news, events and announcements is explored. The results are based on both daily and high-frequency datasets, with the use of the latter focusing on intra-day variation. The analysis of the results identifies existing interconnections between 2020 and 2025, as well as the important respective impact of news and announcements. An additional generic outcome is the usefulness of high-frequency datasets in the crypto-asset context. The conclusions are useful for all actors in the financial ecosystem. Future work can focus on the extension of the research to additional markets or crypto-assets.</description>
	<pubDate>2026-04-08</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 57: Interconnections Between Financial Markets and Crypto-Asset Markets</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/4/57">doi: 10.3390/appliedmath6040057</a></p>
	<p>Authors:
		Senne Aerts
		Eleonora Iachini
		Urszula Kochanska
		Eleni Koutrouli
		Polychronis Manousopoulos
		</p>
	<p>Crypto-asset markets have been rapidly evolving during the past years, being under the spotlight of a diverse set of actors in the financial ecosystem, including investors, financial institutions, regulators and academics. Their potential interconnections with the traditional financial markets are important, and identifying them can provide useful insight in a diversity of areas such as risk contagion and mitigation, price formation, portfolio management and regulatory framework design. In order to identify such interconnections, various lines of research are followed. Specifically, the correlation between prominent stock market indices and crypto-assets from 2018 to 2025 is examined, while their volatility is also evaluated. Furthermore, the relevant effect of news, events and announcements is explored. The results are based on both daily and high-frequency datasets, with the use of the latter focusing on intra-day variation. The analysis of the results identifies existing interconnections between 2020 and 2025, as well as the important respective impact of news and announcements. An additional generic outcome is the usefulness of high-frequency datasets in the crypto-asset context. The conclusions are useful for all actors in the financial ecosystem. Future work can focus on the extension of the research to additional markets or crypto-assets.</p>
	]]></content:encoded>

	<dc:title>Interconnections Between Financial Markets and Crypto-Asset Markets</dc:title>
			<dc:creator>Senne Aerts</dc:creator>
			<dc:creator>Eleonora Iachini</dc:creator>
			<dc:creator>Urszula Kochanska</dc:creator>
			<dc:creator>Eleni Koutrouli</dc:creator>
			<dc:creator>Polychronis Manousopoulos</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6040057</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-08</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-08</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>57</prism:startingPage>
		<prism:doi>10.3390/appliedmath6040057</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/4/57</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/4/56">

	<title>AppliedMath, Vol. 6, Pages 56: An Exponential Correction to Ramanujan&amp;rsquo;s Second Formula for Ellipse Perimeter Computation</title>
	<link>https://www.mdpi.com/2673-9909/6/4/56</link>
	<description>The exact perimeter of an ellipse involves the complete elliptic integral of the second kind, which lacks a closed-form expression in elementary functions. As a result, analytical approximations have been proposed for applications requiring fast and accurate evaluation of elliptical geometries. In this study, we present a new ultra-accurate and compact closed-form approximation for the ellipse perimeter based on an exponential correction applied to Ramanujan&amp;amp;rsquo;s second formula. The proposed expression preserves simplicity&amp;amp;mdash;using only three exponential functions and six constants&amp;amp;mdash;while achieving a maximum relative error of approximately 0.57 ppm observed over the tested grids covering the full eccentricity range. This represents a significant accuracy improvement over classical and modern approximations while maintaining a single-line analytical form with low computational cost. Due to its robustness, quasi-exact behavior at both circular and highly eccentric limits, and its suitability for numerical algorithms and embedded implementations, the proposed approximation is particularly useful in engineering computations involving elliptical boundaries.</description>
	<pubDate>2026-04-03</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 56: An Exponential Correction to Ramanujan&amp;rsquo;s Second Formula for Ellipse Perimeter Computation</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/4/56">doi: 10.3390/appliedmath6040056</a></p>
	<p>Authors:
		Salvador E. Ayala-Raggi
		Manuel Rendón-Marín
		</p>
	<p>The exact perimeter of an ellipse involves the complete elliptic integral of the second kind, which lacks a closed-form expression in elementary functions. As a result, analytical approximations have been proposed for applications requiring fast and accurate evaluation of elliptical geometries. In this study, we present a new ultra-accurate and compact closed-form approximation for the ellipse perimeter based on an exponential correction applied to Ramanujan&amp;amp;rsquo;s second formula. The proposed expression preserves simplicity&amp;amp;mdash;using only three exponential functions and six constants&amp;amp;mdash;while achieving a maximum relative error of approximately 0.57 ppm observed over the tested grids covering the full eccentricity range. This represents a significant accuracy improvement over classical and modern approximations while maintaining a single-line analytical form with low computational cost. Due to its robustness, quasi-exact behavior at both circular and highly eccentric limits, and its suitability for numerical algorithms and embedded implementations, the proposed approximation is particularly useful in engineering computations involving elliptical boundaries.</p>
	]]></content:encoded>

	<dc:title>An Exponential Correction to Ramanujan&amp;amp;rsquo;s Second Formula for Ellipse Perimeter Computation</dc:title>
			<dc:creator>Salvador E. Ayala-Raggi</dc:creator>
			<dc:creator>Manuel Rendón-Marín</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6040056</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-03</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-03</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>56</prism:startingPage>
		<prism:doi>10.3390/appliedmath6040056</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/4/56</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/4/55">

	<title>AppliedMath, Vol. 6, Pages 55: Bayesian Chance-Constrained Planning Under Limited Sampling for Sectional Warping</title>
	<link>https://www.mdpi.com/2673-9909/6/4/55</link>
	<description>Sectional warping requires selecting a final operating length when only a small sample of residual cone masses can be measured. This paper proposes a Bayesian chance-constrained planning rule that combines a conjugate log-space model with fast posterior predictive simulation of the population minimum to recommend a risk-limited band length. The method provides a transparent risk parameter, efficient computation, and direct comparison with heuristic, bootstrap, distribution-free, and tail-model baselines. In an industrial-like synthetic study, the Bayesian policy reduced the mean remainder relative to a tuned sample-minimum rule while maintaining controlled shortage risk, and the results clarify why fully distribution-free guarantees are impractical under typical sampling budgets.</description>
	<pubDate>2026-04-02</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 55: Bayesian Chance-Constrained Planning Under Limited Sampling for Sectional Warping</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/4/55">doi: 10.3390/appliedmath6040055</a></p>
	<p>Authors:
		Daniel López-Rodríguez
		Jorge Jordán-Núñez
		Bàrbara Micó-Vicent
		Antonio Belda
		</p>
	<p>Sectional warping requires selecting a final operating length when only a small sample of residual cone masses can be measured. This paper proposes a Bayesian chance-constrained planning rule that combines a conjugate log-space model with fast posterior predictive simulation of the population minimum to recommend a risk-limited band length. The method provides a transparent risk parameter, efficient computation, and direct comparison with heuristic, bootstrap, distribution-free, and tail-model baselines. In an industrial-like synthetic study, the Bayesian policy reduced the mean remainder relative to a tuned sample-minimum rule while maintaining controlled shortage risk, and the results clarify why fully distribution-free guarantees are impractical under typical sampling budgets.</p>
	]]></content:encoded>

	<dc:title>Bayesian Chance-Constrained Planning Under Limited Sampling for Sectional Warping</dc:title>
			<dc:creator>Daniel López-Rodríguez</dc:creator>
			<dc:creator>Jorge Jordán-Núñez</dc:creator>
			<dc:creator>Bàrbara Micó-Vicent</dc:creator>
			<dc:creator>Antonio Belda</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6040055</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-02</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-02</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>55</prism:startingPage>
		<prism:doi>10.3390/appliedmath6040055</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/4/55</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/4/54">

	<title>AppliedMath, Vol. 6, Pages 54: High-Order Spectral Scheme with Structure Maintenance and Fast Memory Algorithm for Nonlocal Nonlinear Diffusion Equations</title>
	<link>https://www.mdpi.com/2673-9909/6/4/54</link>
	<description>We develop a fast numerical method for solving nonlinear diffusion equations with memory phenomena, a class of problems arising within viscoelastic materials, anomalous transport, and hereditary systems. The primary computational problem is the nonlocal temporal dependence captured by Volterra-type memory operators, which makes direct evaluation scale quadratically with the number of time steps (O(Nt2)), rendering prolonged simulations prohibitively expensive. To address this bottleneck, we develop a novel synthesis that combines a high-order spectral method for spatial discretization with a fast memory algorithm based on a sum-of-exponentials approximation. The spectral method obtains exponential spatial convergence for smooth solutions. At the same time, the fast memory algorithm reduces memory usage and computational complexity to O(Nt), yielding computational speedups exceeding 414x for prolonged simulations. We rigorously prove that the proposed scheme preserves the discrete energy dissipation law of the continuous system under mild assumptions on the memory kernel, thereby ensuring unconditional stability. Error analysis verifies spectral accuracy in space and first-order temporal convergence. Extensive numerical experiments using exponentially decaying and weakly singular kernels validate the theoretical results and illustrate the method&amp;amp;rsquo;s effectiveness for modeling viscoelastic transport phenomena and irregular diffusion in complex systems.</description>
	<pubDate>2026-04-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 54: High-Order Spectral Scheme with Structure Maintenance and Fast Memory Algorithm for Nonlocal Nonlinear Diffusion Equations</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/4/54">doi: 10.3390/appliedmath6040054</a></p>
	<p>Authors:
		Kadrzhan Shiyapov
		Zhanars Abdiramanov
		Zhuldyz Issa
		Aruzhan Zhumaseyitova
		</p>
	<p>We develop a fast numerical method for solving nonlinear diffusion equations with memory phenomena, a class of problems arising within viscoelastic materials, anomalous transport, and hereditary systems. The primary computational problem is the nonlocal temporal dependence captured by Volterra-type memory operators, which makes direct evaluation scale quadratically with the number of time steps (O(Nt2)), rendering prolonged simulations prohibitively expensive. To address this bottleneck, we develop a novel synthesis that combines a high-order spectral method for spatial discretization with a fast memory algorithm based on a sum-of-exponentials approximation. The spectral method obtains exponential spatial convergence for smooth solutions. At the same time, the fast memory algorithm reduces memory usage and computational complexity to O(Nt), yielding computational speedups exceeding 414x for prolonged simulations. We rigorously prove that the proposed scheme preserves the discrete energy dissipation law of the continuous system under mild assumptions on the memory kernel, thereby ensuring unconditional stability. Error analysis verifies spectral accuracy in space and first-order temporal convergence. Extensive numerical experiments using exponentially decaying and weakly singular kernels validate the theoretical results and illustrate the method&amp;amp;rsquo;s effectiveness for modeling viscoelastic transport phenomena and irregular diffusion in complex systems.</p>
	]]></content:encoded>

	<dc:title>High-Order Spectral Scheme with Structure Maintenance and Fast Memory Algorithm for Nonlocal Nonlinear Diffusion Equations</dc:title>
			<dc:creator>Kadrzhan Shiyapov</dc:creator>
			<dc:creator>Zhanars Abdiramanov</dc:creator>
			<dc:creator>Zhuldyz Issa</dc:creator>
			<dc:creator>Aruzhan Zhumaseyitova</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6040054</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-01</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-01</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>54</prism:startingPage>
		<prism:doi>10.3390/appliedmath6040054</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/4/54</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/4/53">

	<title>AppliedMath, Vol. 6, Pages 53: Spectral Models for Subsidy Allocation in Industrial Systems</title>
	<link>https://www.mdpi.com/2673-9909/6/4/53</link>
	<description>This paper studies subsidy allocation in interconnected industrial systems using the spectral theory of positive matrices. The allocation is characterized by the Perron eigenvector of a cost matrix describing inter-factory interactions. We show that convergence to equilibrium is exponential and governed by the spectral ratio. A systemic resilience index based on spectral separation is introduced to quantify both stability and robustness under perturbations. The results demonstrate that stability and fairness arise from the spectral structure of the system.</description>
	<pubDate>2026-04-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 53: Spectral Models for Subsidy Allocation in Industrial Systems</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/4/53">doi: 10.3390/appliedmath6040053</a></p>
	<p>Authors:
		Gorenc Mateja
		</p>
	<p>This paper studies subsidy allocation in interconnected industrial systems using the spectral theory of positive matrices. The allocation is characterized by the Perron eigenvector of a cost matrix describing inter-factory interactions. We show that convergence to equilibrium is exponential and governed by the spectral ratio. A systemic resilience index based on spectral separation is introduced to quantify both stability and robustness under perturbations. The results demonstrate that stability and fairness arise from the spectral structure of the system.</p>
	]]></content:encoded>

	<dc:title>Spectral Models for Subsidy Allocation in Industrial Systems</dc:title>
			<dc:creator>Gorenc Mateja</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6040053</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-04-01</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-04-01</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>53</prism:startingPage>
		<prism:doi>10.3390/appliedmath6040053</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/4/53</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/4/52">

	<title>AppliedMath, Vol. 6, Pages 52: Generalized B-Curvature Tensor in Lorentzian Para-Kenmotsu Manifold with Semi-Symmetric Metric Connection</title>
	<link>https://www.mdpi.com/2673-9909/6/4/52</link>
	<description>The main object of this work is to study the generalized B-curvature tensor in an n-dimensional Lorentzian para-Kenmotsu (briefly, (LPK)n) manifold along a semi-symmetric metric connection &amp;amp;nabla;&amp;amp;macr;. First, in an (LPK)n-manifold, we explore certain flatness conditions, namely, B&amp;amp;macr;(Y,Z)X=0, B&amp;amp;macr;(Y,Z)&amp;amp;zeta;=0, g(B&amp;amp;macr;(&amp;amp;phi;Y,&amp;amp;phi;Z)&amp;amp;phi;X,&amp;amp;phi;W)=0, and B&amp;amp;macr;(Y,Z)&amp;amp;middot;&amp;amp;phi;=0 conditions, which all result in an &amp;amp;eta;-Einstein manifold. Furthermore, in an (LPK)n-manifold, we study the curvature conditions B&amp;amp;macr;.Q=0 and B&amp;amp;macr;.Q&amp;amp;macr; = 0, which provide the scalar curvature. The generalized B-curvature tensor blends the features of different curvature tensors, allowing researchers to study conditions like semi-symmetry, pseudo-symmetry in a unified framework. Conditions like B-semi-symmetry correspond to conservation laws or stability properties in physical systems.</description>
	<pubDate>2026-03-24</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 52: Generalized B-Curvature Tensor in Lorentzian Para-Kenmotsu Manifold with Semi-Symmetric Metric Connection</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/4/52">doi: 10.3390/appliedmath6040052</a></p>
	<p>Authors:
		Rajendra Prasad
		Najwa Mohammed Al-Asmari
		Abdul Haseeb
		Sushmita Sen
		</p>
	<p>The main object of this work is to study the generalized B-curvature tensor in an n-dimensional Lorentzian para-Kenmotsu (briefly, (LPK)n) manifold along a semi-symmetric metric connection &amp;amp;nabla;&amp;amp;macr;. First, in an (LPK)n-manifold, we explore certain flatness conditions, namely, B&amp;amp;macr;(Y,Z)X=0, B&amp;amp;macr;(Y,Z)&amp;amp;zeta;=0, g(B&amp;amp;macr;(&amp;amp;phi;Y,&amp;amp;phi;Z)&amp;amp;phi;X,&amp;amp;phi;W)=0, and B&amp;amp;macr;(Y,Z)&amp;amp;middot;&amp;amp;phi;=0 conditions, which all result in an &amp;amp;eta;-Einstein manifold. Furthermore, in an (LPK)n-manifold, we study the curvature conditions B&amp;amp;macr;.Q=0 and B&amp;amp;macr;.Q&amp;amp;macr; = 0, which provide the scalar curvature. The generalized B-curvature tensor blends the features of different curvature tensors, allowing researchers to study conditions like semi-symmetry, pseudo-symmetry in a unified framework. Conditions like B-semi-symmetry correspond to conservation laws or stability properties in physical systems.</p>
	]]></content:encoded>

	<dc:title>Generalized B-Curvature Tensor in Lorentzian Para-Kenmotsu Manifold with Semi-Symmetric Metric Connection</dc:title>
			<dc:creator>Rajendra Prasad</dc:creator>
			<dc:creator>Najwa Mohammed Al-Asmari</dc:creator>
			<dc:creator>Abdul Haseeb</dc:creator>
			<dc:creator>Sushmita Sen</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6040052</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-24</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-24</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>52</prism:startingPage>
		<prism:doi>10.3390/appliedmath6040052</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/4/52</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/51">

	<title>AppliedMath, Vol. 6, Pages 51: Feedback Control Design for Time-Delay Systems Based on the Manabe Polynomial Concept Under Unmodeled Input Delay</title>
	<link>https://www.mdpi.com/2673-9909/6/3/51</link>
	<description>Time delays are inherent in modern motion-control and electric-drive loops due to sensing, filtering, sampling and computation, communication, and actuation scheduling. When such delays are only partially known, they can markedly reduce stability margins and narrow the admissible range of state-feedback gains, especially in high-bandwidth servo applications. This paper develops a design-oriented state-feedback framework for delay-affected plants based on the Manabe polynomial concept and the Coefficient Diagram Method (CDM). The plant is represented as a chain of integrators of order two to four with an effective input gain, and the feedback gain is synthesized for the nominal delay-free model by matching a standard Manabe/CDM characteristic polynomial using the classical CDM stability-index pattern. When an unmodeled input delay is present, the closed loop is governed by a delay-dependent characteristic equation. By introducing a normalized representation, the analysis yields explicit delay-stability limits that directly translate into a lower bound on the equivalent time constant used for tuning. The degradation of the phase margin and gain margin with increasing normalized delay is quantified as design charts, and a simple phase-margin-based inequality is proposed for selecting the tuning time constant, with gain-margin checks recommended as a verification step.</description>
	<pubDate>2026-03-19</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 51: Feedback Control Design for Time-Delay Systems Based on the Manabe Polynomial Concept Under Unmodeled Input Delay</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/51">doi: 10.3390/appliedmath6030051</a></p>
	<p>Authors:
		Stefan Brock
		</p>
	<p>Time delays are inherent in modern motion-control and electric-drive loops due to sensing, filtering, sampling and computation, communication, and actuation scheduling. When such delays are only partially known, they can markedly reduce stability margins and narrow the admissible range of state-feedback gains, especially in high-bandwidth servo applications. This paper develops a design-oriented state-feedback framework for delay-affected plants based on the Manabe polynomial concept and the Coefficient Diagram Method (CDM). The plant is represented as a chain of integrators of order two to four with an effective input gain, and the feedback gain is synthesized for the nominal delay-free model by matching a standard Manabe/CDM characteristic polynomial using the classical CDM stability-index pattern. When an unmodeled input delay is present, the closed loop is governed by a delay-dependent characteristic equation. By introducing a normalized representation, the analysis yields explicit delay-stability limits that directly translate into a lower bound on the equivalent time constant used for tuning. The degradation of the phase margin and gain margin with increasing normalized delay is quantified as design charts, and a simple phase-margin-based inequality is proposed for selecting the tuning time constant, with gain-margin checks recommended as a verification step.</p>
	]]></content:encoded>

	<dc:title>Feedback Control Design for Time-Delay Systems Based on the Manabe Polynomial Concept Under Unmodeled Input Delay</dc:title>
			<dc:creator>Stefan Brock</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030051</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-19</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-19</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>51</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030051</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/51</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/50">

	<title>AppliedMath, Vol. 6, Pages 50: Generalized Almost Schouten Solitons in LP-Sasakian Geometry and Relativistic Spacetimes</title>
	<link>https://www.mdpi.com/2673-9909/6/3/50</link>
	<description>The objective of this work is to characterize certain geometric aspects of LP-Sasakian (LPS) manifolds admitting a generalized almost Schouten soliton (GASS) and to prove that a such manifold with GASS is of constant scalar curvature. Initially, we examine the solitonic behavior of &amp;amp;#981;-recurrent LPS manifolds with GASS in view of certain curvature conditions. Moreover, we also deliberate the geometric properties of a perfect fluid LPS spacetime with a unit torse-forming vector field (UTVF) in connection with a GASS. Also, the behavior of a GASS is studied in the broader framework of special types of perfect fluid LPS spacetime such as dust fluid, dark fluid, and radiation era. Overall, the main novelty of this work is its study of the geometrical phenomena and characteristics of a GASS on LPS manifolds and their application in a perfect fluid LPS spacetime.</description>
	<pubDate>2026-03-19</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 50: Generalized Almost Schouten Solitons in LP-Sasakian Geometry and Relativistic Spacetimes</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/50">doi: 10.3390/appliedmath6030050</a></p>
	<p>Authors:
		Sunil Kumar Yadav
		Najwa Mohammed Al-Asmari
		Abdul Haseeb
		</p>
	<p>The objective of this work is to characterize certain geometric aspects of LP-Sasakian (LPS) manifolds admitting a generalized almost Schouten soliton (GASS) and to prove that a such manifold with GASS is of constant scalar curvature. Initially, we examine the solitonic behavior of &amp;amp;#981;-recurrent LPS manifolds with GASS in view of certain curvature conditions. Moreover, we also deliberate the geometric properties of a perfect fluid LPS spacetime with a unit torse-forming vector field (UTVF) in connection with a GASS. Also, the behavior of a GASS is studied in the broader framework of special types of perfect fluid LPS spacetime such as dust fluid, dark fluid, and radiation era. Overall, the main novelty of this work is its study of the geometrical phenomena and characteristics of a GASS on LPS manifolds and their application in a perfect fluid LPS spacetime.</p>
	]]></content:encoded>

	<dc:title>Generalized Almost Schouten Solitons in LP-Sasakian Geometry and Relativistic Spacetimes</dc:title>
			<dc:creator>Sunil Kumar Yadav</dc:creator>
			<dc:creator>Najwa Mohammed Al-Asmari</dc:creator>
			<dc:creator>Abdul Haseeb</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030050</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-19</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-19</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>50</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030050</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/50</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/49">

	<title>AppliedMath, Vol. 6, Pages 49: Parameterized Multimodal Feature Fusion for Explainable Seizure Detection Using PCA and SHAP</title>
	<link>https://www.mdpi.com/2673-9909/6/3/49</link>
	<description>Multimodal epileptic seizure detection using physiological biosignals remains challenging due to signal noise, inter-subject variability, weak cross-modal alignment, and the limited interpretability of many machine learning models. To address these challenges, this study proposes a parameterized multimodal feature-fusion framework that unifies normalization, modality weighting, and nonlinear cross-modal interaction within a single mathematical representation. Four fusion parameters, the fusion exponent &amp;amp;rho;, interaction weight (&amp;amp;delta;), normalization factor (&amp;amp;lambda;), and the cross-modal interaction term (&amp;amp;eta;), are introduced at the feature-fusion level, while all classifiers retain their original learning mechanisms. The framework is evaluated using synchronized EEG, ECG, EMG, and accelerometer signals from 120 subjects, segmented into 2 s windows at 512 Hz and analyzed using twelve classical and deep learning classifiers. Principal Component Analysis (PCA) applied to the fused feature space reveals improved class separability compared to unimodal representations, with EEG exhibiting the strongest intrinsic discrimination and peripheral modalities contributing complementary structure when fused. SHapley Additive exPlanations (SHAP) further identify entropy as the most influential feature across all modalities, followed by RMS and energy, yielding physiologically coherent attributions. Quantitative performance evaluation and ablation analysis confirm that the observed improvements arise from the proposed representation design rather than classifier-specific modifications. Unlike existing architecture-dependent fusion strategies, the proposed method introduces a mathematically parameterized feature-space formulation that enhances separability and interpretability without modifying classifier architectures, thereby establishing a representation-driven paradigm for explainable multimodal seizure detection. These results demonstrate that mathematically principled feature-space modeling can simultaneously enhance predictive performance and interpretability, providing a transparent and robust foundation for explainable multimodal seizure detection.</description>
	<pubDate>2026-03-18</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 49: Parameterized Multimodal Feature Fusion for Explainable Seizure Detection Using PCA and SHAP</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/49">doi: 10.3390/appliedmath6030049</a></p>
	<p>Authors:
		Abdul-Mumin Khalid
		Musah Sulemana
		Wahab Abdul Iddrisu
		</p>
	<p>Multimodal epileptic seizure detection using physiological biosignals remains challenging due to signal noise, inter-subject variability, weak cross-modal alignment, and the limited interpretability of many machine learning models. To address these challenges, this study proposes a parameterized multimodal feature-fusion framework that unifies normalization, modality weighting, and nonlinear cross-modal interaction within a single mathematical representation. Four fusion parameters, the fusion exponent &amp;amp;rho;, interaction weight (&amp;amp;delta;), normalization factor (&amp;amp;lambda;), and the cross-modal interaction term (&amp;amp;eta;), are introduced at the feature-fusion level, while all classifiers retain their original learning mechanisms. The framework is evaluated using synchronized EEG, ECG, EMG, and accelerometer signals from 120 subjects, segmented into 2 s windows at 512 Hz and analyzed using twelve classical and deep learning classifiers. Principal Component Analysis (PCA) applied to the fused feature space reveals improved class separability compared to unimodal representations, with EEG exhibiting the strongest intrinsic discrimination and peripheral modalities contributing complementary structure when fused. SHapley Additive exPlanations (SHAP) further identify entropy as the most influential feature across all modalities, followed by RMS and energy, yielding physiologically coherent attributions. Quantitative performance evaluation and ablation analysis confirm that the observed improvements arise from the proposed representation design rather than classifier-specific modifications. Unlike existing architecture-dependent fusion strategies, the proposed method introduces a mathematically parameterized feature-space formulation that enhances separability and interpretability without modifying classifier architectures, thereby establishing a representation-driven paradigm for explainable multimodal seizure detection. These results demonstrate that mathematically principled feature-space modeling can simultaneously enhance predictive performance and interpretability, providing a transparent and robust foundation for explainable multimodal seizure detection.</p>
	]]></content:encoded>

	<dc:title>Parameterized Multimodal Feature Fusion for Explainable Seizure Detection Using PCA and SHAP</dc:title>
			<dc:creator>Abdul-Mumin Khalid</dc:creator>
			<dc:creator>Musah Sulemana</dc:creator>
			<dc:creator>Wahab Abdul Iddrisu</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030049</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-18</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-18</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>49</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030049</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/49</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/48">

	<title>AppliedMath, Vol. 6, Pages 48: A Mathematical Framework for Four-Dimensional Chess: Extending Game Mechanics Through Higher-Dimensional Geometry</title>
	<link>https://www.mdpi.com/2673-9909/6/3/48</link>
	<description>This paper develops a rigorous mathematical and computational framework for four-dimensional chess defined on the discrete hypercubic lattice {1,&amp;amp;hellip;,&amp;amp;nbsp;8}4. We formalize piece movement using displacement sets in Z4, define adjacency via the Chebyshev metric, and analyze the resulting move graphs for rooks, bishops, knights, queens, and kings. We establish exact mobility formulas, parity invariants, and connectivity properties, consolidating known product-graph results for rooks and kings while introducing a boundary-sensitive analysis of the four-dimensional knight verified by exhaustive enumeration. The mathematical framework is complemented by a fully implemented 4D chess engine and interactive visualization environment rendering all 64 (z,w)-slices of the hypercube simultaneously. The system supports full move legality, generalized special rules, multi-king checkmate detection, and reproducible state enumeration. Performance measurements and exploratory branching-factor estimates are obtained through reproducible random playouts using the publicly available implementation. We contextualize this ruleset within existing work on move graphs on Znm, higher-dimensional leapers, spectral properties of grid graphs, toroidal analogs, and multidimensional visualization. Exploratory qualitative feedback (N = 18) is included to examine whether the visualization design is interpretable and navigable in practice, providing feasibility-oriented observations on how slice-based 4D projection and layered board rendering are perceived by non-expert users in an exploratory context. Together, the mathematical results, implemented engine, and visualization form a coherent foundation for the study of strategy, complexity, and human interaction in four-dimensional game systems. The framework provides a basis for future investigations into spectral analysis of move graphs, symmetry-aware search, hierarchical planning, and educational applications in high-dimensional geometry.</description>
	<pubDate>2026-03-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 48: A Mathematical Framework for Four-Dimensional Chess: Extending Game Mechanics Through Higher-Dimensional Geometry</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/48">doi: 10.3390/appliedmath6030048</a></p>
	<p>Authors:
		Rinaldi (Unciuleanu) Oana
		Costin-Gabriel Chiru
		</p>
	<p>This paper develops a rigorous mathematical and computational framework for four-dimensional chess defined on the discrete hypercubic lattice {1,&amp;amp;hellip;,&amp;amp;nbsp;8}4. We formalize piece movement using displacement sets in Z4, define adjacency via the Chebyshev metric, and analyze the resulting move graphs for rooks, bishops, knights, queens, and kings. We establish exact mobility formulas, parity invariants, and connectivity properties, consolidating known product-graph results for rooks and kings while introducing a boundary-sensitive analysis of the four-dimensional knight verified by exhaustive enumeration. The mathematical framework is complemented by a fully implemented 4D chess engine and interactive visualization environment rendering all 64 (z,w)-slices of the hypercube simultaneously. The system supports full move legality, generalized special rules, multi-king checkmate detection, and reproducible state enumeration. Performance measurements and exploratory branching-factor estimates are obtained through reproducible random playouts using the publicly available implementation. We contextualize this ruleset within existing work on move graphs on Znm, higher-dimensional leapers, spectral properties of grid graphs, toroidal analogs, and multidimensional visualization. Exploratory qualitative feedback (N = 18) is included to examine whether the visualization design is interpretable and navigable in practice, providing feasibility-oriented observations on how slice-based 4D projection and layered board rendering are perceived by non-expert users in an exploratory context. Together, the mathematical results, implemented engine, and visualization form a coherent foundation for the study of strategy, complexity, and human interaction in four-dimensional game systems. The framework provides a basis for future investigations into spectral analysis of move graphs, symmetry-aware search, hierarchical planning, and educational applications in high-dimensional geometry.</p>
	]]></content:encoded>

	<dc:title>A Mathematical Framework for Four-Dimensional Chess: Extending Game Mechanics Through Higher-Dimensional Geometry</dc:title>
			<dc:creator>Rinaldi (Unciuleanu) Oana</dc:creator>
			<dc:creator>Costin-Gabriel Chiru</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030048</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-17</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-17</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>48</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030048</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/48</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/47">

	<title>AppliedMath, Vol. 6, Pages 47: Efficient Parameter Estimation for Oscillatory Biochemical Reaction Networks via a Genetic Algorithm with Adaptive Simulation Termination</title>
	<link>https://www.mdpi.com/2673-9909/6/3/47</link>
	<description>Parameter estimation for biochemical reaction networks is computationally demanding, especially for systems with oscillatory nonlinear dynamics, where standard iterative optimization strategies, including genetic algorithms, often struggle with prohibitive computational costs. We introduce an efficient parameter estimation framework that combines a real-coded genetic algorithm with a novel adaptive simulation termination strategy. This strategy defines a time-dependent termination boundary based on population quantiles, which is permissive during early transients and becomes progressively stricter as simulations advance, explicitly accounting for the temporal structure of oscillatory behavior. Crucially, this mechanism facilitates the efficient identification and early simulation termination of poor parameter candidates, thus avoiding the computational expense of full-horizon simulations. The framework further integrates global exploration with the modified Powell method for rapid local refinement. Numerical experiments on two benchmark oscillatory models&amp;amp;mdash;the Lotka&amp;amp;ndash;Volterra and Goodwin oscillators&amp;amp;mdash;demonstrate that the framework reduces computational cost by approximately 30&amp;amp;ndash;50% compared to a baseline GA without this strategy. For the parameter-sensitive Goodwin model, the framework efficiently identifies candidates evolving toward damped oscillations caused by subtle parameter variations. Sensitivity analysis also confirms robustness across diverse hyperparameter settings, indicating that adaptive simulation termination provides a practical acceleration mechanism for inverse problems in systems biology where iterative objective function evaluation dominates runtime.</description>
	<pubDate>2026-03-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 47: Efficient Parameter Estimation for Oscillatory Biochemical Reaction Networks via a Genetic Algorithm with Adaptive Simulation Termination</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/47">doi: 10.3390/appliedmath6030047</a></p>
	<p>Authors:
		Tatsuya Sekiguchi
		Hiroyuki Hamada
		Masahiro Okamoto
		</p>
	<p>Parameter estimation for biochemical reaction networks is computationally demanding, especially for systems with oscillatory nonlinear dynamics, where standard iterative optimization strategies, including genetic algorithms, often struggle with prohibitive computational costs. We introduce an efficient parameter estimation framework that combines a real-coded genetic algorithm with a novel adaptive simulation termination strategy. This strategy defines a time-dependent termination boundary based on population quantiles, which is permissive during early transients and becomes progressively stricter as simulations advance, explicitly accounting for the temporal structure of oscillatory behavior. Crucially, this mechanism facilitates the efficient identification and early simulation termination of poor parameter candidates, thus avoiding the computational expense of full-horizon simulations. The framework further integrates global exploration with the modified Powell method for rapid local refinement. Numerical experiments on two benchmark oscillatory models&amp;amp;mdash;the Lotka&amp;amp;ndash;Volterra and Goodwin oscillators&amp;amp;mdash;demonstrate that the framework reduces computational cost by approximately 30&amp;amp;ndash;50% compared to a baseline GA without this strategy. For the parameter-sensitive Goodwin model, the framework efficiently identifies candidates evolving toward damped oscillations caused by subtle parameter variations. Sensitivity analysis also confirms robustness across diverse hyperparameter settings, indicating that adaptive simulation termination provides a practical acceleration mechanism for inverse problems in systems biology where iterative objective function evaluation dominates runtime.</p>
	]]></content:encoded>

	<dc:title>Efficient Parameter Estimation for Oscillatory Biochemical Reaction Networks via a Genetic Algorithm with Adaptive Simulation Termination</dc:title>
			<dc:creator>Tatsuya Sekiguchi</dc:creator>
			<dc:creator>Hiroyuki Hamada</dc:creator>
			<dc:creator>Masahiro Okamoto</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030047</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-16</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-16</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>47</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030047</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/47</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/46">

	<title>AppliedMath, Vol. 6, Pages 46: Nighttime Validation and Local Sensitivity of a Reduced-Order Thermal Balance for Above-Ground Outdoor Pools</title>
	<link>https://www.mdpi.com/2673-9909/6/3/46</link>
	<description>The paper presents a mathematical validation and a local sensitivity analysis of a reduced-order thermal balance model designed to predict nighttime heat losses from an above-ground outdoor pool. The model expresses the total heat flux as a linear function of the water&amp;amp;ndash;air temperature difference through an effective overall heat-transfer coefficient aggregating convective, evaporative, and radiative mechanisms, as well as cover-related effects. The analysis is explicitly restricted to quasi-steady nighttime conditions. Field data were segmented into 13 independent nighttime realizations (&amp;amp;#8710;T &amp;amp;asymp; 5.5&amp;amp;ndash;26.9 &amp;amp;deg;C, wind &amp;amp;asymp; 0.00&amp;amp;ndash;1.32 m&amp;amp;#8729;s&amp;amp;minus;1). Across the entire dataset, the model achieved a mean relative error of 0.39% and a maximum absolute deviation of 3.72%, with no monotonic error growth versus &amp;amp;#8710;T or wind speed. Normalized local sensitivities reveal that the convective (hc) and evaporative (he) components dominate the response, whereas the radiative contribution is smaller under typical nighttime boundaries; the cover-permeability factor gains influence as wind speed increases. The additive structure limits independent identifiability of individual mechanisms, supporting an interpretation in terms of effective parameters. The results delineate the domain where the reduced-order formulation is predictive without refitting and provide a compact, interpretable reference for analyzing energy-balance models of open-water systems under nighttime operation.</description>
	<pubDate>2026-03-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 46: Nighttime Validation and Local Sensitivity of a Reduced-Order Thermal Balance for Above-Ground Outdoor Pools</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/46">doi: 10.3390/appliedmath6030046</a></p>
	<p>Authors:
		Seweryn Lipiński
		Łukasz Dziubiński
		Paweł Chwietczuk
		</p>
	<p>The paper presents a mathematical validation and a local sensitivity analysis of a reduced-order thermal balance model designed to predict nighttime heat losses from an above-ground outdoor pool. The model expresses the total heat flux as a linear function of the water&amp;amp;ndash;air temperature difference through an effective overall heat-transfer coefficient aggregating convective, evaporative, and radiative mechanisms, as well as cover-related effects. The analysis is explicitly restricted to quasi-steady nighttime conditions. Field data were segmented into 13 independent nighttime realizations (&amp;amp;#8710;T &amp;amp;asymp; 5.5&amp;amp;ndash;26.9 &amp;amp;deg;C, wind &amp;amp;asymp; 0.00&amp;amp;ndash;1.32 m&amp;amp;#8729;s&amp;amp;minus;1). Across the entire dataset, the model achieved a mean relative error of 0.39% and a maximum absolute deviation of 3.72%, with no monotonic error growth versus &amp;amp;#8710;T or wind speed. Normalized local sensitivities reveal that the convective (hc) and evaporative (he) components dominate the response, whereas the radiative contribution is smaller under typical nighttime boundaries; the cover-permeability factor gains influence as wind speed increases. The additive structure limits independent identifiability of individual mechanisms, supporting an interpretation in terms of effective parameters. The results delineate the domain where the reduced-order formulation is predictive without refitting and provide a compact, interpretable reference for analyzing energy-balance models of open-water systems under nighttime operation.</p>
	]]></content:encoded>

	<dc:title>Nighttime Validation and Local Sensitivity of a Reduced-Order Thermal Balance for Above-Ground Outdoor Pools</dc:title>
			<dc:creator>Seweryn Lipiński</dc:creator>
			<dc:creator>Łukasz Dziubiński</dc:creator>
			<dc:creator>Paweł Chwietczuk</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030046</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-16</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-16</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>46</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030046</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/46</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/45">

	<title>AppliedMath, Vol. 6, Pages 45: Survival Probabilities for Correlated Drifted Brownian Motions via Exit from Simplicial Cones</title>
	<link>https://www.mdpi.com/2673-9909/6/3/45</link>
	<description>This paper investigates the finite-horizon survival probability for a system of correlated arithmetic Brownian motions with heterogeneous drifts and volatilities, focusing on the event in which one component remains strictly below all others. Using a whitening transformation of the covariance structure, we reduce the problem to the survival of a standard Brownian motion in a simplicial cone, characterized by its spherical cross-section. While explicit solutions are available in low dimensions, we address the computationally challenging tetrahedral angular case. We derive a semi-analytic formula for the survival probability via an eigenfunction expansion of the Dirichlet Laplace&amp;amp;ndash;Beltrami operator on this curved domain. For efficient implementation, we construct a diffeomorphism from the spherical tetrahedron to a fixed Euclidean tetrahedron, enabling the computation of angular eigenpairs through a stable finite-element scheme. For higher-dimensional regimes, we also introduce a covariance-based difficulty index and geometric bounds based on an inscribed spherical cap to assess spectral convergence and estimate long-time decay rates. Numerical experiments show that this offline&amp;amp;ndash;online approach achieves high accuracy and substantial speedups relative to Monte Carlo benchmarks.</description>
	<pubDate>2026-03-10</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 45: Survival Probabilities for Correlated Drifted Brownian Motions via Exit from Simplicial Cones</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/45">doi: 10.3390/appliedmath6030045</a></p>
	<p>Authors:
		Tristan Guillaume
		</p>
	<p>This paper investigates the finite-horizon survival probability for a system of correlated arithmetic Brownian motions with heterogeneous drifts and volatilities, focusing on the event in which one component remains strictly below all others. Using a whitening transformation of the covariance structure, we reduce the problem to the survival of a standard Brownian motion in a simplicial cone, characterized by its spherical cross-section. While explicit solutions are available in low dimensions, we address the computationally challenging tetrahedral angular case. We derive a semi-analytic formula for the survival probability via an eigenfunction expansion of the Dirichlet Laplace&amp;amp;ndash;Beltrami operator on this curved domain. For efficient implementation, we construct a diffeomorphism from the spherical tetrahedron to a fixed Euclidean tetrahedron, enabling the computation of angular eigenpairs through a stable finite-element scheme. For higher-dimensional regimes, we also introduce a covariance-based difficulty index and geometric bounds based on an inscribed spherical cap to assess spectral convergence and estimate long-time decay rates. Numerical experiments show that this offline&amp;amp;ndash;online approach achieves high accuracy and substantial speedups relative to Monte Carlo benchmarks.</p>
	]]></content:encoded>

	<dc:title>Survival Probabilities for Correlated Drifted Brownian Motions via Exit from Simplicial Cones</dc:title>
			<dc:creator>Tristan Guillaume</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030045</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-10</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-10</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>45</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030045</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/45</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/44">

	<title>AppliedMath, Vol. 6, Pages 44: A Robust State Estimation Framework Employing a Nonlinear PI2 Observer for Photobioreactor Monitoring</title>
	<link>https://www.mdpi.com/2673-9909/6/3/44</link>
	<description>This work proposes an integral-enhanced nonlinear PI2 state observer for the robust estimation of unmeasured states in nonlinear dynamic systems, with experimental validation on a flat-panel photobioreactor. The observer is designed as a virtual sensor to reconstruct key biological variables using a reduced set of online measurements and known operating conditions. Compared with a conventional extended Luenberger observer, the proposed structure improves estimation accuracy and robustness against constant disturbances and model mismatch, which are common in bioprocess applications. The experimental results show a clear performance advantage during transient growth phases while highlighting that the method relies on a locally valid model structure and appropriate gain tuning. Overall, the proposed observer provides a practical and scalable monitoring tool for nonlinear systems where the direct measurement of critical state is not feasible.</description>
	<pubDate>2026-03-10</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 44: A Robust State Estimation Framework Employing a Nonlinear PI2 Observer for Photobioreactor Monitoring</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/44">doi: 10.3390/appliedmath6030044</a></p>
	<p>Authors:
		Vicente Peña Caballero
		Abraham Efraim Rodríguez-Mata
		Pablo Antonio López-Pérez
		Dulce J. Hernández-Melchor
		Víctor Alejandro González-Huitrón
		</p>
	<p>This work proposes an integral-enhanced nonlinear PI2 state observer for the robust estimation of unmeasured states in nonlinear dynamic systems, with experimental validation on a flat-panel photobioreactor. The observer is designed as a virtual sensor to reconstruct key biological variables using a reduced set of online measurements and known operating conditions. Compared with a conventional extended Luenberger observer, the proposed structure improves estimation accuracy and robustness against constant disturbances and model mismatch, which are common in bioprocess applications. The experimental results show a clear performance advantage during transient growth phases while highlighting that the method relies on a locally valid model structure and appropriate gain tuning. Overall, the proposed observer provides a practical and scalable monitoring tool for nonlinear systems where the direct measurement of critical state is not feasible.</p>
	]]></content:encoded>

	<dc:title>A Robust State Estimation Framework Employing a Nonlinear PI2 Observer for Photobioreactor Monitoring</dc:title>
			<dc:creator>Vicente Peña Caballero</dc:creator>
			<dc:creator>Abraham Efraim Rodríguez-Mata</dc:creator>
			<dc:creator>Pablo Antonio López-Pérez</dc:creator>
			<dc:creator>Dulce J. Hernández-Melchor</dc:creator>
			<dc:creator>Víctor Alejandro González-Huitrón</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030044</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-10</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-10</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>44</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030044</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/44</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/43">

	<title>AppliedMath, Vol. 6, Pages 43: A High-Order Parallel Framework for Simultaneous Root-Finding in Nonlinear Systems with Multiple Solutions</title>
	<link>https://www.mdpi.com/2673-9909/6/3/43</link>
	<description>Nonlinear systems with multiple roots arise frequently in biomedical and engineering models, yet their reliable numerical solution remains a challenging task. Many classical methods suffer from sensitivity to initial guesses, reduced convergence rates, and loss of accuracy in the presence of multiple or clustered solutions. In addition, the exploitation of parallelism to improve robustness and computational efficiency has received limited attention. In this work, we propose a high-accuracy parallel numerical framework of fourth-order convergence for the simultaneous approximation of all solutions of nonlinear systems with multiple roots. The proposed scheme is derivative-free and structurally decoupled, enabling efficient parallel implementation and robust convergence even when reliable initial approximations are unavailable. The effectiveness of the method is demonstrated on representative biomedical engineering models, including a glucose&amp;amp;ndash;insulin&amp;amp;ndash;glucagon regulatory network and a multi-compartment pharmacokinetic system, both exhibiting strong nonlinearity and multistability. Numerical experiments confirm stable convergence toward distinct solution clusters, machine-level accuracy, reduced residual norms, and improved computational performance when compared with existing approaches. These results indicate that the proposed framework provides a reliable and efficient alternative for solving nonlinear systems with multiple roots in complex applied settings.</description>
	<pubDate>2026-03-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 43: A High-Order Parallel Framework for Simultaneous Root-Finding in Nonlinear Systems with Multiple Solutions</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/43">doi: 10.3390/appliedmath6030043</a></p>
	<p>Authors:
		Mudassir Shams
		Bruno Carpentieri
		</p>
	<p>Nonlinear systems with multiple roots arise frequently in biomedical and engineering models, yet their reliable numerical solution remains a challenging task. Many classical methods suffer from sensitivity to initial guesses, reduced convergence rates, and loss of accuracy in the presence of multiple or clustered solutions. In addition, the exploitation of parallelism to improve robustness and computational efficiency has received limited attention. In this work, we propose a high-accuracy parallel numerical framework of fourth-order convergence for the simultaneous approximation of all solutions of nonlinear systems with multiple roots. The proposed scheme is derivative-free and structurally decoupled, enabling efficient parallel implementation and robust convergence even when reliable initial approximations are unavailable. The effectiveness of the method is demonstrated on representative biomedical engineering models, including a glucose&amp;amp;ndash;insulin&amp;amp;ndash;glucagon regulatory network and a multi-compartment pharmacokinetic system, both exhibiting strong nonlinearity and multistability. Numerical experiments confirm stable convergence toward distinct solution clusters, machine-level accuracy, reduced residual norms, and improved computational performance when compared with existing approaches. These results indicate that the proposed framework provides a reliable and efficient alternative for solving nonlinear systems with multiple roots in complex applied settings.</p>
	]]></content:encoded>

	<dc:title>A High-Order Parallel Framework for Simultaneous Root-Finding in Nonlinear Systems with Multiple Solutions</dc:title>
			<dc:creator>Mudassir Shams</dc:creator>
			<dc:creator>Bruno Carpentieri</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030043</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-09</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-09</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>43</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030043</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/43</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/42">

	<title>AppliedMath, Vol. 6, Pages 42: Advanced Frequency of Thick FGM Spherical Shells by Nonlinear Shear and TSDT</title>
	<link>https://www.mdpi.com/2673-9909/6/3/42</link>
	<description>An advanced frequency study in thick-walled functionally graded material (FGM) spherical shells is investigated with advanced shear correction. The values of advanced shear correction can be greater than one, be a negative value, and be affected by a nonlinear term of third-order shear deformation theory (TSDT) of displacements, FGM power law index, and temperature. It is novel and interesting to consider using TSDT and advanced shear correction to derive a simple homogeneous equation with reasonable simplifications into a symmetrical sparse matrix subjected to free vibration. The zero determinant of the symmetrical sparse matrix can be expressed to calculate the natural frequency by Newton&amp;amp;rsquo;s method. The parameter effects of advanced shear correction, a nonlinear TSDT term, temperature, and the FGM power-law index on the natural frequencies of thick-walled FGM spherical shells are presented. The natural-frequency data for the axial and circumferential mode shapes are obtained. This is a new finding, as the assumed simplification in a sparse matrix causes a numerical truncation error; the natural-frequency values of the presented sparse matrix are much greater than those in a full matrix for thick-walled FGM spherical shells.</description>
	<pubDate>2026-03-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 42: Advanced Frequency of Thick FGM Spherical Shells by Nonlinear Shear and TSDT</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/42">doi: 10.3390/appliedmath6030042</a></p>
	<p>Authors:
		Chih-Chiang Hong
		</p>
	<p>An advanced frequency study in thick-walled functionally graded material (FGM) spherical shells is investigated with advanced shear correction. The values of advanced shear correction can be greater than one, be a negative value, and be affected by a nonlinear term of third-order shear deformation theory (TSDT) of displacements, FGM power law index, and temperature. It is novel and interesting to consider using TSDT and advanced shear correction to derive a simple homogeneous equation with reasonable simplifications into a symmetrical sparse matrix subjected to free vibration. The zero determinant of the symmetrical sparse matrix can be expressed to calculate the natural frequency by Newton&amp;amp;rsquo;s method. The parameter effects of advanced shear correction, a nonlinear TSDT term, temperature, and the FGM power-law index on the natural frequencies of thick-walled FGM spherical shells are presented. The natural-frequency data for the axial and circumferential mode shapes are obtained. This is a new finding, as the assumed simplification in a sparse matrix causes a numerical truncation error; the natural-frequency values of the presented sparse matrix are much greater than those in a full matrix for thick-walled FGM spherical shells.</p>
	]]></content:encoded>

	<dc:title>Advanced Frequency of Thick FGM Spherical Shells by Nonlinear Shear and TSDT</dc:title>
			<dc:creator>Chih-Chiang Hong</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030042</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-07</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-07</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>42</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030042</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/42</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/41">

	<title>AppliedMath, Vol. 6, Pages 41: Analysis of Numerical Simulation for Nonlinear Robot Control Based on Dynamic Modeling Using Low-Cost and Open-Source Technology</title>
	<link>https://www.mdpi.com/2673-9909/6/3/41</link>
	<description>Professors, students, and researchers from universities around the world use software distributed under licenses for numerical simulation purposes, which requires a computer with considerable hardware capabilities. This implies a high cost of simulations in engineering applications that require dynamic modeling using numerical methods, particularly in robotics and nonlinear control. This article compares and analyzes the performance of a frugal simulation scheme based on the use of low-cost, free, and open-source technology, specifically a low-power, single-board minicomputer (Raspberry Pi) in conjunction with GNU-Octave software. The benchmark is a numerical simulation of trajectory tracking control in the joint space of a Selective Conformal Assembly Robot Arm (SCARA). To perform this task, a system of coupled nonlinear differential equations is solved in matrix form using a numerical method known as an ODE solver. This solution includes the control law and the dynamic system model derived from Euler&amp;amp;ndash;Lagrange formalism. The time complexity and accuracy are analyzed to compare the performance of the frugal simulation tool with that of a conventional simulation setup consisting of a personal computer and MATLABTM running the same simulation code. The analysis shows minimal deviations in the numerical solutions and reasonable time complexity. Moreover, the frugality score of this approach and the low acquisition cost of the simulation tool enable the creation of simulation laboratories at universities with limited budgets for education and research.</description>
	<pubDate>2026-03-05</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 41: Analysis of Numerical Simulation for Nonlinear Robot Control Based on Dynamic Modeling Using Low-Cost and Open-Source Technology</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/41">doi: 10.3390/appliedmath6030041</a></p>
	<p>Authors:
		Felipe J. Torres
		Israel Martínez
		Antonio J. Balvantín
		Edgar H. Robles
		</p>
	<p>Professors, students, and researchers from universities around the world use software distributed under licenses for numerical simulation purposes, which requires a computer with considerable hardware capabilities. This implies a high cost of simulations in engineering applications that require dynamic modeling using numerical methods, particularly in robotics and nonlinear control. This article compares and analyzes the performance of a frugal simulation scheme based on the use of low-cost, free, and open-source technology, specifically a low-power, single-board minicomputer (Raspberry Pi) in conjunction with GNU-Octave software. The benchmark is a numerical simulation of trajectory tracking control in the joint space of a Selective Conformal Assembly Robot Arm (SCARA). To perform this task, a system of coupled nonlinear differential equations is solved in matrix form using a numerical method known as an ODE solver. This solution includes the control law and the dynamic system model derived from Euler&amp;amp;ndash;Lagrange formalism. The time complexity and accuracy are analyzed to compare the performance of the frugal simulation tool with that of a conventional simulation setup consisting of a personal computer and MATLABTM running the same simulation code. The analysis shows minimal deviations in the numerical solutions and reasonable time complexity. Moreover, the frugality score of this approach and the low acquisition cost of the simulation tool enable the creation of simulation laboratories at universities with limited budgets for education and research.</p>
	]]></content:encoded>

	<dc:title>Analysis of Numerical Simulation for Nonlinear Robot Control Based on Dynamic Modeling Using Low-Cost and Open-Source Technology</dc:title>
			<dc:creator>Felipe J. Torres</dc:creator>
			<dc:creator>Israel Martínez</dc:creator>
			<dc:creator>Antonio J. Balvantín</dc:creator>
			<dc:creator>Edgar H. Robles</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030041</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-05</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-05</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>41</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030041</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/41</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/40">

	<title>AppliedMath, Vol. 6, Pages 40: The Finite Element Method for Stiff Ordinary Differential Equations</title>
	<link>https://www.mdpi.com/2673-9909/6/3/40</link>
	<description>The paper utilizes the continuous finite element method to solve stiff ordinary differential equations and proves that the linear finite element method and the quadratic finite element method have A-stability in solving autonomous ordinary differential equations, and exponential dichotomy in solving non-autonomous ordinary differential equations. In the numerical experiments of nonlinear autonomous and non-autonomous strongly and moderately stiff ordinary differential equations, a relatively large step size of h=0.1 was adopted over a longer period of time, with the numerical solution accuracy reaching 10&amp;amp;minus;4. The superconvergence order maintained the theoretical order. A new approach is provided for solving stiff ordinary differential equations.</description>
	<pubDate>2026-03-04</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 40: The Finite Element Method for Stiff Ordinary Differential Equations</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/40">doi: 10.3390/appliedmath6030040</a></p>
	<p>Authors:
		Yanhui Ding
		Qiong Tang
		Sijia Tang
		</p>
	<p>The paper utilizes the continuous finite element method to solve stiff ordinary differential equations and proves that the linear finite element method and the quadratic finite element method have A-stability in solving autonomous ordinary differential equations, and exponential dichotomy in solving non-autonomous ordinary differential equations. In the numerical experiments of nonlinear autonomous and non-autonomous strongly and moderately stiff ordinary differential equations, a relatively large step size of h=0.1 was adopted over a longer period of time, with the numerical solution accuracy reaching 10&amp;amp;minus;4. The superconvergence order maintained the theoretical order. A new approach is provided for solving stiff ordinary differential equations.</p>
	]]></content:encoded>

	<dc:title>The Finite Element Method for Stiff Ordinary Differential Equations</dc:title>
			<dc:creator>Yanhui Ding</dc:creator>
			<dc:creator>Qiong Tang</dc:creator>
			<dc:creator>Sijia Tang</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030040</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-04</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-04</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>40</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030040</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/40</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/39">

	<title>AppliedMath, Vol. 6, Pages 39: Models of Low-Dimensional Vector-Fuzzy Representations of Genetic Sequences and Amino Acids</title>
	<link>https://www.mdpi.com/2673-9909/6/3/39</link>
	<description>Genetic sequences play a central role in biological and medical research, and mathematics provides powerful means for their representation and analysis. Conventional approaches, such as the fuzzy polynucleotide space [0,&amp;amp;nbsp;1]12, model codons as 12-dimensional vectors, but this comes at the cost of high dimensionality. In this study, we introduce two new models, Vector-Fuzzy-I and Vector-Fuzzy-II, that map codons and genetic sequences into the 4-dimensional Euclidean space &amp;amp;#8477;4 using vector algebra and fuzzy set theory. In the first model, sequence structure is represented by successive vector addition, while in the second, it is represented by positional frequencies normalized by nucleotide locations. These low-dimensional representations are unique, preserve sequence order, and allow effective measurement of similarity and difference via Euclidean metrics. Compared with the fuzzy polynucleotide space, the proposed models achieve dimensionality reduction while enhancing the resolution of sequence differentiation. Our approach offers new mathematical perspectives for sequence analysis in theoretical biology.</description>
	<pubDate>2026-03-04</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 39: Models of Low-Dimensional Vector-Fuzzy Representations of Genetic Sequences and Amino Acids</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/39">doi: 10.3390/appliedmath6030039</a></p>
	<p>Authors:
		Fotini Sereti
		Dimitrios Georgiou
		Theodoros Karakasidis
		</p>
	<p>Genetic sequences play a central role in biological and medical research, and mathematics provides powerful means for their representation and analysis. Conventional approaches, such as the fuzzy polynucleotide space [0,&amp;amp;nbsp;1]12, model codons as 12-dimensional vectors, but this comes at the cost of high dimensionality. In this study, we introduce two new models, Vector-Fuzzy-I and Vector-Fuzzy-II, that map codons and genetic sequences into the 4-dimensional Euclidean space &amp;amp;#8477;4 using vector algebra and fuzzy set theory. In the first model, sequence structure is represented by successive vector addition, while in the second, it is represented by positional frequencies normalized by nucleotide locations. These low-dimensional representations are unique, preserve sequence order, and allow effective measurement of similarity and difference via Euclidean metrics. Compared with the fuzzy polynucleotide space, the proposed models achieve dimensionality reduction while enhancing the resolution of sequence differentiation. Our approach offers new mathematical perspectives for sequence analysis in theoretical biology.</p>
	]]></content:encoded>

	<dc:title>Models of Low-Dimensional Vector-Fuzzy Representations of Genetic Sequences and Amino Acids</dc:title>
			<dc:creator>Fotini Sereti</dc:creator>
			<dc:creator>Dimitrios Georgiou</dc:creator>
			<dc:creator>Theodoros Karakasidis</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030039</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-04</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-04</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>39</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030039</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/39</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/38">

	<title>AppliedMath, Vol. 6, Pages 38: Advancing Cancer Research Through Stochastic Modeling: Insights into Tumor Growth, Evolution, and Treatment Response</title>
	<link>https://www.mdpi.com/2673-9909/6/3/38</link>
	<description>The complex and heterogeneous nature of cancer necessitates advanced modeling techniques to better understand tumor dynamics and inform treatment strategies. This paper explores the application of stochastic modeling in cancer research, focusing on five key areas: tumor growth kinetics, evolutionary dynamics of cancer, treatment response and resistance, spatial modeling of tumor progression, and clinical applications of stochastic models. We first examine how stochastic models capture the randomness in tumor growth and proliferation, providing insights into cellular behaviors that deterministic models may overlook. Next, we investigate the evolutionary dynamics that govern tumor heterogeneity and the emergence of resistance, highlighting the role of genetic mutations and environmental pressures. The paper also discusses how stochastic modeling can improve predictions of treatment responses, elucidating mechanisms behind therapy resistance in various tumor subpopulations. Furthermore, we address the significance of spatial modeling in understanding tumor interactions within their microenvironment, shedding light on processes such as metastasis. Finally, we emphasize the translational potential of these mathematical frameworks, demonstrating how they can enhance personalized medicine approaches in oncology. By integrating stochastic modeling into cancer research, this work contributes to a deeper understanding of cancer biology and paves the way for improved patient outcomes.</description>
	<pubDate>2026-03-03</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 38: Advancing Cancer Research Through Stochastic Modeling: Insights into Tumor Growth, Evolution, and Treatment Response</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/38">doi: 10.3390/appliedmath6030038</a></p>
	<p>Authors:
		Tahmineh Azizi
		</p>
	<p>The complex and heterogeneous nature of cancer necessitates advanced modeling techniques to better understand tumor dynamics and inform treatment strategies. This paper explores the application of stochastic modeling in cancer research, focusing on five key areas: tumor growth kinetics, evolutionary dynamics of cancer, treatment response and resistance, spatial modeling of tumor progression, and clinical applications of stochastic models. We first examine how stochastic models capture the randomness in tumor growth and proliferation, providing insights into cellular behaviors that deterministic models may overlook. Next, we investigate the evolutionary dynamics that govern tumor heterogeneity and the emergence of resistance, highlighting the role of genetic mutations and environmental pressures. The paper also discusses how stochastic modeling can improve predictions of treatment responses, elucidating mechanisms behind therapy resistance in various tumor subpopulations. Furthermore, we address the significance of spatial modeling in understanding tumor interactions within their microenvironment, shedding light on processes such as metastasis. Finally, we emphasize the translational potential of these mathematical frameworks, demonstrating how they can enhance personalized medicine approaches in oncology. By integrating stochastic modeling into cancer research, this work contributes to a deeper understanding of cancer biology and paves the way for improved patient outcomes.</p>
	]]></content:encoded>

	<dc:title>Advancing Cancer Research Through Stochastic Modeling: Insights into Tumor Growth, Evolution, and Treatment Response</dc:title>
			<dc:creator>Tahmineh Azizi</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030038</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-03</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-03</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>38</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030038</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/38</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/37">

	<title>AppliedMath, Vol. 6, Pages 37: Self-Learning Control for Multi-Agent Consensus</title>
	<link>https://www.mdpi.com/2673-9909/6/3/37</link>
	<description>This paper addresses the consensus problem in multi-agent systems via a self-learning control scheme that directly reuses prior control information to accelerate transient coordination while maintaining robustness. I study agents with linear dynamics and external disturbances, and design a lightweight self-learning consensus control law for the distributed consensus domain, formulated as ui(t)=k1ui(t&amp;amp;minus;&amp;amp;tau;)+k2si(t) with learning intensity k1 and learning interval &amp;amp;tau;. I provide a Lyapunov-based stability proof showing uniform ultimate boundedness of the consensus error under bounded disturbances. Compared to non-learning consensus laws, the proposed strategy achieves faster agreement with reduced long-term effort and retains simplicity suitable for resource-constrained multi-agent platforms, while also achieving decent performance against external disturbances. Simulations validate the improved transient speed and steady accuracy. The full-version-source code is open-sourced.</description>
	<pubDate>2026-03-03</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 37: Self-Learning Control for Multi-Agent Consensus</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/37">doi: 10.3390/appliedmath6030037</a></p>
	<p>Authors:
		Chengxi Zhang
		</p>
	<p>This paper addresses the consensus problem in multi-agent systems via a self-learning control scheme that directly reuses prior control information to accelerate transient coordination while maintaining robustness. I study agents with linear dynamics and external disturbances, and design a lightweight self-learning consensus control law for the distributed consensus domain, formulated as ui(t)=k1ui(t&amp;amp;minus;&amp;amp;tau;)+k2si(t) with learning intensity k1 and learning interval &amp;amp;tau;. I provide a Lyapunov-based stability proof showing uniform ultimate boundedness of the consensus error under bounded disturbances. Compared to non-learning consensus laws, the proposed strategy achieves faster agreement with reduced long-term effort and retains simplicity suitable for resource-constrained multi-agent platforms, while also achieving decent performance against external disturbances. Simulations validate the improved transient speed and steady accuracy. The full-version-source code is open-sourced.</p>
	]]></content:encoded>

	<dc:title>Self-Learning Control for Multi-Agent Consensus</dc:title>
			<dc:creator>Chengxi Zhang</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030037</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-03</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-03</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>37</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030037</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/37</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/36">

	<title>AppliedMath, Vol. 6, Pages 36: A Second-Order Nonstandard Finite Difference Method for a Malaria Propagation Model with Control</title>
	<link>https://www.mdpi.com/2673-9909/6/3/36</link>
	<description>Standard numerical methods such as Runge&amp;amp;ndash;Kutta and Euler methods have been widely used to approximate solutions to nonlinear systems. These methods converge to the solution only for small step sizes; for larger time steps, they generally generate spurious or chaotic solutions. In this paper, we consider a malaria propagation model with control for which we construct a second-order nonstandard finite difference scheme that preserves the important mathematical properties of the continuous model, which are positivity, boundedness, and stability of solutions irrespective of the step size. Moreover, we show that the equilibrium points of the discrete model are the same as those of the continuous model. By applying the double mesh principle, we provide evidence that the second-order NSFD scheme approximates the true solution with small errors. Theoretical assertions and numerical results show the advantages of the developed second-order nonstandard finite difference method.</description>
	<pubDate>2026-03-02</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 36: A Second-Order Nonstandard Finite Difference Method for a Malaria Propagation Model with Control</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/36">doi: 10.3390/appliedmath6030036</a></p>
	<p>Authors:
		Calisto B. Marime
		Justin B. Munyakazi
		</p>
	<p>Standard numerical methods such as Runge&amp;amp;ndash;Kutta and Euler methods have been widely used to approximate solutions to nonlinear systems. These methods converge to the solution only for small step sizes; for larger time steps, they generally generate spurious or chaotic solutions. In this paper, we consider a malaria propagation model with control for which we construct a second-order nonstandard finite difference scheme that preserves the important mathematical properties of the continuous model, which are positivity, boundedness, and stability of solutions irrespective of the step size. Moreover, we show that the equilibrium points of the discrete model are the same as those of the continuous model. By applying the double mesh principle, we provide evidence that the second-order NSFD scheme approximates the true solution with small errors. Theoretical assertions and numerical results show the advantages of the developed second-order nonstandard finite difference method.</p>
	]]></content:encoded>

	<dc:title>A Second-Order Nonstandard Finite Difference Method for a Malaria Propagation Model with Control</dc:title>
			<dc:creator>Calisto B. Marime</dc:creator>
			<dc:creator>Justin B. Munyakazi</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030036</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-03-02</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-03-02</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>36</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030036</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/36</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/3/35">

	<title>AppliedMath, Vol. 6, Pages 35: End-to-End Tool Path Generation for Triangular Mesh Surfaces in Five-Axis CNC Machining</title>
	<link>https://www.mdpi.com/2673-9909/6/3/35</link>
	<description>Triangular mesh surface representation is widely adopted in geometric design and reverse engineering applications. However, in high-precision Computer Numerical Control (CNC) machining, significant limitations persist in automated Computer-Aided Manufacturing (CAM) tool path generation for such representations. Conventional CAM workflows heavily rely on manual engineering interventions, such as creating drive surfaces or tuning extensive parameters&amp;amp;mdash;a dependency that becomes particularly acute for generic free-form models. To address this critical challenge, this paper proposes a novel end-to-end single-step end-milling tool path generation methodology for triangular mesh surfaces in high-precision five-axis CNC machining. The framework includes clustering analysis for optimal workpiece orientation, normal vector distribution analysis to identify shallow and steep regions, Graphics Processing Unit (GPU)-accelerated collision detection for feasible tool orientation domains, and iso-planar tool path generation with Traveling Salesman Problem (TSP) optimization for efficient tool lifting and movement. Experimental validation confirms the framework ensures machining quality and algorithmic robustness.</description>
	<pubDate>2026-02-24</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 35: End-to-End Tool Path Generation for Triangular Mesh Surfaces in Five-Axis CNC Machining</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/3/35">doi: 10.3390/appliedmath6030035</a></p>
	<p>Authors:
		Shi-Chu Li
		Hong-Yu Ma
		Bo-Wen Zhang
		Li-Yong Shen
		</p>
	<p>Triangular mesh surface representation is widely adopted in geometric design and reverse engineering applications. However, in high-precision Computer Numerical Control (CNC) machining, significant limitations persist in automated Computer-Aided Manufacturing (CAM) tool path generation for such representations. Conventional CAM workflows heavily rely on manual engineering interventions, such as creating drive surfaces or tuning extensive parameters&amp;amp;mdash;a dependency that becomes particularly acute for generic free-form models. To address this critical challenge, this paper proposes a novel end-to-end single-step end-milling tool path generation methodology for triangular mesh surfaces in high-precision five-axis CNC machining. The framework includes clustering analysis for optimal workpiece orientation, normal vector distribution analysis to identify shallow and steep regions, Graphics Processing Unit (GPU)-accelerated collision detection for feasible tool orientation domains, and iso-planar tool path generation with Traveling Salesman Problem (TSP) optimization for efficient tool lifting and movement. Experimental validation confirms the framework ensures machining quality and algorithmic robustness.</p>
	]]></content:encoded>

	<dc:title>End-to-End Tool Path Generation for Triangular Mesh Surfaces in Five-Axis CNC Machining</dc:title>
			<dc:creator>Shi-Chu Li</dc:creator>
			<dc:creator>Hong-Yu Ma</dc:creator>
			<dc:creator>Bo-Wen Zhang</dc:creator>
			<dc:creator>Li-Yong Shen</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6030035</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-24</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-24</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>35</prism:startingPage>
		<prism:doi>10.3390/appliedmath6030035</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/3/35</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/34">

	<title>AppliedMath, Vol. 6, Pages 34: A Sixth-Order Vieta&amp;ndash;Lucas Polynomial-Based Block Method with Optimal Stability for Solving Practical First-Order ODE Models</title>
	<link>https://www.mdpi.com/2673-9909/6/2/34</link>
	<description>This paper addresses the numerical integration of first-order ordinary differential equations by developing a continuous linear multistep block method. The method is constructed through the approximation of the exact solution using a linear combination of shifted Vieta&amp;amp;ndash;Lucas polynomials defined on the interval [0,&amp;amp;nbsp;4]. The use of this polynomial basis extends traditional approximation approaches and provides improved stability while maintaining high-order accuracy. Theoretical analysis shows that the proposed method attains sixth-order convergence and possesses an extended stability interval of [&amp;amp;minus;19.5,0], ensuring reliable performance for moderately stiff problems. Numerical experiments confirm that the method achieves lower errors and higher computational efficiency than conventional methods. These results demonstrate the suitability of the proposed approach for scientific computing applications, including engineering simulations and mathematical modeling, where accurate numerical integration of first-order differential equation is required.</description>
	<pubDate>2026-02-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 34: A Sixth-Order Vieta&amp;ndash;Lucas Polynomial-Based Block Method with Optimal Stability for Solving Practical First-Order ODE Models</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/34">doi: 10.3390/appliedmath6020034</a></p>
	<p>Authors:
		Olugbade Ezekiel Faniyi
		Mark Ifeanyi Modebei
		Matthew Olanrewaju Oluwayemi
		Ikechukwu Jackson Otaide
		</p>
	<p>This paper addresses the numerical integration of first-order ordinary differential equations by developing a continuous linear multistep block method. The method is constructed through the approximation of the exact solution using a linear combination of shifted Vieta&amp;amp;ndash;Lucas polynomials defined on the interval [0,&amp;amp;nbsp;4]. The use of this polynomial basis extends traditional approximation approaches and provides improved stability while maintaining high-order accuracy. Theoretical analysis shows that the proposed method attains sixth-order convergence and possesses an extended stability interval of [&amp;amp;minus;19.5,0], ensuring reliable performance for moderately stiff problems. Numerical experiments confirm that the method achieves lower errors and higher computational efficiency than conventional methods. These results demonstrate the suitability of the proposed approach for scientific computing applications, including engineering simulations and mathematical modeling, where accurate numerical integration of first-order differential equation is required.</p>
	]]></content:encoded>

	<dc:title>A Sixth-Order Vieta&amp;amp;ndash;Lucas Polynomial-Based Block Method with Optimal Stability for Solving Practical First-Order ODE Models</dc:title>
			<dc:creator>Olugbade Ezekiel Faniyi</dc:creator>
			<dc:creator>Mark Ifeanyi Modebei</dc:creator>
			<dc:creator>Matthew Olanrewaju Oluwayemi</dc:creator>
			<dc:creator>Ikechukwu Jackson Otaide</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020034</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-13</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-13</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>34</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020034</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/34</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/33">

	<title>AppliedMath, Vol. 6, Pages 33: Dispersive Quiescent Optical Solitons with DWDM Topology</title>
	<link>https://www.mdpi.com/2673-9909/6/2/33</link>
	<description>The paper retrieves quiescent dispersive solitons in dispersion-flattened optical fibers having nonlinear chromatic dispersion and the Kerr law of self-phase modulation. The platform model is the Schr&amp;amp;ouml;dinger&amp;amp;ndash;Hirota equation. The enhanced direct algebraic method has made this retrieval possible. The intermediary functions are Jacobi&amp;amp;rsquo;s elliptic function and Weierstrass&amp;amp;rsquo; elliptic function. The final results appear with parameter constraints for the existence of such solitons.</description>
	<pubDate>2026-02-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 33: Dispersive Quiescent Optical Solitons with DWDM Topology</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/33">doi: 10.3390/appliedmath6020033</a></p>
	<p>Authors:
		Elsayed M. E. Zayed
		Mona El-Shater
		Ahmed H. Arnous
		Lina S. Calucag
		Anjan Biswas
		</p>
	<p>The paper retrieves quiescent dispersive solitons in dispersion-flattened optical fibers having nonlinear chromatic dispersion and the Kerr law of self-phase modulation. The platform model is the Schr&amp;amp;ouml;dinger&amp;amp;ndash;Hirota equation. The enhanced direct algebraic method has made this retrieval possible. The intermediary functions are Jacobi&amp;amp;rsquo;s elliptic function and Weierstrass&amp;amp;rsquo; elliptic function. The final results appear with parameter constraints for the existence of such solitons.</p>
	]]></content:encoded>

	<dc:title>Dispersive Quiescent Optical Solitons with DWDM Topology</dc:title>
			<dc:creator>Elsayed M. E. Zayed</dc:creator>
			<dc:creator>Mona El-Shater</dc:creator>
			<dc:creator>Ahmed H. Arnous</dc:creator>
			<dc:creator>Lina S. Calucag</dc:creator>
			<dc:creator>Anjan Biswas</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020033</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-13</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-13</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>33</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020033</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/33</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/32">

	<title>AppliedMath, Vol. 6, Pages 32: Exploring Artificial Intelligence and Machine Learning Approaches to Legal Reasoning</title>
	<link>https://www.mdpi.com/2673-9909/6/2/32</link>
	<description>Modeling legal reasoning with artificial intelligence and machine learning presents formidable challenges. Legal decisions emerge from a complex interplay of factual circumstances, statutory interpretation, case precedent, jurisdictional variation, and human judgment&amp;amp;mdash;including the behavioral characteristics of judges and juries. This paper takes an exploratory approach to investigating how contemporary ML techniques might capture aspects of this complexity. Using pharmaceutical patent litigation as an illustrative domain, we develop a multi-layer analytical pipeline integrating text mining, clustering, topic modeling, and classification to analyze 698 U.S. federal district court decisions spanning January 2016 through December 2018, comprising substantive validity and infringement rulings under the Hatch-Waxman regulatory framework. Results demonstrate that the pipeline achieves 85&amp;amp;ndash;89% prediction accuracy&amp;amp;mdash;substantially exceeding the 42% baseline majority-class rate and comparing favorably with prior legal prediction studies&amp;amp;mdash;while producing interpretable intermediate outputs: clusters that correspond to recognized doctrinal categories (Abbreviated New Drug Application&amp;amp;mdash;ANDA litigation, obviousness, written description, claim construction) and topics that capture recurring legal themes. We discuss what these findings reveal about both the possibilities and limitations of computational approaches to legal reasoning, acknowledging the significant gap between statistical prediction and genuine legal understanding.</description>
	<pubDate>2026-02-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 32: Exploring Artificial Intelligence and Machine Learning Approaches to Legal Reasoning</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/32">doi: 10.3390/appliedmath6020032</a></p>
	<p>Authors:
		Wullianallur Raghupathi
		</p>
	<p>Modeling legal reasoning with artificial intelligence and machine learning presents formidable challenges. Legal decisions emerge from a complex interplay of factual circumstances, statutory interpretation, case precedent, jurisdictional variation, and human judgment&amp;amp;mdash;including the behavioral characteristics of judges and juries. This paper takes an exploratory approach to investigating how contemporary ML techniques might capture aspects of this complexity. Using pharmaceutical patent litigation as an illustrative domain, we develop a multi-layer analytical pipeline integrating text mining, clustering, topic modeling, and classification to analyze 698 U.S. federal district court decisions spanning January 2016 through December 2018, comprising substantive validity and infringement rulings under the Hatch-Waxman regulatory framework. Results demonstrate that the pipeline achieves 85&amp;amp;ndash;89% prediction accuracy&amp;amp;mdash;substantially exceeding the 42% baseline majority-class rate and comparing favorably with prior legal prediction studies&amp;amp;mdash;while producing interpretable intermediate outputs: clusters that correspond to recognized doctrinal categories (Abbreviated New Drug Application&amp;amp;mdash;ANDA litigation, obviousness, written description, claim construction) and topics that capture recurring legal themes. We discuss what these findings reveal about both the possibilities and limitations of computational approaches to legal reasoning, acknowledging the significant gap between statistical prediction and genuine legal understanding.</p>
	]]></content:encoded>

	<dc:title>Exploring Artificial Intelligence and Machine Learning Approaches to Legal Reasoning</dc:title>
			<dc:creator>Wullianallur Raghupathi</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020032</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-12</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-12</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>32</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020032</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/32</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/31">

	<title>AppliedMath, Vol. 6, Pages 31: Hadamard Products of Projective Varieties with Errors and Erasures</title>
	<link>https://www.mdpi.com/2673-9909/6/2/31</link>
	<description>In Algebraic Statistics, M.A. Cueto, J. Morton and B. Sturmfels introduced a statistical model, the Restricted Boltzmann Machine, which introduced the Hadamard product of two or more vectors of an affine or projective space, i.e., the componentwise product of their entries, forcing Algebraic Geometry to enter. The Hadamard product X&amp;amp;#8902;Y of two subvarieties X,Y&amp;amp;sub;Pn is defined as the Zariski closure of the Hadamard product of its elements. Recently, D. Antolini and A. Oneto introduced and studied the definition of Hadamard rank, and we prove some results on it. Moreover, we prove some theorems on the dimension and shape of the Hadamard powers of X. The aim is to describe the images of the Hadamard products without taking the Zariski closure. We also discuss several scenarios describing the case in which some of the data, i.e., the variety X, is wrong or it is not possible to recover it.</description>
	<pubDate>2026-02-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 31: Hadamard Products of Projective Varieties with Errors and Erasures</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/31">doi: 10.3390/appliedmath6020031</a></p>
	<p>Authors:
		Edoardo Ballico
		</p>
	<p>In Algebraic Statistics, M.A. Cueto, J. Morton and B. Sturmfels introduced a statistical model, the Restricted Boltzmann Machine, which introduced the Hadamard product of two or more vectors of an affine or projective space, i.e., the componentwise product of their entries, forcing Algebraic Geometry to enter. The Hadamard product X&amp;amp;#8902;Y of two subvarieties X,Y&amp;amp;sub;Pn is defined as the Zariski closure of the Hadamard product of its elements. Recently, D. Antolini and A. Oneto introduced and studied the definition of Hadamard rank, and we prove some results on it. Moreover, we prove some theorems on the dimension and shape of the Hadamard powers of X. The aim is to describe the images of the Hadamard products without taking the Zariski closure. We also discuss several scenarios describing the case in which some of the data, i.e., the variety X, is wrong or it is not possible to recover it.</p>
	]]></content:encoded>

	<dc:title>Hadamard Products of Projective Varieties with Errors and Erasures</dc:title>
			<dc:creator>Edoardo Ballico</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020031</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-12</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-12</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>31</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020031</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/31</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/30">

	<title>AppliedMath, Vol. 6, Pages 30: General Stochastic Vector Integration: A New Approach</title>
	<link>https://www.mdpi.com/2673-9909/6/2/30</link>
	<description>This paper presents a topology-based approach to the general vector-valued stochastic integral for predictable integrands and semimartingale integrators. The integral is defined as a unique mapping that achieves closure under the semimartingale topology. While the topology and the closedness of the integral operator are well known, the method of defining the integral via this mapping is new and offers a significantly more efficient path to understanding the general stochastic integral compared to existing techniques. Instead of defining a basic integral and then extending it through a sequence of case distinctions, our construction performs a single topological closure: we define the vector stochastic integral as the unique continuous extension of the simple-predictable integral under the &amp;amp;Eacute;mery topology, within the predictable &amp;amp;sigma;-algebra. This single step yields the general predictable, vector-valued integral without invoking semimartingale decompositions, Doob&amp;amp;ndash;Meyer, or detours through H2/quasimartingale frameworks and without re-engineering from the componentwise to the vector case.</description>
	<pubDate>2026-02-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 30: General Stochastic Vector Integration: A New Approach</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/30">doi: 10.3390/appliedmath6020030</a></p>
	<p>Authors:
		Moritz Sohns
		Ali Zakaria Idriss
		</p>
	<p>This paper presents a topology-based approach to the general vector-valued stochastic integral for predictable integrands and semimartingale integrators. The integral is defined as a unique mapping that achieves closure under the semimartingale topology. While the topology and the closedness of the integral operator are well known, the method of defining the integral via this mapping is new and offers a significantly more efficient path to understanding the general stochastic integral compared to existing techniques. Instead of defining a basic integral and then extending it through a sequence of case distinctions, our construction performs a single topological closure: we define the vector stochastic integral as the unique continuous extension of the simple-predictable integral under the &amp;amp;Eacute;mery topology, within the predictable &amp;amp;sigma;-algebra. This single step yields the general predictable, vector-valued integral without invoking semimartingale decompositions, Doob&amp;amp;ndash;Meyer, or detours through H2/quasimartingale frameworks and without re-engineering from the componentwise to the vector case.</p>
	]]></content:encoded>

	<dc:title>General Stochastic Vector Integration: A New Approach</dc:title>
			<dc:creator>Moritz Sohns</dc:creator>
			<dc:creator>Ali Zakaria Idriss</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020030</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-11</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-11</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>30</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020030</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/30</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/29">

	<title>AppliedMath, Vol. 6, Pages 29: Optimal Control of a Genotype-Structured Prey&amp;ndash;Predator Model: Strategies for Ecological Rescue and Oscillatory Dynamics Restoration</title>
	<link>https://www.mdpi.com/2673-9909/6/2/29</link>
	<description>Evolutionary changes can significantly impact interactions among populations and disrupt ecosystems by driving extinctions or collapsing population oscillations, posing substantial challenges to biodiversity conservation. This study addresses the ecological rescue of a predator population threatened by a mutant prey population using the optimal control method. To study this, we study a model that incorporates a genotypically structured prey population comprising wild-type, heterozygous, and mutant prey types, as well as the predator population. We prove that this model has both local and global existence and uniqueness of solutions, ensuring the model&amp;amp;rsquo;s robustness. Then, we applied the optimal control method, incorporating Pontryagin&amp;amp;rsquo;s Maximum Principle, to introduce a control input into the model and minimize the mutant population, thereby stabilizing the ecosystem. We utilize a reproduction number and a control efficacy measure to numerically demonstrate that the undesired dynamics of the model can be controlled, leading to the suppression of the mutant and the restoration of the oscillatory dynamics of the system. These findings demonstrate the applicability of optimal control strategies and provide a mathematical framework for managing such ecological disruptions.</description>
	<pubDate>2026-02-10</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 29: Optimal Control of a Genotype-Structured Prey&amp;ndash;Predator Model: Strategies for Ecological Rescue and Oscillatory Dynamics Restoration</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/29">doi: 10.3390/appliedmath6020029</a></p>
	<p>Authors:
		Preet Mishra
		Shyam Kumar
		Sorokhaibam Cha Captain Vyom
		R. K. Brojen Singh
		</p>
	<p>Evolutionary changes can significantly impact interactions among populations and disrupt ecosystems by driving extinctions or collapsing population oscillations, posing substantial challenges to biodiversity conservation. This study addresses the ecological rescue of a predator population threatened by a mutant prey population using the optimal control method. To study this, we study a model that incorporates a genotypically structured prey population comprising wild-type, heterozygous, and mutant prey types, as well as the predator population. We prove that this model has both local and global existence and uniqueness of solutions, ensuring the model&amp;amp;rsquo;s robustness. Then, we applied the optimal control method, incorporating Pontryagin&amp;amp;rsquo;s Maximum Principle, to introduce a control input into the model and minimize the mutant population, thereby stabilizing the ecosystem. We utilize a reproduction number and a control efficacy measure to numerically demonstrate that the undesired dynamics of the model can be controlled, leading to the suppression of the mutant and the restoration of the oscillatory dynamics of the system. These findings demonstrate the applicability of optimal control strategies and provide a mathematical framework for managing such ecological disruptions.</p>
	]]></content:encoded>

	<dc:title>Optimal Control of a Genotype-Structured Prey&amp;amp;ndash;Predator Model: Strategies for Ecological Rescue and Oscillatory Dynamics Restoration</dc:title>
			<dc:creator>Preet Mishra</dc:creator>
			<dc:creator>Shyam Kumar</dc:creator>
			<dc:creator>Sorokhaibam Cha Captain Vyom</dc:creator>
			<dc:creator>R. K. Brojen Singh</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020029</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-10</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-10</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>29</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020029</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/29</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/28">

	<title>AppliedMath, Vol. 6, Pages 28: The Junction of PDEs, Financial Mathematics and Probability: Deriving Classical and Generalized Black-Scholes&amp;ndash;Merton Formulas</title>
	<link>https://www.mdpi.com/2673-9909/6/2/28</link>
	<description>This paper explores the intersection of three foundational areas&amp;amp;mdash;partial differential equations, financial mathematics, and probability&amp;amp;mdash;by providing a rigorous framework for the classical Black-Scholes&amp;amp;ndash;Merton option pricing model and its generalized extensions. For the classical model, a change in variables is employed to transform the Black-Scholes partial differential equation into the linear heat equation. The resulting formulation enables the use of Fourier transform techniques and the fundamental solution (heat kernel) to derive the closed-form Black-Scholes&amp;amp;ndash;Merton formula. To extend the classical setting, the interest rate in the discount factor and the stock&amp;amp;rsquo;s rate of return are modeled using a multifactor Vasicek process, leading to a more sophisticated and realistic option pricing framework. In addition, a complementary derivation based on probabilistic methods, using a change in measure, yields an alternative explicit pricing formula. Numerical experiments based on Monte Carlo simulation show excellent agreement with the closed-form solutions and illustrate notable gains in computational efficiency. The comparative analysis further demonstrates that stochastic interest rates systematically produce lower option prices than the classical constant-rate model, underscoring the importance of accurate interest-rate modeling in practical valuation.</description>
	<pubDate>2026-02-10</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 28: The Junction of PDEs, Financial Mathematics and Probability: Deriving Classical and Generalized Black-Scholes&amp;ndash;Merton Formulas</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/28">doi: 10.3390/appliedmath6020028</a></p>
	<p>Authors:
		Len Meas
		Chhaunny Chhum
		Phichhang Ou
		Mara Mong
		</p>
	<p>This paper explores the intersection of three foundational areas&amp;amp;mdash;partial differential equations, financial mathematics, and probability&amp;amp;mdash;by providing a rigorous framework for the classical Black-Scholes&amp;amp;ndash;Merton option pricing model and its generalized extensions. For the classical model, a change in variables is employed to transform the Black-Scholes partial differential equation into the linear heat equation. The resulting formulation enables the use of Fourier transform techniques and the fundamental solution (heat kernel) to derive the closed-form Black-Scholes&amp;amp;ndash;Merton formula. To extend the classical setting, the interest rate in the discount factor and the stock&amp;amp;rsquo;s rate of return are modeled using a multifactor Vasicek process, leading to a more sophisticated and realistic option pricing framework. In addition, a complementary derivation based on probabilistic methods, using a change in measure, yields an alternative explicit pricing formula. Numerical experiments based on Monte Carlo simulation show excellent agreement with the closed-form solutions and illustrate notable gains in computational efficiency. The comparative analysis further demonstrates that stochastic interest rates systematically produce lower option prices than the classical constant-rate model, underscoring the importance of accurate interest-rate modeling in practical valuation.</p>
	]]></content:encoded>

	<dc:title>The Junction of PDEs, Financial Mathematics and Probability: Deriving Classical and Generalized Black-Scholes&amp;amp;ndash;Merton Formulas</dc:title>
			<dc:creator>Len Meas</dc:creator>
			<dc:creator>Chhaunny Chhum</dc:creator>
			<dc:creator>Phichhang Ou</dc:creator>
			<dc:creator>Mara Mong</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020028</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-10</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-10</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>28</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020028</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/28</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/27">

	<title>AppliedMath, Vol. 6, Pages 27: Modeling COVID-19 Population Dynamics with a Viral Reservoir and Human Mobility</title>
	<link>https://www.mdpi.com/2673-9909/6/2/27</link>
	<description>This article introduces and thoroughly examines a novel deterministic compartmental model of COVID-19 dynamics. The model uniquely incorporates compartments for symptomatic and asymptomatic individuals alongside an environmental reservoir for the pathogen. It also accounts for a steady inflow of infected visitors and a steady outflow from the removed class. The mathematical soundness of the model is established by identifying the invariant region and ensuring positivity of solutions. Notably, during surges of infected visitors, certain classes maintain positive minimum values. We analytically determine endemic equilibrium points and prove the global stability of the disease-free equilibrium. Sensitivity analysis highlights the significant roles of transmission rates and asymptomatic individuals in disease spread. Simulation results corroborate the theoretical findings and provide additional insights into the model&amp;amp;rsquo;s predictive capabilities.</description>
	<pubDate>2026-02-10</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 27: Modeling COVID-19 Population Dynamics with a Viral Reservoir and Human Mobility</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/27">doi: 10.3390/appliedmath6020027</a></p>
	<p>Authors:
		Jené Mercia van Schalkwyk
		Peter Joseph Witbooi
		Sibaliwe Maku Vyambwera
		Mozart Umba Nsuami
		</p>
	<p>This article introduces and thoroughly examines a novel deterministic compartmental model of COVID-19 dynamics. The model uniquely incorporates compartments for symptomatic and asymptomatic individuals alongside an environmental reservoir for the pathogen. It also accounts for a steady inflow of infected visitors and a steady outflow from the removed class. The mathematical soundness of the model is established by identifying the invariant region and ensuring positivity of solutions. Notably, during surges of infected visitors, certain classes maintain positive minimum values. We analytically determine endemic equilibrium points and prove the global stability of the disease-free equilibrium. Sensitivity analysis highlights the significant roles of transmission rates and asymptomatic individuals in disease spread. Simulation results corroborate the theoretical findings and provide additional insights into the model&amp;amp;rsquo;s predictive capabilities.</p>
	]]></content:encoded>

	<dc:title>Modeling COVID-19 Population Dynamics with a Viral Reservoir and Human Mobility</dc:title>
			<dc:creator>Jené Mercia van Schalkwyk</dc:creator>
			<dc:creator>Peter Joseph Witbooi</dc:creator>
			<dc:creator>Sibaliwe Maku Vyambwera</dc:creator>
			<dc:creator>Mozart Umba Nsuami</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020027</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-10</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-10</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>27</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020027</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/27</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/26">

	<title>AppliedMath, Vol. 6, Pages 26: A Benchmarking Study for Algorithm Selection in Scientific Machine Learning (SciML): PINN vs. gPINN for Solving Partial Differential Equations</title>
	<link>https://www.mdpi.com/2673-9909/6/2/26</link>
	<description>Recent advances in physics-informed neural networks (PINN) have highlighted the need for systematic criteria for selecting appropriate algorithms to solve differential equations. This paper presents a numerical comparison between standard PINNs and gradient-enhanced PINNs (gPINNs) used to solve a high-order partial differential equations (PDE). To verify the accuracy and convergence behavior of all the methods, we solve a fourth-order PDE whose analytical solution is known. gPINN is recommended for problems requiring high accuracy in gradient fields or operating with sparse data, whereas standard PINN is advised for strongly nonlinear or computationally constrained scenarios. We synthesize our findings into a practical selection guide; gPINN is recommended for problems requiring high accuracy in gradient fields or operating with sparse data, whereas standard PINN is advised for strongly nonlinear or computationally constrained scenarios. This framework provides a clear, evidence-based policy for algorithm choice in SciML. Beyond numerical comparison, we provide an analytical interpretation linking solver performance to the spectral and stiffness properties of each PDE class, offering a principled basis for algorithm selection.</description>
	<pubDate>2026-02-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 26: A Benchmarking Study for Algorithm Selection in Scientific Machine Learning (SciML): PINN vs. gPINN for Solving Partial Differential Equations</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/26">doi: 10.3390/appliedmath6020026</a></p>
	<p>Authors:
		Muhammad Azam
		Imran Shabir Chuhan
		Muhammad Shafiq Ahmed
		Kaleem Arshid
		</p>
	<p>Recent advances in physics-informed neural networks (PINN) have highlighted the need for systematic criteria for selecting appropriate algorithms to solve differential equations. This paper presents a numerical comparison between standard PINNs and gradient-enhanced PINNs (gPINNs) used to solve a high-order partial differential equations (PDE). To verify the accuracy and convergence behavior of all the methods, we solve a fourth-order PDE whose analytical solution is known. gPINN is recommended for problems requiring high accuracy in gradient fields or operating with sparse data, whereas standard PINN is advised for strongly nonlinear or computationally constrained scenarios. We synthesize our findings into a practical selection guide; gPINN is recommended for problems requiring high accuracy in gradient fields or operating with sparse data, whereas standard PINN is advised for strongly nonlinear or computationally constrained scenarios. This framework provides a clear, evidence-based policy for algorithm choice in SciML. Beyond numerical comparison, we provide an analytical interpretation linking solver performance to the spectral and stiffness properties of each PDE class, offering a principled basis for algorithm selection.</p>
	]]></content:encoded>

	<dc:title>A Benchmarking Study for Algorithm Selection in Scientific Machine Learning (SciML): PINN vs. gPINN for Solving Partial Differential Equations</dc:title>
			<dc:creator>Muhammad Azam</dc:creator>
			<dc:creator>Imran Shabir Chuhan</dc:creator>
			<dc:creator>Muhammad Shafiq Ahmed</dc:creator>
			<dc:creator>Kaleem Arshid</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020026</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-09</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-09</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>26</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020026</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/26</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/25">

	<title>AppliedMath, Vol. 6, Pages 25: The Chain Rule for Fractional-Order Derivatives: Theories, Challenges, and Unifying Directions</title>
	<link>https://www.mdpi.com/2673-9909/6/2/25</link>
	<description>The chain rule is a foundational concept in calculus, critical for differentiating composite functions, especially those appearing in modern AI techniques. Its extension to fractional calculus presents challenges due to the integral-based nature and intrinsic memory effects of these fractional operators. This survey provides a review of chain-rule formulations across major known FDs, including Riemann-Liouville (RL), Caputo, Caputo-Fabrizio (CF), Atangana-Baleanu-Riemann (ABR), Atangana-Baleanu-Caputo (ABC), and Caputo-Fabrizio with Gaussian kernel (CFG). The main contribution here is the introduction of a unified criterion, denoted as C, which synthesizes and extends previous classification frameworks for systematically formulating the chain rule across different operators. Each chain rule is examined in terms of its derivation, operator structure, and scope of applicability. In addition, the survey analyzes series-based approximations that appear in computing these derivatives, highlighting the minimum number of terms required to achieve acceptable mean absolute error (MAE). By consolidating theoretical developments, derivation methods, and numerical strategies, this paper provides a comprehensive resource for researchers and practitioners working with fractional-order models.</description>
	<pubDate>2026-02-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 25: The Chain Rule for Fractional-Order Derivatives: Theories, Challenges, and Unifying Directions</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/25">doi: 10.3390/appliedmath6020025</a></p>
	<p>Authors:
		Sroor M. Elnady
		Mohamed A. El-Beltagy
		Mohammed E. Fouda
		Ahmed G. Radwan
		</p>
	<p>The chain rule is a foundational concept in calculus, critical for differentiating composite functions, especially those appearing in modern AI techniques. Its extension to fractional calculus presents challenges due to the integral-based nature and intrinsic memory effects of these fractional operators. This survey provides a review of chain-rule formulations across major known FDs, including Riemann-Liouville (RL), Caputo, Caputo-Fabrizio (CF), Atangana-Baleanu-Riemann (ABR), Atangana-Baleanu-Caputo (ABC), and Caputo-Fabrizio with Gaussian kernel (CFG). The main contribution here is the introduction of a unified criterion, denoted as C, which synthesizes and extends previous classification frameworks for systematically formulating the chain rule across different operators. Each chain rule is examined in terms of its derivation, operator structure, and scope of applicability. In addition, the survey analyzes series-based approximations that appear in computing these derivatives, highlighting the minimum number of terms required to achieve acceptable mean absolute error (MAE). By consolidating theoretical developments, derivation methods, and numerical strategies, this paper provides a comprehensive resource for researchers and practitioners working with fractional-order models.</p>
	]]></content:encoded>

	<dc:title>The Chain Rule for Fractional-Order Derivatives: Theories, Challenges, and Unifying Directions</dc:title>
			<dc:creator>Sroor M. Elnady</dc:creator>
			<dc:creator>Mohamed A. El-Beltagy</dc:creator>
			<dc:creator>Mohammed E. Fouda</dc:creator>
			<dc:creator>Ahmed G. Radwan</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020025</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-09</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-09</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>25</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020025</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/25</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/24">

	<title>AppliedMath, Vol. 6, Pages 24: On the Use of the Quantum Alternating Operator Ansatz in Quantum-Informed Recursive Optimization: A Case Study on the Minimum Vertex Cover</title>
	<link>https://www.mdpi.com/2673-9909/6/2/24</link>
	<description>In recent years, several quantum algorithms have been proposed for addressing combinatorial optimization problems. Among them, the Quantum Approximate Optimization Algorithm (QAOA) has become a widely used approach. However, reported limitations of QAOA have motivated the development of multiple algorithmic variants, including recursive hybrid methods such as the Recursive Quantum Approximate Optimization Algorithm (RQAOA), as well as the Quantum-Informed Recursive Optimization (QIRO) framework. In this work, we integrate the Quantum Alternating Operator Ansatz within the QIRO framework in order to improve its quantum inference stage. Both the original and the enhanced versions of QIRO are applied to the Minimum Vertex Cover problem, an NP-complete problem of practical relevance. Performance is evaluated on a benchmark of Erd&amp;amp;ouml;s-R&amp;amp;eacute;nyi graph instances with varying sizes, densities, and random seeds. The results show that the proposed modification leads to a higher number of successfully solved instances across the considered benchmark, indicating that refinements of the variational layer can improve the effectiveness of the QIRO framework.</description>
	<pubDate>2026-02-06</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 24: On the Use of the Quantum Alternating Operator Ansatz in Quantum-Informed Recursive Optimization: A Case Study on the Minimum Vertex Cover</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/24">doi: 10.3390/appliedmath6020024</a></p>
	<p>Authors:
		Pablo Ramos-Ruiz
		Antonio Miguel Fuentes-Jiménez
		José E. Ramos-Ruiz
		Inmaculada Jiménez-Manchado
		</p>
	<p>In recent years, several quantum algorithms have been proposed for addressing combinatorial optimization problems. Among them, the Quantum Approximate Optimization Algorithm (QAOA) has become a widely used approach. However, reported limitations of QAOA have motivated the development of multiple algorithmic variants, including recursive hybrid methods such as the Recursive Quantum Approximate Optimization Algorithm (RQAOA), as well as the Quantum-Informed Recursive Optimization (QIRO) framework. In this work, we integrate the Quantum Alternating Operator Ansatz within the QIRO framework in order to improve its quantum inference stage. Both the original and the enhanced versions of QIRO are applied to the Minimum Vertex Cover problem, an NP-complete problem of practical relevance. Performance is evaluated on a benchmark of Erd&amp;amp;ouml;s-R&amp;amp;eacute;nyi graph instances with varying sizes, densities, and random seeds. The results show that the proposed modification leads to a higher number of successfully solved instances across the considered benchmark, indicating that refinements of the variational layer can improve the effectiveness of the QIRO framework.</p>
	]]></content:encoded>

	<dc:title>On the Use of the Quantum Alternating Operator Ansatz in Quantum-Informed Recursive Optimization: A Case Study on the Minimum Vertex Cover</dc:title>
			<dc:creator>Pablo Ramos-Ruiz</dc:creator>
			<dc:creator>Antonio Miguel Fuentes-Jiménez</dc:creator>
			<dc:creator>José E. Ramos-Ruiz</dc:creator>
			<dc:creator>Inmaculada Jiménez-Manchado</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020024</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-06</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-06</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>24</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020024</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/24</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/23">

	<title>AppliedMath, Vol. 6, Pages 23: Optimizing the Bounds of Neural Networks Using a Novel Simulated Annealing Method</title>
	<link>https://www.mdpi.com/2673-9909/6/2/23</link>
	<description>Artificial neural networks are reliable machine learning models that have been applied to a multitude of practical and scientific applications in recent decades. Among these applications, there are examples from the areas of physics, chemistry, medicine, etc. To effectively apply them to these problems, it is necessary to adapt their parameters using optimization techniques. However, in order to be effective, optimization techniques must know the range of values for the parameters of the artificial neural network, so that they can adequately train the artificial neural network. In most cases, this is not possible, as these ranges are also significantly affected by the inputs to the artificial neural network from the objective problem it is called upon to solve. This situation usually results in artificial neural networks becoming trapped in local minima of the error function or, even worse, in the phenomenon of overfitting, where although the training error achieves low values, the artificial neural network exhibits low performance in the corresponding test set. To address this limitation, this work proposes a novel two-stage training approach in which a simulated annealing (SA)-based preprocessing stage is employed to automatically identify optimal parameter value intervals before the application of any optimization method to train the neural network. Unlike similar approaches that rely on fixed or heuristically selected parameter bounds, the proposed preprocessing technique explores the parameter space probabilistically, guided by a temperature-controlled acceptance mechanism that balances global exploration and local refinement. The proposed method has been successfully applied to a wide range of classification and regression problems and comparative results are presented in detail in the present work.</description>
	<pubDate>2026-02-06</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 23: Optimizing the Bounds of Neural Networks Using a Novel Simulated Annealing Method</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/23">doi: 10.3390/appliedmath6020023</a></p>
	<p>Authors:
		Ioannis G. Tsoulos
		Vasileios Charilogis
		Dimitrios Tsalikakis
		</p>
	<p>Artificial neural networks are reliable machine learning models that have been applied to a multitude of practical and scientific applications in recent decades. Among these applications, there are examples from the areas of physics, chemistry, medicine, etc. To effectively apply them to these problems, it is necessary to adapt their parameters using optimization techniques. However, in order to be effective, optimization techniques must know the range of values for the parameters of the artificial neural network, so that they can adequately train the artificial neural network. In most cases, this is not possible, as these ranges are also significantly affected by the inputs to the artificial neural network from the objective problem it is called upon to solve. This situation usually results in artificial neural networks becoming trapped in local minima of the error function or, even worse, in the phenomenon of overfitting, where although the training error achieves low values, the artificial neural network exhibits low performance in the corresponding test set. To address this limitation, this work proposes a novel two-stage training approach in which a simulated annealing (SA)-based preprocessing stage is employed to automatically identify optimal parameter value intervals before the application of any optimization method to train the neural network. Unlike similar approaches that rely on fixed or heuristically selected parameter bounds, the proposed preprocessing technique explores the parameter space probabilistically, guided by a temperature-controlled acceptance mechanism that balances global exploration and local refinement. The proposed method has been successfully applied to a wide range of classification and regression problems and comparative results are presented in detail in the present work.</p>
	]]></content:encoded>

	<dc:title>Optimizing the Bounds of Neural Networks Using a Novel Simulated Annealing Method</dc:title>
			<dc:creator>Ioannis G. Tsoulos</dc:creator>
			<dc:creator>Vasileios Charilogis</dc:creator>
			<dc:creator>Dimitrios Tsalikakis</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020023</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-06</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-06</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>23</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020023</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/23</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/22">

	<title>AppliedMath, Vol. 6, Pages 22: Mathematical Approaches for the Characterization and Analysis of Molecular Markers in the Study of the Progression and Severity of Amyotrophic Lateral Sclerosis</title>
	<link>https://www.mdpi.com/2673-9909/6/2/22</link>
	<description>Amyotrophic Lateral Sclerosis (ALS) is a progressive neurodegenerative disorder for which despite its severity, no validated biomarker currently exists to support early diagnosis, limiting therapeutic effectiveness and patient survival. In this context, mathematical modeling therefore becomes essential: it allows us to maximize the information obtainable from a limited number of samples, identify patterns that may not be directly observable, and estimate the relative contribution of different molecular markers to ALS progression. In this work, we propose methods for qualitatively and quantitatively evaluating the relevance of selected biomarkers in ALS classification and disease-state identification and laying the foundations for the definition of a protocol useful for constructing &amp;amp;ldquo;digital twins&amp;amp;rdquo; of the entire process of study, diagnosis, and treatment of the disease from the perspective of innovative precision medicine.</description>
	<pubDate>2026-02-05</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 22: Mathematical Approaches for the Characterization and Analysis of Molecular Markers in the Study of the Progression and Severity of Amyotrophic Lateral Sclerosis</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/22">doi: 10.3390/appliedmath6020022</a></p>
	<p>Authors:
		Luisa Carracciuolo
		Ugo D’Amora
		Raffaele Dubbioso
		Ines Fasolino
		</p>
	<p>Amyotrophic Lateral Sclerosis (ALS) is a progressive neurodegenerative disorder for which despite its severity, no validated biomarker currently exists to support early diagnosis, limiting therapeutic effectiveness and patient survival. In this context, mathematical modeling therefore becomes essential: it allows us to maximize the information obtainable from a limited number of samples, identify patterns that may not be directly observable, and estimate the relative contribution of different molecular markers to ALS progression. In this work, we propose methods for qualitatively and quantitatively evaluating the relevance of selected biomarkers in ALS classification and disease-state identification and laying the foundations for the definition of a protocol useful for constructing &amp;amp;ldquo;digital twins&amp;amp;rdquo; of the entire process of study, diagnosis, and treatment of the disease from the perspective of innovative precision medicine.</p>
	]]></content:encoded>

	<dc:title>Mathematical Approaches for the Characterization and Analysis of Molecular Markers in the Study of the Progression and Severity of Amyotrophic Lateral Sclerosis</dc:title>
			<dc:creator>Luisa Carracciuolo</dc:creator>
			<dc:creator>Ugo D’Amora</dc:creator>
			<dc:creator>Raffaele Dubbioso</dc:creator>
			<dc:creator>Ines Fasolino</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020022</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-05</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-05</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>22</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020022</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/22</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/21">

	<title>AppliedMath, Vol. 6, Pages 21: Fifth-Order Block Hybrid Approach for Solving First-Order Stiff Ordinary Differential Equations</title>
	<link>https://www.mdpi.com/2673-9909/6/2/21</link>
	<description>This study introduces a novel single-step hybrid block method with three intra-step points that attains fifth-order accuracy, offering an accurate and computationally economical tool for solving first-order differential equations. The method is specifically designed to handle first-order differential equations with efficiency and precision while employing a constant step size throughout the computation. To further enhance accuracy, interpolation techniques are incorporated to approximate function values at specific positions, addressing the fundamental properties of the method and verifying its mathematical soundness. These analyses confirm that the scheme satisfies the essential requirements of stability, consistency, and convergence, ensuring reliability in practical applications. In addition, the method demonstrates strong adaptability, making it suitable for a broad spectrum of problem settings that involve both stiff and non-stiff systems. Numerical experiments are carried out, and the results consistently demonstrate that the proposed method is robust and effective under various test cases. The outcomes further reveal that it frequently outperforms several existing numerical approaches in terms of both accuracy and computational efficiency.</description>
	<pubDate>2026-02-05</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 21: Fifth-Order Block Hybrid Approach for Solving First-Order Stiff Ordinary Differential Equations</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/21">doi: 10.3390/appliedmath6020021</a></p>
	<p>Authors:
		Ibrahim Mohammed Dibal
		Yeak Su Hoe
		</p>
	<p>This study introduces a novel single-step hybrid block method with three intra-step points that attains fifth-order accuracy, offering an accurate and computationally economical tool for solving first-order differential equations. The method is specifically designed to handle first-order differential equations with efficiency and precision while employing a constant step size throughout the computation. To further enhance accuracy, interpolation techniques are incorporated to approximate function values at specific positions, addressing the fundamental properties of the method and verifying its mathematical soundness. These analyses confirm that the scheme satisfies the essential requirements of stability, consistency, and convergence, ensuring reliability in practical applications. In addition, the method demonstrates strong adaptability, making it suitable for a broad spectrum of problem settings that involve both stiff and non-stiff systems. Numerical experiments are carried out, and the results consistently demonstrate that the proposed method is robust and effective under various test cases. The outcomes further reveal that it frequently outperforms several existing numerical approaches in terms of both accuracy and computational efficiency.</p>
	]]></content:encoded>

	<dc:title>Fifth-Order Block Hybrid Approach for Solving First-Order Stiff Ordinary Differential Equations</dc:title>
			<dc:creator>Ibrahim Mohammed Dibal</dc:creator>
			<dc:creator>Yeak Su Hoe</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020021</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-05</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-05</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>21</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020021</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/21</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/20">

	<title>AppliedMath, Vol. 6, Pages 20: Enhanced Assumption-Aware Linear Discriminant Analysis for the Wisconsin Breast Cancer Dataset: A Guide to Dimensionality Reduction and Prediction with Performance Comparable to Machine Learning Methods</title>
	<link>https://www.mdpi.com/2673-9909/6/2/20</link>
	<description>The analysis of multivariate data is a central issue in biomedical research, where the accurate classification of patients and the extraction of reliable conclusions are of critical importance. Linear Discriminant Analysis (LDA) remains one of the most established methods for both dimensionality reduction and classification of data. In this paper, we examine in detail the theoretical foundations, assumptions, and statistical properties of LDA, and apply the method step by step to real data from the Breast Cancer Wisconsin (Diagnostic) database, which includes cellular features from breast biopsy samples with the aim of distinguishing benign from malignant tumors. Emphasis is placed on the importance of the method&amp;amp;rsquo;s assumptions, such as multivariate normality, equality of covariance matrices, and absence of multicollinearity, demonstrating that their fulfillment leads to significant improvements in model performance. Specifically, careful preprocessing and strict adherence to these assumptions increase classification accuracy from 95.6% (94.7% cross-validated) to 97.8% (97.4% cross-validated). To our knowledge, this study is the first to demonstrate the dual use of LDA as both a dimensionality-reduction tool and a predictive classification model for this medical database within the same biomedical analysis framework. Moreover, we provide, for the first time, a systematic comparison between our assumption-aware LDA model and related studies employing the most accurate machine-learning classifiers reported in the literature for this dataset, showing that classical LDA achieves accuracy comparable to these more complex methods. The resulting discriminant model, which uses 13 variables out of the original 30, can be applied easily by clinical researchers to classify new cases as benign or malignant, while simultaneously providing interpretable coefficients that reveal the underlying relationships among variables. The implementation is carried out in the SPSS environment, following the theoretical steps described in the paper, thus offering a user-friendly and reproducible framework for reliable application. In addition, the study establishes a structured and transparent workflow for the proper application of LDA in biomedical research by explicitly linking assumption verification, preprocessing, dimensionality reduction, and classification.</description>
	<pubDate>2026-02-03</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 20: Enhanced Assumption-Aware Linear Discriminant Analysis for the Wisconsin Breast Cancer Dataset: A Guide to Dimensionality Reduction and Prediction with Performance Comparable to Machine Learning Methods</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/20">doi: 10.3390/appliedmath6020020</a></p>
	<p>Authors:
		Vasiliki Pantoula
		Vasileios Mandikas
		Tryfon Daras
		</p>
	<p>The analysis of multivariate data is a central issue in biomedical research, where the accurate classification of patients and the extraction of reliable conclusions are of critical importance. Linear Discriminant Analysis (LDA) remains one of the most established methods for both dimensionality reduction and classification of data. In this paper, we examine in detail the theoretical foundations, assumptions, and statistical properties of LDA, and apply the method step by step to real data from the Breast Cancer Wisconsin (Diagnostic) database, which includes cellular features from breast biopsy samples with the aim of distinguishing benign from malignant tumors. Emphasis is placed on the importance of the method&amp;amp;rsquo;s assumptions, such as multivariate normality, equality of covariance matrices, and absence of multicollinearity, demonstrating that their fulfillment leads to significant improvements in model performance. Specifically, careful preprocessing and strict adherence to these assumptions increase classification accuracy from 95.6% (94.7% cross-validated) to 97.8% (97.4% cross-validated). To our knowledge, this study is the first to demonstrate the dual use of LDA as both a dimensionality-reduction tool and a predictive classification model for this medical database within the same biomedical analysis framework. Moreover, we provide, for the first time, a systematic comparison between our assumption-aware LDA model and related studies employing the most accurate machine-learning classifiers reported in the literature for this dataset, showing that classical LDA achieves accuracy comparable to these more complex methods. The resulting discriminant model, which uses 13 variables out of the original 30, can be applied easily by clinical researchers to classify new cases as benign or malignant, while simultaneously providing interpretable coefficients that reveal the underlying relationships among variables. The implementation is carried out in the SPSS environment, following the theoretical steps described in the paper, thus offering a user-friendly and reproducible framework for reliable application. In addition, the study establishes a structured and transparent workflow for the proper application of LDA in biomedical research by explicitly linking assumption verification, preprocessing, dimensionality reduction, and classification.</p>
	]]></content:encoded>

	<dc:title>Enhanced Assumption-Aware Linear Discriminant Analysis for the Wisconsin Breast Cancer Dataset: A Guide to Dimensionality Reduction and Prediction with Performance Comparable to Machine Learning Methods</dc:title>
			<dc:creator>Vasiliki Pantoula</dc:creator>
			<dc:creator>Vasileios Mandikas</dc:creator>
			<dc:creator>Tryfon Daras</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020020</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-03</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-03</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>20</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020020</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/20</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2673-9909/6/2/19">

	<title>AppliedMath, Vol. 6, Pages 19: Inforpower: Quantifying the Informational Power of Probability Distributions</title>
	<link>https://www.mdpi.com/2673-9909/6/2/19</link>
	<description>In many scientific and engineering fields (e.g., measurement science), a probability density function often models a system comprising a signal embedded in noise. Conventional measures, such as the mean, variance, entropy, and informity, characterize signal strength and uncertainty (or noise level) separately. However, the true performance of a system depends on the interaction between signal and noise. In this paper, we propose a novel measure, called &amp;amp;ldquo;inforpower&amp;amp;rdquo;, for quantifying the system&amp;amp;rsquo;s informational power that explicitly captures the interaction between signal and noise. We also propose a new measure of central tendency, called &amp;amp;ldquo;information-energy center&amp;amp;rdquo;. Closed-form expressions for inforpower and information-energy center are provided for ten well known continuous distributions. Moreover, we propose a maximum inforpower criterion, which can complement the Akaike information criterion (AIC), the minimum entropy criterion, and the maximum informity criterion for selecting the best distribution from a set of candidate distributions. Two examples (synthetic Weibull distribution data and Tana River annual maximum streamflow) are presented to demonstrate the effectiveness of the proposed maximum inforpower criterion and compare it with existing goodness-of-fit criteria.</description>
	<pubDate>2026-02-02</pubDate>

	<content:encoded><![CDATA[
	<p><b>AppliedMath, Vol. 6, Pages 19: Inforpower: Quantifying the Informational Power of Probability Distributions</b></p>
	<p>AppliedMath <a href="https://www.mdpi.com/2673-9909/6/2/19">doi: 10.3390/appliedmath6020019</a></p>
	<p>Authors:
		Hening Huang
		</p>
	<p>In many scientific and engineering fields (e.g., measurement science), a probability density function often models a system comprising a signal embedded in noise. Conventional measures, such as the mean, variance, entropy, and informity, characterize signal strength and uncertainty (or noise level) separately. However, the true performance of a system depends on the interaction between signal and noise. In this paper, we propose a novel measure, called &amp;amp;ldquo;inforpower&amp;amp;rdquo;, for quantifying the system&amp;amp;rsquo;s informational power that explicitly captures the interaction between signal and noise. We also propose a new measure of central tendency, called &amp;amp;ldquo;information-energy center&amp;amp;rdquo;. Closed-form expressions for inforpower and information-energy center are provided for ten well known continuous distributions. Moreover, we propose a maximum inforpower criterion, which can complement the Akaike information criterion (AIC), the minimum entropy criterion, and the maximum informity criterion for selecting the best distribution from a set of candidate distributions. Two examples (synthetic Weibull distribution data and Tana River annual maximum streamflow) are presented to demonstrate the effectiveness of the proposed maximum inforpower criterion and compare it with existing goodness-of-fit criteria.</p>
	]]></content:encoded>

	<dc:title>Inforpower: Quantifying the Informational Power of Probability Distributions</dc:title>
			<dc:creator>Hening Huang</dc:creator>
		<dc:identifier>doi: 10.3390/appliedmath6020019</dc:identifier>
	<dc:source>AppliedMath</dc:source>
	<dc:date>2026-02-02</dc:date>

	<prism:publicationName>AppliedMath</prism:publicationName>
	<prism:publicationDate>2026-02-02</prism:publicationDate>
	<prism:volume>6</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>19</prism:startingPage>
		<prism:doi>10.3390/appliedmath6020019</prism:doi>
	<prism:url>https://www.mdpi.com/2673-9909/6/2/19</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
    
<cc:License rdf:about="https://creativecommons.org/licenses/by/4.0/">
	<cc:permits rdf:resource="https://creativecommons.org/ns#Reproduction" />
	<cc:permits rdf:resource="https://creativecommons.org/ns#Distribution" />
	<cc:permits rdf:resource="https://creativecommons.org/ns#DerivativeWorks" />
</cc:License>

</rdf:RDF>
