The focus of this article, reviewed a generalized  of contraction mapping and nonexpansive maps and recall some theorems about the existence and uniqueness of common fixed point and coincidence fixed-point for such maps under some conditions. Moreover, some schemes of different types as one-step schemes ,two-step schemes and three step schemes (Mann scheme algorithm, Ishukawa scheme algorithm, noor scheme algorithm, .scheme algorithm,  scheme algorithm Modified  scheme algorithm arahan scheme algorithm and others. The convergence of these schemes has been studied .On the other hands, We also reviewed the convergence, valence and stability theories of different types of near-plots in convex metric space.

Our goal in this work is to describe the structure of a class of bimodal self maps on the compact real interval I with zero topological entropy and transitive.

 

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

Aspect-Oriented Software Development (AOSD) is a technology that helps achieving
better Separation of Concern (SOC) by providing mechanisms to identify all relevant points
in a program at which aspectual adaptations need to take place. This paper introduces a
banking application using of AOSD with security concern in information hiding.

     In this paper a design of new robust and dynamic cryptosystem using stream key generator with good random statistical properties is introduced. The results of the statistical tests, initialization and the components of the proposed generator of the suggested cryptosystem are detailed in [1]. The proposed cryptosystem called Robust and Efficient Dynamic Stream Cipher Cryptosystem (RDSCC). The dynamic here means the generator of RDSCC has unfixed construction; the design will be changed as the seed (initial) key changed. The generator will construct itself by barrows number of Linear Feedback Shift Registers (LFSR’s), randomly, stored in protected bank file. The RDSCC is constructed to be flexibl

This paper presents a hybrid software copy protection scheme, the scheme is applied to
prevent illegal copying of software by produce a license key which is unique and easy to
generate. This work employs the uniqueness of identification of hard disk in personal
computer which can get by software to create a license key after treated with SHA-1 one way
hash function. Two mean measures are used to evaluate the proposed method, complexity
and processing time, SHA-1 can insure the high complexity to deny the hackers for produce
unauthorized copies, many experiments have been executed using different sizes of software
to calculate the consuming time. The measures show high complexity and short execution
time for propos