This work implements the face recognition system based on two stages, the first stage is feature extraction stage and the second stage is the classification stage. The feature extraction stage consists of Self-Organizing Maps (SOM) in a hierarchical format in conjunction with Gabor Filters and local image sampling. Different types of SOM’s were used and a comparison between the results from these SOM’s was given.

The next stage is the classification stage, and consists of self-organizing map neural network; the goal of this stage is to find the similar image to the input image. The proposal method algorithm implemented by using C++ packages, this work is successful classifier for a face database consist of 20

 Abstract 

The vegetative filter strips (VFS) are a useful tool used for reducing the movement of sediment and pesticide in therivers. The filter strip’s soil can help in reducing the runoff volume by infiltration. However, the characteristics of VFS (i.e., length) are not recently identified depending on the estimation of VFS modeling performance. The aim of this research is to study these characteristics and determine acorrelation between filter strip length and percent reduction (trapping efficiency) for sediment, water, and pesticide. Two proposed pesticides(one has organic carbon sorption coefficient, K_oc, of 147 L/kg which is more moveable than XXXX, and another one

Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are

In the present paper, three reliable iterative methods are given and implemented to solve the 1D, 2D and 3D Fisher’s equation. Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM) and Banach contraction method (BCM) are applied to get the exact and numerical solutions for Fisher's equations. The reliable iterative methods are characterized by many advantages, such as being free of derivatives, overcoming the difficulty arising when calculating the Adomian polynomial boundaries to deal with nonlinear terms in the Adomian decomposition method (ADM), does not request to calculate Lagrange multiplier as in the Variational iteration method (VIM) and there is no need to create a homotopy like in the Homotopy perturbation method (H

Abstract. In this work, some new concepts were introduced and the relationship between them was studied. These concepts are filter directed-toward, nano-closure-directed-toward and nano-closure-converge to point, and some theories and results about these concepts were presented. A definition almost-nano-converges for set, almost-nano-cluster-point, and definition of quasi-nano-Hausdorff-closed and was also called nano-Hausdorff-closed relative, were also presented several theories related to these definitions were presented and the relationship between them was studied . We also provided other generalizations, including nano closure continuous mappings and it was also called as nano-weaklycontinuous- mappings, as well as providing a definit

We introduce some new generalizations of some definitions which are, supra closure converge to a point, supra closure directed toward a set, almost supra converges to a set, almost supra cluster point, a set supra H-closed relative, supra closure continuous functions, supra weakly continuous functions, supra compact functions, supra rigid a set, almost supra closed functions and supra perfect functions. And we state and prove several results concerning it

In this paper introduce some generalizations of some definitions which are, closure converge to a point, closure directed toward a set, almost ω-converges to a set, almost condensation point, a set ωH-closed relative, ω-continuous functions, weakly ω-continuous functions, ω-compact functions, ω-rigid a set, almost ω-closed functions and ω-perfect functions with several results concerning them.