Robust airfoil optimization based on improved particle swarm optimization method

A robust airfoil optimization platform is constructed based on the modified particle swarm optimization method (i.e., the second-order oscillating particle swarm method), which consists of an efficient optimization algorithm, a precise aerodynamic analysis program, a high accuracy surrogate model, and a classical airfoil parametric method. There are two improvements for the modified particle swarm method compared with the standard particle swarm method. First, the particle velocity is represented by the combination of the particle position and the variation of position, which makes the particle swarm algorithm a second-order precision method with respect to the particle position. Second, for the sake of adding diversity to the swarm and enlarging the parameter searching domain to improve the global convergence performance of the algorithm, an oscillating term is introduced to the update formula of the particle velocity. At last, taking two airfoils as examples, the aerodynamic shapes are optimized on this optimization platform. It is shown from the optimization results that the aerodynamic characteristic of the airfoils is greatly improved in a broad design range.     

求解非线性方程组的混沌粒子群算法及应用

针对非线性方程组的求解在工程上具有广泛的实际意义,经典的数值算法如牛顿法存在其收敛性依赖于初值而实际计算中初值难确定的问题,提出以混沌粒子群算法求解非线性方程。它通过将混沌搜索机制有机地引入粒子群算法,使每个粒子从混沌搜索机制与粒子群算法搜索机制中获得适当的搜索方向,以混沌变量的遍历性增强粒子的搜索性能与更全面地应用目标函数的信息,并反映到逐代更新的个体极值和群体极值中,可更有效地调整粒子的移向并最终获得最优解。测试结果表明这一尝试的有效性。最后将所提的方法用于建立复合材料结构的疲劳寿命与应力、温度、湿度的关系模型。     

Research on the algorithm of binary image cross-correlation for unsteady flow field measurement

In the present paper, the algorithm of Binary Image Cross-Correlation (BICC) was developed to measure the unsteady flow field. A vortex flow field was used to test the algorithm by numerical simulation. The results show that BICC is an effective algorithm for particle identification from consecutive images, the accurate velocity vector field can be obtained. The real velocity field in a valve chamber was measured by BICC in this study. From the full-field velocity information, the pressure and vorticity fields were also extracted by post-processing. The project supported by the National Natural Science Foundation of China     

基于多轮升维策略与改进量子行为粒子群优化算法的热导率函数估计方法

将改进的量子行为粒子群优化算法应用于材料热导率函数估计问题中,并提出了一种多轮升维策略对算法的搜索过程进行优化,形成了一种鲁棒性强且高效的反演方法。通过数值实验测试了该方法在测量误差以及系统误差下的表现,并对不同粒子群优化算法的性能进行了比较研究。结果表明,采用的反演方法能够在较大的搜索范围与反演维度下稳定收敛,对测量误差的敏感度较低;提出的多轮升维策略能够使各类粒子群优化算法在热导率函数估计问题中的搜索效率得到提升。     

CABC–CSA: a new chaotic hybrid algorithm for solving optimization problems

Recently a lot of methods have been presented for solving optimization problems. In this paper, we are trying to propose a new hybrid algorithm for solving these kinds of problem. The proposed algorithm is based on chaotic artificial bee colony and chaotic simulated annealing, CABC–CSA. The chaotic artificial bee colony finds new locations chaotically. Actually, the proposed algorithm provides a combination of local search accuracy of simulated annealing and the ability of global search of artificial bee colony. Furthermore, we used a different method for generating the initial population. The proposed algorithm is validated using 12 benchmark functions. The results are compared with those of the artificial bees’ algorithm, the hybrid algorithm of artificial bee colony and simulated annealing and particle swarm optimization. Simulation results show the efficiency of the proposed algorithm.     

A generalized processing technique in digital particle image velocimetry with direct estimation of velocity gradients

A technique is proposed for the processing of digital particle image velocimetry (PIV) images, in one single step providing direct estimates of fluid velocity, out-of-plane vorticity and in-plane shear rate tensor. The method is based on a generalization of the standard PIV cross-correlation technique and substitutes the usual discrete cross-correlation of image pairs with a correlation of interpolated two-dimensional image intensity functions, being subject to affine transformations. The correlation is implemented by using collocation points, on which image intensity values are interpolated. The resulting six-dimensional correlation function is maximized using a general purpose optimization algorithm. The use of the method is demonstrated by application to different types of synthetically generated image pairs constructed with known particle displacement functions. The resulting errors are assessed and compared with those of a representative standard PIV method as well as with those of the present technique using no differential quantities in the search of the peak location. The examples demonstrate that significant improvements in accuracy can be obtained for flow fields with regions containing strong velocity gradients.     

