Both the double-differenced and zero-differenced GNSS positioning strategies have been widely used by the geodesists for different geodetic applications which are demanded for reliable and precise positions. A closer inspection of the requirements of these two GNSS positioning techniques, the zero-differenced positioning, which is known as Precise Point Positioning (PPP), has gained a special importance due to three main reasons. Firstly, the effective applications of PPP for geodetic purposes and precise applications depend entirely on the availability of the precise satellite products which consist of precise satellite orbital elements, precise satellite clock corrections, and Earth orientation parameters. Secondly, th

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

     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.

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

     Evolutionary 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

The COVID-19 pandemic has had a huge influence on human lives all around the world. The virus spread quickly and impacted millions of individuals, resulting in a large number of hospitalizations and fatalities. The pandemic has also impacted economics, education, and social connections, among other aspects of life. Coronavirus-generated Computed Tomography (CT) scans have Regions of Interest (ROIs). The use of a modified U-Net model structure to categorize the region of interest at the pixel level is a promising strategy that may increase the accuracy of detecting COVID-19-associated anomalies in CT images. The suggested method seeks to detect and isolate ROIs in CT scans that show the existence of ground-glass opacity, which is fre

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt