In this research article, an Iterative Decomposition Method is applied to approximate linear and non-linear fractional delay differential equation. The method was used to express the solution of a Fractional delay differential equation in the form of a convergent series of infinite terms which can be effortlessly computable.
The method requires neither discretization nor linearization. Solutions obtained for some test problems using the proposed method were compared with those obtained from some methods and the exact solutions. The outcomes showed the proposed approach is more efficient and correct.

      The aim of this research is to solve a real problem in the Department of Economy and Investment in the Martyrs establishment, which is the selection of the optimal project through specific criteria by experts in the same department using a combined mathematical model for the two methods of analytic hierarchy process and goal programming, where a mathematical model for goal programming was built that takes into consideration the priorities of the goal criteria by the decision-maker to reach the best solution that meets all the objectives, whose importance was determined by the hierarchical analysis process. The most important result of this research is the selection of the second pro

This work is concerned with studying the optimal classical continuous control quaternary vector problem. It is consisted of; the quaternary nonlinear hyperbolic boundary value problem and the cost functional. At first, the weak form of the quaternary nonlinear hyperbolic boundary value problem is obtained. Then under suitable hypotheses, the existence theorem of a unique state quaternary vector solution for the weak form where the classical continuous control quaternary vector is considered known is stated and demonstrated by employing the method of Galerkin and the compactness theorem. In addition, the continuity operator between the state quaternary vector solution of the weak form and the corresponding classical continuous control qua

NeighShrink is an efficient image denoising algorithm based on the discrete wavelet
transform (DWT). Its disadvantage is to use a suboptimal universal threshold and identical
neighbouring window size in all wavelet subbands. Dengwen and Wengang proposed an
improved method, which can determine an optimal threshold and neighbouring window size
for every subband by the Stein’s unbiased risk estimate (SURE). Its denoising performance is
considerably superior to NeighShrink and also outperforms SURE-LET, which is an up-todate
denoising algorithm based on the SURE. In this paper different wavelet transform
families are used with this improved method, the results show that Haar wavelet has the
lowest performance among

This paper deals with the modeling of a preventive maintenance strategy applied to a single-unit system subject to random failures.

According to this policy, the system is subjected to imperfect periodic preventive maintenance restoring it to ‘as good as new’ with probability

p and leaving it at state ‘as bad as old’ with probability q. Imperfect repairs are performed following failures occurring between consecutive

preventive maintenance actions, i.e the times between failures follow a decreasing quasi-renewal process with parameter a. Considering the

average durations of the preventive and corrective maintenance actions a

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.

A three-stage learning algorithm for deep multilayer perceptron (DMLP) with effective weight initialisation based on sparse auto-encoder is proposed in this paper, which aims to overcome difficulties in training deep neural networks with limited training data in high-dimensional feature space. At the first stage, unsupervised learning is adopted using sparse auto-encoder to obtain the initial weights of the feature extraction layers of the DMLP. At the second stage, error back-propagation is used to train the DMLP by fixing the weights obtained at the first stage for its feature extraction layers. At the third stage, all the weights of the DMLP obtained at the second stage are refined by error back-propagation. Network structures an

The paper present design of a control structure that enables integration of a Kinematic neural controller for trajectory tracking of a nonholonomic differential two wheeled mobile robot, then  proposes a Kinematic neural controller to direct a National Instrument mobile robot (NI Mobile Robot). The controller is to make the actual velocity of the wheeled mobile robot close the required velocity by guarantees that the trajectory tracking mean squire error converges at minimum tracking error. The proposed tracking control system consists of two layers; The first layer is a multi-layer perceptron neural network system that controls the mobile robot to track the required path , The second layer is an optimization layer ,which is impleme