Stability properties of a two-dimensional system involving one Caputo derivative and applications to the investigation of a fractional-order Morris–Lecar neuronal model

Adaptive infinite impulse response filters have received much attention due to its utilization in a wide range of real-world applications. The design of the IIR filters poses a typically nonlinear, non-differentiable and multimodal problem in the estimation of the coefficient parameters. The aim of the current study is the application of a novel hybrid optimization technique based on the combination of cellular particle swarm optimization and differential evolution called CPSO–DE for the optimal parameter estimation of IIR filters. DE is used as the evolution rule of the cellular part in CPSO to improve the performance of the original CPSO. Benchmark IIR systems commonly used in the specialized literature have been selected for tuning the parameters and demonstrating the effectiveness of the CPSO–DE method. The proposed CPSO–DE method is experimentally compared with two new design methods: the tissue-like membrane system (TMS), the hybrid particle swarm optimization and gravitational search algorithm (HPSO–GSA), the original CPSO-outer and CPSO-inner, and classical implementations of PSO, GSA and DE. Computational results and comparison of CPSO–DE with the other evolutionary and hybrid methods show satisfactory results. The hybridization of CPSO and DE demonstrates powerful estimation ability. In particular, to our knowledge, this hybridization has not yet been investigated for the IIR system identification.     

遗传算法改进及其在岩土参数反分析中的应用

本文的主要目的是开发基于实数编码的杂交遗传算法来识别土体的本构参数。该杂交遗传算法在经典遗传算法框架下开发,融合两个新开发的交叉算子,形成了一个新的杂交策略。为了保持种群的多样性,在算法中采用了一个动态随机变异算子。另外,为了提高算法收敛性,采用了一个基于混沌的局部搜索技术。分别基于室内试验和现场试验,通过识别土的本构参数来测试新算法的搜索能力和搜索效率。为了测试新开发算法的突出表现,特选用5种经典的随机类算法（遗传算法、粒子群算法、模拟退火算法、差分算法和蜂巢算法）,分析同样的案例进行比较。结果表明,在收敛速度和最优解的准确度方面,新改进的算法可以很好地处理岩土工程的参数反演。     

Automatic extraction method of force chain information and its application in the flow photoelastic experiment of granular matter

The force chain is the core of the multi-scale analysis of granular matter. Accurately extracting the force chain information among particles is of great significance to the study of particle mechanics and geological hazards caused by particle flow. However, in the photoelastic experiment, the precise identification of the branching points of force chains has not been effectively realized. Therefore, this study proposes an automatic extraction method of force chain key information. First, based on the Hough transform and the Euclidean distance, a particle geometric information identification model is established and geometric information such as particle circle center coordinates, radius, contact point location, and contact angle is extracted. Then, a particle contact force information identification model is established following the color gradient mean square method. The model realizes the rapid calibration and extraction of a large number of particle media contact force information. Next, combined with the force chain composition criterion and its quasilinear feature, an automatic extraction method of force chain information is established, which solves the problem of the accurate identification of the force chain branch points. Finally, in the photoelastic experiment of ore drawing from a single drawpoint, the automatic extraction method of force chain information is verified. The results show that the macroscopic distribution of force chains during ore drawing from a single drawpoint is left–right symmetrical. Strong force chains are mostly located on the two sides of the model but in small numbers and they mainly develop vertically. Additionally, the ends are mostly in a combination of Y and inverted Y shapes, while the middle is mostly quasilinear. Weak force chains are abundant and mostly distributed in the middle of the model, and develop in different directions. The proposed extraction method accurately extracts the force chain network from the photoelastic experiment images and dynamically characterizes the force chains of granular matter, which has significant advantages in particle geometry information extraction, force chain branch point discrimination, force chain retrieval, and force chain distribution and its azimuthal characterization. The results provide a scientific basis for studying the macroscopic and microscopic mechanical parameters of granular matter.     

An automated vortex detection scheme using the wavelet transform of the<Emphasis Type="Italic"> d</Emphasis><Subscript>2</Subscript> field

A vortex detection scheme using the wavelet transform of the discriminant of the eigenvalues of the velocity gradient matrix (d ₂) is presented in this paper. The use of d ₂ field results in better eduction capability over the previously used test fields such as enstrophy since it automatically distinguishes shear layers from vortices. Level sets are used to refine the shape of the vortex without causing a huge computational penalty. Further, the algorithm is easily automated to aid batch processing. The detection scheme was applied to swirl flow fields, successfully estimating the vortex location, the core radius and the vortex shape.     

