Identification by biological features gets tremendous importance with the increasing of security systems in society. Various types of biometrics like face, finger, iris, retina, voice, palm print, ear and hand geometry, in all these characteristics, iris recognition gaining attention because iris of every person is unique, it never changes during human lifetime and highly protected against damage. This unique feature shows that iris can be good security measure. Iris recognition system listed as a high confidence biometric identification system; mostly it is divide into four steps: Acquisition, localization, segmentation and normalization. This work will review various Iris Recognition systems used by different researchers for each recognit

In this research work, some low complexity and efficient cryptanalysis approaches are proposed to decrypt password (encryption keys). Passwords are still one of the most common means of securing computer systems. Most organizations rely on password authentication systems, and therefore, it is very important for them to enforce their users to have strong passwords. They usually ignore the importance of usability of the password for the users. The more complex they are the more they frustrate users and they end up with some coping strategies such as adding “123” at the end of their passwords or repeating a word to make their passwords longer, which reduces the security of the password, and more importantly there is no scientific basis

Metaheuristic is one of the most well-known fields of research used to find optimum solutions for non-deterministic polynomial hard (NP-hard) problems, for which it is difficult to find an optimal solution in a polynomial time. This paper introduces the metaheuristic-based algorithms and their classifications and non-deterministic polynomial hard problems. It also compares the performance of two metaheuristic-based algorithms (Elephant Herding Optimization algorithm and Tabu Search) to solve the Traveling Salesman Problem (TSP), which is one of the most known non-deterministic polynomial hard problems and widely used in the performance evaluations for different metaheuristics-based optimization algorithms. The experimental results of Ele

This paper deals with the thirteenth order differential equations linear and nonlinear in boundary value problems by using the Modified Adomian Decomposition Method (MADM), the analytical results of the equations have been obtained in terms of convergent series with easily computable components. Two numerical examples results show that this method is a promising and powerful tool for solving this problems.

Let 


 
, 1
( )
1 2 ,
( , ) 1 2
m n
s s
m n
f s s a e m n   , (s   it , j 1,2) j j j  ,  
m 1  and
 
n 1  being an increasing sequences of positive numbers and a E m n  , where E
is Banach algebra, represent a vector valued entire Dirichlet functions in two
variables. The space  of all such entire functions having order at most equal to 
is considered in this paper. A metric topology using the growth parameters of f is
defined on  and its various properties are obtained. The form of linear operator on
the space  is characterized and proper bases are also characterized in terms of
growth parameters  .

Brachytherapy treatment is primarily used for the certain handling kinds of cancerous tumors. Using radionuclides for the study of tumors has been studied for a very long time, but the introduction of mathematical models or radiobiological models has made treatment planning easy. Using mathematical models helps to compute the survival probabilities of irradiated tissues and cancer cells. With the expansion of using HDR-High dose rate Brachytherapy and LDR-low dose rate Brachytherapy for the treatment of cancer, it requires fractionated does treatment plan to irradiate the tumor. In this paper, authors have discussed dose calculation algorithms that are used in Brachytherapy treatment planning. Precise and less time-consuming calculations

A new two-way nesting technique is presented for a multiple nested-grid ocean modelling system. The new technique uses explicit center finite difference and leapfrog schemes to exchange information between the different subcomponents of the nested-grid system. The performance of the different nesting techniques is compared, using two independent nested-grid modelling systems. In this paper, a new nesting algorithm is described and some preliminary results are demonstrated. The validity of the nesting method is shown in some problems for the depth averaged of 2D linear shallow water equation.

In this paper, we suggest a descent modification of the conjugate gradient method which converges globally provided that the exact minimization condition is satisfied. Preliminary numerical experiments on some benchmark problems show that the method is efficient and promising.