The major climate changes that have affected the planet in addition to wave the big drought plaguing the study area, including the lack of water for imports Badra River fatigue because of the Iran constructing dams on this river and make use of the waters for the benefitof its territory. The subject of finding sources of water has become available with the possibility of exploiting them in an exemplary manner is one of the key things in order to be exploited somewhere.
The study area was chosen within the eastern border of the province of Wasit within the district of Badra border, an area of (1557.5 km2) almost "to study the characteristics of hydrological and identify possibilities for water harvesting them. In this study was conduct

Let G be a finite group, the result is the involution graph of G, which is an undirected simple graph denoted by the group G as the vertex set and x, y ∈ G adjacent if xy and (xy)2 = 1. In this article, we investigate certain properties of G, the Leech lattice groups HS and McL. The study involves calculating the diameter, the radius, and the girth of ΓGRI.

Suppose that  is a finite group and  is a non-empty subset of  such that  and . Suppose that  is the Cayley graph whose vertices are all elements of  and two vertices  and  are adjacent if and only if . In this paper, we introduce the generalized Cayley graph denoted by  that  is a graph with vertex set consists of all column matrices  which all components are in  and two vertices  and  are adjacent if and only if , where  is a column matrix that each entry is the inverse of similar entry of  and  is  matrix with all entries in  ,  is the transpose of  and . In this paper, we clarify some basic properties of the new graph and assign the structure of  when  is complete graph , complete bipartite graph  and complete

The images and drawings reduce the intellectual, symbolic and cognitive dimensions inside them that make them an intermediary that imposes itself on the educational method, as they have become responsive to all the needs of the student in the modern era unlike the previous periods. The artistic direction of the illustrations in the scientific books meets the educational and pedagogical needs of the learner and their frame in an illustrative educational method that contributes in developing the student's abilities to benefit from the scientific curricula in the age of scientific and cognitive development.

Here, the researcher finds that the artistic direction of the illustrations lacks the achievement of scientific and technical p

Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f

 Researchers have increased interest in recent years in determining the optimum sample size to obtain sufficient accuracy and estimation and to obtain high-precision parameters in order to evaluate a large number of tests in the field of diagnosis at the same time. In this research, two methods were used to determine the optimum sample size to estimate the parameters of high-dimensional data. These methods are the Bennett inequality method and the regression method. The nonlinear logistic regression model is estimated by the size of each sampling method in high-dimensional data using artificial intelligence, which is the method of artificial neural network (ANN) as it gives a high-precision estimate commensurate with the dat

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.