<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Generalized distributed-order fractional optimal control problem using Laguerre wavelet method</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>747</FirstPage>
			<LastPage>765</LastPage>
			<ELocationID EIdType="pii">8745</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.29900.2669</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Gunjan</FirstName>
					<LastName>Dewangan</LastName>
<Affiliation>Department of Mathematics, National Institute of Technology Rourkela, Rourkela-769008, Odisha, India</Affiliation>

</Author>
<Author>
					<FirstName>Akanksha</FirstName>
					<LastName>Singh</LastName>
<Affiliation>Department of Mathematics, National Institute of Technology Rourkela, Rourkela-769008, Odisha, India</Affiliation>

</Author>
<Author>
					<FirstName>Ankur</FirstName>
					<LastName>Kanaujiya</LastName>
<Affiliation>Department of Mathematics, National Institute of Technology Rourkela, Rourkela-769008, Odisha, India</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>02</Month>
					<Day>20</Day>
				</PubDate>
			</History>
		<Abstract>This research presents a novel numerical method for solving a class of complex optimal control problems characterized by distributed-order derivatives. By effectively employing fractional-order Laguerre wavelets, the study transforms the original continuous-time problem into a discrete set of algebraic equations. This transformation is facilitated by the use of Reimann-Liouville distributed-order operational matrices and a carefully chosen set of Newton-Cotes collocation points. The optimized solution is then determined by applying the Lagrange multiplier method to solve the resulting system of equations. The paper rigorously investigates the convergence properties of this approach, establishing error bounds that provide a measure of its accuracy. Finally, the effectiveness of this method is demonstrated through a series of illustrative examples, showcasing its high precision and applicability to a wide range of generalized distributed-order optimal control problems.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Distributed-order</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">optimal control problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Laguerre</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">wavelets</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">operational matrix</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_8745_3a58b590ecb8ada9aa4a844250f4cb5d.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Dynamical behavior of a multi-group stochastic SEIR system with symptomatic and asymptomatic individuals</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>767</FirstPage>
			<LastPage>786</LastPage>
			<ELocationID EIdType="pii">8782</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.30419.2730</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Sanaz</FirstName>
					<LastName>Lamei</LastName>
<Affiliation>Faculty of Mathematical sciences , University of Guilan,  P. O. Box 1914, Rasht, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>04</Month>
					<Day>18</Day>
				</PubDate>
			</History>
		<Abstract>In this paper, a multigroup stochastic SEIR model dealing with both symptomatic and asymptomatic cases is considered. First, we show there exists  a unique global positive solution to the system for any given positive initial value. Next, we provide sufficient criteria for the existence of a unique stationary ergodic distribution of the positive solutions. Finally, sufficient criteria for disease extinction are derived.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Multi-group SEIR model</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">asymptomatic individuals</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">ergodic stationary distribution</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">extinction</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_8782_35602dc76a7d65596767d77210301fd8.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A mixed integer linear programming model for vehicle routing problem for non-complete graphs: Behshahr (Iran) case study</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>787</FirstPage>
			<LastPage>801</LastPage>
			<ELocationID EIdType="pii">8784</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.29552.2627</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Maria</FirstName>
					<LastName>Afsharirad</LastName>
<Affiliation>Department of Mathematics, University of Science and Technology of Mazandaran, P.O. Box: 48518-78195, Behshahr, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>12</Day>
				</PubDate>
			</History>
		<Abstract>We consider Vehicle Routing Problem (VRP) for non-complete graphs. In order to avoid converting all networks to complete graphs, as in travelling salesman problem, we model VRP for non-complete graphs. Subtours are allowed in this model, since they are unavoidable in non-complete structure, while disconnected subtours   are not allowed. Since disconnected subtour elimination constraints are time-consuming, we provide a separation problem for these constraints and provide an extended formulation based on this separation problem. This extended formulation turns to be equivalent to the original model. In order to reduce the size of the graph, a blocking procedure is proposed in this paper. In addition, we provide two types of valid inequalities to strengthen the formulation. Finally we test our model on a real case study and compare it to the classical model for complete graphs.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Vehicle routing problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">extended formulation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">disconnected subtour elimination constraints</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">separation problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">blocking procedure</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_8784_427445171842d77c48ee5db9504ca433.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Dimension reduction by identifying and removing redundant variables using copula function</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>803</FirstPage>
			<LastPage>815</LastPage>
			<ELocationID EIdType="pii">8837</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.28169.2484</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Kianoush</FirstName>
					<LastName>Fathi Vajargah</LastName>
