Permeability is an essential parameter in reservoir characterization because it is determined hydrocarbon flow patterns and volume, for this reason, the need for accurate and inexpensive methods for predicting permeability is important. Predictive models of permeability become more attractive as a result.

   A Mishrif reservoir in Iraq's southeast has been chosen, and the study is based on data from four wells that penetrate the Mishrif formation. This study discusses some methods for predicting permeability. The conventional method of developing a link between permeability and porosity is one of the strategies. The second technique uses flow units and a flow zone indicator (FZI) to predict the permeability of a rock mass u

The results of theoretical and experimental investigations carried out to study the effect of load and relative sliding speed on the abrasive wear behavior in drilling bit teeth surfaces of an insert tungsten carbide bit have been presented. Experimentally, an apparatus for abrasive wear tests conducted on the modified ASTM-G65 was modified and fabricated to facilitate loading and measurement of wear rate for the sand/ steel wheel abrasion test, which involves two cases of contact; first is at dry sand and second is under wet condition. These tests have been carried under varied operating parameters of normal load and sliding speed. A theoretical model based upon the Archard equation has been developed for predicting wear simulation by u

  In this work, we construct and classify the projectively distinct (k,3)-arcs in PG(2,9), where k ≥ 5, and prove that the complete (k,3)-arcs do not exist, where 5 ≤ k ≤ 13. We found that the maximum complete (k,3)-arc in PG(2,q) is the (16,3)-arc and the minimum complete (k,3)-arc in PG(2,q) is the (14,3)-arc. Moreover, we found the complete (k,3)-arcs between them.

  The purpose of this work is to study the classification and construction of (k,3)-arcs in the projective plane PG(2,7). We found that there are two (5,3)-arcs, four (6,3)-arcs, six (7,3)arcs, six (8,3)-arcs, seven (9,3)-arcs, six (10,3)-arcs and six (11,3)-arcs.         All of these arcs are incomplete.         The number of distinct (12,3)-arcs are six, two of them are complete.         There are four distinct (13,3)-arcs, two of them are complete and one (14,3)-arc which is incomplete.         There exists one complete (15,3)-arc.
 

            The article describes a certain computation method of -arcs to construct the number of distinct -arcs in  for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons

   Hiding secret information in the image is a challenging and painstaking task in computer security and steganography system. Certainly, the absolute intricacy of attacks to security system makes it more attractive.in this research on steganography system involving information hiding,Huffman codding used to compress the secret code before embedding which provide high capacity and some security. Fibonacci decomposition used to represent the pixels in the cover image, which increase the robustness of the system. One byte used for mapping all the pixels properties. This makes the PSNR of the system higher due to random distribution of embedded bits. Finally, three kinds of evaluation are applied such as PSNR, chi-square attack, a