The phenomenon of a target echo peak overlapping with the backscattered echo peak significantly undermines the detection range and precision of underwater laser fuzes.To overcome this issue,we propose a four-quadrant ...The phenomenon of a target echo peak overlapping with the backscattered echo peak significantly undermines the detection range and precision of underwater laser fuzes.To overcome this issue,we propose a four-quadrant dual-beam circumferential scanning laser fuze to distinguish various interference signals and provide more real-time data for the backscatter filtering algorithm.This enhances the algorithm loading capability of the fuze.In order to address the problem of insufficient filtering capacity in existing linear backscatter filtering algorithms,we develop a nonlinear backscattering adaptive filter based on the spline adaptive filter least mean square(SAF-LMS)algorithm.We also designed an algorithm pause module to retain the original trend of the target echo peak,improving the time discrimination accuracy and anti-interference capability of the fuze.Finally,experiments are conducted with varying signal-to-noise ratios of the original underwater target echo signals.The experimental results show that the average signal-to-noise ratio before and after filtering can be improved by more than31 d B,with an increase of up to 76%in extreme detection distance.展开更多
In Wireless Sensor Networks(WSNs),Clustering process is widely utilized for increasing the lifespan with sustained energy stability during data transmission.Several clustering protocols were devised for extending netw...In Wireless Sensor Networks(WSNs),Clustering process is widely utilized for increasing the lifespan with sustained energy stability during data transmission.Several clustering protocols were devised for extending network lifetime,but most of them failed in handling the problem of fixed clustering,static rounds,and inadequate Cluster Head(CH)selection criteria which consumes more energy.In this paper,Stochastic Ranking Improved Teaching-Learning and Adaptive Grasshopper Optimization Algorithm(SRITL-AGOA)-based Clustering Scheme for energy stabilization and extending network lifespan.This SRITL-AGOA selected CH depending on the weightage of factors such as node mobility degree,neighbour's density distance to sink,single-hop or multihop communication and Residual Energy(RE)that directly influences the energy consumption of sensor nodes.In specific,Grasshopper Optimization Algorithm(GOA)is improved through tangent-based nonlinear strategy for enhancing the ability of global optimization.On the other hand,stochastic ranking and violation constraint handling strategies are embedded into Teaching-Learning-based Optimization Algorithm(TLOA)for improving its exploitation tendencies.Then,SR and VCH improved TLOA is embedded into the exploitation phase of AGOA for selecting better CH by maintaining better balance amid exploration and exploitation.Simulation results confirmed that the proposed SRITL-AGOA improved throughput by 21.86%,network stability by 18.94%,load balancing by 16.14%with minimized energy depletion by19.21%,compared to the competitive CH selection approaches.展开更多
The paper proposes a wireless sensor network(WSN)localization algorithm based on adaptive whale neural network and extended Kalman filtering to address the problem of excessive reliance on environmental parameters A a...The paper proposes a wireless sensor network(WSN)localization algorithm based on adaptive whale neural network and extended Kalman filtering to address the problem of excessive reliance on environmental parameters A and signal constant n in traditional signal propagation path loss models.This algorithm utilizes the adaptive whale optimization algorithm to iteratively optimize the parameters of the backpropagation(BP)neural network,thereby enhancing its prediction performance.To address the issue of low accuracy and large errors in traditional received signal strength indication(RSSI),the algorithm first uses the extended Kalman filtering model to smooth the RSSI signal values to suppress the influence of noise and outliers on the estimation results.The processed RSSI values are used as inputs to the neural network,with distance values as outputs,resulting in more accurate ranging results.Finally,the position of the node to be measured is determined by combining the weighted centroid algorithm.Experimental simulation results show that compared to the standard centroid algorithm,weighted centroid algorithm,BP weighted centroid algorithm,and whale optimization algorithm(WOA)-BP weighted centroid algorithm,the proposed algorithm reduces the average localization error by 58.23%,42.71%,31.89%,and 17.57%,respectively,validating the effectiveness and superiority of the algorithm.展开更多
The performance of genetic algorithm(GA) is determined by the capability of search and optimization for satisfactory solutions. The new adaptive genetic algorithm(AGA) is built for inducing suitable search and optimiz...The performance of genetic algorithm(GA) is determined by the capability of search and optimization for satisfactory solutions. The new adaptive genetic algorithm(AGA) is built for inducing suitable search and optimization relationship. The use of six fuzzy logic controllers(6FLCs) is proposed for dynamic control genetic operating parameters of a symbolic-coded GA. This paper uses AGA based on 6FLCs to deal with the travelling salesman problem (TSP). Experimental results show that AGA based on 6FLCs is more efficient than a standard GA in solving combinatorial optimization problems similar to TSP.展开更多
Attribute reduction is an important process in rough set theory.Finding minimum attribute reduction has been proven to help the user-oriented make better knowledge discovery in some cases.In this paper,an efficient mi...Attribute reduction is an important process in rough set theory.Finding minimum attribute reduction has been proven to help the user-oriented make better knowledge discovery in some cases.In this paper,an efficient minimum attribute reduction algorithm is proposed based on the multilevel evolutionary tree with self-adaptive subpopulations.A model of multilevel evolutionary tree with self-adaptive subpopulations is constructed,and interacting attribute sets are better decomposed into subsets by the self-adaptive mechanism of elitist populations.Moreover it can self-adapt the subpopulation sizes according to the historical performance record so that interacting attribute decision variables are captured into the same grouped subpopulation,which will be extended to better performance in both quality of solution and competitive computation complexity for minimum attribute reduction.The conducted experiments show the proposed algorithm is better on both efficiency and accuracy of minimum attribute reduction than some representative algorithms.Finally the proposed algorithm is applied to magnetic resonance image(MRI)segmentation,and its stronger applicability is further demonstrated by the effective and robust segmentation results.展开更多
A complete mesh free adaptive algorithm （MFAA）, with solution adaptation and geometric adaptation, is developed to improve the resolution of flow features and to replace traditional global refinement techniques in s...A complete mesh free adaptive algorithm （MFAA）, with solution adaptation and geometric adaptation, is developed to improve the resolution of flow features and to replace traditional global refinement techniques in structured grids. Unnecessary redundant points and elements are avoided by using the mesh free local clouds refinement technology in shock influencing regions and regions near large curvature places on the boundary. Inviscid compressible flows over NACA0012 and RAE2822 airfoils are computed. Finally numerical results validate the accuracy of the above method.展开更多
On the basis of the theory of adaptive active noise control(AANC) in a duct, this article discusses the algorithms of the adaptive control, compares the algorithm characteristics using LMS, RLS and LSL algorithms in t...On the basis of the theory of adaptive active noise control(AANC) in a duct, this article discusses the algorithms of the adaptive control, compares the algorithm characteristics using LMS, RLS and LSL algorithms in the adaptive filter in the AANC system, derives the recursive formulas of LMS algorithm. and obtains the LMS algorithm in computer simulation using FIR and IIR filters in AANC system. By means of simulation, we compare the attenuation levels with various input signals in AANC system and discuss the effects of step factor, order of filters and sound delay on the algorithm's convergence rate and attenuation level.We also discuss the attenuation levels with sound feedback using are and IIR filters in AANC system.展开更多
To reduce the vibration in the suspension, semi active suspension system was employed. And its CARMA model was built. Two adaptive control schemes, the minimum variance self tuning control algorithm and the pole con...To reduce the vibration in the suspension, semi active suspension system was employed. And its CARMA model was built. Two adaptive control schemes, the minimum variance self tuning control algorithm and the pole configuration self tuning control algorithm, were proposed. The former can make the variance of the output minimum while the latter can make dynamic behavior satisfying. The stability of the two schemes was analyzed. Simulations of them show that the acceleration in the vertical direction has been reduced greatly. The purpose of reducing vibration is realized. The two schemes can reduce the vibration in the suspension and have some practicability.展开更多
A new algorithm, called the adaptive exponent smoothing gradient algorithm (AESGA), is developed from Widrow′s LMS algorithm. It is based on the fact that LMS algorithm has properties of time delaying and low pass ...A new algorithm, called the adaptive exponent smoothing gradient algorithm (AESGA), is developed from Widrow′s LMS algorithm. It is based on the fact that LMS algorithm has properties of time delaying and low pass filtering. This paper shows that the algorithm, on the domain of {Ω 1:α∈(0,1)}×{Ω 2:β(0,∞)} , unbiasedly and asymptotically converges to the Winner solution when the signal is a stationary Gauss stochastic process. The convergent property and the performance misadjustment are analyzed in theory. And calculation method of the algorithm is also suggested. Numerical results given by computer simulations show that the algorithm is effective.展开更多
Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective funct...Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.展开更多
An improved algorithm is presented to identify the secondary path based on the adaptive notch filter approach. Since the interference from the narrow band excitation signal is suppressed by the adaptive notch filter, ...An improved algorithm is presented to identify the secondary path based on the adaptive notch filter approach. Since the interference from the narrow band excitation signal is suppressed by the adaptive notch filter, the convergent speed of the on-line control path identification process is significantly improved. As a result, the controller performance is greatly enhanced. Besides the algorithm development, some important factors, such as the influence of reference signal on the controller convergent speed, are also discussed. The effectiveness of the algorithm is verified by experimental results.展开更多
We propose a slope-based decoupling algorithm to simultaneously control the dual deformable mirrors （DMs） in a woofer-tweeter adaptive optics system. This algorithm can directly use the woofer＇s response matrix mea...We propose a slope-based decoupling algorithm to simultaneously control the dual deformable mirrors （DMs） in a woofer-tweeter adaptive optics system. This algorithm can directly use the woofer＇s response matrix measured from a Shack-Hartmann wave-front sensor to construct a slope-based orthogonal basis, and then selectively distribute the large- amplitude low-order aberration to woofer DM and the remaining aberration to tweeter DM through the slope-based orthogonal basis. At the same moment, in order to avoid the two DMs generating opposite compensation, a constraint matrix used to reset tweeter control vector is convenient to be calculated with the slope-based orthogonal basis. Numeral simulation demonstrates that this algorithm has a good performance to control the adaptive optics system with dual DMs simultaneously. Compared with the typical decoupling algorithm, this algorithm can take full use of the compensation ability of woofer DM and release the stroke of tweeter DM to compensate high-order aberration. More importantly, it does not need to measure the accurate shape of tweeter＇s influence function and keeps better performance of restraining the coupling error with the continuous-dynamic aberration.展开更多
An improved adaptive genetic algorithm is presented in this paper. It primarily includes two modified methods： one is novel adaptive probabilities of crossover and mutation, the other is truncated selection approach....An improved adaptive genetic algorithm is presented in this paper. It primarily includes two modified methods： one is novel adaptive probabilities of crossover and mutation, the other is truncated selection approach. This algorithm has been validated to be superior to the simple genetic algorithm （SGA） by a complicated binary testing function. Then the proposed algorithm is applied to optimizing the planar retrodirective array to reduce the cost of the hardware. The fitness function is discussed in the optimization example. After optimization, the sparse planar retrodirective antenna array keeps excellent retrodirectivity, while the array architecture has been simplified by 34%. The optimized antenna array can replace uniform full array effectively. Results show that this work will gain more engineering benefits in practice.展开更多
An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal ...An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.展开更多
To improve the identification capability of AP algorithm in time-varying sparse system, we propose a block parallel l_0-SWL-DCD-AP algorithm in this paper. In the proposed algorithm, we first introduce the l_0-norm co...To improve the identification capability of AP algorithm in time-varying sparse system, we propose a block parallel l_0-SWL-DCD-AP algorithm in this paper. In the proposed algorithm, we first introduce the l_0-norm constraint to promote its application for sparse system. Second, we use the shrinkage denoising method to improve its track ability. Third, we adopt the widely linear processing to take advantage of the non-circular properties of communication signals. Last, to reduce the high computational complexity and make it easy to implemented, we utilize the dichotomous coordinate descent(DCD) iterations and the parallel processing to deal with the tapweight update in the proposed algorithm. To verify the convergence condition of the proposed algorithm, we also analyze its steadystate behavior. Several simulation are done and results show that the proposed algorithm can achieve a faster convergence speed and a lower steady-state misalignment than similar APA-type algorithm. When apply the proposed algorithm in the decision feedback equalizer(DFE), the bite error rate(BER) decreases obviously.展开更多
Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltage...Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltages directly from wavefront slopes through pre-measuring the relational matrix between deformable mirror actuators and Hartmann wavefront sensor with perfect real-time characteristic and stability. However, with increasing the number of sub-apertures in wavefront sensor and deformable mirror actuators of adaptive optics systems, the matrix operation in direct gradient algorithm takes too much time, which becomes a major factor influencing control effect of adaptive optics systems. In this paper we apply an iterative wavefront control algorithm to high-resolution adaptive optics systems, in which the voltages of each actuator are obtained through iteration arithmetic, which gains great advantage in calculation and storage. For AO system with thousands of actuators, the computational complexity estimate is about O(n2) ～ O(n3) in direct gradient wavefront control algorithm, while the computational complexity estimate in iterative wavefront control algorithm is about O(n) ～(O(n)3/2), in which n is the number of actuators of AO system. And the more the numbers of sub-apertures and deformable mirror actuators, the more significant advantage the iterative wavefront control algorithm exhibits.展开更多
Well production optimization is a complex and time-consuming task in the oilfield development.The combination of reservoir numerical simulator with optimization algorithms is usually used to optimize well production.T...Well production optimization is a complex and time-consuming task in the oilfield development.The combination of reservoir numerical simulator with optimization algorithms is usually used to optimize well production.This method spends most of computing time in objective function evaluation by reservoir numerical simulator which limits its optimization efficiency.To improve optimization efficiency,a well production optimization method using streamline features-based objective function and Bayesian adaptive direct search optimization(BADS)algorithm is established.This new objective function,which represents the water flooding potential,is extracted from streamline features.It only needs to call the streamline simulator to run one time step,instead of calling the simulator to calculate the target value at the end of development,which greatly reduces the running time of the simulator.Then the well production optimization model is established and solved by the BADS algorithm.The feasibility of the new objective function and the efficiency of this optimization method are verified by three examples.Results demonstrate that the new objective function is positively correlated with the cumulative oil production.And the BADS algorithm is superior to other common algorithms in convergence speed,solution stability and optimization accuracy.Besides,this method can significantly accelerate the speed of well production optimization process compared with the objective function calculated by other conventional methods.It can provide a more effective basis for determining the optimal well production for actual oilfield development.展开更多
To address the issue of field size in random network coding, we propose an Improved Adaptive Random Convolutional Network Coding (IARCNC) algorithm to considerably reduce the amount of occupied memory. The operation o...To address the issue of field size in random network coding, we propose an Improved Adaptive Random Convolutional Network Coding (IARCNC) algorithm to considerably reduce the amount of occupied memory. The operation of IARCNC is similar to that of Adaptive Random Convolutional Network Coding (ARCNC), with the coefficients of local encoding kernels chosen uniformly at random over a small finite field. The difference is that the length of the local encoding kernels at the nodes used by IARCNC is constrained by the depth; meanwhile, increases until all the related sink nodes can be decoded. This restriction can make the code length distribution more reasonable. Therefore, IARCNC retains the advantages of ARCNC, such as a small decoding delay and partial adaptation to an unknown topology without an early estimation of the field size. In addition, it has its own advantage, that is, a higher reduction in memory use. The simulation and the example show the effectiveness of the proposed algorithm.展开更多
In the normal operation condition, a conventional square-root cubature Kalman filter （SRCKF） gives sufficiently good estimation results. However, if the measurements are not reliable, the SRCKF may give inaccurate r...In the normal operation condition, a conventional square-root cubature Kalman filter （SRCKF） gives sufficiently good estimation results. However, if the measurements are not reliable, the SRCKF may give inaccurate results and diverges by time. This study introduces an adaptive SRCKF algorithm with the filter gain correction for the case of measurement malfunctions. By proposing a switching criterion, an optimal filter is selected from the adaptive and conventional SRCKF according to the measurement quality. A subsystem soft fault detection algorithm is built with the filter residual. Utilizing a clear subsystem fault coefficient, the faulty subsystem is isolated as a result of the system reconstruction. In order to improve the performance of the multi-sensor system, a hybrid fusion algorithm is presented based on the adaptive SRCKF. The state and error covariance matrix are also predicted by the priori fusion estimates, and are updated by the predicted and estimated information of subsystems. The proposed algorithms were applied to the vessel dynamic positioning system simulation. They were compared with normal SRCKF and local estimation weighted fusion algorithm. The simulation results show that the presented adaptive SRCKF improves the robustness of subsystem filtering, and the hybrid fusion algorithm has the better performance. The simulation verifies the effectiveness of the proposed algorithms.展开更多
Multiple genetic algorithms (GAs) need a large population size, which will take a long time for evolution. A new fuzzy adaptive GA is proposed in this paper. This algorithm is more effective in global search while kee...Multiple genetic algorithms (GAs) need a large population size, which will take a long time for evolution. A new fuzzy adaptive GA is proposed in this paper. This algorithm is more effective in global search while keeping the overall population size constant. The simulation results of function optimization show that with the proposed algorithm, the phenomenon of premature convergence can be overcome effectively, and a satisfying optimization result is obtained.展开更多
基金supported by the 2021 Open Project Fund of Science and Technology on Electromechanical Dynamic Control Laboratory,grant number 212-C-J-F-QT-2022-0020China Postdoctoral Science Foundation,grant number 2021M701713+1 种基金Postgraduate Research&Practice Innovation Program of Jiangsu Province,grant number KYCX23_0511the Jiangsu Funding Program for Excellent Postdoctoral Talent,grant number 20220ZB245。
文摘The phenomenon of a target echo peak overlapping with the backscattered echo peak significantly undermines the detection range and precision of underwater laser fuzes.To overcome this issue,we propose a four-quadrant dual-beam circumferential scanning laser fuze to distinguish various interference signals and provide more real-time data for the backscatter filtering algorithm.This enhances the algorithm loading capability of the fuze.In order to address the problem of insufficient filtering capacity in existing linear backscatter filtering algorithms,we develop a nonlinear backscattering adaptive filter based on the spline adaptive filter least mean square(SAF-LMS)algorithm.We also designed an algorithm pause module to retain the original trend of the target echo peak,improving the time discrimination accuracy and anti-interference capability of the fuze.Finally,experiments are conducted with varying signal-to-noise ratios of the original underwater target echo signals.The experimental results show that the average signal-to-noise ratio before and after filtering can be improved by more than31 d B,with an increase of up to 76%in extreme detection distance.
文摘In Wireless Sensor Networks(WSNs),Clustering process is widely utilized for increasing the lifespan with sustained energy stability during data transmission.Several clustering protocols were devised for extending network lifetime,but most of them failed in handling the problem of fixed clustering,static rounds,and inadequate Cluster Head(CH)selection criteria which consumes more energy.In this paper,Stochastic Ranking Improved Teaching-Learning and Adaptive Grasshopper Optimization Algorithm(SRITL-AGOA)-based Clustering Scheme for energy stabilization and extending network lifespan.This SRITL-AGOA selected CH depending on the weightage of factors such as node mobility degree,neighbour's density distance to sink,single-hop or multihop communication and Residual Energy(RE)that directly influences the energy consumption of sensor nodes.In specific,Grasshopper Optimization Algorithm(GOA)is improved through tangent-based nonlinear strategy for enhancing the ability of global optimization.On the other hand,stochastic ranking and violation constraint handling strategies are embedded into Teaching-Learning-based Optimization Algorithm(TLOA)for improving its exploitation tendencies.Then,SR and VCH improved TLOA is embedded into the exploitation phase of AGOA for selecting better CH by maintaining better balance amid exploration and exploitation.Simulation results confirmed that the proposed SRITL-AGOA improved throughput by 21.86%,network stability by 18.94%,load balancing by 16.14%with minimized energy depletion by19.21%,compared to the competitive CH selection approaches.
基金supported by the National Natural Science Foundation of China(Nos.62265010,62061024)Gansu Province Science and Technology Plan(No.23YFGA0062)Gansu Province Innovation Fund(No.2022A-215)。
文摘The paper proposes a wireless sensor network(WSN)localization algorithm based on adaptive whale neural network and extended Kalman filtering to address the problem of excessive reliance on environmental parameters A and signal constant n in traditional signal propagation path loss models.This algorithm utilizes the adaptive whale optimization algorithm to iteratively optimize the parameters of the backpropagation(BP)neural network,thereby enhancing its prediction performance.To address the issue of low accuracy and large errors in traditional received signal strength indication(RSSI),the algorithm first uses the extended Kalman filtering model to smooth the RSSI signal values to suppress the influence of noise and outliers on the estimation results.The processed RSSI values are used as inputs to the neural network,with distance values as outputs,resulting in more accurate ranging results.Finally,the position of the node to be measured is determined by combining the weighted centroid algorithm.Experimental simulation results show that compared to the standard centroid algorithm,weighted centroid algorithm,BP weighted centroid algorithm,and whale optimization algorithm(WOA)-BP weighted centroid algorithm,the proposed algorithm reduces the average localization error by 58.23%,42.71%,31.89%,and 17.57%,respectively,validating the effectiveness and superiority of the algorithm.
文摘The performance of genetic algorithm(GA) is determined by the capability of search and optimization for satisfactory solutions. The new adaptive genetic algorithm(AGA) is built for inducing suitable search and optimization relationship. The use of six fuzzy logic controllers(6FLCs) is proposed for dynamic control genetic operating parameters of a symbolic-coded GA. This paper uses AGA based on 6FLCs to deal with the travelling salesman problem (TSP). Experimental results show that AGA based on 6FLCs is more efficient than a standard GA in solving combinatorial optimization problems similar to TSP.
基金Supported by the National Natural Science Foundation of China(61139002,61171132)the Natural Science Foundation of Jiangsu Education Department(12KJB520013)+2 种基金the Fundamental Research Funds for the Central Universitiesthe Funding of Jiangsu Innovation Program for Graduate Education(CXZZ110219)the Open Project Program of State Key Lab for Novel Software Technology in Nanjing University(KFKT2012B28)
文摘Attribute reduction is an important process in rough set theory.Finding minimum attribute reduction has been proven to help the user-oriented make better knowledge discovery in some cases.In this paper,an efficient minimum attribute reduction algorithm is proposed based on the multilevel evolutionary tree with self-adaptive subpopulations.A model of multilevel evolutionary tree with self-adaptive subpopulations is constructed,and interacting attribute sets are better decomposed into subsets by the self-adaptive mechanism of elitist populations.Moreover it can self-adapt the subpopulation sizes according to the historical performance record so that interacting attribute decision variables are captured into the same grouped subpopulation,which will be extended to better performance in both quality of solution and competitive computation complexity for minimum attribute reduction.The conducted experiments show the proposed algorithm is better on both efficiency and accuracy of minimum attribute reduction than some representative algorithms.Finally the proposed algorithm is applied to magnetic resonance image(MRI)segmentation,and its stronger applicability is further demonstrated by the effective and robust segmentation results.
文摘A complete mesh free adaptive algorithm （MFAA）, with solution adaptation and geometric adaptation, is developed to improve the resolution of flow features and to replace traditional global refinement techniques in structured grids. Unnecessary redundant points and elements are avoided by using the mesh free local clouds refinement technology in shock influencing regions and regions near large curvature places on the boundary. Inviscid compressible flows over NACA0012 and RAE2822 airfoils are computed. Finally numerical results validate the accuracy of the above method.
文摘On the basis of the theory of adaptive active noise control(AANC) in a duct, this article discusses the algorithms of the adaptive control, compares the algorithm characteristics using LMS, RLS and LSL algorithms in the adaptive filter in the AANC system, derives the recursive formulas of LMS algorithm. and obtains the LMS algorithm in computer simulation using FIR and IIR filters in AANC system. By means of simulation, we compare the attenuation levels with various input signals in AANC system and discuss the effects of step factor, order of filters and sound delay on the algorithm's convergence rate and attenuation level.We also discuss the attenuation levels with sound feedback using are and IIR filters in AANC system.
文摘To reduce the vibration in the suspension, semi active suspension system was employed. And its CARMA model was built. Two adaptive control schemes, the minimum variance self tuning control algorithm and the pole configuration self tuning control algorithm, were proposed. The former can make the variance of the output minimum while the latter can make dynamic behavior satisfying. The stability of the two schemes was analyzed. Simulations of them show that the acceleration in the vertical direction has been reduced greatly. The purpose of reducing vibration is realized. The two schemes can reduce the vibration in the suspension and have some practicability.
文摘A new algorithm, called the adaptive exponent smoothing gradient algorithm (AESGA), is developed from Widrow′s LMS algorithm. It is based on the fact that LMS algorithm has properties of time delaying and low pass filtering. This paper shows that the algorithm, on the domain of {Ω 1:α∈(0,1)}×{Ω 2:β(0,∞)} , unbiasedly and asymptotically converges to the Winner solution when the signal is a stationary Gauss stochastic process. The convergent property and the performance misadjustment are analyzed in theory. And calculation method of the algorithm is also suggested. Numerical results given by computer simulations show that the algorithm is effective.
基金supported by the the Youth Science and Technology Innovation Fund (Science)(Nos.NS2014070, NS2014070)
文摘Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.
文摘An improved algorithm is presented to identify the secondary path based on the adaptive notch filter approach. Since the interference from the narrow band excitation signal is suppressed by the adaptive notch filter, the convergent speed of the on-line control path identification process is significantly improved. As a result, the controller performance is greatly enhanced. Besides the algorithm development, some important factors, such as the influence of reference signal on the controller convergent speed, are also discussed. The effectiveness of the algorithm is verified by experimental results.
基金Project supported by the Key Scientific Equipment Development Project of China(Grant No.ZDYZ2013-2)the National High-Tech R&D Program of China(Grant Nos.G128201-G158201 and G128603-G158603)+2 种基金the Innovation Fund of Chinese Academy of Science(Grant No.CXJJ-16M208)the Youth Innovation Promotion Association of the Chinese Academy of Sciencesthe Outstanding Young Scientists,Chinese Academy of Sciences
文摘We propose a slope-based decoupling algorithm to simultaneously control the dual deformable mirrors （DMs） in a woofer-tweeter adaptive optics system. This algorithm can directly use the woofer＇s response matrix measured from a Shack-Hartmann wave-front sensor to construct a slope-based orthogonal basis, and then selectively distribute the large- amplitude low-order aberration to woofer DM and the remaining aberration to tweeter DM through the slope-based orthogonal basis. At the same moment, in order to avoid the two DMs generating opposite compensation, a constraint matrix used to reset tweeter control vector is convenient to be calculated with the slope-based orthogonal basis. Numeral simulation demonstrates that this algorithm has a good performance to control the adaptive optics system with dual DMs simultaneously. Compared with the typical decoupling algorithm, this algorithm can take full use of the compensation ability of woofer DM and release the stroke of tweeter DM to compensate high-order aberration. More importantly, it does not need to measure the accurate shape of tweeter＇s influence function and keeps better performance of restraining the coupling error with the continuous-dynamic aberration.
文摘An improved adaptive genetic algorithm is presented in this paper. It primarily includes two modified methods： one is novel adaptive probabilities of crossover and mutation, the other is truncated selection approach. This algorithm has been validated to be superior to the simple genetic algorithm （SGA） by a complicated binary testing function. Then the proposed algorithm is applied to optimizing the planar retrodirective array to reduce the cost of the hardware. The fitness function is discussed in the optimization example. After optimization, the sparse planar retrodirective antenna array keeps excellent retrodirectivity, while the array architecture has been simplified by 34%. The optimized antenna array can replace uniform full array effectively. Results show that this work will gain more engineering benefits in practice.
基金Supported by the National Natural Science Foundation of China(51175262)the Research Fund for Doctoral Program of Higher Education of China(20093218110020)+2 种基金the Jiangsu Province Science Foundation for Excellent Youths(BK201210111)the Jiangsu Province Industry-Academy-Research Grant(BY201220116)the Innovative and Excellent Foundation for Doctoral Dissertation of Nanjing University of Aeronautics and Astronautics(BCXJ10-09)
文摘An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.
基金supported by the National Natural Science Foundation of China (Grant No. 61471138, 50909029 and 61531012)Program of International S\&T Cooperation (Grant No. 2013DFR20050)+1 种基金the Defense Industrial Technology Development Program (Grant No. B2420132004)the Acoustic Science and Technology Laboratory (2014)
文摘To improve the identification capability of AP algorithm in time-varying sparse system, we propose a block parallel l_0-SWL-DCD-AP algorithm in this paper. In the proposed algorithm, we first introduce the l_0-norm constraint to promote its application for sparse system. Second, we use the shrinkage denoising method to improve its track ability. Third, we adopt the widely linear processing to take advantage of the non-circular properties of communication signals. Last, to reduce the high computational complexity and make it easy to implemented, we utilize the dichotomous coordinate descent(DCD) iterations and the parallel processing to deal with the tapweight update in the proposed algorithm. To verify the convergence condition of the proposed algorithm, we also analyze its steadystate behavior. Several simulation are done and results show that the proposed algorithm can achieve a faster convergence speed and a lower steady-state misalignment than similar APA-type algorithm. When apply the proposed algorithm in the decision feedback equalizer(DFE), the bite error rate(BER) decreases obviously.
基金supported by the National Key Scientific and Research Equipment Development Project of China(Grant No.ZDYZ2013-2)the National Natural Science Foundation of China(Grant No.11173008)the Sichuan Provincial Outstanding Youth Academic Technology Leaders Program,China(Grant No.2012JQ0012)
文摘Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltages directly from wavefront slopes through pre-measuring the relational matrix between deformable mirror actuators and Hartmann wavefront sensor with perfect real-time characteristic and stability. However, with increasing the number of sub-apertures in wavefront sensor and deformable mirror actuators of adaptive optics systems, the matrix operation in direct gradient algorithm takes too much time, which becomes a major factor influencing control effect of adaptive optics systems. In this paper we apply an iterative wavefront control algorithm to high-resolution adaptive optics systems, in which the voltages of each actuator are obtained through iteration arithmetic, which gains great advantage in calculation and storage. For AO system with thousands of actuators, the computational complexity estimate is about O(n2) ～ O(n3) in direct gradient wavefront control algorithm, while the computational complexity estimate in iterative wavefront control algorithm is about O(n) ～(O(n)3/2), in which n is the number of actuators of AO system. And the more the numbers of sub-apertures and deformable mirror actuators, the more significant advantage the iterative wavefront control algorithm exhibits.
基金supported partly by the National Science and Technology Major Project of China(Grant No.2016ZX05025-001006)Major Science and Technology Project of CNPC(Grant No.ZD2019-183-007)
文摘Well production optimization is a complex and time-consuming task in the oilfield development.The combination of reservoir numerical simulator with optimization algorithms is usually used to optimize well production.This method spends most of computing time in objective function evaluation by reservoir numerical simulator which limits its optimization efficiency.To improve optimization efficiency,a well production optimization method using streamline features-based objective function and Bayesian adaptive direct search optimization(BADS)algorithm is established.This new objective function,which represents the water flooding potential,is extracted from streamline features.It only needs to call the streamline simulator to run one time step,instead of calling the simulator to calculate the target value at the end of development,which greatly reduces the running time of the simulator.Then the well production optimization model is established and solved by the BADS algorithm.The feasibility of the new objective function and the efficiency of this optimization method are verified by three examples.Results demonstrate that the new objective function is positively correlated with the cumulative oil production.And the BADS algorithm is superior to other common algorithms in convergence speed,solution stability and optimization accuracy.Besides,this method can significantly accelerate the speed of well production optimization process compared with the objective function calculated by other conventional methods.It can provide a more effective basis for determining the optimal well production for actual oilfield development.
基金supported by the National Science Foundation （NSF） under Grants No.60832001,No.61271174 the National State Key Lab oratory of Integrated Service Network （ISN） under Grant No.ISN01080202
文摘To address the issue of field size in random network coding, we propose an Improved Adaptive Random Convolutional Network Coding (IARCNC) algorithm to considerably reduce the amount of occupied memory. The operation of IARCNC is similar to that of Adaptive Random Convolutional Network Coding (ARCNC), with the coefficients of local encoding kernels chosen uniformly at random over a small finite field. The difference is that the length of the local encoding kernels at the nodes used by IARCNC is constrained by the depth; meanwhile, increases until all the related sink nodes can be decoded. This restriction can make the code length distribution more reasonable. Therefore, IARCNC retains the advantages of ARCNC, such as a small decoding delay and partial adaptation to an unknown topology without an early estimation of the field size. In addition, it has its own advantage, that is, a higher reduction in memory use. The simulation and the example show the effectiveness of the proposed algorithm.
基金Supported by the National Natural Science Foundation of China （50979017, NSFC60775060） the National High Technology Ship Research Project of China （GJCB09001）
文摘In the normal operation condition, a conventional square-root cubature Kalman filter （SRCKF） gives sufficiently good estimation results. However, if the measurements are not reliable, the SRCKF may give inaccurate results and diverges by time. This study introduces an adaptive SRCKF algorithm with the filter gain correction for the case of measurement malfunctions. By proposing a switching criterion, an optimal filter is selected from the adaptive and conventional SRCKF according to the measurement quality. A subsystem soft fault detection algorithm is built with the filter residual. Utilizing a clear subsystem fault coefficient, the faulty subsystem is isolated as a result of the system reconstruction. In order to improve the performance of the multi-sensor system, a hybrid fusion algorithm is presented based on the adaptive SRCKF. The state and error covariance matrix are also predicted by the priori fusion estimates, and are updated by the predicted and estimated information of subsystems. The proposed algorithms were applied to the vessel dynamic positioning system simulation. They were compared with normal SRCKF and local estimation weighted fusion algorithm. The simulation results show that the presented adaptive SRCKF improves the robustness of subsystem filtering, and the hybrid fusion algorithm has the better performance. The simulation verifies the effectiveness of the proposed algorithms.
基金Supported by Basic Research Foundation of National Defence (No. B0203-031)
文摘Multiple genetic algorithms (GAs) need a large population size, which will take a long time for evolution. A new fuzzy adaptive GA is proposed in this paper. This algorithm is more effective in global search while keeping the overall population size constant. The simulation results of function optimization show that with the proposed algorithm, the phenomenon of premature convergence can be overcome effectively, and a satisfying optimization result is obtained.
