Although the genetic algorithm （GA） for structural optimization is very robust, it is very computationally intensive and hence slower than optimality criteria and mathematical programming methods. To speed up the de...Although the genetic algorithm （GA） for structural optimization is very robust, it is very computationally intensive and hence slower than optimality criteria and mathematical programming methods. To speed up the design process, the authors present an adaptive reanalysis method for GA and its applications in the optimal design of trusses. This reanalysis technique is primarily derived from the Kirsch＇s combined approximations method. An iteration scheme is adopted to adaptively determine the number of basis vectors at every generation. In order to illustrate this method, three classical examples of optimal truss design are used to validate the proposed reanalysis-based design procedure. The presented numerical results demonstrate that the adaptive reanalysis technique affects very slightly the accuracy of the optimal solutions and does accelerate the design process, especially for large-scale structures.展开更多
This paper presents an adaptive gain,finite-and fixedtime convergence super-twisting-like algorithm based on a revised barrier function,which is robust to perturbations with unknown bounds.It is shown that this algori...This paper presents an adaptive gain,finite-and fixedtime convergence super-twisting-like algorithm based on a revised barrier function,which is robust to perturbations with unknown bounds.It is shown that this algorithm can ensure a finite-and fixed-time convergence of the sliding variable to the equilibrium,no matter what the initial conditions of the system states are,and maintain it there in a predefined vicinity of the origin without violation.Also,the proposed method avoids the problem of overestimation of the control gain that exists in the current fixed-time adaptive control.Moreover,it shows that the revised barrier function can effectively reduce the computation load by obviating the need of increasing the magnitude of sampling step compared with the conventional barrier function.This feature will be beneficial when the algorithm is implemented in practice.After that,the estimation of the fixed convergence time of the proposed method is derived and the impractical requirement of the preceding fixed-time adaptive control that the adaptive gains must be large enough to engender the sliding mode at time t=0 is discarded.Finally,the outperformance of the proposed method over the existing counterpart method is demonstrated with a numerical simulation.展开更多
The aim of this research paper is to improve the performance of Fast Transversal Filter (FTF) adaptive algorithm used for mobile channel estimation. A multi-ray Jakes mobile channel model with a Doppler frequency shif...The aim of this research paper is to improve the performance of Fast Transversal Filter (FTF) adaptive algorithm used for mobile channel estimation. A multi-ray Jakes mobile channel model with a Doppler frequency shift is used in the simulation. The channel estimator obtains the sampled channel impulse response (SIR) from the predetermined training sequence. The FTF is a computationally efficient implementation of the recursive least squares (RLS) algorithm of the conventional Kalman filter. A stabilization FTF is used to overcome the problem caused by the accumulation of roundoff errors, and, in addition, degree-one prediction is incorporated into the algorithm (Predictive FTF) to improve the estimation performance and to track changes of the mobile channel. The efficiency of the algorithm is confirmed by simulation results for slow and fast varying mobile channel. The results show about 5 to 15 dB improvement in the Mean Square Error (Deviation) between the estimated taps and the actual ones depending on the speed of channel time variations. Slow and fast vehicular channels with Doppler frequencies 100 Hz and 222 Hz respectively are used in these tests. The predictive FTF (PFTF) algorithm give a better channel SIR estimation performance than the conventional FTF algorithm, and it involves only a small increase in complexity.展开更多
为进一步提升网络入侵检测效果,提出一种融合FAST特征选择与自适应二进制量子引力搜索支持向量机的(FAST-ABQGSA-SVM)网络入侵检测算法。利用FAST算法过滤掉原始特征集中冗余无关的特征形成候选特征子集,基于组合优化策略采用自适应二...为进一步提升网络入侵检测效果,提出一种融合FAST特征选择与自适应二进制量子引力搜索支持向量机的(FAST-ABQGSA-SVM)网络入侵检测算法。利用FAST算法过滤掉原始特征集中冗余无关的特征形成候选特征子集,基于组合优化策略采用自适应二进制量子引力搜索算法对候选特征子集与SVM分类器参数进行组合优化。在ABQGSA反复学习寻优过程中,采取动态自适应波动式调整策略更新量子旋转角以平衡算法全局搜索能力和局部搜索能力;同时为提升算法的自适应变异能力,设计与进化程度及个体适应度值相关的自适应变异概率,当种群进化出现停滞时及时引入量子位离散交叉操作帮助种群摆脱局部极值。通过KDD CUP 99仿真实验表明,所提出的FAST-ABQGSA-SVM算法较其他同类型检测算法具有更好的鲁棒性、学习精度以及检测效果。展开更多
On the basis of Hartmann Shack sensor imaging analysis, a new method is presented with which the wavefront slope can be obtained when the object is incoherent and extended. This method, which is demonstrated by both ...On the basis of Hartmann Shack sensor imaging analysis, a new method is presented with which the wavefront slope can be obtained when the object is incoherent and extended. This method, which is demonstrated by both theoretical interpreting and computer simulation, explains how to measure the wavefront slope difference between two sub apertures through the determination of image displacements on detector plane. It includes a fast and accurate digital algorithm for detecting wavefront disturbance, which is much suitable for realization in such electrical hardwares as digital signal processors.展开更多
Aimed at the problem of adaptive noise canceling(ANC),three implementary algorithms which are least mean square(LMS) algorithm,recursive least square(RLS) algorithm and fast affine projection(FAP) algorithm,have been ...Aimed at the problem of adaptive noise canceling(ANC),three implementary algorithms which are least mean square(LMS) algorithm,recursive least square(RLS) algorithm and fast affine projection(FAP) algorithm,have been researched.The simulations were made for the performance of these algorithms.The extraction of fetal electrocardiogram(FECG) is applied to compare the application effect of the above algorithms.The proposed FAP algorithm has obvious advantages in computational complexity,convergence speed and steadystate error.展开更多
针对风洞试验模型系统辨识不准确的问题,利用自适应LMS(least mean square)滤波器模型对跨声速风洞模型进行系统辨识。由于实测信号中存在多模态耦合,为了提高系统辨识精准度,首先对输入输出信号作了FRF(frequency response analysis)...针对风洞试验模型系统辨识不准确的问题,利用自适应LMS(least mean square)滤波器模型对跨声速风洞模型进行系统辨识。由于实测信号中存在多模态耦合,为了提高系统辨识精准度,首先对输入输出信号作了FRF(frequency response analysis)分析得到试验模型俯仰方向前两阶模态,其次利用快速Fourier变换进行模态解耦,接着利用自适应LMS滤波器模型、传递函数模型、多项式模型对俯仰方向单模态进行系统辨识,最后得到了基于自适应LMS滤波器模型的俯仰方向一阶、二阶模态滤波器系数。通过对比不同数学模型的输出与输入之间的相关系数和均方误差及辨识结果,表明自适应LMS滤波器模型具有更高的系统辨识精准度和更简洁的数学模型结构。为后续风洞试验模型振动主动控制计算法的设计提供有力支撑。展开更多
An adaptive numerical scheme is developed for the propagation of an interface in a velocity field based on the fast interface tracking method proposed in [2]. A multiresolution stategy to represent the interface inste...An adaptive numerical scheme is developed for the propagation of an interface in a velocity field based on the fast interface tracking method proposed in [2]. A multiresolution stategy to represent the interface instead of point values, allows local grid refinement while controlling the approximation error on the interface. For time integration, we use an explicit Runge-Kutta scheme of second-order with a multiseale time step, which takes longer time steps for finer spatial scales. The implementation of the algorithm uses a dynamic tree data structure to represent data in the computer memory. We briefly review first the main algorithm, describe the essential data structures, highlight the adaptive scheme, and illustrate the computational efficiency by some numerical examples.展开更多
基金supported by the National Natural Science Foundation of China(50975121)the Project 2009-2007 of the Graduate Innovation Fund of Jilin University
文摘Although the genetic algorithm （GA） for structural optimization is very robust, it is very computationally intensive and hence slower than optimality criteria and mathematical programming methods. To speed up the design process, the authors present an adaptive reanalysis method for GA and its applications in the optimal design of trusses. This reanalysis technique is primarily derived from the Kirsch＇s combined approximations method. An iteration scheme is adopted to adaptively determine the number of basis vectors at every generation. In order to illustrate this method, three classical examples of optimal truss design are used to validate the proposed reanalysis-based design procedure. The presented numerical results demonstrate that the adaptive reanalysis technique affects very slightly the accuracy of the optimal solutions and does accelerate the design process, especially for large-scale structures.
文摘This paper presents an adaptive gain,finite-and fixedtime convergence super-twisting-like algorithm based on a revised barrier function,which is robust to perturbations with unknown bounds.It is shown that this algorithm can ensure a finite-and fixed-time convergence of the sliding variable to the equilibrium,no matter what the initial conditions of the system states are,and maintain it there in a predefined vicinity of the origin without violation.Also,the proposed method avoids the problem of overestimation of the control gain that exists in the current fixed-time adaptive control.Moreover,it shows that the revised barrier function can effectively reduce the computation load by obviating the need of increasing the magnitude of sampling step compared with the conventional barrier function.This feature will be beneficial when the algorithm is implemented in practice.After that,the estimation of the fixed convergence time of the proposed method is derived and the impractical requirement of the preceding fixed-time adaptive control that the adaptive gains must be large enough to engender the sliding mode at time t=0 is discarded.Finally,the outperformance of the proposed method over the existing counterpart method is demonstrated with a numerical simulation.
文摘The aim of this research paper is to improve the performance of Fast Transversal Filter (FTF) adaptive algorithm used for mobile channel estimation. A multi-ray Jakes mobile channel model with a Doppler frequency shift is used in the simulation. The channel estimator obtains the sampled channel impulse response (SIR) from the predetermined training sequence. The FTF is a computationally efficient implementation of the recursive least squares (RLS) algorithm of the conventional Kalman filter. A stabilization FTF is used to overcome the problem caused by the accumulation of roundoff errors, and, in addition, degree-one prediction is incorporated into the algorithm (Predictive FTF) to improve the estimation performance and to track changes of the mobile channel. The efficiency of the algorithm is confirmed by simulation results for slow and fast varying mobile channel. The results show about 5 to 15 dB improvement in the Mean Square Error (Deviation) between the estimated taps and the actual ones depending on the speed of channel time variations. Slow and fast vehicular channels with Doppler frequencies 100 Hz and 222 Hz respectively are used in these tests. The predictive FTF (PFTF) algorithm give a better channel SIR estimation performance than the conventional FTF algorithm, and it involves only a small increase in complexity.
文摘为进一步提升网络入侵检测效果,提出一种融合FAST特征选择与自适应二进制量子引力搜索支持向量机的(FAST-ABQGSA-SVM)网络入侵检测算法。利用FAST算法过滤掉原始特征集中冗余无关的特征形成候选特征子集,基于组合优化策略采用自适应二进制量子引力搜索算法对候选特征子集与SVM分类器参数进行组合优化。在ABQGSA反复学习寻优过程中,采取动态自适应波动式调整策略更新量子旋转角以平衡算法全局搜索能力和局部搜索能力;同时为提升算法的自适应变异能力,设计与进化程度及个体适应度值相关的自适应变异概率,当种群进化出现停滞时及时引入量子位离散交叉操作帮助种群摆脱局部极值。通过KDD CUP 99仿真实验表明,所提出的FAST-ABQGSA-SVM算法较其他同类型检测算法具有更好的鲁棒性、学习精度以及检测效果。
文摘On the basis of Hartmann Shack sensor imaging analysis, a new method is presented with which the wavefront slope can be obtained when the object is incoherent and extended. This method, which is demonstrated by both theoretical interpreting and computer simulation, explains how to measure the wavefront slope difference between two sub apertures through the determination of image displacements on detector plane. It includes a fast and accurate digital algorithm for detecting wavefront disturbance, which is much suitable for realization in such electrical hardwares as digital signal processors.
基金the National Key Technologies R&D Program (No. 2006BAI22B01)
文摘Aimed at the problem of adaptive noise canceling(ANC),three implementary algorithms which are least mean square(LMS) algorithm,recursive least square(RLS) algorithm and fast affine projection(FAP) algorithm,have been researched.The simulations were made for the performance of these algorithms.The extraction of fetal electrocardiogram(FECG) is applied to compare the application effect of the above algorithms.The proposed FAP algorithm has obvious advantages in computational complexity,convergence speed and steadystate error.
文摘针对风洞试验模型系统辨识不准确的问题,利用自适应LMS(least mean square)滤波器模型对跨声速风洞模型进行系统辨识。由于实测信号中存在多模态耦合,为了提高系统辨识精准度,首先对输入输出信号作了FRF(frequency response analysis)分析得到试验模型俯仰方向前两阶模态,其次利用快速Fourier变换进行模态解耦,接着利用自适应LMS滤波器模型、传递函数模型、多项式模型对俯仰方向单模态进行系统辨识,最后得到了基于自适应LMS滤波器模型的俯仰方向一阶、二阶模态滤波器系数。通过对比不同数学模型的输出与输入之间的相关系数和均方误差及辨识结果,表明自适应LMS滤波器模型具有更高的系统辨识精准度和更简洁的数学模型结构。为后续风洞试验模型振动主动控制计算法的设计提供有力支撑。
文摘An adaptive numerical scheme is developed for the propagation of an interface in a velocity field based on the fast interface tracking method proposed in [2]. A multiresolution stategy to represent the interface instead of point values, allows local grid refinement while controlling the approximation error on the interface. For time integration, we use an explicit Runge-Kutta scheme of second-order with a multiseale time step, which takes longer time steps for finer spatial scales. The implementation of the algorithm uses a dynamic tree data structure to represent data in the computer memory. We briefly review first the main algorithm, describe the essential data structures, highlight the adaptive scheme, and illustrate the computational efficiency by some numerical examples.
