The presented work includes the Homotopy Transforms of Analysis Method (HTAM). By this method, the approximate solution of nonlinear Navier- Stokes equations of fractional order derivative was obtained.  The Caputo's derivative was used in the proposed method. The desired solution was calculated by using the convergent power series to the components. The obtained results are demonstrated by comparison with the results of Adomain decomposition method, Homotopy Analysis method and exact solution, as explained in examples (4.1) and (4.2). The comparison shows that the used method is powerful and efficient.

     This paper presents an analysis solution for systems of partial differential equations using a new modification of the decomposition method to overcome the computational difficulties. Convergence of series solution was discussed with two illustrated examples, and the method showed a high-precision, being a fast approach to solve the non-linear system of PDEs with initial conditions. There is no need to convert the nonlinear terms into the linear ones due to the Adomian polynomials. The method does not require any discretization or assumption for a small parameter to be present in the problem. The steps of the suggested method are easily implemented, with high accuracy and rapid convergence to the exact solution,

The continuous increases in the size of current telecommunication infrastructures have led to the many challenges that existing algorithms face in underlying optimization. The unrealistic assumptions and low efficiency of the traditional algorithms make them unable to solve large real-life problems at reasonable times.
The use of approximate optimization techniques, such as adaptive metaheuristic algorithms, has become more prevalent in a diverse research area. In this paper, we proposed the use of a self-adaptive differential evolution (jDE) algorithm to solve the radio network planning (RNP) problem in the context of the upcoming generation 5G. The experimental results prove the jDE with best vecto

In this paper, three approximate methods namely the Bernoulli, the Bernstein, and the shifted Legendre polynomials operational matrices are presented to solve two important nonlinear ordinary differential equations that appeared in engineering and applied science. The Riccati and the Darcy-Brinkman-Forchheimer moment equations are solved and the approximate solutions are obtained. The methods are summarized by converting the nonlinear differential equations into a nonlinear system of algebraic equations that is solved using Mathematica®12. The efficiency of these methods was investigated by calculating the root mean square error (RMS) and the maximum error remainder (𝑀𝐸𝑅n) and it was found that the accuracy increases with increasi

EDIRKTO, an Implicit Type Runge-Kutta  Method of Diagonally Embedded pairs, is a novel approach presented in the paper that may be used to solve 4th-order ordinary differential equations of the form . There are two pairs of EDIRKTO, with three stages each: EDIRKTO4(3) and EDIRKTO5(4). The derivation techniques of the method indicate that the higher-order pair is more accurate, while the lower-order pair provides superior error estimates. Next, using these pairs as a basis, we developed variable step codes and applied them to a series of -order ODE problems. The numerical outcomes demonstrated how much more effective their approach is in reducing the quantity of function evaluations needed to resolve fourth-order ODE issues.

As s widely use of exchanging private information in various communication applications, the issue to secure it became top urgent. In this research, a new approach to encrypt text message based on genetic algorithm operators has been proposed. The proposed approach follows a new algorithm of generating 8 bit chromosome to encrypt plain text after selecting randomly crossover point. The resulted child code is flipped by one bit using mutation operation. Two simulations are conducted to evaluate the performance of the proposed approach including execution time of encryption/decryption and throughput computations. Simulations results prove the robustness of the proposed approach to produce better performance for all evaluation metrics with res

Nowadays, information systems constitute a crucial part of organizations; by losing security, these organizations will lose plenty of competitive advantages as well. The core point of information security (InfoSecu) is risk management. There are a great deal of research works and standards in security risk management (ISRM) including NIST 800-30 and ISO/IEC 27005. However, only few works of research focus on InfoSecu risk reduction, while the standards explain general principles and guidelines. They do not provide any implementation details regarding ISRM; as such reducing the InfoSecu risks in uncertain environments is painstaking. Thus, this paper applied a genetic algorithm (GA) for InfoSecu risk reduction in uncertainty. Finally, the ef