Asmari is the main productive reservoir in Abu Ghirab oilfield in the south-east part of Iraq. It has history production extends from 1976 up to now with several close periods. Recently, the reservoir suffers some problems in production, which are abstracted as water production rising with oil production declining in most wells. The water problem type of the field and wells is identified by using Chan's diagnostic plots (water oil ratio (WOR) and derivative water oil ratio (WOR') against time). The analytical results show that water problem is caused by the channeling due to high permeability zones, high water saturation zones, and faults or fracturing. The numerical approach is also used to study the water movement inside the reser

Asmari is the main productive reservoir in Abu Ghirab oilfield in the south-east part of Iraq. It has history production extends from 1976 up to now with several close periods. Recently, the reservoir suffers some problems in production, which are abstracted as water production rising with oil production declining in most wells. The water problem type of the field and wells is identified by using Chan's diagnostic plots (water oil ratio (WOR) and derivative water oil ratio (WOR') against time). The analytical results show that water problem is caused by the channeling due to high permeability zones, high water saturation zones, and faults or fracturing. The numerical approach is also used to study the water movement insi

     Solving problems via artificial intelligence techniques has widely prevailed in different aspects. Implementing artificial intelligence optimization algorithms for NP-hard problems is still challenging. In this manuscript, we work on implementing the Naked Mole-Rat Algorithm (NMRA) to solve the n-queens problems and overcome the challenge of applying NMRA to a discrete space set. An improvement of NMRA is applied using the aspect of local search in the Variable Neighborhood Search algorithm (VNS) with 2-opt and 3-opt. Introducing the Naked Mole Rat algorithm based on variable neighborhood search (NMRAVNS) to solve N-queens problems with different sizes. Finding the best solution or set of solutions within a plausible amount of t

Densely deployment of sensors is generally employed in wireless sensor networks (WSNs) to ensure energy-efficient covering of a target area. Many sensors scheduling techniques have been recently proposed for designing such energy-efficient WSNs. Sensors scheduling has been modeled, in the literature, as a generalization of minimum set covering problem (MSCP) problem. MSCP is a well-known NP-hard optimization problem used to model a large range of problems arising from scheduling, manufacturing, service planning, information retrieval, etc. In this paper, the MSCP is modeled to design an energy-efficient wireless sensor networks (WSNs) that can reliably cover a target area. Unlike other attempts in the literature, which consider only a si

Discrete   logarithms  are applied      in many    cryptographic problems  . For instance ,   in public   key .  and for construction of sets with disti nct sums of  k-clcments.  The   purpose o r  this   paper

is  to  modify  the  method ol' informationl1·iding  using        discrete logarithms  , introduce new properties of St - sets ,   uscdthe direct product   of    groups   to construct  cyclic group and finally, present modified   method   for   knapsack &

Abstract\

In this research we built a mathematical model of the transportation problem  for data of General Company for Grain Under the environment of variable demand ,and situations of incapableness to determining the supply required quantities as a result of economic and commercial reasons, also restrict flow of grain amounts was specified to a known level by the decision makers to ensure that the stock of reserves for emergency situations that face the company from decrease, or non-arrival of the amount of grain to silos , also it took the capabilities of the tanker into consideration and the grain have been restricted to avoid shortages and lack of processing capability, Function has been adopted

This paper presents a linear fractional programming problem (LFPP) with rough interval coefficients (RICs) in the objective function. It shows that the LFPP with RICs in the objective function can be converted into a linear programming problem (LPP) with RICs by using the variable transformations. To solve this problem, we will make two LPP with interval coefficients (ICs). Next, those four LPPs can be constructed under these assumptions; the LPPs can be solved by the classical simplex method and used with MS Excel Solver. There is also argumentation about solving this type of linear fractional optimization programming problem. The derived theory can be applied to several numerical examples with its details, but we show only two examples

The aim of human lower limb rehabilitation robot is to regain the ability of motion and to strengthen the weak muscles. This paper proposes the design of a force-position control for a four Degree Of Freedom (4-DOF) lower limb wearable rehabilitation robot. This robot consists of a hip, knee and ankle joints to enable the patient for motion and turn in both directions. The joints are actuated by Pneumatic Muscles Actuators (PMAs). The PMAs have very great potential in medical applications because the similarity to biological muscles. Force-Position control incorporating a Takagi-Sugeno-Kang- three- Proportional-Derivative like Fuzzy Logic (TSK-3-PD) Controllers for position control and three-Proportional (3-P) controllers for force contr