In this paper, we study some cases of a common fixed point theorem for classes of firmly nonexpansive and generalized nonexpansive maps. In addition, we establish that the Picard-Mann iteration is faster than Noor iteration and we used Noor iteration to find the solution of delay differential equation.

This paper includes the application of Queuing theory with of Particle swarm algorithm or is called (Intelligence swarm) to solve the problem of The queues and developed for General commission for taxes /branch Karkh center in the service stage of the Department of calculators composed of six  employees , and it was chosen queuing model is a single-service channel  M / M / 1 according to the nature of the circuit work mentioned above and it will be divided according to the letters system for each employee, and  it was composed of data collection times (arrival time , service time, departure time)

Maulticollinearity is a problem that always occurs when two or more predictor variables are correlated with each other. consist of the breach of one basic assumptions of the ordinary least squares method with biased estimates results, There are several methods which are proposed to handle this problem including the  method To address a problem  and  method To address a problem , In this research a comparisons are employed between the biased   method and unbiased   method with Bayesian   using Gamma distribution  method  addition to Ordinary Least Square metho

Background: Periodontium mainly exposed to injury by trauma or pathologic diseases, Aloe vera is a plant has many basic ingredients in its extracted gel that acts as wound healing accelerator in addition to that it's safe, and economical and without recordable of side effect. This study aimed is to evaluate the effect of topical application of Aloe vera on expression of syndecan -1 by periodontium tissue. Materials and methods: Thirty six male Albino rats were subjected for periodontium defect by electric scaler on the distal sides of both lower anterior teeth. The animals divided into two groups; control group (without treatment) and the experimental group treated with 1µLAloe vera gel/normal saline. Periodontal healing was examined at

This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).

The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with

 A mixture model is used to model data that come from more than one component. In recent years, it became an effective tool in drawing inferences about the complex data that we might come across in real life. Moreover, it can represent a tremendous confirmatory tool in classification observations based on similarities amongst them. In this paper, several mixture regression-based methods were conducted under the assumption that the data come from a finite number of components. A comparison of these methods has been made according to their results in estimating component parameters. Also, observation membership has been inferred and assessed for these methods. The results showed that the flexible mixture model outperformed the

 A mixture model is used to model data that come from more than one component. In recent years, it became an effective tool in drawing inferences about the complex data that we might come across in real life. Moreover, it can represent a tremendous confirmatory tool in classification observations based on similarities amongst them. In this paper, several mixture regression-based methods were conducted under the assumption that the data come from a finite number of components. A comparison of these methods has been made according to their results in estimating component parameters. Also, observation membership has been inferred and assessed for these methods. The results showed that the flexible mixture model outperformed the others

In this article our goal is mixing ARMA models with EGARCH models and composing a mixed model ARMA(R,M)-EGARCH(Q,P) with two steps, the first step includes modeling the data series by using EGARCH model alone interspersed with steps of detecting the heteroscedasticity effect and estimating  the model's parameters and check the adequacy of the model. Also we are predicting the conditional variance and verifying it's convergence to the unconditional variance value. The second step includes mixing ARMA with EGARCH and using the mixed (composite) model in modeling time series data and predict future values then asses the prediction ability of the proposed model by using prediction error criterions.

Some maps of the chaotic firefly algorithm were selected to select variables for data on blood diseases and blood vessels obtained from Nasiriyah General Hospital where the data were tested and tracking the distribution of Gamma and it was concluded that a Chebyshevmap method is more efficient than a Sinusoidal map method through mean square error criterion.

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.