Most of the known cases of strong gravitational lensing involve multiple imaging of an active galactic nucleus. The properties of lensed active galactic nuclei make them promising systems for astrophysical applications of gravitational lensing. So we present a simple model for strong lensing in the gravitational lensed systems to calculate the age of four lensed galaxies, in the present work we take the freedman models with (k curvature index =0) Euclidian case, and the result show a good agreement with the other models.

Magnetosphere is a region of space surrounding Earth magnetic field, the formation of magnetosphere depends on many parameters such as; surface magnetic field of the planet, an ionized plasma stream (solar wind) and the ionization of the planetary upper atmosphere (ionosphere). The main objective of this research is to find the behavior of Earth's magnetosphere radius (R_mp) with respect to the effect of solar wind kinetic energy density (Usw), Earth surface magnetic field (B_o), and the electron density (N_e) of Earth's ionosphere for three years 2016, 2017 and 2018. Also the study provides the effect of solar activity for the same period during strong geomagnetic storms on the behavior of R_mp. F

Two- dimensional numerical simulations are carried out to study the elements of observing a Dirac point source and a Dirac binary system. The essential features of this simulation are demonstrated in terms of the point spread function and the modulation transfer function. Two mathematical equations have been extracted to present, firstly the relationship between the radius of optical telescope and the distance between the central frequency and cut-off frequency of the optical telescope, secondly the relationship between the radius of the optical telescope and the average frequency components of the modulation transfer function.

In today's world, the science of bioinformatics is developing rapidly, especially with regard to the analysis and study of biological networks. Scientists have used various nature-inspired algorithms to find protein complexes in protein-protein interaction (PPI) networks. These networks help scientists guess the molecular function of unknown proteins and show how cells work regularly. It is very common in PPI networks for a protein to participate in multiple functions and belong to many complexes, and as a result, complexes may overlap in the PPI networks. However, developing an efficient and reliable method to address the problem of detecting overlapping protein complexes remains a challenge since it is considered a complex and har

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

Key-frame selection plays an important role in facial expression recognition systems. It helps in selecting the most representative frames that capture the different poses of the face. The effect of the number of selected keyframes has been studied in this paper to find its impact on the final accuracy of the emotion recognition system. Dynamic and static information is employed to select the most effective key-frames of the facial video with a short response time. Firstly, the absolute difference between the successive frames is used to reduce the number of frames and select the candidate ones which then contribute to the clustering process. The static-based information of the reduced sets of frames is then given to the fuzzy C-Means algor