Face Identification is an important research topic in the field of computer vision and pattern recognition and has become a very active research area in recent decades. Recently multiwavelet-based neural networks (multiwavenets) have been used for function approximation and recognition, but to our best knowledge it has not been used for face Identification. This paper presents a novel approach for the Identification of human faces using Back-Propagation Adaptive Multiwavenet. The proposed multiwavenet has a structure similar to a multilayer perceptron (MLP) neural network with three layers, but the activation function of hidden layer is replaced with multiscaling functions. In experiments performed on the ORL face database it achieved a

Face Identification is an important research topic in the field of computer vision and pattern recognition and has become a very active research area in recent decades. Recently multiwavelet-based neural networks (multiwavenets) have been used for function approximation and recognition, but to our best knowledge it has not been used for face Identification. This paper presents a novel approach for the Identification of human faces using Back-Propagation Adaptive Multiwavenet. The proposed multiwavenet has a structure similar to a multilayer perceptron (MLP) neural network with three layers, but the activation function of hidden layer is replaced with multiscaling functions. In experiments performed on the ORL face database it achieved a

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh