What has reached us from this great heritage left by our scientists book ((masterpiece of honor by knowing the parties)) to the conservative privilege, which Imam Safadi said ((Sheikh of time, and the preservation of the era, and critic of the time, if his son Ibn Makola had a drink and eaten, and make it to him So, after trusting in God, I thought that I should write a paper highlighting the life of this great world and explaining its methodology in this useful book in which Imam Ibn Hajar al-Asqalani said: `` The use of it took place east and west, and the scholars competed in collecting it after. And soon)).

A simple reverse-phase high performance liquid chromatographic method for the simultaneous analysis (separation and quantification) of furosemide (FURO), carbamazepine (CARB), diazepam (DIAZ) and carvedilol (CARV) has been developed and validated. The method was carried out on a NUCLEODUR® 100-5 C18ec column (250 x 4.6 mm, i. d.5μm), with a mobile phase comprising of acetonitrile: deionized water (50: 50 v/v, pH adjusted to 3.6 ±0.05 with acetic acid) at a flow rate 1.5 mL.min-1 and the quantification was achieved at 226 nm. The retention times of FURO, CARB, DIAZ and CARV were found to be 1.90 min, 2.79 min, 5.39 min and 9.56 min respectively. The method was validated in terms of linearity, accuracy, precision, limit of detection and li

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.

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.