<Affiliation>Department of Statistics, Islamic Azad University, North Tehran Branch, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Hamid</FirstName>
					<LastName>Mottaghi Golshan</LastName>
<Affiliation>Department of Mathematics, Islamic Azad University, Shahriar Branch, Shahriar, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Fazel</FirstName>
					<LastName>Badakhshan</LastName>
<Affiliation>Department of Statistics, Islamic Azad University, North Tehran Branch, Tehran, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>08</Month>
					<Day>16</Day>
				</PubDate>
			</History>
		<Abstract>In today&#039;s world, rapid developments in science and engineering are increasingly adding up to larger amounts of data; as a result, numerous problems have emerged in the analysis of big data. Hence, data dimensionality reduction can accelerate data analysis and even yield better results without losing any useful data.  A copula represents an appropriate model of dependence to compare multivariate distributions and better detect the relationships of data. Therefore, a copula is employed in this study to identify and delete noisy data  from the original data.  Then, it is compared to  the principal component analysis to show its superiority.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Gaussian copula function (normal)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Classification</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Principal component analysis method (PCA)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">data analysis</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Parkinson’s Disease</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_8837_0c888c51a714133e97ce97d6e8ad0f58.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A novel leading moving average indicator using ANFIS-Wavelet hybrid method for financial market forecasting</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>817</FirstPage>
			<LastPage>830</LastPage>
			<ELocationID EIdType="pii">8838</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.30492.2737</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Mohammad</FirstName>
					<LastName>Kazemi</LastName>
<Affiliation>Department of Statistics, Faculty of Mathematical Sciences, University of Guilan, Rasht, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Hamed</FirstName>
					<LastName>Mohammadi Peyhani</LastName>
<Affiliation>Department of Information Science, University of Ottago, Dunedin, New Zealand</Affiliation>

</Author>
<Author>
					<FirstName>Mohsen</FirstName>
					<LastName>Akbari</LastName>
<Affiliation>Department of Business Administration, Faculty of Management and Economics, University of Guilan, Rasht, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>04</Month>
					<Day>25</Day>
				</PubDate>
			</History>
		<Abstract>Technical analysis aims to identify market trends and forecast future direction to support profitable trading decisions. This paper introduces a novel leading moving average indicator based on a hybrid ANFIS-Wavelet approach. The proposed method consists of two main components. First, a hybrid model combining an Adaptive Network-based Fuzzy Inference System (ANFIS) and Wavelet Transform (WT) is employed to forecast future market prices, with the full wavelet decomposition of the price time series serving as input parameters for ANFIS. Second, a leading moving average is constructed using both historical and forecasted prices. Similar to the other leading indicators, the proposed indicator can serve as a market predictor due to its incorporation of forecasted values. Empirical evaluation on NASDAQ-listed stocks demonstrates that this indicator is effective as a trading decision-support tool in financial markets, such as stock exchanges.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Artificial Neural Network (ANN)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">financial forecasting</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">moving average</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Time series</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Wavelet Transform</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_8838_c175b155d1c8e754e53dcb850d7b9933.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Application of fixed structure learning automata for designing intrusion detection systems</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>831</FirstPage>
			<LastPage>850</LastPage>
			<ELocationID EIdType="pii">8839</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.29713.2656</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Kayvan</FirstName>
					<LastName>Asghari</LastName>
