In this article, the nonlinear problem of Jeffery-Hamel flow has been solved analytically and numerically by using reliable iterative and numerical methods. The approximate solutions obtained by using the Daftardar-Jafari method namely (DJM), Temimi-Ansari method namely (TAM) and Banach contraction method namely (BCM). The obtained solutions are discussed numerically, in comparison with other numerical solutions obtained from the fourth order Runge-Kutta (RK4), Euler and previous analytic methods available in literature. In addition, the convergence of the proposed methods is given based on the Banach fixed point theorem. The results reveal that the presented methods are reliable, effective and applicable to solve other nonlinear problems.

The study aims to provide a Suggested model for the application of Virtual Private Network is a tool that used to protect the transmitted data through the Web-based information system, and the research included using case study methodology in order to collect the data about the research area ( Al-Rasheed Bank) by using Visio to design and draw the diagrams of the suggested models and adopting the data that have been collected by the interviews with the bank's employees, and the research used the modulation of data in order to find solutions for the research's problem.

The importance of the study Lies in dealing with one of the vital topics at the moment, namely, how to make the information transmitted via

This paper proposes a novel finite-time generalized proportional integral observer (FTGPIO) based a sliding mode control (SMC) scheme for the tracking control problem of high order uncertain systems subject to fast time-varying disturbances. For this purpose, the construction of the controller consists of two consecutive steps. First, the novel FTGPIO is designed to observe unmeasurable plant dynamics states and disturbance with its higher time derivatives in finite time rather than infinite time as in the standard GPIO. In the FTGPO estimator, the finite time convergence rate of estimations is well achieved, whereas the convergence rate of estimations by classical GPIO is asymptotic and slow. Secondly, on the basis of the finite and fast e

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

Necessary and sufficient conditions for the operator equation I AXAX n*, to have a real positive definite solution X are given. Based on these conditions, some properties of the operator A as well as relation between the solutions X andAare given.