The majority of real-world problems involve not only finding the optimal solution, but also this solution must satisfy one or more constraints. Differential evolution (DE) algorithm with constraints handling has been proposed to solve one of the most fundamental problems in cellular network design. This proposed method has been applied to solve the radio network planning (RNP) in the forthcoming 5G Long Term Evolution (5G LTE) wireless cellular network, that satisfies both deployment cost and energy savings by reducing the number of deployed micro base stations (BSs) in an area of interest. Practically, this has been implemented using constrained strategy that must guarantee good coverage for the users as well. Three differential evolution

The almighty Al-Bari imposed on Muslims easy and accessible worshipers for every individual who is eligible to commission, so whoever performed it rightfully, God rewarded it with the best reward. From the Muslim, the Almighty made the Almighty to the types of acts of worship and acts of righteousness as a reason for the remission of sins that were advanced and late, so I chose a topic (from the hadiths of righteous deeds mentioned in the atonement of sins) as a research drawn from the master’s thesis called (the hadiths of the atoners of sins that were presented and delayed - An analytical study- ), And collect in this research kinds of acts of righteousness that bring the mercy of God Almighty to His servants and be a reason for the

The Boltzmann equation has been solved using (EEDF) package for a pure sulfur hexafluoride (SF6) gas and its mixtures with buffer Helium (He) gas to study the electron energy distribution function EEDF and then the corresponding transport coefficients for various ratios of SF6 and the mixtures. The calculations are graphically represented and discussed for the sake of comparison between the various mixtures. It is found that the various SF6 – He content mixtures have a considerable effect on EEDF and the transport coefficients of the mixtures

In this paper, a discretization of a three-dimensional fractional-order prey-predator model has been investigated with Holling type III functional response. All its fixed points are determined; also, their local stability is investigated. We extend the discretized system to an optimal control problem to get the optimal harvesting amount. For this, the discrete-time Pontryagin’s maximum principle is used. Finally, numerical simulation results are given to confirm the theoretical outputs as well as to solve the optimality problem.

The quality of Global Navigation Satellite Systems (GNSS) networks are considerably influenced by the configuration of the observed baselines. Where, this study aims to find an optimal configuration for GNSS baselines in terms of the number and distribution  of baselines to improve the quality criteria of the GNSS networks. First order design problem (FOD) was applied in this research to optimize GNSS network baselines configuration, and based on sequential adjustment method to solve its objective functions.

FOD for optimum precision (FOD-p) was the proposed model which based on the design criteria of A-optimality and E-optimality. These design criteria were selected as objective functions of precision, whic

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the