<Affiliation>Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>02</Month>
					<Day>02</Day>
				</PubDate>
			</History>
		<Abstract>Designing an efficient intrusion detection system involves several phases, with feature selection being one of the most important. In this paper, a fixed-structure learning automata has been applied for the feature selection phase. The introduced method includes the exploration and exploitation phases of an optimization method to find the significant features of the network events to detect intrusions. The count of the selected features in the proposed method is a pre-defined number, as the feature selection is a multi-objective problem, and one of its objectives is the feature count. The learning automata-based method uses reward and penalty operators to explore the problem&#039;s search space. The proposed method enhances the intrusion detection accuracy rate, another significant objective for a feature selection method. Two well-known intrusion detection datasets called NSL-KDD and UNSW-NB15 have been used in this paper to evaluate the proposed method. The evaluation results indicate the acceptable performance of the proposed method compared with some of the existing ones.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Fixed structure learning automata</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Feature selection problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">intrusion detection system</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_8839_2c9ad52e57ac0829961a24a837adda2a.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Accelerated DBSCAN via parallel, density-aware multi-objective genetic optimization</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>851</FirstPage>
			<LastPage>864</LastPage>
			<ELocationID EIdType="pii">8841</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.29702.2648</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Hossein</FirstName>
					<LastName>Eyvazi</LastName>
<Affiliation>Department of Computer Science, Tarbiat Modares University, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Ali</FirstName>
					<LastName>Rajaei</LastName>
<Affiliation>Department of Computer Science, Tarbiat Modares University, Tehran, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>Clustering is a fundamental task in data mining, where the quality of results often hinges on effective parameter selection. DBSCAN is widely used for discovering clusters of arbitrary shapes but is highly sensitive to its input parameters \textit{Eps} and \textit{MinPts}. This paper proposes an enhanced version of the Multi-Objective Genetic Algorithm for DBSCAN, termed \textbf{Enhanced MOGA-DBSCAN}, which introduces a modified objective function based on a density-aware Outlier Index and accelerates the optimization process through parallel computation. We evaluate the proposed method using two benchmark datasets and compare it against the original MOGA-DBSCAN as well as two adaptive variants: AMD-DBSCAN and WOA-DBSCAN. Results show that Enhanced MOGA-DBSCAN consistently achieves superior clustering performance, as measured by Rand Index and Normalized Mutual Information (NMI), while also reducing runtime relative to the original MOGA-DBSCAN. These findings highlight the effectiveness of our enhancements in improving both clustering quality and computational efficiency.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Machine learning</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Unsupervised learning</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Clustering</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">DBSCAN</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Genetic Algorithm</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_8841_5086acd54dd61307fd75520ad389ba20.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Non-standard finite difference scheme for system of singularly perturbed Fredholm integro-differential equations</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>865</FirstPage>
			<LastPage>882</LastPage>
			<ELocationID EIdType="pii">8863</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.30538.2740</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>P.  Antony</FirstName>
					<LastName>Prince</LastName>
<Affiliation>Department of Mathematics, Amrita School of Physical Science, Coimbatore, Amrita Vishwa Vidyapeetham, India</Affiliation>

</Author>
<Author>
					<FirstName>Lolugu</FirstName>
					<LastName>Govindarao</LastName>
<Affiliation>Department of Mathematics, Amrita School of Physical Science, Coimbatore, Amrita Vishwa Vidyapeetham, India</Affiliation>

</Author>
<Author>
					<FirstName>Sekar</FirstName>
					<LastName>Elango</LastName>
<Affiliation>Department of Mathematics, Amrita School of Physical Science, Coimbatore,
 Amrita Vishwa Vidyapeetham, India</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>04</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>This article solves computationally a system of reaction-diffusion singularly perturbed Fredholm integro-differential equations. A non-standard finite difference approach applies the derivative components, whereas the composite trapezoidal rule handles the integral components. The proposed computational method for a system of reaction-diffusion singularly perturbed Fredholm integro-differential equations exhibits a convergence rate of order two. An computational example is provided to substantiate the efficacy of the theoretical results.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Singular perturbation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">coupled system</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">fitted operator</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Fredholm integral</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">boundary layer</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_8863_86ab3b720cff00ed218f6e70854ad492.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Optimal third-kind Chebyshev collocation algorithm for solving beam-type micro- and nanoscale BVPs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>883</FirstPage>
			<LastPage>898</LastPage>
			<ELocationID EIdType="pii">8871</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.30690.2747</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Youssri Hassan</FirstName>
					<LastName>Youssri</LastName>
