This paper presents a hybrid metaheuristic algorithm which is Harmony-Scatter Search (HSS). The HSS provides Scatter Search (SS) with random exploration for search space of problem and more of diversity and intensification for promising solutions. The SS and HSS have been tested on Traveling Salesman Problem. A computational experiment with benchmark instances is reported. The results demonstrate that the HSS algorithm produce better performance than original Scatter Search algorithm. The HSS in the value of average fitness is 27.6% comparing with original SS. In other hand the elapsed time of HSS is larger than the original SS by small value. The developed algorithm has been compared with other algorithms for the same problem, and the result was competitive with some algorithm and insufficient with another.
This paper introduces a relation between resultant and the Jacobian determinant
by generalizing Sakkalis theorem from two polynomials in two variables to the case of (n) polynomials in (n) variables. This leads us to study the results of the type: , and use this relation to attack the Jacobian problem. The last section shows our contribution to proving the conjecture.
We study one example of hyperbolic problems it's Initial-boundary string problem with two ends. In fact we look for the solution in weak sense in some sobolev spaces. Also we use energy technic with Galerkin's method to study some properties for our problem as existence and uniqueness
In this article, the inverse source problem is determined by the partition hyperbolic equation under the left end flux tension of the string, where the extra measurement is considered. The approximate solution is obtained in the form of splitting and applying the finite difference method (FDM). Moreover, this problem is ill-posed, dealing with instability of force after adding noise to the additional condition. To stabilize the solution, the regularization matrix is considered. Consequently, it is proved by error estimates between the regularized solution and the exact solution. The numerical results show that the method is efficient and stable.
This paper devoted to the analysis of regular singular boundary value problems for ordinary differential equations with a singularity of the different kind , we propose semi - analytic technique using two point osculatory interpolation to construct polynomial solution, and discussion behavior of the solution in the neighborhood of the regular singular points and its numerical approximation. Many examples are presented to demonstrate the applicability and efficiency of the methods. Finally , we discuss behavior of the solution in the neighborhood of the singularity point which appears to perform satisfactorily for singular problems.
Iron oxide(Fe3O4) nanoparticles of different sizes and shapes were synthesized by solve-hydrothermal reaction assisted by microwave irradiation using ferrous ammonium sulfate as a metal precursor, oleic acid as dispersing agent, ethanol as reducing agent and NaOH as precipitating agent at pH=12. The synthesized Fe3O4 nano particles were characterized by X-ray diffraction (XRD), FTIR and thermal analysis TG-DTG. Sizes and shapes of Fe3O4 nanoparticles were characterized by Scanning Electron Microscopy (SEM), and atomic force microscopy (AFM).
In this paper, a computational method for solving optimal problem is presented, using indirect method (spectral methodtechnique) which is based on Boubaker polynomial. By this method the state and the adjoint variables are approximated by Boubaker polynomial with unknown coefficients, thus an optimal control problem is transformed to algebraic equations which can be solved easily, and then the numerical value of the performance index is obtained. Also the operational matrices of differentiation and integration have been deduced for the same polynomial to help solving the problems easier. A numerical example was given to show the applicability and efficiency of the method. Some characteristics of this polynomial which can be used for solvin
... Show MoreThe performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul
... Show MoreOne of the most important and common problems in petroleum engineering; reservoir, and production engineering is coning; either water or gas coning. Almost 75% of the drilled wells worldwide contains this problem, and in Iraq water coning problem is much wider than the gas coning problem thus in this paper we try to clarify most of the reasons causing water coning and some of applicable solutions to avoid it using the simulation program (CMG Builder) to build a single well model considering an Iraqi well in north of Iraq black oil field with a bottom water drive, Coning was decreased by 57% by dividing into sub-layers (8) layers rather than (4) layers, also it was decreased (Coning) by 45% when perforation numbers and positions was chang
... Show More