This paper is concerned with a Coupled Reaction-diffusion system defined in a ball with homogeneous Dirichlet boundary conditions. Firstly, we studied the blow-up set showing that, under some conditions, the blow-up in this problem occurs only at a single point. Secondly, under some restricted assumptions on the reaction terms, we established the upper (lower) blow-up rate estimates. Finally, we considered the Ignition system in general dimensional space as an application to our results.

The aim of this research is to prove the idea of maximum m_X-N-open set, m-N-extremally disconnected with respect to t and provide some definitions by utilizing the idea of m_X-N-open sets. Some properties of these sets are studied.

            This work, introduces some concepts in bitopological spaces, which are nm-j-ω-converges to a subset, nm-j-ω-directed toward a set, nm-j-ω-closed mappings, nm-j-ω-rigid set, and nm-j-ω-continuous mappings. The mainline idea in this paper is nm-j-ω-perfect mappings in bitopological spaces such that n = 1,2  and m =1,2 n ≠ m. Characterizations concerning these concepts and several theorems are studied, where j = q , δ, a , pre, b, b.

       In this paper, the classical continuous triple optimal control problem (CCTOCP) for the triple nonlinear parabolic boundary value problem (TNLPBVP) with state vector constraints (SVCs) is studied.  The solvability theorem for the classical continuous triple optimal control vector CCTOCV with the SVCs is stated and proved. This is done under suitable conditions. The mathematical formulation of the adjoint triple boundary value problem (ATHBVP) associated with TNLPBVP is discovered. The Fréchet derivative of the Hamiltonian" is derived.  Under suitable conditions, theorems of necessary  and sufficient conditions for the optimality of the TNLPBVP with the SVCs are stated and proved.    

    Cloud computing is a pay-as-you-go model that provides users with on-demand access to services or computing resources. It is a challenging issue to maximize the service provider's profit and, on the other hand, meet the Quality of Service (QoS) requirements of users. Therefore, this paper proposes an admission control heuristic (ACH) approach that selects or rejects the requests based on budget, deadline, and penalty cost, i.e., those given by the user. Then a service level agreement (SLA) is created for each selected request. The proposed work uses Particle Swarm Optimization (PSO) and the Salp Swarm Algorithm (SSA) to schedule the selected requests under budget and deadline constraints. Performances of PSO and SSA with and witho

     The current issues in spam email detection systems are directly related to spam email classification's low accuracy and feature selection's high dimensionality. However, in machine learning (ML), feature selection (FS) as a global optimization strategy reduces data redundancy and produces a collection of precise and acceptable outcomes. A black hole algorithm-based FS algorithm is suggested in this paper for reducing the dimensionality of features and improving the accuracy of spam email classification. Each star's features are represented in binary form, with the features being transformed to binary using a sigmoid function. The proposed Binary Black Hole Algorithm (BBH) searches the feature space for the best feature subsets,

   Nonlinear regression models are important tools for solving optimization problems. As traditional techniques would fail to reach satisfactory solutions for the parameter estimation problem.  Hence, in this paper, the BAT algorithm  to estimate the parameters of  Nonlinear Regression models is used . The simulation study is considered to investigate the performance of the proposed algorithm with the maximum likelihood (MLE) and Least square (LS) methods. The results show that the Bat algorithm provides accurate estimation and it is satisfactory for the parameter estimation of the nonlinear regression models than MLE and LS methods depend on Mean Square error.

In this study, He's parallel numerical algorithm by neural network is applied to type of integration of fractional equations is Abel’s integral equations of the 1^st and 2^nd kinds. Using a Levenberge – Marquaradt training algorithm as a tool to train the network. To show the efficiency of the method, some type of Abel’s integral equations is solved as numerical examples. Numerical results show that the new method is very efficient problems with high accuracy.

Currently, the prominence of automatic multi document summarization task belongs to the information rapid increasing on the Internet. Automatic document summarization technology is progressing and may offer a solution to the problem of information overload. 

Automatic text summarization system has the challenge of producing a high quality summary. In this study, the design of generic text summarization model based on sentence extraction has been redirected into a more semantic measure reflecting individually the two significant objectives: content coverage and diversity when generating summaries from multiple documents as an explicit optimization model. The proposed two models have been then coupled and def

An automatic text summarization system mimics how humans summarize by picking the most ‎significant sentences in a source text. However, the complexities of the Arabic language have become ‎challenging to obtain information quickly and effectively. The main disadvantage of the ‎traditional approaches is that they are strictly constrained (especially for the Arabic language) by the ‎accuracy of sentence feature ‎functions, weighting schemes, ‎and similarity calculations. On the other hand, the meta-heuristic search approaches have a feature tha