Optimization is the task of minimizing or maximizing an objective function f(x) parameterized by x. A series of effective numerical optimization methods have become popular for improving the performance and efficiency of other methods characterized by high-quality solutions and high convergence speed. In recent years, there are a lot of interest in hybrid metaheuristics, where more than one method is ideally combined into one new method that has the ability to solve many problems rapidly and efficiently. The basic concept of the proposed method is based on the addition of the acceleration part of the Gravity Search Algorithm (GSA) model in the Firefly Algorithm (FA) model and creating new individuals. Some standard objective functions are used to compare the hybrid (FAGSA) method with FA and the traditional GSA to find the optimal solution. Simulation results obtained by MATLAB R2015a indicate that the hybrid algorithm has the ability to cross the local optimum limits with a faster convergence than the luminous Fireflies algorithm and the ordinary gravity search algorithm. Therefore, this paper proposes a new numerical optimization method based on integrating the properties of the two methods (luminous fireflies and gravity research). In most cases, the proposed method usually gives better results than the original methods individually.
A novel technique Sumudu transform Adomian decomposition method (STADM), is employed to handle some kinds of nonlinear time-fractional equations. We demonstrate that this method finds the solution without discretization or restrictive assumptions. This method is efficient, simple to implement, and produces good results. The fractional derivative is described in the Caputo sense. The solutions are obtained using STADM, and the results show that the suggested technique is valid and applicable and provides a more refined convergent series solution. The MATLAB software carried out all the computations and graphics. Moreover, a graphical representation was made for the solution of some examples. For integer and fractional order problems, solutio
... Show MoreA novel technique Sumudu transform Adomian decomposition method (STADM), is employed to handle some kinds of nonlinear time-fractional equations. We demonstrate that this method finds the solution without discretization or restrictive assumptions. This method is efficient, simple to implement, and produces good results. The fractional derivative is described in the Caputo sense. The solutions are obtained using STADM, and the results show that the suggested technique is valid and applicable and provides a more refined convergent series solution. The MATLAB software carried out all the computations and graphics. Moreover, a graphical representation was made for the solution of some examples. For integer and fractional order problems, solu
... Show MoreThe tight gas is one of the main types of the unconventional gas. Typically the tight gas reservoirs consist of highly heterogeneous low permeability reservoir. The economic evaluation for the production from tight gas production is very challenging task because of prevailing uncertainties associated with key reservoir properties, such as porosity, permeability as well as drainage boundary. However one of the important parameters requiring in this economic evaluation is the equivalent drainage area of the well, which relates the actual volume of fluids (e.g gas) produced or withdrawn from the reservoir at a certain moment that changes with time. It is difficult to predict this equival
Various theories have been proposed since in last century to predict the first sighting of a new crescent moon. None of them uses the concept of machine and deep learning to process, interpret and simulate patterns hidden in databases. Many of these theories use interpolation and extrapolation techniques to identify sighting regions through such data. In this study, a pattern recognizer artificial neural network was trained to distinguish between visibility regions. Essential parameters of crescent moon sighting were collected from moon sight datasets and used to build an intelligent system of pattern recognition to predict the crescent sight conditions. The proposed ANN learned the datasets with an accuracy of more than 72% in comp
... Show MoreIn this paper, a numerical approximation for a time fractional one-dimensional bioheat equation (transfer paradigm) of temperature distribution in tissues is introduced. It deals with the Caputo fractional derivative with order for time fractional derivative and new mixed nonpolynomial spline for second order of space derivative. We also analyzed the convergence and stability by employing Von Neumann method for the present scheme.
Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. T
... Show MorePattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied o
... Show More