In this paper, we study some cases of a common fixed point theorem for classes of firmly nonexpansive and generalized nonexpansive maps. In addition, we establish that the Picard-Mann iteration is faster than Noor iteration and we used Noor iteration to find the solution of delay differential equation.

An analytical model in the form of a hyperbolic function has been suggested for the axial potential distribution of an electrostatic einzel lens. With the aid of this hyperbolic model the relative optical parameters have been computed and investigated in detail as a function of the electrodes voltage ratio for various trajectories of an accelerated charged-particles beam. The electrodes voltage ratio covered a wide range where the lens may be operated at accelerating and decelerating modes. The results have shown that the proposed hyperbolic field has the advantages of producing low aberrations under various magnification conditions and operational modes. The electrodes profile and their three-dimensional diagram have been determined whi

The interest in art for young ages is seen as an obvious breakthrough and as revealing of psychological and health feelings in addition to emotions, and it is a treatment for those who suffer from behavioral disorders. The problem arose with the following question: What is the role of artistic expression in diagnosing behavioral disorders for primary school pupils? The aim of the research is to detect the behavioral disorders in the artistic expression of the female students' paintings from the teachers' point of view. The descriptive analytical approach was adopted as it is the appropriate method for identifying and estimating the characteristics and features related to people, places and things, and analyzing situations or phenomena as a

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord