Steganography can be defined as the art and science of hiding information in the data that could be read by computer. This science cannot recognize stego-cover and the original one whether by eye or by computer when seeing the statistical samples. This paper presents a new method to hide text in text characters. The systematic method uses the structure of invisible character to hide and extract secret texts. The creation of secret message comprises four main stages such using the letter from the original message, selecting the suitable cover text, dividing the cover text into blocks, hiding the secret text using the invisible character and comparing the cover-text and stego-object. This study uses an invisible character (white space) position of in the cover text that used to hide the the secrete sender masseges. The experiments results show that the suggested method presents highly secret due to use the multi-level of complexity to avoid the attackers.
The current paper proposes a new estimator for the linear regression model parameters under Big Data circumstances. From the diversity of Big Data variables comes many challenges that can be interesting to the researchers who try their best to find new and novel methods to estimate the parameters of linear regression model. Data has been collected by Central Statistical Organization IRAQ, and the child labor in Iraq has been chosen as data. Child labor is the most vital phenomena that both society and education are suffering from and it affects the future of our next generation. Two methods have been selected to estimate the parameter
... Show More
In this paper, the using of Non-Homogenous Poisson Processes, with one of the scientific and practical means in the Operations Research had been carried out, which is the Queuing Theory, as those operations are affected by time in their conduct by one function which has a cyclic behavior, called the (Sinusoidal Function). (Mt / M / S) The model was chosen, and it is Single Queue Length with multiple service Channels, and using the estimating scales (QLs, HOL, HOLr) was carried out in considering the delay occurring to the customer before his entrance to the service, with the comparison of the best of them in the cases of the overload.
Through the experiments
... Show MoreThe radon gas concentration in environmental samples soil and water of selected regions in Al-Najaf governorate was measured by using alpha-emitters registrations which are emitted form radon gas in (CR-39) nuclear track detector. The first part is concerned with the determination of radon gas concentration in soil samples, results of measurements indicate that the highest average radon concentration in soil samples was found in (Al-Moalmen) region which was (100.0±7.0 Bq/m3), while the lowest average radon concentration was found in (Al-Askary) region which was (38.5±4.7 Bq/m3), with an average value of (64.23±14.9 Bq/m3) ,the results show that the radon gas concentrations in soil is below the allowed limit from (ICRP) agency which is (
... Show Morein this paper we adopted ways for detecting edges locally classical prewitt operators and modification it are adopted to perform the edge detection and comparing then with sobel opreators the study shows that using a prewitt opreators
Data hiding is the process of encoding extra information in an image by making small modification to its pixels. To be practical, the hidden data must be perceptually invisible yet robust to common signal processing operations. This paper introduces a scheme for hiding a signature image that could be as much as 25% of the host image data and hence could be used both in digital watermarking as well as image/data hiding. The proposed algorithm uses orthogonal discrete wavelet transforms with two zero moments and with improved time localization called discrete slantlet transform for both host and signature image. A scaling factor ? in frequency domain control the quality of the watermarked images. Experimental results of signature image
... Show MoreIn this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .