في إطار نموذج القشرة، تم اعتماد الدوال الموجية أحادية الجسيم لتقريب هاتري - فوك مع تفاعلات سكيرم  مثل Skxtb, Skxs25, , Sly4وBsk9 لحساب سمك القشرة النيوتروني، ونصف قطر المرآتي ونصف قطر الشحنة المرآتية ، لزوج النوى المرآتية 18Ne-18O. تم حساب الدوال الموجية باستخدام كود نموذج القشرة NuShellX@MSU. تتأثر القيم المحسوبة لجذر متوسط ​نصف القطر المربع بنوع التفاعلات المستخدمة. كما تم تحديد طاقة التناظر وانحدارها عند كثافة التشبع الن

Within the framework of the shell model, the single-particle wave functions of Hartree-Fock approximation adopted with Skyrme interactions like kxtb, Skxs25, Sly4 and Bsk9 to get the thickness of the neutron skin, the mirror radii and the charges mirror radii for 18Ne-18O pair mirror nucleus. The wave functions were calculated using the NuShellX@MSU shell model code. The computed values of root-mean-square-radii are inuenced by the type of interaction employed. The symmetry energy and its slope at nuclear saturation density and the mirror energy displacement were also determined. Comparisons between theoretical and experimental data were made and it was concluded that the data are well described in of this pair mirror nucleus

This research had been achieved to identify the image of the subsurface structure representing the Tertiary period in the Galabat Field northeast of Iraq using 2D seismic survey measurements. Synthetic seismograms of the Galabat-3 well were generated in order to identify and pick the reflectors in seismic sections. Structural Images were drawn in the time domain and then converted to the depth domain by using average velocities. Structurally, seismic sections illustrate these reflectors are affected by two reverse faults affected on the Jeribe Formation and the layers below with the increase in the density of the reverse faults in the northern division. The structural maps show Galabat field, which consists of longitudinal Asymmetrical narr

In this paper,the homtopy perturbation method (HPM) was applied to obtain the approximate solutions of the fractional order integro-differential equations . The fractional order derivatives and fractional order integral are described in the Caputo and Riemann-Liouville sense respectively. We can easily obtain the solution from convergent the infinite series of HPM . A theorem for convergence and error estimates of the HPM for solving fractional order integro-differential equations was given. Moreover, numerical results show that our theoretical analysis are accurate and the HPM can be considered as a powerful method for solving fractional order integro-diffrential equations.

In this paper we use Bernstein polynomials for deriving the modified Simpson's 3/8 , and the composite modified Simpson's 3/8 to solve one dimensional linear Volterra integral equations of the second kind , and we find that the solution computed by this procedure is very close to exact solution.

This study presents a practical method for solving fractional order delay variational problems. The fractional derivative is given in the Caputo sense. The suggested approach is based on the Laplace transform and the shifted Legendre polynomials by approximating the candidate function by the shifted Legendre series with unknown coefficients yet to be determined. The proposed method converts the fractional order delay variational problem into a set of (n ＋ 1) algebraic equations, where the solution to the resultant equation provides us the unknown coefficients of the terminated series that have been utilized to approximate the solution to the considered variational problem. Illustrative examples are given to show that the recommended appro

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.