The purpose of this study was to find out the connection between the water parameters that were examined in the laboratory and the water index acquired from the examination of the satellite image of the study area. This was accomplished by analysing the Landsat-8 satellite picture results as well as the geographic information system (GIS). The primary goal of this study is to develop a model for the chemical and physical characteristics of the Al-Abbasia River in Al-Najaf Al-Ashraf Governorate. The water parameters employed in this investigation are as follows: (PH, EC, TDS, TSS, Na, Mg, K, SO₄, Cl, and NO₃). To collect the samples, ten sampling locations were identified, and the satellite image was obtained on the

Based on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polynomials, defined on the interval [0, 1] for n=7 is achieved. Another method for computing operational matrices of derivative and integration D_b and R_(n+1)^B respectively is presented. Also the result of the proposed method is compared with true answers to show the convergence and advantages of the new method.

MCA has gained a reputation for being a very useful statistical method for determining the association between two or more categorical variables and their graphical description. For performance this method, we must calculate the singular vectors through (SVD). Which is an important primary tool that allows user to construct a low-dimensional space to describe the association between the variables categories. As an alternative procedure to use (SVD), we can use the (BMD) method, which involves using orthogonal polynomials to reflect the structure of ordered categorical responses. When the features of BMD are combined with SVD, the (HD) is formed. The aim of study is to use alternative method of (MCA) that is appropriate with order

Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app

         Over the last few decades, many instructors have been trying all kinds of teaching methods, but without benefit. Nevertheless, in the 1986, a new technique is appeared which called K-W-L technique, it  is specified for reading comprehension passages because reading  skill is not easy matter for students for specific purposes (ESP).therefore, the K-W-L technique is a good one for thinking and experiences. To fulfill the aims and verify the hypothesis which reads as follows" it is hypothesized that there are no significant differences between the achievements of students who are taught according to K-W-L technique and those who are taught according to the traditional method

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the