The equation of Kepler is used to solve different problems associated with celestial mechanics and the dynamics of the orbit. It is an exact explanation for the movement of any two bodies in space under the effect of gravity. This equation represents the body in space in terms of polar coordinates; thus, it can also specify the time required for the body to complete its period along the orbit around another body. This paper is a review for previously published papers related to solve Kepler’s equation and eccentric anomaly. It aims to collect and assess changed iterative initial values for eccentric anomaly for forty previous years. Those initial values are tested to select the finest one based on the number of iterations, as well as the run time for each starting initial value that is required for completing the solution. The method of Newton–Raphson is employed to acquire a final value for an eccentric anomaly; this method considers a typical method for a solution with less divergence as compared with an ideal solution, and the best initial value is chosen. The applicable selection of the initial value of the eccentric anomaly will decrease the calculation time and confirm the convergence of the curves of the eccentric anomaly with ideal curves.
In recent years, the migration of the computational workload to computational clouds has attracted intruders to target and exploit cloud networks internally and externally. The investigation of such hazardous network attacks in the cloud network requires comprehensive network forensics methods (NFM) to identify the source of the attack. However, cloud computing lacks NFM to identify the network attacks that affect various cloud resources by disseminating through cloud networks. In this paper, the study is motivated by the need to find the applicability of current (C-NFMs) for cloud networks of the cloud computing. The applicability is evaluated based on strengths, weaknesses, opportunities, and threats (SWOT) to outlook the cloud network. T
... Show MoreThe 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
... Show MoreAn 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
... Show MoreIn 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.
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
... Show MoreEvolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust E
... Show More