In this paper, the homotopy perturbation method (HPM) is presented for treating a linear system of second-kind mixed Volterra-Fredholm integral equations. The method is based on constructing the series whose summation is the solution of the considered system. Convergence of constructed series is discussed and its proof is given; also, the error estimation is obtained. Algorithm is suggested and applied on several examples and the results are computed by using MATLAB (R2015a). To show the accuracy of the results and the effectiveness of the method, the approximate solutions of some examples are compared with the exact solution by computing the absolute errors.

In this paper, the homotopy perturbation method is presented for solving the second kind linear mixed Volterra-Fredholm integral equations. Then, Aitken method is used to accelerate the convergence. In this method, a series will be constructed whose sum is the solution of the considered integral equation. Convergence of the constructed series is discussed, and its proof is given; the error estimation is also obtained. For more illustration, the method is applied on several examples and programs, which are written in MATLAB (R2015a) to compute the results. The absolute errors are computed to clarify the efficiency of the method.

 

    The combination of wavelet theory and neural networks has lead to the development of wavelet networks. Wavelet networks are feed-forward neural networks using wavelets as activation function. Wavelets networks have been used in classification and identification problems with some success.

  In this work we proposed a fuzzy wavenet network (FWN), which learns by common back-propagation algorithm to classify medical images. The library of medical image has been analyzed, first. Second, Two experimental tables’ rules provide an excellent opportunity to test the ability of fuzzy wavenet network due to the high level of information variability often experienced with this type of images.

&n

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.

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho

This paper include the problem of segmenting an image into regions represent (objects), segment this object by define boundary between two regions using a connected component labeling. Then develop an efficient segmentation algorithm based on this method, to apply the algorithm to image segmentation using different kinds of images, this algorithm consist four steps at the first step convert the image gray level the are applied on the image, these images then in the second step convert to binary image, edge detection using Canny edge detection in third Are applie the final step is images. Best segmentation rates are (90%) obtained when using the developed algorithm compared with (77%) which are obtained using (ccl) before enhancement.

In this study, an unknown force function dependent on the space in the wave equation is investigated. Numerically wave equation splitting in two parts, part one using the finite-difference method (FDM). Part two using separating variables method. This is the continuation and changing technique for solving inverse problem part in (1,2). Instead, the boundary element method (BEM) in (1,2), the finite-difference method (FDM) has applied. Boundary data are in the role of overdetermination data. The second part of the problem is inverse and ill-posed, since small errors in the extra boundary data cause errors in the force solution. Zeroth order of Tikhonov regularization, and several parameters of regularization are employed to decrease error

     The variational iteration method is used to deal with linear and nonlinear differential equations. The main characteristics of the method lie in its flexibility and ability to accurately and easily solve nonlinear equations. In this work, a general framework is presented for a variational iteration method for the analytical treatment of partial differential equations in fluid mechanics. The Caputo sense is used to describe fractional derivatives. The time-fractional Kaup-Kupershmidt (KK) equation is investigated, as it is the solution of the system of partial differential equations via the Boussinesq-Burger equation. By comparing the results that are obtained by the variational iteration method with those obtained by the two-dim

A new modified differential evolution algorithm DE-BEA, is proposed to improve the reliability of the standard DE/current-to-rand/1/bin by implementing a new mutation scheme inspired by the bacterial evolutionary algorithm (BEA). The crossover and the selection schemes of the DE method are also modified to fit the new DE-BEA mechanism. The new scheme diversifies the population by applying to all the individuals a segment based scheme that generates multiple copies (clones) from each individual one-by-one and applies the BEA segment-wise mechanism. These new steps are embedded in the DE/current-to-rand/bin scheme. The performance of the new algorithm has been compared with several DE variants over eighteen benchmark functions including sever