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-

A simple, economical and selective method employing ion pair dispersive liquid−liquid microextraction (DLLME) coupled with spectrophotometric determination of carbamazepine (CBZ) in pharmaceutical preparations and biological samples was developed. The method is based on reduction of Mo(VI) to Mo(V) using a combination of ammonium thiocyanate and ascorbic acid in acidic medium to form a red binary Mo(V) thiocyanate complex. After addition of CBZ to the complex, extraction of the formed CBZ−Mo(V)−(SCN)6 was performed using a mixture of methylene chloride and methanol. Then, the measurement of target complex was performed at the wavelength of 470 nm. The important extraction parameters affecting the efficiency of DLLME were studied and o

The rise of edge-cloud continuum computing is a result of the growing significance of edge computing, which has become a complementary or substitute option for traditional cloud services. The convergence of networking and computers presents a notable challenge due to their distinct historical development. Task scheduling is a major challenge in the context of edge-cloud continuum computing. The selection of the execution location of tasks, is crucial in meeting the quality-of-service (QoS) requirements of applications. An efficient scheduling strategy for distributing workloads among virtual machines in the edge-cloud continuum data center is mandatory to ensure the fulfilment of QoS requirements for both customer and service provider. E

Background: Dental caries is one of the most prevalent chronic diseases of people worldwide that lead to the pain and disability across all age groups and still consider as a major cause of tooth loss. The aim of this study was to assess the prevalence and severity of dental caries and treatment needs among school children in Heet city. Materiales and methods: The sample included all school children at age of (12 years old) males and females from urban areas in Heet city. Diagnosis and recording of dental caries and treatment needs were done according to the criteria of WHO. Results: The prevalence of dental caries was (90.2%). The DMFS/dmfs values were (5.85±0.168, 1.57±0.146) respectively for the total sample. Females were foun

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.