Wellbore instability is one of the most common issues encountered during drilling operations. This problem becomes enormous when drilling deep wells that are passing through many different formations. The purpose of this study is to evaluate wellbore failure criteria by constructing a one-dimensional mechanical earth model (1D-MEM) that will help to predict a safe mud-weight window for deep wells. An integrated log measurement has been used to compute MEM components for nine formations along the studied well. Repeated formation pressure and laboratory core testing are used to validate the calculated results. The prediction of mud weight along the nine studied formations shows that for Ahmadi, Nahr Umr, Shuaiba, and Zubair formations

Abstract

The Classical Normal Linear Regression Model Based on Several hypotheses, one of them is Heteroscedasticity as it is known that the wing of least squares method (OLS), under the existence of these two problems make the estimators, lose their desirable properties, in addition the statistical inference becomes unaccepted table. According that we put tow alternative,  the first one is  (Generalized Least Square) Which is denoted by (GLS), and the second alternative is to (Robust covariance matrix estimation) the estimated parameters method(OLS), and that the way (GLS) method neat and certified, if the capabilities (Efficient) and the statistical inference Thread on the basis of an acceptable

Software-Defined Networking (SDN) has evolved network management by detaching the control plane from the data forwarding plane, resulting in unparalleled flexibility and efficiency in network administration. However, the heterogeneity of traffic in SDN presents issues in achieving Quality of Service (QoS) demands and efficiently managing network resources. SDN traffic flows are often divided into elephant flows (EFs) and mice flows (MFs). EFs, which are distinguished by their huge packet sizes and long durations, account for a small amount of total traffic but require disproportionate network resources, thus causing congestion and delays for smaller MFs. MFs, on the other hand, have a short lifetime and are latency-sensitive, but they accou

Background Solar irradiance is a nonlinear and intermittent function, which makes accurate forecasting of solar power generation a challenge. The high variability of meteorological conditions is not well represented by conventional atmospheric models, thus hampering forecasting skill and model robustness. In this work, an advanced hybridization of multi-population cuckoo search (HMPCS) algorithm with machine learning (ML) methods is developed to enhance the prediction performance of photovoltaic (PV) power forecasting with more reliability. Methods In this study, a hybrid modeling framework is proposed, called HMPCS–ML framework which captures the global search capacity of HMPCS and predictive power of sophisti

The consumption of dried bananas has increased because they contain essential nutrients. In order to preserve bananas for a longer period, a drying process is carried out, which makes them a light snack that does not spoil quickly. On the other hand, machine learning algorithms can be used to predict the sweetness of dried bananas. The article aimed to study the effect of different drying times (6, 8, and 10 hours) using an air dryer on some physical and chemical characteristics of bananas, including CIE-L*a*b, water content, carbohydrates, and sweetness. Also predicting the sweetness of dried bananas based on the CIE-L*a*b ratios using machine learn- ing algorithms RF, SVM, LDA, KNN, and CART. The results showed that increasing the drying

<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T