基于Kriging代理模型的迭代更新高效反演方法

为提高混凝土坝等大体积结构参数反演效率和精度,减少由于应用有限元进行大量正分析而产生的计算机时,建立了一种结合Kriging代理模型和粒子群优化(PSO)算法的迭代更新反演方法。通过拉丁超立方抽样(LHS)方法确定初始样本点的空间分布,并使用有限元正分析获取对应的响应值,构建粗糙的初始代理模型,结合具有全局寻优能力的PSO算法,反演大体积结构的分区弹性模量,随之再代入有限元模型中,计算获取新的位移响应,并将其作为新样本加入到样本集中,通过迭代更新获得局部更高精度的代理模型。工程实际算例表明,该方法对混凝土坝等大体积结构参数反演精度较高和适用性好,且能大幅减少传统有限元模型反演方法所需消耗的正分析机时,提高反演效率。     

FV/MC混合算法求解轴对称钝体后湍流流场

介绍一种有限容积／Monte Carlo结合求解湍流流场的相容的混合算法．有限容积法求解Reynolds平均的动量方程和能量方程，Monte Carlo方法求解模化的脉动速度—频率—标量联合的PDF方程．将该算法发展到无结构网格，探讨了在无结构网格中实现两种方法的耦合，包括颗粒定位，颗粒场和平均场之间数据交换等问题．并以二维轴对称钝体后湍流流场作为算例，比较了计算结果与实验结果．     

Reconstruction of three-dimensional particle trajectories in flows through curved circular tubes

An automated technique is described for reconstructing three-dimensional trajectories of tracer particles in curved circular ducts. Individual particles are tracked in real time by a rotating camera under computer control. A digital imaging system enables the computer to locate the particle, adjust the speed of rotation, and store position and calibration data. By viewing the tube from approximately orthogonal directions, three-dimensional information on the position of the particle is obtained. Its precise location is calculated by tracing rays from the camera to the interior of the tube. This technique yields detailed three-dimensional position and velocity data along a trajectory.     

A new design method for adaptive IIR system identification using hybrid particle swarm optimization and gravitational search algorithm

Design of adaptive infinite impulse response (IIR) filter is the process of utilizing adaptive algorithm to iteratively determine the filter parameters to obtain an optimal model for the unknown plant based on minimizing the error cost function. However, the error cost surface of IIR filter is generally nonlinear, non-differentiable and multimodal. Hence, an efficient global optimization technique is required to minimize the error cost objective. A novel hybrid particle swarm optimization and gravitational search algorithm (HPSO–GSA) is proposed in this paper for IIR filter design. The proposed HPSO–GSA updates particle positions through obeying the influence of gravity acceleration in GSA and receiving direction of cognitive memory and social sharing information from PSO by means of coevolutionary strategy. The effect of key parameters on the performance of the proposed algorithm is firstly studied, and the proper parameters in HPSO–GSA are established using five benchmark plants along with the same-order model. The simulation studies have been performed for the performance comparison of eight algorithms such as PSO, GSA, QPSO, DPSO, FO-DPSO, GAPSO, PSOGSA and the proposed HPSO–GSA for unknown IIR system identification with the same-order and reduced-order filters. Simulation results show that the proposed algorithm has advantages over PSO, GSA and other PSO-based variants in terms of the convergence speed and the MSE levels.     

A numerical investigation of flow past a bluff body using three-state anemometry

An application of a new flow measurement technique is described which allows for the non-intrusive simultaneous measurement of flow velocity, density, and viscosity. The viscosity information can be used to derive the flow field temperature. The combination of the three measured variables and the perfect-gas law then leads to an estimate of the flow field thermodynamic pressure. Thus, the instantaneous state of a flow field can be completely described. Three-state anemometry (3SA), a derivative of particle image velocimetry (PIV), which uses a combination of three monodisperse sizes of styrene seeding particles is proposed. A marker seeding is chosen to follow the flow as closely as possible, while intermediate and large seeding populations provide two supplementary velocity fields, which are also dependent on fluid density and viscosity. A simplified particle motion equation, aimed at turbomachinery applications, is then solved over the whole field to provide both density and viscosity data. The three velocity fields can be separated in a number of ways. The simplest and that proposed in this paper is to dye the different populations and view the region of interest through interferometric filters. The two critical aspects needed to enable the implementation of such a technique are a suitable selection of the diameters of the particle populations, and the separation of the velocity fields. There has been extensive work on the seeding particle behaviour which allows an estimate of the suitable particle diameters to be made. A technique is described in this paper to allow the separation of particles in a range of micrometer sized velocity fields through fluorescence (separation through intensity also being possible). Some preliminary results by direct numerical simulation (DNS) of a 3SA image are also presented. The particle sizes chosen were 1 μm and 5 μm, tested on the near-wake flow past a cylinder to investigate viscosity only, assuming uniform flow density. The accuracy of the technique, derived from simulations of swirling flows, is estimated as 0.5% RMS for velocity, 2% RMS for the density and viscosity, and 4% RMS for the temperature estimate. © 1998 John Wiley & Sons, Ltd.     

