The issue of the research lies in the non-representation of the models developed for the communication process in the interaction and networking processes through social media, as the research sought to build a network model of communication according to the specific data and features of social media platforms in order to reach a special generalization to understand how the process of networking operates in cyberspace.

The researcher followed the analytical survey approach as she described the communication models outwardly in order to be able to build a networked communication model that represents the flow of post-reactive communication. Therefore, it has been named "Nebula - Sadeem" after the concept of post-space and cosmic g

This paper presents an analytical study for the magnetohydrodynamic (MHD) flow of a generalized Burgers’ fluid in an annular pipe. Closed from solutions for velocity is obtained by using finite Hankel transform and discrete Laplace transform of the sequential fractional derivatives. Finally, the figures are plotted to show the effects of different parameters on the velocity profile.

A vector in a separable infinite dimensional Hilbert space is called disk-cyclic for bounded operator if the orbit α : 0, α∈;|∝| 1is dense in. The useful tool used to discover codisk-cyclic operation is called the disk-cyclic Criterion. In this paper we will show that some equivalent conditions of the

The present study aimed to identify teaching problems which facing the teachers for first three grades classes, and if these problems different according to some variables teacher qualification, experience period, class grade). The study sample consist of (137 )

 female teachers who teach the first three grades in Braimy city in Oman, teachers spread in five government schools. Both researchers developed questionnaire to measure problems faced by the mentioned teachers, consist of 50 questions distributed into 4 dimensions (teacher, students, the curriculum, the evaluations), Also researchers checked questionnaire validity and stability. The results indicate to: The most common probl

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.

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 work, a novel technique to obtain an accurate solutions to nonlinear form by multi-step combination with Laplace-variational approach (MSLVIM) is introduced. Compared with the  traditional approach for variational it overcome all difficulties and enable to provide us more an accurate solutions with extended of the convergence region as well as covering to larger intervals which providing us a continuous representation of approximate analytic solution and it give more better information of the solution over the whole time interval. This technique is more easier for obtaining the general Lagrange multiplier with reduces the time and calculations. It converges rapidly to exact formula with simply computable terms wit