Optimum perforation location selection is an important study to improve well production and hence in the reservoir development process, especially for unconventional high-pressure formations such as the formations under study. Reservoir geomechanics is one of the key factors to find optimal perforation location. This study aims to detect optimum perforation location by investigating the changes in geomechanical properties and wellbore stress for high-pressure formations and studying the difference in different stress type behaviors between normal and abnormal formations. The calculations are achieved by building one-dimensional mechanical earth model using the data of four deep abnormal wells located in Southern Iraqi oil fields. The magni

Intended for getting good estimates with more accurate results, we must choose the appropriate method of estimation. Most of the equations in classical methods are linear equations and finding analytical solutions to such equations is very difficult. Some estimators are inefficient because of problems in solving these equations. In this paper, we will estimate the survival function of censored data by using one of the most important artificial intelligence algorithms that is called the genetic algorithm to get optimal estimates for parameters Weibull distribution with two parameters. This leads to optimal estimates of the survival function. The genetic algorithm is employed in the method of moment, the least squares method and the weighted

in this paper the collocation method will be solve ordinary differential equations of retarted arguments also some examples are presented in order to illustrate this approach

The increasing availability of computing power in the past two decades has been use to develop new techniques for optimizing solution of estimation problem. Today's computational capacity and the widespread availability of computers have enabled development of new generation of intelligent computing techniques, such as our interest algorithm, this paper presents one of new class of stochastic search algorithm (known as Canonical Genetic' Algorithm ‘CGA’) for optimizing the maximum likelihood function strategy is composed of three main steps: recombination, mutation, and selection. The experimental design is based on simulating the CGA with different values of are compared with those of moment method. Based on MSE value obtained from bot

Research includes evaluation of projects implemented and which entered into trial operation period in accordance with the evaluation criteria and of (cost, quality and time) to determine the size deviations gap for the sample of projects during the years of assessment (2011-2012-2013-2014) of each of the three evaluation criteria, and then followed by a calculation the size of the overall gap to the problem based on the research problem to determine deviations from the specific implementation of each project by answering several questions to answer turns out the reasons for these deviations occur.

The importance of research Focus on the evaluation of received projects from contractors executing the projec

In this research، a comparison has been made between the robust estimators of (M) for the Cubic Smoothing Splines technique، to avoid the problem of abnormality in data or contamination of error، and the traditional estimation method of Cubic Smoothing Splines technique by using two criteria of differentiation which are (MADE، WASE) for different sample sizes and disparity levels to estimate the chronologically different coefficients functions for the balanced longitudinal data which are characterized by observations obtained through (n) from the independent subjects، each one of them is measured repeatedly by group of  specific time points (m)،since the frequent measurements within the subjects are almost connected an

 Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved.  In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO)