This study proposes a novel time-synchronization protocol inspired by stochastic gradient algorithms.The clock model of each network node in this synchronizer is configured as a generic adaptive filter where different...This study proposes a novel time-synchronization protocol inspired by stochastic gradient algorithms.The clock model of each network node in this synchronizer is configured as a generic adaptive filter where different stochastic gradient algorithms can be adopted for adaptive clock frequency adjustments.The study analyzes the pairwise synchronization behavior of the protocol and proves the generalized convergence of the synchronization error and clock frequency.A novel closed-form expression is also derived for a generalized asymptotic error variance steady state.Steady and convergence analyses are then presented for the synchronization,with frequency adaptations done using least mean square(LMS),the Newton search,the gradient descent(GraDes),the normalized LMS(N-LMS),and the Sign-Data LMS algorithms.Results obtained from real-time experiments showed a better performance of our protocols as compared to the Average Proportional-Integral Synchronization Protocol(AvgPISync)regarding the impact of quantization error on synchronization accuracy,precision,and convergence time.This generalized approach to time synchronization allows flexibility in selecting a suitable protocol for different wireless sensor network applications.展开更多
We consider the sparse identification of multivariate ARX systems, i.e., to recover the zero elements of the unknown parameter matrix. We propose a two-step algorithm, where in the first step the stochastic gradient (...We consider the sparse identification of multivariate ARX systems, i.e., to recover the zero elements of the unknown parameter matrix. We propose a two-step algorithm, where in the first step the stochastic gradient (SG) algorithm is applied to obtain initial estimates of the unknown parameter matrix and in the second step an optimization criterion is introduced for the sparse identification of multivariate ARX systems. Under mild conditions, we prove that by minimizing the criterion function, the zero elements of the unknown parameter matrix can be recovered with a finite number of observations. The performance of the algorithm is testified through a simulation example.展开更多
Failure detection is an essential task in industrial systems for preventing costly downtime and ensuring the seamlessoperation of the system. Current industrial processes are getting smarter with the emergence of Indu...Failure detection is an essential task in industrial systems for preventing costly downtime and ensuring the seamlessoperation of the system. Current industrial processes are getting smarter with the emergence of Industry 4.0.Specifically, various modernized industrial processes have been equipped with quite a few sensors to collectprocess-based data to find faults arising or prevailing in processes along with monitoring the status of processes.Fault diagnosis of rotating machines serves a main role in the engineering field and industrial production. Dueto the disadvantages of existing fault, diagnosis approaches, which greatly depend on professional experienceand human knowledge, intellectual fault diagnosis based on deep learning (DL) has attracted the researcher’sinterest. DL reaches the desired fault classification and automatic feature learning. Therefore, this article designs a Gradient Optimizer Algorithm with Hybrid Deep Learning-based Failure Detection and Classification (GOAHDLFDC)in the industrial environment. The presented GOAHDL-FDC technique initially applies continuous wavelettransform (CWT) for preprocessing the actual vibrational signals of the rotating machinery. Next, the residualnetwork (ResNet18) model was exploited for the extraction of features from the vibration signals which are thenfed into theHDLmodel for automated fault detection. Finally, theGOA-based hyperparameter tuning is performedtoadjust the parameter valuesof theHDLmodel accurately.The experimental result analysis of the GOAHDL-FD Calgorithm takes place using a series of simulations and the experimentation outcomes highlight the better resultsof the GOAHDL-FDC technique under different aspects.展开更多
This paper proposes a gradient conformal design technique to modify the multi-directional stiffness characteristics of 3D printed chiral metamaterials,using various airfoil shapes.The method ensures the integrity of c...This paper proposes a gradient conformal design technique to modify the multi-directional stiffness characteristics of 3D printed chiral metamaterials,using various airfoil shapes.The method ensures the integrity of chiral cell nodal circles while improving load transmission efficiency and enhancing manufacturing precision for 3D printing applications.A parametric design framework,integrating finite element analysis and optimization modules,is developed to enhance the wing’s multidirectional stiffness.The optimization process demonstrates that the distribution of chiral structural ligaments and nodal circles significantly affects wing deformation.The stiffness gradient optimization results reveal a variation of over 78%in tail stiffness performance between the best and worst parameter combinations.Experimental outcomes suggest that this strategy can develop metamaterials with enhanced deformability,offering a promising approach for designing morphing wings.展开更多
The Runge-Kutta optimiser(RUN)algorithm,renowned for its powerful optimisation capabilities,faces challenges in dealing with increasing complexity in real-world problems.Specifically,it shows deficiencies in terms of ...The Runge-Kutta optimiser(RUN)algorithm,renowned for its powerful optimisation capabilities,faces challenges in dealing with increasing complexity in real-world problems.Specifically,it shows deficiencies in terms of limited local exploration capabilities and less precise solutions.Therefore,this research aims to integrate the topological search(TS)mechanism with the gradient search rule(GSR)into the framework of RUN,introducing an enhanced algorithm called TGRUN to improve the performance of the original algorithm.The TS mechanism employs a circular topological scheme to conduct a thorough exploration of solution regions surrounding each solution,enabling a careful examination of valuable solution areas and enhancing the algorithm’s effectiveness in local exploration.To prevent the algorithm from becoming trapped in local optima,the GSR also integrates gradient descent principles to direct the algorithm in a wider investigation of the global solution space.This study conducted a serious of experiments on the IEEE CEC2017 comprehensive benchmark function to assess the enhanced effectiveness of TGRUN.Additionally,the evaluation includes real-world engineering design and feature selection problems serving as an additional test for assessing the optimisation capabilities of the algorithm.The validation outcomes indicate a significant improvement in the optimisation capabilities and solution accuracy of TGRUN.展开更多
The prediction of power grid faults based on meteorological factors is of great significance to reduce economic losses caused by power grid faults. However, the existing methods fail to effectively extract key feature...The prediction of power grid faults based on meteorological factors is of great significance to reduce economic losses caused by power grid faults. However, the existing methods fail to effectively extract key features and accurately predict fault types due to the complexity of meteorological factors and their nonlinear relationships. In response to these challenges, we propose the Feature-Enhanced XGBoost power grid fault prediction method (FE-XGBoost). Specifically, we first combine the gradient boosting decision tree and recursive feature elimination method to extract essential features from meteorological data. Then, we incorporate a piecewise linear chaotic map to enhance the optimization accuracy of the sparrow search algorithm. Finally, we construct an XGBoost-based model for the classification prediction of power grid meteorological faults and optimize the hyperparameters such as the optimal tree depth, optimal learning rate, and optimal number of iterations using an enhanced sparrow search algorithm. Experimental results demonstrate that our method outperforms the baseline models in predicting power grid faults accurately.展开更多
In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of t...In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.展开更多
Conventional empirical equations for estimating undrained shear strength(s_(u))from piezocone penetration test(CPTu)data,without incorporating soil physical properties,often lack the accuracy and robustness required f...Conventional empirical equations for estimating undrained shear strength(s_(u))from piezocone penetration test(CPTu)data,without incorporating soil physical properties,often lack the accuracy and robustness required for geotechnical site investigations.This study introduces a hybrid virus colony search(VCS)algorithm that integrates the standard VCS algorithm with a mutation-based search mechanism to develop high-performance XGBoost learning models to address this limitation.A dataset of 372 seismic CPTu and corresponding soil physical properties data from 26 geotechnical projects in Jiangs_(u)Province,China,was collected for model development.Comparative evaluations demonstrate that the proposed hybrid VCS-XGBoost model exhibits s_(u)perior performance compared to standard meta-heuristic algorithm-based XGBoost models.The res_(u)lts highlight that the consideration of soil physical properties significantly improves the predictive accuracy of s_(u),emphasizing the importance of considering additional soil information beyond CPTu data for accurate s_(u)estimation.展开更多
Choosing appropriate background field data is crucial for gravity field matching navigation.Current research mainly uses gravity anomaly data or gravity gradient data as background fields.However,using gravity gradien...Choosing appropriate background field data is crucial for gravity field matching navigation.Current research mainly uses gravity anomaly data or gravity gradient data as background fields.However,using gravity gradient invariants in existing research is seldom a concern.The gravity gradient tensor has three invariants,named as I_(1),I_(2)and I_(3).I_(1) is a Laplace operator outside the Earth and a Poison operator inside the Earth.The focus of this study is to discuss the performance of the other two invariants of gravity gradients in matching navigation based on the Iterative Closest Contour Point(ICCP)algorithm and compare the matching results with that of the gravity gradient Tzz.The results show that they have almost the same performance when there is no noise,and the background data noises have a large impact on the matching results.There are differences in the anti-interference ability of observation noises for the different components.Under the same random noises in the observations,I2performs a little better than the other two components in terms of position error standard deviation.According to the investigations,since attitude errors can not be avoided and influence the positioning based on Tzz,we recommend adopting invariants of gravity gradients,especially I2,for matching navigation in actual cases.展开更多
The intelligent optimization of a multi-objective evolutionary algorithm is combined with a gradient algorithm. The hybrid multi-objective gradient algorithm is framed by the real number. Test functions are used to an...The intelligent optimization of a multi-objective evolutionary algorithm is combined with a gradient algorithm. The hybrid multi-objective gradient algorithm is framed by the real number. Test functions are used to analyze the efficiency of the algorithm. In the simulation case of the water phantom, the algorithm is applied to an inverse planning process of intensity modulated radiation treatment （IMRT）. The objective functions of planning target volume （PTV） and normal tissue （NT） are based on the average dose distribution. The obtained intensity profile shows that the hybrid multi-objective gradient algorithm saves the computational time and has good accuracy, thus meeting the requirements of practical applications.展开更多
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.展开更多
With the continuous development of full tensor gradiometer （FTG） measurement techniques, three-dimensional （3D） inversion of FTG data is becoming increasingly used in oil and gas exploration. In the fast processin...With the continuous development of full tensor gradiometer （FTG） measurement techniques, three-dimensional （3D） inversion of FTG data is becoming increasingly used in oil and gas exploration. In the fast processing and interpretation of large-scale high-precision data, the use of the graphics processing unit process unit （GPU） and preconditioning methods are very important in the data inversion. In this paper, an improved preconditioned conjugate gradient algorithm is proposed by combining the symmetric successive over-relaxation （SSOR） technique and the incomplete Choleksy decomposition conjugate gradient algorithm （ICCG）. Since preparing the preconditioner requires extra time, a parallel implement based on GPU is proposed. The improved method is then applied in the inversion of noise- contaminated synthetic data to prove its adaptability in the inversion of 3D FTG data. Results show that the parallel SSOR-ICCG algorithm based on NVIDIA Tesla C2050 GPU achieves a speedup of approximately 25 times that of a serial program using a 2.0 GHz Central Processing Unit （CPU）. Real airbome gravity-gradiometry data from Vinton salt dome （south- west Louisiana, USA） are also considered. Good results are obtained, which verifies the efficiency and feasibility of the proposed parallel method in fast inversion of 3D FTG data.展开更多
In this paper, an improved gradient iterative （GI） algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared wi...In this paper, an improved gradient iterative （GI） algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared with the GI algorithm, the improved algorithm reduces computational cost and storage. Finally, the algorithm is tested with GI several numerical examples.展开更多
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.展开更多
Based on the thermal stress distribution for functionally gradient material (FGM) plates, a Genetic Algorithm (GA) method for the thermal stresses optimum design of FGM plate with computer technologies is given. The m...Based on the thermal stress distribution for functionally gradient material (FGM) plates, a Genetic Algorithm (GA) method for the thermal stresses optimum design of FGM plate with computer technologies is given. The minimum thermal stresses combination distribution for FGM is obtained.展开更多
The fast convergence without initial value dependence is the key to solving large angle relative orientation.Therefore,a hybrid conjugate gradient algorithm is proposed in this paper.The concrete process is:①stochast...The fast convergence without initial value dependence is the key to solving large angle relative orientation.Therefore,a hybrid conjugate gradient algorithm is proposed in this paper.The concrete process is:①stochastic hill climbing(SHC)algorithm is used to make a random disturbance to the given initial value of the relative orientation element,and the new value to guarantee the optimization direction is generated.②In local optimization,a super-linear convergent conjugate gradient method is used to replace the steepest descent method in relative orientation to improve its convergence rate.③The global convergence condition is that the calculation error is less than the prescribed limit error.The comparison experiment shows that the method proposed in this paper is independent of the initial value,and has higher accuracy and fewer iterations.展开更多
The dropping off of data during information transmission and the storage device’s damage etc.often leads the sampled data to be non-uniform.The paper, based on the stability theory of irregular wavelet frame and the ...The dropping off of data during information transmission and the storage device’s damage etc.often leads the sampled data to be non-uniform.The paper, based on the stability theory of irregular wavelet frame and the irregular weighted wavelet frame operator,proposed an irregular weighted wavelet fame conjugate gradient iterative algorithm for the reconstruction of non-uniformly sampling signal. Compared the experiment results with the iterative algorithm of the Ref.[5],the new algorithm has remarkable advantages in approximation error,running time and so on.展开更多
基金funded by Universiti Putra Malaysia under a Geran Putra Inisiatif(GPI)research grant with reference to GP-GPI/2023/9762100.
文摘This study proposes a novel time-synchronization protocol inspired by stochastic gradient algorithms.The clock model of each network node in this synchronizer is configured as a generic adaptive filter where different stochastic gradient algorithms can be adopted for adaptive clock frequency adjustments.The study analyzes the pairwise synchronization behavior of the protocol and proves the generalized convergence of the synchronization error and clock frequency.A novel closed-form expression is also derived for a generalized asymptotic error variance steady state.Steady and convergence analyses are then presented for the synchronization,with frequency adaptations done using least mean square(LMS),the Newton search,the gradient descent(GraDes),the normalized LMS(N-LMS),and the Sign-Data LMS algorithms.Results obtained from real-time experiments showed a better performance of our protocols as compared to the Average Proportional-Integral Synchronization Protocol(AvgPISync)regarding the impact of quantization error on synchronization accuracy,precision,and convergence time.This generalized approach to time synchronization allows flexibility in selecting a suitable protocol for different wireless sensor network applications.
文摘We consider the sparse identification of multivariate ARX systems, i.e., to recover the zero elements of the unknown parameter matrix. We propose a two-step algorithm, where in the first step the stochastic gradient (SG) algorithm is applied to obtain initial estimates of the unknown parameter matrix and in the second step an optimization criterion is introduced for the sparse identification of multivariate ARX systems. Under mild conditions, we prove that by minimizing the criterion function, the zero elements of the unknown parameter matrix can be recovered with a finite number of observations. The performance of the algorithm is testified through a simulation example.
基金The Deanship of Scientific Research(DSR)at King Abdulaziz University(KAU),Jeddah,Saudi Arabia has funded this project under Grant No.(G:651-135-1443).
文摘Failure detection is an essential task in industrial systems for preventing costly downtime and ensuring the seamlessoperation of the system. Current industrial processes are getting smarter with the emergence of Industry 4.0.Specifically, various modernized industrial processes have been equipped with quite a few sensors to collectprocess-based data to find faults arising or prevailing in processes along with monitoring the status of processes.Fault diagnosis of rotating machines serves a main role in the engineering field and industrial production. Dueto the disadvantages of existing fault, diagnosis approaches, which greatly depend on professional experienceand human knowledge, intellectual fault diagnosis based on deep learning (DL) has attracted the researcher’sinterest. DL reaches the desired fault classification and automatic feature learning. Therefore, this article designs a Gradient Optimizer Algorithm with Hybrid Deep Learning-based Failure Detection and Classification (GOAHDLFDC)in the industrial environment. The presented GOAHDL-FDC technique initially applies continuous wavelettransform (CWT) for preprocessing the actual vibrational signals of the rotating machinery. Next, the residualnetwork (ResNet18) model was exploited for the extraction of features from the vibration signals which are thenfed into theHDLmodel for automated fault detection. Finally, theGOA-based hyperparameter tuning is performedtoadjust the parameter valuesof theHDLmodel accurately.The experimental result analysis of the GOAHDL-FD Calgorithm takes place using a series of simulations and the experimentation outcomes highlight the better resultsof the GOAHDL-FDC technique under different aspects.
基金Supported by National Natural Science Foundation of China(Grant Nos.52075026 and 52192632)the Fundamental Research Funds for the Central Universities(Grant No.YWF-22-L-1119)。
文摘This paper proposes a gradient conformal design technique to modify the multi-directional stiffness characteristics of 3D printed chiral metamaterials,using various airfoil shapes.The method ensures the integrity of chiral cell nodal circles while improving load transmission efficiency and enhancing manufacturing precision for 3D printing applications.A parametric design framework,integrating finite element analysis and optimization modules,is developed to enhance the wing’s multidirectional stiffness.The optimization process demonstrates that the distribution of chiral structural ligaments and nodal circles significantly affects wing deformation.The stiffness gradient optimization results reveal a variation of over 78%in tail stiffness performance between the best and worst parameter combinations.Experimental outcomes suggest that this strategy can develop metamaterials with enhanced deformability,offering a promising approach for designing morphing wings.
文摘针对历史负荷特征提取困难所导致的短期电力负荷预测精度不高的问题,提出了基于堆叠泛化集成思想的逻辑斯谛灰狼优化-极限梯度提升-轻量级梯度提升机-门控循环单元(logistic grey wolf optimizer-extreme gradient boosting-light gradient boosting machine-gated recurrent unit, LGWO-XGBoost-LightGBM-GRU)的短期电力负荷预测算法。该算法首先使用逻辑斯谛映射对灰狼优化(grey wolf optimizer, GWO)算法进行改进得到LGWO算法,接着使用LGWO算法分别对XGBoost、LightGBM、GRU算法进行参数寻优,然后使用XGBoost、LightGBM算法对数据的不同特征进行初步提炼,最后将提炼的特征合并到历史负荷数据集中作为输入,并使用GRU进行最终的负荷预测,得到预测结果。以某工业园区的负荷预测为例进行验证,结果表明,该算法与最小二乘支持向量机(least squares support vector machines, LS-SVM)算法相比,均方根误差降低了68.85%,平均绝对误差降低了69.57%,平均绝对百分比误差降低了69.97%,决定系数提高了8.42%。该算法提高了短期电力负荷预测的精度。
基金Natural Science Foundation of Zhejiang Province,Grant/Award Numbers:LTGS23E070001,LZ22F020005,LTGY24C060004National Natural Science Foundation of China,Grant/Award Numbers:62076185,62301367,62273263。
文摘The Runge-Kutta optimiser(RUN)algorithm,renowned for its powerful optimisation capabilities,faces challenges in dealing with increasing complexity in real-world problems.Specifically,it shows deficiencies in terms of limited local exploration capabilities and less precise solutions.Therefore,this research aims to integrate the topological search(TS)mechanism with the gradient search rule(GSR)into the framework of RUN,introducing an enhanced algorithm called TGRUN to improve the performance of the original algorithm.The TS mechanism employs a circular topological scheme to conduct a thorough exploration of solution regions surrounding each solution,enabling a careful examination of valuable solution areas and enhancing the algorithm’s effectiveness in local exploration.To prevent the algorithm from becoming trapped in local optima,the GSR also integrates gradient descent principles to direct the algorithm in a wider investigation of the global solution space.This study conducted a serious of experiments on the IEEE CEC2017 comprehensive benchmark function to assess the enhanced effectiveness of TGRUN.Additionally,the evaluation includes real-world engineering design and feature selection problems serving as an additional test for assessing the optimisation capabilities of the algorithm.The validation outcomes indicate a significant improvement in the optimisation capabilities and solution accuracy of TGRUN.
基金supported by the Science and Technology Project of State Grid Jiangsu Electric Power Co.,Ltd.(Research on Power Meteorology Digitalization Application for Future Climate Scenarios and New Energy Operation Risks,J2023076).
文摘The prediction of power grid faults based on meteorological factors is of great significance to reduce economic losses caused by power grid faults. However, the existing methods fail to effectively extract key features and accurately predict fault types due to the complexity of meteorological factors and their nonlinear relationships. In response to these challenges, we propose the Feature-Enhanced XGBoost power grid fault prediction method (FE-XGBoost). Specifically, we first combine the gradient boosting decision tree and recursive feature elimination method to extract essential features from meteorological data. Then, we incorporate a piecewise linear chaotic map to enhance the optimization accuracy of the sparrow search algorithm. Finally, we construct an XGBoost-based model for the classification prediction of power grid meteorological faults and optimize the hyperparameters such as the optimal tree depth, optimal learning rate, and optimal number of iterations using an enhanced sparrow search algorithm. Experimental results demonstrate that our method outperforms the baseline models in predicting power grid faults accurately.
基金National Natural Science Foundation of China(62373187)Forward-looking Layout Special Projects(ILA220591A22)。
文摘In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.
基金funded by the National Science Fund for Distinguished Young Scholars(Grant No.42225206)the National Key R&D Program of China(Grant No.2020YFC1807200)the National Natural Science Foundation of China(Grant No.42072299).
文摘Conventional empirical equations for estimating undrained shear strength(s_(u))from piezocone penetration test(CPTu)data,without incorporating soil physical properties,often lack the accuracy and robustness required for geotechnical site investigations.This study introduces a hybrid virus colony search(VCS)algorithm that integrates the standard VCS algorithm with a mutation-based search mechanism to develop high-performance XGBoost learning models to address this limitation.A dataset of 372 seismic CPTu and corresponding soil physical properties data from 26 geotechnical projects in Jiangs_(u)Province,China,was collected for model development.Comparative evaluations demonstrate that the proposed hybrid VCS-XGBoost model exhibits s_(u)perior performance compared to standard meta-heuristic algorithm-based XGBoost models.The res_(u)lts highlight that the consideration of soil physical properties significantly improves the predictive accuracy of s_(u),emphasizing the importance of considering additional soil information beyond CPTu data for accurate s_(u)estimation.
基金funded by the Key Laboratory of Smart Earth(No.KF2023YB01-12)the National Natural Science Foundation of China(No.42074017)+1 种基金the Key Laboratory Fund Project for Simulation of Complex Electronic Systems(614201004022210)the Chinese Academy of Sciences Youth Innovation Promotion Association(2022126)。
文摘Choosing appropriate background field data is crucial for gravity field matching navigation.Current research mainly uses gravity anomaly data or gravity gradient data as background fields.However,using gravity gradient invariants in existing research is seldom a concern.The gravity gradient tensor has three invariants,named as I_(1),I_(2)and I_(3).I_(1) is a Laplace operator outside the Earth and a Poison operator inside the Earth.The focus of this study is to discuss the performance of the other two invariants of gravity gradients in matching navigation based on the Iterative Closest Contour Point(ICCP)algorithm and compare the matching results with that of the gravity gradient Tzz.The results show that they have almost the same performance when there is no noise,and the background data noises have a large impact on the matching results.There are differences in the anti-interference ability of observation noises for the different components.Under the same random noises in the observations,I2performs a little better than the other two components in terms of position error standard deviation.According to the investigations,since attitude errors can not be avoided and influence the positioning based on Tzz,we recommend adopting invariants of gravity gradients,especially I2,for matching navigation in actual cases.
基金Supported by the National Basic Research Program of China ("973" Program)the National Natural Science Foundation of China (60872112, 10805012)+1 种基金the Natural Science Foundation of Zhejiang Province(Z207588)the College Science Research Project of Anhui Province (KJ2008B268)~~
文摘The intelligent optimization of a multi-objective evolutionary algorithm is combined with a gradient algorithm. The hybrid multi-objective gradient algorithm is framed by the real number. Test functions are used to analyze the efficiency of the algorithm. In the simulation case of the water phantom, the algorithm is applied to an inverse planning process of intensity modulated radiation treatment （IMRT）. The objective functions of planning target volume （PTV） and normal tissue （NT） are based on the average dose distribution. The obtained intensity profile shows that the hybrid multi-objective gradient algorithm saves the computational time and has good accuracy, thus meeting the requirements of practical applications.
文摘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.
基金the Sub-project of National Science and Technology Major Project of China(No.2016ZX05027-002-003)the National Natural Science Foundation of China(No.41404089)+1 种基金the State Key Program of National Natural Science of China(No.41430322)the National Basic Research Program of China(973 Program)(No.2015CB45300)
文摘With the continuous development of full tensor gradiometer （FTG） measurement techniques, three-dimensional （3D） inversion of FTG data is becoming increasingly used in oil and gas exploration. In the fast processing and interpretation of large-scale high-precision data, the use of the graphics processing unit process unit （GPU） and preconditioning methods are very important in the data inversion. In this paper, an improved preconditioned conjugate gradient algorithm is proposed by combining the symmetric successive over-relaxation （SSOR） technique and the incomplete Choleksy decomposition conjugate gradient algorithm （ICCG）. Since preparing the preconditioner requires extra time, a parallel implement based on GPU is proposed. The improved method is then applied in the inversion of noise- contaminated synthetic data to prove its adaptability in the inversion of 3D FTG data. Results show that the parallel SSOR-ICCG algorithm based on NVIDIA Tesla C2050 GPU achieves a speedup of approximately 25 times that of a serial program using a 2.0 GHz Central Processing Unit （CPU）. Real airbome gravity-gradiometry data from Vinton salt dome （south- west Louisiana, USA） are also considered. Good results are obtained, which verifies the efficiency and feasibility of the proposed parallel method in fast inversion of 3D FTG data.
基金Project supported by the National Natural Science Foundation of China （Grant No.10271074）, and the Special Funds for Major Specialities of Shanghai Education Commission （Grant No.J50101）
文摘In this paper, an improved gradient iterative （GI） algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared with the GI algorithm, the improved algorithm reduces computational cost and storage. Finally, the algorithm is tested with GI several numerical examples.
基金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.
文摘Based on the thermal stress distribution for functionally gradient material (FGM) plates, a Genetic Algorithm (GA) method for the thermal stresses optimum design of FGM plate with computer technologies is given. The minimum thermal stresses combination distribution for FGM is obtained.
基金National Natural Science Foundation of China(Nos.4156108241161061)。
文摘The fast convergence without initial value dependence is the key to solving large angle relative orientation.Therefore,a hybrid conjugate gradient algorithm is proposed in this paper.The concrete process is:①stochastic hill climbing(SHC)algorithm is used to make a random disturbance to the given initial value of the relative orientation element,and the new value to guarantee the optimization direction is generated.②In local optimization,a super-linear convergent conjugate gradient method is used to replace the steepest descent method in relative orientation to improve its convergence rate.③The global convergence condition is that the calculation error is less than the prescribed limit error.The comparison experiment shows that the method proposed in this paper is independent of the initial value,and has higher accuracy and fewer iterations.
基金supported by Hunan Education Office Foundation under Grant 06C260
文摘The dropping off of data during information transmission and the storage device’s damage etc.often leads the sampled data to be non-uniform.The paper, based on the stability theory of irregular wavelet frame and the irregular weighted wavelet frame operator,proposed an irregular weighted wavelet fame conjugate gradient iterative algorithm for the reconstruction of non-uniformly sampling signal. Compared the experiment results with the iterative algorithm of the Ref.[5],the new algorithm has remarkable advantages in approximation error,running time and so on.
