In this article, a numerical study of compressible and weak compressible Newtonian flows is achieved for a time marching, Galerkin algorithm. A comparison between two numerical techniques for such flows, namely the artificial compressibility method (AC–method) and the fully artificial compressibility method (FAC–method) is performed. In the first artificial compressibility parameter (  is added to the continuity equation, while this parameter is added to both continuity and momentum equations in the second technique. This strategy is implemented to treat the governing equations of Newtonian flow in cylindrical coordinates (axisymmetric). Particularly, this study concerns with the effect of the artificial compressibility p

Classification of network traffic is an important topic for network management, traffic routing, safe traffic discrimination, and better service delivery. Traffic examination is the entire process of examining traffic data, from intercepting traffic data to discovering patterns, relationships, misconfigurations, and anomalies in a network. Between them, traffic classification is a sub-domain of this field, the purpose of which is to classify network traffic into predefined classes such as usual or abnormal traffic and application type. Most Internet applications encrypt data during traffic, and classifying encrypted data during traffic is not possible with traditional methods. Statistical and intelligence methods can find and model traff

Improving" Jackknife Instrumental Variable Estimation method" using A class of immun algorithm with practical application

 The aim of this paper is to find a new method for solving a system of linear initial value problems of ordinary differential equation using approximation technique by two-point osculatory  interpolation with the fit equal numbers of derivatives at the end points of an interval [0, 1] and compared the results with conventional methods and is shown to be that seems to converge faster and more accurately than the conventional methods.

This study aims at finding out the sentimental smartness of the kindergarten children
and its relationship with some variables.
1- The level of the sentimental smartness of the kindergarten children.
2- Investigating the Zero hypothesis in that there are no significant statistical differences in
the sentimental smartness between the kindergarten children according to the sex variables
(males and females).
Some statistical tools have been used in order to arrive at the results that verify the
hypotheses of this study. The researcher uses (1) the distinctive power between two
distinctive groups; (2) the relationship between the item and the total degree (Pearson
correlation factor); and (3) Elfakronbach formula t

Nowadays, the power plant is changing the power industry from a centralized and vertically integrated form into regional, competitive and functionally separate units. This is done with the future aims of increasing efficiency by better management and better employment of existing equipment and lower price of electricity to all types of customers while retaining a reliable system. This research is aimed to solve the optimal power flow (OPF) problem. The OPF is used to minimize the total generations fuel cost function. Optimal power flow may be single objective or multi objective function. In this thesis, an attempt is made to minimize the objective function with keeping the voltages magnitudes of all load buses, real outp

     Task scheduling in an important element in a distributed system. It is vital how the jobs are correctly assigned for each computer’s processor to improve performance. The presented approaches attempt to reduce the expense of optimizing the use of the CPU. These techniques mostly lack planning and in need to be comprehensive. To address this fault, a hybrid optimization scheduling technique is proposed for the hybridization of both First-Come First-Served (FCFS), and Shortest Job First (SJF). In addition, we propose to apply Simulated Annealing (SA) algorithm as an optimization technique to find optimal job’s execution sequence considering both job’s entrance time and job’s execution time to balance them to reduce the job