This paper is concerned with introducing and studying the M-space by using the mixed degree systems which are the core concept in this paper. The necessary and sufficient condition for the equivalence of two reflexive M-spaces is super imposed. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are introduced. From an M-space, a unique supratopological space is introduced. Furthermore, the m-continuous (m-open and m-closed) functions are defined and the fundamental theorem of the m-continuity is provided. Finally, the m-homeomorphism is defined and some of its properties are investigated.

In the partition theory, there is more then one form of representation of dedication, most notably the Abacus diagram, which gives an accurate and specific description. In the year 2019, Mahmood and Mahmood presented the idea of merging more than two plans, and then the following question was raised: Is the process of separating any somewhat large diagram into smaller schemes possible? The general formula to split e-abacus diagram into two or more equal or unequal parts was achieved in this study now.

The recent developments in information technology have made major changes in all fields. The transfer of information through networks has become irreplaceable due to its advantages in facilitating the requirements of modern life through developing methods of storing and distributing information. This in turn has led to an increase in information problems and risks that threaten the security of the institution’s information and can be used in distributed systems environment.

This study focused on two parts; the first is to review the most important applications of the graph theory in the field of network security, and the second is focused on the possibility of using the Euler graph as a Method Object that is employed in Re

This study aims at discussing the theoretical and applicable parts of the reading comprehension to help the teachers of Arabic. This study shows that the students have a general weakness in reading comprehension. The researcher handles issues related to reading comprehension and to practicing exercises of the training strategies such as: dialogue, discussion, discussion questions, continuous training, group works. Such skills will be used to analyze a poem to see the level of the students’ reading comprehension and to develop the students’ skills. The study answers two questions:
1- What is the reading comprehension from a theoretical perspective?
2- How can we develop the skills of the reading comprehension from the practical

The dependence of the energy losses or the stopping power for the ion contribution in D- T hot plasma fuels upon the corresponding energies and the related penetrating factorare arrive by using by a theoretical approximation models. In this work we reach a compatible agreement between our results and the corresponding experimental results.

The regressor-based adaptive control is useful for controlling robotic systems with uncertain parameters but with known structure of robot dynamics. Unmodeled dynamics could lead to instability problems unless modification of control law is used. In addition, exact calculation of regressor for robots with more than 6 degrees of freedom is hard to be calculated, and the task could be more complex for robots. Whereas the adaptive approximation control is a powerful tool for controlling robotic systems with unmodeled dynamics. The local (partitioned) approximation-based adaptive control includes representation of the uncertain matrices and vectors in the robot model as finite combinations of basis functions. Update laws for the weighting matri

The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).

     The first step in this research is to find some of the necessary estimations in approximation by using certain algebraic polynomials, as well as we use certain specific points in approximation. There are many estimations that help to find the best approximation using algebraic polynomials and geometric polynomials. Throughout this research, we deal with some of these estimations to estimate the best approximation error using algebraic polynomials where the basic estimations in approximation are discussed and proven using algebraic polynomials that are discussed and proven using algebraic polynomials that are specified by the following points and  if   as well as if   .

  For the second step of the work, the estimatio