This research a study model of linear regression problem of autocorrelation of random error is spread when a normal distribution as used in linear regression analysis for relationship between variables and through this relationship can predict the value of a variable with the values of other variables, and was comparing methods (method of least squares, method of the average un-weighted, Thiel method and Laplace method) using the mean square error (MSE) boxes and simulation and the study included fore sizes of samples (15, 30, 60, 100). The results showed that the least-squares method is best, applying the fore methods of buckwheat production data and the cultivated area of the provinces of Iraq for years (2010), (2011), (2012),

    In this article, the research presents a general overview of deep learning-based AVSS (audio-visual source separation) systems. AVSS has achieved exceptional results in a number of areas, including decreasing noise levels, boosting speech recognition, and improving audio quality. The advantages and disadvantages of each deep learning model are discussed throughout the research as it reviews various current experiments on AVSS. The TCD TIMIT dataset (which contains top-notch audio and video recordings created especially for speech recognition tasks) and the Voxceleb dataset (a sizable collection of brief audio-visual clips with human speech) are just a couple of the useful datasets summarized in the paper that can be used to test A

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

نحو تعزيز المشاركة السياسية للطالبات الجامعيات الفلسطينيات

In this paper, Nordhaus-Gaddum type relations on open support independence number of some derived graphs of path related graphs under addition and multiplication are studied.