Linear regression is one of the most important statistical tools through which it is possible to know the relationship between the response variable and one variable (or more) of the independent variable(s), which is often used in various fields of science. Heteroscedastic is one of the linear regression problems, the effect of which leads to inaccurate conclusions. The problem of heteroscedastic may be accompanied by the presence of extreme outliers in the independent variables (High leverage points) (HLPs), the presence of (HLPs) in the data set result unrealistic estimates and misleading inferences. In this paper, we review some of the robust

AHA Al-Hilali, AAH Hamid, The Journal of Law Research, 2022

A field experiment was conducted to grow the wheat crop during the fall season 2020 in Karbala province, north of Ain Al-Tamr District in two locations of different textures and parent materials. The first site (calcareous soil) with a sandy loam texture, is located at (44° 40′ 37′) east longitude and (32° 41′ 34′) north latitude, at an altitude of 32 m above sea level, and an area of 20 hectares. As for the second location (gypsum soil) with a loam texture, it is located at a longitude (45° 41′ 39′) east and a latitude (33° 43′ 34′ north) and at an altitude of 33 m above sea level and an area of 20 hectares. To find out the effect of different tillage systems on water productivity and wheat yield under center pivot irri

     Today in the digital realm, where images constitute the massive resource of the social media base but unfortunately suffer from two issues of size and transmission, compression is the ideal solution. Pixel base techniques are one of the modern spatially optimized modeling techniques of deterministic and probabilistic bases that imply mean, index, and residual. This paper introduces adaptive pixel-based coding techniques for the probabilistic part of a lossy scheme by incorporating the MMSA of the C321 base along with the utilization of the deterministic part losslessly. The tested results achieved higher size reduction performance compared to the traditional pixel-based techniques and the standard JPEG by about 40% and 50%,

This study investigates the feasibility of a mobile robot navigating and discovering its location in unknown environments, followed by the creation of maps of these navigated environments for future use. First, a real mobile robot named TurtleBot3 Burger was used to achieve the simultaneous localization and mapping (SLAM) technique for a complex environment with 12 obstacles of different sizes based on the Rviz library, which is built on the robot operating system (ROS) booted in Linux. It is possible to control the robot and perform this process remotely by using an Amazon Elastic Compute Cloud (Amazon EC2) instance service. Then, the map to the Amazon Simple Storage Service (Amazon S3) cloud was uploaded. This provides a database

Background: The present study was carried out to compare shear bond strength of sapphire bracket bonded to zirconium surface after using different methods of surface conditioning and assessment of the adhesive remnant index. Materials and methods: The sample composed of 40 zirconium specimens divided into four groups; the first group was the control, the second group was conditioned by sandblast with aluminum oxide particle 50 μm, the third and fourth group was treated by (Nd: YAG) laser (1064nm)(0.888 Watt for 5 seconds) for the 1st laser group and (0.444 Watt for 10 seconds) for the 2nd laser group. All samples were coated by z-prime plus primer. A central incisor sapphire bracket was bonded to all samples with light cure adhesive res

Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex