An approach for hiding information has been proposed for securing information using Slanlet transform and the T-codes. Same as the wavelet transform the Slantlet transform is better in compression signal and good time localization signal compression than the conventional transforms like (DCT) discrete cosine transforms. The proposed method provides efficient security, because the original secret image is encrypted before embedding in order to build a robust system that is no attacker can defeat it. Some of the well known fidelity measures like (PSNR and AR) were used to measure the quality of the Steganography image and the image after extracted. The results show that the stego-image is closed related to the cover image, with (PSNR) Peak Signal to Noise Ratio is about 55dB. The recovered secret image is extracted (100%) if stego-image has no attack. These methods can provide good hiding capacity and image quality. Several types of attacks have been applied to the proposed methods in order to measure the robustness like (compression, add noise and cropping). The proposed algorithm has been implemented by using computer simulation program MATLAB version 7.9 under windows 7 operating system by Microsoft cooperation.
The Main think that be kept by the speech communication as a concept traditionally being expressed on the subject or a certain idea of a goal came on as needed functional addressed to recipients of benefits or likely to benefit from those rhetorical message through a speech importance and priority of the effect of not less than the effect of that letter, in science content role ends once you absorb it mentally, either in the art of design Valamadmon intellectual embodied through its interaction with the overall shape of the finished design, and often content is associated in the mind of the receiver through a letter communicative linked to the sense or the goal that meant the designer, and try to identify and explain. And meaning i
... Show More
(3)
(1)
Text based-image clustering (TBIC) is an insufficient approach for clustering related web images. It is a challenging task to abstract the visual features of images with the support of textual information in a database. In content-based image clustering (CBIC), image data are clustered on the foundation of specific features like texture, colors, boundaries, shapes. In this paper, an effective CBIC) technique is presented, which uses texture and statistical features of the images. The statistical features or moments of colors (mean, skewness, standard deviation, kurtosis, and variance) are extracted from the images. These features are collected in a one dimension array, and then genetic algorithm (GA) is applied for image clustering.
... Show More
(9)
(5)
(14)
Today, problems of spatial data integration have been further complicated by the rapid development in communication technologies and the increasing amount of available data sources on the World Wide Web. Thus, web-based geospatial data sources can be managed by different communities and the data themselves can vary in respect to quality, coverage, and purpose. Integrating such multiple geospatial datasets remains a challenge for geospatial data consumers. This paper concentrates on the integration of geometric and classification schemes for official data, such as Ordnance Survey (OS) national mapping data, with volunteered geographic information (VGI) data, such as the data derived from the OpenStreetMap (OSM) project. Useful descriptions o
... Show More
Composting is one of the solid waste management (SWM) methods where the organic component decomposed biologically under controlled conditions. In this study, a 0.166 m3 bioreactor tank was designed to compose 59.2Kg of simulated common municipal solid food waste having a bulk density, organic matter, organic carbon, pH, nitrogen content, C/N and nitrification index (NH4-N/ NO3-N) of 536.62 kg/m3, 62.34%, 34.76%, 6.53, 1.86%, 23 and 0.34 respectively. The bioreactor operated aerobically for 30 days, and anaerobically for 70 days, until the end of the composting process. Results proved that the composting process could reduce the mass of the waste by 69%. Nitrogen content,
... Show More
(3)
Due to that the Ultra Wide Band (UWB) technology has some attractive features like robustness to multipath fading, high data rate, low cost and low power consumption, it is widely use to implement cognitive radio network. Intuitively, one of the most important tasks required for cognitive network is the spectrum sensing. A framework for implementing spectrum sensing for UWB-Cognitive Network will be presented in this paper. Since the information about primary licensed users are known to the cognitive radios then the best spectrum sensing scheme for UWB-cognitive network is the matched filter detection scheme. Simulation results verified and demonstrated the using of matched filter spectrum sensing in cognitive radio network with UWB and pro
... Show More
(2)
The objective of this work is to design and implement a cryptography system that enables the sender to send message through any channel (even if this channel is insecure) and the receiver to decrypt the received message without allowing any intruder to break the system and extracting the secret information. This work modernize the feedforward neural network, so the secret message will be encrypted by unsupervised neural network method to get the cipher text that can be decrypted using the same network to get the original text. The security of any cipher system depends on the security of the related keys (that are used by the encryption and the decryption processes) and their corresponding lengths. In this work, the key is the final weights
... Show More
The limitations of wireless sensor nodes are power, computational capabilities, and memory. This paper suggests a method to reduce the power consumption by a sensor node. This work is based on the analogy of the routing problem to distribute an electrical field in a physical media with a given density of charges. From this analogy a set of partial differential equations (Poisson's equation) is obtained. A finite difference method is utilized to solve this set numerically. Then a parallel implementation is presented. The parallel implementation is based on domain decomposition, where the original calculation domain is decomposed into several blocks, each of which given to a processing element. All nodes then execute computations in parall
... Show More