基于萤火虫群优化的空间非合作目标相对导航粒子滤波算法

研究了空间非合作目标相对导航算法,针对标准粒子滤波的重采样过程导致的粒子贫化现象及其造成的相对导航精度下降问题,分析了萤火虫优化算法的运行机制,提出一种基于萤火虫智能优化算法的改进粒子滤波算法。改进算法通过优化粒子滤波的重采样过程,使粒子群智能的向高似然区域移动,同时在低似然区域也合理保留了部分粒子,保证了粒子的多样性,提高了样本的整体质量。仿真结果表明,改进算法导航精度较标准算法提高了39.35%,达到稳定精度所需粒子数较少,有效抑制了粒子贫化问题。     

粒子群优化算法在传递对准中的应用

给出了一种基于粒子群优化算法的捷联惯导传递对准算法。简单分析了传递对准任务要求和主子惯导惯性器件输出之间的关系,将传递对准问题作为参数优化问题进行求解,给出了基于粒子群优化算法进行传递对准的数学模型。定义了传递对准的优化目标函数,介绍了粒子群优化算法及其应用于传递对准的具体算法设置。用粒子群优化算法求解目标函数的最小值,可获得主子惯导之间的失准角,进行一次校正即可完成传递对准过程。通过计算机仿真对算法进行了验证分析,在仿真条件下（陀螺精度为0.1&#176;/h）,能达到方位0.1&#176;的精度。与其他对准算法一样,算法受载体机动条件的影响较大,一般需要姿态机动来提高陀螺的信噪比。     

Automated topology classification method for instantaneous velocity fields

Topological concepts provide highly comprehensible representations of the main features of a flow with a limited number of elements. This paper presents an automated classification method of instantaneous velocity fields based on the analysis of their critical points distribution and feature flow fields. It uses the fact that topological changes of a velocity field are continuous in time to extract large scale periodic phenomena from insufficiently time-resolved datasets. This method is applied to two test-cases : an analytical flow field and PIV planes acquired downstream a wall-mounted cube.     

GPS/INS组合导航系统中的高斯粒子滤波混和算法

采用非线性滤波器的惯性组合导航系统中,非线性滤波器的精度和实时性直接决定了惯性组合导航系统的性能.计算量和精度之间的矛盾是制约粒子滤波在GPS/INS组合导航系统中应用的主要因素.在分析高斯粒子滤波算法原理的基础上,提出了一种高斯粒子滤波混和算法,对系统线性部分采用线性递推方式,对系统非线性部分采用非线性递推方式,从而提高高斯粒子滤波精度和实时性.针对GPS/INS组合导航系统,混和算法利用卡尔曼滤波的线性递推方式进行量测更新,仿真结果表明混和算法在较少粒子条件下,相对高斯粒子滤波算法精度提高20％,滤波时间降低40％.     

A vision-based hybrid particle tracking velocimetry (PTV) technique using a modified cascade correlation peak-finding method

A novel technique for particle tracking velocimetry is presented in this paper to overcome the issue of overlapping particle images encountered in the flows with high particle density or under volumetric illumination conditions. To achieve this goal, algorithms for particle identification and tracking are developed based on current methods and validated with both synthetic and experimental image sets. The results from synthetic image tests show that the particle identification algorithm is able to resolve overlapped particle images up to 50?% under noisy conditions, while keeping the root mean square peak location error under 0.07?pixels. The algorithm is also robust to the size changes up to a size ratio of 5. The tracking method developed from a classic computer vision matching algorithm is capable of capturing a velocity gradient up to 0.3 while maintaining the error under 0.2?pixels. Sensitivity tests were performed to describe the optimum conditions for the technique in terms of particle image density, particle image sizes and velocity gradients, also its sensitivity to errors of the PIV results that guide the tracking process. The comparison with other existing tracking techniques demonstrates that this technique is able to resolve more vectors out of a dense particle image field.