In this research we been estimated the survival function for data suffer from the disturbances and confusion of Iraq Household Socio-Economic Survey: IHSES II 2012 , to data from a five-year age groups follow the distribution of the Generalized Gamma: GG. It had been used two methods for the purposes of estimating and fitting which is the way the Principle of Maximizing Entropy: POME, and method of booting to nonparametric smoothing function for Kernel, to overcome the mathematical problems plaguing integrals contained in this distribution in particular of the integration of the incomplete gamma function, along with the use of traditional way in which is the Maximum Likelihood: ML. Where the comparison on the basis of the method of the Cen

In regression testing, Test case prioritization (TCP) is a technique to arrange all the available test cases. TCP techniques can improve fault detection performance which is measured by the average percentage of fault detection (APFD). History-based TCP is one of the TCP techniques that consider the history of past data to prioritize test cases. The issue of equal priority allocation to test cases is a common problem for most TCP techniques. However, this problem has not been explored in history-based TCP techniques. To solve this problem in regression testing, most of the researchers resort to random sorting of test cases. This study aims to investigate equal priority in history-based TCP techniques. The first objective is to implement

The need for participants’ performance assessments in academia and industry has been a growing concern. It has attendance, among other metrics, is a key factor in engendering a holistic approach to decision-making. For institutions or organizations where managing people is an important yet challenging task, attendance tracking and management could be employed to improve this seemingly time-consuming process while keeping an accurate attendance record. The manual/quasi-analog approach of taking attendance in some institutions could be unreliable and inefficient, leading to inaccurate computation of attendance rates and data loss. This work, therefore, proposes a system that employs embedded technology and a biometric/ w

ABSTRUCT

In This Paper, some semi- parametric spatial models were estimated, these models are, the semi – parametric spatial error model (SPSEM), which suffer from the problem of spatial errors dependence, and the semi – parametric spatial auto regressive model (SPSAR). Where the method of maximum likelihood was used in estimating the parameter of spatial error          ( λ ) in the model (SPSEM), estimated  the parameter of spatial dependence ( ρ ) in the model ( SPSAR ), and using the non-parametric method in estimating the smoothing function m(x) for these two models, these non-parametric methods are; the local linear estimator (LLE) which require finding the smoo

The aim of the research is to study the comparison between (ARIMA) Auto Regressive Integrated Moving Average and(ANNs) Artificial Neural Networks models and to select the best one for prediction the monthly relative humidity values depending upon the standard errors between estimated and observe values . It has been noted that both can be used for estimation and the best on among is (ANNs) as the values (MAE,RMSE, R2) is )0.036816,0.0466,0.91) respectively for the best formula for model (ARIMA) (6,0,2)(6,0,1) whereas the values of estimates relative to model (ANNs) for the best formula (5,5,1) is (0.0109, 0.0139 ,0.991) respectively. so that model (ANNs) is superior than (ARIMA) in a such evaluation.

In this thesis, we introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we studied some pawlak's concepts and generalization rough set theory, we introduce a new types for approximation rough digraphs depending on supra open digraphs. In addition, we present two various standpoints to define generalized membership relations, and state the implication between it, to classify the digraphs and help for measure exactness and roughness of digraphs. On the other hand, we define several kinds of fuzzy digraphs. We also introduce a topological space, which is induced by reflexive graph and tolerance graphs, such that the graph may be infinite. Furthermore, we offered some properties of th