This paper is concerned with introducing and studying the first new approximation operators using mixed degree system and second new approximation operators using mixed degree system which are the core concept in this paper. In addition, the approximations of graphs using the operators first lower and first upper are accurate then the approximations obtained by using the operators second lower and second upper sincefirst accuracy less then second accuracy. For this reason, we study in detail the properties of second lower and second upper in this paper. Furthermore, we summarize the results for the properties of approximation operators second lower and second upper when the graph G is arbitrary, serial 1, serial 2, reflexive, symmetric, transitive, tolerance, dominance and equivalence in table.
I n this paper ,we 'viii consider the density questions associC;lted with the single hidden layer feed forward model. We proved that a FFNN with one hidden layer can uniformly approximate any continuous function in C(k)(where k is a compact set in R11 ) to any required accuracy.
However, if the set of basis function is dense then the ANN's can has al most one hidden layer. But if the set of basis function non-dense, then we need more hidden layers. Also, we have shown that there exist localized functions and that there is no t
... Show MoreThis paper deals with constructing mixed probability distribution from mixing exponential
Methods of speech recognition have been the subject of several studies over the past decade. Speech recognition has been one of the most exciting areas of the signal processing. Mixed transform is a useful tool for speech signal processing; it is developed for its abilities of improvement in feature extraction. Speech recognition includes three important stages, preprocessing, feature extraction, and classification. Recognition accuracy is so affected by the features extraction stage; therefore different models of mixed transform for feature extraction were proposed. The properties of the recorded isolated word will be 1-D, which achieve the conversion of each 1-D word into a 2-D form. The second step of the word recognizer requires, the
... Show MoreIn this paper, the Normality set will be investigated. Then, the study highlights some concepts properties and important results. In addition, it will prove that every operator with normality set has non trivial invariant subspace of .
There are many studies dealt with handoff management in mobile communication systems and some of these studies presented handoff schemes to manage this important process in cellular network. All previous schemes used relative signal strength (RSS) measurements. In this work, a new proposed handoff scheme had been presented depending not only on the RSS measurements but also used the threshold distance and neighboring BSS power margins in order to improve the handoff management process. We submitted here a threshold RSS as a condition to make a handoff when a mobile station moves from one cell to another this at first, then we submitted also a specified margin between the current received signal and the ongoing BS's received signal must be s
... Show MoreNeutron differential-elastic and inelastic scattering cross-sections of Yttrium-89 isotope were calculated at energies 8,10,12,14, and 17 MeV, at angles distributed between 20o and 180o in the center of mass frame. The obtained results data were interpreted using a spherical optical potential model and Eikonal approximation, to examine the effect of the first-order Eikonal correction on the effective potential. The real and imaginary parts of optical potential were calculated. It was found that the nominal imaginary potential increase monotonically while the effective imaginary one has a pronounced minimum around r = 6fm and then increases. The analysis of the relative energy of the projectile and reaction
... Show MoreA graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex. For a simple undirected graph G with order n, and let denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C
... Show MoreObject detection in real time is considered as a challenging problem. However, it is very important in a wide range of applications, especially in field of multimedia. The players and ball are the most important objects in soccer game videos and detecting them is a challenging task because of many difficulties, such as shadow and illumination, ball size, ball occluded by players or merged with lines, and similar appearance of players. To overcome these problems, we present a new system to detect the players and ball in real-time by using background subtraction and Sobel detection. The results were more accurate and approximately two times faster than those using only background subtraction.
The goal of this study is to provide a new explicit iterative process method approach for solving maximal monotone(M.M )operators in Hilbert spaces utilizing a finite family of different types of mappings as( nonexpansive mappings,resolvent mappings and projection mappings. The findings given in this research strengthen and extend key previous findings in the literature. Then, utilizing various structural conditions in Hilbert space and variational inequality problems, we examine the strong convergence to nearest point projection for these explicit iterative process methods Under the presence of two important conditions for convergence, namely closure and convexity. The findings reported in this research strengthen and extend
... Show More