The current research aims at knowing the impact of the mind-clearing method in teaching second year intermediate students “reading book”. To achieve the study objective, the researchers intentionally chose Arjwan middle school, located in Baghdad Directorate of Education Al-Rusafa/2, which includes five classes for the second intermediate class. Division (A) was chosen randomly to represent the experimental group, which is taught in the mind-clearing method, while Division (B) represented the control group, which is taught in the traditional way. The sample of the research included (79) female students divided into (39) students in the experimental group, and (40) female students in the control group.To achieve the objective of the res

This study is dedicated to solving multicollinearity problem for the general linear model by using Ridge regression method. The basic formulation of this method and suggested forms for Ridge parameter is applied to the Gross Domestic Product data in Iraq. This data has normal distribution. The best linear regression model is obtained after solving multicollinearity problem with the suggesting of 10 k value.

       In this work, the fractional damped Burger's equation (FDBE) formula    = 0,

This paper presents a linear fractional programming problem (LFPP) with rough interval coefficients (RICs) in the objective function. It shows that the LFPP with RICs in the objective function can be converted into a linear programming problem (LPP) with RICs by using the variable transformations. To solve this problem, we will make two LPP with interval coefficients (ICs). Next, those four LPPs can be constructed under these assumptions; the LPPs can be solved by the classical simplex method and used with MS Excel Solver. There is also argumentation about solving this type of linear fractional optimization programming problem. The derived theory can be applied to several numerical examples with its details, but we show only two examples

While analytical solutions to Quadratic Assignment Problems (QAP) have indeed been since a long time, the expanding use of Evolutionary Algorithms (EAs) for similar issues gives a framework for dealing with QAP with an extraordinarily broad scope. The study's key contribution is that it normalizes all of the criteria into a single scale, regardless of their measurement systems or the requirements of minimum or maximum, relieving the researchers of the exhaustively quantifying the quality criteria. A tabu search algorithm for quadratic assignment problems (TSQAP) is proposed, which combines the limitations of tabu search with a discrete assignment problem. The effectiveness of the proposed technique has been compared to well-established a

An efficient combination of Adomian Decomposition iterative technique coupled with Laplace transformation to solve non-linear Random Integro differential equation (NRIDE) is introduced in a novel way to get an accurate analytical solution. This technique is an elegant combination of theLaplace transform, and the Adomian polynomial. The suggested method will convert differential equations into iterative algebraic equations, thus reducing processing and analytical work. The technique solves the problem of calculating the Adomian polynomials. The method’s efficiency was investigated using some numerical instances, and the findings demonstrate that it is easier to use than many other numerical procedures. It has also been established that (LT

The techniques of fractional calculus are applied successfully in many branches of science and engineering, one of the techniques is the Elzaki Adomian decomposition method (EADM), which researchers did not study with the fractional derivative of Caputo Fabrizio. This work aims to study the Elzaki Adomian decomposition method (EADM) to solve fractional differential equations with the Caputo-Fabrizio derivative. We presented the algorithm of this method with the CF operator and discussed its convergence by using the method of the Cauchy series then, the method has applied to solve Burger, heat-like, and, couped Burger equations with the Caputo -Fabrizio operator. To conclude the method was convergent and effective for solving this type of

  In this work, we construct projectively distinct (k,3)-arcs in the projective plane PG(2,9) by applying a geometrical method. The cubic curves have been been constructed by using the general equation of the cubic.         We found that there are complete (13,3)-arcs, complete (15,3)-arcs and we found that the only (16,3)-arcs lead to maximum completeness