<?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/csmf">
		<title>Computer Sciences &amp; Mathematics Forum</title>
		<description>Latest open access articles published in Comput. Sci. Math. Forum at https://www.mdpi.com/journal/csmf</description>
		<link>https://www.mdpi.com/journal/csmf</link>
		<admin:generatorAgent rdf:resource="https://www.mdpi.com/journal/csmf"/>
		<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?1778581344"/>
				<items>
			<rdf:Seq>
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/13/1/12" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/13/1/11" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/13/1/10" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/13/1/7" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/13/1/8" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/13/1/6" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/13/1/5" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/13/1/9" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/13/1/4" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/13/1/3" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/13/1/2" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/13/1/1" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/19" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/18" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/17" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/38" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/16" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/15" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/14" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/13" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/12" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/11" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/10" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/5" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/9" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/8" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/7" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/6" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/4" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/3" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/2" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/12/1/1" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/33" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/32" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/31" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/30" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/29" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/27" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/20" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/19" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/26" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/25" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/24" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/23" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/22" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/21" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/17" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/16" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/15" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/14" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/11" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/37" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/36" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/35" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/34" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/18" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/12" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/7" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/13" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/10" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/9" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/8" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/28" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/6" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/5" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/4" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/3" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/18" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/2" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/17" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/11/1/1" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/14" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/13" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/12" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/11" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/10" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/9" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/7" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/2" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/1" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/16" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/15" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/8" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/6" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/5" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/4" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/10/1/3" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/8/1/99" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/9/1/6" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/8/1/98" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/9/1/4" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/9/1/5" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/8/1/96" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/8/1/97" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/9/1/3" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/8/1/95" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/9/1/2" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/9/1/1" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/8/1/93" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2813-0324/8/1/94" />
                    	</rdf:Seq>
		</items>
				<cc:license rdf:resource="https://creativecommons.org/licenses/by/4.0/" />
	</channel>

        <item rdf:about="https://www.mdpi.com/2813-0324/13/1/12">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 12: Explainable Intrusion Detection System Using Prototypical Network and Recursive Feature Elimination</title>
	<link>https://www.mdpi.com/2813-0324/13/1/12</link>
	<description>This study explores the use of traditional machine learning and deep learning algorithms to develop efficient Intrusion Detection Systems (IDSs). It evaluates data using the NSL-KDD dataset, which contains both normal and attack traffic. The research compares the performance of various classifiers, including Random Forest, Extreme Gradient Boosting, LightGBM, and Prototypical Networks. Recursive Feature Elimination is used for feature selection to enhance decision-making and model performance. The models are assessed using multiple metrics, such as accuracy, precision, recall, F-score, ROC curves, and confusion matrices. In addition, Explainable AI techniques like SHAP and LIME are employed to interpret predictions, making the IDS more transparent and reliable. Results indicate that few-shot learning models, particularly Prototypical Networks, combined with Recursive Feature Elimination techniques, outperform traditional models, achieving up to 98% accuracy. This approach enhances IDS applications in IoT by enabling more accurate threat detection, improving decision-making, and identifying key intrusion parameters.</description>
	<pubDate>2026-04-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 12: Explainable Intrusion Detection System Using Prototypical Network and Recursive Feature Elimination</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/13/1/12">doi: 10.3390/cmsf2026013012</a></p>
	<p>Authors:
		Wessam F. Abouzaid
		Ebrahim A. Ramadan
		Nermeen G. Rezk
		</p>
	<p>This study explores the use of traditional machine learning and deep learning algorithms to develop efficient Intrusion Detection Systems (IDSs). It evaluates data using the NSL-KDD dataset, which contains both normal and attack traffic. The research compares the performance of various classifiers, including Random Forest, Extreme Gradient Boosting, LightGBM, and Prototypical Networks. Recursive Feature Elimination is used for feature selection to enhance decision-making and model performance. The models are assessed using multiple metrics, such as accuracy, precision, recall, F-score, ROC curves, and confusion matrices. In addition, Explainable AI techniques like SHAP and LIME are employed to interpret predictions, making the IDS more transparent and reliable. Results indicate that few-shot learning models, particularly Prototypical Networks, combined with Recursive Feature Elimination techniques, outperform traditional models, achieving up to 98% accuracy. This approach enhances IDS applications in IoT by enabling more accurate threat detection, improving decision-making, and identifying key intrusion parameters.</p>
	]]></content:encoded>

	<dc:title>Explainable Intrusion Detection System Using Prototypical Network and Recursive Feature Elimination</dc:title>
			<dc:creator>Wessam F. Abouzaid</dc:creator>
			<dc:creator>Ebrahim A. Ramadan</dc:creator>
			<dc:creator>Nermeen G. Rezk</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2026013012</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-04-22</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-04-22</prism:publicationDate>
	<prism:volume>13</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>12</prism:startingPage>
		<prism:doi>10.3390/cmsf2026013012</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/13/1/12</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/13/1/11">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 11: A Computational Model for Animal Language Processing: Translating Canine and Feline Behavior into Human-Readable Communication</title>
	<link>https://www.mdpi.com/2813-0324/13/1/11</link>
	<description>Humans have always been curious about what animals are trying to communicate, especially our closest companions—dogs and cats. While we often rely on instinct and observation to understand their needs and feelings, this method can be inaccurate or limited. This research introduces a new computational model designed to translate the behaviors of dogs and cats into simple, human-readable messages. By combining data from their body language, sounds, facial expressions, and movements, the model uses advanced machine learning and deep learning techniques to identify what the animal might be feeling or trying to express. We collect and analyze real-world behavioral data from pets, then train the system to interpret signals like barking, meowing, tail movements, or posture changes. The final output could be a sentence or voice alert that helps pet owners understand things like “I’m hungry,” “I’m scared,” or “I want to play.” This approach not only improves how we care for pets but also enhances emotional connection and communication between humans and animals. It opens new doors for technology in pet care, training, and veterinary support.</description>
	<pubDate>2026-04-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 11: A Computational Model for Animal Language Processing: Translating Canine and Feline Behavior into Human-Readable Communication</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/13/1/11">doi: 10.3390/cmsf2026013011</a></p>
	<p>Authors:
		Deepa Sonal
		Md Alimul Haque
		Sultan Ahmad
		Sultan Alqahtani
		A. E. M. Eljialy
		</p>
	<p>Humans have always been curious about what animals are trying to communicate, especially our closest companions—dogs and cats. While we often rely on instinct and observation to understand their needs and feelings, this method can be inaccurate or limited. This research introduces a new computational model designed to translate the behaviors of dogs and cats into simple, human-readable messages. By combining data from their body language, sounds, facial expressions, and movements, the model uses advanced machine learning and deep learning techniques to identify what the animal might be feeling or trying to express. We collect and analyze real-world behavioral data from pets, then train the system to interpret signals like barking, meowing, tail movements, or posture changes. The final output could be a sentence or voice alert that helps pet owners understand things like “I’m hungry,” “I’m scared,” or “I want to play.” This approach not only improves how we care for pets but also enhances emotional connection and communication between humans and animals. It opens new doors for technology in pet care, training, and veterinary support.</p>
	]]></content:encoded>

	<dc:title>A Computational Model for Animal Language Processing: Translating Canine and Feline Behavior into Human-Readable Communication</dc:title>
			<dc:creator>Deepa Sonal</dc:creator>
			<dc:creator>Md Alimul Haque</dc:creator>
			<dc:creator>Sultan Ahmad</dc:creator>
			<dc:creator>Sultan Alqahtani</dc:creator>
			<dc:creator>A. E. M. Eljialy</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2026013011</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-04-17</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-04-17</prism:publicationDate>
	<prism:volume>13</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>11</prism:startingPage>
		<prism:doi>10.3390/cmsf2026013011</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/13/1/11</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/13/1/10">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 10: Heterogeneous Federated Learning Model for Recognizing Human Activity</title>
	<link>https://www.mdpi.com/2813-0324/13/1/10</link>
	<description>A range of sensors are used by human activity recognition (HAR) to identify the activities that people complete each day. The recognition of human activities has benefited greatly from machine learning (ML), as it has made many human activities more easily recorded. Unfortunately, a centralized approach is used in many HAR applications, which might compromise user privacy. One must use deep learning (DL) using different algorithms and models to analyze the data generated from ML. Another kind of ML is distributed ML, called federated learning (FL), which tries to distribute ML models across edge devices. Thus, this study presents an FL model to support HAR by building a generic model and using user-based training data without data sharing. Through developing heterogeneous local models, each client takes the most suitable DL model to the client. This study uses three different DL models to develop the local model: Convolutional Neural Network (CNN), Residual Network (ResNet), and Long Short-term Memory (LSTM). Moreover, different numbers of clients are experimented with: two, five, and ten clients. The UniMiB SHAR dataset is used to apply the experiments. As a result, using five clients with three mixed DL models gives the highest Accuracy of 90.8%.</description>
	<pubDate>2026-04-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 10: Heterogeneous Federated Learning Model for Recognizing Human Activity</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/13/1/10">doi: 10.3390/cmsf2026013010</a></p>
	<p>Authors:
		Nwadher S. Alblihed
		Dina M. Ibrahim
		</p>
	<p>A range of sensors are used by human activity recognition (HAR) to identify the activities that people complete each day. The recognition of human activities has benefited greatly from machine learning (ML), as it has made many human activities more easily recorded. Unfortunately, a centralized approach is used in many HAR applications, which might compromise user privacy. One must use deep learning (DL) using different algorithms and models to analyze the data generated from ML. Another kind of ML is distributed ML, called federated learning (FL), which tries to distribute ML models across edge devices. Thus, this study presents an FL model to support HAR by building a generic model and using user-based training data without data sharing. Through developing heterogeneous local models, each client takes the most suitable DL model to the client. This study uses three different DL models to develop the local model: Convolutional Neural Network (CNN), Residual Network (ResNet), and Long Short-term Memory (LSTM). Moreover, different numbers of clients are experimented with: two, five, and ten clients. The UniMiB SHAR dataset is used to apply the experiments. As a result, using five clients with three mixed DL models gives the highest Accuracy of 90.8%.</p>
	]]></content:encoded>

	<dc:title>Heterogeneous Federated Learning Model for Recognizing Human Activity</dc:title>
			<dc:creator>Nwadher S. Alblihed</dc:creator>
			<dc:creator>Dina M. Ibrahim</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2026013010</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-04-17</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-04-17</prism:publicationDate>
	<prism:volume>13</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>10</prism:startingPage>
		<prism:doi>10.3390/cmsf2026013010</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/13/1/10</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/13/1/7">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 7: Energy-Aware Bid-Based Client Selection for Federated Learning in Resource-Constrained IoT Networks</title>
	<link>https://www.mdpi.com/2813-0324/13/1/7</link>
	<description>Federated learning (FL) enables distributed IoT devices to train machine learning models collaboratively without sharing raw data. However, energy heterogeneity among devices significantly challenges efficient and equitable participation, particularly in resource-constrained networks. This paper introduces BEAF (Bid-based Energy-Aware Federated Learning), a client selection strategy that incorporates the availability of energy and the training utility of the device into a unified selection criterion. Each client independently computes a bid score based on its remaining energy and the relative improvement in local training loss. Clients with the highest utility-per-joule scores are selected to participate in each round. The approach operates without centralized profiling or historical coordination and is compatible with synchronous FL protocols. The evaluation of standard benchmarks shows that BEAF enhances the precision of the global model, reduces total energy consumption, and improves fairness in client participation compared to baseline methods, such as random sampling and selection based on energy thresholds. The method is suitable for deployment in energy-limited environments, including agricultural monitoring and other distributed sensing applications.</description>
	<pubDate>2026-04-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 7: Energy-Aware Bid-Based Client Selection for Federated Learning in Resource-Constrained IoT Networks</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/13/1/7">doi: 10.3390/cmsf2026013007</a></p>
	<p>Authors:
		Rana Albelaihi
		</p>
	<p>Federated learning (FL) enables distributed IoT devices to train machine learning models collaboratively without sharing raw data. However, energy heterogeneity among devices significantly challenges efficient and equitable participation, particularly in resource-constrained networks. This paper introduces BEAF (Bid-based Energy-Aware Federated Learning), a client selection strategy that incorporates the availability of energy and the training utility of the device into a unified selection criterion. Each client independently computes a bid score based on its remaining energy and the relative improvement in local training loss. Clients with the highest utility-per-joule scores are selected to participate in each round. The approach operates without centralized profiling or historical coordination and is compatible with synchronous FL protocols. The evaluation of standard benchmarks shows that BEAF enhances the precision of the global model, reduces total energy consumption, and improves fairness in client participation compared to baseline methods, such as random sampling and selection based on energy thresholds. The method is suitable for deployment in energy-limited environments, including agricultural monitoring and other distributed sensing applications.</p>
	]]></content:encoded>

	<dc:title>Energy-Aware Bid-Based Client Selection for Federated Learning in Resource-Constrained IoT Networks</dc:title>
			<dc:creator>Rana Albelaihi</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2026013007</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-04-17</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-04-17</prism:publicationDate>
	<prism:volume>13</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>7</prism:startingPage>
		<prism:doi>10.3390/cmsf2026013007</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/13/1/7</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/13/1/8">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 8: Spectral Analysis of Neural Network Weight Matrices and the Impact of Weight Conditioning on Optimization Performance</title>
	<link>https://www.mdpi.com/2813-0324/13/1/8</link>
	<description>This paper explores the relationship between random matrix theory (RMT) and the use of weight conditioning for training deep neural networks by employing an integrated framework. It has been shown that trained neural networks produce singular value distributions that follow universal distributions prescribed by RMT; however, the presence of non-universal outliers in the distribution can contain significant information particular to the task being performed. In addition, this research investigates how the application of diagonal row equilibration as a form of conditioning affects spectral behavior and optimization stability within deep neural networks. The results show that through conditioning, the random bulk of the singular value decomposition (SVD) spectrum is effectively compressed into a narrow band about the value 1, significantly reducing the Marchenko–Pastur bounds. The results also support the claim that weight conditioning retains the informative nature of the spectral outliers. The experimental results show that weight condition numbers (κ(W)) decreased from extremely ill-conditioned regimes of approximately 103 to 104 to almost 1.0, producing smoother training landscapes, a quicker convergence rate, and an improved ability for gradients to propagate. These results suggest that conditioning weights can be thought of as an implicit spectral regularize linking RMT evidence and concepts to the practical optimization of deep learning methods.</description>
	<pubDate>2026-04-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 8: Spectral Analysis of Neural Network Weight Matrices and the Impact of Weight Conditioning on Optimization Performance</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/13/1/8">doi: 10.3390/cmsf2026013008</a></p>
	<p>Authors:
		Abdulnaser Rashid
		</p>
	<p>This paper explores the relationship between random matrix theory (RMT) and the use of weight conditioning for training deep neural networks by employing an integrated framework. It has been shown that trained neural networks produce singular value distributions that follow universal distributions prescribed by RMT; however, the presence of non-universal outliers in the distribution can contain significant information particular to the task being performed. In addition, this research investigates how the application of diagonal row equilibration as a form of conditioning affects spectral behavior and optimization stability within deep neural networks. The results show that through conditioning, the random bulk of the singular value decomposition (SVD) spectrum is effectively compressed into a narrow band about the value 1, significantly reducing the Marchenko–Pastur bounds. The results also support the claim that weight conditioning retains the informative nature of the spectral outliers. The experimental results show that weight condition numbers (κ(W)) decreased from extremely ill-conditioned regimes of approximately 103 to 104 to almost 1.0, producing smoother training landscapes, a quicker convergence rate, and an improved ability for gradients to propagate. These results suggest that conditioning weights can be thought of as an implicit spectral regularize linking RMT evidence and concepts to the practical optimization of deep learning methods.</p>
	]]></content:encoded>

	<dc:title>Spectral Analysis of Neural Network Weight Matrices and the Impact of Weight Conditioning on Optimization Performance</dc:title>
			<dc:creator>Abdulnaser Rashid</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2026013008</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-04-16</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-04-16</prism:publicationDate>
	<prism:volume>13</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>8</prism:startingPage>
		<prism:doi>10.3390/cmsf2026013008</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/13/1/8</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/13/1/6">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 6: Encephalon_DC: Classification of Brain Diseases Using Deep Learning Techniques</title>
	<link>https://www.mdpi.com/2813-0324/13/1/6</link>
	<description>The brain is the most complex organ in the human body, and neurological disorders pose significant diagnostic challenges. This study focuses on three prevalent conditions—Alzheimer’s disease, brain tumors, and Parkinson’s disease—collectively referred to as Encephalon Diseases. We propose a three-level deep learning-based framework, termed the Encephalon Diseases Classifier, for automated diagnosis from magnetic resonance imaging (MRI) scans. In Level 1, MRI images are classified as normal or diseased. Level 2 further categorizes diseased cases into one of the three targeted conditions. Level 3 performs stage or subtype classification for Alzheimer’s disease and brain tumors. The framework employs four convolutional neural network (CNN) architectures, namely ResNet152-V2, EfficientNet-B0, DenseNet121, and VGG16, trained on a preprocessed dataset. Experimental results show that ResNet152-V2 achieves the highest accuracy of 100%, while EfficientNet-B0 and DenseNet121 yield comparable performance across all levels. The proposed method demonstrates the potential of multi-level deep learning strategies for precise and scalable Encephalon disease classification.</description>
	<pubDate>2026-04-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 6: Encephalon_DC: Classification of Brain Diseases Using Deep Learning Techniques</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/13/1/6">doi: 10.3390/cmsf2026013006</a></p>
	<p>Authors:
		Leidi M. Saleh Aouto
		Lin M. Saleh Aouto
		Rawan Khaled Flifel
		Dina M. Ibrahim
		</p>
	<p>The brain is the most complex organ in the human body, and neurological disorders pose significant diagnostic challenges. This study focuses on three prevalent conditions—Alzheimer’s disease, brain tumors, and Parkinson’s disease—collectively referred to as Encephalon Diseases. We propose a three-level deep learning-based framework, termed the Encephalon Diseases Classifier, for automated diagnosis from magnetic resonance imaging (MRI) scans. In Level 1, MRI images are classified as normal or diseased. Level 2 further categorizes diseased cases into one of the three targeted conditions. Level 3 performs stage or subtype classification for Alzheimer’s disease and brain tumors. The framework employs four convolutional neural network (CNN) architectures, namely ResNet152-V2, EfficientNet-B0, DenseNet121, and VGG16, trained on a preprocessed dataset. Experimental results show that ResNet152-V2 achieves the highest accuracy of 100%, while EfficientNet-B0 and DenseNet121 yield comparable performance across all levels. The proposed method demonstrates the potential of multi-level deep learning strategies for precise and scalable Encephalon disease classification.</p>
	]]></content:encoded>

	<dc:title>Encephalon_DC: Classification of Brain Diseases Using Deep Learning Techniques</dc:title>
			<dc:creator>Leidi M. Saleh Aouto</dc:creator>
			<dc:creator>Lin M. Saleh Aouto</dc:creator>
			<dc:creator>Rawan Khaled Flifel</dc:creator>
			<dc:creator>Dina M. Ibrahim</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2026013006</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-04-16</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-04-16</prism:publicationDate>
	<prism:volume>13</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>6</prism:startingPage>
		<prism:doi>10.3390/cmsf2026013006</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/13/1/6</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/13/1/5">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 5: Lightweight and Transparent Intrusion Detection in the Internet of Medical Things: The Role of Explainable AI</title>
	<link>https://www.mdpi.com/2813-0324/13/1/5</link>
	<description>The rise of the Internet of Medical Things (IoMT) has transformed healthcare through real-time monitoring and improved outcomes but also introduced critical security and privacy challenges. This paper presents a focused survey of Explainable AI (XAI) approaches for intrusion detection in IoMT, emphasizing methods that are lightweight, transparent, and deployable under resource constraints. We first clarify XAI terminology and taxonomy (global vs. local scope; ante hoc vs. post hoc; model-agnostic vs. model-specific) and then systematize recent works from the past five years across cybersecurity sub-domains relevant to eHealth. Representative pipelines span classical ML (e.g., LR, RF, SVM, and XGBoost) and deep models (e.g., DNNs and SRU/LSTM), with post hoc explainers, especially SHAP and LIME, dominating practice on benchmark datasets such as CICIDS2017, NSL-KDD, ToN-IoT, WUSTL-EHMS, and CICIoMT2024. Our comparative analysis highlights consistent gains from model ensembling and interpretable feature selection while uncovering key gaps: limited real-world validation, inconsistent explainability metrics, adversarial brittleness, and the computing cost of explanations at the edge.</description>
	<pubDate>2026-04-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 5: Lightweight and Transparent Intrusion Detection in the Internet of Medical Things: The Role of Explainable AI</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/13/1/5">doi: 10.3390/cmsf2026013005</a></p>
	<p>Authors:
		Rawan Abdulaziz AlRumaih
		Tarek Moulahi
		Dina M. Ibrahim
		</p>
	<p>The rise of the Internet of Medical Things (IoMT) has transformed healthcare through real-time monitoring and improved outcomes but also introduced critical security and privacy challenges. This paper presents a focused survey of Explainable AI (XAI) approaches for intrusion detection in IoMT, emphasizing methods that are lightweight, transparent, and deployable under resource constraints. We first clarify XAI terminology and taxonomy (global vs. local scope; ante hoc vs. post hoc; model-agnostic vs. model-specific) and then systematize recent works from the past five years across cybersecurity sub-domains relevant to eHealth. Representative pipelines span classical ML (e.g., LR, RF, SVM, and XGBoost) and deep models (e.g., DNNs and SRU/LSTM), with post hoc explainers, especially SHAP and LIME, dominating practice on benchmark datasets such as CICIDS2017, NSL-KDD, ToN-IoT, WUSTL-EHMS, and CICIoMT2024. Our comparative analysis highlights consistent gains from model ensembling and interpretable feature selection while uncovering key gaps: limited real-world validation, inconsistent explainability metrics, adversarial brittleness, and the computing cost of explanations at the edge.</p>
	]]></content:encoded>

	<dc:title>Lightweight and Transparent Intrusion Detection in the Internet of Medical Things: The Role of Explainable AI</dc:title>
			<dc:creator>Rawan Abdulaziz AlRumaih</dc:creator>
			<dc:creator>Tarek Moulahi</dc:creator>
			<dc:creator>Dina M. Ibrahim</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2026013005</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-04-16</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-04-16</prism:publicationDate>
	<prism:volume>13</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>5</prism:startingPage>
		<prism:doi>10.3390/cmsf2026013005</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/13/1/5</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/13/1/9">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 9: DSGCNN-DA: A Deep Stacked Graph Convolutional Neural Network with Dynamic Aggregation for Malware Behavioral Learning</title>
	<link>https://www.mdpi.com/2813-0324/13/1/9</link>
	<description>Malware remains a major threat to computer systems, posing serious risks to security and privacy by stealing sensitive data, disrupting services, and compromising system integrity. Traditional detection methods are often ineffective against rapidly evolving malware. In response, data-driven deep learning has emerged as a powerful alternative. Recent models have demonstrated promising performance in detecting malicious behavior by learning from these behavioral traces. Behavior-based detection represents a significant advancement in the fight against malware. This paper introduces a deep stacked Graph Convolutional Network (GCN) for effective malware behavioral analysis. The aggregation of multiple GCN layers and blocks results in dynamically performed Jumping Knowledge (JK) method, especially Long Short-Term Memory (LSTM). LSTM-based JK dynamically selects and weights the most informative GCN layers for each node to improve the model’s ability. Experimental results demonstrate the superior performance of our deep stacked Graph Convolutional Network with Dynamic Aggregation (DSGCN-DA) model, achieving an accuracy of 98.93% on the API-Call-Sequences dataset, outperforming the state-of-the-art approaches.</description>
	<pubDate>2026-04-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 9: DSGCNN-DA: A Deep Stacked Graph Convolutional Neural Network with Dynamic Aggregation for Malware Behavioral Learning</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/13/1/9">doi: 10.3390/cmsf2026013009</a></p>
	<p>Authors:
		Ghida Almusned
		Lama Almutairi
		Emna Benmohamed
		Rana Albelaihi
		</p>
	<p>Malware remains a major threat to computer systems, posing serious risks to security and privacy by stealing sensitive data, disrupting services, and compromising system integrity. Traditional detection methods are often ineffective against rapidly evolving malware. In response, data-driven deep learning has emerged as a powerful alternative. Recent models have demonstrated promising performance in detecting malicious behavior by learning from these behavioral traces. Behavior-based detection represents a significant advancement in the fight against malware. This paper introduces a deep stacked Graph Convolutional Network (GCN) for effective malware behavioral analysis. The aggregation of multiple GCN layers and blocks results in dynamically performed Jumping Knowledge (JK) method, especially Long Short-Term Memory (LSTM). LSTM-based JK dynamically selects and weights the most informative GCN layers for each node to improve the model’s ability. Experimental results demonstrate the superior performance of our deep stacked Graph Convolutional Network with Dynamic Aggregation (DSGCN-DA) model, achieving an accuracy of 98.93% on the API-Call-Sequences dataset, outperforming the state-of-the-art approaches.</p>
	]]></content:encoded>

	<dc:title>DSGCNN-DA: A Deep Stacked Graph Convolutional Neural Network with Dynamic Aggregation for Malware Behavioral Learning</dc:title>
			<dc:creator>Ghida Almusned</dc:creator>
			<dc:creator>Lama Almutairi</dc:creator>
			<dc:creator>Emna Benmohamed</dc:creator>
			<dc:creator>Rana Albelaihi</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2026013009</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-04-15</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-04-15</prism:publicationDate>
	<prism:volume>13</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>9</prism:startingPage>
		<prism:doi>10.3390/cmsf2026013009</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/13/1/9</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/13/1/4">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 4: Deep Learning Approaches for Efficient and Accurate DNA Sequence Alignment Using Large Language Models</title>
	<link>https://www.mdpi.com/2813-0324/13/1/4</link>
	<description>This study addresses the challenge of DNA sequence similarity analysis by combining deep learning with DNABERT embeddings. Traditional alignment methods based on direct pairwise comparisons often fail to detect deeper biological relationships beyond nucleotide matching. However, DNABERT, a large transformer-based language model, captures contextual and functional patterns within genomic data. We initially used a dataset of 20 human DNA sequences and later expanded it to 70 sequences to enhance statistical reliability. The results showed that DNABERT recovered functional similarities even between sequences with low identity percentages, revealing previously overlooked structural relationships that were hidden by traditional alignments. Quantitative evaluation using precision, recall, and F1 score confirmed the robustness and consistency of the DNABERT-based approach. Overall, this study demonstrates that combining traditional and deep learning-based methods yields a more accurate and interpretable framework for DNA sequence alignment, thereby paving the way for enhanced genomic analysis.</description>
	<pubDate>2026-04-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 4: Deep Learning Approaches for Efficient and Accurate DNA Sequence Alignment Using Large Language Models</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/13/1/4">doi: 10.3390/cmsf2026013004</a></p>
	<p>Authors:
		Shefa Alkhowaiter
		Mohamed Tahar Ben Othman
		</p>
	<p>This study addresses the challenge of DNA sequence similarity analysis by combining deep learning with DNABERT embeddings. Traditional alignment methods based on direct pairwise comparisons often fail to detect deeper biological relationships beyond nucleotide matching. However, DNABERT, a large transformer-based language model, captures contextual and functional patterns within genomic data. We initially used a dataset of 20 human DNA sequences and later expanded it to 70 sequences to enhance statistical reliability. The results showed that DNABERT recovered functional similarities even between sequences with low identity percentages, revealing previously overlooked structural relationships that were hidden by traditional alignments. Quantitative evaluation using precision, recall, and F1 score confirmed the robustness and consistency of the DNABERT-based approach. Overall, this study demonstrates that combining traditional and deep learning-based methods yields a more accurate and interpretable framework for DNA sequence alignment, thereby paving the way for enhanced genomic analysis.</p>
	]]></content:encoded>

	<dc:title>Deep Learning Approaches for Efficient and Accurate DNA Sequence Alignment Using Large Language Models</dc:title>
			<dc:creator>Shefa Alkhowaiter</dc:creator>
			<dc:creator>Mohamed Tahar Ben Othman</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2026013004</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-04-15</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-04-15</prism:publicationDate>
	<prism:volume>13</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>4</prism:startingPage>
		<prism:doi>10.3390/cmsf2026013004</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/13/1/4</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/13/1/3">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 3: Data Encryption Algorithms for Cloud Storage Systems—A Comparative Analysis</title>
	<link>https://www.mdpi.com/2813-0324/13/1/3</link>
	<description>Cloud storage systems require strong and efficient encryption methods to ensure data security and reliability. However, selecting the most suitable encryption algorithm remains a challenge due to variations in performance, overhead, and reliability. This study aims to introduce a comparative analysis of five encryption algorithms—Advanced Encryption Standard (AES), Blowfish, Rivest-Shamir-Adleman (RSA), Elliptic Curve Cryptography (ECC), and Advanced Encryption Standard one-time password AES-OTP with RSA hybrid model (AES-OTP with RSA)—to identify the most suitable algorithm to protect sensitive data in cloud storage systems. The evaluation of these algorithms was based on encryption/decryption time, data size overhead, encryption/decryption throughput, performance metrics (accuracy, precision, recall, and F1-score), and error metrics mean square error and mean absolute error (MSE and MAE), using datasets of various sizes. The results indicated that AES provided the fastest encryption and decryption time, minimal overhead, and the highest throughput and accuracy, while Blowfish also performed efficiently but with slightly higher error rates. RSA and ECC, although secure, were slower and demonstrated more overhead. The hybrid AES-OTP with RSA model achieved a good balance between speed and secure key management. This study highlights the trade-offs between speed, security, and storage efficiency, offering guidance in selecting appropriate encryption algorithms for cloud-based data protection.</description>
	<pubDate>2026-04-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 3: Data Encryption Algorithms for Cloud Storage Systems—A Comparative Analysis</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/13/1/3">doi: 10.3390/cmsf2026013003</a></p>
	<p>Authors:
		Abdulsalam Ibrahim Almirdasi
		Mohamed Tahar Ben Othman
		</p>
	<p>Cloud storage systems require strong and efficient encryption methods to ensure data security and reliability. However, selecting the most suitable encryption algorithm remains a challenge due to variations in performance, overhead, and reliability. This study aims to introduce a comparative analysis of five encryption algorithms—Advanced Encryption Standard (AES), Blowfish, Rivest-Shamir-Adleman (RSA), Elliptic Curve Cryptography (ECC), and Advanced Encryption Standard one-time password AES-OTP with RSA hybrid model (AES-OTP with RSA)—to identify the most suitable algorithm to protect sensitive data in cloud storage systems. The evaluation of these algorithms was based on encryption/decryption time, data size overhead, encryption/decryption throughput, performance metrics (accuracy, precision, recall, and F1-score), and error metrics mean square error and mean absolute error (MSE and MAE), using datasets of various sizes. The results indicated that AES provided the fastest encryption and decryption time, minimal overhead, and the highest throughput and accuracy, while Blowfish also performed efficiently but with slightly higher error rates. RSA and ECC, although secure, were slower and demonstrated more overhead. The hybrid AES-OTP with RSA model achieved a good balance between speed and secure key management. This study highlights the trade-offs between speed, security, and storage efficiency, offering guidance in selecting appropriate encryption algorithms for cloud-based data protection.</p>
	]]></content:encoded>

	<dc:title>Data Encryption Algorithms for Cloud Storage Systems—A Comparative Analysis</dc:title>
			<dc:creator>Abdulsalam Ibrahim Almirdasi</dc:creator>
			<dc:creator>Mohamed Tahar Ben Othman</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2026013003</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-04-15</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-04-15</prism:publicationDate>
	<prism:volume>13</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>3</prism:startingPage>
		<prism:doi>10.3390/cmsf2026013003</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/13/1/3</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/13/1/2">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 2: Blockchain-Based Secure Data Sharing in Cybersecurity: A Framework for Protecting Sensitive Information</title>
	<link>https://www.mdpi.com/2813-0324/13/1/2</link>
	<description>With the growing volume of sensitive data stored and processed in cloud environments, conventional security models are no longer sufficient to guarantee privacy, integrity, and trust. This paper proposes a blockchain-based framework that integrates Zero-Knowledge Proofs (ZKPs) and homomorphic encryption (HE) to enable secure and privacy-preserving data sharing. ZKPs are employed to verify user access rights without exposing identities or underlying information, while HE allows computations to be performed directly on encrypted data, ensuring confidentiality is preserved throughout the data lifecycle. The proposed framework addresses the limitations of existing approaches that either lack encrypted computation capabilities or expose sensitive data during processing. Formal and informal analyses demonstrate the feasibility of the model in terms of encryption time, ZKP verification latency, and computation overhead. The framework is designed to be applied initially in the healthcare sector and aligns with national digital transformation initiatives such as Saudi Vision 2030.</description>
	<pubDate>2026-04-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 2: Blockchain-Based Secure Data Sharing in Cybersecurity: A Framework for Protecting Sensitive Information</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/13/1/2">doi: 10.3390/cmsf2026013002</a></p>
	<p>Authors:
		Raneem Khaled AlFadhel
		Mohammad Ali A. Hammoudeh
		</p>
	<p>With the growing volume of sensitive data stored and processed in cloud environments, conventional security models are no longer sufficient to guarantee privacy, integrity, and trust. This paper proposes a blockchain-based framework that integrates Zero-Knowledge Proofs (ZKPs) and homomorphic encryption (HE) to enable secure and privacy-preserving data sharing. ZKPs are employed to verify user access rights without exposing identities or underlying information, while HE allows computations to be performed directly on encrypted data, ensuring confidentiality is preserved throughout the data lifecycle. The proposed framework addresses the limitations of existing approaches that either lack encrypted computation capabilities or expose sensitive data during processing. Formal and informal analyses demonstrate the feasibility of the model in terms of encryption time, ZKP verification latency, and computation overhead. The framework is designed to be applied initially in the healthcare sector and aligns with national digital transformation initiatives such as Saudi Vision 2030.</p>
	]]></content:encoded>

	<dc:title>Blockchain-Based Secure Data Sharing in Cybersecurity: A Framework for Protecting Sensitive Information</dc:title>
			<dc:creator>Raneem Khaled AlFadhel</dc:creator>
			<dc:creator>Mohammad Ali A. Hammoudeh</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2026013002</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-04-15</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-04-15</prism:publicationDate>
	<prism:volume>13</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>2</prism:startingPage>
		<prism:doi>10.3390/cmsf2026013002</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/13/1/2</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/13/1/1">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 1: Preface to the 1st International Conference on Emerging Tech &amp;amp; Innovation (ICETI)</title>
	<link>https://www.mdpi.com/2813-0324/13/1/1</link>
	<description>n/a</description>
	<pubDate>2026-04-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 13, Pages 1: Preface to the 1st International Conference on Emerging Tech &amp;amp; Innovation (ICETI)</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/13/1/1">doi: 10.3390/cmsf2026013001</a></p>
	<p>Authors:
		Dina M. Ibrahim
		Jamal Alotaibi
		</p>
	<p>n/a</p>
	]]></content:encoded>

	<dc:title>Preface to the 1st International Conference on Emerging Tech &amp;amp;amp; Innovation (ICETI)</dc:title>
			<dc:creator>Dina M. Ibrahim</dc:creator>
			<dc:creator>Jamal Alotaibi</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2026013001</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-04-13</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-04-13</prism:publicationDate>
	<prism:volume>13</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Editorial</prism:section>
	<prism:startingPage>1</prism:startingPage>
		<prism:doi>10.3390/cmsf2026013001</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/13/1/1</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/19">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 19: Statement of Peer Review</title>
	<link>https://www.mdpi.com/2813-0324/12/1/19</link>
	<description>n/a</description>
	<pubDate>2026-02-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 19: Statement of Peer Review</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/19">doi: 10.3390/cmsf2025012019</a></p>
	<p>Authors:
		Sameena Pathan
		Saad Hassan Kiani
		</p>
	<p>n/a</p>
	]]></content:encoded>

	<dc:title>Statement of Peer Review</dc:title>
			<dc:creator>Sameena Pathan</dc:creator>
			<dc:creator>Saad Hassan Kiani</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012019</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-02-09</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-02-09</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Editorial</prism:section>
	<prism:startingPage>19</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012019</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/19</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/18">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 18: A Comprehensive Analysis of Features, Benefits, Challenges, and Best Practices of Security Information and Event Management (SIEM) Solutions</title>
	<link>https://www.mdpi.com/2813-0324/12/1/18</link>
	<description>Businesses need good defenses against any number of incidents in the continually evolving area of cybersecurity. SIEM (Security Information and Event Management) systems are now important tools for them. The current study offers a comprehensive analysis of SIEM solutions, such as their key features, benefits, installation issues, and suggested procedures. SIEM systems effectively store security event data, giving continuous tracking, interaction, and examination to recognize and deal with threats rapidly. The advantages of this technology include enhanced operating efficiency, streamlined compliance with laws, expedited response to events, and heightened threat detection capabilities. However, the implementation of SIEM systems has many challenges that must be overcome, including intricacies, cognitive exhaustion, data integration complications, and restrictions. To effectively handle these issues, businesses are advised to develop objectives, properly schedule, attend school, and periodically review and enhance their SIEM goals. In addition, organizations may use the complete capabilities of SIEM systems to enhance their cybersecurity stance and mitigate the risks posed by cyberattacks by staying updated with the most recent developments. This study aims to provide a comprehensive examination of Security Information and Event Management (SIEM) systems, with a specific emphasis on important features, benefits, implementation challenges, and suggestions.</description>
	<pubDate>2026-02-06</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 18: A Comprehensive Analysis of Features, Benefits, Challenges, and Best Practices of Security Information and Event Management (SIEM) Solutions</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/18">doi: 10.3390/cmsf2025012018</a></p>
	<p>Authors:
		Marios Vardalachakis
		Manos Vasilakis
		Manolis Tampouratzis
		</p>
	<p>Businesses need good defenses against any number of incidents in the continually evolving area of cybersecurity. SIEM (Security Information and Event Management) systems are now important tools for them. The current study offers a comprehensive analysis of SIEM solutions, such as their key features, benefits, installation issues, and suggested procedures. SIEM systems effectively store security event data, giving continuous tracking, interaction, and examination to recognize and deal with threats rapidly. The advantages of this technology include enhanced operating efficiency, streamlined compliance with laws, expedited response to events, and heightened threat detection capabilities. However, the implementation of SIEM systems has many challenges that must be overcome, including intricacies, cognitive exhaustion, data integration complications, and restrictions. To effectively handle these issues, businesses are advised to develop objectives, properly schedule, attend school, and periodically review and enhance their SIEM goals. In addition, organizations may use the complete capabilities of SIEM systems to enhance their cybersecurity stance and mitigate the risks posed by cyberattacks by staying updated with the most recent developments. This study aims to provide a comprehensive examination of Security Information and Event Management (SIEM) systems, with a specific emphasis on important features, benefits, implementation challenges, and suggestions.</p>
	]]></content:encoded>

	<dc:title>A Comprehensive Analysis of Features, Benefits, Challenges, and Best Practices of Security Information and Event Management (SIEM) Solutions</dc:title>
			<dc:creator>Marios Vardalachakis</dc:creator>
			<dc:creator>Manos Vasilakis</dc:creator>
			<dc:creator>Manolis Tampouratzis</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012018</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-02-06</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-02-06</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>18</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012018</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/18</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/17">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 17: Advanced Machine Learning Approaches for Predicting ADHD in Females: A Data-Driven Study Employing the WIDS Dataset</title>
	<link>https://www.mdpi.com/2813-0324/12/1/17</link>
	<description>Attention Deficit/Hyperactivity Disorder (ADHD) is a neurodevelopmental disorder that is found in both children and adults. While this disorder often continues in adulthood, diagnosis can be challenging, particularly in females. Unlike males, who are often diagnosed with ADHD due to their externalizing behaviors (i.e., impulsive nature), most females show inattentive symptoms (i.e., in focusing, disorganization), which makes this disorder hard to detect. This paper proposes a machine learning approach to detect ADHD among females. The Wids Datathon 2025 provides three datasets: categorical data, quantitative data, and function connectomes. It contains information on 1213 participants who are seeking to take a test to detect ADHD. Categorical data includes 10 attributes, quantitative data has 19 attributes, and functional connectomes contain 19,901 attributes which are relevant to studying the participants’ overall condition. By combining both XGBoost and Random Forest, an accuracy of 79.42% was achieved. The results show that machine learning algorithms can help in improving ADHD detection in females, leading to better diagnoses in future.</description>
	<pubDate>2026-02-03</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 17: Advanced Machine Learning Approaches for Predicting ADHD in Females: A Data-Driven Study Employing the WIDS Dataset</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/17">doi: 10.3390/cmsf2025012017</a></p>
	<p>Authors:
		Parth Patil
		Karthik Kamaldinni
		Sanjana Patil
		Sakshi Gaitonde
		</p>
	<p>Attention Deficit/Hyperactivity Disorder (ADHD) is a neurodevelopmental disorder that is found in both children and adults. While this disorder often continues in adulthood, diagnosis can be challenging, particularly in females. Unlike males, who are often diagnosed with ADHD due to their externalizing behaviors (i.e., impulsive nature), most females show inattentive symptoms (i.e., in focusing, disorganization), which makes this disorder hard to detect. This paper proposes a machine learning approach to detect ADHD among females. The Wids Datathon 2025 provides three datasets: categorical data, quantitative data, and function connectomes. It contains information on 1213 participants who are seeking to take a test to detect ADHD. Categorical data includes 10 attributes, quantitative data has 19 attributes, and functional connectomes contain 19,901 attributes which are relevant to studying the participants’ overall condition. By combining both XGBoost and Random Forest, an accuracy of 79.42% was achieved. The results show that machine learning algorithms can help in improving ADHD detection in females, leading to better diagnoses in future.</p>
	]]></content:encoded>

	<dc:title>Advanced Machine Learning Approaches for Predicting ADHD in Females: A Data-Driven Study Employing the WIDS Dataset</dc:title>
			<dc:creator>Parth Patil</dc:creator>
			<dc:creator>Karthik Kamaldinni</dc:creator>
			<dc:creator>Sanjana Patil</dc:creator>
			<dc:creator>Sakshi Gaitonde</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012017</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-02-03</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-02-03</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>17</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012017</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/17</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/38">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 38: Time Series and Forecasting ITISE-2025: Statement of Peer Review for Computer Sciences &amp;amp; Mathematics Forum</title>
	<link>https://www.mdpi.com/2813-0324/11/1/38</link>
	<description>n/a</description>
	<pubDate>2026-01-19</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 38: Time Series and Forecasting ITISE-2025: Statement of Peer Review for Computer Sciences &amp;amp; Mathematics Forum</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/38">doi: 10.3390/cmsf2025011038</a></p>
	<p>Authors:
		Olga Valenzuela
		Fernando Rojas
		Luis Javier Herrera
		Hector Pomares
		Ignacio Rojas
		</p>
	<p>n/a</p>
	]]></content:encoded>

	<dc:title>Time Series and Forecasting ITISE-2025: Statement of Peer Review for Computer Sciences &amp;amp;amp; Mathematics Forum</dc:title>
			<dc:creator>Olga Valenzuela</dc:creator>
			<dc:creator>Fernando Rojas</dc:creator>
			<dc:creator>Luis Javier Herrera</dc:creator>
			<dc:creator>Hector Pomares</dc:creator>
			<dc:creator>Ignacio Rojas</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011038</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-01-19</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-01-19</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Editorial</prism:section>
	<prism:startingPage>38</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011038</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/38</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/16">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 16: Visualizing Trends and Correlation Between Fashion Features for Product Design Prediction Using Classification and Sentiment Analysis</title>
	<link>https://www.mdpi.com/2813-0324/12/1/16</link>
	<description>To demonstrate the interrelation of fashion elements for design forecasting, the research examines classification and sentiment analysis methodologies. The study combines survey data with information from social media and e-commerce sites to find important emotional and behavioral patterns that affect how people make buying decisions. The research employs deep learning, Logistic Regression, and Random Forest models to predict design trends and user preferences. The research methodology focuses on improving fashion analytics through feature selection and user segmentation and visual storytelling methods to enhance strategic decision-making.</description>
	<pubDate>2026-01-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 16: Visualizing Trends and Correlation Between Fashion Features for Product Design Prediction Using Classification and Sentiment Analysis</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/16">doi: 10.3390/cmsf2025012016</a></p>
	<p>Authors:
		Monika Sharma
		Navneet Sharma
		Priyanka Verma
		</p>
	<p>To demonstrate the interrelation of fashion elements for design forecasting, the research examines classification and sentiment analysis methodologies. The study combines survey data with information from social media and e-commerce sites to find important emotional and behavioral patterns that affect how people make buying decisions. The research employs deep learning, Logistic Regression, and Random Forest models to predict design trends and user preferences. The research methodology focuses on improving fashion analytics through feature selection and user segmentation and visual storytelling methods to enhance strategic decision-making.</p>
	]]></content:encoded>

	<dc:title>Visualizing Trends and Correlation Between Fashion Features for Product Design Prediction Using Classification and Sentiment Analysis</dc:title>
			<dc:creator>Monika Sharma</dc:creator>
			<dc:creator>Navneet Sharma</dc:creator>
			<dc:creator>Priyanka Verma</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012016</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2026-01-07</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2026-01-07</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>16</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012016</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/16</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/15">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 15: Smart and Sustainable Infrastructure System for Climate Action</title>
	<link>https://www.mdpi.com/2813-0324/12/1/15</link>
	<description>Flooding in Bengaluru areas such as Kodigehalli, Hebbal, and Nagavara has led to severe disruptions, including traffic congestion, infrastructure damage, and health risks. To address this issue, we have proposed a smart flood alert and communication system, integrating Internet of things (IoT), artificial intelligence (AI), and smart infrastructure solutions. The system helps by giving information about real-time water level sensors, AI-driven flood prediction models, automated emergency coordination, and a mobile-based citizen reporting platform. Through cloud-based data processing, predictive analytics, and smart drainage management, this solution aims to enhance early warnings, reduce emergency response time, and improve urban flood resilience. It yields up to an 80% reduction in alert delays, a 50% faster emergency response, and improved community safety. This project seeks collaboration with government agencies, technology firms, and community stakeholders to implement a pilot plan, ensuring a scalable and sustainable flood mitigation strategy for Bengaluru.</description>
	<pubDate>2025-12-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 15: Smart and Sustainable Infrastructure System for Climate Action</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/15">doi: 10.3390/cmsf2025012015</a></p>
	<p>Authors:
		Bhanu Prakash
		Jayanth Sidlaghatta Muralidhar
		Mohammed Zaman Pasha
		Vijay Kumar Harapanahalli Kulkarni
		Shridhar B. Devamane
		N. Rana Pratap Reddy
		</p>
	<p>Flooding in Bengaluru areas such as Kodigehalli, Hebbal, and Nagavara has led to severe disruptions, including traffic congestion, infrastructure damage, and health risks. To address this issue, we have proposed a smart flood alert and communication system, integrating Internet of things (IoT), artificial intelligence (AI), and smart infrastructure solutions. The system helps by giving information about real-time water level sensors, AI-driven flood prediction models, automated emergency coordination, and a mobile-based citizen reporting platform. Through cloud-based data processing, predictive analytics, and smart drainage management, this solution aims to enhance early warnings, reduce emergency response time, and improve urban flood resilience. It yields up to an 80% reduction in alert delays, a 50% faster emergency response, and improved community safety. This project seeks collaboration with government agencies, technology firms, and community stakeholders to implement a pilot plan, ensuring a scalable and sustainable flood mitigation strategy for Bengaluru.</p>
	]]></content:encoded>

	<dc:title>Smart and Sustainable Infrastructure System for Climate Action</dc:title>
			<dc:creator>Bhanu Prakash</dc:creator>
			<dc:creator>Jayanth Sidlaghatta Muralidhar</dc:creator>
			<dc:creator>Mohammed Zaman Pasha</dc:creator>
			<dc:creator>Vijay Kumar Harapanahalli Kulkarni</dc:creator>
			<dc:creator>Shridhar B. Devamane</dc:creator>
			<dc:creator>N. Rana Pratap Reddy</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012015</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-12-29</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-12-29</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>15</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012015</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/15</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/14">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 14: CNN-Based Image Classification of Silkworm for Early Prediction of Diseases</title>
	<link>https://www.mdpi.com/2813-0324/12/1/14</link>
	<description>The need to automate the disease identification processes is frequent because manual identification is time-consuming and needs professional skills to be performed; hence, it may improve effectiveness and precision. This paper has resolved the problem by using image classification with deep learning to detect silkworm diseases. A Kaggle-sourced dataset of work of 492 labelled samples (247 diseased and 245 healthy) was used with a stratified division into 392 training and 100 testing samples. The transfer learning method was performed on two Residual Network models, ResNet-18 and ResNet-50, in which pretrained convolutional layers were frozen and the last fully connected layer was trained to conduct binomial classification. Performance was measured by standard evaluation metrics such as accuracy, precision, recall, F1-score, and confusion matrices.</description>
	<pubDate>2025-12-25</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 14: CNN-Based Image Classification of Silkworm for Early Prediction of Diseases</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/14">doi: 10.3390/cmsf2025012014</a></p>
	<p>Authors:
		Kajal Mungase
		Shwetambari Chiwhane
		Priyanka Paygude
		</p>
	<p>The need to automate the disease identification processes is frequent because manual identification is time-consuming and needs professional skills to be performed; hence, it may improve effectiveness and precision. This paper has resolved the problem by using image classification with deep learning to detect silkworm diseases. A Kaggle-sourced dataset of work of 492 labelled samples (247 diseased and 245 healthy) was used with a stratified division into 392 training and 100 testing samples. The transfer learning method was performed on two Residual Network models, ResNet-18 and ResNet-50, in which pretrained convolutional layers were frozen and the last fully connected layer was trained to conduct binomial classification. Performance was measured by standard evaluation metrics such as accuracy, precision, recall, F1-score, and confusion matrices.</p>
	]]></content:encoded>

	<dc:title>CNN-Based Image Classification of Silkworm for Early Prediction of Diseases</dc:title>
			<dc:creator>Kajal Mungase</dc:creator>
			<dc:creator>Shwetambari Chiwhane</dc:creator>
			<dc:creator>Priyanka Paygude</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012014</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-12-25</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-12-25</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>14</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012014</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/14</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/13">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 13: A Blockchain-Based Machine Learning Approach for Authentic Healthcare Support Information Systems</title>
	<link>https://www.mdpi.com/2813-0324/12/1/13</link>
	<description>In the past, health records were primarily on paper and were essential for recording the results of patient information and treatments. The deployment of “electronic health records” (EHRs) is a new development in healthcare that enables authenticated data storage, reliability when accessing data, and the establishment of easy communication centralized across healthcare service providers. This change enhances the quality of operations for medical environment decision-making using clinical data and patient involvement. Nevertheless, ensuring the authenticity of “EHRs” is a challenging task as a result of the weaknesses of centralized systems. We, therefore, suggest the implementation of (ABE), particularly (CP-ABE) using the blockchain technique, to overcome this problem. CP-ABE maintains data confidentiality and accuracy by encrypting access policies and smart contracts, thus allowing authorized users to decrypt information based on predetermined attributes. In this way, EHRs are ensured to be unaltered as patients’ privacy is preserved, and healthcare providers are not allowed to evaluate people records without consent. The machine learning techniques (“SVM, RF and Naïve Bayes”) used with datasets like “Cleveland Heart Disease” explain the cause risk factors for speed diagnosis and for cardiac disorders. Such a system not only fortifies the security of EHRs but also provides healthcare professionals with the necessary tools to improve patient care. The use of state-of-the-art encryption methods together with predictive analytics allows healthcare providers to protect patient privacy and at the same time make healthcare delivery more efficient through the use of a clinically informed final judgment of patient and personalized wellness plans.</description>
	<pubDate>2025-12-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 13: A Blockchain-Based Machine Learning Approach for Authentic Healthcare Support Information Systems</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/13">doi: 10.3390/cmsf2025012013</a></p>
	<p>Authors:
		Mudiduddi Lova Kumari
		P. S. G. Aruna Sri
		Rajapraveen Kumar Nakka
		Sonal Sharma
		Swaminathan Balasubramanian
		Preeti Gupta
		</p>
	<p>In the past, health records were primarily on paper and were essential for recording the results of patient information and treatments. The deployment of “electronic health records” (EHRs) is a new development in healthcare that enables authenticated data storage, reliability when accessing data, and the establishment of easy communication centralized across healthcare service providers. This change enhances the quality of operations for medical environment decision-making using clinical data and patient involvement. Nevertheless, ensuring the authenticity of “EHRs” is a challenging task as a result of the weaknesses of centralized systems. We, therefore, suggest the implementation of (ABE), particularly (CP-ABE) using the blockchain technique, to overcome this problem. CP-ABE maintains data confidentiality and accuracy by encrypting access policies and smart contracts, thus allowing authorized users to decrypt information based on predetermined attributes. In this way, EHRs are ensured to be unaltered as patients’ privacy is preserved, and healthcare providers are not allowed to evaluate people records without consent. The machine learning techniques (“SVM, RF and Naïve Bayes”) used with datasets like “Cleveland Heart Disease” explain the cause risk factors for speed diagnosis and for cardiac disorders. Such a system not only fortifies the security of EHRs but also provides healthcare professionals with the necessary tools to improve patient care. The use of state-of-the-art encryption methods together with predictive analytics allows healthcare providers to protect patient privacy and at the same time make healthcare delivery more efficient through the use of a clinically informed final judgment of patient and personalized wellness plans.</p>
	]]></content:encoded>

	<dc:title>A Blockchain-Based Machine Learning Approach for Authentic Healthcare Support Information Systems</dc:title>
			<dc:creator>Mudiduddi Lova Kumari</dc:creator>
			<dc:creator>P. S. G. Aruna Sri</dc:creator>
			<dc:creator>Rajapraveen Kumar Nakka</dc:creator>
			<dc:creator>Sonal Sharma</dc:creator>
			<dc:creator>Swaminathan Balasubramanian</dc:creator>
			<dc:creator>Preeti Gupta</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012013</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-12-22</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-12-22</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>13</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012013</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/13</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/12">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 12: Machine Learning Framework for Algorithmic Trading</title>
	<link>https://www.mdpi.com/2813-0324/12/1/12</link>
	<description>Present financial markets are characterized by great volatility and nonlinear dynamics since they are driven by both quantitative forces and qualitative mood. Traditional trading practices cannot capture such nuance. This study proposes an automated trading system based on machine learning that uses technical analysis as well as sentiment factors for better decision-making. Historical OHLCV stock price data from 2000 to 2025 was augmented with financial indicators such as SMA, EMA, RSI, and Bollinger Bands, as well as sentiment scores based on real-time news via natural language processing. LightGBM regression for predicting the price range and Histogram-Based Gradient Boosting classification for directional prediction were employed. Signals were generated with volatility-adjusted thresholds and classifier confirmation, and a risk management layer enforced position sizing, stop-loss triggering, and drawdown constraint. Back testing demonstrated improved Sharpe ratio, Sortino ratio, and win rates versus baseline strategies. The findings emphasize that the combination of machine learning and sentiment analysis with risk-conscious design improves predictive accuracy, dependability, and preservation of capital in automated trading systems.</description>
	<pubDate>2025-12-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 12: Machine Learning Framework for Algorithmic Trading</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/12">doi: 10.3390/cmsf2025012012</a></p>
	<p>Authors:
		Krishnamurthy Nayak
		Supreetha Balavalikar Shivaram
		Sumukha K. Nayak
		</p>
	<p>Present financial markets are characterized by great volatility and nonlinear dynamics since they are driven by both quantitative forces and qualitative mood. Traditional trading practices cannot capture such nuance. This study proposes an automated trading system based on machine learning that uses technical analysis as well as sentiment factors for better decision-making. Historical OHLCV stock price data from 2000 to 2025 was augmented with financial indicators such as SMA, EMA, RSI, and Bollinger Bands, as well as sentiment scores based on real-time news via natural language processing. LightGBM regression for predicting the price range and Histogram-Based Gradient Boosting classification for directional prediction were employed. Signals were generated with volatility-adjusted thresholds and classifier confirmation, and a risk management layer enforced position sizing, stop-loss triggering, and drawdown constraint. Back testing demonstrated improved Sharpe ratio, Sortino ratio, and win rates versus baseline strategies. The findings emphasize that the combination of machine learning and sentiment analysis with risk-conscious design improves predictive accuracy, dependability, and preservation of capital in automated trading systems.</p>
	]]></content:encoded>

	<dc:title>Machine Learning Framework for Algorithmic Trading</dc:title>
			<dc:creator>Krishnamurthy Nayak</dc:creator>
			<dc:creator>Supreetha Balavalikar Shivaram</dc:creator>
			<dc:creator>Sumukha K. Nayak</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012012</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-12-22</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-12-22</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>12</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012012</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/12</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/11">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 11: A Multiscale Convolutional Neural Network Framework for Automated Segmentation and Pattern Mapping of Psoriatic Lesions</title>
	<link>https://www.mdpi.com/2813-0324/12/1/11</link>
	<description>For psoriatic lesions, automatic segmentation is crucial to perform objective assessment, monitoring, and medication planning in dermatology. This study proposes a Multiscale Convolutional Neural Network (MSCNN) framework for precise segmentation of psoriatic lesions from medical images. The model was evaluated using the ISIC 2017 dataset and demonstrated robust performance in lesion localization. By analyzing the predicted masks, it has been observed that the boundaries closely match ground truth annotations. Metrics for quantitative evaluation are Dice Coefficient, Intersection over Union (IoU), used with high precision and slightly lower recall, reflecting occasional under-segmentation of fine-scale lesion details. The findings focus on the proposed MSCNN’s capability to produce reliable lesion masks, while also detecting areas for advancement in capturing irregular lesion boundaries. Future work involves integrating multimodal imaging, attention mechanisms, and larger, diverse datasets to improve segmentation accuracy and clinical applicability.</description>
	<pubDate>2025-12-19</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 11: A Multiscale Convolutional Neural Network Framework for Automated Segmentation and Pattern Mapping of Psoriatic Lesions</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/11">doi: 10.3390/cmsf2025012011</a></p>
	<p>Authors:
		Anagha Kulkarni
		Priyanka Pawar
		Bhavana Pansare
		Harshal Raje
		</p>
	<p>For psoriatic lesions, automatic segmentation is crucial to perform objective assessment, monitoring, and medication planning in dermatology. This study proposes a Multiscale Convolutional Neural Network (MSCNN) framework for precise segmentation of psoriatic lesions from medical images. The model was evaluated using the ISIC 2017 dataset and demonstrated robust performance in lesion localization. By analyzing the predicted masks, it has been observed that the boundaries closely match ground truth annotations. Metrics for quantitative evaluation are Dice Coefficient, Intersection over Union (IoU), used with high precision and slightly lower recall, reflecting occasional under-segmentation of fine-scale lesion details. The findings focus on the proposed MSCNN’s capability to produce reliable lesion masks, while also detecting areas for advancement in capturing irregular lesion boundaries. Future work involves integrating multimodal imaging, attention mechanisms, and larger, diverse datasets to improve segmentation accuracy and clinical applicability.</p>
	]]></content:encoded>

	<dc:title>A Multiscale Convolutional Neural Network Framework for Automated Segmentation and Pattern Mapping of Psoriatic Lesions</dc:title>
			<dc:creator>Anagha Kulkarni</dc:creator>
			<dc:creator>Priyanka Pawar</dc:creator>
			<dc:creator>Bhavana Pansare</dc:creator>
			<dc:creator>Harshal Raje</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012011</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-12-19</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-12-19</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>11</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012011</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/11</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/10">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 10: AI-Powered Cybersecurity Mesh for Financial Transactions: A Generative-Intelligence Paradigm for Payment Security</title>
	<link>https://www.mdpi.com/2813-0324/12/1/10</link>
	<description>The rapid expansion of digital payment channels has significantly widened the financial transaction attack surface, exposing ecosystems to sophisticated, polymorphic threat vectors. This study introduces an AI-powered cybersecurity mesh that unites Generative AI (GenAI), federated reinforcement learning, and zero-trust principles, with a forward-looking architecture designed for post-quantum readiness. The architecture ingests high-velocity telemetry, coordinates self-evolving agent collectives, and anchors model provenance in a permissioned blockchain to guarantee verifiability and non-repudiation. Empirical evaluations across two production-scale environments—a mobile wallet processing two million transactions per day and a high-throughput cross-border remittance rail—demonstrate a 95.1% threat-detection rate, a 62% reduction in false positives, and a 35.7% latency decrease compared to baseline systems. These results affirm the feasibility of a generative cybersecurity mesh as a scalable, future-proofed blueprint for next-generation payment security.</description>
	<pubDate>2025-12-19</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 10: AI-Powered Cybersecurity Mesh for Financial Transactions: A Generative-Intelligence Paradigm for Payment Security</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/10">doi: 10.3390/cmsf2025012010</a></p>
	<p>Authors:
		Utham Kumar Anugula Sethupathy
		Vijayanand Ananthanarayan
		</p>
	<p>The rapid expansion of digital payment channels has significantly widened the financial transaction attack surface, exposing ecosystems to sophisticated, polymorphic threat vectors. This study introduces an AI-powered cybersecurity mesh that unites Generative AI (GenAI), federated reinforcement learning, and zero-trust principles, with a forward-looking architecture designed for post-quantum readiness. The architecture ingests high-velocity telemetry, coordinates self-evolving agent collectives, and anchors model provenance in a permissioned blockchain to guarantee verifiability and non-repudiation. Empirical evaluations across two production-scale environments—a mobile wallet processing two million transactions per day and a high-throughput cross-border remittance rail—demonstrate a 95.1% threat-detection rate, a 62% reduction in false positives, and a 35.7% latency decrease compared to baseline systems. These results affirm the feasibility of a generative cybersecurity mesh as a scalable, future-proofed blueprint for next-generation payment security.</p>
	]]></content:encoded>

	<dc:title>AI-Powered Cybersecurity Mesh for Financial Transactions: A Generative-Intelligence Paradigm for Payment Security</dc:title>
			<dc:creator>Utham Kumar Anugula Sethupathy</dc:creator>
			<dc:creator>Vijayanand Ananthanarayan</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012010</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-12-19</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-12-19</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>10</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012010</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/10</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/5">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 5: Preface to the First International Conference on Computational Intelligence and Soft Computing (CISCom 2025)</title>
	<link>https://www.mdpi.com/2813-0324/12/1/5</link>
	<description>n/a</description>
	<pubDate>2025-12-19</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 5: Preface to the First International Conference on Computational Intelligence and Soft Computing (CISCom 2025)</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/5">doi: 10.3390/cmsf2025012005</a></p>
	<p>Authors:
		Sameena Pathan
		Saad Hassan Kiani
		</p>
	<p>n/a</p>
	]]></content:encoded>

	<dc:title>Preface to the First International Conference on Computational Intelligence and Soft Computing (CISCom 2025)</dc:title>
			<dc:creator>Sameena Pathan</dc:creator>
			<dc:creator>Saad Hassan Kiani</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012005</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-12-19</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-12-19</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Editorial</prism:section>
	<prism:startingPage>5</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012005</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/5</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/9">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 9: Self-Supervised Learning for Complex Pattern Interpretation in Vitiligo Skin Imaging</title>
	<link>https://www.mdpi.com/2813-0324/12/1/9</link>
	<description>Depigmented patches are the result of vitiligo, a skin condition brought on by the slow breakdown of melanocytes. High variability, complex lesion morphology, and subtle differences between affected and unaffected skin make accurate diagnosis difficult. In these situations, conventional supervised image analysis techniques have trouble generalizing. By allowing models to acquire significant representations from unlabeled data, self-supervised learning (SSL) presents a viable substitute. The new SSL-based framework for vitiligo skin image analysis proposed in this study uses contrastive learning with augmentation-based pretext tasks to capture complex visual patterns such as patch distribution, texture loss, and border irregularity. The SSL-enhanced model achieved a validation accuracy of 0.83 after fine-tuning on a small, labeled subset. This suggests that SSL could support accurate and labeled efficient vitiligo assessment in clinical and research settings. Direct comparisons with existing supervised model were not performed and were left for future research.</description>
	<pubDate>2025-12-18</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 9: Self-Supervised Learning for Complex Pattern Interpretation in Vitiligo Skin Imaging</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/9">doi: 10.3390/cmsf2025012009</a></p>
	<p>Authors:
		Priyanka Pawar
		Anagha Kulkarni
		Bhavana Pansare
		Prajakta Pawar
		Prachi Bahekar
		Madhavi Kapre
		</p>
	<p>Depigmented patches are the result of vitiligo, a skin condition brought on by the slow breakdown of melanocytes. High variability, complex lesion morphology, and subtle differences between affected and unaffected skin make accurate diagnosis difficult. In these situations, conventional supervised image analysis techniques have trouble generalizing. By allowing models to acquire significant representations from unlabeled data, self-supervised learning (SSL) presents a viable substitute. The new SSL-based framework for vitiligo skin image analysis proposed in this study uses contrastive learning with augmentation-based pretext tasks to capture complex visual patterns such as patch distribution, texture loss, and border irregularity. The SSL-enhanced model achieved a validation accuracy of 0.83 after fine-tuning on a small, labeled subset. This suggests that SSL could support accurate and labeled efficient vitiligo assessment in clinical and research settings. Direct comparisons with existing supervised model were not performed and were left for future research.</p>
	]]></content:encoded>

	<dc:title>Self-Supervised Learning for Complex Pattern Interpretation in Vitiligo Skin Imaging</dc:title>
			<dc:creator>Priyanka Pawar</dc:creator>
			<dc:creator>Anagha Kulkarni</dc:creator>
			<dc:creator>Bhavana Pansare</dc:creator>
			<dc:creator>Prajakta Pawar</dc:creator>
			<dc:creator>Prachi Bahekar</dc:creator>
			<dc:creator>Madhavi Kapre</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012009</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-12-18</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-12-18</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>9</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012009</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/9</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/8">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 8: LSTM-Based News Article Category Classification</title>
	<link>https://www.mdpi.com/2813-0324/12/1/8</link>
	<description>A substantial amount of data is generated day-to-day, to which news articles are a major contributor. Most of this data is not well-structured, highlighting the need for efficient ways to manage, process, and analyze said data. One useful approach involves the categorization of the data. The work “News Article Category Classification” develops a Long Short-Term Memory (LSTM) model for classifying news articles into 14 categories. LSTM networks are suitable for text classification tasks, as they efficiently capture contextual and sequential dependencies. They have a special ability to retain long-term information which makes them perfect for understanding the meaning of news articles.</description>
	<pubDate>2025-12-18</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 8: LSTM-Based News Article Category Classification</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/8">doi: 10.3390/cmsf2025012008</a></p>
	<p>Authors:
		Yusra Rafat
		Potu Narayana
		R. Madana Mohana
		Kolukuluri Srilatha
		</p>
	<p>A substantial amount of data is generated day-to-day, to which news articles are a major contributor. Most of this data is not well-structured, highlighting the need for efficient ways to manage, process, and analyze said data. One useful approach involves the categorization of the data. The work “News Article Category Classification” develops a Long Short-Term Memory (LSTM) model for classifying news articles into 14 categories. LSTM networks are suitable for text classification tasks, as they efficiently capture contextual and sequential dependencies. They have a special ability to retain long-term information which makes them perfect for understanding the meaning of news articles.</p>
	]]></content:encoded>

	<dc:title>LSTM-Based News Article Category Classification</dc:title>
			<dc:creator>Yusra Rafat</dc:creator>
			<dc:creator>Potu Narayana</dc:creator>
			<dc:creator>R. Madana Mohana</dc:creator>
			<dc:creator>Kolukuluri Srilatha</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012008</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-12-18</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-12-18</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>8</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012008</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/8</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/7">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 7: Deep Learning Approaches to Chronic Venous Disease Classification</title>
	<link>https://www.mdpi.com/2813-0324/12/1/7</link>
	<description>Millions of people suffer from chronic venous disease (CVD), a common vascular condition that frequently causes pain, edema, and skin ulcers. For treatment to be effective, its stages must be accurately and promptly classified. This study offers a deep learning-based framework for classifying CVD stages using medical images, such as limb photos or ultrasound scans. For training and assessment, convolutional neural networks (CNNs) are used in conjunction with pre-trained models like ResNet, VGG, and Efficient Net. Metrics like accuracy, precision, recall, and F1-score are used to evaluate the model’s performance. The encouraging findings suggest that deep learning tools can greatly facilitate the diagnosis of CVD and may be integrated into clinical decision support systems for quicker, more precise evaluations.</description>
	<pubDate>2025-12-18</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 7: Deep Learning Approaches to Chronic Venous Disease Classification</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/7">doi: 10.3390/cmsf2025012007</a></p>
	<p>Authors:
		Ankur Goyal
		Vikas Honmane
		Kumarsagar Dange
		Shiv Kant
		</p>
	<p>Millions of people suffer from chronic venous disease (CVD), a common vascular condition that frequently causes pain, edema, and skin ulcers. For treatment to be effective, its stages must be accurately and promptly classified. This study offers a deep learning-based framework for classifying CVD stages using medical images, such as limb photos or ultrasound scans. For training and assessment, convolutional neural networks (CNNs) are used in conjunction with pre-trained models like ResNet, VGG, and Efficient Net. Metrics like accuracy, precision, recall, and F1-score are used to evaluate the model’s performance. The encouraging findings suggest that deep learning tools can greatly facilitate the diagnosis of CVD and may be integrated into clinical decision support systems for quicker, more precise evaluations.</p>
	]]></content:encoded>

	<dc:title>Deep Learning Approaches to Chronic Venous Disease Classification</dc:title>
			<dc:creator>Ankur Goyal</dc:creator>
			<dc:creator>Vikas Honmane</dc:creator>
			<dc:creator>Kumarsagar Dange</dc:creator>
			<dc:creator>Shiv Kant</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012007</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-12-18</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-12-18</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>7</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012007</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/7</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/6">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 6: Gender-Aware ADHD Detection Framework Combining XGBoost and FLAML Models: Exploring Predictive Features in Women Advancing Personalized ADHD Diagnosis</title>
	<link>https://www.mdpi.com/2813-0324/12/1/6</link>
	<description>A machine learning architecture is introduced to predict attention deficit hyperactivity disorder (ADHD) and biological sex from multimodal inputs. The problem sidesteps the clinical task of early ADHD detection and adds prediction of sex as a meta-feature to enhance robustness. The architecture is applied to demographic profiles, quantitative tests, and functional brain connectomes as 200 × 200 matrices. Preprocessing includes data harmonization, matrix symmetrization, graph-based descriptor extraction, including total strength, mean, and standard deviation, categorical encoding, variance thresholding, and imputation of missing values using k-nearest neighbors. Sex classification is performed using XGBoost with stratified cross-validation to generate probability outputs that enhance the ADHD model. ADHD classification is tuned using FLAML’s automatic hyperparameter search for XGBoost and class-weighting to address imbalance. Findings show that combining imaging-derived features and automated model selection yields a robust method of ADHD detection, underscoring the utility of multimodal data fusion in neuropsychiatric studies.</description>
	<pubDate>2025-12-18</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 6: Gender-Aware ADHD Detection Framework Combining XGBoost and FLAML Models: Exploring Predictive Features in Women Advancing Personalized ADHD Diagnosis</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/6">doi: 10.3390/cmsf2025012006</a></p>
	<p>Authors:
		Srushti Honnangi
		Anushri Kajagar
		Shashank Shetgeri
		Tanvi Korgaonkar
		Salma Shahapur
		Rajashri Khanai
		</p>
	<p>A machine learning architecture is introduced to predict attention deficit hyperactivity disorder (ADHD) and biological sex from multimodal inputs. The problem sidesteps the clinical task of early ADHD detection and adds prediction of sex as a meta-feature to enhance robustness. The architecture is applied to demographic profiles, quantitative tests, and functional brain connectomes as 200 × 200 matrices. Preprocessing includes data harmonization, matrix symmetrization, graph-based descriptor extraction, including total strength, mean, and standard deviation, categorical encoding, variance thresholding, and imputation of missing values using k-nearest neighbors. Sex classification is performed using XGBoost with stratified cross-validation to generate probability outputs that enhance the ADHD model. ADHD classification is tuned using FLAML’s automatic hyperparameter search for XGBoost and class-weighting to address imbalance. Findings show that combining imaging-derived features and automated model selection yields a robust method of ADHD detection, underscoring the utility of multimodal data fusion in neuropsychiatric studies.</p>
	]]></content:encoded>

	<dc:title>Gender-Aware ADHD Detection Framework Combining XGBoost and FLAML Models: Exploring Predictive Features in Women Advancing Personalized ADHD Diagnosis</dc:title>
			<dc:creator>Srushti Honnangi</dc:creator>
			<dc:creator>Anushri Kajagar</dc:creator>
			<dc:creator>Shashank Shetgeri</dc:creator>
			<dc:creator>Tanvi Korgaonkar</dc:creator>
			<dc:creator>Salma Shahapur</dc:creator>
			<dc:creator>Rajashri Khanai</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012006</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-12-18</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-12-18</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>6</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012006</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/6</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/4">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 4: Enhanced Early Detection of Epileptic Seizures Through Advanced Line Spectral Estimation and XGBoost Machine Learning</title>
	<link>https://www.mdpi.com/2813-0324/12/1/4</link>
	<description>This paper proposes a fast epileptic seizure detection method to allow for early clinical intervention. The primary goal is to enhance computational and predictive performance to make the method viable for online implementation. An advanced Line Spectral Estimation (LSE)-based method for EEG analysis was developed with Bayesian inference and Toeplitz structure-based fast inversion with Capon and non-uniform Fourier transforms to reduce computational requirements. XGBoost classifier with parallel boosting was employed to increase prediction performance. The method was tested with patients’ EEG data using multiple embedded Graphic Processing Unit (GPU) platforms and achieved 95.5% accuracy, and 23.48 and 33.46 min average and maximum lead times before a seizure, respectively. The sensitivity and specificity values (92.23% and 93.38%) show the method to be reliable. The integration of LSE and XGBoost can be extended to create an efficient and practical online seizure detection and management tool.</description>
	<pubDate>2025-12-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 4: Enhanced Early Detection of Epileptic Seizures Through Advanced Line Spectral Estimation and XGBoost Machine Learning</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/4">doi: 10.3390/cmsf2025012004</a></p>
	<p>Authors:
		K. Rama Krishna
		B. B. Shabarinath
		</p>
	<p>This paper proposes a fast epileptic seizure detection method to allow for early clinical intervention. The primary goal is to enhance computational and predictive performance to make the method viable for online implementation. An advanced Line Spectral Estimation (LSE)-based method for EEG analysis was developed with Bayesian inference and Toeplitz structure-based fast inversion with Capon and non-uniform Fourier transforms to reduce computational requirements. XGBoost classifier with parallel boosting was employed to increase prediction performance. The method was tested with patients’ EEG data using multiple embedded Graphic Processing Unit (GPU) platforms and achieved 95.5% accuracy, and 23.48 and 33.46 min average and maximum lead times before a seizure, respectively. The sensitivity and specificity values (92.23% and 93.38%) show the method to be reliable. The integration of LSE and XGBoost can be extended to create an efficient and practical online seizure detection and management tool.</p>
	]]></content:encoded>

	<dc:title>Enhanced Early Detection of Epileptic Seizures Through Advanced Line Spectral Estimation and XGBoost Machine Learning</dc:title>
			<dc:creator>K. Rama Krishna</dc:creator>
			<dc:creator>B. B. Shabarinath</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012004</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-12-17</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-12-17</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>4</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012004</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/4</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/3">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 3: Data-Driven Approach for Asthma Classification: Ensemble Learning with Random Forest and XGBoost</title>
	<link>https://www.mdpi.com/2813-0324/12/1/3</link>
	<description>Across the world, asthma is a prominent and widespread respiratory disorder that has a substantial clinical and socioeconomic influence. The classification of asthma subtypes should be performed precisely and effectively, with objectives such as personalized treatments, improved rehabilitation outcomes, and preventing tragic exacerbations. Typical screening approaches are primarily based on spirometry measures, immunologic assessments, and individual clinical diagnoses, and they are commonly affected by limitations such as uncertainty, crossover disparities, and restricted generalizability among various groups of patients. This study utilizes machine learning (ML) methodologies as a Data-Driven Approach (DDA)-based framework for asthma classification to overcome the mentioned challenges. Methodically constructed and evaluated classifiers, such as Random Forest and XGBoost, use the Asthma Disease Dataset from Kaggle, which consists of demographic data, lung function metrics (FEV1, FVC, FEV1/FVC ratio, and PEFR), and immunoglobulin E (IgE) biomarkers. A wide range of metrics such as accuracy, precision, recall, F1-score, receiver operating characteristic area under the curve (ROC-AUC), and average precision (AP) are used exhaustively to assess the performance of the model. The results indicate that though each model exhibits outstanding forecasting abilities, XGBoost has an enhanced classification capability, especially in recall and AP, which minimizes the proportion of false negatives, resulting in a clinically noteworthy result. The significance of the FEV1/FVC ratio, IgE levels, and PEFR as key indicators is recognized by feature interpretability analysis. These results emphasize the ability of ML-powered evaluation in advancing personalized healthcare and revolutionizing the clinical management of asthma.</description>
	<pubDate>2025-12-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 3: Data-Driven Approach for Asthma Classification: Ensemble Learning with Random Forest and XGBoost</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/3">doi: 10.3390/cmsf2025012003</a></p>
	<p>Authors:
		Bhavana Santosh Pansare
		Anagha Deepak Kulkarni
		Priyanka Prabhakar Pawar
		</p>
	<p>Across the world, asthma is a prominent and widespread respiratory disorder that has a substantial clinical and socioeconomic influence. The classification of asthma subtypes should be performed precisely and effectively, with objectives such as personalized treatments, improved rehabilitation outcomes, and preventing tragic exacerbations. Typical screening approaches are primarily based on spirometry measures, immunologic assessments, and individual clinical diagnoses, and they are commonly affected by limitations such as uncertainty, crossover disparities, and restricted generalizability among various groups of patients. This study utilizes machine learning (ML) methodologies as a Data-Driven Approach (DDA)-based framework for asthma classification to overcome the mentioned challenges. Methodically constructed and evaluated classifiers, such as Random Forest and XGBoost, use the Asthma Disease Dataset from Kaggle, which consists of demographic data, lung function metrics (FEV1, FVC, FEV1/FVC ratio, and PEFR), and immunoglobulin E (IgE) biomarkers. A wide range of metrics such as accuracy, precision, recall, F1-score, receiver operating characteristic area under the curve (ROC-AUC), and average precision (AP) are used exhaustively to assess the performance of the model. The results indicate that though each model exhibits outstanding forecasting abilities, XGBoost has an enhanced classification capability, especially in recall and AP, which minimizes the proportion of false negatives, resulting in a clinically noteworthy result. The significance of the FEV1/FVC ratio, IgE levels, and PEFR as key indicators is recognized by feature interpretability analysis. These results emphasize the ability of ML-powered evaluation in advancing personalized healthcare and revolutionizing the clinical management of asthma.</p>
	]]></content:encoded>

	<dc:title>Data-Driven Approach for Asthma Classification: Ensemble Learning with Random Forest and XGBoost</dc:title>
			<dc:creator>Bhavana Santosh Pansare</dc:creator>
			<dc:creator>Anagha Deepak Kulkarni</dc:creator>
			<dc:creator>Priyanka Prabhakar Pawar</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012003</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-12-17</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-12-17</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>3</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012003</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/3</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/2">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 2: Big Tech and the Sustainable Consumer Practices: A Critical Analysis Using a Mixed Methodology</title>
	<link>https://www.mdpi.com/2813-0324/12/1/2</link>
	<description>The research is centered on how India’s top-tier IT companies—the “Big Six” of TCS, Infosys, HCLTech, Wipro, Cognizant, and Tech Mahindra—are integrating sustainability in their digitally driven operations, platforms, and business models. The study employs a mixed methodology, combining critical case study analysis with Fuzzy Delphi validation to assess triangular fuzzy numbers, centroid-based defuzzification, and consensus thresholds. The study explores how AI, big data, analytics, and digital marketing influence environmentally sustainable consumption behaviors within global ecosystems. Results show that, despite limited consumer control, these companies shape sustainability-related behavior indirectly through backend systems, digital platforms, and algorithmic logic—known as “invisible architecture”. This study confirms six main sustainability factors through expert consensus. Noteworthy among those are Digital Infrastructure for Sustainability, Platform Logic for Behavioral Change, and AI-Enabled Analytics and Recommendations. Thematic cross-case results reveal both the promise and ethical challenges of digital sustainability, including the prevalence of greenwashing and risks of overconsumption.</description>
	<pubDate>2025-12-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 2: Big Tech and the Sustainable Consumer Practices: A Critical Analysis Using a Mixed Methodology</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/2">doi: 10.3390/cmsf2025012002</a></p>
	<p>Authors:
		Bharti Singh
		Anand Pandey
		Timsy Kakkar
		</p>
	<p>The research is centered on how India’s top-tier IT companies—the “Big Six” of TCS, Infosys, HCLTech, Wipro, Cognizant, and Tech Mahindra—are integrating sustainability in their digitally driven operations, platforms, and business models. The study employs a mixed methodology, combining critical case study analysis with Fuzzy Delphi validation to assess triangular fuzzy numbers, centroid-based defuzzification, and consensus thresholds. The study explores how AI, big data, analytics, and digital marketing influence environmentally sustainable consumption behaviors within global ecosystems. Results show that, despite limited consumer control, these companies shape sustainability-related behavior indirectly through backend systems, digital platforms, and algorithmic logic—known as “invisible architecture”. This study confirms six main sustainability factors through expert consensus. Noteworthy among those are Digital Infrastructure for Sustainability, Platform Logic for Behavioral Change, and AI-Enabled Analytics and Recommendations. Thematic cross-case results reveal both the promise and ethical challenges of digital sustainability, including the prevalence of greenwashing and risks of overconsumption.</p>
	]]></content:encoded>

	<dc:title>Big Tech and the Sustainable Consumer Practices: A Critical Analysis Using a Mixed Methodology</dc:title>
			<dc:creator>Bharti Singh</dc:creator>
			<dc:creator>Anand Pandey</dc:creator>
			<dc:creator>Timsy Kakkar</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012002</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-12-17</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-12-17</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>2</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012002</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/2</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/12/1/1">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 1: Scalable Machine Learning Solutions for High-Volume Financial Transaction Fraud Detection</title>
	<link>https://www.mdpi.com/2813-0324/12/1/1</link>
	<description>More reliable and intelligent detection systems are required because of the rise in fraudulent activities brought on by the volume of digital financial transactions. In this work, the data used is from a publicly accessible dataset with more than a million transaction records to investigate a machine learning strategy to identify hidden patterns in the fraud transaction. Data preprocessing included applying Z-score normalization, eliminating outliers using the IQR method, and handling missing values according to the skewness of each attribute. The selection of important features was guided by correlation analysis using Chi-square tests and Pearson coefficients. This study implemented multiple supervised learning techniques, comprising Random Forest, Logistic Regression, K-Nearest Neighbors, and Gradient Boost to evaluate and compare their effectiveness in accurately detecting fraudulent transactions.</description>
	<pubDate>2025-12-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 12, Pages 1: Scalable Machine Learning Solutions for High-Volume Financial Transaction Fraud Detection</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/12/1/1">doi: 10.3390/cmsf2025012001</a></p>
	<p>Authors:
		Sourav Yallur
		Jiya Patil
		Tanvi Shikhari
		Prajwal Dabbanavar
		Rajashri Khanai
		Salma Shahpur
		</p>
	<p>More reliable and intelligent detection systems are required because of the rise in fraudulent activities brought on by the volume of digital financial transactions. In this work, the data used is from a publicly accessible dataset with more than a million transaction records to investigate a machine learning strategy to identify hidden patterns in the fraud transaction. Data preprocessing included applying Z-score normalization, eliminating outliers using the IQR method, and handling missing values according to the skewness of each attribute. The selection of important features was guided by correlation analysis using Chi-square tests and Pearson coefficients. This study implemented multiple supervised learning techniques, comprising Random Forest, Logistic Regression, K-Nearest Neighbors, and Gradient Boost to evaluate and compare their effectiveness in accurately detecting fraudulent transactions.</p>
	]]></content:encoded>

	<dc:title>Scalable Machine Learning Solutions for High-Volume Financial Transaction Fraud Detection</dc:title>
			<dc:creator>Sourav Yallur</dc:creator>
			<dc:creator>Jiya Patil</dc:creator>
			<dc:creator>Tanvi Shikhari</dc:creator>
			<dc:creator>Prajwal Dabbanavar</dc:creator>
			<dc:creator>Rajashri Khanai</dc:creator>
			<dc:creator>Salma Shahpur</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025012001</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-12-17</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-12-17</prism:publicationDate>
	<prism:volume>12</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>1</prism:startingPage>
		<prism:doi>10.3390/cmsf2025012001</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/12/1/1</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/33">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 33: Classifying Two Banking Cultures: The Pragmatic Structure of Economic Revelations</title>
	<link>https://www.mdpi.com/2813-0324/11/1/33</link>
	<description>This paper focuses on one specific aspect of a larger project evaluating three measures of banking risk. It emphasizes the overarching question of comparative regulatory policy: Do the European Union and the United States constitute two distinct and separate banking cultures? To answer such a question, conventional econometrics often prescribes fixed effects regression. This paper pursues an alternative approach. It directly asks whether banks on those separate continents can be distinguished using exactly the same design matrix to evaluate the proposed risk measures. The successful completion of that classification task permits the bifurcation of the overall dataset into distinct subsets, one for each continent. Parameter estimates and fitted values produced by separate regressions supply far more reliable and accurate insights into the distinct business and regulatory cultures of European and American banking.</description>
	<pubDate>2025-09-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 33: Classifying Two Banking Cultures: The Pragmatic Structure of Economic Revelations</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/33">doi: 10.3390/cmsf2025011033</a></p>
	<p>Authors:
		James Ming Chen
		Giusy Chesini
		</p>
	<p>This paper focuses on one specific aspect of a larger project evaluating three measures of banking risk. It emphasizes the overarching question of comparative regulatory policy: Do the European Union and the United States constitute two distinct and separate banking cultures? To answer such a question, conventional econometrics often prescribes fixed effects regression. This paper pursues an alternative approach. It directly asks whether banks on those separate continents can be distinguished using exactly the same design matrix to evaluate the proposed risk measures. The successful completion of that classification task permits the bifurcation of the overall dataset into distinct subsets, one for each continent. Parameter estimates and fitted values produced by separate regressions supply far more reliable and accurate insights into the distinct business and regulatory cultures of European and American banking.</p>
	]]></content:encoded>

	<dc:title>Classifying Two Banking Cultures: The Pragmatic Structure of Economic Revelations</dc:title>
			<dc:creator>James Ming Chen</dc:creator>
			<dc:creator>Giusy Chesini</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011033</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-09-09</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-09-09</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>33</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011033</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/33</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/32">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 32: Benchmarking Foundation Models for Time-Series Forecasting: Zero-Shot, Few-Shot, and Full-Shot Evaluations</title>
	<link>https://www.mdpi.com/2813-0324/11/1/32</link>
	<description>Recently, time-series forecasting foundation models trained on large, diverse datasets have demonstrated robust zero-shot and few-shot capabilities. Given the ubiquity of time-series data in IoT, finance, and industrial applications, rigorous benchmarking is essential to assess their forecasting performance and overall value. In this study, our objective is to benchmark foundational models from Amazon, Salesforce, and Google against traditional statistical and deep learning baselines on both public and proprietary industrial datasets. We evaluate zero-shot, few-shot, and full-shot scenarios using metrics such as sMAPE and NMAE on fine-tuned models, ensuring reliable comparisons. All experiments are conducted with onTime, our dedicated open-source library that guarantees reproducibility, data privacy, and flexible configuration. Our results show that foundation models often outperform traditional methods with minimal dataset-specific tuning, underscoring their potential to simplify forecasting tasks and bridge performance gaps in data-scarce settings. Additionally, we address non-performance criteria, such as integration ease, model size, and inference/training time, which are critical for real-world deployment.</description>
	<pubDate>2025-09-08</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 32: Benchmarking Foundation Models for Time-Series Forecasting: Zero-Shot, Few-Shot, and Full-Shot Evaluations</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/32">doi: 10.3390/cmsf2025011032</a></p>
	<p>Authors:
		Frédéric Montet
		Benjamin Pasquier
		Beat Wolf
		</p>
	<p>Recently, time-series forecasting foundation models trained on large, diverse datasets have demonstrated robust zero-shot and few-shot capabilities. Given the ubiquity of time-series data in IoT, finance, and industrial applications, rigorous benchmarking is essential to assess their forecasting performance and overall value. In this study, our objective is to benchmark foundational models from Amazon, Salesforce, and Google against traditional statistical and deep learning baselines on both public and proprietary industrial datasets. We evaluate zero-shot, few-shot, and full-shot scenarios using metrics such as sMAPE and NMAE on fine-tuned models, ensuring reliable comparisons. All experiments are conducted with onTime, our dedicated open-source library that guarantees reproducibility, data privacy, and flexible configuration. Our results show that foundation models often outperform traditional methods with minimal dataset-specific tuning, underscoring their potential to simplify forecasting tasks and bridge performance gaps in data-scarce settings. Additionally, we address non-performance criteria, such as integration ease, model size, and inference/training time, which are critical for real-world deployment.</p>
	]]></content:encoded>

	<dc:title>Benchmarking Foundation Models for Time-Series Forecasting: Zero-Shot, Few-Shot, and Full-Shot Evaluations</dc:title>
			<dc:creator>Frédéric Montet</dc:creator>
			<dc:creator>Benjamin Pasquier</dc:creator>
			<dc:creator>Beat Wolf</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011032</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-09-08</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-09-08</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>32</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011032</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/32</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/31">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 31: Drift and Diffusion in Panel Data: Extracting Geopolitical and Temporal Effects in a Study of Passenger Rail Traffic</title>
	<link>https://www.mdpi.com/2813-0324/11/1/31</link>
	<description>Two-stage least squares (2SLS) regression undergirds much of contemporary geospatial econometrics. Walk-forward validation in time-series forecasting constitutes a special instance of iterative local regression. Two-stage least squares and iterative regression supply distinct approaches to isolating the drift and diffusion terms in data containing deterministic and stochastic components. To demonstrate the benefits of these methods outside their native contexts, this paper applies 2SLS correction of residuals and iterative local regression to panel data on passenger railway traffic in Europe. Goodness of fit improved from r2 ≈ 0.685 to r2 ≈ 0.723 through 2SLS and to r2 ≈ 0.825 through iterative local regression. Two-stage least squares provides strong evidence of geopolitical and temporal influences. Iterative local regression produces implicit vectors of coefficients and p-values that reinforce some causal inferences of the unconditional model for rail passenger traffic while simultaneously undermining others.</description>
	<pubDate>2025-09-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 31: Drift and Diffusion in Panel Data: Extracting Geopolitical and Temporal Effects in a Study of Passenger Rail Traffic</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/31">doi: 10.3390/cmsf2025011031</a></p>
	<p>Authors:
		James Ming Chen
		Thomas Poufinas
		Angeliki C. Panagopoulou
		</p>
	<p>Two-stage least squares (2SLS) regression undergirds much of contemporary geospatial econometrics. Walk-forward validation in time-series forecasting constitutes a special instance of iterative local regression. Two-stage least squares and iterative regression supply distinct approaches to isolating the drift and diffusion terms in data containing deterministic and stochastic components. To demonstrate the benefits of these methods outside their native contexts, this paper applies 2SLS correction of residuals and iterative local regression to panel data on passenger railway traffic in Europe. Goodness of fit improved from r2 ≈ 0.685 to r2 ≈ 0.723 through 2SLS and to r2 ≈ 0.825 through iterative local regression. Two-stage least squares provides strong evidence of geopolitical and temporal influences. Iterative local regression produces implicit vectors of coefficients and p-values that reinforce some causal inferences of the unconditional model for rail passenger traffic while simultaneously undermining others.</p>
	]]></content:encoded>

	<dc:title>Drift and Diffusion in Panel Data: Extracting Geopolitical and Temporal Effects in a Study of Passenger Rail Traffic</dc:title>
			<dc:creator>James Ming Chen</dc:creator>
			<dc:creator>Thomas Poufinas</dc:creator>
			<dc:creator>Angeliki C. Panagopoulou</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011031</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-09-01</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-09-01</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>31</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011031</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/31</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/30">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 30: Interpersonal Coordination Through Granger Causality Applied to AR Processes Modeling the Time Evolution of Low-Frequency Powers of RR Intervals</title>
	<link>https://www.mdpi.com/2813-0324/11/1/30</link>
	<description>In this paper, interpersonal coordination is studied by analyzing physiological synchronization between individuals. To this end, a four-phase protocol is proposed to collect biosignals from the participants in each dyad. Then, the time evolution of the low-frequency (LF) power of the heart rate variability process for each participant is deduced. Finally, an approach based on a bivariate autoregressive model and Granger causality is proposed to determine whether a dependency exists between the biosignals. The approach is first applied to synthetic data and then to real data. This method has the advantage of providing explicit modeling of the dependency, which can help physiologists achieve better interpretation.</description>
	<pubDate>2025-08-26</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 30: Interpersonal Coordination Through Granger Causality Applied to AR Processes Modeling the Time Evolution of Low-Frequency Powers of RR Intervals</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/30">doi: 10.3390/cmsf2025011030</a></p>
	<p>Authors:
		Pierre Bouny
		Eric Grivel
		Roberto Diversi
		Veronique Deschodt Arsac
		</p>
	<p>In this paper, interpersonal coordination is studied by analyzing physiological synchronization between individuals. To this end, a four-phase protocol is proposed to collect biosignals from the participants in each dyad. Then, the time evolution of the low-frequency (LF) power of the heart rate variability process for each participant is deduced. Finally, an approach based on a bivariate autoregressive model and Granger causality is proposed to determine whether a dependency exists between the biosignals. The approach is first applied to synthetic data and then to real data. This method has the advantage of providing explicit modeling of the dependency, which can help physiologists achieve better interpretation.</p>
	]]></content:encoded>

	<dc:title>Interpersonal Coordination Through Granger Causality Applied to AR Processes Modeling the Time Evolution of Low-Frequency Powers of RR Intervals</dc:title>
			<dc:creator>Pierre Bouny</dc:creator>
			<dc:creator>Eric Grivel</dc:creator>
			<dc:creator>Roberto Diversi</dc:creator>
			<dc:creator>Veronique Deschodt Arsac</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011030</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-26</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-26</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>30</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011030</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/30</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/29">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 29: Multivariate Forecasting Evaluation: Nixtla-TimeGPT</title>
	<link>https://www.mdpi.com/2813-0324/11/1/29</link>
	<description>Generative models are being used in all domains. While primarily built for processing texts and images, their reach has been further extended towards data-driven forecasting. Whereas there are many statistical, machine learning and deep learning models for predictive forecasting, generative models are special because they do not need to be trained beforehand, saving time and computational power. Also, multivariate forecasting with the existing models is difficult when the future horizons are unknown for the regressors because they add mode uncertainties in the forecasting process. Thus, this study experiments with TimeGPT(Zeroshot) by Nixtla where it tries to identify if the generative model can outperform other models like ARIMA, Prophet, NeuralProphet, Linear Regression, XGBoost, Random Forest, LSTM, and RNN. To determine this, the research created synthetic datasets and synthetic signals to assess the individual model performances and regressor performances for 12 models. The results then used the findings to assess the performance of TimeGPT in comparison to the best fitting models in different real-world scenarios. The results showed that TimeGPT outperforms multivariate forecasting for weekly granularities by automatically selecting important regressors whereas its performance for daily and monthly granularities is still weak.</description>
	<pubDate>2025-08-26</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 29: Multivariate Forecasting Evaluation: Nixtla-TimeGPT</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/29">doi: 10.3390/cmsf2025011029</a></p>
	<p>Authors:
		S M Ahasanul Karim
		Bahram Zarrin
		Niels Buus Lassen
		</p>
	<p>Generative models are being used in all domains. While primarily built for processing texts and images, their reach has been further extended towards data-driven forecasting. Whereas there are many statistical, machine learning and deep learning models for predictive forecasting, generative models are special because they do not need to be trained beforehand, saving time and computational power. Also, multivariate forecasting with the existing models is difficult when the future horizons are unknown for the regressors because they add mode uncertainties in the forecasting process. Thus, this study experiments with TimeGPT(Zeroshot) by Nixtla where it tries to identify if the generative model can outperform other models like ARIMA, Prophet, NeuralProphet, Linear Regression, XGBoost, Random Forest, LSTM, and RNN. To determine this, the research created synthetic datasets and synthetic signals to assess the individual model performances and regressor performances for 12 models. The results then used the findings to assess the performance of TimeGPT in comparison to the best fitting models in different real-world scenarios. The results showed that TimeGPT outperforms multivariate forecasting for weekly granularities by automatically selecting important regressors whereas its performance for daily and monthly granularities is still weak.</p>
	]]></content:encoded>

	<dc:title>Multivariate Forecasting Evaluation: Nixtla-TimeGPT</dc:title>
			<dc:creator>S M Ahasanul Karim</dc:creator>
			<dc:creator>Bahram Zarrin</dc:creator>
			<dc:creator>Niels Buus Lassen</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011029</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-26</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-26</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>29</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011029</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/29</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/27">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 27: Simplicity vs. Complexity in Time Series Forecasting: A Comparative Study of iTransformer Variants</title>
	<link>https://www.mdpi.com/2813-0324/11/1/27</link>
	<description>This study re-examines the balance between architectural intricacy and generalization in Transformer models for long-term time series predictions. We perform a systematic comparison involving a lightweight baseline (iTransformer) and two enhanced versions: MiTransformer, which incorporates an external memory component for extending context, and DFiTransformer, which features dual-frequency decomposition along with Learnable Cross-Frequency Attention. All models undergo training using the same protocols across eight standard benchmarks and four forecasting periods. Findings indicate that both MiTransformer and DFiTransformer do not reliably surpass the baseline. In many instances, the increased complexity leads to greater variance and decreased accuracy, especially with unstable or inconsistent datasets. These results imply that architectural minimalism, when effectively refined, can match or surpass the effectiveness of more complex designs—challenging the prevailing trend toward increasingly intricate forecasting architectures.</description>
	<pubDate>2025-08-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 27: Simplicity vs. Complexity in Time Series Forecasting: A Comparative Study of iTransformer Variants</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/27">doi: 10.3390/cmsf2025011027</a></p>
	<p>Authors:
		Polycarp Shizawaliyi Yakoi
		Xiangfu Meng
		Danladi Suleman
		Adeleye Idowu
		Victor Adeyi Odeh
		Chunlin Yu
		</p>
	<p>This study re-examines the balance between architectural intricacy and generalization in Transformer models for long-term time series predictions. We perform a systematic comparison involving a lightweight baseline (iTransformer) and two enhanced versions: MiTransformer, which incorporates an external memory component for extending context, and DFiTransformer, which features dual-frequency decomposition along with Learnable Cross-Frequency Attention. All models undergo training using the same protocols across eight standard benchmarks and four forecasting periods. Findings indicate that both MiTransformer and DFiTransformer do not reliably surpass the baseline. In many instances, the increased complexity leads to greater variance and decreased accuracy, especially with unstable or inconsistent datasets. These results imply that architectural minimalism, when effectively refined, can match or surpass the effectiveness of more complex designs—challenging the prevailing trend toward increasingly intricate forecasting architectures.</p>
	]]></content:encoded>

	<dc:title>Simplicity vs. Complexity in Time Series Forecasting: A Comparative Study of iTransformer Variants</dc:title>
			<dc:creator>Polycarp Shizawaliyi Yakoi</dc:creator>
			<dc:creator>Xiangfu Meng</dc:creator>
			<dc:creator>Danladi Suleman</dc:creator>
			<dc:creator>Adeleye Idowu</dc:creator>
			<dc:creator>Victor Adeyi Odeh</dc:creator>
			<dc:creator>Chunlin Yu</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011027</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-22</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-22</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>27</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011027</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/27</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/20">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 20: Should You Sleep or Trade Bitcoin?</title>
	<link>https://www.mdpi.com/2813-0324/11/1/20</link>
	<description>Dramatic price swings and the possibility of extreme returns have made Bitcoin a hot topic of interest for investors and researchers alike. With the help of advanced neural network models including CNN, RCNN, and LSTM networks, this paper has delved deep into the intricacies of Bitcoin price behavior. We will study different time intervals—close-to-close, close-to-open, open-to-close, and day-to-day—to find a pattern that we can use to develop an investment strategy. The average volatility over a year, six months, and three months is compared with the predictive power of volatility versus a traditional buy-and-hold strategy. Our findings point out the strengths and weaknesses of each neural network model and provide useful insights into optimizing cryptocurrency portfolios. This study contributes to the literature on the price prediction and volatility analysis of cryptocurrencies, thus providing useful information to both researchers and investors to execute strategic steps within the volatile cryptocurrency market.</description>
	<pubDate>2025-08-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 20: Should You Sleep or Trade Bitcoin?</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/20">doi: 10.3390/cmsf2025011020</a></p>
	<p>Authors:
		Paridhi Talwar
		Aman Jain
		Eugene Pinsky
		</p>
	<p>Dramatic price swings and the possibility of extreme returns have made Bitcoin a hot topic of interest for investors and researchers alike. With the help of advanced neural network models including CNN, RCNN, and LSTM networks, this paper has delved deep into the intricacies of Bitcoin price behavior. We will study different time intervals—close-to-close, close-to-open, open-to-close, and day-to-day—to find a pattern that we can use to develop an investment strategy. The average volatility over a year, six months, and three months is compared with the predictive power of volatility versus a traditional buy-and-hold strategy. Our findings point out the strengths and weaknesses of each neural network model and provide useful insights into optimizing cryptocurrency portfolios. This study contributes to the literature on the price prediction and volatility analysis of cryptocurrencies, thus providing useful information to both researchers and investors to execute strategic steps within the volatile cryptocurrency market.</p>
	]]></content:encoded>

	<dc:title>Should You Sleep or Trade Bitcoin?</dc:title>
			<dc:creator>Paridhi Talwar</dc:creator>
			<dc:creator>Aman Jain</dc:creator>
			<dc:creator>Eugene Pinsky</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011020</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-22</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-22</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>20</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011020</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/20</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/19">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 19: Estimating Forecast Accuracy Metrics by Learning from Time Series Characteristics</title>
	<link>https://www.mdpi.com/2813-0324/11/1/19</link>
	<description>Accurate forecasts play a crucial role in various industries, where enhancing forecast accuracy has been a major focus of research. However, for volatile data and industrial applications, ensuring the reliability and interpretability of forecast results is equally important. This study shifts the focus from predicting future values to estimating forecast accuracy with confidence when no future validation data is present. To achieve this, we use time series characteristics calculated by statistical tests and estimate forecast accuracy metrics. For this, two methods are applied: Estimation by the euclidean distances between time series characteristic values, and second, estimation by clustering of time series characteristics. In-sample forecast accuracy serves as a benchmark method. A diverse, industrial data set is used to evaluate the methods. The results demonstrate that there is significant correlation between certain time series characteristics and estimation quality of forecast accuracy metrics. For all forecast accuracy metrics, the two proposed methods outperform the in-sample forecast estimation. These findings contribute to improving the reliability and interpretability of forecast evaluations, particularly in industrial applications with unstable data.</description>
	<pubDate>2025-08-19</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 19: Estimating Forecast Accuracy Metrics by Learning from Time Series Characteristics</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/19">doi: 10.3390/cmsf2025011019</a></p>
	<p>Authors:
		Alina Timmermann
		Ananya Pal
		</p>
	<p>Accurate forecasts play a crucial role in various industries, where enhancing forecast accuracy has been a major focus of research. However, for volatile data and industrial applications, ensuring the reliability and interpretability of forecast results is equally important. This study shifts the focus from predicting future values to estimating forecast accuracy with confidence when no future validation data is present. To achieve this, we use time series characteristics calculated by statistical tests and estimate forecast accuracy metrics. For this, two methods are applied: Estimation by the euclidean distances between time series characteristic values, and second, estimation by clustering of time series characteristics. In-sample forecast accuracy serves as a benchmark method. A diverse, industrial data set is used to evaluate the methods. The results demonstrate that there is significant correlation between certain time series characteristics and estimation quality of forecast accuracy metrics. For all forecast accuracy metrics, the two proposed methods outperform the in-sample forecast estimation. These findings contribute to improving the reliability and interpretability of forecast evaluations, particularly in industrial applications with unstable data.</p>
	]]></content:encoded>

	<dc:title>Estimating Forecast Accuracy Metrics by Learning from Time Series Characteristics</dc:title>
			<dc:creator>Alina Timmermann</dc:creator>
			<dc:creator>Ananya Pal</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011019</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-19</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-19</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>19</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011019</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/19</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/26">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 26: The Explainability of Machine Learning Algorithms for Victory Prediction in the Video Game Dota 2 </title>
	<link>https://www.mdpi.com/2813-0324/11/1/26</link>
	<description>Video games, especially competitive ones such as Dota 2, have gained great relevance both as entertainment and in e-sports, where predicting the outcome of games can offer significant strategic advantages. In this context, machine learning (ML) is presented as a useful tool for analysing and predicting performance in these games based on data collected before the start of the games, such as character selection information. Thus, in this work, we have developed and tested ML models, including Random Forest and Gradient Boosting, to predict the outcome of Dota 2 matches. This study is innovative in that it incorporates explainability techniques using Shapley Additive Explanations (SHAP) graphs, allowing us to understand which specific factors influence model predictions. Data extracted from the OpenDota API were preprocessed and used to train the models, evaluating them using metrics such as accuracy, precision, recall, F1-score, and cross-validated accuracy. The results indicate that predictive models, particularly Random Forest, can accurately predict game outcomes based only on pregame information, also suggesting that the explainability of machine learning techniques can be effective for analysing strategic factors in competitive video games.</description>
	<pubDate>2025-08-18</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 26: The Explainability of Machine Learning Algorithms for Victory Prediction in the Video Game Dota 2 </b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/26">doi: 10.3390/cmsf2025011026</a></p>
	<p>Authors:
		Julio Losada-Rodríguez
		Pedro A. Castillo
		Antonio Mora
		Pablo García-Sánchez
		</p>
	<p>Video games, especially competitive ones such as Dota 2, have gained great relevance both as entertainment and in e-sports, where predicting the outcome of games can offer significant strategic advantages. In this context, machine learning (ML) is presented as a useful tool for analysing and predicting performance in these games based on data collected before the start of the games, such as character selection information. Thus, in this work, we have developed and tested ML models, including Random Forest and Gradient Boosting, to predict the outcome of Dota 2 matches. This study is innovative in that it incorporates explainability techniques using Shapley Additive Explanations (SHAP) graphs, allowing us to understand which specific factors influence model predictions. Data extracted from the OpenDota API were preprocessed and used to train the models, evaluating them using metrics such as accuracy, precision, recall, F1-score, and cross-validated accuracy. The results indicate that predictive models, particularly Random Forest, can accurately predict game outcomes based only on pregame information, also suggesting that the explainability of machine learning techniques can be effective for analysing strategic factors in competitive video games.</p>
	]]></content:encoded>

	<dc:title>The Explainability of Machine Learning Algorithms for Victory Prediction in the Video Game Dota 2 </dc:title>
			<dc:creator>Julio Losada-Rodríguez</dc:creator>
			<dc:creator>Pedro A. Castillo</dc:creator>
			<dc:creator>Antonio Mora</dc:creator>
			<dc:creator>Pablo García-Sánchez</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011026</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-18</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-18</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>26</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011026</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/26</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/25">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 25: Comparative Analysis of Forecasting Models for Disability Resource Planning in Brazil’s National Textbook Program</title>
	<link>https://www.mdpi.com/2813-0324/11/1/25</link>
	<description>The accurate forecasting of student disability trends is essential for optimizing educational accessibility and resource distribution in the context of Brazil’s oldest public policy, the National Textbook Program (PNLD). This study applies machine learning (ML) and time series forecasting models (TSF) to predict the number of visually impaired students in Brazil using educational census data from 2021 to 2023, with the aim of estimating the amount of Braille textbooks to be acquired in the PNLD’s context. By performing a comparative analysis on various ML models (e.g, Naive Bayes, ElasticNet, gradient boosting) and TSF techniques (e.g., ARIMA and SARIMA models, as well as exponential smoothing) to predict future enrollment trends, we identify the most effective approaches for school-level and long-term disability enrollment predictions. Results show that ElasticNet and gradient boosting excel in forecasting enrollment estimations over TSF models. Despite challenges related to data inconsistencies and reporting variations, incorporating external demographic and health data could further improve predictive accuracy. This research contributes to AI-driven educational accessibility by demonstrating how predictive analytics can enhance policy decisions and ensure an equitable distribution of resources for students with disabilities.</description>
	<pubDate>2025-08-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 25: Comparative Analysis of Forecasting Models for Disability Resource Planning in Brazil’s National Textbook Program</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/25">doi: 10.3390/cmsf2025011025</a></p>
	<p>Authors:
		Luciano Cabral
		Luam Santos
		Jário Santos Júnior
		Thyago Oliveira
		Dalgoberto Pinho Júnior
		Nicholas Cruz
		Joana Lobo
		Breno Duarte
		Lenardo Silva
		Rafael Silva
		Bruno Pimentel
		</p>
	<p>The accurate forecasting of student disability trends is essential for optimizing educational accessibility and resource distribution in the context of Brazil’s oldest public policy, the National Textbook Program (PNLD). This study applies machine learning (ML) and time series forecasting models (TSF) to predict the number of visually impaired students in Brazil using educational census data from 2021 to 2023, with the aim of estimating the amount of Braille textbooks to be acquired in the PNLD’s context. By performing a comparative analysis on various ML models (e.g, Naive Bayes, ElasticNet, gradient boosting) and TSF techniques (e.g., ARIMA and SARIMA models, as well as exponential smoothing) to predict future enrollment trends, we identify the most effective approaches for school-level and long-term disability enrollment predictions. Results show that ElasticNet and gradient boosting excel in forecasting enrollment estimations over TSF models. Despite challenges related to data inconsistencies and reporting variations, incorporating external demographic and health data could further improve predictive accuracy. This research contributes to AI-driven educational accessibility by demonstrating how predictive analytics can enhance policy decisions and ensure an equitable distribution of resources for students with disabilities.</p>
	]]></content:encoded>

	<dc:title>Comparative Analysis of Forecasting Models for Disability Resource Planning in Brazil’s National Textbook Program</dc:title>
			<dc:creator>Luciano Cabral</dc:creator>
			<dc:creator>Luam Santos</dc:creator>
			<dc:creator>Jário Santos Júnior</dc:creator>
			<dc:creator>Thyago Oliveira</dc:creator>
			<dc:creator>Dalgoberto Pinho Júnior</dc:creator>
			<dc:creator>Nicholas Cruz</dc:creator>
			<dc:creator>Joana Lobo</dc:creator>
			<dc:creator>Breno Duarte</dc:creator>
			<dc:creator>Lenardo Silva</dc:creator>
			<dc:creator>Rafael Silva</dc:creator>
			<dc:creator>Bruno Pimentel</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011025</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-13</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-13</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>25</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011025</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/25</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/24">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 24: Drift and Diffusion in Geospatial Econometrics: Implications for Panel Data and Time Series</title>
	<link>https://www.mdpi.com/2813-0324/11/1/24</link>
	<description>Economic data is highly dependent on its arrangement within space and time. Perhaps the most obvious and important definition of space is geospatial configuration on the Earth’s surface. Consideration of geospatial effects produces a dramatic improvement in the prediction of median housing prices across 20,640 districts in California. Unconditional regression with engineered variables, two-stage least squares regression (2SLS), and iterative local regression approach r2 ≈ 0.8536, the goodness of fit attained in the original California study. Geospatial methods can be generalized to panel data analysis and time-series forecasting. Distance-sensitive analysis reveals the value of treating time-variant data as potentially discrete and discontinuous. This insight highlights the value of methodologies that suspend the assumption that data varies in a continuous or even linear fashion across space and time.</description>
	<pubDate>2025-08-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 24: Drift and Diffusion in Geospatial Econometrics: Implications for Panel Data and Time Series</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/24">doi: 10.3390/cmsf2025011024</a></p>
	<p>Authors:
		James Ming Chen
		</p>
	<p>Economic data is highly dependent on its arrangement within space and time. Perhaps the most obvious and important definition of space is geospatial configuration on the Earth’s surface. Consideration of geospatial effects produces a dramatic improvement in the prediction of median housing prices across 20,640 districts in California. Unconditional regression with engineered variables, two-stage least squares regression (2SLS), and iterative local regression approach r2 ≈ 0.8536, the goodness of fit attained in the original California study. Geospatial methods can be generalized to panel data analysis and time-series forecasting. Distance-sensitive analysis reveals the value of treating time-variant data as potentially discrete and discontinuous. This insight highlights the value of methodologies that suspend the assumption that data varies in a continuous or even linear fashion across space and time.</p>
	]]></content:encoded>

	<dc:title>Drift and Diffusion in Geospatial Econometrics: Implications for Panel Data and Time Series</dc:title>
			<dc:creator>James Ming Chen</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011024</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-11</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-11</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>24</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011024</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/24</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/23">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 23: Enhancing Public Health Insights and Interpretation Through AI-Driven Time-Series Analysis: Hierarchical Clustering, Hamming Distance, and Binary Tree Visualization of Infectious Disease Trends</title>
	<link>https://www.mdpi.com/2813-0324/11/1/23</link>
	<description>This paper applies hierarchical clustering and Hamming Distance to analyze the temporal trends of infectious diseases across different regions of Uzbekistan. By leveraging hierarchical clustering, we effectively group regions based on disease similarity without requiring predefined cluster numbers. Hamming Distance further quantifies disease trajectory similarities, helping assess epidemiological patterns over time. Binary tree visualizations enhance the interpretability of clustering results, offering a novel method for identifying regional trends. The dataset includes yearly incidence rates of seven infectious diseases from 2012 to 2019, along with population, healthcare infrastructure, and geographic attributes for each region. This approach provides an interpretable framework for public health analysis and decision-making.</description>
	<pubDate>2025-08-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 23: Enhancing Public Health Insights and Interpretation Through AI-Driven Time-Series Analysis: Hierarchical Clustering, Hamming Distance, and Binary Tree Visualization of Infectious Disease Trends</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/23">doi: 10.3390/cmsf2025011023</a></p>
	<p>Authors:
		Ayauzhan Arystambekova
		Eugene Pinsky
		</p>
	<p>This paper applies hierarchical clustering and Hamming Distance to analyze the temporal trends of infectious diseases across different regions of Uzbekistan. By leveraging hierarchical clustering, we effectively group regions based on disease similarity without requiring predefined cluster numbers. Hamming Distance further quantifies disease trajectory similarities, helping assess epidemiological patterns over time. Binary tree visualizations enhance the interpretability of clustering results, offering a novel method for identifying regional trends. The dataset includes yearly incidence rates of seven infectious diseases from 2012 to 2019, along with population, healthcare infrastructure, and geographic attributes for each region. This approach provides an interpretable framework for public health analysis and decision-making.</p>
	]]></content:encoded>

	<dc:title>Enhancing Public Health Insights and Interpretation Through AI-Driven Time-Series Analysis: Hierarchical Clustering, Hamming Distance, and Binary Tree Visualization of Infectious Disease Trends</dc:title>
			<dc:creator>Ayauzhan Arystambekova</dc:creator>
			<dc:creator>Eugene Pinsky</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011023</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-11</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-11</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>23</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011023</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/23</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/22">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 22: Exploring Multi-Modal LLMs for Time Series Anomaly Detection</title>
	<link>https://www.mdpi.com/2813-0324/11/1/22</link>
	<description>Anomaly detection in time series data is crucial across various domains. Traditional methods often struggle with continuously evolving time series requiring adjustment, whereas large language models (LLMs) and multi-modal LLMs (MLLMs) have emerged as promising zero-shot anomaly detectors by leveraging embedded knowledge. This study expands recent evaluations of MLLMs for zero-shot time series anomaly detection by exploring newer models, additional input representations, varying input sizes, and conducting further analyses. Our findings reveal that while MLLMs are effective for zero-shot detection, they still face limitations, such as effectively integrating both text and vision representations or handling longer input lengths. These challenges unveil diverse opportunities for future improvements.</description>
	<pubDate>2025-08-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 22: Exploring Multi-Modal LLMs for Time Series Anomaly Detection</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/22">doi: 10.3390/cmsf2025011022</a></p>
	<p>Authors:
		Hao Niu
		Guillaume Habault
		Huy Quang Ung
		Roberto Legaspi
		Zhi Li
		Yanan Wang
		Donghuo Zeng
		Julio Vizcarra
		Masato Taya
		</p>
	<p>Anomaly detection in time series data is crucial across various domains. Traditional methods often struggle with continuously evolving time series requiring adjustment, whereas large language models (LLMs) and multi-modal LLMs (MLLMs) have emerged as promising zero-shot anomaly detectors by leveraging embedded knowledge. This study expands recent evaluations of MLLMs for zero-shot time series anomaly detection by exploring newer models, additional input representations, varying input sizes, and conducting further analyses. Our findings reveal that while MLLMs are effective for zero-shot detection, they still face limitations, such as effectively integrating both text and vision representations or handling longer input lengths. These challenges unveil diverse opportunities for future improvements.</p>
	]]></content:encoded>

	<dc:title>Exploring Multi-Modal LLMs for Time Series Anomaly Detection</dc:title>
			<dc:creator>Hao Niu</dc:creator>
			<dc:creator>Guillaume Habault</dc:creator>
			<dc:creator>Huy Quang Ung</dc:creator>
			<dc:creator>Roberto Legaspi</dc:creator>
			<dc:creator>Zhi Li</dc:creator>
			<dc:creator>Yanan Wang</dc:creator>
			<dc:creator>Donghuo Zeng</dc:creator>
			<dc:creator>Julio Vizcarra</dc:creator>
			<dc:creator>Masato Taya</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011022</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-11</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-11</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>22</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011022</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/22</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/21">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 21: Forecasting Techniques for Univariate Time Series Data: Analysis and Practical Applications by Category</title>
	<link>https://www.mdpi.com/2813-0324/11/1/21</link>
	<description>Effective forecasting is vital in various domains as it supports informed decision-making and risk mitigation. This paper aims to improve the selection of appropriate forecasting methods for univariate time series. We propose a systematic categorization based on key characteristics, such as stationarity and seasonality and analyze well-known forecasting techniques suitable for each category. Additionally, we examine how forecasting horizons, the time periods for which forecasts are generated, affect method performance, thus addressing a significant gap in the existing literature. Our findings reveal that certain techniques excel in specific categories and demonstrate performance progression over time, indicating how they improve or decline relative to other techniques. By enhancing the understanding of method effectiveness across diverse time series characteristics, this research aims to guide professionals in making informed choices for their forecasting needs.</description>
	<pubDate>2025-08-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 21: Forecasting Techniques for Univariate Time Series Data: Analysis and Practical Applications by Category</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/21">doi: 10.3390/cmsf2025011021</a></p>
	<p>Authors:
		Leonard Dervishi
		Antonios Raptakis
		Gerald Bieber
		</p>
	<p>Effective forecasting is vital in various domains as it supports informed decision-making and risk mitigation. This paper aims to improve the selection of appropriate forecasting methods for univariate time series. We propose a systematic categorization based on key characteristics, such as stationarity and seasonality and analyze well-known forecasting techniques suitable for each category. Additionally, we examine how forecasting horizons, the time periods for which forecasts are generated, affect method performance, thus addressing a significant gap in the existing literature. Our findings reveal that certain techniques excel in specific categories and demonstrate performance progression over time, indicating how they improve or decline relative to other techniques. By enhancing the understanding of method effectiveness across diverse time series characteristics, this research aims to guide professionals in making informed choices for their forecasting needs.</p>
	]]></content:encoded>

	<dc:title>Forecasting Techniques for Univariate Time Series Data: Analysis and Practical Applications by Category</dc:title>
			<dc:creator>Leonard Dervishi</dc:creator>
			<dc:creator>Antonios Raptakis</dc:creator>
			<dc:creator>Gerald Bieber</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011021</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-11</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-11</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>21</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011021</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/21</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/17">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 17: Emergent Behavior and Computational Capabilities in Nonlinear Systems: Advancing Applications in Time Series Forecasting and Predictive Modeling</title>
	<link>https://www.mdpi.com/2813-0324/11/1/17</link>
	<description>Natural dynamical systems can often display various long-term behaviours, ranging from entirely predictable decaying states to unpredictable, chaotic regimes or, more interestingly, highly correlated and intricate states featuring emergent phenomena. That, of course, imposes a level of generality on the models we use to study them. Among those models, coupled oscillators and cellular automata (CA) present a unique opportunity to advance the understanding of complex temporal behaviours because of their conceptual simplicity but very rich dynamics. In this contribution, we review the work completed by our research team over the last few years in the development and application of an alternative information-based characterization scheme to study the emergent behaviour and information handling of nonlinear systems, specifically Adler-type oscillators under different types of coupling: local phase-dependent (LAP) coupling and Kuramoto-like local (LAK) coupling. We thoroughly studied the long-term dynamics of these systems, identifying several distinct dynamic regimes, ranging from periodic to chaotic and complex. The systems were analysed qualitatively and quantitatively, drawing on entropic measures and information theory. Measures such as entropy density (Shannon entropy rate), effective complexity measure, and Lempel–Ziv complexity/information distance were employed. Our analysis revealed similar patterns and behaviours between these systems and CA, which are computationally capable systems, for some specific rules and regimes. These findings further reinforce the argument around computational capabilities in dynamical systems, as understood by information transmission, storage, and generation measures. Furthermore, the edge of chaos hypothesis (EOC) was verified in coupled oscillators systems for specific regions of parameter space, where a sudden increase in effective complexity measure was observed, indicating enhanced information processing capabilities. Given the potential for exploiting this non-anthropocentric computational power, we propose this alternative information-based characterization scheme as a general framework to identify a dynamical system’s proximity to computationally enhanced states. Furthermore, this study advances the understanding of emergent behaviour in nonlinear systems. It explores the potential for leveraging the features of dynamical systems operating at the edge of chaos by coupling them with computationally capable settings within machine learning frameworks, specifically by using them as reservoirs in Echo State Networks (ESNs) for time series forecasting and predictive modeling. This approach aims to enhance the predictive capacity, particularly that of chaotic systems, by utilising EOC systems’ complex, sensitive dynamics as the ESN reservoir.</description>
	<pubDate>2025-08-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 17: Emergent Behavior and Computational Capabilities in Nonlinear Systems: Advancing Applications in Time Series Forecasting and Predictive Modeling</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/17">doi: 10.3390/cmsf2025011017</a></p>
	<p>Authors:
		Kárel García-Medina
		Daniel Estevez-Moya
		Ernesto Estevez-Rams
		Reinhard B. Neder
		</p>
	<p>Natural dynamical systems can often display various long-term behaviours, ranging from entirely predictable decaying states to unpredictable, chaotic regimes or, more interestingly, highly correlated and intricate states featuring emergent phenomena. That, of course, imposes a level of generality on the models we use to study them. Among those models, coupled oscillators and cellular automata (CA) present a unique opportunity to advance the understanding of complex temporal behaviours because of their conceptual simplicity but very rich dynamics. In this contribution, we review the work completed by our research team over the last few years in the development and application of an alternative information-based characterization scheme to study the emergent behaviour and information handling of nonlinear systems, specifically Adler-type oscillators under different types of coupling: local phase-dependent (LAP) coupling and Kuramoto-like local (LAK) coupling. We thoroughly studied the long-term dynamics of these systems, identifying several distinct dynamic regimes, ranging from periodic to chaotic and complex. The systems were analysed qualitatively and quantitatively, drawing on entropic measures and information theory. Measures such as entropy density (Shannon entropy rate), effective complexity measure, and Lempel–Ziv complexity/information distance were employed. Our analysis revealed similar patterns and behaviours between these systems and CA, which are computationally capable systems, for some specific rules and regimes. These findings further reinforce the argument around computational capabilities in dynamical systems, as understood by information transmission, storage, and generation measures. Furthermore, the edge of chaos hypothesis (EOC) was verified in coupled oscillators systems for specific regions of parameter space, where a sudden increase in effective complexity measure was observed, indicating enhanced information processing capabilities. Given the potential for exploiting this non-anthropocentric computational power, we propose this alternative information-based characterization scheme as a general framework to identify a dynamical system’s proximity to computationally enhanced states. Furthermore, this study advances the understanding of emergent behaviour in nonlinear systems. It explores the potential for leveraging the features of dynamical systems operating at the edge of chaos by coupling them with computationally capable settings within machine learning frameworks, specifically by using them as reservoirs in Echo State Networks (ESNs) for time series forecasting and predictive modeling. This approach aims to enhance the predictive capacity, particularly that of chaotic systems, by utilising EOC systems’ complex, sensitive dynamics as the ESN reservoir.</p>
	]]></content:encoded>

	<dc:title>Emergent Behavior and Computational Capabilities in Nonlinear Systems: Advancing Applications in Time Series Forecasting and Predictive Modeling</dc:title>
			<dc:creator>Kárel García-Medina</dc:creator>
			<dc:creator>Daniel Estevez-Moya</dc:creator>
			<dc:creator>Ernesto Estevez-Rams</dc:creator>
			<dc:creator>Reinhard B. Neder</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011017</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-11</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-11</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>17</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011017</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/17</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/16">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 16: Fundamentals of Time Series Analysis in Electricity Price Forecasting</title>
	<link>https://www.mdpi.com/2813-0324/11/1/16</link>
	<description>Time series forecasting is a cornerstone of decision-making in energy and finance, yet many studies fail to rigorously analyse the underlying dataset characteristics, leading to suboptimal model selection and unreliable outcomes. This paper addresses these shortcomings by presenting a comprehensive framework that integrates fundamental time series diagnostics—stationarity tests, autocorrelation analysis, heteroscedasticity, multicollinearity, and correlation analysis—into forecasting workflows. Unlike existing studies that prioritise pre-packaged machine learning and deep learning methods, often at the expense of interpretable statistical benchmarks, our approach advocates for the combined use of statistical models alongside advanced machine learning methods. Using the Day-Ahead Market dataset from the Irish electricity market as a case study, we demonstrate how rigorous statistical diagnostics can guide model selection, improve interpretability, and improve forecasting accuracy. This work offers a novel, integrative methodology that bridges the gap between statistical rigour and modern computational techniques, improving reliability in time series forecasting.</description>
	<pubDate>2025-08-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 16: Fundamentals of Time Series Analysis in Electricity Price Forecasting</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/16">doi: 10.3390/cmsf2025011016</a></p>
	<p>Authors:
		Ciaran O’Connor
		Andrea Visentin
		Steven Prestwich
		</p>
	<p>Time series forecasting is a cornerstone of decision-making in energy and finance, yet many studies fail to rigorously analyse the underlying dataset characteristics, leading to suboptimal model selection and unreliable outcomes. This paper addresses these shortcomings by presenting a comprehensive framework that integrates fundamental time series diagnostics—stationarity tests, autocorrelation analysis, heteroscedasticity, multicollinearity, and correlation analysis—into forecasting workflows. Unlike existing studies that prioritise pre-packaged machine learning and deep learning methods, often at the expense of interpretable statistical benchmarks, our approach advocates for the combined use of statistical models alongside advanced machine learning methods. Using the Day-Ahead Market dataset from the Irish electricity market as a case study, we demonstrate how rigorous statistical diagnostics can guide model selection, improve interpretability, and improve forecasting accuracy. This work offers a novel, integrative methodology that bridges the gap between statistical rigour and modern computational techniques, improving reliability in time series forecasting.</p>
	]]></content:encoded>

	<dc:title>Fundamentals of Time Series Analysis in Electricity Price Forecasting</dc:title>
			<dc:creator>Ciaran O’Connor</dc:creator>
			<dc:creator>Andrea Visentin</dc:creator>
			<dc:creator>Steven Prestwich</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011016</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-11</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-11</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>16</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011016</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/16</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/15">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 15: Leveraging Exogenous Regressors in Demand Forecasting</title>
	<link>https://www.mdpi.com/2813-0324/11/1/15</link>
	<description>Demand forecasting is different from traditional forecasting because it is a process of forecasting multiple time series collectively. It is challenging to implement models that can generalise and perform well while forecasting many time series altogether, based on accuracy and scalability. Moreover, there can be external influences like holidays, disasters, promotions, etc., creating drifts and structural breaks, making accurate demand forecasting a challenge. Again, these external features used for multivariate forecasting often worsen the prediction accuracy because there are more unknowns in the forecasting process. This paper attempts to explore effective ways of leveraging the exogenous regressors to surpass the accuracy of the univariate approach by creating synthetic scenarios to understand the model and regressors’ performances. This paper finds that the forecastability of the correlated external features plays a big role in determining whether it would improve or worsen accuracy for models like ARIMA, yet even 100% accurately forecasted extra regressors sometimes fail to surpass their univariate predictive accuracy. The findings are replicated in cases like forecasting weekly docked bike demand per station every hour, where the multivariate approach outperformed the univariate approach by forecasting the regressors with Bi-LSTM and using their predicted values for forecasting the target demand with ARIMA.</description>
	<pubDate>2025-08-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 15: Leveraging Exogenous Regressors in Demand Forecasting</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/15">doi: 10.3390/cmsf2025011015</a></p>
	<p>Authors:
		S M Ahasanul Karim
		Bahram Zarrin
		Niels Buus Lassen
		</p>
	<p>Demand forecasting is different from traditional forecasting because it is a process of forecasting multiple time series collectively. It is challenging to implement models that can generalise and perform well while forecasting many time series altogether, based on accuracy and scalability. Moreover, there can be external influences like holidays, disasters, promotions, etc., creating drifts and structural breaks, making accurate demand forecasting a challenge. Again, these external features used for multivariate forecasting often worsen the prediction accuracy because there are more unknowns in the forecasting process. This paper attempts to explore effective ways of leveraging the exogenous regressors to surpass the accuracy of the univariate approach by creating synthetic scenarios to understand the model and regressors’ performances. This paper finds that the forecastability of the correlated external features plays a big role in determining whether it would improve or worsen accuracy for models like ARIMA, yet even 100% accurately forecasted extra regressors sometimes fail to surpass their univariate predictive accuracy. The findings are replicated in cases like forecasting weekly docked bike demand per station every hour, where the multivariate approach outperformed the univariate approach by forecasting the regressors with Bi-LSTM and using their predicted values for forecasting the target demand with ARIMA.</p>
	]]></content:encoded>

	<dc:title>Leveraging Exogenous Regressors in Demand Forecasting</dc:title>
			<dc:creator>S M Ahasanul Karim</dc:creator>
			<dc:creator>Bahram Zarrin</dc:creator>
			<dc:creator>Niels Buus Lassen</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011015</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-01</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-01</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>15</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011015</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/15</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/14">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 14: Beyond the Hodrick Prescott Filter: Wavelets and the Dynamics of U.S.–Mexico Trade</title>
	<link>https://www.mdpi.com/2813-0324/11/1/14</link>
	<description>This study analyzes the evolution of the Mexico–U.S. trade balance as a seasonally adjusted time series, comparing the Hodrick–Prescott (HP) filter and wavelet analysis. The HP filter allowed the trend and cycle to be extracted from the series, while wavelets decomposed the information into different time scales, revealing short-, medium-, and long-term fluctuations. The results show that HP provides a simplified view of the trend, while wavelets more accurately capture key events and cyclical dynamics. It is concluded that wavelets offer a more robust tool for studying the volatility and persistence of economic shocks in bilateral trade.</description>
	<pubDate>2025-08-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 14: Beyond the Hodrick Prescott Filter: Wavelets and the Dynamics of U.S.–Mexico Trade</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/14">doi: 10.3390/cmsf2025011014</a></p>
	<p>Authors:
		José Gerardo Covarrubias
		Xuedong Liu
		</p>
	<p>This study analyzes the evolution of the Mexico–U.S. trade balance as a seasonally adjusted time series, comparing the Hodrick–Prescott (HP) filter and wavelet analysis. The HP filter allowed the trend and cycle to be extracted from the series, while wavelets decomposed the information into different time scales, revealing short-, medium-, and long-term fluctuations. The results show that HP provides a simplified view of the trend, while wavelets more accurately capture key events and cyclical dynamics. It is concluded that wavelets offer a more robust tool for studying the volatility and persistence of economic shocks in bilateral trade.</p>
	]]></content:encoded>

	<dc:title>Beyond the Hodrick Prescott Filter: Wavelets and the Dynamics of U.S.–Mexico Trade</dc:title>
			<dc:creator>José Gerardo Covarrubias</dc:creator>
			<dc:creator>Xuedong Liu</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011014</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-01</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-01</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>14</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011014</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/14</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/11">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 11: Inclusive Turnout for Equitable Policies: Using Time Series Forecasting to Combat Policy Polarization</title>
	<link>https://www.mdpi.com/2813-0324/11/1/11</link>
	<description>Selective voter mobilization dominates U.S. elections, with campaigns prioritizing swing voters to win critical states. While effective for a short-term period, this strategy deepens policy polarization, marginalizes minorities, and undermines representative democracy. This paper investigates voter turnout disparities and policy manipulation using advanced time series forecasting models (ARIMA, LSTM, and seasonal decomposition). Analyzing demographic and geographic data, we uncover significant turnout inequities, particularly for marginalized groups, and propose actionable reforms to enhance equitable voter participation. By integrating data-driven insights with theoretical perspectives, this study offers practical recommendations for campaigns and policymakers to counter polarization and foster inclusive democratic representation.</description>
	<pubDate>2025-08-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 11: Inclusive Turnout for Equitable Policies: Using Time Series Forecasting to Combat Policy Polarization</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/11">doi: 10.3390/cmsf2025011011</a></p>
	<p>Authors:
		Natasya Liew
		Sreeya R. K. Haninatha
		Sarthak Pattnaik
		Kathleen Park
		Eugene Pinsky
		</p>
	<p>Selective voter mobilization dominates U.S. elections, with campaigns prioritizing swing voters to win critical states. While effective for a short-term period, this strategy deepens policy polarization, marginalizes minorities, and undermines representative democracy. This paper investigates voter turnout disparities and policy manipulation using advanced time series forecasting models (ARIMA, LSTM, and seasonal decomposition). Analyzing demographic and geographic data, we uncover significant turnout inequities, particularly for marginalized groups, and propose actionable reforms to enhance equitable voter participation. By integrating data-driven insights with theoretical perspectives, this study offers practical recommendations for campaigns and policymakers to counter polarization and foster inclusive democratic representation.</p>
	]]></content:encoded>

	<dc:title>Inclusive Turnout for Equitable Policies: Using Time Series Forecasting to Combat Policy Polarization</dc:title>
			<dc:creator>Natasya Liew</dc:creator>
			<dc:creator>Sreeya R. K. Haninatha</dc:creator>
			<dc:creator>Sarthak Pattnaik</dc:creator>
			<dc:creator>Kathleen Park</dc:creator>
			<dc:creator>Eugene Pinsky</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011011</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-08-01</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-08-01</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>11</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011011</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/11</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/37">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 37: Tracking Trans-Generational Stress Susceptibility in the Farm Animal Using AI</title>
	<link>https://www.mdpi.com/2813-0324/11/1/37</link>
	<description>Stress, being an inherent trait, is a major driver of farm animal disease, leading to significant antimicrobial use (AMU). AMU is the recognized source of antimicrobial resistance (AMR). Among other ways, AMR spread can be controlled by selective breeding. To address this, stress susceptibility among daughters (gilts) of stressed mothers (sows) is tracked using AI and computer vision techniques. A deep learning-based model is trained and validated on the ground truth labels (through behaviour testing during recording of the videos) of stress susceptibility (SS) of mothers (sows). Then, this trained model is employed as a feature extractor for clustering techniques, such as K-means, Agglomerative, etc. This leads to the conclusion that more than 90% of stress-susceptible (SS) mothers had SS daughters. This result is crucial, as it can ease the process of selective breeding, where low stress-susceptible (LS) mothers could further be used for the breeding of the new generation.</description>
	<pubDate>2025-07-31</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 37: Tracking Trans-Generational Stress Susceptibility in the Farm Animal Using AI</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/37">doi: 10.3390/cmsf2025011037</a></p>
	<p>Authors:
		Ajmal Shahbaz
		Syed U. Yunas
		Emma M. Baxter
		Mark F. Hansen
		Melvyn L. Smith
		Lyndon N. Smith
		</p>
	<p>Stress, being an inherent trait, is a major driver of farm animal disease, leading to significant antimicrobial use (AMU). AMU is the recognized source of antimicrobial resistance (AMR). Among other ways, AMR spread can be controlled by selective breeding. To address this, stress susceptibility among daughters (gilts) of stressed mothers (sows) is tracked using AI and computer vision techniques. A deep learning-based model is trained and validated on the ground truth labels (through behaviour testing during recording of the videos) of stress susceptibility (SS) of mothers (sows). Then, this trained model is employed as a feature extractor for clustering techniques, such as K-means, Agglomerative, etc. This leads to the conclusion that more than 90% of stress-susceptible (SS) mothers had SS daughters. This result is crucial, as it can ease the process of selective breeding, where low stress-susceptible (LS) mothers could further be used for the breeding of the new generation.</p>
	]]></content:encoded>

	<dc:title>Tracking Trans-Generational Stress Susceptibility in the Farm Animal Using AI</dc:title>
			<dc:creator>Ajmal Shahbaz</dc:creator>
			<dc:creator>Syed U. Yunas</dc:creator>
			<dc:creator>Emma M. Baxter</dc:creator>
			<dc:creator>Mark F. Hansen</dc:creator>
			<dc:creator>Melvyn L. Smith</dc:creator>
			<dc:creator>Lyndon N. Smith</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011037</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-31</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-31</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>37</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011037</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/37</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/36">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 36: Volatility Transmission Between European Stock Indices and the Tunisian TUNINDEX: A GARCH-BEKK Approach</title>
	<link>https://www.mdpi.com/2813-0324/11/1/36</link>
	<description>This study examines volatility transmission between major European indices (CAC 40, DAX, FTSE MIB, IBEX 35, EURO STOXX 50) and Tunisia’s TUNINDEX amid global crises (2008 financial crisis, COVID-19, Russo-Ukrainian war). Using GARCH(1,1) and BEKK models, the analysis reveals low correlation and weak volatility spillovers between the TUNINDEX and European markets, indicating relative decoupling. ARCH-LM tests confirm conditional heteroskedasticity, while GARCH models show persistent volatility. The BEKK model underscores marginal shock transmission, affirming the TUNINDEX’s independence. These findings suggest diversification benefits for investors but highlight local risk considerations. Practical recommendations are provided for stakeholders, with future research directions including asymmetric effects and high-frequency data analysis.</description>
	<pubDate>2025-07-31</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 36: Volatility Transmission Between European Stock Indices and the Tunisian TUNINDEX: A GARCH-BEKK Approach</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/36">doi: 10.3390/cmsf2025011036</a></p>
	<p>Authors:
		Khalil Mhadhbi
		Yossr Ghanmi
		</p>
	<p>This study examines volatility transmission between major European indices (CAC 40, DAX, FTSE MIB, IBEX 35, EURO STOXX 50) and Tunisia’s TUNINDEX amid global crises (2008 financial crisis, COVID-19, Russo-Ukrainian war). Using GARCH(1,1) and BEKK models, the analysis reveals low correlation and weak volatility spillovers between the TUNINDEX and European markets, indicating relative decoupling. ARCH-LM tests confirm conditional heteroskedasticity, while GARCH models show persistent volatility. The BEKK model underscores marginal shock transmission, affirming the TUNINDEX’s independence. These findings suggest diversification benefits for investors but highlight local risk considerations. Practical recommendations are provided for stakeholders, with future research directions including asymmetric effects and high-frequency data analysis.</p>
	]]></content:encoded>

	<dc:title>Volatility Transmission Between European Stock Indices and the Tunisian TUNINDEX: A GARCH-BEKK Approach</dc:title>
			<dc:creator>Khalil Mhadhbi</dc:creator>
			<dc:creator>Yossr Ghanmi</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011036</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-31</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-31</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>36</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011036</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/36</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/35">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 35: A Numerical Assessment of Some Recurrent Crime Series in the State of Pittsburg</title>
	<link>https://www.mdpi.com/2813-0324/11/1/35</link>
	<description>The city of Pittsburg, Pennsylvania, remains -the epicenter of aggravated assaults this year. Compared to its pre-pandemic figures, violent crimes saw an upsurge with theft topping the city crime list. This study assessed the trend of crime series, particularly thefts, robberies, and burglaries, in two specific periods, namely from January 1990 to December 2001 and from 1 July 2023 to 30 September 2023, in Pittsburg using the discrete valued time series processes, with some popular innovation distributions that have recently emerged. The upward trend in thefts, robberies, and burglaries was affiliated with a shortage of police, existing police officers’ low morale, the latter’s anti-police demeanours, weak crime laws, gun proliferation, falling inflation rates, a rise in the consumers’ price index, uncomfortable homes, life insecurity, poverty, alcohol, drugs, and a devalued society. Thus, the implications include a need to strengthen existing crime laws, to create a diversion judiciary system offering alternatives to high-cost incarcerations provided that culprits adhere to the programs, and to establish evidence-based policies rooted in effective approaches.</description>
	<pubDate>2025-07-31</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 35: A Numerical Assessment of Some Recurrent Crime Series in the State of Pittsburg</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/35">doi: 10.3390/cmsf2025011035</a></p>
	<p>Authors:
		Yuvraj Sunecher
		Naushad Mamode Khan
		Paulo Canas Rodrigues
		</p>
	<p>The city of Pittsburg, Pennsylvania, remains -the epicenter of aggravated assaults this year. Compared to its pre-pandemic figures, violent crimes saw an upsurge with theft topping the city crime list. This study assessed the trend of crime series, particularly thefts, robberies, and burglaries, in two specific periods, namely from January 1990 to December 2001 and from 1 July 2023 to 30 September 2023, in Pittsburg using the discrete valued time series processes, with some popular innovation distributions that have recently emerged. The upward trend in thefts, robberies, and burglaries was affiliated with a shortage of police, existing police officers’ low morale, the latter’s anti-police demeanours, weak crime laws, gun proliferation, falling inflation rates, a rise in the consumers’ price index, uncomfortable homes, life insecurity, poverty, alcohol, drugs, and a devalued society. Thus, the implications include a need to strengthen existing crime laws, to create a diversion judiciary system offering alternatives to high-cost incarcerations provided that culprits adhere to the programs, and to establish evidence-based policies rooted in effective approaches.</p>
	]]></content:encoded>

	<dc:title>A Numerical Assessment of Some Recurrent Crime Series in the State of Pittsburg</dc:title>
			<dc:creator>Yuvraj Sunecher</dc:creator>
			<dc:creator>Naushad Mamode Khan</dc:creator>
			<dc:creator>Paulo Canas Rodrigues</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011035</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-31</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-31</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>35</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011035</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/35</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/34">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 34: Modelling Crime Data Using the Non-Stationary Bivariate Integer-Valued Autoregressive (BINAR(1)) Models with Poisson-Lindley (PL) Innovations</title>
	<link>https://www.mdpi.com/2813-0324/11/1/34</link>
	<description>This paper proposes a family of first order bivariate integer-valued autoregressive (BINAR(1)) with Poisson Lindley innovations (BINAR(1)PL). The model parameters are estimated using the conditional maximum likelihood (CML) estimation approach. The proposed models are applied on some real life crime data.</description>
	<pubDate>2025-07-31</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 34: Modelling Crime Data Using the Non-Stationary Bivariate Integer-Valued Autoregressive (BINAR(1)) Models with Poisson-Lindley (PL) Innovations</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/34">doi: 10.3390/cmsf2025011034</a></p>
	<p>Authors:
		Yuvraj Sunecher
		Naushad Mamode Khan
		Muhammed Rasheed Irshad
		Hendrik Willem Pretorius
		</p>
	<p>This paper proposes a family of first order bivariate integer-valued autoregressive (BINAR(1)) with Poisson Lindley innovations (BINAR(1)PL). The model parameters are estimated using the conditional maximum likelihood (CML) estimation approach. The proposed models are applied on some real life crime data.</p>
	]]></content:encoded>

	<dc:title>Modelling Crime Data Using the Non-Stationary Bivariate Integer-Valued Autoregressive (BINAR(1)) Models with Poisson-Lindley (PL) Innovations</dc:title>
			<dc:creator>Yuvraj Sunecher</dc:creator>
			<dc:creator>Naushad Mamode Khan</dc:creator>
			<dc:creator>Muhammed Rasheed Irshad</dc:creator>
			<dc:creator>Hendrik Willem Pretorius</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011034</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-31</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-31</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>34</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011034</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/34</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/18">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 18: Cascading Multi-Agent Policy Optimization for Demand Forecasting</title>
	<link>https://www.mdpi.com/2813-0324/11/1/18</link>
	<description>Reliable demand forecasting is crucial for effective supply chain management, where inaccurate forecasts can lead to frequent out-of-stock or overstock situations. While numerous statistical and machine learning methods have been explored for demand forecasting, reinforcement learning approaches, despite their significant potential, remain little known in this domain. In this paper, we propose a multi-agent deep reinforcement learning solution designed to accurately predict demand across multiple stores. We present empirical evidence that demonstrates the effectiveness of our model using a real-world dataset. The results confirm the practicality of our proposed approach and highlight its potential to improve demand forecasting in retail and potentially other forecasting scenarios.</description>
	<pubDate>2025-07-31</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 18: Cascading Multi-Agent Policy Optimization for Demand Forecasting</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/18">doi: 10.3390/cmsf2025011018</a></p>
	<p>Authors:
		Saeed Varasteh Yazdi
		</p>
	<p>Reliable demand forecasting is crucial for effective supply chain management, where inaccurate forecasts can lead to frequent out-of-stock or overstock situations. While numerous statistical and machine learning methods have been explored for demand forecasting, reinforcement learning approaches, despite their significant potential, remain little known in this domain. In this paper, we propose a multi-agent deep reinforcement learning solution designed to accurately predict demand across multiple stores. We present empirical evidence that demonstrates the effectiveness of our model using a real-world dataset. The results confirm the practicality of our proposed approach and highlight its potential to improve demand forecasting in retail and potentially other forecasting scenarios.</p>
	]]></content:encoded>

	<dc:title>Cascading Multi-Agent Policy Optimization for Demand Forecasting</dc:title>
			<dc:creator>Saeed Varasteh Yazdi</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011018</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-31</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-31</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>18</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011018</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/18</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/12">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 12: Modeling South African Stock Prices with Mixture Distributions</title>
	<link>https://www.mdpi.com/2813-0324/11/1/12</link>
	<description>This study investigates the behavior of South African stock prices during divestment periods using mixture distributions. Divestment often triggers significant market reactions, necessitating a deeper understanding of stock return distributions in such events. Given the complexities of emerging markets like South Africa, this research models stock price behavior to assess associated risks. A mixture distribution approach is employed to capture the return dynamics of stocks listed on the Johannesburg Stock Exchange (JSE) between 2015 and 2024. Gaussian Mixture Models (GMMs), Lognormal Mixture, and Student’s t mixture models are applied to financial, technology, and energy stocks affected by divestment. Statistical tests including AIC and BIC assess the model performance. Mixture distributions outperform single-distribution models, effectively capturing heavy tails, volatility clustering, and asymmetry in stock returns. The GMM and Student’s t mixture models provide the best fit, revealing increased volatility and extreme negative returns following divestment events. Mixture distributions offer a robust framework for modeling South African stock prices during divestment periods. These models enhance the understanding of market dynamics, supporting better financial modeling and risk management in emerging markets.</description>
	<pubDate>2025-07-31</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 12: Modeling South African Stock Prices with Mixture Distributions</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/12">doi: 10.3390/cmsf2025011012</a></p>
	<p>Authors:
		Martin Chanza
		Modisane Seitshiro
		</p>
	<p>This study investigates the behavior of South African stock prices during divestment periods using mixture distributions. Divestment often triggers significant market reactions, necessitating a deeper understanding of stock return distributions in such events. Given the complexities of emerging markets like South Africa, this research models stock price behavior to assess associated risks. A mixture distribution approach is employed to capture the return dynamics of stocks listed on the Johannesburg Stock Exchange (JSE) between 2015 and 2024. Gaussian Mixture Models (GMMs), Lognormal Mixture, and Student’s t mixture models are applied to financial, technology, and energy stocks affected by divestment. Statistical tests including AIC and BIC assess the model performance. Mixture distributions outperform single-distribution models, effectively capturing heavy tails, volatility clustering, and asymmetry in stock returns. The GMM and Student’s t mixture models provide the best fit, revealing increased volatility and extreme negative returns following divestment events. Mixture distributions offer a robust framework for modeling South African stock prices during divestment periods. These models enhance the understanding of market dynamics, supporting better financial modeling and risk management in emerging markets.</p>
	]]></content:encoded>

	<dc:title>Modeling South African Stock Prices with Mixture Distributions</dc:title>
			<dc:creator>Martin Chanza</dc:creator>
			<dc:creator>Modisane Seitshiro</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011012</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-31</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-31</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>12</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011012</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/12</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/7">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 7: Assessing the Oil Price–Exchange Rate Nexus: A Switching Regime Evidence Using Fractal Regression</title>
	<link>https://www.mdpi.com/2813-0324/11/1/7</link>
	<description>Oil, as a key commodity in international markets, bears an importance for both producers and consumers. For oil-exporting countries, periodic fluctuations have a considerable impact on the economic status and the way monetary and fiscal policies should be conducted in the future. While most of academic efforts tried to link low-frequency real exchange rate with macroeconomic fundamentals for medium-/long-term inference, they omitted to gauge the volatile and complex high-frequency linkage between oil prices and exchange rate fluctuations. The inherent non-linear characteristics of such time series preclude the use of traditional tools or aggregated schemes based on lower frequencies for inference purposes. This work investigates the scale-based volatile linkage between daily international oil fluctuations and nominal exchange rate variations of an oil-exporting country, namely Algeria, by adopting a fractal regression approach to uncover the power-law, time-varying transmission and track its incidence in the short and long runs. Results show the absence of any short-term transmission mechanism from oil prices to the exchange rate, as the two variables remain decoupled but exhibit an increasing negative correlation when long scales are considered. Furthermore, the multiscale regression analysis confirms the existence of a scale-free, two-state Markov switching regime process generating short- and long-term impacts with sizeable amplitudes. The findings confirm the usefulness of monetary policy interventions to stabilize the local currency, as the source of Dollar–Dinar multifractality was found to be the probability distribution of observations rather than long-range correlations specific to oil prices.</description>
	<pubDate>2025-07-31</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 7: Assessing the Oil Price–Exchange Rate Nexus: A Switching Regime Evidence Using Fractal Regression</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/7">doi: 10.3390/cmsf2025011007</a></p>
	<p>Authors:
		Sami Diaf
		Rachid Toumache
		</p>
	<p>Oil, as a key commodity in international markets, bears an importance for both producers and consumers. For oil-exporting countries, periodic fluctuations have a considerable impact on the economic status and the way monetary and fiscal policies should be conducted in the future. While most of academic efforts tried to link low-frequency real exchange rate with macroeconomic fundamentals for medium-/long-term inference, they omitted to gauge the volatile and complex high-frequency linkage between oil prices and exchange rate fluctuations. The inherent non-linear characteristics of such time series preclude the use of traditional tools or aggregated schemes based on lower frequencies for inference purposes. This work investigates the scale-based volatile linkage between daily international oil fluctuations and nominal exchange rate variations of an oil-exporting country, namely Algeria, by adopting a fractal regression approach to uncover the power-law, time-varying transmission and track its incidence in the short and long runs. Results show the absence of any short-term transmission mechanism from oil prices to the exchange rate, as the two variables remain decoupled but exhibit an increasing negative correlation when long scales are considered. Furthermore, the multiscale regression analysis confirms the existence of a scale-free, two-state Markov switching regime process generating short- and long-term impacts with sizeable amplitudes. The findings confirm the usefulness of monetary policy interventions to stabilize the local currency, as the source of Dollar–Dinar multifractality was found to be the probability distribution of observations rather than long-range correlations specific to oil prices.</p>
	]]></content:encoded>

	<dc:title>Assessing the Oil Price–Exchange Rate Nexus: A Switching Regime Evidence Using Fractal Regression</dc:title>
			<dc:creator>Sami Diaf</dc:creator>
			<dc:creator>Rachid Toumache</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011007</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-31</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-31</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>7</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011007</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/7</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/13">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 13: The Forecasting of Aluminum Prices: A True Challenge for Econometric Models</title>
	<link>https://www.mdpi.com/2813-0324/11/1/13</link>
	<description>This paper explores the forecasting of aluminum prices using various predictive models dealing with variable uncertainty. A diverse set of economic and market indicators is considered as potential price predictors. The performance of models including LASSO, RIDGE regression, time-varying parameter regressions, LARS, ARIMA, Dynamic Model Averaging, Bayesian Model Averaging, etc., is compared according to forecast accuracy. Despite the initial expectations that Bayesian dynamic mixture models would provide the best forecast accuracy, the results indicate that forecasting by futures prices and with Dynamic Model Averaging outperformed all other methods when monthly average prices are considered. Contrary, when monthly closing spot prices are considered, Bayesian dynamic mixture models happen to be very accurate compared to other methods, although beating the no-change method is still a hard challenge. Additionally, both revised and originally published macroeconomic time-series data are analyzed, ensuring consistency with the information available during real-time forecasting by mimicking the perspective of market players in the past.</description>
	<pubDate>2025-07-31</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 13: The Forecasting of Aluminum Prices: A True Challenge for Econometric Models</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/13">doi: 10.3390/cmsf2025011013</a></p>
	<p>Authors:
		Krzysztof Drachal
		Joanna Jędrzejewska
		</p>
	<p>This paper explores the forecasting of aluminum prices using various predictive models dealing with variable uncertainty. A diverse set of economic and market indicators is considered as potential price predictors. The performance of models including LASSO, RIDGE regression, time-varying parameter regressions, LARS, ARIMA, Dynamic Model Averaging, Bayesian Model Averaging, etc., is compared according to forecast accuracy. Despite the initial expectations that Bayesian dynamic mixture models would provide the best forecast accuracy, the results indicate that forecasting by futures prices and with Dynamic Model Averaging outperformed all other methods when monthly average prices are considered. Contrary, when monthly closing spot prices are considered, Bayesian dynamic mixture models happen to be very accurate compared to other methods, although beating the no-change method is still a hard challenge. Additionally, both revised and originally published macroeconomic time-series data are analyzed, ensuring consistency with the information available during real-time forecasting by mimicking the perspective of market players in the past.</p>
	]]></content:encoded>

	<dc:title>The Forecasting of Aluminum Prices: A True Challenge for Econometric Models</dc:title>
			<dc:creator>Krzysztof Drachal</dc:creator>
			<dc:creator>Joanna Jędrzejewska</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011013</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-31</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-31</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>13</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011013</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/13</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/10">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 10: Monitoring Multidimensional Risk in the Economy</title>
	<link>https://www.mdpi.com/2813-0324/11/1/10</link>
	<description>In economics, risk analysis is often associated with certain difficulties. These include the presence of several correlated risk factors, non-stationarity of economic processes, and small data samples. A mathematical model of multidimensional risk is described which satisfies the main features of processes in the economy. In the task of risk monitoring, we represent the analyzed factors as a set of correlated non-stationary time series. The method allows us to assess the risk at each moment using small data samples. For this purpose, risk factors are locally described in the form of parabolic or linear trends. An example of monitoring the risk of reducing the level of socio-economic development of Russia in 2000–2023 is considered. The monitoring results showed that the proposed multivariate risk model was generally sensitive to all the most significant economic shocks and adequately responded to them.</description>
	<pubDate>2025-07-31</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 10: Monitoring Multidimensional Risk in the Economy</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/10">doi: 10.3390/cmsf2025011010</a></p>
	<p>Authors:
		Alexander Tyrsin
		Michail Gerasimov
		Michael Beer
		</p>
	<p>In economics, risk analysis is often associated with certain difficulties. These include the presence of several correlated risk factors, non-stationarity of economic processes, and small data samples. A mathematical model of multidimensional risk is described which satisfies the main features of processes in the economy. In the task of risk monitoring, we represent the analyzed factors as a set of correlated non-stationary time series. The method allows us to assess the risk at each moment using small data samples. For this purpose, risk factors are locally described in the form of parabolic or linear trends. An example of monitoring the risk of reducing the level of socio-economic development of Russia in 2000–2023 is considered. The monitoring results showed that the proposed multivariate risk model was generally sensitive to all the most significant economic shocks and adequately responded to them.</p>
	]]></content:encoded>

	<dc:title>Monitoring Multidimensional Risk in the Economy</dc:title>
			<dc:creator>Alexander Tyrsin</dc:creator>
			<dc:creator>Michail Gerasimov</dc:creator>
			<dc:creator>Michael Beer</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011010</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-31</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-31</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>10</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011010</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/10</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/9">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 9: Analyzing and Classifying Time-Series Trends in Medals</title>
	<link>https://www.mdpi.com/2813-0324/11/1/9</link>
	<description>Since the 19th century, the development of metallurgical technology has been influenced by various factors, such as materials, casting technology, political policies, and the economic development of different countries. This paper aims to analyze the time-series evolution trend in medal issues in different countries and explore their historical and commemorative significance. Taking the characteristics of medal production places, types, compositions, diameters, weights, shapes, compositions, and thicknesses between 1850 and 2025 as indicators, data analysis methods such as time series, hierarchical cluster analysis (HCA), logistic regression, and random forests are used to study the process of medal development and influencing factors in the past 175 years. The results show that compared with the pre-World War II period, the weight and diameter of all medals of major countries changed significantly in different periods. Moreover, before and after World War II, there was a shift from traditional materials to cost-effective and convenient alternatives.</description>
	<pubDate>2025-07-31</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 9: Analyzing and Classifying Time-Series Trends in Medals</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/9">doi: 10.3390/cmsf2025011009</a></p>
	<p>Authors:
		Minfei Liang
		Yu Gao
		Eugene Pinsky
		</p>
	<p>Since the 19th century, the development of metallurgical technology has been influenced by various factors, such as materials, casting technology, political policies, and the economic development of different countries. This paper aims to analyze the time-series evolution trend in medal issues in different countries and explore their historical and commemorative significance. Taking the characteristics of medal production places, types, compositions, diameters, weights, shapes, compositions, and thicknesses between 1850 and 2025 as indicators, data analysis methods such as time series, hierarchical cluster analysis (HCA), logistic regression, and random forests are used to study the process of medal development and influencing factors in the past 175 years. The results show that compared with the pre-World War II period, the weight and diameter of all medals of major countries changed significantly in different periods. Moreover, before and after World War II, there was a shift from traditional materials to cost-effective and convenient alternatives.</p>
	]]></content:encoded>

	<dc:title>Analyzing and Classifying Time-Series Trends in Medals</dc:title>
			<dc:creator>Minfei Liang</dc:creator>
			<dc:creator>Yu Gao</dc:creator>
			<dc:creator>Eugene Pinsky</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011009</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-31</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-31</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>9</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011009</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/9</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/8">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 8: An Autoregressive Moving Average Model for Time Series with Irregular Time Intervals</title>
	<link>https://www.mdpi.com/2813-0324/11/1/8</link>
	<description>This research focuses on the study of stochastic processes with irregularly spaced time intervals, which is present in a wide range of fields such as climatology, astronomy, medicine, and economics. Some studies have proposed irregular autoregressive (iAR) and moving average (iMA) models separately, and moving average autoregressive processes (iARMA) for positive autoregressions. The objective of this work is to generalize the iARMA model to include negative correlations. A first-order moving average autoregressive model for irregular discrete time series is presented, being an ergodic and strictly stationary Gaussian process. Parameter estimation is performed by Maximum Likelihood, and its performances are evaluated for finite samples through Monte Carlo simulations. The estimation of the autocorrelation function (ACF) is performed using the DCF (Discrete Correlation Function) estimator, evaluating its performance by varying the sample size and average time interval. The model was implemented on real data from two different contexts; the first one consists of the two-week measurement of star flares of the Orion Nebula in the development of the COUP and the second pertains to the measurement of sunspot cycles from 1860 to 1990 and their relationship to temperature variation in the northern hemisphere.</description>
	<pubDate>2025-07-31</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 8: An Autoregressive Moving Average Model for Time Series with Irregular Time Intervals</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/8">doi: 10.3390/cmsf2025011008</a></p>
	<p>Authors:
		Diana Alejandra Godoy Pulecio
		César Andrés Ojeda Echeverri
		</p>
	<p>This research focuses on the study of stochastic processes with irregularly spaced time intervals, which is present in a wide range of fields such as climatology, astronomy, medicine, and economics. Some studies have proposed irregular autoregressive (iAR) and moving average (iMA) models separately, and moving average autoregressive processes (iARMA) for positive autoregressions. The objective of this work is to generalize the iARMA model to include negative correlations. A first-order moving average autoregressive model for irregular discrete time series is presented, being an ergodic and strictly stationary Gaussian process. Parameter estimation is performed by Maximum Likelihood, and its performances are evaluated for finite samples through Monte Carlo simulations. The estimation of the autocorrelation function (ACF) is performed using the DCF (Discrete Correlation Function) estimator, evaluating its performance by varying the sample size and average time interval. The model was implemented on real data from two different contexts; the first one consists of the two-week measurement of star flares of the Orion Nebula in the development of the COUP and the second pertains to the measurement of sunspot cycles from 1860 to 1990 and their relationship to temperature variation in the northern hemisphere.</p>
	]]></content:encoded>

	<dc:title>An Autoregressive Moving Average Model for Time Series with Irregular Time Intervals</dc:title>
			<dc:creator>Diana Alejandra Godoy Pulecio</dc:creator>
			<dc:creator>César Andrés Ojeda Echeverri</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011008</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-31</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-31</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>8</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011008</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/8</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/28">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 28: Analysis of Economic and Growth Synchronization Between China and the USA Using a Markov-Switching–VAR Model: A Trend and Cycle Approach</title>
	<link>https://www.mdpi.com/2813-0324/11/1/28</link>
	<description>This study examines the synchronization of economic and growth cycles between China and the United States of America amid ongoing economic and geopolitical tensions. Using a Markov-Switching–Vector Autoregression (MS-VAR) model, the analysis applies the Hodrick–Prescott and Baxter–King filters to monthly data from January 2000 to December 2024, capturing trends and cyclical fluctuations. The findings reveal asymmetries in economic synchronization, with differences in recession and expansion durations influenced by trade disputes, financial integration, and external shocks. As the rivalry between the two nations intensifies, marked by trade wars, technological competition, and geopolitical conflicts, understanding their economic co-movement becomes crucial. This study contributes to the literature by providing empirical insights into their evolving interdependence and offers policy recommendations for mitigating asymmetric shocks and promoting global economic stability.</description>
	<pubDate>2025-07-30</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 28: Analysis of Economic and Growth Synchronization Between China and the USA Using a Markov-Switching–VAR Model: A Trend and Cycle Approach</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/28">doi: 10.3390/cmsf2025011028</a></p>
	<p>Authors:
		Mariem Bouattour
		Malek Abaab
		Hajer Chibani
		Hamdi Becha
		Kamel Helali
		</p>
	<p>This study examines the synchronization of economic and growth cycles between China and the United States of America amid ongoing economic and geopolitical tensions. Using a Markov-Switching–Vector Autoregression (MS-VAR) model, the analysis applies the Hodrick–Prescott and Baxter–King filters to monthly data from January 2000 to December 2024, capturing trends and cyclical fluctuations. The findings reveal asymmetries in economic synchronization, with differences in recession and expansion durations influenced by trade disputes, financial integration, and external shocks. As the rivalry between the two nations intensifies, marked by trade wars, technological competition, and geopolitical conflicts, understanding their economic co-movement becomes crucial. This study contributes to the literature by providing empirical insights into their evolving interdependence and offers policy recommendations for mitigating asymmetric shocks and promoting global economic stability.</p>
	]]></content:encoded>

	<dc:title>Analysis of Economic and Growth Synchronization Between China and the USA Using a Markov-Switching–VAR Model: A Trend and Cycle Approach</dc:title>
			<dc:creator>Mariem Bouattour</dc:creator>
			<dc:creator>Malek Abaab</dc:creator>
			<dc:creator>Hajer Chibani</dc:creator>
			<dc:creator>Hamdi Becha</dc:creator>
			<dc:creator>Kamel Helali</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011028</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-30</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-30</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>28</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011028</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/28</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/6">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 6: Comparative Analysis of Temperature Prediction Models: Simple Models vs. Deep Learning Models</title>
	<link>https://www.mdpi.com/2813-0324/11/1/6</link>
	<description>Accurate and concise temperature prediction models have important applications in meteorological science, agriculture, energy, and electricity. This study aims to compare the performance of simple models and deep learning models in temperature prediction and explore whether simple models can replace deep learning models in specific scenarios to save computing resources. Based on 37 years of daily temperature time series data from 10 cities from 1987 to 2024, the Simple Moving Average (SMA), Seasonal Average Method with Lookback Years (SAM-Lookback), and Long Short-Term Memory (LSTM) models are fitted to evaluate the accuracy of simple models and deep learning models in temperature prediction. The performance of different models is intuitively compared by calculating the RMSE and Percentage Error of each city. The results show that LSTM has higher accuracy in most cities, but the prediction results of SMA and LSTM are similar and perform equally well, while SAM-Lookback is relatively weak.</description>
	<pubDate>2025-07-30</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 6: Comparative Analysis of Temperature Prediction Models: Simple Models vs. Deep Learning Models</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/6">doi: 10.3390/cmsf2025011006</a></p>
	<p>Authors:
		Zibo Wang
		Weiqi Zhang
		Eugene Pinsky
		</p>
	<p>Accurate and concise temperature prediction models have important applications in meteorological science, agriculture, energy, and electricity. This study aims to compare the performance of simple models and deep learning models in temperature prediction and explore whether simple models can replace deep learning models in specific scenarios to save computing resources. Based on 37 years of daily temperature time series data from 10 cities from 1987 to 2024, the Simple Moving Average (SMA), Seasonal Average Method with Lookback Years (SAM-Lookback), and Long Short-Term Memory (LSTM) models are fitted to evaluate the accuracy of simple models and deep learning models in temperature prediction. The performance of different models is intuitively compared by calculating the RMSE and Percentage Error of each city. The results show that LSTM has higher accuracy in most cities, but the prediction results of SMA and LSTM are similar and perform equally well, while SAM-Lookback is relatively weak.</p>
	]]></content:encoded>

	<dc:title>Comparative Analysis of Temperature Prediction Models: Simple Models vs. Deep Learning Models</dc:title>
			<dc:creator>Zibo Wang</dc:creator>
			<dc:creator>Weiqi Zhang</dc:creator>
			<dc:creator>Eugene Pinsky</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011006</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-30</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-30</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>6</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011006</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/6</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/5">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 5: Nonlinear Dynamic Inverse Solution of the Diffusion Problem Based on Krylov Subspace Methods with Spatiotemporal Constraints</title>
	<link>https://www.mdpi.com/2813-0324/11/1/5</link>
	<description>In this work, we propose a nonlinear dynamic inverse solution to the diffusion problem based on Krylov Subspace Methods with spatiotemporal constraints. The proposed approach is applied by considering, as a forward problem, a 1D diffusion problem with a nonlinear diffusion model. The dynamic inverse problem solution is obtained by considering a cost function with spatiotemporal constraints, where the Krylov subspace method named the Generalized Minimal Residual method is applied by considering a linearized diffusion model and spatiotemporal constraints. In addition, a Jacobian-based preconditioner is used to improve the convergence of the inverse solution. The proposed approach is evaluated under noise conditions by considering the reconstruction error and the relative residual error. It can be seen that the performance of the proposed approach is better when used with the preconditioner for the nonlinear diffusion model under noise conditions in comparison with the system without the preconditioner.</description>
	<pubDate>2025-07-30</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 5: Nonlinear Dynamic Inverse Solution of the Diffusion Problem Based on Krylov Subspace Methods with Spatiotemporal Constraints</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/5">doi: 10.3390/cmsf2025011005</a></p>
	<p>Authors:
		Luis Fernando Alvarez-Velasquez
		Eduardo Giraldo
		</p>
	<p>In this work, we propose a nonlinear dynamic inverse solution to the diffusion problem based on Krylov Subspace Methods with spatiotemporal constraints. The proposed approach is applied by considering, as a forward problem, a 1D diffusion problem with a nonlinear diffusion model. The dynamic inverse problem solution is obtained by considering a cost function with spatiotemporal constraints, where the Krylov subspace method named the Generalized Minimal Residual method is applied by considering a linearized diffusion model and spatiotemporal constraints. In addition, a Jacobian-based preconditioner is used to improve the convergence of the inverse solution. The proposed approach is evaluated under noise conditions by considering the reconstruction error and the relative residual error. It can be seen that the performance of the proposed approach is better when used with the preconditioner for the nonlinear diffusion model under noise conditions in comparison with the system without the preconditioner.</p>
	]]></content:encoded>

	<dc:title>Nonlinear Dynamic Inverse Solution of the Diffusion Problem Based on Krylov Subspace Methods with Spatiotemporal Constraints</dc:title>
			<dc:creator>Luis Fernando Alvarez-Velasquez</dc:creator>
			<dc:creator>Eduardo Giraldo</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011005</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-30</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-30</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>5</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011005</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/5</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/4">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 4: Time Series Forecasting for Touristic Policies</title>
	<link>https://www.mdpi.com/2813-0324/11/1/4</link>
	<description>The formulation of touristic policies is a time-consuming process that consists of a wide range of steps and procedures. These policies are highly dependent on the number of tourists and visitors to an area to be as effective as possible. The estimation of this number is not always easy to achieve, since there is a lack of the corresponding data (i.e., number of visitors per day). Hence, this estimation must be achieved by utilizing alternative data sources. To this end, in this paper, the authors propose a neural network architecture that is trained on waste management data to estimate the number of visitors and tourists in the highly touristic municipality of Vari-Voula-Vouliagmeni, Greece.</description>
	<pubDate>2025-07-30</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 4: Time Series Forecasting for Touristic Policies</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/4">doi: 10.3390/cmsf2025011004</a></p>
	<p>Authors:
		Konstantinos Mavrogiorgos
		Athanasios Kiourtis
		Argyro Mavrogiorgou
		Dimitrios Apostolopoulos
		Andreas Menychtas
		Dimosthenis Kyriazis
		</p>
	<p>The formulation of touristic policies is a time-consuming process that consists of a wide range of steps and procedures. These policies are highly dependent on the number of tourists and visitors to an area to be as effective as possible. The estimation of this number is not always easy to achieve, since there is a lack of the corresponding data (i.e., number of visitors per day). Hence, this estimation must be achieved by utilizing alternative data sources. To this end, in this paper, the authors propose a neural network architecture that is trained on waste management data to estimate the number of visitors and tourists in the highly touristic municipality of Vari-Voula-Vouliagmeni, Greece.</p>
	]]></content:encoded>

	<dc:title>Time Series Forecasting for Touristic Policies</dc:title>
			<dc:creator>Konstantinos Mavrogiorgos</dc:creator>
			<dc:creator>Athanasios Kiourtis</dc:creator>
			<dc:creator>Argyro Mavrogiorgou</dc:creator>
			<dc:creator>Dimitrios Apostolopoulos</dc:creator>
			<dc:creator>Andreas Menychtas</dc:creator>
			<dc:creator>Dimosthenis Kyriazis</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011004</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-30</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-30</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>4</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011004</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/4</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/3">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 3: Detecting Financial Bubbles with Tail-Weighted Entropy</title>
	<link>https://www.mdpi.com/2813-0324/11/1/3</link>
	<description>This paper develops a novel entropy-based framework to quantify tail risk and detect speculative bubbles in financial markets. By integrating extreme value theory with information theory, I introduce the Tail-Weighted Entropy (TWE) measure, which captures how information scales with extremeness in asset price distributions. I derive explicit bounds for TWE under heavy-tailed models and establish its connection to tail index parameters, revealing a phase transition in entropy decay rates during bubble formation. Empirically, I demonstrate that TWE-based signals detect crises in equities, commodities, and cryptocurrencies days earlier than traditional variance-ratio tests, with Bitcoin’s 2021 collapse identified weeks prior to the peak. The results show that entropy decay—not volatility explosions—serves as the primary precursor to systemic risk, offering policymakers a robust tool for preemptive crisis management.</description>
	<pubDate>2025-07-25</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 3: Detecting Financial Bubbles with Tail-Weighted Entropy</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/3">doi: 10.3390/cmsf2025011003</a></p>
	<p>Authors:
		Omid M. Ardakani
		</p>
	<p>This paper develops a novel entropy-based framework to quantify tail risk and detect speculative bubbles in financial markets. By integrating extreme value theory with information theory, I introduce the Tail-Weighted Entropy (TWE) measure, which captures how information scales with extremeness in asset price distributions. I derive explicit bounds for TWE under heavy-tailed models and establish its connection to tail index parameters, revealing a phase transition in entropy decay rates during bubble formation. Empirically, I demonstrate that TWE-based signals detect crises in equities, commodities, and cryptocurrencies days earlier than traditional variance-ratio tests, with Bitcoin’s 2021 collapse identified weeks prior to the peak. The results show that entropy decay—not volatility explosions—serves as the primary precursor to systemic risk, offering policymakers a robust tool for preemptive crisis management.</p>
	]]></content:encoded>

	<dc:title>Detecting Financial Bubbles with Tail-Weighted Entropy</dc:title>
			<dc:creator>Omid M. Ardakani</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011003</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-25</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-25</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>3</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011003</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/3</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/18">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 18: Statement of Peer Review</title>
	<link>https://www.mdpi.com/2813-0324/10/1/18</link>
	<description>n/a</description>
	<pubDate>2025-07-25</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 18: Statement of Peer Review</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/18">doi: 10.3390/cmsf2025010018</a></p>
	<p>Authors:
		Hicham Gibet Tani
		Mohamed Kouissi
		Mohamed Ben Ahmed
		Anouar Boudhir Abdelhakim
		Lotfi Elaachak
		</p>
	<p>n/a</p>
	]]></content:encoded>

	<dc:title>Statement of Peer Review</dc:title>
			<dc:creator>Hicham Gibet Tani</dc:creator>
			<dc:creator>Mohamed Kouissi</dc:creator>
			<dc:creator>Mohamed Ben Ahmed</dc:creator>
			<dc:creator>Anouar Boudhir Abdelhakim</dc:creator>
			<dc:creator>Lotfi Elaachak</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010018</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-25</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-25</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Editorial</prism:section>
	<prism:startingPage>18</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010018</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/18</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/2">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 2: An Estimation of Risk Measures: Analysis of a Method</title>
	<link>https://www.mdpi.com/2813-0324/11/1/2</link>
	<description>Extreme value theory comprises a set of techniques for inference at the tail of distributions, where data are scarce or non-existent. The tail index is the main parameter, with risk measures such as value at risk or expected shortfall depending on it. In this study, we will analyze a method for estimating the tail index through a simulation study. This will allow for an application using real data including the estimation of the mentioned risk measures.</description>
	<pubDate>2025-07-25</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 2: An Estimation of Risk Measures: Analysis of a Method</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/2">doi: 10.3390/cmsf2025011002</a></p>
	<p>Authors:
		Marta Ferreira
		Liliana Monteiro
		</p>
	<p>Extreme value theory comprises a set of techniques for inference at the tail of distributions, where data are scarce or non-existent. The tail index is the main parameter, with risk measures such as value at risk or expected shortfall depending on it. In this study, we will analyze a method for estimating the tail index through a simulation study. This will allow for an application using real data including the estimation of the mentioned risk measures.</p>
	]]></content:encoded>

	<dc:title>An Estimation of Risk Measures: Analysis of a Method</dc:title>
			<dc:creator>Marta Ferreira</dc:creator>
			<dc:creator>Liliana Monteiro</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011002</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-25</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-25</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>2</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011002</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/2</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/17">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 17: Recent Developments in Four-In-Wheel Electronic Differential Systems in Electrical Vehicles</title>
	<link>https://www.mdpi.com/2813-0324/10/1/17</link>
	<description>This manuscript investigates the feasibility of Four-In-Wheel Electronic Differential Systems (4 IW-EDSs) within contemporary electric vehicles (EVs), emphasizing their benefits for stability regulation predicated on steering angles. Through an extensive literature review, we conduct a comparative analysis of various in-wheel-motor models in terms of power output, efficiency, and torque characteristics. Furthermore, we explore the distinctions between IW-EDSs and steer-by-wire systems, as well as conventional systems, while evaluating recent research findings to determine their implications for the evolution of electric mobility. Moreover, this paper addresses the necessity for fault-tolerant methodologies to boost reliability in practical applications. The findings yield valuable insights into the challenges and impacts associated with the implementation of differential steering control in four-wheel independent-drive electric vehicles. This study aims to explore the interaction between these systems, optimize torque distribution, and discover the most ideal control strategy that will improve maneuverability, stability, and energy efficiency, thereby opening up new frontiers in the development of next-generation electric vehicles with unparalleled performance and safety features.</description>
	<pubDate>2025-07-25</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 17: Recent Developments in Four-In-Wheel Electronic Differential Systems in Electrical Vehicles</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/17">doi: 10.3390/cmsf2025010017</a></p>
	<p>Authors:
		Anouar El Mourabit
		Ibrahim Hadj Baraka
		</p>
	<p>This manuscript investigates the feasibility of Four-In-Wheel Electronic Differential Systems (4 IW-EDSs) within contemporary electric vehicles (EVs), emphasizing their benefits for stability regulation predicated on steering angles. Through an extensive literature review, we conduct a comparative analysis of various in-wheel-motor models in terms of power output, efficiency, and torque characteristics. Furthermore, we explore the distinctions between IW-EDSs and steer-by-wire systems, as well as conventional systems, while evaluating recent research findings to determine their implications for the evolution of electric mobility. Moreover, this paper addresses the necessity for fault-tolerant methodologies to boost reliability in practical applications. The findings yield valuable insights into the challenges and impacts associated with the implementation of differential steering control in four-wheel independent-drive electric vehicles. This study aims to explore the interaction between these systems, optimize torque distribution, and discover the most ideal control strategy that will improve maneuverability, stability, and energy efficiency, thereby opening up new frontiers in the development of next-generation electric vehicles with unparalleled performance and safety features.</p>
	]]></content:encoded>

	<dc:title>Recent Developments in Four-In-Wheel Electronic Differential Systems in Electrical Vehicles</dc:title>
			<dc:creator>Anouar El Mourabit</dc:creator>
			<dc:creator>Ibrahim Hadj Baraka</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010017</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-25</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-25</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>17</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010017</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/17</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/11/1/1">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 1: Evaluating Sales Forecasting Methods in Make-to-Order Environments: A Cross-Industry Benchmark Study</title>
	<link>https://www.mdpi.com/2813-0324/11/1/1</link>
	<description>Sales forecasting in make-to-order (MTO) production is particularly challenging for small- and medium-sized enterprises (SMEs) due to high product customization, volatile demand, and limited historical data. This study evaluates the practical feasibility and accuracy of statistical and machine learning (ML) forecasting methods in MTO settings across three manufacturing sectors: electrical equipment, steel, and office supplies. A cross-industry benchmark assesses models such as ARIMA, Holt–Winters, Random Forest, LSTM, and Facebook Prophet. The evaluation considers error metrics (MAE, RMSE, and sMAPE) as well as implementation aspects like computational demand and interpretability. Special attention is given to data sensitivity and technical limitations typical in SMEs. The findings show that ML models perform well under high volatility and when enriched with external indicators, but they require significant expertise and resources. In contrast, simpler statistical methods offer robust performance in more stable or seasonal demand contexts and are better suited in certain cases. The study emphasizes the importance of transparency, usability, and trust in forecasting tools and offers actionable recommendations for selecting a suitable forecasting configuration based on context. By aligning technical capabilities with operational needs, this research supports more effective decision-making in data-constrained MTO environments.</description>
	<pubDate>2025-07-25</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 11, Pages 1: Evaluating Sales Forecasting Methods in Make-to-Order Environments: A Cross-Industry Benchmark Study</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/11/1/1">doi: 10.3390/cmsf2025011001</a></p>
	<p>Authors:
		Marius Syberg
		Lucas Polley
		Jochen Deuse
		</p>
	<p>Sales forecasting in make-to-order (MTO) production is particularly challenging for small- and medium-sized enterprises (SMEs) due to high product customization, volatile demand, and limited historical data. This study evaluates the practical feasibility and accuracy of statistical and machine learning (ML) forecasting methods in MTO settings across three manufacturing sectors: electrical equipment, steel, and office supplies. A cross-industry benchmark assesses models such as ARIMA, Holt–Winters, Random Forest, LSTM, and Facebook Prophet. The evaluation considers error metrics (MAE, RMSE, and sMAPE) as well as implementation aspects like computational demand and interpretability. Special attention is given to data sensitivity and technical limitations typical in SMEs. The findings show that ML models perform well under high volatility and when enriched with external indicators, but they require significant expertise and resources. In contrast, simpler statistical methods offer robust performance in more stable or seasonal demand contexts and are better suited in certain cases. The study emphasizes the importance of transparency, usability, and trust in forecasting tools and offers actionable recommendations for selecting a suitable forecasting configuration based on context. By aligning technical capabilities with operational needs, this research supports more effective decision-making in data-constrained MTO environments.</p>
	]]></content:encoded>

	<dc:title>Evaluating Sales Forecasting Methods in Make-to-Order Environments: A Cross-Industry Benchmark Study</dc:title>
			<dc:creator>Marius Syberg</dc:creator>
			<dc:creator>Lucas Polley</dc:creator>
			<dc:creator>Jochen Deuse</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025011001</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-25</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-25</prism:publicationDate>
	<prism:volume>11</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>1</prism:startingPage>
		<prism:doi>10.3390/cmsf2025011001</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/11/1/1</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/14">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 14: Overview of Training LLMs on One Single GPU</title>
	<link>https://www.mdpi.com/2813-0324/10/1/14</link>
	<description>Large language models (LLMs) are developing at a rapid pace, which has made it necessary to better understand how they train, especially when faced with resource limitations. This paper examines in detail how various state-of-the-art LLMs train on a single Graphical Processing Unit (GPU), paying close attention to crucial elements like throughput, memory utilization and training time. We find important trade-offs between model size, batch size and computational efficiency through empirical evaluation, offering practical advice for streamlining fine-tuning processes in the face of hardware constraints.</description>
	<pubDate>2025-07-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 14: Overview of Training LLMs on One Single GPU</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/14">doi: 10.3390/cmsf2025010014</a></p>
	<p>Authors:
		Mohamed Ben jouad
		Lotfi Elaachak
		</p>
	<p>Large language models (LLMs) are developing at a rapid pace, which has made it necessary to better understand how they train, especially when faced with resource limitations. This paper examines in detail how various state-of-the-art LLMs train on a single Graphical Processing Unit (GPU), paying close attention to crucial elements like throughput, memory utilization and training time. We find important trade-offs between model size, batch size and computational efficiency through empirical evaluation, offering practical advice for streamlining fine-tuning processes in the face of hardware constraints.</p>
	]]></content:encoded>

	<dc:title>Overview of Training LLMs on One Single GPU</dc:title>
			<dc:creator>Mohamed Ben jouad</dc:creator>
			<dc:creator>Lotfi Elaachak</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010014</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-09</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-09</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>14</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010014</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/14</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/13">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 13: Optimizing Machine Learning for Healthcare Applications: A Case Study on Cardiovascular Disease Prediction Through Feature Selection, Regularization, and Overfitting Reduction</title>
	<link>https://www.mdpi.com/2813-0324/10/1/13</link>
	<description>The application of machine learning (ML) to medical datasets offers significant potential for improving disease prediction and patient outcomes. However, challenges such as feature redundancy, overfitting, and suboptimal model performance limit the practical effectiveness of ML algorithms. This study focuses on optimizing ML techniques for cardiovascular disease prediction using the Kaggle Cardiovascular Disease dataset. We systematically apply feature selection methods, including correlation analysis and regularization techniques (L1/L2), to identify the most relevant attributes and address multicollinearity. Advanced ensemble models such as Random Forest, XGBoost, and LightGBM are employed to mitigate overfitting and enhance predictive performance. Through hyperparameter tuning and stratified k-fold cross-validation, we ensure model robustness and generalizability. The results demonstrate that ensemble methods, particularly gradient boosting algorithms, outperform traditional models, achieving superior predictive accuracy and stability. This study highlights the importance of algorithm optimization in ML applications for healthcare, offering a replicable framework for medical datasets and paving the way for more effective diagnostic tools in cardiovascular health.</description>
	<pubDate>2025-07-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 13: Optimizing Machine Learning for Healthcare Applications: A Case Study on Cardiovascular Disease Prediction Through Feature Selection, Regularization, and Overfitting Reduction</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/13">doi: 10.3390/cmsf2025010013</a></p>
	<p>Authors:
		Lamiae Eloutouate
		Hicham Gibet Tani
		Lotfi Elaachak
		Fatiha Elouaai
		Mohammed Bouhorma
		</p>
	<p>The application of machine learning (ML) to medical datasets offers significant potential for improving disease prediction and patient outcomes. However, challenges such as feature redundancy, overfitting, and suboptimal model performance limit the practical effectiveness of ML algorithms. This study focuses on optimizing ML techniques for cardiovascular disease prediction using the Kaggle Cardiovascular Disease dataset. We systematically apply feature selection methods, including correlation analysis and regularization techniques (L1/L2), to identify the most relevant attributes and address multicollinearity. Advanced ensemble models such as Random Forest, XGBoost, and LightGBM are employed to mitigate overfitting and enhance predictive performance. Through hyperparameter tuning and stratified k-fold cross-validation, we ensure model robustness and generalizability. The results demonstrate that ensemble methods, particularly gradient boosting algorithms, outperform traditional models, achieving superior predictive accuracy and stability. This study highlights the importance of algorithm optimization in ML applications for healthcare, offering a replicable framework for medical datasets and paving the way for more effective diagnostic tools in cardiovascular health.</p>
	]]></content:encoded>

	<dc:title>Optimizing Machine Learning for Healthcare Applications: A Case Study on Cardiovascular Disease Prediction Through Feature Selection, Regularization, and Overfitting Reduction</dc:title>
			<dc:creator>Lamiae Eloutouate</dc:creator>
			<dc:creator>Hicham Gibet Tani</dc:creator>
			<dc:creator>Lotfi Elaachak</dc:creator>
			<dc:creator>Fatiha Elouaai</dc:creator>
			<dc:creator>Mohammed Bouhorma</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010013</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-07</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-07</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>13</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010013</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/13</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/12">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 12: Integrating Machine Learning with Medical Imaging for Human Disease Diagnosis: A Survey</title>
	<link>https://www.mdpi.com/2813-0324/10/1/12</link>
	<description>Machine learning is revolutionizing healthcare by enhancing diagnosis and treatment personalization. This study explores ML applications in medical imaging, analyzing data from X-rays, CT, MRI, and ultrasound for early disease detection. It reviews key ML models, including SVM, ANN, RF, CNN, and other methods, demonstrating their effectiveness in detecting cancers such as lung and prostate cancer and other diseases. Despite their accuracy, these methods face challenges such as a reliance on large datasets and significant computational requirements. This study highlights the need for further research to integrate ML into clinical practice, addressing its limitations and unlocking new opportunities for improved patient care.</description>
	<pubDate>2025-07-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 12: Integrating Machine Learning with Medical Imaging for Human Disease Diagnosis: A Survey</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/12">doi: 10.3390/cmsf2025010012</a></p>
	<p>Authors:
		Anass Roman
		Chaymae Taib
		Ilham Dhaiouir
		Haimoudi El Khatir
		</p>
	<p>Machine learning is revolutionizing healthcare by enhancing diagnosis and treatment personalization. This study explores ML applications in medical imaging, analyzing data from X-rays, CT, MRI, and ultrasound for early disease detection. It reviews key ML models, including SVM, ANN, RF, CNN, and other methods, demonstrating their effectiveness in detecting cancers such as lung and prostate cancer and other diseases. Despite their accuracy, these methods face challenges such as a reliance on large datasets and significant computational requirements. This study highlights the need for further research to integrate ML into clinical practice, addressing its limitations and unlocking new opportunities for improved patient care.</p>
	]]></content:encoded>

	<dc:title>Integrating Machine Learning with Medical Imaging for Human Disease Diagnosis: A Survey</dc:title>
			<dc:creator>Anass Roman</dc:creator>
			<dc:creator>Chaymae Taib</dc:creator>
			<dc:creator>Ilham Dhaiouir</dc:creator>
			<dc:creator>Haimoudi El Khatir</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010012</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-07</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-07</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>12</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010012</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/12</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/11">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 11: The Evolution and Challenges of Real-Time Big Data: A Review</title>
	<link>https://www.mdpi.com/2813-0324/10/1/11</link>
	<description>The importance of real-time big data has become crucial in the digital revolution of modern society, in the context of increasing data flows from multiple sources, including social media, internet connected devices (IOT) and financial systems, real-time analysis and processing is becoming a strategic tool for fast and accurate decision making, we find applications in different domains such as healthcare, finance, and digital marketing, which is revolutionizing traditional business models. In this article, we explore the recent advances and future prospects of real-time big data. Our research is based on recent work published between 2020 and 2025, examining the technological advances, the difficulties encountered and suggesting ways of optimizing the efficiency of these technologies.</description>
	<pubDate>2025-07-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 11: The Evolution and Challenges of Real-Time Big Data: A Review</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/11">doi: 10.3390/cmsf2025010011</a></p>
	<p>Authors:
		Ikram Lefhal Lalaoui
		Essaid El Haji
		Mohamed Kounaidi
		</p>
	<p>The importance of real-time big data has become crucial in the digital revolution of modern society, in the context of increasing data flows from multiple sources, including social media, internet connected devices (IOT) and financial systems, real-time analysis and processing is becoming a strategic tool for fast and accurate decision making, we find applications in different domains such as healthcare, finance, and digital marketing, which is revolutionizing traditional business models. In this article, we explore the recent advances and future prospects of real-time big data. Our research is based on recent work published between 2020 and 2025, examining the technological advances, the difficulties encountered and suggesting ways of optimizing the efficiency of these technologies.</p>
	]]></content:encoded>

	<dc:title>The Evolution and Challenges of Real-Time Big Data: A Review</dc:title>
			<dc:creator>Ikram Lefhal Lalaoui</dc:creator>
			<dc:creator>Essaid El Haji</dc:creator>
			<dc:creator>Mohamed Kounaidi</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010011</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-01</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-01</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>11</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010011</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/11</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/10">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 10: Advancing Stress Detection and Health Monitoring with Deep Learning Approaches</title>
	<link>https://www.mdpi.com/2813-0324/10/1/10</link>
	<description>Numerous studies in the healthcare field conducted in recent years have highlighted the impact of stress on health and its role in the development of several critical illnesses. Stress monitoring using wearable technologies, such as smartwatches and biosensors, has shown promising results in improving the management of this issue. Data from both physical and mental health can be leveraged to enhance medical decision-making, support research on new treatments, and deepen our understanding of complex diseases. However, traditional machine learning (ML) systems often face limitations, particularly in real-time processing and resource optimization, which restrict their application in critical situations. In this article, we present the development of a deep learning-based approach that leverages models such as 1D CNN (Convolutional Neural Networks), LSTM (Long Short-Term Memory), and Time-Series Transformers, alongside classical deep learning techniques. We then highlight the transformative potential of TinyML for real-time, low-power health monitoring, focusing on Heart Rate Variability (HRV) analysis. This approach aims to optimize personalized health interventions and enhance the accuracy of medical monitoring.</description>
	<pubDate>2025-07-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 10: Advancing Stress Detection and Health Monitoring with Deep Learning Approaches</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/10">doi: 10.3390/cmsf2025010010</a></p>
	<p>Authors:
		Merouane Mouadili
		El Mokhtar En-Naimi
		Mohamed Kouissi
		</p>
	<p>Numerous studies in the healthcare field conducted in recent years have highlighted the impact of stress on health and its role in the development of several critical illnesses. Stress monitoring using wearable technologies, such as smartwatches and biosensors, has shown promising results in improving the management of this issue. Data from both physical and mental health can be leveraged to enhance medical decision-making, support research on new treatments, and deepen our understanding of complex diseases. However, traditional machine learning (ML) systems often face limitations, particularly in real-time processing and resource optimization, which restrict their application in critical situations. In this article, we present the development of a deep learning-based approach that leverages models such as 1D CNN (Convolutional Neural Networks), LSTM (Long Short-Term Memory), and Time-Series Transformers, alongside classical deep learning techniques. We then highlight the transformative potential of TinyML for real-time, low-power health monitoring, focusing on Heart Rate Variability (HRV) analysis. This approach aims to optimize personalized health interventions and enhance the accuracy of medical monitoring.</p>
	]]></content:encoded>

	<dc:title>Advancing Stress Detection and Health Monitoring with Deep Learning Approaches</dc:title>
			<dc:creator>Merouane Mouadili</dc:creator>
			<dc:creator>El Mokhtar En-Naimi</dc:creator>
			<dc:creator>Mohamed Kouissi</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010010</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-01</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-01</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>10</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010010</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/10</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/9">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 9: Generative AI Respiratory and Cardiac Sound Separation Using Variational Autoencoders (VAEs)</title>
	<link>https://www.mdpi.com/2813-0324/10/1/9</link>
	<description>The separation of respiratory and cardiac sounds is a significant challenge in biomedical signal processing due to their overlapping frequency and time characteristics. Traditional methods struggle with accurate extraction in noisy or diverse clinical environments. This study explores the application of machine learning, particularly convolutional neural networks (CNNs), to overcome these obstacles. Advanced machine learning models, denoising algorithms, and domain adaptation strategies address challenges such as frequency overlap, external noise, and limited labeled datasets. This study presents a robust methodology for detecting heart and lung diseases from audio signals using advanced preprocessing, feature extraction, and deep learning models. The approach integrates adaptive filtering and bandpass filtering as denoising techniques and variational autoencoders (VAEs) for feature extraction. The extracted features are input into a CNN, which classifies audio signals into different heart and lung conditions. The results highlight the potential of this combined approach for early and accurate disease detection, contributing to the development of reliable diagnostic tools for healthcare.</description>
	<pubDate>2025-07-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 9: Generative AI Respiratory and Cardiac Sound Separation Using Variational Autoencoders (VAEs)</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/9">doi: 10.3390/cmsf2025010009</a></p>
	<p>Authors:
		Arshad Jamal
		R. Kanesaraj Ramasamy
		Junaidi Abdullah
		</p>
	<p>The separation of respiratory and cardiac sounds is a significant challenge in biomedical signal processing due to their overlapping frequency and time characteristics. Traditional methods struggle with accurate extraction in noisy or diverse clinical environments. This study explores the application of machine learning, particularly convolutional neural networks (CNNs), to overcome these obstacles. Advanced machine learning models, denoising algorithms, and domain adaptation strategies address challenges such as frequency overlap, external noise, and limited labeled datasets. This study presents a robust methodology for detecting heart and lung diseases from audio signals using advanced preprocessing, feature extraction, and deep learning models. The approach integrates adaptive filtering and bandpass filtering as denoising techniques and variational autoencoders (VAEs) for feature extraction. The extracted features are input into a CNN, which classifies audio signals into different heart and lung conditions. The results highlight the potential of this combined approach for early and accurate disease detection, contributing to the development of reliable diagnostic tools for healthcare.</p>
	]]></content:encoded>

	<dc:title>Generative AI Respiratory and Cardiac Sound Separation Using Variational Autoencoders (VAEs)</dc:title>
			<dc:creator>Arshad Jamal</dc:creator>
			<dc:creator>R. Kanesaraj Ramasamy</dc:creator>
			<dc:creator>Junaidi Abdullah</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010009</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-07-01</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-07-01</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>9</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010009</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/9</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/7">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 7: Enhanced Lung Disease Detection Using Double Denoising and 1D Convolutional Neural Networks on Respiratory Sound Analysis</title>
	<link>https://www.mdpi.com/2813-0324/10/1/7</link>
	<description>The accurate and early detection of respiratory diseases is vital for effective diagnosis and treatment. This study presents a new approach for classifying lung sounds using a double denoising method combined with a 1D Convolutional Neural Network (CNN). The preprocessing uses Fast Fourier Transform to clean up sounds and High-Pass Filtering to improve the quality of breathing sounds by eliminating noise and low-frequency interruptions. The Short-Time Fourier Transform (STFT) extracts features that capture localised frequency variations, crucial for distinguishing normal and abnormal respiratory sounds. These features are input into the 1D CNN, which classifies diseases such as bronchiectasis, pneumonia, asthma, COPD, healthy, and URTI. The dual denoising method enhances signal clarity and classification performance. The model achieved 96% validation accuracy, highlighting its reliability in detecting respiratory conditions. The results emphasise the effectiveness of combining signal augmentation with deep learning for automated respiratory sound analysis, with future research focusing on dataset expansion and model refinement for clinical use.</description>
	<pubDate>2025-06-24</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 7: Enhanced Lung Disease Detection Using Double Denoising and 1D Convolutional Neural Networks on Respiratory Sound Analysis</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/7">doi: 10.3390/cmsf2025010007</a></p>
	<p>Authors:
		Reshma Sreejith
		R. Kanesaraj Ramasamy
		Wan-Noorshahida Mohd-Isa
		Junaidi Abdullah
		</p>
	<p>The accurate and early detection of respiratory diseases is vital for effective diagnosis and treatment. This study presents a new approach for classifying lung sounds using a double denoising method combined with a 1D Convolutional Neural Network (CNN). The preprocessing uses Fast Fourier Transform to clean up sounds and High-Pass Filtering to improve the quality of breathing sounds by eliminating noise and low-frequency interruptions. The Short-Time Fourier Transform (STFT) extracts features that capture localised frequency variations, crucial for distinguishing normal and abnormal respiratory sounds. These features are input into the 1D CNN, which classifies diseases such as bronchiectasis, pneumonia, asthma, COPD, healthy, and URTI. The dual denoising method enhances signal clarity and classification performance. The model achieved 96% validation accuracy, highlighting its reliability in detecting respiratory conditions. The results emphasise the effectiveness of combining signal augmentation with deep learning for automated respiratory sound analysis, with future research focusing on dataset expansion and model refinement for clinical use.</p>
	]]></content:encoded>

	<dc:title>Enhanced Lung Disease Detection Using Double Denoising and 1D Convolutional Neural Networks on Respiratory Sound Analysis</dc:title>
			<dc:creator>Reshma Sreejith</dc:creator>
			<dc:creator>R. Kanesaraj Ramasamy</dc:creator>
			<dc:creator>Wan-Noorshahida Mohd-Isa</dc:creator>
			<dc:creator>Junaidi Abdullah</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010007</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-06-24</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-06-24</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>7</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010007</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/7</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/2">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 2: Blockchain for Sustainable Smart Cities: Motivations and Challenges</title>
	<link>https://www.mdpi.com/2813-0324/10/1/2</link>
	<description>Rapid urbanization and the rising demand for sustainable living have encouraged the growth of smart cities, which incorporate innovative technologies to ameliorate environmental sustainability, optimize resource management, and improve living standards. The convergence of blockchain (BC) technology and the Internet of Things (IoT) presents transformative convenience for managing smart cities and achieving sustainability goals. In fact, blockchain technology combined with IoT devices provides a decentralized, transparent, and safe framework for managing massive volumes of data produced by networked sensors and systems. By guaranteeing accountability, minimizing fraud, and maximizing resource use, blockchain not only facilitates the smooth operation of smart city infrastructures but also encourages sustainable habits. The various uses of blockchain technology in smart city management and its contribution to sustainability objectives are examined in this study. Through an examination of important domains like energy distribution, waste management, transportation systems, healthcare, and governance, the research shows how blockchain promotes effective data exchange and data security, builds stakeholder trust, and makes it possible to establish decentralized organizations to improve decision-making.</description>
	<pubDate>2025-06-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 2: Blockchain for Sustainable Smart Cities: Motivations and Challenges</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/2">doi: 10.3390/cmsf2025010002</a></p>
	<p>Authors:
		Fatima Zahrae Chentouf
		Mohamed El Alami Hasoun
		Said Bouchkaren
		</p>
	<p>Rapid urbanization and the rising demand for sustainable living have encouraged the growth of smart cities, which incorporate innovative technologies to ameliorate environmental sustainability, optimize resource management, and improve living standards. The convergence of blockchain (BC) technology and the Internet of Things (IoT) presents transformative convenience for managing smart cities and achieving sustainability goals. In fact, blockchain technology combined with IoT devices provides a decentralized, transparent, and safe framework for managing massive volumes of data produced by networked sensors and systems. By guaranteeing accountability, minimizing fraud, and maximizing resource use, blockchain not only facilitates the smooth operation of smart city infrastructures but also encourages sustainable habits. The various uses of blockchain technology in smart city management and its contribution to sustainability objectives are examined in this study. Through an examination of important domains like energy distribution, waste management, transportation systems, healthcare, and governance, the research shows how blockchain promotes effective data exchange and data security, builds stakeholder trust, and makes it possible to establish decentralized organizations to improve decision-making.</p>
	]]></content:encoded>

	<dc:title>Blockchain for Sustainable Smart Cities: Motivations and Challenges</dc:title>
			<dc:creator>Fatima Zahrae Chentouf</dc:creator>
			<dc:creator>Mohamed El Alami Hasoun</dc:creator>
			<dc:creator>Said Bouchkaren</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010002</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-06-17</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-06-17</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>2</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010002</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/2</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/1">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 1: Preface of Sustainable Computing and Green Technologies (SCGT’2025)</title>
	<link>https://www.mdpi.com/2813-0324/10/1/1</link>
	<description>n/a</description>
	<pubDate>2025-06-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 1: Preface of Sustainable Computing and Green Technologies (SCGT’2025)</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/1">doi: 10.3390/cmsf2025010001</a></p>
	<p>Authors:
		Hicham Gibet Tani
		Mohamed Kouissi
		Mohamed Ben Ahmed
		Anouar Boudhir Abdelhakim
		Lotfi Elaachak
		</p>
	<p>n/a</p>
	]]></content:encoded>

	<dc:title>Preface of Sustainable Computing and Green Technologies (SCGT’2025)</dc:title>
			<dc:creator>Hicham Gibet Tani</dc:creator>
			<dc:creator>Mohamed Kouissi</dc:creator>
			<dc:creator>Mohamed Ben Ahmed</dc:creator>
			<dc:creator>Anouar Boudhir Abdelhakim</dc:creator>
			<dc:creator>Lotfi Elaachak</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010001</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-06-17</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-06-17</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Editorial</prism:section>
	<prism:startingPage>1</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010001</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/1</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/16">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 16: Revolutionizing Distance Learning: The Impact of Ontology and the Semantic Web</title>
	<link>https://www.mdpi.com/2813-0324/10/1/16</link>
	<description>The digital age has transformed education, making distance learning essential. With rapid knowledge evolution, flexible and personalized learning is crucial. This article examines how ontology and semantic web technologies enhance e-learning. Ontology structures knowledge in specific domains, while the semantic web enables data automation and integration. Their adoption revolutionizes content organization and personalization. This study explores key concepts, applications, benefits, challenges, and future implications. By analyzing innovations and obstacles, it provides recommendations for educators. Ultimately, it highlights the need for a collaborative approach to leverage these technologies for a more inclusive and adaptive educational environment.</description>
	<pubDate>2025-06-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 16: Revolutionizing Distance Learning: The Impact of Ontology and the Semantic Web</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/16">doi: 10.3390/cmsf2025010016</a></p>
	<p>Authors:
		Camara Alseny
		Dhaiouir Ilham
		Haimoudi El Khatir
		</p>
	<p>The digital age has transformed education, making distance learning essential. With rapid knowledge evolution, flexible and personalized learning is crucial. This article examines how ontology and semantic web technologies enhance e-learning. Ontology structures knowledge in specific domains, while the semantic web enables data automation and integration. Their adoption revolutionizes content organization and personalization. This study explores key concepts, applications, benefits, challenges, and future implications. By analyzing innovations and obstacles, it provides recommendations for educators. Ultimately, it highlights the need for a collaborative approach to leverage these technologies for a more inclusive and adaptive educational environment.</p>
	]]></content:encoded>

	<dc:title>Revolutionizing Distance Learning: The Impact of Ontology and the Semantic Web</dc:title>
			<dc:creator>Camara Alseny</dc:creator>
			<dc:creator>Dhaiouir Ilham</dc:creator>
			<dc:creator>Haimoudi El Khatir</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010016</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-06-16</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-06-16</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>16</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010016</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/16</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/15">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 15: Video Surveillance and Artificial Intelligence for Urban Security in Smart Cities: A Review of a Selection of Empirical Studies from 2018 to 2024</title>
	<link>https://www.mdpi.com/2813-0324/10/1/15</link>
	<description>The rapid growth of information and communication technologies, in particular big data, artificial intelligence (AI), and the Internet of Things (IoT), has made it possible to make smart cities a tangible reality. In this context, real-time video surveillance plays a crucial role in improving public safety. This article presents a systematic review of studies focused on the detection of acts of aggression and crime in these cities. By studying 100 indexed scientific articles, dating from 2018 to 2024, we examine the most recent methods and techniques, with an emphasis on the use of machine learning and deep learning for the processing of real-time video streams. The works examined cover several technological axes such as convolutional neural networks (CNNs), fog computing, and integrated IoT systems while also addressing issues such as the challenges related to the detection of anomalies, frequently affected by their contextual and uncertain nature. Finally, this article offers suggestions to guide future research, with the aim of improving the accuracy and efficiency of intelligent monitoring systems.</description>
	<pubDate>2025-06-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 15: Video Surveillance and Artificial Intelligence for Urban Security in Smart Cities: A Review of a Selection of Empirical Studies from 2018 to 2024</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/15">doi: 10.3390/cmsf2025010015</a></p>
	<p>Authors:
		Abdellah Dardour
		Essaid El Haji
		Mohamed Achkari Begdouri
		</p>
	<p>The rapid growth of information and communication technologies, in particular big data, artificial intelligence (AI), and the Internet of Things (IoT), has made it possible to make smart cities a tangible reality. In this context, real-time video surveillance plays a crucial role in improving public safety. This article presents a systematic review of studies focused on the detection of acts of aggression and crime in these cities. By studying 100 indexed scientific articles, dating from 2018 to 2024, we examine the most recent methods and techniques, with an emphasis on the use of machine learning and deep learning for the processing of real-time video streams. The works examined cover several technological axes such as convolutional neural networks (CNNs), fog computing, and integrated IoT systems while also addressing issues such as the challenges related to the detection of anomalies, frequently affected by their contextual and uncertain nature. Finally, this article offers suggestions to guide future research, with the aim of improving the accuracy and efficiency of intelligent monitoring systems.</p>
	]]></content:encoded>

	<dc:title>Video Surveillance and Artificial Intelligence for Urban Security in Smart Cities: A Review of a Selection of Empirical Studies from 2018 to 2024</dc:title>
			<dc:creator>Abdellah Dardour</dc:creator>
			<dc:creator>Essaid El Haji</dc:creator>
			<dc:creator>Mohamed Achkari Begdouri</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010015</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-06-16</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-06-16</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>15</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010015</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/15</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/8">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 8: Enhancing Security and Privacy in IoT Data Streams: Real-Time Anomaly Detection for Threat Mitigation in Traffic Management</title>
	<link>https://www.mdpi.com/2813-0324/10/1/8</link>
	<description>The rapid expansion of IoT in smart cities has improved traffic management but increased security risks. Traditional IDS struggle with advanced threats, prompting adaptive solutions. This work proposes a framework combining machine learning (ML), Zero Trust Architecture (ZTA), and blockchain authentication. Supervised models (XGBoost, RF, SVM, LR) detect known anomalies, while a CNN Autoencoder identifies novel threats. Blockchain ensures identity integrity, and compromised devices are isolated automatically. Tests on the IoT-23 dataset demonstrate superior accuracy, fewer false positives, and better scalability than conventional methods. The integration of AI, Zero Trust, and blockchain significantly boosts IoT traffic system security and resilience.</description>
	<pubDate>2025-06-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 8: Enhancing Security and Privacy in IoT Data Streams: Real-Time Anomaly Detection for Threat Mitigation in Traffic Management</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/8">doi: 10.3390/cmsf2025010008</a></p>
	<p>Authors:
		Oumayma Berraadi
		Hicham Gibet Tani
		Mohamed Ben Ahmed
		</p>
	<p>The rapid expansion of IoT in smart cities has improved traffic management but increased security risks. Traditional IDS struggle with advanced threats, prompting adaptive solutions. This work proposes a framework combining machine learning (ML), Zero Trust Architecture (ZTA), and blockchain authentication. Supervised models (XGBoost, RF, SVM, LR) detect known anomalies, while a CNN Autoencoder identifies novel threats. Blockchain ensures identity integrity, and compromised devices are isolated automatically. Tests on the IoT-23 dataset demonstrate superior accuracy, fewer false positives, and better scalability than conventional methods. The integration of AI, Zero Trust, and blockchain significantly boosts IoT traffic system security and resilience.</p>
	]]></content:encoded>

	<dc:title>Enhancing Security and Privacy in IoT Data Streams: Real-Time Anomaly Detection for Threat Mitigation in Traffic Management</dc:title>
			<dc:creator>Oumayma Berraadi</dc:creator>
			<dc:creator>Hicham Gibet Tani</dc:creator>
			<dc:creator>Mohamed Ben Ahmed</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010008</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-06-16</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-06-16</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>8</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010008</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/8</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/6">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 6: Comparative Analysis of Energy Consumption and Carbon Footprint in Automatic Speech Recognition Systems: A Case Study Comparing Whisper and Google Speech-to-Text</title>
	<link>https://www.mdpi.com/2813-0324/10/1/6</link>
	<description>This study investigates the energy consumption and carbon footprint of two prominent automatic speech recognition (ASR) systems: OpenAI’s Whisper and Google’s Speech-to-Text API. We evaluate both local and cloud-based speech recognition approaches using a public Kaggle dataset of 20,000 short audio clips in Urdu, utilizing CodeCarbon, PyJoule, and PowerAPI for comprehensive energy profiling. As a result of our analysis, we expose some substantial differences between the two systems in terms of energy efficiency and carbon emissions, with the cloud-based solution showing substantially lower environmental impact despite comparable accuracy. We discuss the implications of these findings for sustainable AI deployment and minimizing the ecological footprint of speech recognition technologies.</description>
	<pubDate>2025-06-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 6: Comparative Analysis of Energy Consumption and Carbon Footprint in Automatic Speech Recognition Systems: A Case Study Comparing Whisper and Google Speech-to-Text</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/6">doi: 10.3390/cmsf2025010006</a></p>
	<p>Authors:
		Jalal El Bahri
		Mohamed Kouissi
		Mohammed Achkari Begdouri
		</p>
	<p>This study investigates the energy consumption and carbon footprint of two prominent automatic speech recognition (ASR) systems: OpenAI’s Whisper and Google’s Speech-to-Text API. We evaluate both local and cloud-based speech recognition approaches using a public Kaggle dataset of 20,000 short audio clips in Urdu, utilizing CodeCarbon, PyJoule, and PowerAPI for comprehensive energy profiling. As a result of our analysis, we expose some substantial differences between the two systems in terms of energy efficiency and carbon emissions, with the cloud-based solution showing substantially lower environmental impact despite comparable accuracy. We discuss the implications of these findings for sustainable AI deployment and minimizing the ecological footprint of speech recognition technologies.</p>
	]]></content:encoded>

	<dc:title>Comparative Analysis of Energy Consumption and Carbon Footprint in Automatic Speech Recognition Systems: A Case Study Comparing Whisper and Google Speech-to-Text</dc:title>
			<dc:creator>Jalal El Bahri</dc:creator>
			<dc:creator>Mohamed Kouissi</dc:creator>
			<dc:creator>Mohammed Achkari Begdouri</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010006</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-06-16</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-06-16</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>6</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010006</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/6</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/5">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 5: Green DevOps: A Strategic Framework for Sustainable Software Development</title>
	<link>https://www.mdpi.com/2813-0324/10/1/5</link>
	<description>In the era of digital transformation, the environmental impact of software development has become a pressing concern, necessitating the integration of sustainability into software development processes. This paper addresses how DevOps, traditionally celebrated for enhancing efficiency and speed in software delivery, can integrate sustainability principles to mitigate environmental impacts. We propose guidelines for integrating sustainability throughout the DevOps life cycle, aiming for significant carbon footprint reduction without compromising quality. Using a Life Cycle Assessment (LCA) approach, this study enables stakeholders to incorporate green guidelines at various software development and operation stages, enhancing software environmental friendliness. Our model supports sustainable software development and encourages proactive environmental impact minimization.</description>
	<pubDate>2025-06-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 5: Green DevOps: A Strategic Framework for Sustainable Software Development</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/5">doi: 10.3390/cmsf2025010005</a></p>
	<p>Authors:
		Mohamed Toufik Ailane
		Carolin Rubner
		Andreas Rausch
		</p>
	<p>In the era of digital transformation, the environmental impact of software development has become a pressing concern, necessitating the integration of sustainability into software development processes. This paper addresses how DevOps, traditionally celebrated for enhancing efficiency and speed in software delivery, can integrate sustainability principles to mitigate environmental impacts. We propose guidelines for integrating sustainability throughout the DevOps life cycle, aiming for significant carbon footprint reduction without compromising quality. Using a Life Cycle Assessment (LCA) approach, this study enables stakeholders to incorporate green guidelines at various software development and operation stages, enhancing software environmental friendliness. Our model supports sustainable software development and encourages proactive environmental impact minimization.</p>
	]]></content:encoded>

	<dc:title>Green DevOps: A Strategic Framework for Sustainable Software Development</dc:title>
			<dc:creator>Mohamed Toufik Ailane</dc:creator>
			<dc:creator>Carolin Rubner</dc:creator>
			<dc:creator>Andreas Rausch</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010005</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-06-16</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-06-16</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>5</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010005</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/5</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/4">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 4: Fuzzy Logic Detector for Photovoltaic Fault Diagnosis</title>
	<link>https://www.mdpi.com/2813-0324/10/1/4</link>
	<description>The performance degradation of photovoltaic (PV) systems, comprising solar panels and DC-DC converters, is often caused by various anomalies related to manufacturing defects, operational conditions, or environmental factors. These faults significantly reduce energy output, preventing the system from reaching its nominal power and expected production levels. Given the demonstrated impact of such faults on PV system efficiency, an effective diagnostic method is essential for proactive maintenance and optimal performance. This paper presents a fault detection algorithm based on a Mamdani-type fuzzy logic approach. The proposed method utilizes three key inputs—panel current, panel voltage, and converter voltage—to assess system health. By computing the distortion ratios of these electrical parameters and processing them through a fuzzy logic controller, the algorithm accurately identifies fault conditions. Simulation results validate the effectiveness of this approach, demonstrating its capability to detect and classify 12 distinct faults in both the PV array and the DC-DC converter. The study highlights the potential of fuzzy logic-based diagnostics in enhancing the reliability and maintenance of photovoltaic systems.</description>
	<pubDate>2025-06-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 4: Fuzzy Logic Detector for Photovoltaic Fault Diagnosis</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/4">doi: 10.3390/cmsf2025010004</a></p>
	<p>Authors:
		Chaymae Abdellaoui
		Youssef Lagmich
		</p>
	<p>The performance degradation of photovoltaic (PV) systems, comprising solar panels and DC-DC converters, is often caused by various anomalies related to manufacturing defects, operational conditions, or environmental factors. These faults significantly reduce energy output, preventing the system from reaching its nominal power and expected production levels. Given the demonstrated impact of such faults on PV system efficiency, an effective diagnostic method is essential for proactive maintenance and optimal performance. This paper presents a fault detection algorithm based on a Mamdani-type fuzzy logic approach. The proposed method utilizes three key inputs—panel current, panel voltage, and converter voltage—to assess system health. By computing the distortion ratios of these electrical parameters and processing them through a fuzzy logic controller, the algorithm accurately identifies fault conditions. Simulation results validate the effectiveness of this approach, demonstrating its capability to detect and classify 12 distinct faults in both the PV array and the DC-DC converter. The study highlights the potential of fuzzy logic-based diagnostics in enhancing the reliability and maintenance of photovoltaic systems.</p>
	]]></content:encoded>

	<dc:title>Fuzzy Logic Detector for Photovoltaic Fault Diagnosis</dc:title>
			<dc:creator>Chaymae Abdellaoui</dc:creator>
			<dc:creator>Youssef Lagmich</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010004</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-06-16</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-06-16</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>4</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010004</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/4</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/10/1/3">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 3: Systematic Review of AI-Driven Personalization in Serious Games for Teaching at the Right Level in Morocco</title>
	<link>https://www.mdpi.com/2813-0324/10/1/3</link>
	<description>Digitalization has shaped every part of our world, from education to healthcare, from finance to entertainment, and from manufacturing to social interactions. This digital transformation has put tremendous power in the hands of individuals and delivered even better results than sticking to old, traditional ways. Such effective digitalization cannot be achieved easily; a good digitized system is the product of a lot of effort. In this paper, we explore the state-of-the-art advancements in smart education technologies, analyze existing digital solutions, and outline considerations for developing a tailored system to digitalize the Teaching at the Right Level (TaRL) assessment for Moroccan primary education. Our approach aims to bridge skill gaps by integrating serious games, adaptive learning techniques, and real-time analytics to enhance assessment effectiveness and ease educators’ workloads.</description>
	<pubDate>2025-06-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 10, Pages 3: Systematic Review of AI-Driven Personalization in Serious Games for Teaching at the Right Level in Morocco</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/10/1/3">doi: 10.3390/cmsf2025010003</a></p>
	<p>Authors:
		Najlae Abarghache
		Younès Alaoui Soulimani
		Lotfi Elaachak
		Abderrahim Ghadi
		</p>
	<p>Digitalization has shaped every part of our world, from education to healthcare, from finance to entertainment, and from manufacturing to social interactions. This digital transformation has put tremendous power in the hands of individuals and delivered even better results than sticking to old, traditional ways. Such effective digitalization cannot be achieved easily; a good digitized system is the product of a lot of effort. In this paper, we explore the state-of-the-art advancements in smart education technologies, analyze existing digital solutions, and outline considerations for developing a tailored system to digitalize the Teaching at the Right Level (TaRL) assessment for Moroccan primary education. Our approach aims to bridge skill gaps by integrating serious games, adaptive learning techniques, and real-time analytics to enhance assessment effectiveness and ease educators’ workloads.</p>
	]]></content:encoded>

	<dc:title>Systematic Review of AI-Driven Personalization in Serious Games for Teaching at the Right Level in Morocco</dc:title>
			<dc:creator>Najlae Abarghache</dc:creator>
			<dc:creator>Younès Alaoui Soulimani</dc:creator>
			<dc:creator>Lotfi Elaachak</dc:creator>
			<dc:creator>Abderrahim Ghadi</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2025010003</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2025-06-16</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2025-06-16</prism:publicationDate>
	<prism:volume>10</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>3</prism:startingPage>
		<prism:doi>10.3390/cmsf2025010003</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/10/1/3</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/8/1/99">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 8, Pages 99: Using Reconfigurable Multi-Valued Logic Operators to Build a New Encryption Technology</title>
	<link>https://www.mdpi.com/2813-0324/8/1/99</link>
	<description>Current encryption technologies mostly rely on complex algorithms or difficult mathematical problems to improve security. Therefore, it is difficult for these encryption technologies to possess both high security and high efficiency, which are two properties that people desire. Trying to solve this dilemma, we built a new encryption technology, called configurable encryption technology (CET), based on the typical structure of reconfigurable quaternary logic operator (RQLO) that was invented in 2018. We designed the CET as a block cipher for symmetric encryption, where we use four 32-quit RQLO typical structures as the encryptor, decryptor, and two key derivation operators. Taking advantage of the reconfigurability of the RQLO typical structure, the CET can automatically reconfigure the keys and symbol substitution rules of the encryptor and decryptor after each encryption operation. We found that a chip containing about 70,000 transistors and 500 MB of nonvolatile memory could provide all the CET devices and generalized keys needed for any user&amp;amp;rsquo;s lifetime, to implement a practical one-time pad encryption technology. We also developed a strategy to solve the current key distribution problem with prestored generalized key source data and on-site appointment codes. The CET is expected to provide a theoretical basis and core technology for using the RQLO to build a new cryptographic system with high security, fast encryption/decryption speed, and low manufacturing cost.</description>
	<pubDate>2024-04-10</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 8, Pages 99: Using Reconfigurable Multi-Valued Logic Operators to Build a New Encryption Technology</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/8/1/99">doi: 10.3390/cmsf2023008099</a></p>
	<p>Authors:
		Hongjian Wang
		Shan Ouyang
		Xunlei Chen
		Yi Jin
		</p>
	<p>Current encryption technologies mostly rely on complex algorithms or difficult mathematical problems to improve security. Therefore, it is difficult for these encryption technologies to possess both high security and high efficiency, which are two properties that people desire. Trying to solve this dilemma, we built a new encryption technology, called configurable encryption technology (CET), based on the typical structure of reconfigurable quaternary logic operator (RQLO) that was invented in 2018. We designed the CET as a block cipher for symmetric encryption, where we use four 32-quit RQLO typical structures as the encryptor, decryptor, and two key derivation operators. Taking advantage of the reconfigurability of the RQLO typical structure, the CET can automatically reconfigure the keys and symbol substitution rules of the encryptor and decryptor after each encryption operation. We found that a chip containing about 70,000 transistors and 500 MB of nonvolatile memory could provide all the CET devices and generalized keys needed for any user&amp;amp;rsquo;s lifetime, to implement a practical one-time pad encryption technology. We also developed a strategy to solve the current key distribution problem with prestored generalized key source data and on-site appointment codes. The CET is expected to provide a theoretical basis and core technology for using the RQLO to build a new cryptographic system with high security, fast encryption/decryption speed, and low manufacturing cost.</p>
	]]></content:encoded>

	<dc:title>Using Reconfigurable Multi-Valued Logic Operators to Build a New Encryption Technology</dc:title>
			<dc:creator>Hongjian Wang</dc:creator>
			<dc:creator>Shan Ouyang</dc:creator>
			<dc:creator>Xunlei Chen</dc:creator>
			<dc:creator>Yi Jin</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2023008099</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2024-04-10</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2024-04-10</prism:publicationDate>
	<prism:volume>8</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>99</prism:startingPage>
		<prism:doi>10.3390/cmsf2023008099</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/8/1/99</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/9/1/6">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 9, Pages 6: iBALR3D: imBalanced-Aware Long-Range 3D Semantic Segmentation</title>
	<link>https://www.mdpi.com/2813-0324/9/1/6</link>
	<description>Three-dimensional semantic segmentation is crucial for comprehending transmission line structure and environment. This understanding forms the basis for a variety of applications, such as automatic risk assessment of line tripping caused by wildfires, wind, and thunder. However, the performance of current 3D point cloud segmentation methods tends to degrade on imbalanced data, which negatively impacts the overall segmentation results. In this paper, we proposed an imBalanced-Aware Long-Range 3D Semantic Segmentation framework (iBALR3D) which is specifically designed for large-scale transmission line segmentation. To address the unsatisfactory performance on categories with few points, an Enhanced Imbalanced Contrastive Learning module is first proposed to improve feature discrimination between points across sampling regions by contrasting the representations with the assistance of data augmentation. A structural Adaptive Spatial Encoder is designed to capture the distinguish measures across different components. Additionally, we employ a sampling strategy to enable the model to concentrate more on regions of categories with few points. This strategy further enhances the model&amp;amp;rsquo;s robustness in handling challenges associated with long-range and significant data imbalances. Finally, we introduce a large-scale 3D point cloud dataset (500KV3D) captured from high-voltage long-range transmission lines and evaluate iBALR3D on it. Extensive experiments demonstrate the effectiveness and superiority of our approach.</description>
	<pubDate>2024-03-14</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 9, Pages 6: iBALR3D: imBalanced-Aware Long-Range 3D Semantic Segmentation</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/9/1/6">doi: 10.3390/cmsf2024009006</a></p>
	<p>Authors:
		Keying Zhang
		Ruirui Cai
		Xinqiao Wu
		Jiguang Zhao
		Ping Qin
		</p>
	<p>Three-dimensional semantic segmentation is crucial for comprehending transmission line structure and environment. This understanding forms the basis for a variety of applications, such as automatic risk assessment of line tripping caused by wildfires, wind, and thunder. However, the performance of current 3D point cloud segmentation methods tends to degrade on imbalanced data, which negatively impacts the overall segmentation results. In this paper, we proposed an imBalanced-Aware Long-Range 3D Semantic Segmentation framework (iBALR3D) which is specifically designed for large-scale transmission line segmentation. To address the unsatisfactory performance on categories with few points, an Enhanced Imbalanced Contrastive Learning module is first proposed to improve feature discrimination between points across sampling regions by contrasting the representations with the assistance of data augmentation. A structural Adaptive Spatial Encoder is designed to capture the distinguish measures across different components. Additionally, we employ a sampling strategy to enable the model to concentrate more on regions of categories with few points. This strategy further enhances the model&amp;amp;rsquo;s robustness in handling challenges associated with long-range and significant data imbalances. Finally, we introduce a large-scale 3D point cloud dataset (500KV3D) captured from high-voltage long-range transmission lines and evaluate iBALR3D on it. Extensive experiments demonstrate the effectiveness and superiority of our approach.</p>
	]]></content:encoded>

	<dc:title>iBALR3D: imBalanced-Aware Long-Range 3D Semantic Segmentation</dc:title>
			<dc:creator>Keying Zhang</dc:creator>
			<dc:creator>Ruirui Cai</dc:creator>
			<dc:creator>Xinqiao Wu</dc:creator>
			<dc:creator>Jiguang Zhao</dc:creator>
			<dc:creator>Ping Qin</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2024009006</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2024-03-14</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2024-03-14</prism:publicationDate>
	<prism:volume>9</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>6</prism:startingPage>
		<prism:doi>10.3390/cmsf2024009006</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/9/1/6</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/8/1/98">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 8, Pages 98: The Exploration of High Quality Education in Scientific and Technological Innovation Based on Artificial Intelligence</title>
	<link>https://www.mdpi.com/2813-0324/8/1/98</link>
	<description>This paper explains that setting up artificial intelligence courses can clearly enhance students&amp;amp;rsquo; interest in high technology, boost learning confidence and promote students&amp;amp;rsquo; overall development in the following three aspects: the significance of artificial intelligence education to students, the confusion regarding artificial intelligence teaching in this stage, especially in rural middle schools, and some related suggestions.</description>
	<pubDate>2024-02-26</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 8, Pages 98: The Exploration of High Quality Education in Scientific and Technological Innovation Based on Artificial Intelligence</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/8/1/98">doi: 10.3390/cmsf2023008098</a></p>
	<p>Authors:
		Xiaoli Yang
		Songbai Wang
		</p>
	<p>This paper explains that setting up artificial intelligence courses can clearly enhance students&amp;amp;rsquo; interest in high technology, boost learning confidence and promote students&amp;amp;rsquo; overall development in the following three aspects: the significance of artificial intelligence education to students, the confusion regarding artificial intelligence teaching in this stage, especially in rural middle schools, and some related suggestions.</p>
	]]></content:encoded>

	<dc:title>The Exploration of High Quality Education in Scientific and Technological Innovation Based on Artificial Intelligence</dc:title>
			<dc:creator>Xiaoli Yang</dc:creator>
			<dc:creator>Songbai Wang</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2023008098</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2024-02-26</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2024-02-26</prism:publicationDate>
	<prism:volume>8</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>98</prism:startingPage>
		<prism:doi>10.3390/cmsf2023008098</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/8/1/98</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/9/1/4">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 9, Pages 4: Small Dataset, Big Gains: Enhancing Reinforcement Learning by Offline Pre-Training with Model-Based Augmentation</title>
	<link>https://www.mdpi.com/2813-0324/9/1/4</link>
	<description>Offline reinforcement learning leverages pre-collected datasets of transitions to train policies. It can serve as an effective initialization for online algorithms, enhancing sample efficiency and speeding up convergence. However, when such datasets are limited in size and quality, offline pre-training can produce sub-optimal policies and lead to a degraded online reinforcement learning performance. In this paper, we propose a model-based data augmentation strategy to maximize the benefits of offline reinforcement learning pre-training and reduce the scale of data needed to be effective. Our approach leverages a world model of the environment trained on the offline dataset to augment states during offline pre-training. We evaluate our approach on a variety of MuJoCo robotic tasks, and our results show that it can jumpstart online fine-tuning and substantially reduce&amp;amp;mdash;in some cases by an order of magnitude&amp;amp;mdash;the required number of environment interactions.</description>
	<pubDate>2024-02-18</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 9, Pages 4: Small Dataset, Big Gains: Enhancing Reinforcement Learning by Offline Pre-Training with Model-Based Augmentation</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/9/1/4">doi: 10.3390/cmsf2024009004</a></p>
	<p>Authors:
		Girolamo Macaluso
		Alessandro Sestini
		Andrew D. Bagdanov
		</p>
	<p>Offline reinforcement learning leverages pre-collected datasets of transitions to train policies. It can serve as an effective initialization for online algorithms, enhancing sample efficiency and speeding up convergence. However, when such datasets are limited in size and quality, offline pre-training can produce sub-optimal policies and lead to a degraded online reinforcement learning performance. In this paper, we propose a model-based data augmentation strategy to maximize the benefits of offline reinforcement learning pre-training and reduce the scale of data needed to be effective. Our approach leverages a world model of the environment trained on the offline dataset to augment states during offline pre-training. We evaluate our approach on a variety of MuJoCo robotic tasks, and our results show that it can jumpstart online fine-tuning and substantially reduce&amp;amp;mdash;in some cases by an order of magnitude&amp;amp;mdash;the required number of environment interactions.</p>
	]]></content:encoded>

	<dc:title>Small Dataset, Big Gains: Enhancing Reinforcement Learning by Offline Pre-Training with Model-Based Augmentation</dc:title>
			<dc:creator>Girolamo Macaluso</dc:creator>
			<dc:creator>Alessandro Sestini</dc:creator>
			<dc:creator>Andrew D. Bagdanov</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2024009004</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2024-02-18</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2024-02-18</prism:publicationDate>
	<prism:volume>9</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>4</prism:startingPage>
		<prism:doi>10.3390/cmsf2024009004</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/9/1/4</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/9/1/5">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 9, Pages 5: Exploring 3D Object Detection for Autonomous Factory Driving: Advanced Research on Handling Limited Annotations with Ground Truth Sampling Augmentation</title>
	<link>https://www.mdpi.com/2813-0324/9/1/5</link>
	<description>Autonomously driving vehicles in car factories and parking spaces can represent a competitive advantage in the logistics industry. However, the real-world application is challenging in many ways. First of all, there are no publicly available datasets for this specific task. Therefore, we equipped two industrial production sites with up to 11 LiDAR sensors to collect and annotate our own data for infrastructural 3D object detection. These form the basis for extensive experiments. Due to the still limited amount of labeled data, the commonly used ground truth sampling augmentation is the core of research in this work. Several variations of this augmentation method are explored, revealing that in our case, the most commonly used is not necessarily the best. We show that an easy-to-create polygon can noticeably improve the detection results in this application scenario. By using these augmentation methods, it is even possible to achieve moderate detection results when only empty frames without any objects and a database with only a few labeled objects are used.</description>
	<pubDate>2024-02-18</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 9, Pages 5: Exploring 3D Object Detection for Autonomous Factory Driving: Advanced Research on Handling Limited Annotations with Ground Truth Sampling Augmentation</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/9/1/5">doi: 10.3390/cmsf2024009005</a></p>
	<p>Authors:
		Matthias Reuse
		Karl Amende
		Martin Simon
		Bernhard Sick
		</p>
	<p>Autonomously driving vehicles in car factories and parking spaces can represent a competitive advantage in the logistics industry. However, the real-world application is challenging in many ways. First of all, there are no publicly available datasets for this specific task. Therefore, we equipped two industrial production sites with up to 11 LiDAR sensors to collect and annotate our own data for infrastructural 3D object detection. These form the basis for extensive experiments. Due to the still limited amount of labeled data, the commonly used ground truth sampling augmentation is the core of research in this work. Several variations of this augmentation method are explored, revealing that in our case, the most commonly used is not necessarily the best. We show that an easy-to-create polygon can noticeably improve the detection results in this application scenario. By using these augmentation methods, it is even possible to achieve moderate detection results when only empty frames without any objects and a database with only a few labeled objects are used.</p>
	]]></content:encoded>

	<dc:title>Exploring 3D Object Detection for Autonomous Factory Driving: Advanced Research on Handling Limited Annotations with Ground Truth Sampling Augmentation</dc:title>
			<dc:creator>Matthias Reuse</dc:creator>
			<dc:creator>Karl Amende</dc:creator>
			<dc:creator>Martin Simon</dc:creator>
			<dc:creator>Bernhard Sick</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2024009005</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2024-02-18</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2024-02-18</prism:publicationDate>
	<prism:volume>9</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>5</prism:startingPage>
		<prism:doi>10.3390/cmsf2024009005</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/9/1/5</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/8/1/96">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 8, Pages 96: Viewpoints on the Fundamentals of Information Science</title>
	<link>https://www.mdpi.com/2813-0324/8/1/96</link>
	<description>In this paper, the author starts with a critique of Wiener&amp;amp;rsquo;s advocated concept of information and provides new definitions for a series of fundamental concepts in the fundamentals of information science. Furthermore, a fresh interpretation of several fundamental issues in information science is presented, thereby establishing a distinct and innovative foundation for information science.</description>
	<pubDate>2024-02-08</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 8, Pages 96: Viewpoints on the Fundamentals of Information Science</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/8/1/96">doi: 10.3390/cmsf2023008096</a></p>
	<p>Authors:
		Hailong Ji
		</p>
	<p>In this paper, the author starts with a critique of Wiener&amp;amp;rsquo;s advocated concept of information and provides new definitions for a series of fundamental concepts in the fundamentals of information science. Furthermore, a fresh interpretation of several fundamental issues in information science is presented, thereby establishing a distinct and innovative foundation for information science.</p>
	]]></content:encoded>

	<dc:title>Viewpoints on the Fundamentals of Information Science</dc:title>
			<dc:creator>Hailong Ji</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2023008096</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2024-02-08</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2024-02-08</prism:publicationDate>
	<prism:volume>8</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>96</prism:startingPage>
		<prism:doi>10.3390/cmsf2023008096</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/8/1/96</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/8/1/97">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 8, Pages 97: Study on the Application of Virtual Reality Technology in Cross-Border Higher Education</title>
	<link>https://www.mdpi.com/2813-0324/8/1/97</link>
	<description>This paper summarizes the problems existing in cross-border higher education through the analysis of the development status and characteristics of virtual reality technology and cross-border higher education, and puts forward the important significance and enlightenment of the application of virtual reality technology in cross-border higher education in the new era for solving the practical problems of cross-border education. It also points out that the new mode and situation of online and offline joint development created by the integration of virtual reality technology and cross-border higher education will have an important impact on accelerating the opening up of Chinese education and improving the quality and efficiency of cross-border higher education.</description>
	<pubDate>2024-02-08</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 8, Pages 97: Study on the Application of Virtual Reality Technology in Cross-Border Higher Education</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/8/1/97">doi: 10.3390/cmsf2023008097</a></p>
	<p>Authors:
		Yanfang Hou
		</p>
	<p>This paper summarizes the problems existing in cross-border higher education through the analysis of the development status and characteristics of virtual reality technology and cross-border higher education, and puts forward the important significance and enlightenment of the application of virtual reality technology in cross-border higher education in the new era for solving the practical problems of cross-border education. It also points out that the new mode and situation of online and offline joint development created by the integration of virtual reality technology and cross-border higher education will have an important impact on accelerating the opening up of Chinese education and improving the quality and efficiency of cross-border higher education.</p>
	]]></content:encoded>

	<dc:title>Study on the Application of Virtual Reality Technology in Cross-Border Higher Education</dc:title>
			<dc:creator>Yanfang Hou</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2023008097</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2024-02-08</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2024-02-08</prism:publicationDate>
	<prism:volume>8</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>97</prism:startingPage>
		<prism:doi>10.3390/cmsf2023008097</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/8/1/97</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/9/1/3">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 9, Pages 3: Semi-Supervised Implicit Augmentation for Data-Scarce VQA</title>
	<link>https://www.mdpi.com/2813-0324/9/1/3</link>
	<description>Vision-language models (VLMs) have demonstrated increasing potency in solving complex vision-language tasks in the recent past. Visual question answering (VQA) is one of the primary downstream tasks for assessing the capability of VLMs, as it helps in gauging the multimodal understanding of a VLM in answering open-ended questions. The vast contextual information learned during the pretraining stage in VLMs can be utilised effectively to finetune the VQA model for specific datasets. In particular, special types of VQA datasets, such as OK-VQA, A-OKVQA (outside knowledge-based), and ArtVQA (domain-specific), have a relatively smaller number of images and corresponding question-answer annotations in the training set. Such datasets can be categorised as data-scarce. This hinders the effective learning of VLMs due to the low information availability. We introduce SemIAug (Semi-Supervised Implicit Augmentation), a model and dataset agnostic strategy specially designed to address the challenges faced by limited data availability in the domain-specific VQA datasets. SemIAug uses the annotated image-question data present within the chosen dataset and augments it with meaningful new image-question associations. We show that SemIAug improves the VQA performance on data-scarce datasets without the need for additional data or labels.</description>
	<pubDate>2024-02-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 9, Pages 3: Semi-Supervised Implicit Augmentation for Data-Scarce VQA</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/9/1/3">doi: 10.3390/cmsf2024009003</a></p>
	<p>Authors:
		Bhargav Dodla
		Kartik Hegde
		A. N. Rajagopalan
		</p>
	<p>Vision-language models (VLMs) have demonstrated increasing potency in solving complex vision-language tasks in the recent past. Visual question answering (VQA) is one of the primary downstream tasks for assessing the capability of VLMs, as it helps in gauging the multimodal understanding of a VLM in answering open-ended questions. The vast contextual information learned during the pretraining stage in VLMs can be utilised effectively to finetune the VQA model for specific datasets. In particular, special types of VQA datasets, such as OK-VQA, A-OKVQA (outside knowledge-based), and ArtVQA (domain-specific), have a relatively smaller number of images and corresponding question-answer annotations in the training set. Such datasets can be categorised as data-scarce. This hinders the effective learning of VLMs due to the low information availability. We introduce SemIAug (Semi-Supervised Implicit Augmentation), a model and dataset agnostic strategy specially designed to address the challenges faced by limited data availability in the domain-specific VQA datasets. SemIAug uses the annotated image-question data present within the chosen dataset and augments it with meaningful new image-question associations. We show that SemIAug improves the VQA performance on data-scarce datasets without the need for additional data or labels.</p>
	]]></content:encoded>

	<dc:title>Semi-Supervised Implicit Augmentation for Data-Scarce VQA</dc:title>
			<dc:creator>Bhargav Dodla</dc:creator>
			<dc:creator>Kartik Hegde</dc:creator>
			<dc:creator>A. N. Rajagopalan</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2024009003</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2024-02-07</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2024-02-07</prism:publicationDate>
	<prism:volume>9</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>3</prism:startingPage>
		<prism:doi>10.3390/cmsf2024009003</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/9/1/3</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/8/1/95">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 8, Pages 95: The Certainty, Influence, and Multi-Dimensional Defense of Digital Socialist Ideology</title>
	<link>https://www.mdpi.com/2813-0324/8/1/95</link>
	<description>With the development of modern network technology, human beings have constructed a development model of digital society. Human social practice has been given a unique digital color. Digital society determines the existence and development of a digital socialist ideology. At the same time, digital socialist ideology also promotes the development of the Chinese path to modernization in the new era. In the complex era of digital socialization, it is of great practical significance to elaborate on the determinacy of digital socialist ideology, analyze the impact areas of safeguarding digital socialist ideological security, and explore ways to safeguard digital socialist ideological security from multiple perspectives.</description>
	<pubDate>2024-02-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 8, Pages 95: The Certainty, Influence, and Multi-Dimensional Defense of Digital Socialist Ideology</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/8/1/95">doi: 10.3390/cmsf2023008095</a></p>
	<p>Authors:
		Jian Zheng
		Yuting Xie
		Yaqi Ni
		</p>
	<p>With the development of modern network technology, human beings have constructed a development model of digital society. Human social practice has been given a unique digital color. Digital society determines the existence and development of a digital socialist ideology. At the same time, digital socialist ideology also promotes the development of the Chinese path to modernization in the new era. In the complex era of digital socialization, it is of great practical significance to elaborate on the determinacy of digital socialist ideology, analyze the impact areas of safeguarding digital socialist ideological security, and explore ways to safeguard digital socialist ideological security from multiple perspectives.</p>
	]]></content:encoded>

	<dc:title>The Certainty, Influence, and Multi-Dimensional Defense of Digital Socialist Ideology</dc:title>
			<dc:creator>Jian Zheng</dc:creator>
			<dc:creator>Yuting Xie</dc:creator>
			<dc:creator>Yaqi Ni</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2023008095</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2024-02-07</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2024-02-07</prism:publicationDate>
	<prism:volume>8</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>95</prism:startingPage>
		<prism:doi>10.3390/cmsf2023008095</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/8/1/95</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/9/1/2">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 9, Pages 2: Frustratingly Easy Environment Discovery for Invariant Learning</title>
	<link>https://www.mdpi.com/2813-0324/9/1/2</link>
	<description>Standard training via empirical risk minimization may result in making predictions that overly rely on spurious correlations. This can degrade the generalization to out-of-distribution settings where these correlations no longer hold. Invariant learning has been shown to be a promising approach for identifying predictors that ignore spurious correlations. However, an important limitation of this approach is that it assumes access to different &amp;amp;ldquo;environments&amp;amp;rdquo; (also known as domains), which may not always be available. This paper proposes a simple yet effective strategy for discovering maximally informative environments from a single dataset. Our frustratingly easy environment discovery (FEED) approach trains a biased reference classifier using a generalized cross-entropy loss function and partitions the dataset based on its performance. These environments can be used with various invariant learning algorithms, including Invariant Risk Minimization, Risk Extrapolation, and Group Distributionally Robust Optimization. The results indicate that FEED can discover environments with a higher group sufficiency gap compared to the state-of-the-art environment inference baseline and leads to improved test accuracy on CMNIST, Waterbirds, and CelebA datasets.</description>
	<pubDate>2024-01-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 9, Pages 2: Frustratingly Easy Environment Discovery for Invariant Learning</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/9/1/2">doi: 10.3390/cmsf2024009002</a></p>
	<p>Authors:
		Samira Zare
		Hien Van Nguyen
		</p>
	<p>Standard training via empirical risk minimization may result in making predictions that overly rely on spurious correlations. This can degrade the generalization to out-of-distribution settings where these correlations no longer hold. Invariant learning has been shown to be a promising approach for identifying predictors that ignore spurious correlations. However, an important limitation of this approach is that it assumes access to different &amp;amp;ldquo;environments&amp;amp;rdquo; (also known as domains), which may not always be available. This paper proposes a simple yet effective strategy for discovering maximally informative environments from a single dataset. Our frustratingly easy environment discovery (FEED) approach trains a biased reference classifier using a generalized cross-entropy loss function and partitions the dataset based on its performance. These environments can be used with various invariant learning algorithms, including Invariant Risk Minimization, Risk Extrapolation, and Group Distributionally Robust Optimization. The results indicate that FEED can discover environments with a higher group sufficiency gap compared to the state-of-the-art environment inference baseline and leads to improved test accuracy on CMNIST, Waterbirds, and CelebA datasets.</p>
	]]></content:encoded>

	<dc:title>Frustratingly Easy Environment Discovery for Invariant Learning</dc:title>
			<dc:creator>Samira Zare</dc:creator>
			<dc:creator>Hien Van Nguyen</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2024009002</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2024-01-29</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2024-01-29</prism:publicationDate>
	<prism:volume>9</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>2</prism:startingPage>
		<prism:doi>10.3390/cmsf2024009002</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/9/1/2</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/9/1/1">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 9, Pages 1: Statement of Peer Review</title>
	<link>https://www.mdpi.com/2813-0324/9/1/1</link>
	<description>In submitting conference proceedings to the Computer Sciences &amp;amp;amp; Mathematics Forum, the volume editors of the proceedings certify to the publisher that all papers published in this volume have been subjected to peer review administered by the volume editors [...]</description>
	<pubDate>2024-01-23</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 9, Pages 1: Statement of Peer Review</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/9/1/1">doi: 10.3390/cmsf2024009001</a></p>
	<p>Authors:
		Kuan-Chuan Peng
		Abhishek Aich
		Ziyan Wu
		</p>
	<p>In submitting conference proceedings to the Computer Sciences &amp;amp;amp; Mathematics Forum, the volume editors of the proceedings certify to the publisher that all papers published in this volume have been subjected to peer review administered by the volume editors [...]</p>
	]]></content:encoded>

	<dc:title>Statement of Peer Review</dc:title>
			<dc:creator>Kuan-Chuan Peng</dc:creator>
			<dc:creator>Abhishek Aich</dc:creator>
			<dc:creator>Ziyan Wu</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2024009001</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2024-01-23</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2024-01-23</prism:publicationDate>
	<prism:volume>9</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Editorial</prism:section>
	<prism:startingPage>1</prism:startingPage>
		<prism:doi>10.3390/cmsf2024009001</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/9/1/1</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/8/1/93">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 8, Pages 93: Pretrained Language Models as Containers of the Discursive Knowledge</title>
	<link>https://www.mdpi.com/2813-0324/8/1/93</link>
	<description>Discourses can be treated as instances of knowledge. The dynamic space in which the trajectories of these discourses are described can be regarded as a model of knowledge. Such a space is called a discursive space. Its scope is defined by a set of discourses. The procedure of constructing such a space is a serious problem, and so far, the only solution has been to identify the dimensions of this space through the qualitative analysis of texts on the basis of the discourses that were identified. This paper proposes a solution by using an extended variant of the embedding technique, which is the basis of neural language models (pre-trained language models and large language models) in the field of natural language processing (NLP). This technique makes it possible to create a semantic model of the language in the form of a multidimensional space. The solution proposed in this article is to repeat the embedding technique but at a higher level of abstraction, that is, the discursive level. First, the discourses would be isolated from the prepared corpus of texts, preserving their order. Then, from these discourses, identified by names, a sequence of names would be created, which would be a kind of supertext. A language model would be trained on this supertext. This model would be a multidimensional space. This space would be a discursive space constructed for one moment in time. The described steps repeated in time would allow one to construct the assumed dynamic space of discourses, i.e., discursive space.</description>
	<pubDate>2024-01-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 8, Pages 93: Pretrained Language Models as Containers of the Discursive Knowledge</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/8/1/93">doi: 10.3390/cmsf2023008093</a></p>
	<p>Authors:
		Rafal Maciag
		</p>
	<p>Discourses can be treated as instances of knowledge. The dynamic space in which the trajectories of these discourses are described can be regarded as a model of knowledge. Such a space is called a discursive space. Its scope is defined by a set of discourses. The procedure of constructing such a space is a serious problem, and so far, the only solution has been to identify the dimensions of this space through the qualitative analysis of texts on the basis of the discourses that were identified. This paper proposes a solution by using an extended variant of the embedding technique, which is the basis of neural language models (pre-trained language models and large language models) in the field of natural language processing (NLP). This technique makes it possible to create a semantic model of the language in the form of a multidimensional space. The solution proposed in this article is to repeat the embedding technique but at a higher level of abstraction, that is, the discursive level. First, the discourses would be isolated from the prepared corpus of texts, preserving their order. Then, from these discourses, identified by names, a sequence of names would be created, which would be a kind of supertext. A language model would be trained on this supertext. This model would be a multidimensional space. This space would be a discursive space constructed for one moment in time. The described steps repeated in time would allow one to construct the assumed dynamic space of discourses, i.e., discursive space.</p>
	]]></content:encoded>

	<dc:title>Pretrained Language Models as Containers of the Discursive Knowledge</dc:title>
			<dc:creator>Rafal Maciag</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2023008093</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2024-01-12</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2024-01-12</prism:publicationDate>
	<prism:volume>8</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>93</prism:startingPage>
		<prism:doi>10.3390/cmsf2023008093</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/8/1/93</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2813-0324/8/1/94">

	<title>Computer Sciences &amp; Mathematics Forum, Vol. 8, Pages 94: The Hermeneutics of Artificial Text</title>
	<link>https://www.mdpi.com/2813-0324/8/1/94</link>
	<description>Spectacular achievements of the so-called large language models (LLM), a technical solution that has emerged within natural language processing (NLP), are a common experience these days. In particular, this applies to the artificial text generated in various ways by these models. This text represents a level of semantic perfection comparable to that of or even equal to a human. On the other hand, there is extensive and old research on the role and meaning of the text in human culture and society, with a very rich philosophical background gathered in the field of hermeneutics. The paper justifies the necessity of using the research background of hermeneutics to study artificial texts and also proposes the first conclusions about these texts in the context of this background. It is the formulation of foundations of the research area that can be called the hermeneutics of artificial text.</description>
	<pubDate>2024-01-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>Computer Sciences &amp; Mathematics Forum, Vol. 8, Pages 94: The Hermeneutics of Artificial Text</b></p>
	<p>Computer Sciences &amp; Mathematics Forum <a href="https://www.mdpi.com/2813-0324/8/1/94">doi: 10.3390/cmsf2023008094</a></p>
	<p>Authors:
		Rafal Maciag
		</p>
	<p>Spectacular achievements of the so-called large language models (LLM), a technical solution that has emerged within natural language processing (NLP), are a common experience these days. In particular, this applies to the artificial text generated in various ways by these models. This text represents a level of semantic perfection comparable to that of or even equal to a human. On the other hand, there is extensive and old research on the role and meaning of the text in human culture and society, with a very rich philosophical background gathered in the field of hermeneutics. The paper justifies the necessity of using the research background of hermeneutics to study artificial texts and also proposes the first conclusions about these texts in the context of this background. It is the formulation of foundations of the research area that can be called the hermeneutics of artificial text.</p>
	]]></content:encoded>

	<dc:title>The Hermeneutics of Artificial Text</dc:title>
			<dc:creator>Rafal Maciag</dc:creator>
		<dc:identifier>doi: 10.3390/cmsf2023008094</dc:identifier>
	<dc:source>Computer Sciences &amp; Mathematics Forum</dc:source>
	<dc:date>2024-01-12</dc:date>

	<prism:publicationName>Computer Sciences &amp; Mathematics Forum</prism:publicationName>
	<prism:publicationDate>2024-01-12</prism:publicationDate>
	<prism:volume>8</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Proceeding Paper</prism:section>
	<prism:startingPage>94</prism:startingPage>
		<prism:doi>10.3390/cmsf2023008094</prism:doi>
	<prism:url>https://www.mdpi.com/2813-0324/8/1/94</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>
