The aim of this research is to enhance the accuracy biometric palm print identification by using Novel ResNet50 Algorithm as compared X Gradient Boosting. Materials and Methods: In study, Boosting algorithms were a sample size 10 for each algorithm, resulting in total 20. comparison was carried out with G Power 0.8 confidence interval (CI) 95% ensure statistical significance. For study Birjand ...

in this study, a three–layer artificial neural network (ann) model was developed to predict the pressure gradient in horizontal liquid–liquid separated flow. a total of 455 data points were collected from 13 data sources to develop the ann model. superficial velocities, viscosity ratio and density ratio of oil to water, and roughness and inner diameter of pipe were used as input parameters of t...

The main aim of the present study is to propose a modified harmony search (MHS) algorithm for size and shape optimization of structures. The standard harmony search (HS) algorithm is conceptualized using the musical process of searching for a perfect state of the harmony. It uses a stochastic random search instead of a gradient search. The proposed MHS algorithm is designed based on elitism. In...

We present a new algorithm to perform blind signal separation (BSS), which takes a trade-off between the ordinary gradient infomax algorithm and the natural gradient infomax algorithm. Analyzing the algorithm, we show that desired equilibrium points are locally stable by choosing appropriate score functions and step sizes. The algorithm provides better performance than the ordinary gradient alg...

A nonlinear conjugate gradient algorithm which is a modification of the Dai and Yuan [Y.H. Dai and Y, Yuan, A nonlinear conjugate gradient method with a strong global convergence property, SIAM J. Optim., 10 (1999), pp.177-182.] conjugate gradient algorithm satisfying a parametrized sufficient descent condition with a parameter k δ is proposed. The parameter k δ is computed by means of the conj...

It is well known that the gradient-projection algorithm GPA is very useful in solving constrained convex minimization problems. In this paper, we combine a general iterative method with the gradient-projection algorithm to propose a hybrid gradient-projection algorithm and prove that the sequence generated by the hybrid gradient-projection algorithm converges in norm to a minimizer of constrain...