Mining association rules is a popular and well-studied method of data mining tasks whose primary aim is the discovers of the correlation among sets of items in the transactional databases. However, generating high- quality association rules in a reasonable time from a given database has been considered as an important and challenging problem, especially with the fast increasing in database's size. Many algorithms for association rules mining have been already proposed with promosing results. In this paper, a new association rules mining algorithm based on Bees Swarm Optimization metaheuristic named Modified Bees Swarm Optimization for Association Rules Mining (MBSO-ARM) algorithm is proposed. Results show that the proposed algorithm can

The aim of our study is to solve a nonlinear epidemic model, which is the COVID-19 epidemic model in Iraq, through the application of initial value problems in the current study. The model has been presented as a system of ordinary differential equations that has parameters that change with time. Two numerical simulation methods are proposed to solve this model as suitable methods for solving systems whose coefficients change over time. These methods are the Mean Monte Carlo Runge-Kutta method (MMC_RK) and the Mean Latin Hypercube Runge-Kutta method (MLH_RK). The results of numerical simulation methods are compared with the results of the numerical Runge-Kutta 4th order method (RK4) from 2021 to 2025 using the absolute error, which prove

Many oil and gas processes, including oil recovery, oil transportation, and petroleum processing, are negatively impacted by the precipitation and deposition of asphaltene. Screening methods for determining the stability of asphaltenes in crude oil have been developed due to the high cost of remediating asphaltene deposition in crude oil production and processing. The colloidal instability index, the Asphaltene-resin ratio, the De Boer plot, and the modified colloidal instability index were used to predict the stability of asphaltene in crude oil in this study. The screening approaches were investigated in detail, as done for the experimental results obtained from them. The factors regulating the asphaltene precipitation are different fr

This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF)

A political perusal of Initiations in Declaring Middle East a District vacant of mass Destruction weapons

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

In this study, genetic algorithm was used to predict the reaction kinetics of Iraqi heavy naphtha catalytic reforming process located in Al-Doura refinery in Baghdad.  One-dimensional steady state model was derived to describe commercial catalytic reforming unit consisting of four catalytic reforming reactors in series process.

The experimental information (Reformate composition and output temperature) for each four reactors collected at different operating conditions was used to predict the parameters of the proposed kinetic model. The kinetic model involving 24 components, 1 to 11 carbon atoms for paraffins and 6 to 11 carbon atom for naphthenes and aromatics with 71 reactions. The pre-exponential Arrhenius constants and a

This work deals with the production of light fuel cuts of (gasoline, kerosene and gas oil) by catalytic cracking treatment of secondary product mater (heavy vacuum gas oil) which was produced from the vacuum distillation unit in any petroleum refinery. The objective of this research was to study the effect of the catalyst -to- oil ratio parameter on catalytic cracking process of heavy vacuum gas oil feed at constant temperature (450 °C). The first step of this treatment was, catalytic cracking of this material by constructed batch reactor occupied with auxiliary control devices, at selective range of the catalyst –to- oil ratio parameter (  2, 2.5, 3 and 3.5) respectively.  The conversion of heavy vacuum gas