Most of the world's drilling companies use API method for calculating the
pressure drop in drilling oil and gas wells. Iraqi Drilling Company also uses this
method for drilling oil wells in all fields of Iraq. In Russia, the method is actively
used Grodde for calculating the pressure drop in drilling oil and gas wells. This
study includes a comparison of formulas API, Grodde and new techniques
developed methods for the laminar flow of viscoplastic fluids in the annular space.
The aim of this study is to determine the most accurate way to calculate the pressure
loss in drilling oil wells. The comparison was focused on identifying changes in the
values of β, using the above calculation methods.

A cap of size  and degree  in a projective space, (briefly; (k,r)-cap) is a set of  points with the property that each line in the space meet it in at most  points. The aim of this research is to extend the size and degree of complete caps and incomplete caps, (k, r)-caps of degree r<12 in the finite projective space of dimension three over the finite field of order eleven, which already exist and founded by the action of subgroups of the general linear group over the finite field of order eleven and degree four, to (k+i,r+1) -complete caps. These caps have been classified by giving the t_i-distribution and -distribution. The Gap programming has been used to execute the designed algorit

                  The research aims to present a proposed strategy for the North Oil Company, and the proposed strategy took into account the surrounding environmental conditions and adopted in its formulation on the basis and scientific steps that are comprehensive and realistic, as it covered the main activities of the company (production and exploration activities, refining and refining activities, export and transport of oil, research and development activity, financial activity, information technology, human resources) and the (David) model has been adopted in the environmental analysis of the factors that have been diagnosed according to a

Abstract

Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al

This paper is concerned with introducing and studying the M-space by using the mixed degree systems which are the core concept in this paper. The necessary and sufficient condition for the equivalence of two reflexive M-spaces is super imposed. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are introduced. From an M-space, a unique supratopological space is introduced. Furthermore, the m-continuous (m-open and m-closed) functions are defined and the fundamental theorem of the m-continuity is provided. Finally, the m-homeomorphism is defined and some of its properties are investigated.

  In  this  paper, we  introduced   some  fact  in   2-Banach  space. Also, we define  asymptotically  non-expansive  mappings  in  the  setting  of  2-normed  spaces analogous  to  asymptotically non-expansive mappings  in  usual  normed spaces. And then prove the existence of fixed points for this type of mappings in 2-Banach spaces.

      In this paper, we show that each soft topological group is a strong small soft loop transfer space at the identity element. This indicates that the soft quasitopological fundamental group of a soft connected and locally soft path connected space, is a soft topological group.

            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

A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte

    In this paper, we introduce new conditions to prove that the existence and boundedness of the solution by convergent sequences and convergent series. The theorem of Krasnoselskii, Lebesgue’s dominated convergence theorem and fixed point theorem are used to get some sufficient conditions for the existence of solutions. Furthermore, we get sufficient conditions to guarantee the oscillatory property for all solutions in this class of equations. An illustrative example is included as an application to the main results.