<Affiliation>Department of Mathematics, Faculty of Science, Cairo University, Giza 12613, Egypt</Affiliation>

</Author>
<Author>
					<FirstName>Ahmed Gamal</FirstName>
					<LastName>Atta</LastName>
<Affiliation>Department of Mathematics, Faculty of Education, Ain Shams University, Roxy, Cairo 11341, Egypt</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>05</Month>
					<Day>17</Day>
				</PubDate>
			</History>
		<Abstract>In this paper, we develop a numerical scheme for solving nonlinear boundary value problems (BVPs) arising in cantilever-type micro-electromechanical (MEMS) and nano-electromechanical (NEMS) systems. The method is based on a novel third-kind Chebyshev collocation approach. We derive an operational matrix of derivatives using shifted third-kind Chebyshev polynomials, which enables efficient spectral approximations of the governing equations. Numerical experiments confirm the accuracy and efficiency of the proposed method in handling the nonlinearities present in MEMS/NEMS actuator models.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Third-kind Chebyshev polynomials</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">collocation method</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">MEMS/NEMS actuators</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Nonlinear boundary value problems</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_8871_5590dcc3bb2a985505795664edfb1fbd.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A prototype model for image authentication, tamper localization and image restoration</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>899</FirstPage>
			<LastPage>916</LastPage>
			<ELocationID EIdType="pii">8872</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.30185.2704</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Seyed Amir Hossein</FirstName>
					<LastName>Tabatabaei</LastName>
<Affiliation>Department of Computer Science, Faculty of Mathematical Sciences,  University of Guilan, Rasht, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Mohammad Matin</FirstName>
					<LastName>Mirzaei</LastName>
<Affiliation>Department of Computer Science, Faculty of Mathematical Sciences, University of Guilan, Rasht, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Sadegh</FirstName>
					<LastName>Eskandari</LastName>
<Affiliation>Department of Computer Science, Faculty of Mathematical Sciences, University of Guilan, Rasht, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Amirhossein</FirstName>
					<LastName>Norouzi</LastName>
