Abstract

       The grey system model GM(1,1) is the model of the prediction of the time series and the basis of the grey theory. This research presents the methods for estimating parameters of the grey model GM(1,1) is the accumulative method (ACC), the exponential method (EXP), modified exponential method (Mod EXP) and the Particle Swarm Optimization method (PSO). These methods were compared based on the Mean square error (MSE) and the Mean Absolute percentage error (MAPE) as a basis comparator and the simulation method was adopted for the best of the four methods, The best method was obtained and then applied to real data. This data represents the consumption rate of two types of oils a he

Encryption of data is translating data to another shape or symbol which enables people only with an access to the secret key or a password that can read it. The data which are encrypted are generally referred to as cipher text, while data which are unencrypted are known plain text. Entropy can be used as a measure which gives the number of bits that are needed for coding the data of an image. As the values of pixel within an image are dispensed through further gray-levels, the entropy increases. The aim of this research is to compare between CAST-128 with proposed adaptive key and RSA encryption methods for video frames to determine the more accurate method with highest entropy. The first method is achieved by applying the "CAST-128" and

Chromatographic and spectrophotometric methods for the estimation of mebendazole in
pharmaceutical products were developed. The flow injection method was based on the oxidation of
mebendazole by a known excess of sodium hypochlorite at pH=9.5. The excess sodium hypochlorite is then
reacted with chloranilic acid (CAA) to bleach out its color. The absorbance of the excess CAA was recorded
at 530 nm. The method is fast, simple, selective, and sensitive. The chromatographic method was carried out
on a Varian C18 column. The mobile phase was a mixture of acetonitrile (ACN), methanol (MeOH), water
and triethylamine (TEA), (56% ACN, 20% MeOH, 23.5% H2O, 0.5% TEA, v/v), adjusted to pH = 3.0 with
1.0 M hy

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.

In this paper, we deal with the problem of general matching of two images one of them has experienced geometrical transformations, to find the correspondence between two images. We develop the invariant moments for traditional techniques (moments of inertia) with new approach to enhance the performance for these methods. We test various projections directional moments, to extract the difference between Block Distance Moment (BDM) and evaluate their reliability. Three adaptive strategies are shown for projections directional moments, that are raster (vertical and horizontal) projection, Fan-Bean projection and new projection procedure that is the square projection method. Our paper started with the description of a new algorithm that is low

     In this paper, Bayesian estimator for the parameter and reliability function of inverse Rayleigh distribution (IRD) were obtained Under three types of loss function, namely, square error loss function (SELF), Modified Square error loss function (MSELF) and Precautionary loss function (PLF),taking into consideration the  informative and non- informative  prior. The performance of such estimators was assessed on the basis of mean square error (MSE) criterion by performing a Monte Carlo simulation technique.

In this work, results from an optical technique (laser speckle technique) for measuring surface roughness was done by using statistical properties of speckle pattern from the point of view of computer image texture analysis. Four calibration relationships were used to cover wide range of measurement with the same laser speckle technique. The first one is based on intensity contrast of the speckle, the second is based on analysis of speckle binary image,  the third is on size of speckle pattern spot, and the latest one is based on characterization of the energy feature of the gray level co-occurrence matrices for the speckle pattern. By these calibration relationships surface roughness of an object surface can be evaluated within the

      The present paper concern with minimax shrinkage estimator technique in order to estimate Burr X distribution shape parameter, when prior information about the real shape obtainable as original estimate while known scale parameter.

 Derivation for Bias Ratio, Mean squared error and the Relative Efficiency equations.

 Numerical results and conclusions for the expressions mentioned above were displayed. Comparisons for proposed estimator with most recent works were made.

Transforming the common normal distribution through the generated Kummer Beta model to the Kummer Beta Generalized Normal Distribution (KBGND) had been achieved. Then, estimating the distribution parameters and hazard function using the MLE method, and improving these estimations by employing the genetic algorithm. Simulation is used by assuming a number of models and different sample sizes. The main finding was that the common maximum likelihood (MLE) method is the best in estimating the parameters of the Kummer Beta Generalized Normal Distribution (KBGND) compared to the common maximum likelihood according to Mean Squares Error (MSE) and Mean squares Error Integral (IMSE) criteria in estimating the hazard function. While the pr

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.