Yuanlong Wang; M. Tadi

This paper is concerned with inverse evaluation of the wavenumber for a Helmholtz equation. It is assumed that the wavenumber is composed of a known uniform background and an unknown separable part. This function can closely model an unhealthy abnormality in a healthy domain. The algorithm assumes an initial guess for the unknown perturbation part and obtains corrections to the guessed value. Numerical results indicate that the algorithm can recover close estimates of the unknown wavenumber based on boundary measurements.]]>

Fahong Yu; Wenping Li; Jiang Tao; Kun Deng; Longhua Ma; Feng He

To track the optima in dynamic environments with estimation of distribution algorithm, maintenance of the diversity of the population is an essential requirement. Taking this point into consideration, this paper proposes an estimation of distribution algorithm combined with a chaotic sequence (CEDA) for dynamic optimisation problems. In CEDA, a chaotic sequence is introduced to maintain the diversity of population and enhance improve the local search ability. Many numerical experiments are reported in order to compare the performance of the CEDA with the self-adaptive approach by other authors. The numerical results show that the performance of our algorithm is superior to that of other published algorithms on two dynamic benchmark problems.]]>

Adel Ouannas; Ahmad Taher Azar; Sundarapandian Vaidyanathan

In this paper, the problem of Q-S synchronisation for arbitrary dimensional chaotic dynamical systems in continuous-time is investigated. Based on nonlinear control method, we would like to present a constructive scheme to study the Q-S synchronisation between n-dimensional master chaotic system and m-dimensional slave chaotic system in arbitrary dimension. The new derived synchronisation result is proved using Lyapunov stability theory. In order to verify the effectiveness of the proposed method, our approach is applied to some typical chaotic systems and numerical simulations are given to validate the derived results. ]]>

Liang Chen; Chong Zhou; Xiangping Li; Guangming Dai

In order to improve the drawbacks of DE algorithm with DE/best/1 such as the rapid convergence speed and local optimum, this paper proposes an improved DE algorithm. Based on the DE/best/1 mutation operator, a new mutation operator is constructed. The best M individuals are summed as a new individual to replace the base individual of the DE/best/1. This is helpful to avoid falling into local optimum for the fast convergence. Simulation experiments demonstrate that the proposed algorithm outperforms some standard DE variants.]]>

Ali Belhocine

The present set of themes related to the investigations of heat transfer by convection and the transport phenomenon in a cylindrical pipe in laminar flow, is commonly called the Graetz problem, which is to explore the evolution of the temperature profile for a fluid flow in fully developed laminar flow. A numerical method was developed in this work, for visualisation of the temperature profile in the fluid flow, whose strategy of calculation is based on the orthogonal collocation method followed by the finite difference method (Crank-Nicholson method). The calculations were effected through a FORTRAN computer program and the results show that orthogonal collocation method giving better results than Crank-Nicholson method.]]>

Zhe Li; Gongfa Li; Ying Sun; Guozhang Jiang; Jianyi Kong; Honghai Liu

Articulated robot is now widely employed in manufacture, such as, welding, painting, and assembly, with high precision and endurance. It plays an important role in scientific and technological innovation. Trajectory planning of articulated robot is one of the key researches in industrial robot. The commonly used trajectory planning algorithm of articulated robot, such as, polynomial interpolation algorithm in joint space and linear interpolation in Cartesian space are introduced. Researches on articulated robot trajectory planning are surveyed. Meanwhile these articulated robot trajectory planning algorithms are analysed. Some further researches and developing trend of articulated robot trajectory planning are indicated.]]>

Md. Shafiqul Islam; Kamruzzaman Khan; M. Ali Akbar

The improved F-expansion is one of the furthermost effective algebraic methods for finding the exact travelling wave solutions of nonlinear evolution equations (NLEEs) in mathematical physics. In this paper, we seek out the new exact travelling wave solutions of (3 + 1)-dimensional potential Yu-Toda-Sasa-Fukuyama (YTSF) equation through the improved F-expansion method. The attained solutions are conveyed in terms of hyperbolic, trigonometric and rational functions including solitary and periodic solutions which have numerous prospective applications in physical science and engineering. In addition, the properties of these NLEEs are displayed with some figures.]]>

Changcheng Wei; Juanyan Fang; Yanting Wei

This article discusses a class SIQS epidemic model with constant input and nonlinear incidence, puts forward the equilibrium model and demonstrates the globally asymptotic stability of disease-free equilibrium and the endemic equilibrium.]]>

Manjit Singh

Based on Hirota's technique we have obtained two forms of bilinear Bäcklund transformations for (3+1)-dimensional generalised Kadomtsev-Petviashvili equation which are not reported before. The first form involves five arbitrary parameters and second form involves eight arbitrary parameters. In addition to this, the exponential and stationary rational wave solutions are also obtained by proposed bilinear Bäcklund transformations.]]>

Hongyuan Gao; Yanan Du; Ming Diao

In order to solve discrete optimisation problem, a novel intelligence algorithm called as quantum-inspired glowworm swarm optimisation (QGSO) is proposed. By hybridising the glowworm swarm optimisation, quantum coding and quantum evolutionary theory, the quantum state and binary state of the quantum glowworms can be well evolved by simulated quantum rotation gate. The classical benchmark functions are used to test effectiveness of QGSO. The proposed QGSO algorithm is an effective discrete optimisation algorithm which has better convergent accuracy and speed. Then QGSO is used to resolve thinned array optimisation difficulties. Simulation results are provided to show that the proposed thinned array method based on QGSO is superior to the thinned array methods based on previous classical intelligence algorithms. The proposed thinned array method based on QGSO can search the global optimal solution of thinned array.]]>