In this research a new system identification algorithm is presented for obtaining an optimal set of mathematical models for system with perturbed coefficients, then this algorithm is applied practically by an “On Line System Identification Circuit”, based on real time speed response data of a permanent magnet DC motor. Such set of mathematical models represents the physical plant against all variation which may exist in its parameters, and forms a strong mathematical foundation for stability and performance analysis in control theory problems.

This paper considers and proposes new estimators that depend on the sample and on prior information in the case that they either are equally or are not equally important in the model. The prior information is described as linear stochastic restrictions. We study the properties and the performances of these estimators compared to other common estimators using the mean squared error as a criterion for the goodness of fit. A numerical example and a simulation study are proposed to explain the performance of the estimators.

Abstract:

Since the railway transport sector is very important in many countries of the world, we have tried through this research to study the production function of this sector and to indicate the level of productivity under which it operates.

It was found through the estimation and analysis of the production function Kub - Duglas that the railway transport sector in Iraq suffers from a decline in the level of productivity, which was reflected in the deterioration of the level of services provided for the transport of passengers and goods. This led to the loss of the sector of importance in supporting the national economy and the reluctance of most passengers an

           In this paper, the homotopy perturbation method (HPM) is presented for treating a linear system of second-kind mixed Volterra-Fredholm integral equations. The method is based on constructing the series whose summation is the solution of the considered system. Convergence of constructed series is discussed and its proof is given; also, the error estimation is obtained. Algorithm is suggested and applied on several examples and the results are computed by using MATLAB (R2015a). To show the accuracy of the results and the effectiveness of the method, the approximate solutions of some examples are compared with the exact solution by computing the absolute errors.

Because of the vulnerability of the concept of historical cost adopted as a basis for accounting measurement to many of the criticisms in reaction counter to the concept of fair value, the aim of the research is to try to make a comparison between the historical cost and fair value to prove the health and safety of any of the measurement best for the preparation of financial statements and through the state of each of the two study secretary and good financial investment after being diagnosed with a realistic problem is the limitations of the concept of historical cost in the evaluation of assets in spite of the supposed information disclosed in the financial statements compared to appropriate property for the concept of the fair value o

Variable selection in Poisson regression with high dimensional data has been widely used in recent years. we proposed in this paper using a penalty function that depends on a function named a penalty. An Atan estimator was compared with Lasso and adaptive lasso. A simulation and application show that an Atan estimator has the advantage in the estimation of coefficient and variables selection.

This study focused on determining the markers of Macrophage migration inhibitor (MIF), as well as the N-telopeptides of type I bone collagen (NTX), and some other parameters (alkaline phosphatase (ALP), vitamin D (Vit D), calcium (Ca), phosphorus (P), and magnesium (Mg), and their correlation with other parameters in osteoporosis. One hundred ten subjects were involved in the current study. There were two groups of patients: group I (30) women with severe osteoporosis and group II (30) women with mild osteoporosis. For comparison, 50 apparently healthy individuals were included as a control. Serum levels of MIF, and NTX were significantly higher in groups I and II as compared to the control group, which indicate that these two parameters

In this study, we made a comparison between LASSO & SCAD methods, which are two special methods for dealing with models in partial quantile regression. (Nadaraya & Watson Kernel) was used to estimate the non-parametric part ;in addition, the rule of thumb method was used to estimate the smoothing bandwidth (h). Penalty methods proved to be efficient in estimating the regression coefficients, but the SCAD method according to the mean squared error criterion (MSE) was the best after estimating the missing data using the mean imputation method

We are used Bayes estimators for unknown scale parameter  when shape Parameter  is known of Erlang distribution. Assuming different informative priors for unknown scale  parameter. We derived The posterior density with posterior mean and posterior variance using different informative priors for unknown scale parameter  which are the inverse exponential distribution, the inverse chi-square distribution, the inverse Gamma distribution, and the standard Levy distribution as prior. And we derived Bayes estimators based on the general entropy loss function (GELF) is used the Simulation method to obtain the results. we generated different cases for the parameters of the Erlang model, for different sample sizes. The estimates have been comp

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.