18 papers · ranked by Valyu relevance
Wan-li Xiang, Xue-lei Meng, Mei-qing An, Yin-zhen Li + 1 more
Differential evolution algorithm is a simple yet efficient metaheuristic for global optimization over continuous spaces. However, there is a shortcoming of premature convergence in standard DE, especially in DE/best/1/bin. In order to take advantage of direction guidance information of the best individual of…
Necmettin Kaya
The objective of this study is to design rubber bushing at desired level of stiffness characteristics in order to achieve the ride quality of the vehicle. A differential evolution algorithm based approach is developed to optimize the rubber bushing through integrating a finite element code running in batch mode to…
Kai Yit Kok, Parvathy Rajendran, Xiaosong Hu
The differential evolution algorithm has been widely applied on unmanned aerial vehicle (UAV) path planning. At present, four random tuning parameters exist for differential evolution algorithm, namely, population size, differential weight, crossover, and generation number. These tuning parameters are required…
Jin-Yu Zhang, Xiang-Bing Meng, Wei Xu, Wei Zhang + 1 more
This paper has proposed a new thermal wave image sequence compression algorithm by combining double exponential decay fitting model and differential evolution algorithm. This study benchmarked fitting compression results and precision of the proposed method was benchmarked to that of the traditional methods via…
Yuanyuan Zhang, Longquan Yong, Yijia Chen, Jintao Yang + 2 more
'Mengnan Zhang' 'Heming Jia'] To address the issues of uneven initial distribution and limited search accuracy with the traditional divergent quantum-inspired differential search (DCS) algorithm, a hybrid multi-strategy variant, termed DQDCS, is proposed. This improved version overcomes these limitations by integrating…
Joan Daemen, Daniël Kuijsters, Silvia Mella, Denise Verbakel
Many modern cryptographic primitives for hashing and (authenticated) encryption make use of constructions that are instantiated with an iterated cryptographic permutation that operates on a fixed-width state consisting of an array of bits. Often, such permutations are the repeated application of a relatively simple…
Guangjie Wang, Xiaoqun Cao, Xun Cai, Jingzhe Sun + 3 more
'Heng Wang' 'Jun Ma'] In the variational data assimilation (VarDA), the typical way for gradient computation is using the adjoint method. However, the adjoint method has many problems, such as low accuracy, difficult implementation and considerable complexity, for high-dimensional models. To overcome these…
Alexander Pikovski, Dennis Salahub
A method for obtaining discretization formulas for the derivatives of a function is presented, which relies on a generalization of divided differences. These modified divided differences essentially correspond to a change of the dependent variable. This method is applied to the numerical solution of the eigenvalue…
Pawan Mishra, Musrrat Ali, Pooja, Safiqul Islam + 1 more
Differential evolution (DE) stands out as a prominent algorithm for addressing global optimization challenges. The efficacy of DE hinges crucially upon its mutation operation, which serves as a pivotal mechanism in generating diverse and high-quality solutions. This article explores various mutation operations aimed at…
Maneesha Gupta, Richa Yadav
Different evolutionary algorithms (EAs), namely, particle swarm optimization (PSO), genetic algorithm (GA), and PSO-GA hybrid optimization, have been used to optimize digital differential operators so that these can be better fitted to exemplify their new improved fractional order differentiator counterparts. First…
Ireneusz Gościniak, Krzysztof Gdawiec
There is a huge group of algorithms described in the literature that iteratively find solutions of a given equation. Most of them require tuning. The article presents root-finding algorithms that are based on the Newton-Raphson method which iteratively finds the solutions, and require tuning. The modification of the…
Vahid Tavakkoli, Jean Chamberlain Chedjou, Kyandoghere Kyamakya
The concept presented in this paper is based on previous dynamical methods to realize a time-varying matrix inversion. It is essentially a set of coupled ordinary differential equations (ODEs) which does indeed constitute a recurrent neural network (RNN) model. The coupled ODEs constitute a universal modeling framework…
Xinyu Cai, Chaoyong Zhang, Heming Jia, Gang Hu
In real-world applications, many complex problems can be formulated as mathematical optimization challenges, and efficiently solving these problems is critical. Metaheuristic algorithms have proven highly effective in addressing a wide range of engineering issues. The differentiated creative search is a recently…
Jann Paul Mattern, Christopher A. Edwards, Christopher N. Hill, Krishna Garikipati
'Krishna Garikipati'] Dual numbers allow for automatic, exact evaluation of the numerical derivative of high-dimensional functions at an arbitrary point with minimal coding effort. We use dual numbers to construct tangent linear and adjoint model code for a biogeochemical ocean model and apply it to a variational…
K. V. Zhukovsky
We propose operational method with recourse to generalized forms of orthogonal polynomials for solution of a variety of differential equations of mathematical physics. Operational definitions of generalized families of orthogonal polynomials are used in this context. Integral transforms and the operational exponent…
Rajendra Pant, Geeta Arora, Homan Emadifar, Luan Carlos de Sena Monteiro Ozelim
The time-fractional order differential equations are used in many different contexts to analyse the integrated scientific phenomenon. Hence these equations are the point of interest of the researchers. In this work, the diffusion equation for a one-dimensional time-fractional order is solved using a combination of…
Yuyong Tan, Jianfeng Wang, Bin Wang, Yongquan Zhou
The intelligent optimization algorithm has become a key tool in complex and intertwined engineering and science fields. However, with the increasing complexity of the problem and the rapid expansion of the data scale, the performance of the algorithm has been challenged unprecedentedly. The artificial lemming algorithm…
Vitaly Kober
Short-time (sliding) transform based on discrete Hartley transform (DHT) is often used to estimate the power spectrum of a quasi-stationary process such as speech, audio, radar, communication, and biomedical signals. Sliding transform calculates the transform coefficients of the signal in a fixed-size moving window. In…