A remarkable correlation between chaotic systems and cryptography has been established with sensitivity to initial states, unpredictability, and complex behaviors. In one development, stages of a chaotic stream cipher are applied to a discrete chaotic dynamic system for the generation of pseudorandom bits. Some of these generators are based on 1D chaotic map and others on 2D ones. In the current study, a pseudorandom bit generator (PRBG) based on a new 2D chaotic logistic map is proposed that runs side-by-side and commences from random independent initial states. The structure of the proposed model consists of the three components of a mouse input device, the proposed 2D chaotic system, and an initial permutation (IP) table. Statist

Disease diagnosis with computer-aided methods has been extensively studied and applied in diagnosing and monitoring of several chronic diseases. Early detection and risk assessment of breast diseases based on clinical data is helpful for doctors to make early diagnosis and monitor the disease progression. The purpose of this study is to exploit the Convolutional Neural Network (CNN) in discriminating breast MRI scans into pathological and healthy. In this study, a fully automated and efficient deep features extraction algorithm that exploits the spatial information obtained from both T2W-TSE and STIR MRI sequences to discriminate between pathological and healthy breast MRI scans. The breast MRI scans are preprocessed prior to the feature

Protecting information sent through insecure internet channels is a significant challenge facing researchers. In this paper, we present a novel method for image data encryption that combines chaotic maps with linear feedback shift registers in two stages. In the first stage, the image is divided into two parts. Then, the locations of the pixels of each part are redistributed through the random numbers key, which is generated using linear feedback shift registers. The second stage includes segmenting the image into the three primary colors red, green, and blue (RGB); then, the data for each color is encrypted through one of three keys that are generated using three-dimensional chaotic maps. Many statistical tests (entropy, peak signa

Offline Arabic handwritten recognition lies in a major field of challenge due to the changing styles of writing from one individual to another. It is difficult to recognize the Arabic handwritten because of the same appearance of the different characters.  In this paper a proposed method for Offline Arabic handwritten recognition. The   proposed method for recognition hand-written Arabic word without segmentation to sub letters based on feature extraction scale invariant feature transform (SIFT) and   support vector machines (SVMs) to enhance the recognition accuracy. The proposed method  experimented using (AHDB) database. The experiment result  show  (99.08) recognition  rate.

A proposed feature extraction algorithm for handwriting Arabic words. The proposed method uses a 4 levels discrete wavelet transform (DWT) on binary image. sliding window on wavelet space and computes the stander derivation for each window. The extracted features were classified with multiple Support Vector Machine (SVM) classifiers. The proposed method simulated with a proposed data set from different writers. The experimental results of the simulation show 94.44% recognition rate.

In this paper, the C̆ech fuzzy soft closure spaces are defined and their basic properties are studied. Closed (respectively, open) fuzzy soft sets is defined in C̆ech fuzzy-soft closure spaces. It has been shown that for each C̆ech fuzzy soft closure space there is an associated fuzzy soft topological space. In addition, the concepts of a subspace and a sum are defined in C̆ech fuzzy soft closure space. Finally, fuzzy soft continuous (respectively, open and closed) mapping between C̆ech fuzzy soft closure spaces are introduced. Mathematics Subject Classification: 54A40, 54B05, 54C05.

  In this paper it was presented the idea quasi-fully cancellation fuzzy modules and we will denote it by  Q-FCF(M), condition universalistic idea quasi-fully cancellation modules It .has been circulated to this idea quasi-max fully cancellation fuzzy modules and we will denote it by Q-MFCF(M). Lot of results and properties have been studied in this research.

In this paper the chain length of a space of fuzzy orderings is defined, and various properties of this invariant are proved. The structure theorem for spaces of finite chain length is proved. Spaces of Fuzzy Orderings Throughout X = (X,A) denoted a space of fuzzy orderings. That is, A is a fuzzy subgroup of abelian group G of exponent 2. (see [1] (i.e. x 2 = 1,  x  G), and X is a (non empty) fuzzy subset of the character group  (A) = Hom(A,{1,–1}) satisfying: 1. X is a fuzzy closed subset of  (A). 2.  an element e  A such that (e) = – 1    X. 3. X :={a  A\ (a) = 1    X} = 1. 4. If f and g are forms over A and if x  D(

    Urinary tract infections (UTI) are some of the most common infections experienced by humans, exceeded in frequency among ambulatory patient only by respiratory and gastrointestinal infections. It is also the most common cause of nosocomial infection in adults.   A total of three hundred urine sample were collected in age (1-69 years old)   in both gender, with (UTI) symptoms referred to AL-Yarmok Teaching Hospital at Baghdad city during the period from January 2010 till August 2010.  The commonest isolates were Escherichia coli (E.Coli), Proteus mirabilis and Klebsiella pneumoniae (These represented 49.2%, 22 %, and16 % of isolates respectively). The percentage of bacteria incidence in females