The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.

This research is considered one of the important researches in Maysan Governorate, as it focuses on the construction of helicopter airport project in the oil fields of the Maysan Oil Company, where the oil general companies in Maysan Governorate suffer from the cost of transporting the foreign engineering experts and the governing equipment of sustaining oil industry from Iraq's international airports to oil fields and vice versa. Private international transport companies transport foreign engineering from the oil fields to Iraqi airports and vice versa, and other international security companies take action to provide protection for foreign engineering experts during transportation. Hence, this process is very costly.

 &nbs

In this paper, the proposed phase fitted and amplification fitted of the Runge-Kutta-Fehlberg method were derived on the basis of existing method of 4(5) order to solve ordinary differential equations with oscillatory solutions. The recent method has null phase-lag and zero dissipation properties. The phase-lag or dispersion error is the angle between the real solution and the approximate solution. While the dissipation is the distance of the numerical solution from the basic periodic solution. Many of problems are tested over a long interval, and the numerical results have shown that the present method is more precise than the 4(5) Runge-Kutta-Fehlberg method.

In this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .

Interval methods for verified integration of initial value problems (IVPs) for ODEs have been used for more than 40 years. For many classes of IVPs, these methods have the ability to compute guaranteed error bounds for the flow of an ODE, where traditional methods provide only approximations to a solution. Overestimation, however, is a potential drawback of verified methods. For some problems, the computed error bounds become overly pessimistic, or integration even breaks down. The dependency problem and the wrapping effect are particular sources of overestimations in interval computations. Berz (see [1]) and his co-workers have developed Taylor model methods, which extend interval arithmetic with symbolic computations. The latter is an ef

Our country faced lots of crises specially Wars and still living under the traumatic events. This would result in psychological disorder specially the Acute Stress Disorder (ASD). That’s if not treated, it will turn to be over Post Traumatic Stress Disorder(PTSD). Also not mentioning the shortage of recourses speaks about war and crises. That treat with its inflections psychologically and sociologically theses cases if happened.

The importance of this study arise through it is objective to introduce a program for EMDR which give benefit for treat in health, social, educational institutes.

Aims:

The objective of this Study is the identification of a Test the effectiveness of Eye Movement Desensi