<Affiliation>Department of Computer Science, Faculty of Mathematical Sciences, University of Guilan, Rasht, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>03</Month>
					<Day>23</Day>
				</PubDate>
			</History>
		<Abstract>In this work, an algorithm and a tool for image authentication and restoration based on DCT coefficients, classic cryptography primitives, and blockchain are presented (Source code appears in https://github.com/capamir/image-authentication). The proposed scheme can verify the authenticity of an image that has been subjected to malicious alteration, localize the modified regions, and restore the original image. However, just the malicious areas (column-wise) will be reconstructed and substituted while the intact parts (columns) are left as are to save unnecessary reconstruction costs. The tool is currently provided as a prototype serving as a web interface that is able to detect the possible maliciously altered columns of the received image precisely and to store the generated hash on a blockchain structure in almost real time. Experimental results together with the analysis of the scheme presenting the performance and security of the approach are provided which enhances the usability and trustworthiness of the scheme in further developments. </Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Image authentication</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">security</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">blockchain</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">web-interface</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">prototype</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_8872_25f7faf31badba63d6e239747f0c1fc1.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Is evaluation based on accuracy of classification algorithms misleading? An approach to model validation using Bayes error rate</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>917</FirstPage>
			<LastPage>927</LastPage>
			<ELocationID EIdType="pii">8549</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.28744.2555</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Hossein</FirstName>
					<LastName>Kazemzadeh Gharechopogh</LastName>
<Affiliation>Faculty of Mathematics and Computer Science, Amirkabir University of Technology</Affiliation>

</Author>
<Author>
					<FirstName>Adel</FirstName>
					<LastName>Mohammadpour</LastName>
<Affiliation>Faculty of Mathematics and Computer Science, Amirkabir University of Technology</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>10</Month>
					<Day>20</Day>
				</PubDate>
			</History>
		<Abstract> Researchers have long regarded model accuracy as the primary metric for evaluating&lt;br /&gt; the performance of classification algorithms. The current evaluation approach, which relies solely&lt;br /&gt; on model accuracy, often leads to inappropriate evaluation of classifiers, regardless of the dataset’s&lt;br /&gt; separability and complexity. This limitation underscores the need for a new and more comprehen&lt;br /&gt;sive method. We argue that accuracy-based evaluation can be misleading, even when considering&lt;br /&gt; measures of data separability and complexity. We compare the error rates of well-known classifiers&lt;br /&gt; on Gaussian-generated datasets and show that, paradoxically, many algorithms’ observed errors are&lt;br /&gt; lower than that of the theoretical optimal classifier, leading to an overestimation of their performance.&lt;br /&gt; We consider a model invalid if its error rate is lower than the optimal classifier error, known as the&lt;br /&gt; Bayes error rate. To identify such invalid models, we introduce a procedure and propose an algorithm&lt;br /&gt; for model validation based on the Bayes error rate.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Classification</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Evaluation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">validation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Bayes error rate</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">discriminant analysis and complexity mea sure</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_8549_01c8cabd7ebe897402c97f19d5aa6604.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Numerical solution of obstacle problem by using the mesh-free radial point interpolation method</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>929</FirstPage>
			<LastPage>942</LastPage>
			<ELocationID EIdType="pii">8877</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.29905.2671</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Ahmed</FirstName>
					<LastName>Awad Nasser</LastName>
<Affiliation>Department of Mathematics, Isfahan (Khorasgan) branch, Islamic Azad University,
Isfahan, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Masoud</FirstName>
					<LastName>Allame</LastName>
<Affiliation>Department of Mathematics, Isfahan (Khorasgan) branch, Islamic Azad University,
Isfahan, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Habeeb</FirstName>
					<LastName>Abed Kadhim Aal-Rkhais</LastName>
<Affiliation>Department of Mathematics, College of Computer and Mathematics, University of
Thi-Qar, Iraq</Affiliation>

</Author>
<Author>
					<FirstName>Majid</FirstName>
					<LastName>Tavassoli-Kajani</LastName>
<Affiliation>Department of Mathematics, Isfahan (Khorasgan) branch, Islamic Azad University,
Isfahan, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>03</Month>
					<Day>07</Day>
				</PubDate>
			</History>
		<Abstract>The obstacle problem is a well-known type of elliptic variational inequality that originally arose from contact issues in solid mechanics. The solutions to the obstacle problem often have irregularities along a free boundary, which can be effective in designing an appropriate numerical method for these problems.  In this paper, we present a  mesh-free method based on the radial point interpolation method for numerically solving an obstacle problem. In the proposed method, the  radial point interpolating shape functions are utilized in the global weak form of the obstacle problem, based on the element-free Galerkin method. This approach is combined with an active set strategy to address the obstacle problem. One of the key benefits of the proposed method is its independence from any mesh of the computing domain, along with its straightforward implementation and  high numerical stability. To ensure the efficiency of the presented method, we have investigated the convergence of  the proposed method.  The  obtained numerical results confirm the theoretical achievements and demonstrate the method&#039;s effectiveness and accuracy.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Obstacle problem, variational inequality</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">meshfree method</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">radial points interpolation method</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_8877_0e8645523f08c816df68dccfae64f1ba.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Layer-resolving mesh method for convection-diffusion delay problems with boundary turning points</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>943</FirstPage>
			<LastPage>966</LastPage>
			<ELocationID EIdType="pii">8909</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.30347.2724</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Yimesgen Mehari</FirstName>
					<LastName>Kebede</LastName>
<Affiliation>Department of Mathematics, College of Science, Bahir Dar University, Bahir Dar, Ethiopia.</Affiliation>

</Author>
<Author>
					<FirstName>Awoke Andargie</FirstName>
					<LastName>Tiruneh</LastName>
<Affiliation>Department of Mathematics, College of Science, Bahir Dar University, Bahir Dar, Ethiopia.</Affiliation>

</Author>
<Author>
					<FirstName>Endalew Getnet</FirstName>
					<LastName>Tsega</LastName>
<Affiliation>Department of Mathematics, College of Science, Bahir Dar University, Bahir Dar, Ethiopia.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>04</Month>
					<Day>12</Day>
				</PubDate>
			</History>
		<Abstract>This paper introduces a numerical scheme designed to solve time-delay singularly perturbed parabolic convection-diffusion problems with turning points. A small parameter induces boundary layers, making standard methods ineffective. To tackle these challenges, we developed a layer-resolving numerical scheme using the Crank-Nicolson method (time) and a central finite difference method on a Shishkin mesh (space). The stability and parameter-uniform convergence analysis show that the error decreases quadratically. Numerical results demonstrate higher accuracy than existing approaches.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Singularly perturbed</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Layer resolving mesh</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Parameter uniform</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">turning points</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Central-difference</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_8909_91aa4c961cf9f4c45d933b5710da27cf.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Modeling and optimization of the number of graduates in a multi-specialization study program</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>967</FirstPage>
			<LastPage>982</LastPage>
			<ELocationID EIdType="pii">8914</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.29244.2602</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Jonathan</FirstName>
					<LastName>Hoseana</LastName>
<Affiliation>Parahyangan Catholic University</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>12</Month>
					<Day>14</Day>
				</PubDate>
			</History>
		<Abstract>Consider a study program which offers a number of specializations, and requires all students to be enrolled in exactly one specialization at any given time. We construct a continuous mathematical model governing the time evolution of the number of students enrolled in each of the program&#039;s specializations. Using the model, we further construct an optimization problem describing the search of an intervention strategy which maximizes the program&#039;s total number of graduates, along with a framework for sensitivity analysis. We discretize the constructs accordingly, and employ a coordinate-descent method to solve the optimization problem numerically in two simulated scenarios involving two and four specializations, respectively, describing the results&#039; practical implications.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Specialization</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Optimization</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">sensitivity analysis</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">discretization</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">coordinate descent</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_8914_d431303711d29b06a35633d34286d9e1.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Guilan</PublisherName>
				<JournalTitle>Journal of Mathematical Modeling</JournalTitle>
				<Issn>2345-394X</Issn>
				<Volume>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Numerical study of a two-dimensional eco-epidemiological model with diffusion and convex incidence rate: Unconditionally positivity preserving method</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>983</FirstPage>
			<LastPage>1005</LastPage>
			<ELocationID EIdType="pii">8896</ELocationID>
			
<ELocationID EIdType="doi">10.22124/jmm.2025.29603.2634</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Ghasem</FirstName>
					<LastName>Barid Loghmani</LastName>
<Affiliation>Department of Mathematical Sciences-Yazd University-Yazd-Iran</Affiliation>

</Author>
<Author>
					<FirstName>Mohammad Hossein</FirstName>
					<LastName>Akrami</LastName>
<Affiliation>Department of Mathematics-Yazd University-Yazd-Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Mohammad</FirstName>
					<LastName>Heydari</LastName>
<Affiliation>Department of Mathematical Sciences, Yazd University, Yazd, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Safieh</FirstName>
					<LastName>Bagheri</LastName>
<Affiliation>Department of Mathematical Sciences-Yazd University-Yazd- Iran.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>01</Month>
					<Day>18</Day>
				</PubDate>
			</History>
		<Abstract>In this paper,  a two-dimensional eco-epidemiological model with diffusion and convex incidence rate is studied, that is, the density of population depends on time and two spatial variables.  The main challenge in investigation of population models is finding a numerical method to obtain non-negative solutions. Some numerical methods, for instance Euler&#039;s method, based on the standard finite difference formulas are inefficient for solving such models because they are not always able to produce non-negative approximate solutions. On the other hand, the non-standard finite difference schemes can provide  non-negative approximations conditionally.  In { the} current work,  first, the stability of the dynamic proposed eco-epidemiological model is examined.  Then, a numerical method that provides unconditional acceptable solutions is introduced.  In what follows, the consistency and stability of the numerical method are discussed. Finally, using numerical simulation,  the efficiency of this method is compared with the Euler and non-standard methods. Furthermore, we examined the role of initial functions in interpreting species-environment interactions and deliberated on predator-prey behaviors in various scenarios.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Eco-epidemiological model</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Convex incidence rate</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Unconditionally positivity preserving method</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Consistency</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Stability</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jmm.guilan.ac.ir/article_8896_fad2e4d7b278c7a32a3ff628e460c32d.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
