Image compression has become one of the most important applications of the image processing field because of the rapid growth in computer power. The corresponding growth in the multimedia market, and the advent of the World Wide Web, which makes the internet easily accessible for everyone. Since the early 1980, digital image sequence processing has been an attractive research area because an image sequence, as acollection of images, may provide much compression than a single image frame. The increased computational complexity and memory space required for image sequence processing, has in fact, becoming more attainable. this research absolute Moment Block Truncation compression technique which is depend on adopting the good points of oth

  Recognition is one of the basic characteristics of human brain, and also for the living   creatures. It is possible to recognize images, persons, or patterns according to their characteristics. This recognition could be done using eyes or dedicated proposed methods. There are numerous applications for pattern recognition such as recognition of printed or handwritten letters, for example reading post addresses automatically and reading documents or check reading in bank.

      One of the challenges which faces researchers in character recognition field is the recognition of digits, which are written by hand. This paper describes a classification method for on-line handwrit

The strong cryptography employed by PGP (Pretty Good Privacy) is one of the best available today. The PGP protocol is a hybrid cryptosystem that combines some of the best features of both conventional and public-key cryptography. This paper aim to improve PGP protocol by combined between the Random Genetic algorithm, NTRU (N-th degree Truncated polynomial Ring Unit) algorithm with PGP protocol stages in order to increase PGP protocol speed, security, and make it more difficult in front of the counterfeiter. This can be achieved by use the Genetic algorithm that only generates the keys according to the Random Genetic equations. The final keys that obtained from Genetic algorithm were observed to be purely random (according to the randomne

            In this paper, new method have been investigated using evolving algorithms (EA's) to cryptanalysis one of the nonlinear stream cipher cryptosystems which depends on the Linear Feedback Shift Register (LFSR) unit by using cipher text-only attack. Genetic Algorithm (GA) and Ant Colony Optimization (ACO) which are used for attacking one of the nonlinear cryptosystems called "shrinking generator" using different lengths of cipher text and different lengths of combined LFSRs. GA and ACO proved their good performance in finding the initial values of the combined LFSRs. This work can be considered as a warning for a stream cipher designer to avoid the weak points, which may be f

     In this paper, the propose is to use the xtreme value distribution as the rate of occurrence of the non-homogenous Poisson process, in order to improve the rate of occurrence of the non-homogenous process, which has been called the Extreme value Process. To estimate the parameters of this process, it is proposed to use the Maximum Likelihood method, Method of Moment and a smart method represented by the Artificial Bee Colony:(ABC) algorithm to reach an estimator for this process which represents the best data representation. The results of the three methods are compared through a simulation of the model, and it is concluded that the estimator of (ABC) is better than the estimator of the maximum likelihood method and method of mo

     The work in this paper focuses on solving numerically and analytically a  nonlinear social epidemic model that represents an initial value problem  of ordinary differential equations. A recent moking habit model from Spain is applied and studied here. The accuracy and convergence of the numerical and approximation results are investigated for various methods; for example, Adomian decomposition, variation iteration, Finite difference and Runge-Kutta. The discussion of the present results has been tabulated and graphed. Finally, the comparison between the analytic and numerical solutions from the period 2006-2009 has been obtained by absolute and difference measure error.

Background/Objectives: The purpose of current research aims to a modified image representation framework for Content-Based Image Retrieval (CBIR) through gray scale input image, Zernike Moments (ZMs) properties, Local Binary Pattern (LBP), Y Color Space, Slantlet Transform (SLT), and Discrete Wavelet Transform (DWT). Methods/Statistical analysis: This study surveyed and analysed three standard datasets WANG V1.0, WANG V2.0, and Caltech 101. The features an image of objects in this sets that belong to 101 classes-with approximately 40-800 images for every category. The suggested infrastructure within the study seeks to present a description and operationalization of the CBIR system through automated attribute extraction system premised on CN

This paper includes an experimental study of hydrogen mass flow rate and inlet hydrogen pressure effect on the fuel cell performance. Depending on the experimental results, a model of fuel cell based on artificial neural networks is proposed. A back propagation learning rule with the log-sigmoid activation function is adopted to construct neural networks model. Experimental data resulting from 36 fuel cell tests are used as a learning data. The hydrogen mass flow rate, applied load and inlet hydrogen pressure are inputs to fuel cell model, while the current and voltage are outputs. Proposed model could successfully predict the fuel cell performance in good agreement with actual data. This work is extended to developed fuel cell feedback

Throughout this paper R represents a commutative ring with identity and all R-modules M are unitary left R-modules. In this work we introduce the notion of S-maximal submodules as a generalization of the class of maximal submodules, where a proper submodule N of an R-module M is called S-maximal, if whenever W is a semi essential submodule of M with N ? W ? M, implies that W = M. Various properties of an S-maximal submodule are considered, and we investigate some relationships between S-maximal submodules and some others related concepts such as almost maximal submodules and semimaximal submodules. Also, we study the behavior of S-maximal submodules in the class of multiplication modules. Farther more we give S-Jacobson radical of ri

Throughout this paper R represents a commutative ring with identity and all R-modules M are unitary left R-modules. In this work we introduce the notion of S-maximal submodules as a generalization of the class of maximal submodules, where a proper submodule N of an R-module M is called S-maximal, if whenever W is a semi essential submodule of M with N ⊊ W ⊆ M, implies that W = M. Various properties of an S-maximal submodule are considered, and we investigate some relationships between S-maximal submodules and some others related concepts such as almost maximal submodules and semimaximal submodules. Also, we study the behavior of S-maximal submodules in the class of multiplication modules. Farther more we give S-Jacobson radical of rings