Crow Search Algorithm (CSA) can be defined as one of the new swarm intelligence algorithms that has been developed lately, simulating the behavior of a crow in a storage place and the retrieval of the additional food when required. In the theory of the optimization, a crow represents a searcher, the surrounding environment represents the search space, and the random storage of food location represents a feasible solution. Amongst all the food locations, the one where the maximum amount of the food is stored is considered as the global optimum solution, and objective function represents the food amount. Through the simulation of crows’ intelligent behavior, the CSA attempts to find the optimum solutions to a variety of the problems that are related to the optimization. This study presents a new adaptive distributed algorithm of routing on CSA. Because the search space may be modified according to the size and kind of the network, the algorithm can be easily customized to the issue space. In contrast to population-based algorithms that have a broad and time-consuming search space. For ten networks of various sizes, the technique was used to solve the shortest path issue. And its capability for solving the problem of the routing in the switched networks is examined: detecting the shortest path in the process of a data packet transfer amongst the networks. The suggested method was compared with four common metaheuristic algorithms (which are: ACO, AHA, PSO and GA) on 10 datasets (integer, weighted, and not negative graphs) with a variety of the node sizes (10 - 297 nodes). The results have proven that the efficiency of the suggested methods is promising as well as competing with other approaches.
In this paper, the exact solutions of the Schlömilch’s integral equation and its linear and non-linear generalized formulas with application are solved by using two efficient iterative methods. The Schlömilch’s integral equations have many applications in atmospheric, terrestrial physics and ionospheric problems. They describe the density profile of electrons from the ionospheric for awry occurrence of the quasi-transverse approximations. The paper aims to discuss these issues.
First, the authors apply a regularization meth
The basic goal of this research is to utilize an analytical method which is called the Modified Iterative Method in order to gain an approximate analytic solution to the Sine-Gordon equation. The suggested method is the amalgamation of the iterative method and a well-known technique, namely the Adomian decomposition method. A method minimizes the computational size, averts round-off errors, transformation and linearization, or takes some restrictive assumptions. Several examples are chosen to show the importance and effectiveness of the proposed method. In addition, a modified iterative method gives faster and easier solutions than other methods. These solutions are accurate and in agreement with the series
... Show MoreIn this paper, a new class of ordinary differential equations is designed for some functions such as probability density function, cumulative distribution function, survival function and hazard function of power function distribution, these functions are used of the class under the study. The benefit of our work is that the equations ,which are generated from some probability distributions, are used to model and find the solutions of problems in our lives, and that the solutions of these equations are a solution to these problems, as the solutions of the equations under the study are the closest and the most reliable to reality. The existence and uniqueness of solutions the obtained equations in the current study are dis
... Show MoreIn this paper, new approach based on coupled Laplace transformation with decomposition method is proposed to solve type of partial differential equation. Then it’s used to find the accurate solution for heat equation with initial conditions. Four examples introduced to illustrate the accuracy, efficiency of suggested method. The practical results show the importance of suggested method for solve differential equations with high accuracy and easy implemented.
In this paper, a general expression formula for the Boubaker scaling (BS) operational matrix of the derivative is constructed. Then it is used to study a new parameterization direct technique for treating calculus of the variation problems approximately. The calculus of variation problems describe several important phenomena in mathematical science. The first step in our suggested method is to express the unknown variables in terms of Boubaker scaling basis functions with unknown coefficients. Secondly, the operational matrix of the derivative together with some important properties of the BS are utilized to achieve a non-linear programming problem in terms of the unknown coefficients. Finally, the unknown parameters are obtaine
... Show MoreThe regressor-based adaptive control is useful for controlling robotic systems with uncertain parameters but with known structure of robot dynamics. Unmodeled dynamics could lead to instability problems unless modification of control law is used. In addition, exact calculation of regressor for robots with more than 6 degrees of freedom is hard to be calculated, and the task could be more complex for robots. Whereas the adaptive approximation control is a powerful tool for controlling robotic systems with unmodeled dynamics. The local (partitioned) approximation-based adaptive control includes representation of the uncertain matrices and vectors in the robot model as finite combinations of basis functions. Update laws for the weighting matri
... Show MoreIn this paper, a new method of selection variables is presented to select some essential variables from large datasets. The new model is a modified version of the Elastic Net model. The modified Elastic Net variable selection model has been summarized in an algorithm. It is applied for Leukemia dataset that has 3051 variables (genes) and 72 samples. In reality, working with this kind of dataset is not accessible due to its large size. The modified model is compared to some standard variable selection methods. Perfect classification is achieved by applying the modified Elastic Net model because it has the best performance. All the calculations that have been done for this paper are in
Astronomers have known since the invention of the telescope that atmospheric turbulence affects celestial images. So, in order to compensate for the atmospheric aberrations of the observed wavefront, an Adaptive Optics (AO) system has been introduced. The AO can be arranged into two systems: closedloop and open-loop systems. The aim of this paper is to model and compare the performance of both AO loop systems by using one of the most recent Adaptive Optics simulation tools, the Objected-Oriented Matlab Adaptive Optics (OOMAO). Then assess the performance of closed and open loop systems by their capabilities to compensate for wavefront aberrations and improve image quality, also their effect by the observed optical bands (near-infrared band
... Show More