In digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. Th

The present study was carried out to determine the bacterial isolates and study their antimicrobial susceptibility in case of burned wound infections. 70 burn wound swabs were taken from patients, who presented invasive burn wound infection from both sex and average age of 3-58 years, admitted to teaching medical Al- Kendi hospital from October 2007 to June 2008. Pseudomonas aeruginosa was found to be the most common isolate (48.9%) followed by Staphylococcus aureus (24.4%), Citrobacter braakii (13.3%), Enterobacter spp. (11.1%), Coagulase-negative Staphylococci (11.1%), Proteus vulgaris (6.66%), Corynebacterium spp. (6.66%), Micrococcus (6.66%), Proteus mirabilis (4.44%), Enterococcus faecalis (4.44%), E.coli (4.44%), Klebsiella spp. (2.22

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.

In this paper, two new simple, fast and efficient block matching algorithms are introduced, both methods begins blocks matching process from the image center block and moves across the blocks toward image boundaries. With each block, its motion vector is initialized using linear prediction that depending on the motion vectors of its neighbor blocks that are already scanned and their motion vectors are assessed. Also, a hybrid mechanism is introduced, it depends on mixing the proposed two predictive mechanisms with Exhaustive Search (ES) mechanism in order to gain matching accuracy near or similar to ES but with Search Time ST less than 80% of the ES. Also, it offers more control capability to reduce the search errors. The experimental tests

Nowadays, still images are used everywhere in the digital world. The shortages of storage capacity and transmission bandwidth make efficient compression solutions essential. A revolutionary mathematics tool, wavelet transform, has already shown its power in image processing. The major topic of this paper, is improve the compresses of still images by Multiwavelet based on estimation the high Multiwavelet coefficients in high frequencies sub band  by interpolation instead of sending all Multiwavelet coefficients. When comparing the proposed approach with other compression methods Good result obtained

Numeral recognition is considered an essential preliminary step for optical character recognition, document understanding, and others. Although several handwritten numeral recognition algorithms have been proposed so far, achieving adequate recognition accuracy and execution time remain challenging to date. In particular, recognition accuracy depends on the features extraction mechanism. As such, a fast and robust numeral recognition method is essential, which meets the desired accuracy by extracting the features efficiently while maintaining fast implementation time. Furthermore, to date most of the existing studies are focused on evaluating their methods based on clean environments, thus limiting understanding of their potential a

Using the Internet, nothing is secure and as we are in need of means of protecting our data, the use of passwords has become important in the electronic world. To ensure that there is no hacking and to protect the database that contains important information such as the ID card and banking information, the proposed system stores the username after hashing it using the 256 hash algorithm and strong passwords are saved to repel attackers using one of two methods: -The first method is to add a random salt to the password using the CSPRNG algorithm, then hash it using hash 256 and store it on the website. -The second method is to use the PBKDF2 algorithm, which salts the passwords and extends them (deriving the password) before being ha

A new data for Fusion power density has been obtained for T-3He and T-T fusion reactions, power density is a substantial term in the researches related to the fusion energy generation and ignition calculations of magnetic confined systems. In the current work, thermal nuclear reactivities, power densities of a fusion reactors and the ignition condition inquiry are achieved by using a new and accurate formula of cross section, the maximum values of fusion power density for T-3He and TT reaction are 1.1×107 W/m3 at T=700 KeV and 4.7×106 W/m3 at T=500 KeV respectively, While Zeff suggested to be 1.44 for the two reactions. Bremsstrahlung radiation has also been determined to reaching self- sustaining reactors, Bremsstrahlung values are 4.5×