It is an established fact that substantial amounts of oil usually remain in a reservoir after primary and secondary processes. Therefore; there is an ongoing effort to sweep that remaining oil. Field optimization includes many techniques. Horizontal wells are one of the most motivating factors for field optimization. The selection of new horizontal wells must be accompanied with the right selection of the well locations. However, modeling horizontal well locations by a trial and error method is a time consuming method. Therefore; a method of Artificial Neural Network (ANN) has been employed which helps to predict the optimum performance via proposed new wells locations by incorporatin
Deep Learning Techniques For Skull Stripping of Brain MR Images
Contours extraction from two dimensional echocardiographic images has been a challenge in digital image processing. This is essentially due to the heavy noise, poor quality of these images and some artifacts like papillary muscles, intra-cavity structures as chordate, and valves that can interfere with the endocardial border tracking. In this paper, we will present a technique to extract the contours of heart boundaries from a sequence of echocardiographic images, where it started with pre-processing to reduce noise and produce better image quality. By pre-processing the images, the unclear edges are avoided, and we can get an accurate detection of both heart boundary and movement of heart valves.
Texture synthesis using genetic algorithms is one way; proposed in the previous research, to synthesis texture in a fast and easy way. In genetic texture synthesis algorithms ,the chromosome consist of random blocks selected manually by the user .However ,this method of selection is highly dependent on the experience of user .Hence, wrong selection of blocks will greatly affect the synthesized texture result. In this paper a new method is suggested for selecting the blocks automatically without the participation of user .The results show that this method of selection eliminates some blending caused from the previous manual method of selection.
Finding orthogonal matrices in different sizes is very complex and important because it can be used in different applications like image processing and communications (eg CDMA and OFDM). In this paper we introduce a new method to find orthogonal matrices by using tensor products between two or more orthogonal matrices of real and imaginary numbers with applying it in images and communication signals processing. The output matrices will be orthogonal matrices too and the processing by our new method is very easy compared to other classical methods those use basic proofs. The results are normal and acceptable in communication signals and images but it needs more research works.
Generally, direct measurement of soil compression index (Cc) is expensive and time-consuming. To save time and effort, indirect methods to obtain Cc may be an inexpensive option. Usually, the indirect methods are based on a correlation between some easier measuring descriptive variables such as liquid limit, soil density, and natural water content. This study used the ANFIS and regression methods to obtain Cc indirectly. To achieve the aim of this investigation, 177 undisturbed samples were collected from the cohesive soil in Sulaymaniyah Governorate in Iraq. Results of this study indicated that ANFIS models over-performed the Regression method in estimating Cc with R2 of 0.66 and 0.48 for both ANFIS and Regre
... Show MoreBackground: Cleaning and shaping of root canals successfully requires high volumes of irrigation solutions that can only be applied to the apical third of root canal after enlargement with instrument, so the aim of this study was to evaluate and to compare the efficiency of Maxi-I-probe (side-vented needle), in the amount of root canal irrigant penetration for five different master apical file sizes (MAF) and four different degrees of coronal and middle thirds flaring. Materials and Methods: Two hundred resin blocks with simulated root canals were used in this study and divided into 5 major groups (40 for each) based on the size of master apical files (#20, #25, #30, #35, and #40). Each major group was subdivided into 4 subgroups depending
... Show MoreBackground: Poly-ether-ether-ketone(PEEK) has been introduced to many dental fields. Recently it was tested as a retainer wire‎ following orthodontic treatment. This study aimed to investigate the effect of changing the bonding spot size and location on the performance of PEEK retainer wires. Methods: A biomechanical study involving four three-dimensional finite element models was performed. The basic model was with a 0.8 mm cylindrical cross-section PEEK wire, bonded at the center of the lingual surface of the mandibular incisors with 4 mm in diameter composite spots. Two other models were designed with 3 mm and 5 mm composite sizes. The last model was created with the composite bonding spot of the canine away from the center of t
... Show MoreBackground: Poly-ether-ether-ketone(PEEK) has been introduced to many dental fields. Recently it was tested as a retainer wire‎ following orthodontic treatment. This study aimed to investigate the effect of changing the bonding spot size and location on the performance of PEEK retainer wires. Methods: A biomechanical study involving four three-dimensional finite element models was performed. The basic model was with a 0.8 mm cylindrical cross-section PEEK wire, bonded at the center of the lingual surface of the mandibular incisors with 4 mm in diameter composite spots. Two other models were designed with 3 mm and 5 mm composite sizes. The last model was created with the composite bonding spot of the canine away from the center
... Show MoreThis paper presents a hybrid genetic algorithm (hGA) for optimizing the maximum likelihood function ln(L(phi(1),theta(1)))of the mixed model ARMA(1,1). The presented hybrid genetic algorithm (hGA) couples two processes: the canonical genetic algorithm (cGA) composed of three main steps: selection, local recombination and mutation, with the local search algorithm represent by steepest descent algorithm (sDA) which is defined by three basic parameters: frequency, probability, and number of local search iterations. The experimental design is based on simulating the cGA, hGA, and sDA algorithms with different values of model parameters, and sample size(n). The study contains comparison among these algorithms depending on MSE value. One can conc
... Show More