期刊文献+
共找到252,655篇文章
< 1 2 250 >
每页显示 20 50 100
Study on the destabilizing damage precursors of cemented tailings backfill based on critical slowing down theory combined with multiple denoising algorithms under consideration of initial defect conditions 认领 引用 被引量:1
1
作者 ZHAO Kang ZHONG Jun-cheng +3 位作者 YAN Ya-jing LIU Yang WEN Dao-tan XIAO Wei-ling 《Journal of Central South University》 SCIE EI CAS CSCD 2026年第1期375-399,共25页
The cemented tailings backfill(CTB)with initial defects is more prone to destabilization damage under the influence of various unfavorable factors during the mining process.In order to investigate its influence on the... The cemented tailings backfill(CTB)with initial defects is more prone to destabilization damage under the influence of various unfavorable factors during the mining process.In order to investigate its influence on the stability of underground mining engineering,this paper simulates the generation of different degrees of initial defects inside the CTB by adding different contents of air-entraining agent(AEA),investigates the acoustic emission RA/AF eigenvalues of CTB with different contents of AEA under uniaxial compression,and adopts various denoising algorithms(e.g.,moving average smoothing,median filtering,and outlier detection)to improve the accuracy of the data.The variance and autocorrelation coefficients of RA/AF parameters were analyzed in conjunction with the critical slowing down(CSD)theory.The results show that the acoustic emission RA/AF values can be used to characterize the progressive damage evolution of CTB.The denoising algorithm processed the AE signals to reduce the effects of extraneous noise and anomalous spikes.Changes in the variance curves provide clear precursor information,while abrupt changes in the autocorrelation coefficient can be used as an auxiliary localization warning signal.The phenomenon of dramatic increase in the variance and autocorrelation coefficient curves during the compression-tightening stage,which is influenced by the initial defects,can lead to false warnings.As the initial defects of the CTB increase,its instability precursor time and instability time are prolonged,the peak stress decreases,and the time difference between the CTB and the instability damage is smaller.The results provide a new method for real-time monitoring and early warning of CTB instability damage. 展开更多
关键词 initial defects cemented tailings backfill critical slowing down acoustic emission RA/AF values denoising algorithms
暂未订购 下载PDF
Optimization of the frequency offset increment of FDA-MIMO based on cuckoo search algorithm 认领 引用 被引量:2
2
作者 WANG Bo ZHAO Yu +2 位作者 LI Yonglin YANG Rennong XUE Junjie 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2026年第1期157-170,共14页
Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic e... Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic environments.The effectiveness of interference suppression by FDA-MIMO is limited by the inherent range-angle coupling issue in the FDA beampattern.Existing literature primarily focuses on control methods for FDA-MIMO radar beam direction under the assumption of static beampatterns,with insufficient exploration of techniques for managing nonstationary beam directions.To address this gap,this paper initially introduces the FDA-MIMO signal model and the calculation formula for the FDA-MIMO array output using the minimum variance distortionless response(MVDR)beamformer.Building on this,the problem of determining the optimal frequency offset for the FDA is rephrased as a convex optimization problem,which is then resolved using the cuckoo search(CS)algorithm.Simulations confirm the effectiveness of the proposed approach,showing that the frequency offsets obtained through the CS algorithm can create a dot-shaped beam direction at the target location while effectively suppressing interference signals within the mainlobe. 展开更多
关键词 frequency diverse array multiple-input multiple-output(FDA-MIMO) convex optimization cuckoo search algorithm beampattern
暂未订购 下载PDF
Low-complexity APSK demodulation algorithm based on K-means clustering in LEO satellite communication systems 认领 引用
3
作者 Guangfu Wu Xiangrui Meng +1 位作者 Changlin Chen Biqun Xiang 《Digital Communications and Networks》 SCIE EI CSCD 2026年第2期343-353,共11页
Amplitude Phase Shift Keying(APSK)is more suitable for the nonlinear channels of Low Earth Orbit(LEO)satellite communication systems compared to Quadrature Amplitude Modulation(QAM).To tackle challenges posed by Direc... Amplitude Phase Shift Keying(APSK)is more suitable for the nonlinear channels of Low Earth Orbit(LEO)satellite communication systems compared to Quadrature Amplitude Modulation(QAM).To tackle challenges posed by Direct Current(DC)interference and high demodulation complexity,we propose an APSK demodulation algorithm based on K-means clustering.Initially,static DC components are calculated and removed from the received APSK signals.Subsequently,the estimated APSK constellation points serve as initial centers for K-means clustering.These centers are refined through the K-means process and act as theoretical APSK constellation points for the Max-Log-MAP demodulation algorithm,effectively eliminating residual DC.We then introduce a low-complexity APSK demodulation algorithm that utilizes the symmetry of constellation points along with the Euclidean distance between DC-eliminated signals and these constellation points to minimize the set of constellation points.Simulation results indicate that for 32-APSK,our proposed demodulation submodule reduces computational complexity to approximately one-third that of the Max-Log-MAP algorithm while improving Bit Error Rate(BER)performance by about 0.23 dB.Furthermore,end-to-end simulation experiments conducted within LEO satellite communication systems demonstrate that our approach not only maintains this complexity advantage but also enhances BER performance by approximately 1.1 dB. 展开更多
关键词 DC elimination APSK demodulation LEO satellite communication K-means algorithm Max-Log-MAP algorithm
暂未订购 下载PDF
A Metaheuristic Football Optimization Algorithm Integrated with Large Language Models for Automated Seismic Time-Series Modeling 认领 引用
4
作者 Amal H.Alharbi Marwa M.Eid +2 位作者 Nima Khodadadi Ebrahim A.Mattar Sayed Elkenawy 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第5期947-987,共41页
Seismic time series forecasting remains challenging due to the nonlinearity,non-stationarity,and noise of earthquake data,and because deep learning models are sensitive to preprocessing and hyperparameter settings.Alt... Seismic time series forecasting remains challenging due to the nonlinearity,non-stationarity,and noise of earthquake data,and because deep learning models are sensitive to preprocessing and hyperparameter settings.Although recent studies have improved neural architectures and optimization techniques,preprocessing is often treated as a fixed or manually designed stage,with limited integration into model optimization.To address this,this paper proposes an integrated,data-driven modelling framework that combines guided preprocessing with systematic hyperparameter optimization for seismic prediction,specifically forecasting earthquake magnitude from seismic catalog time-series data,with experiments conducted on Canadian seismic records.The method uses a Large Language Model to guide data preparation and feature engineering,rather than fully automate them,and applies deep learning-based forecasting with the N-HITS architecture,optimized via metaheuristic-assisted feature selection and hyperparameter tuning.The Football Optimization Algorithm(FbOA),employed as a metaheuristic optimization strategy in this study,is evaluated and compared with several well-known optimizers under identical conditions.The results show significant performance gains,with FbOA achieving superior accuracy,robustness,and convergence compared to baseline and competing methods.Notably,error metrics are reduced(MSE 3.10×10-7,RMSE 5.57×103),with high performance indicators(r=0.982,R2=0.979,NSE=0.981,WI=0.985).These results highlight the value of integrating guided preprocessing with optimization and demonstrate a scalable framework for high-precision time-series prediction in geophysical and related domains. 展开更多
关键词 Seismic time-series forecasting large language models metaheuristic algorithms football optimization algorithm earthquake modeling
暂未订购 下载PDF
An algorithm-assisted high-resolution D-TOF imaging system with reconfigurable macropixel-based SPAD image sensor 认领 引用
5
作者 Zhe Wang Jia-xing Song +8 位作者 Na Tian Xing-jia Ni Xu Yang Run-jiang Dou Peng Feng Jian Liu Nan-jian Wu Li-yuan Liu Shuang-ming Yu 《Journal of Semiconductors》 EI CAS CSCD 2026年第7期61-71,共11页
Single-photon avalanche diode(SPAD)image sensors are widely used in direct time-of-flight(D-TOF)imaging,but their ranging performance is often constrained by limited laser power.This article presents a SPAD-based D-TO... Single-photon avalanche diode(SPAD)image sensors are widely used in direct time-of-flight(D-TOF)imaging,but their ranging performance is often constrained by limited laser power.This article presents a SPAD-based D-TOF imaging system that combines a reconfigurable macro-pixel sensor architecture with a lightweight depth completion algorithm to achieve long-range depth imaging with enhanced spatial resolution under low optical power.The proposed sensor adopts a back-side illuminated(BSI)3D-stacked architecture with programmable macro-pixels that enhance detection sensitivity and enable flexible sensitivity–resolution trade-offs.An injection-locked ring-oscillator-based time-to-digital converter(RO-TDC)array achieves a time resolution of 152.5 ps,enabling accurate TOF measurement at an optical power of 10 mW.To compensate for macropixel-induced resolution loss,a probabilistic normalized convolutional neural network(pNCNN)is employed for depth completion using sparse depth inputs only.Experimental results demonstrate that up to 30×effective resolution enhancement of the system can be achieved via the depth completion algorithm without changing the physical resolution of the sensor.Additionally,the proposed system achieves a maximum ranging distance of 90 m and a range-to-power figure-of-merit(FOM)of9 m/mW,which validates the effectiveness of the system. 展开更多
关键词 SPAD reconfigurable macro-pixel time-to-digital converter(TDC) depth completion algorithm
暂未订购 下载PDF
Phased-Enhancement Marine Predators Algorithm for Global Optimization and Medical Insurance Fraud Detection 认领 引用
6
作者 Wen Long Yujia Wang +2 位作者 Qinghua Long Yang Yang Ming Xu 《Journal of Bionic Engineering》 SCIE EI CSCD 2026年第2期1088-1111,共24页
The Marine Predators Algorithm(MPA),while promising for complex optimization,suffers from limited solution precision,imbalanced exploration–exploitation,and premature convergence.To address these shortcomings,this pa... The Marine Predators Algorithm(MPA),while promising for complex optimization,suffers from limited solution precision,imbalanced exploration–exploitation,and premature convergence.To address these shortcomings,this paper proposes a phased-enhancement variant named PEMPA,which integrates three novel strategies into distinct phases of MPA:1)embedding historical best positions in the high-velocity ratio phase to refine solution quality;2)introducing an adaptive inertia weight based on an inverted Sigmoid function in the unit-velocity ratio phase to systematically balance exploration and exploitation;and 3)designing a two-stage opposition-based learning operator in the low-velocity ratio phase to prevent premature convergence.The performance of PEMPA is comprehensively evaluated across 23 classical benchmark functions,the IEEE Congress on Evolutionary Computation(CEC)2017 test suite,21 feature selection tasks,and a real-world medical insurance fraud detection problem.Experimental results confirm that the proposed strategies significantly enhance the efficiency and robustness of MPA.Furthermore,PEMPA demonstrates highly competitive performance compared with several state-of-the-art metaheuristic algorithms,validating its effectiveness and scalability for diverse optimization challenges. 展开更多
关键词 Marine predators algorithm Opposite-based learning Inertia weight Numerical optimization Feature selection
A Deep-Learning-Based Constitutive Method for Geomaterials Using a Neural Cutting Plane Algorithm 认领 引用
7
作者 Qingxiang Meng Zijie He +1 位作者 Yajun Cao Weijiang Chu 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第6期158-180,共23页
Constitutive modeling for geomaterials remains challenging because of limited data availability,strong nonlinearity,pressure sensitivity,and the non-smooth characteristics of commonly used yield surfaces.This study pr... Constitutive modeling for geomaterials remains challenging because of limited data availability,strong nonlinearity,pressure sensitivity,and the non-smooth characteristics of commonly used yield surfaces.This study presents a deep-learning-based constitutive method for geomaterials that incorporates a neural stress-integration procedure based on the cutting plane algorithm(CPA).Two compact fully connected networks are trained to learn the yield function and its stress gradient from an augmented stress-state dataset.The trained networks are then incorporated into a cutting plane return-mapping procedure,in which only first-order information is required for the plastic stress return.This avoids explicit analytical yield expressions and second-derivative evaluations and is therefore more naturally compatible with non-smooth Mohr-Coulomb-type yield-surface representations in a first-order returnmapping sense.Numerical results show that the proposed method reproduces the reference Mohr-Coulomb response along the examined monotonic triaxial compression paths.Compared with the finite-difference closest-point projection method(CPPM)implementation considered in this study,the CPA-based neural stress-update procedure requires fewer network calls per update,indicating a more economical implementation for the present learned constitutive framework. 展开更多
关键词 Geomaterials constitutive modeling deep learning cutting plane algorithm stress integration
暂未订购 下载PDF
Experience-guided optimization of jacket foundations for offshore wind turbines in varying water depths based on finite element analysis and the genetic algorithm 认领 引用
8
作者 Jiajia HUANG Tao JIN +6 位作者 Jianwu HUANG Shasha SONG Wei DAI Chaoqun ZUO Lizhong WANG Lilin WANG Zhen GUO 《Journal of Zhejiang University-SCIENCE A》 SCIE EI CAS CSCD 2026年第3期183-199,共17页
Structural optimization plays a crucial role in reducing the cost of offshore wind power,particularly in deep-water regions where the weight of jacket foundations increases substantially.However,there is ongoing debat... Structural optimization plays a crucial role in reducing the cost of offshore wind power,particularly in deep-water regions where the weight of jacket foundations increases substantially.However,there is ongoing debate regarding the water-depth range that is suitable for jacket foundations,and the threshold where floating foundations become more viable.Existing studies have not quantitatively analyzed how water depth affects jacket foundation mass,and have often struggled to handle the high dimensionality and stringent constraints inherent in jacket foundation optimization problems.In this study,we propose an optimization framework that couples parametric finite element analysis with a genetic algorithm to minimize the mass of jacket foundations based on three actual engineering projects at varying water depths.A novel population initialization strategy incorporating engineering experience-based solutions is introduced to improve convergence efficiency and solution quality.Comparative analysis against preliminary designs and existing offshore wind projects demonstrates the model’s ability to achieve cost-effective solutions,specifically reducing required jacket masses by 18.66%,20.98%,and 17.22%at depths of 30.06,60.23,and 89.81 m,respectively.The results reveal a 122.94%increase in jacket mass—from 1431.28 to 3190.90 t—as water depth increases from 30.06 to 89.81 m.The jacket foundation demonstrates superior cost effectiveness in shallow to moderate water depths,as the unit weight per megawatt(MW)of floating foundations is 97.51%and 35.74%higher at water depths of 60.23 and 89.81 m,respectively.Accordingly,the applicable water-depth threshold between the jacket and floating foundations is estimated to be approximately 100 m.The proposed optimization model offers a novel methodology and practical insights for the optimal design of offshore wind turbine support structures in varying marine environments. 展开更多
关键词 Structural optimization Jacket foundation Genetic algorithm Offshore wind power Population initialization Parametric modeling
暂未订购 下载PDF
Equivalent Modeling with Passive Filter Parameter Clustering for Photovoltaic Power Stations Based on a Particle Swarm Optimization K-Means Algorithm 认领 引用
9
作者 Binjiang Hu Yihua Zhu +3 位作者 Liang Tu Zun Ma Xian Meng Kewei Xu 《Energy Engineering》 EI 2026年第1期431-459,共29页
This paper proposes an equivalent modeling method for photovoltaic(PV)power stations via a particle swarm optimization(PSO)K-means clustering(KMC)algorithm with passive filter parameter clustering to address the compl... This paper proposes an equivalent modeling method for photovoltaic(PV)power stations via a particle swarm optimization(PSO)K-means clustering(KMC)algorithm with passive filter parameter clustering to address the complexities,simulation time cost and convergence problems of detailed PV power station models.First,the amplitude–frequency curves of different filter parameters are analyzed.Based on the results,a grouping parameter set for characterizing the external filter characteristics is established.These parameters are further defined as clustering parameters.A single PV inverter model is then established as a prerequisite foundation.The proposed equivalent method combines the global search capability of PSO with the rapid convergence of KMC,effectively overcoming the tendency of KMC to become trapped in local optima.This approach enhances both clustering accuracy and numerical stability when determining equivalence for PV inverter units.Using the proposed clustering method,both a detailed PV power station model and an equivalent model are developed and compared.Simulation and hardwarein-loop(HIL)results based on the equivalent model verify that the equivalent method accurately represents the dynamic characteristics of PVpower stations and adapts well to different operating conditions.The proposed equivalent modeling method provides an effective analysis tool for future renewable energy integration research. 展开更多
关键词 Photovoltaic power station multi-machine equivalentmodeling particle swarmoptimization K-means clustering algorithm
暂未订购 下载PDF
Millimeter wave imaging of Range Migration Algorithm with adaptive background filtering 认领 引用
10
作者 CHENG Zhi-Hua ZHOU Ran +3 位作者 WANG Meng YU Tao WANG Yu-Lan YAO Jian-Quan 《红外与毫米波学报》 SCIE EI CAS CSCD 北大核心 2026年第2期279-284,共6页
This paper proposes a novel Range Migration Algorithm(RMA)integrated with an adaptive background filtering method specifically designed for near-field millimeter-wave imaging scenarios where targets are in close proxi... This paper proposes a novel Range Migration Algorithm(RMA)integrated with an adaptive background filtering method specifically designed for near-field millimeter-wave imaging scenarios where targets are in close proximity to background structures.This method simulates the attention distribution mode of the human visual system which is used in Artificial Intelligence(AI)and called the Attention Mechanism.Based on the concept of static clutter filtering,the frequency-domain signals of the scanning aperture are divided into grid cells.Background scattering functions are established by analyzing the motion processes within each cell,and the background interference is linearly filtered out.An analysis of the manifestation of background scattering interference within the algorithm is carried out,and the impact of the grid cell dimension on the imaging quality is investigated.Experimental results show that the proposed method exhibits the capability to enhance the signal-to-noise ratio of both the target and the background.It effectively suppresses the background interference,leading to a more prominent image,meanwhile without imposing the excessive computational load.The method offers a novel solution for improving the performance of millimeter-wave imaging technology in practical applications. 展开更多
关键词 information processing technology millimeter-wave imaging Range Migration Algorithm(RMA) attention mechanism adaptive background filtering
暂未订购 下载PDF
Theory Evolution Optimization:A Metaheuristic Algorithm BaSed on Evolution Process of Theory 认领 引用
11
作者 Jiacong Liu Jiaze Tu +5 位作者 Chunguang Bi Huiling Chen Ali Asghar Heidari Hao Xie Lei Liu Yi Chen 《Journal of Bionic Engineering》 SCIE EI CSCD 2026年第2期1015-1060,共46页
Metaheuristic algorithms have emerged as indispensable tools for solving NP-hard optimization problems that defy traditional methods.To advance the field’s focus on algorithmic performance,this study introduces the T... Metaheuristic algorithms have emerged as indispensable tools for solving NP-hard optimization problems that defy traditional methods.To advance the field’s focus on algorithmic performance,this study introduces the Theory Evolution Optimization(TEO)–an efficient metaheuristic inspired by the evolution of scientific theory.TEO simulates the competitive,accumulative,and replacement processes among scientific hypotheses,mirroring the evolution from a hypothesis to an established scientific theory.The performance of TEO is validated through extensive experimental simulations and benchmarked against 28 popular algorithms,including highly competitive champions such as EBOwithCMAR,LSHADE_cnEpSi,and LSHADE.Pairwise comparisons between TEO and the latest algorithms are conducted using the Wilcoxon signed-rank test,with multiple comparisons managed by the Friedman test.Initially,TEO is tested on the classical IEEE CEC2017 and the latest IEEE CEC2022 benchmark functions.TEO successfully addresses four prominent engineering design problems in constrained continuous space for practical applications.Additionally,a binary TEO(BTEO)variant is introduced and applied to feature selection tasks in discrete space.Experimental results consistently demonstrate that TEO proposes highly competitive outcomes in optimization problems.The source codes for this research are accessible to the public at http://gffzze767f4cc5ce545d8s0w90quufkp0n6wv5.ffgz.tsg.suse.edu.cn/TEO.html. 展开更多
关键词 Optimization,metaheuristic algorithms Evolution of scientific theory Theory evolution optimizers Engineering design optimization Feature selection
An APO Algorithm Based on Taguchi Methods and Its Application in Multi-Level Image Segmentation 认领 引用
12
作者 Jeng-Shyang Pan Yan-Na Wei +3 位作者 Ling-Da Chi Shu-Chuan Chu Ru-Yu Wang Junzo Watada 《Computers, Materials & Continua》 SCIE EI 2026年第5期814-837,共24页
Multilevel image segmentation is a critical task in image analysis,which imposes high requirements on the global search capability and convergence efficiency of segmentation algorithms.In this paper,an improved Artifi... Multilevel image segmentation is a critical task in image analysis,which imposes high requirements on the global search capability and convergence efficiency of segmentation algorithms.In this paper,an improved Artificial Protozoa Optimization algorithm,termed the two-stage Taguchi-assisted Gaussian–Levy Artificial Protozoa Optimization(TGAPO)algorithm,is proposed and applied tomultilevel image segmentation.The proposed algorithm adopts a two-stage evolutionary mechanism.In the first stage,Gaussian perturbation is introduced to enhance local search capability;in the second stage,Levy flight is incorporated to expand the global search range;and finally,the Taguchi strategy is employed to further refine the optimal solution.Consequently,the global optimization performance and robustness of the algorithm are significantly improved.To evaluate the effectiveness of the proposed TGAPO algorithm,comparative experiments are conducted with representative optimization algorithms,including the Grey Wolf Optimizer(GWO)and Particle Swarm Optimization(PSO),in the context ofmultilevel image segmentation.The segmentation quality is assessed using the minimum cross-entropy function as the performance metric.Experimental results demonstrate that the TGAPO algorithm outperforms the comparison algorithms in terms of segmentation accuracy and convergence speed,and exhibits superior stability in high-threshold segmentation tasks.Furthermore,the proposedmethod achieves excellentmulti-threshold segmentation performance for color images and shows strong potential for practical applications. 展开更多
关键词 Meta-heuristic algorithm multilevel image segmentation taguchi strategy minimum cross-entropy threshold artificial protozoa optimization(APO)
暂未订购 下载PDF
Structural Reliability Analysis Based on Differential Evolution Algorithm and Hypersphere Integration 认领 引用
13
作者 CHEN Zhenzhong HAN Zhuo +4 位作者 WANG Peiyu PAN Qianghua LI Xiaoke GAN Xuehui CHEN Ge 《Journal of Donghua University(English Edition)》 CAS 2026年第1期118-130,共13页
In reliability analyses,the absence of a priori information on the most probable point of failure(MPP)may result in overlooking critical points,thereby leading to biased assessment outcomes.Moreover,second-order relia... In reliability analyses,the absence of a priori information on the most probable point of failure(MPP)may result in overlooking critical points,thereby leading to biased assessment outcomes.Moreover,second-order reliability methods exhibit limited accuracy in highly nonlinear scenarios.To overcome these challenges,a novel reliability analysis strategy based on a multimodal differential evolution algorithm and a hypersphere integration method is proposed.Initially,the penalty function method is employed to reformulate the MPP search problem as a conditionally constrained optimization task.Subsequently,a differential evolution algorithm incorporating a population delineation strategy is utilized to identify all MPPs.Finally,a paraboloid equation is constructed based on the curvature of the limit-state function at the MPPs,and the failure probability of the structure is calculated by using the hypersphere integration method.The localization effectiveness of the MPPs is compared through multiple numerical cases and two engineering examples,with accuracy comparisons of failure probabilities against the first-order reliability method(FORM)and the secondorder reliability method(SORM).The results indicate that the method effectively identifies existing MPPs and achieves higher solution precision. 展开更多
关键词 reliability analysis design point positioning differential evolution algorithm hypersphere integration
暂未订购 下载PDF
Structural Damage Diagnosis Based onMulti-Stage Sparrow Search Algorithm 认领 引用
14
作者 Lijun Yang Qiuwei Yang 《Computers, Materials & Continua》 SCIE EI 2026年第9期2449-2468,共20页
This study proposes a Multi-Stage Sparrow Search Algorithm(MS-SSA)for precise structural damage identification.Initially,the structural static displacement sensitivity formulation is derived via the Sherman-Morrison-W... This study proposes a Multi-Stage Sparrow Search Algorithm(MS-SSA)for precise structural damage identification.Initially,the structural static displacement sensitivity formulation is derived via the Sherman-Morrison-Woodbury formula,and an objective function is constructed by integrating the sensitivity equations with the L2-norm penalty.Subsequently,MS-SSA is implemented to sequentially achieve preliminary damage localization and accurate quantification.In the localization phase,a constrained narrow-bound search space is predefined to identify potential damage regions.Leveraging this feedback,the sensitivity equations are condensed,and the search boundaries are adaptively refined for the quantification phase,where SSA is reapplied to precisely determine damage severity while mitigating misjudgments.TheMS-SSA framework exhibits two distinct advantages:(i)Phase I localization accelerates convergence by constraining the search space,as it does not target precise quantification;and(ii)the significant reduction in unknowns achieved by excluding intact elements in Phase II enables rapid convergence to the global optimum.Comparative studies against the GreyWolf Optimizer(GWO),Whale Optimization Algorithm(WOA),and standard SSA demonstrate that the proposed method effectively overcomes computational instability,slowconvergence,and large errors inherent in swarm intelligence optimization for damage identification.Specifically,numerical case studies reveal that the identification error is reduced to merely 9%~22%of that associated with existing methods,with experimental validation confirming reductions to 18%~22%.Overall,the proposed approach achieves high-fidelity damage identification while eliminating false positives and false negatives. 展开更多
关键词 Damage diagnosis static displacement sensitivity Sparrow Search Algorithm(SSA) narrow search range
暂未订购 下载PDF
PID Steering Control Method of Agricultural Robot Based on Fusion of Particle Swarm Optimization and Genetic Algorithm 认领 引用 被引量:4
15
作者 ZHAO Longlian ZHANG Jiachuang +2 位作者 LI Mei DONG Zhicheng LI Junhui 《农业机械学报》 EI CAS CSCD 北大核心 2026年第1期358-367,共10页
Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion... Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots. 展开更多
关键词 agricultural robot steering PID control particle swarm optimization algorithm genetic algorithm
暂未订购 下载PDF
Pedestrian detection of infrared images based on an improved FCOS algorithm 认领 引用
16
作者 Fuzhen ZHU Hao HAN +1 位作者 Hengfei JIA Bing ZHU 《Optoelectronics Letters》 EI 2026年第2期105-110,共6页
The current infrared image pedestrian detectors have problems with high rates of false positives and false negatives. To solve these problems, we proposed an improved anchor-free fully convolutional one-stage object d... The current infrared image pedestrian detectors have problems with high rates of false positives and false negatives. To solve these problems, we proposed an improved anchor-free fully convolutional one-stage object detection(FCOS) algorithm. Firstly, we introduced the channel attention module squeeze excitation(SE)-Block in the FCOS backbone network, which was used to learn how to model the relative importance between different feature channels, and to achieve the weight recalibration of the features extracted from the convolution neural network, and improve the weight values that are more important for pedestrian target detection. Secondly, soft non-maximum suppression(Soft-NMS) replaced the conventional NMS within the algorithm's post-processing phase, which was used to reduce the probability of missed detection for occluded pedestrians. The experimental results show that our improved FCOS algorithm improves the average precision(AP) by 6.71% on the original dataset and 7.97% on the augmented KAIST pedestrian dataset compared with the original FCOS algorithm. Our improvements effectively meet the real-time requirements and there is no significant decrease in speed compared with the original FCOS algorithm, and decreased the false positives and false negatives for infrared image pedestrian detection. 展开更多
关键词 weight recalibration pedestrian detection infrared image pedestrian detectors channel attention module learn how model relative importance different feature channels improved FCOS algorithm infrared images Squeeze Excitation SE block
暂未订购 下载PDF
Prediction of Asphalt Pavement Rutting Depth Based on Multi-Model Fusion of Stacking Algorithm 认领 引用 被引量:1
17
作者 Chenhui Peng Jinbiao Tang Derun Zhang 《Structural Durability & Health Monitoring》 EI 2026年第3期156-171,共16页
Rutting is a serious issue in asphalt pavement,which may reduce the pavement driving quality and safety.Accurately predicting rutting depth is a crucial task in pavement engineering,providing crucial decision support ... Rutting is a serious issue in asphalt pavement,which may reduce the pavement driving quality and safety.Accurately predicting rutting depth is a crucial task in pavement engineering,providing crucial decision support for asphalt pavement design and maintenance.However,accurate prediction of pavement rutting still remains a significant challenge for pavement engineers.This research first selects the loading number,temperature,dynamic modulus,asphalt layer thickness,and base layer type and thickness as candidate features.Data preprocessing,including outlier handling and feature selection,is then performed.Finally,based on the stacking algorithm,a multi-model fusion approach for predicting rutting depth in asphalt pavements is proposed,using ridge regression(RidgeR),K-nearest neighbor(KNN),multilayer perceptron(MLP),and random forest(RF)models as base models,and support vector machine(SVM)as a meta-model.The model is optimized using a Bayesian optimization model.Results demonstrate the feasibility of using correlation analysis for feature selection.Seven features,including axle weight,upper layer temperature,and middle layer modulus,were selected as predictive features.While all the basic models achieved good prediction accuracy,the stacking ensemble model exhibited lower variance and bias,demonstrating superior generalization capability.The asphalt pavement rutting depth prediction method based on the stacking algorithm multi-model fusion proposed in this research can accurately predict the rutting depth. 展开更多
关键词 Rutting prediction asphalt pavement stacking algorithm Bayesian optimization model
暂未订购 下载PDF
Fault Self-Healing Cooperative Strategy of New Energy Distribution Network Based on Improved Ant Colony-Genetic Hybrid Algorithm 认领 引用 被引量:1
18
作者 Fengchao Chen Aoqi Mei +2 位作者 Zheng Liu Ruhao Wu Qiwei Li 《Energy Engineering》 EI 2026年第4期247-267,共21页
With the high proportion of new energy access,the traditional fault self-healing mechanism of the distribution network is challenged.Aiming at the demand for fast recovery of new distribution network faults,this paper... With the high proportion of new energy access,the traditional fault self-healing mechanism of the distribution network is challenged.Aiming at the demand for fast recovery of new distribution network faults,this paper proposes a fault self-healing cooperative strategy for the new energy distribution network based on an improved ant colony-genetic hybrid algorithm.Firstly,the graph theory adjacency matrix is used to characterize the topology of the distribution network,and the dynamic positioning of new energy nodes is realized.Secondly,based on the output model and load characteristic model of wind,photovoltaic,and energy storage,a two-layer cooperative self-healing model of the distribution network is constructed.The upper layer is based on the improved depth-breadth hybrid search(DFS-BFS)to divide the island,with the maximum weight load recovery and the minimum number of switching actions as the goal,combined with the load priority to dynamically restore the key load.The lower layer uses the improved ant colony-genetic hybrid algorithm to solve the fault recovery path with the minimum total power loss load and the minimum network loss as the goal,generate the optimal switching sequence,and verify the power flow constraints.Finally,the simulation results based on the IEEE 33-bus system show that the proposed method can guarantee the power supply of key loads in the distribution network with high-tech energy penetration,restore the power supply of more load nodes with the least switching operation,and effectively reduce the line loss,which verifies the effectiveness and superiority of the method. 展开更多
关键词 Fault recovery identification of topology improved ant colony-genetic hybrid algorithm distribution network self-healing
暂未订购 下载PDF
An Overall Optimization Model Using Metaheuristic Algorithms for the CNN-Based IoT Attack Detection Problem 认领 引用 被引量:1
19
作者 Le Thi Hong Van Le Duc Thuan +1 位作者 Pham Van Huong Nguyen Hieu Minh 《Computers, Materials & Continua》 SCIE EI 2026年第4期1934-1964,共31页
Optimizing convolutional neural networks(CNNs)for IoT attack detection remains a critical yet challenging task due to the need to balance multiple performance metrics beyond mere accuracy.This study proposes a unified... Optimizing convolutional neural networks(CNNs)for IoT attack detection remains a critical yet challenging task due to the need to balance multiple performance metrics beyond mere accuracy.This study proposes a unified and flexible optimization framework that leverages metaheuristic algorithms to automatically optimize CNN configurations for IoT attack detection.Unlike conventional single-objective approaches,the proposed method formulates a global multi-objective fitness function that integrates accuracy,precision,recall,and model size(speed/model complexity penalty)with adjustable weights.This design enables both single-objective and weightedsum multi-objective optimization,allowing adaptive selection of optimal CNN configurations for diverse deployment requirements.Two representativemetaheuristic algorithms,GeneticAlgorithm(GA)and Particle Swarm Optimization(PSO),are employed to optimize CNNhyperparameters and structure.At each generation/iteration,the best configuration is selected as themost balanced solution across optimization objectives,i.e.,the one achieving themaximum value of the global objective function.Experimental validation on two benchmark datasets,Edge-IIoT and CIC-IoT2023,demonstrates that the proposed GA-and PSO-based models significantly enhance detection accuracy(94.8%–98.3%)and generalization compared with manually tuned CNN configurations,while maintaining compact architectures.The results confirm that the multi-objective framework effectively balances predictive performance and computational efficiency.This work establishes a generalizable and adaptive optimization strategy for deep learning-based IoT attack detection and provides a foundation for future hybrid metaheuristic extensions in broader IoT security applications. 展开更多
关键词 Genetic algorithm(GA) particle swarm optimization(PSO) multi-objective optimization convolutional neural network—CNN IoT attack detection metaheuristic optimization CNN configuration
暂未订购 下载PDF
Seismic Data Reconstruction and Noise Suppression Based on an Improved Weighted Fast Projection onto Convex Sets Algorithm 认领 引用
20
作者 Cheng Gao-peng Zhang Hua +3 位作者 Li Hong-xing Song Yu Yue Ming Zhang Kai-dong 《Applied Geophysics》 SCIE CSCD 2026年第1期336-351,433,434,共16页
In eld seismic data acquisition,seismic traces are often aected by substantial data gaps and strong noise interference due to environmental and instrumental factors,thus degrading the resolution and signalto-noise rat... In eld seismic data acquisition,seismic traces are often aected by substantial data gaps and strong noise interference due to environmental and instrumental factors,thus degrading the resolution and signalto-noise ratio(SNR)of the seismic profiles.Effective seismic data reconstruction and noise suppression techniques are therefore essential to recover missing signals and improve data quality.In this study,a fast projection onto convex sets(FPOCS)algorithm is proposed by incorporating an inertial parameter that involves a linear combination of the two preceding iterations based on the traditional projection onto convex sets(POCS)algorithm.Then,a weighting factor is introduced to achieve simultaneous data reconstruction and noise suppression using the weighted fast projection onto convex sets(WFPOCS)algorithm.To further suppress residual random noise in the updated solution,an optimization strategy is adopted by swapping the order of the iterative hard thresholding operator and the projection operator.The nal algorithm,termed the improved weighted fast projection onto convex sets(IWFPOCS),achieves high-efciency reconstruction and effective noise suppression.Compared with WFPOCS,the proposed method maintains fast reconstruction speed while demonstrating superior denoising performance on irregularly missing and noisy datasets.Field data experiments conrm that the proposed method signicantly improves the SNR and resolution of seismic data,oering strong practical potential for subsequent processing and interpretation. 展开更多
关键词 Seismic data reconstruction Fast projection onto convex set algorithm Curvelet transform Weighted fast projection onto convex set algorithm Noise suppression
暂未订购 下载PDF
上一页 1 2 250 下一页 到第
在线咨询 使用帮助 返回顶部 意见反馈