This paper considers a new Double Integral transform called Double Sumudu-Elzaki transform DSET. The combining of the DSET with a semi-analytical method, namely the variational iteration method DSETVIM, to arrive numerical solution of nonlinear PDEs of Fractional Order derivatives. The proposed dual method property decreases the number of calculations required, so combining these two methods leads to calculating the solution's speed. The suggested technique is tested on four problems. The results demonstrated that solving these types of equations using the DSETVIM was more advantageous and efficient

This paper generalizes and improves the results of Margenstren, by proving that the number of -practical numbers  which is defined by   has a lower bound in terms of . This bound is more sharper than Mangenstern bound when  Further general results are given for the existence of -practical numbers, by proving that the interval contains a -practical for all

      Some cases of common fixed point theory for classes of generalized nonexpansive maps are studied. Also, we show that the Picard-Mann scheme can be employed to approximate the unique solution of a mixed-type Volterra-Fredholm functional nonlinear integral equation.

     In this paper,there are   new considerations about the dual of a modular spaces and weak convergence. Two common fixed point theorems for a -non-expansive mapping defined on a star-shaped weakly compact subset are proved,  Here the conditions of affineness, demi-closedness and Opial's property play an active role in the proving our results.

The aim of this article, we define new iterative methods called three-step type in which Jungck resolvent CR-iteration and resolvent Jungck SP-iteration are discussed and study rate convergence and strong convergence in Banach space to reach the fixed point which is differentially solve of nonlinear equations. The studies also expanded around it to find the best solution for nonlinear operator equations in addition to the varying inequalities in Hilbert spaces and Banach spaces, as well as the use of these iterative methods to approximate the difference between algorithms and their images, where we examined the necessary conditions that guarantee the unity and existence of the solid point. Finally, the results show that resolvent CR-iter

                 In this paper, we proved coincidence points theorems for two pairs mappings which are defined on nonempty subset   in metric spaces by using condition (1.1). As application, we established a unique common fixed points theorems for these mappings by using the concept weakly compatible (R-weakly commuting) between these mappings.

   In this paper we prove a theorem about the existence and uniqueness common fixed point for two uncommenting self-mappings which defined on orbitally complete G-metric space. Where we use a general contraction condition.
 

The first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o

The first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o