In this study, we review the ARIMA (p, d, q), the EWMA and the DLM (dynamic linear moodelling) procedures in brief in order to accomdate the ac(autocorrelation)  structure of data .We consider the recursive estimation and prediction algorithms based on Bayes and KF (Kalman filtering) techniques for correlated observations.We investigate the effect on the MSE of  these procedures and compare them using generated data.

Through recent years many researchers have developed methods to estimate the self-similarity and long memory parameter that is best known as the Hurst parameter. In this paper, we set a comparison between nine different methods. Most of them use the deviations slope to find an estimate for the Hurst parameter like Rescaled range (R/S), Aggregate Variance (AV), and Absolute moments (AM), and some depend on filtration technique like Discrete Variations (DV), Variance versus level using wavelets (VVL) and Second-order discrete derivative using wavelets (SODDW) were the comparison set by a simulation study to find the most efficient method through MASE. The results of simulation experiments were shown that the performance of the meth

Transport layer is responsible for delivering data to the appropriate application process on the host computers. The two most popular transport layer protocols are Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). TCP is considered one of the most important protocols in the Internet. UDP is a minimal message-oriented Transport Layer protocol. In this paper we have compared the performance of TCP and UDP on the wired network. Network Simulator (NS2) has been used for performance Comparison since it is preferred by the networking research community. Constant bit rate (CBR) traffic used for both TCP and UDP protocols.

The problem of the study and its significance:

           Due to the increasing pressures of life continually, and constant quest behind materialism necessary and frustrations that confront us daily in general, the greater the emergence of a number of cases of disease organic roots psychological causing them because of severity of a lack of response to conventional treatments (drugs), and this is creating in patients a number of emotional disorders resulting from concern the risk of disease

     That is interested psychologists and doctors searchin

The pre - equilibrium and equilibrium double differential cross
sections are calculated at different energies using Kalbach Systematic
approach in terms of Exciton model with Feshbach, Kerman and
Koonin (FKK) statistical theory. The angular distribution of nucleons
and light nuclei on 27Al target nuclei, at emission energy in the center
of mass system, are considered, using the Multistep Compound
(MSC) and Multistep Direct (MSD) reactions. The two-component
exciton model with different corrections have been implemented in
calculating the particle-hole state density towards calculating the
transition rates of the possible reactions and follow up the calculation
the differential cross-sections, that include MS

1267 Objectives Aim to evaluate 198Au nanoparticles (AuNP) biodistribution and uptake in a human prostate model for treatment. Many phytochemicals are known to have anti-tumor properties but have short half-lives in vivo. We hypothesized that using these phytochemicals to formulate and coat AuNP would inhibit enzyme cleavage and enhance their anti-tumor properties. Initial evaluations were performed in SCID mice bearing PC3 tumors. Methods : 198AuNP were formulated with the following gum Arabic, epigalocatechin gallate (EGCg) pomegranate extract and mangiferin extract. The resultant nanoparticles were evaluated in normal mice and in human prostate bearing SCID mice. The tumor bearing mice were injected intratumorally with 3-5 uCi of 198A

Two unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.