Numerical simulation of charge density produced in plasma actuators is dependent upon the development of models dealing with electrical properties. The main aim of this work is to investigate the characteristics surface charge density and space charge density of DBD plasma actuator. A simple design of surface dielectric barrier discharge plasma actuator is used in the study. The discharge gas was N2:H2 mixture with applied voltage equal to 1.5 kV. A theoretical plasma model is used to establish the charge density details. Results show that surface charge density increased in value and spread in width alone the exposed electrode as the voltage increased and reached to the amplitude value.

   This paper concerns is the preparation and characterization of a bidentate ligand [4-(5,5dimethyl-3-oxocyclohex-1-enylamino)-N-(5-methylisoxazol-3-yl) benzene sulfonamide].  The ligand was prepared from fusing of sulfamethoxazole and dimedone at (140) ºC for half hour.              The complex was prepared by refluxing the ligand with a bivalent cobalt ion using ethanol as a solvent. The prepared ligand and complex were identified using Spectroscopic methods. The proposed tetrahedral geometry around the metal ions studied were concluded from these measurements. Both molar ratio and continuous variation method were studied to determine metal to ligand ratio (M:L). The M to L ratio wa

The present study utilised date palm fibre (DPF) waste residues to adsorb Congo red (CR) dye from aqueous solutions. The features of the adsorbent, such as its surface shape, pore size, and chemical properties, were assessed with X-ray diffraction (XRD), BET, Fourier-transform infrared (FTIR), X-ray fluorescence (XRF), and field emission scanning electron microscope (FESEM). The current study employed the batch system to investigate the ideal pH to adsorb the CR dye and found that acidic pH decolourised the dye best. Extending the dye-DPF waste mixing period at 25°C reportedly removed more dye. Consequently, the influence of the starting dye and DPF waste quantity on dye removal was explored in this study. At 5 g/L dye concentration, 48% d

Circular data (circular sightings) are periodic data and are measured on the unit's circle by radian or grades. They are fundamentally different from those linear data compatible with the mathematical representation of the usual linear regression model due to their cyclical nature. Circular data originate in a wide variety of fields of scientific, medical, economic and social life. One of the most important statistical methods that represents this data, and there are several methods of estimating angular regression, including teachers and non-educationalists, so the letter included the use of three models of angular regression, two of which are teaching models and one of which is a model of educators. ) (DM) (MLE) and circular shrinkage mod

Researchers are increasingly using multimodal biometrics to strengthen the security of biometric applications. In this study, a strong multimodal human identification model was developed to address the growing problem of spoofing attacks in biometric security systems. Through the use of metaheuristic optimization methods, such as the Genetic Algorithm(GA), Ant Colony Optimization(ACO), and Particle Swarm Optimization (PSO) for feature selection, this unique model incorporates three biometric modalities: face, iris, and fingerprint. Image pre-processing, feature extraction, critical image feature selection, and multibiometric recognition are the four main steps in the workflow of the system. To determine its performance, the model wa

Among a variety of approaches introduced in the literature to establish duality theory, Fenchel duality was of great importance in convex analysis and optimization. In this paper we establish some conditions to obtain classical strong Fenchel duality for evenly convex optimization problems defined in infinite dimensional spaces. The objective function of the primal problem is a family of (possible) infinite even convex functions. The strong duality conditions we present are based on the consideration of the epigraphs of the c-conjugate of the dual objective functions and the ε-c-subdifferential of the primal objective functions.

The purpose of this paper is to solve the stochastic demand for the unbalanced transport problem using heuristic algorithms to obtain the optimum solution, by minimizing the costs of transporting the gasoline product for the Oil Products Distribution Company of the Iraqi Ministry of Oil. The most important conclusions that were reached are the results prove the possibility of solving the random transportation problem when the demand is uncertain by the stochastic programming model. The most obvious finding to emerge from this work is that the genetic algorithm was able to address the problems of unbalanced transport, And the possibility of applying the model approved by the oil products distribution company in the Iraqi Ministry of Oil to m

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

A network (or formally a graph) can be described by a set of nodes and a set of edges connecting these nodes. Networks model many real-world phenomena in various research domains, such as biology, engineering and sociology. Community mining is discovering the groups in a network where individuals group of membership are not explicitly given. Detecting natural divisions in such complex networks is proved to be extremely NP-hard problem that recently enjoyed a considerable interest. Among the proposed methods, the field of evolutionary algorithms (EAs) takes a remarkable interest. To this end, the aim of this paper is to present the general statement of community detection problem in social networks. Then, it visits the problem as an optim