The growing use of tele
This paper presents a new secret diffusion scheme called Round Key Permutation (RKP) based on the nonlinear, dynamic and pseudorandom permutation for encrypting images by block, since images are considered particular data because of their size and their information, which are two-dimensional nature and characterized by high redundancy and strong correlation. Firstly, the permutation table is calculated according to the master key and sub-keys. Secondly, scrambling pixels for each block to be encrypted will be done according the permutation table. Thereafter the AES encryption algorithm is used in the proposed cryptosystem by replacing the linear permutation of ShiftRows step with the nonlinear and secret pe
... Show MoreA new, simple, sensitive and fast developed method was used for the determination of methyldopa in pure and pharmaceutical formulations by using continuous flow injection analysis. This method is based on formation a burgundy color complex between methyldopa andammonium ceric (IV) nitrate in aqueous medium using long distance chasing photometer NAG-ADF-300-2. The linear range for calibration graph was 0.05-8.3 mmol/L for cell A and 0.1-8.5 mmol/L for cell B, and LOD 952.8000 ng /200 µL for cell A and 3.3348 µg /200 µL for cell B respectively with correlation coefficient (r) 0.9994 for cell A and 0.9991 for cell B, RSD % was lower than 1 % for n=8. The results were compared with classical method UV-Spectrophotometric at λ max=280 n
... Show MoreA simple, sensitive and rapid method was used for the estimate of: Propranolol with Bi (III) to prove the efficiency, reliability and repeatability of the long distance chasing photometer (NAG-ADF-300-2) using continuous flow injection analysis. The method is based on a reaction between propranolol and Bi (III) in an aqueous medium to obtain a yellow precipitate. Optimum parameters were studied to increase the sensitivity for the developed method. A linear range for calibration graph was 0.1-25 mmol/L for cell A and 1-40 mmol/L for cell B, and LOD 51.8698 ng/200 µL and 363.0886 ng /200 µL , respectively to cell A and cell B with correlation coefficient (r) 0.9975 for cell A, 0.9966 for cell B, RSD% was lower than 1%, (n = 8) for the
... Show MoreIn this research, some robust non-parametric methods were used to estimate the semi-parametric regression model, and then these methods were compared using the MSE comparison criterion, different sample sizes, levels of variance, pollution rates, and three different models were used. These methods are S-LLS S-Estimation -local smoothing, (M-LLS)M- Estimation -local smoothing, (S-NW) S-Estimation-NadaryaWatson Smoothing, and (M-NW) M-Estimation-Nadarya-Watson Smoothing.
The results in the first model proved that the (S-LLS) method was the best in the case of large sample sizes, and small sample sizes showed that the
... Show MoreIn this paper, we proposed to zoom Volterra equations system Altfazlah linear complementarity of the first type in this approximation were first forming functions notch Baschtdam matrix and then we discussed the approach and stability, to notch functions
The Wang-Ball polynomials operational matrices of the derivatives are used in this study to solve singular perturbed second-order differential equations (SPSODEs) with boundary conditions. Using the matrix of Wang-Ball polynomials, the main singular perturbation problem is converted into linear algebraic equation systems. The coefficients of the required approximate solution are obtained from the solution of this system. The residual correction approach was also used to improve an error, and the results were compared to other reported numerical methods. Several examples are used to illustrate both the reliability and usefulness of the Wang-Ball operational matrices. The Wang Ball approach has the ability to improve the outcomes by minimi
... Show Morein this article, we present a definition of k-generalized map independent of non-expansive map and give infinite families of non-expansive and k-generalized maps new iterative algorithms. Such algorithms are also studied in the Hilbert spaces as the potential to exist for asymptotic common fixed point.