In this paper, we proposed a modified Hestenes-Stiefel (HS) conjugate
gradient method. This achieves a high order accuracy in approximating the second
order curvature information of the objective function by utilizing the modified
secant condition which is proposed by Babaie-Kafaki [1], also we derive a nonquadratic
conjugate gradient model. The important property of the suggestion
method that is satisfy the descent property and global convergence independent of
the accuracy of the line search. In addition, we prove the global convergence under
some suitable conditions, and we reported the numerical results under these
conditions.
In petroleum industry, the early knowledge of “pore pressure gradient” is the basis in well design and the extraction of these information is more direct when the pore pressure gradient is equal to normal gradient; however, this matter will be more complex if it deviate from that limit which is called “abnormal pore pressure”, if this variable does not put in consideration, then many drilling problems will occur might lead to entire hole loss. To estimate the pore pressure gradient there are several methods, in this study; Eaton method’s is selected to extract the underground pressure program using drilling data (normalized rate of penetration) and logs data (sonic and density log). The results shows that an abnormal high press
... Show MoreIn this article, results have been shown via using a general quasi contraction multi-valued mapping in Cat(0) space. These results are used to prove the convergence of two iteration algorithms to a fixed point and the equivalence of convergence. We also demonstrate an appropriate conditions to ensure that one is faster than others.
Nowadays, cloud computing has attracted the attention of large companies due to its high potential, flexibility, and profitability in providing multi-sources of hardware and software to serve the connected users. Given the scale of modern data centers and the dynamic nature of their resource provisioning, we need effective scheduling techniques to manage these resources while satisfying both the cloud providers and cloud users goals. Task scheduling in cloud computing is considered as NP-hard problem which cannot be easily solved by classical optimization methods. Thus, both heuristic and meta-heuristic techniques have been utilized to provide optimal or near-optimal solutions within an acceptable time frame for such problems. In th
... Show MoreEmpirical equation has been presented to predict the optimum hydrodynamic
pressure gradient with optimum mud flow rate (one equation) of five Iraqi oil wells
to obtain the optimum carrying capacity of the drilling fluid ( optimum transport
cuttings from the hole to the surface through the annulus).
This equation is a function of mud flow rate, mud density and penetration
rate without using any charts or graphs.
The correlation coefficient accuracy is more than 0.9999.
Abstract. In this scientific work, we investigate the problem of the practical necessity of achieving the adequacy of translation activities with active translation from Russian into Arabic in various fields of translation. Based on the material of the latest suffix vocabulary, a serious attempt is made to clarify and specify the rules for the development of translator's intuition when translating from Russian into Arabic and vice versa. Based on the material collected by the latest suffix vocabulary, we try to make an attempt to reveal the role of suffix word creation in highlighting the general rules for achieving translation equivalence. The paper examines the process of creating words in multi-family languages, the difference between th
... Show MoreWith simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied to some special graphs.
A total global dominator coloring of a graph is a proper vertex coloring of with respect to which every vertex in dominates a color class, not containing and does not dominate another color class. The minimum number of colors required in such a coloring of is called the total global dominator chromatic number, denoted by . In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored.