Steganography is a mean of hiding information within a more obvious form of
communication. It exploits the use of host data to hide a piece of information in such a way
that it is imperceptible to human observer. The major goals of effective Steganography are
High Embedding Capacity, Imperceptibility and Robustness. This paper introduces a scheme
for hiding secret images that could be as much as 25% of the host image data. The proposed
algorithm uses orthogonal discrete cosine transform for host image. A scaling factor (a) in
frequency domain controls the quality of the stego images. Experimented results of secret
image recovery after applying JPEG coding to the stego-images are included.

A comparative investigation of the anatomical characters through a microscopical examination of the prepared transverse sections of the stem was carried out. Six plates with 32 photomicrographs were provided to convincingly show the considerable variations of anatomical characters within the nine examined species. The matrix of 18 anatomical characters which included nine quantitative and nine qualitative was applied for the clustering analysis (CA) followed by the principal component analysis (PCA) using the Multivariate Analysis of Ecological Data, PC-ORD.
The results exhibited significant variations among the species resulting in the construction of an artificial key; this key accurately represents a sufficient tool to display the

In this paper, we present a comparison of double informative priors which are assumed for the parameter of inverted exponential distribution.To estimate the parameter of inverted exponential distribution by using Bayes estimation ,will be  used two different kind of information in the Bayes estimation; two different priors have been selected for the parameter of inverted exponential distribution. Also assumed Chi-squared - Gamma distribution, Chi-squared - Erlang distribution, and- Gamma- Erlang distribution as double priors. The results are the derivations of these estimators under the squared error loss function with three different double priors.

Additionally Maximum likelihood estimation method

In this paper,the homtopy perturbation method (HPM) was applied to obtain the approximate solutions of the fractional order integro-differential equations . The fractional order derivatives and fractional order integral are described in the Caputo and Riemann-Liouville sense respectively. We can easily obtain the solution from convergent the infinite series of HPM . A theorem for convergence and error estimates of the HPM for solving fractional order integro-differential equations was given. Moreover, numerical results show that our theoretical analysis are accurate and the HPM can be considered as a powerful method for solving fractional order integro-diffrential equations.

The techniques of fractional calculus are applied successfully in many branches of science and engineering, one of the techniques is the Elzaki Adomian decomposition method (EADM), which researchers did not study with the fractional derivative of Caputo Fabrizio. This work aims to study the Elzaki Adomian decomposition method (EADM) to solve fractional differential equations with the Caputo-Fabrizio derivative. We presented the algorithm of this method with the CF operator and discussed its convergence by using the method of the Cauchy series then, the method has applied to solve Burger, heat-like, and, couped Burger equations with the Caputo -Fabrizio operator. To conclude the method was convergent and effective for solving this type of

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

FG Mohammed, HM Al-Dabbas, Iraqi journal of science, 2018 - Cited by 6