In this paper, the conditions of occurrence of the local bifurcation (such as saddle-node, transcritical and pitchfork) near each of the equilibrium points of a mathematical model consists from four-species Syn- Ecosymbiosis are established.

Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over

Data security is a significant requirement in our time. As a result of the rapid development of unsecured computer networks, the personal data should be protected from unauthorized persons and as a result of exposure AES algorithm is subjected to theoretical attacks such as linear attacks, differential attacks, and practical attacks such as brute force attack these types of attacks are mainly directed at the S-BOX and since the S-BOX table in the algorithm is static and no dynamic so this is a major weakness for the S-BOX table, the algorithm should be improved to be impervious to future dialects that attempt to analyse and break the algorithm  in order to remove these weakness points, Will be generated dynamic substitution box (S-B

Flexible molecular docking is a computational method of structure-based drug design to evaluate binding interactions between receptor and ligand and identify the ligand conformation within the receptor pocket. Currently, various molecular docking programs are extensively applied; therefore, realizing accuracy and performance of the various docking programs could have a significant value. In this comparative study, the performance and accuracy of three widely used non-commercial docking software (AutoDock Vina, 1-Click Docking, and UCSF DOCK) was evaluated through investigations of the predicted binding affinity and binding conformation of the same set of small molecules (HIV-1 protease inhibitors) and a protein target HIV-1 protease enzy

Notes are given regarding new record species of the braconid parasite short note in Iraq. That is Apanteles angalcti it is found to parasitize early larval instaxs of Ectomyslois ceratontae, one of the most serious pests of pomegra- nate fruit.

A total of 72 individuals of genus Pristina were sorted from aquatic plant, Ceratophyllum demersum L., and filamentous algae collected from three sites on Tigris River at Baghdad including: Al-Sarafiya area (S1), Al- Jadiriyah area (S2), and Al- Za´afaraniya area (S3). Four species were identified including P. longiseta, P. aequiseta, P. proboscidea and P. foreli, with percentags of 51.7 , 36.4, 1.1, and 10.5 % respectively. The first two species found in all sites , while , P. proboscidea found only in S1 and P. foreli only in S2.

Survival analysis is widely applied to data that described by the length of time until the occurrence of an event under interest such as death or other important events. The purpose of this paper is to use the dynamic methodology which provides a flexible method, especially in the analysis of discrete survival time, to estimate the effect of covariate variables through time in the survival analysis on dialysis patients with kidney failure until death occurs. Where the estimations process is completely based on the Bayes approach by using two estimation methods: the maximum A Posterior (MAP) involved with Iteratively Weighted Kalman Filter Smoothing (IWKFS) and in combination with the Expectation Maximization (EM) algorithm. While the other

     In the current Airlines Air Traffic Management (ATM), the Air Traffic Control Operators (ATCO), with the Air Traffic Control systems (ATC), operate air traffic paths with a small number of fixed routes. Problems of fixed routes appear such that even when they reduce the chance for conflict, they also produce flight paths plans that do not reduce flight time or fuel usage. In nowadays Airlines are heavily overloaded and anxious to minimize the aircrafts fuel usage costs, increase airplanes, and optimize the paths or the flight routes in order to find the most optimal suitable flight paths. This paper presents a new path planning method that deal with such problem effectively, the idea was to produce flights routes

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