One of the primary problems in internet is security, mostly when computer utilization is increasing in all social and business areas. So, the secret communications through public and private channels are the major goal of researchers. Information hiding is one of methods to obtain a security communication medium and protecting the data during transmission.
This research offers in a new method using two levels to hide, the first level is hiding by embedding and addition but the second level is hiding by injection. The first level embeds a secret message in one bit in the LSB in the FFT and the addition of one kashida. Subtraction of two random images (STRI) is RNG to find positions for hiding within the text. The second level is the in

In this paper, method of steganography in Audio is introduced for hiding secret data in audio media file (WAV). Hiding in audio becomes a challenging discipline, since the Human Auditory System is extremely sensitive. The proposed method is to embed the secret text message in frequency domain of audio file. The proposed method contained two stages: the first embedding phase and the second extraction phase. In embedding phase the audio file transformed from time domain to frequency domain using 1-level linear wavelet decomposition technique and only high frequency is used for hiding secreted message. The text message encrypted using Data Encryption Standard (DES) algorithm. Finally; the Least Significant bit (LSB) algorithm used to hide secr

Image steganography is undoubtedly significant in the field of secure multimedia communication. The undetectability and high payload capacity are two of the important characteristics of any form of steganography. In this paper, the level of image security is improved by combining the steganography and cryptography techniques in order to produce the secured image. The proposed method depends on using LSBs as an indicator for hiding encrypted bits in dual tree complex wavelet coefficient DT-CWT. The cover image is divided into non overlapping blocks of size (3*3). After that, a Key is produced by extracting the center pixel (pc) from each block to encrypt each character in the secret text. The cover image is converted using DT-CWT, then the p

This article presents a polynomial-based image compression scheme, which consists of using the color model (YUV) to represent color contents and using two-dimensional polynomial coding (first-order) with variable block size according to correlation between neighbor pixels. The residual part of the polynomial for all bands is analyzed into two parts, most important (big) part, and least important (small) parts. Due to the significant subjective importance of the big group; lossless compression (based on Run-Length spatial coding) is used to represent it. Furthermore, a lossy compression system scheme is utilized to approximately represent the small group; it is based on an error-limited adaptive coding system and using the transform codin

The main objective of this paper is to introduce and study the generality differential operator involving the q-Mittag-Leffler function on certain subclasses of analytic functions.  Also, we  investigate the inclusion properties of these classes, by using the concept of subordination between analytic functions.

A simple UV spectrophotometric differential derivatization method was performed for the simultaneous quantification of three aromatic amino acids of tryptophan, the polar tyrosine and phenylalanine TRP, TYR and PHE respectively. The avoidance of the time and reagents consuming steps of sample preparation or analyze separation from its bulk of interferences made the approach environmentally benign, sustainable and green. The linear calibration curves of differential second derivative were built at the optimum wavelength for each analyze (218.9, 236.1 and 222.5 nm) for PHE, TRP and TYR respectively. Quantification for each analyze was in the concentration range of (1.0– 45, 0.1–20.0 and 1.0– 50.0 μg/ml) at replicates of (n=3) with a re

   In this paper we introduce many different Methods of ridge regression to solve multicollinearity problem in linear regression model. These Methods include two types of ordinary ridge regression (ORR1), (ORR2) according to the choice of ridge parameter as well as generalized ridge regression (GRR). These methods were applied on a dataset suffers from a high degree of multicollinearity, then according to the criterion of mean square error (MSE) and coefficient of determination (R2) it was found that (GRR) method performs better than the other two methods.
 

Suppose that  is a finite group and  is a non-empty subset of  such that  and . Suppose that  is the Cayley graph whose vertices are all elements of  and two vertices  and  are adjacent if and only if . In this paper, we introduce the generalized Cayley graph denoted by  that  is a graph with vertex set consists of all column matrices  which all components are in  and two vertices  and  are adjacent if and only if , where  is a column matrix that each entry is the inverse of similar entry of  and  is  matrix with all entries in  ,  is the transpose of  and . In this paper, we clarify some basic properties of the new graph and assign the structure of  when  is complete graph , complete bipartite graph  and complete

 This paper adapted the neural network for the estimating of the direction of arrival (DOA). It uses an unsupervised adaptive neural network with GHA algorithm to extract the principal components that in turn, are used by Capon method to estimate the DOA, where by the PCA neural network we take signal subspace only and use it in Capon (i.e. we will ignore the noise subspace, and take the signal subspace only).

The goal of this article is to construct fibrewise w-compact (resp. locally w-compact) spaces. Some related results and properties of these concepts will be investigated. Furthermore, we investigate various relationships between these concepts and three classes of fibrewise w-separation axioms.