In this research, the nonparametric technique has been presented to estimate the time-varying coefficients functions for the longitudinal balanced data that characterized by observations obtained through (n) from the independent subjects, each one of them is measured repeatedly by group of  specific time points (m). Although the measurements are independent among the different subjects; they are mostly connected within each subject and the applied techniques is the Local Linear kernel LLPK technique. To avoid the problems of dimensionality, and thick computation, the two-steps method has been used to estimate the coefficients functions by using the two former technique. Since, the two-

The problem of slow learning in primary schools’ pupils is not a local or private one. It is also not related to a certain society other than others or has any relation to a particular culture, it is rather an international problem of global nature. It is one of the well-recognized issues in education field. Additionally, it is regarded as one of the old difficulties to which ancient people gave attention. It is discovered through the process of observing human behaviour and attempting to explain and predict it.
Through the work of the two researchers via frequent visits to primary schools that include special classes for slow learning pupils, in addition to the fact that one of the researcher has a child with slow learning issue, t

The objective of the present study is to determine the nature and direction of the correlation between mathematical excellence and learning styles as defined by the Entwistle, model in fifth-grade scientific female students. The descriptive correlational approach was implemented by the two researchers to accomplish the research objectives. A scale was developed to assess the learning styles of female students in the sample in accordance with the Entwistle, model. : (Knowledge, understanding, application, analysis, synthesis, evaluation, systematic thinking, creativity), and the research community was determined by the female students of the scientific fifth grade in the morning preparatory and secondary schools of the General Direct

Two new organotin(IV) complexes Me2Snesc (C1) and Bu2Snesc (C2) have been synthesised from the reaction of the corresponding organotin(IV) chloride with the Schiff base ligand 3,4-dihydroxybenzaldehyde-4-ethylsemicarbazone (H2esc). The ligand was prepared in two steps. The first step includes the formation of 4-ethylsemicarbazide, which then reacted with 3,4-dihydroxybenzaldehyde to give the title ligand. Complex formation between the organotin(IV) moiety and the anionic form of 3,4-dihydroxybenzaldehy-4-ethylsemicarbazone occurred through the o-dihydroxy positions. The ligand and its complexes were characterised by elemental analysis, FT-IR and NMR (1H, 13C and 119Sn) spectroscopy. Accordingly, the complexes were proposed to have tetrahedr

Abstract

Characterized by the Ordinary Least Squares (OLS) on Maximum Likelihood for the greatest possible way that the exact moments are known , which means that it can be found, while the other method they are unknown, but approximations to their biases correct to 0(n^-1) can be obtained by standard methods. In our research expressions for approximations to the biases of the ML estimators (the regression coefficients and scale parameter) for linear (type 1) Extreme Value Regression Model for Largest Values are presented by using the advanced approach depends on finding the first derivative, second and third.

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.