期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到246,742篇文章
< 1 2 … 250 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Information Diffusion Models and Fuzzing Algorithms for a Privacy-Aware Data Transmission Scheduling in 6G Heterogeneous ad hoc Networks 认领 引用 被引量：1
1
作者 Borja Bordel Sánchez Ramón Alcarria Tomás Robles 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第2期1214-1234,共21页
In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic h... In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic heterogeneous infrastructures,unstable links and non-uniform hardware capabilities create critical issues regarding security and privacy.Traditional protocols are often too computationally heavy to allow 6G services to achieve their expected Quality-of-Service(QoS).As the transport network is built of ad hoc nodes,there is no guarantee about their trustworthiness or behavior,and transversal functionalities are delegated to the extreme nodes.However,while security can be guaranteed in extreme-to-extreme solutions,privacy cannot,as all intermediate nodes still have to handle the data packets they are transporting.Besides,traditional schemes for private anonymous ad hoc communications are vulnerable against modern intelligent attacks based on learning models.The proposed scheme fulfills this gap.Findings show the probability of a successful intelligent attack reduces by up to 65%compared to ad hoc networks with no privacy protection strategy when used the proposed technology.While congestion probability can remain below 0.001%,as required in 6G services. 展开更多
关键词 6G networks ad hoc networks privacy scheduling algorithms diffusion models fuzzing algorithms
暂未订购 下载PDF
The Optimization Design of Particle-Reinforced Composite Materials Based on the Artificial Fish Swarm Algorithm and Voronoi Cell Finite Element Method 认领 引用
2
作者 Peng Zhang Ran Guo 《Acta Mechanica Solida Sinica》 SCIE EI CSCD 2026年第3期316-328,共13页
In this study,a collaborative optimization framework combining artificial fish swarm algorithm(AFSA)and Voronoi cell finite element method(VCFEM)is proposed to solve the problem of the influence of microstructure dist... In this study,a collaborative optimization framework combining artificial fish swarm algorithm(AFSA)and Voronoi cell finite element method(VCFEM)is proposed to solve the problem of the influence of microstructure distribution on the macroscopic mechanical properties of particle-reinforced composites.Compared with the traditional displacement-based finite element method,VCFEM significantly improves the computational efficiency of multi-inclusion problems by means of generalized stress function and element local adaptation technology,and accurately captures the stress field discontinuity and interface stress concentration phenomenon.At the same time,AFSA abandons the dependence of traditional optimization methods on simplified models,and directly searches for the global optimal solution through discrete topological variables(particle positions).Its natural selection mechanism and swarm intelligence characteristics effectively overcome the local optimal trap.The numerical simulation results show that the proposed method exhibits high accuracy in both single-and multi-inclusion models(the error with the commercial software MARC is less than 5%),and in the complex model with 100 inclusions,the maximum Mises stress is reduced by 32.6%after optimization.The synergistic effect of the two breaks through the trade-off between efficiency and accuracy in traditional optimization,and provides the ability of both computational efficiency and global optimization for multi-scale composite material design. 展开更多
关键词 Particle-reinforced composites Artificial fish swarm algorithm Voronoi cell finite element method Optimization algorithms
暂未订购 下载PDF
Optimization of saturated super-twisting sliding mode guidance law using reinforcement learning algorithm 认领 引用
3
作者 Hao Wu Xiaojun Ban Di Zhou 《Defence Technology（防务技术）》 SCIE EI CAS CSCD 2026年第8期458-473,共16页
This paper proposes a novel missile guidance law optimization method based on deep reinforcement learning,specifically targeting terminal guidance for missiles engaging highly maneuverable targets in near-space enviro... This paper proposes a novel missile guidance law optimization method based on deep reinforcement learning,specifically targeting terminal guidance for missiles engaging highly maneuverable targets in near-space environments.In scenarios where both the missile and target have comparable overload capabilities,effective interception becomes a significant challenge.Existing methods,such as the Saturated Super-Twisting Algorithms,demonstrate strong performance in maneuvering target interception but face difficulties in parameter tuning and control input saturation.To overcome these limitations,this study introduces the Twin Delayed Deep Deterministic Policy Gradient(TD3)algorithm to optimize the parameters of missile guidance laws,offering an innovative solution to these complex challenges.The TD3 algorithm,known for its ability to handle noisy environments and mitigate Q-value overestimation,enhances the guidance system's capability to intercept highly maneuverable targets with greater precision.Simulation results validate the proposed approach,demonstrating a substantial performance improvement over traditional methods,thus providing both theoretical and practical contributions to missile guidance system optimization for next-generation missile defense applications. 展开更多
关键词 Highly maneuvering target Input saturation Missile guidance control Super-twisting algorithm Reinforcement learning
暂未订购 下载PDF
Dendritic Cell Algorithm with Reinforcement Learning for Adaptive Signal Categorization 认领 引用
4
作者 Yousra Abudaqqa Zulaiha Ali Othman Azuraliza Abu Bakar 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第5期1083-1111,共29页
Signal categorization is a critical component of the Dendritic Cell Algorithm(DCA),as it directly influences its anomaly detection capability.Conventional DCA implementations typically rely on heuristic or optimizatio... Signal categorization is a critical component of the Dendritic Cell Algorithm(DCA),as it directly influences its anomaly detection capability.Conventional DCA implementations typically rely on heuristic or optimization-based approaches,such as Grouping Particle Swarm Optimization(GPSO),Grouping Genetic Algorithms(GGA),Principal Component Analysis(PCA),and Support Vector Machines(SVM),to determine mappings between input features and the three immunological signal categories:Pathogen-Associated Molecular Patterns(PAMP),Danger Signals(DS),and Safe Signals(SS).These approaches depend heavily on domain expertise and predefined rules,making the resulting signal mappings static and often dataset specific.Consequently,the traditional DCA lacks flexibility across diverse data domains and may fail to capture evolving patterns in complex datasets.To address this limitation,this study integrates Reinforcement Learning(RL)into the DCA framework to develop an adaptive signal categorization mechanism.The proposed RL-DCA model employs a Q-learning agent to dynamically assign features to the three signal categories based on reward feedback derived from classification performance.Through continuous interaction with the environment,the RL agent learns an optimal signal mapping policy that improves the quality of generated signals while reducing reliance on manually defined configurations.Experimental evaluations conducted on nine benchmark datasets from multiple domains demonstrate that the proposed RL-DCA framework consistently outperforms existing DCA variants in terms of anomaly detection accuracy and robustness.The results confirm that reinforcement learning provides an effective mechanism for enabling adaptive and data-driven signal categorization in immune-inspired anomaly detection systems. 展开更多
关键词 Dendritic cell algorithm(DCA) reinforcement learning(RL) Q-learning dynamic signal categorization anomaly detection
暂未订购 下载PDF
Quality or Quantity?Error-Informed Selective Online Learning With Gaussian Processes in Multi-Agent Systems 认领 引用 被引量：1
5
作者 Zewen Yang Xiaobing Dai +2 位作者 Jiajun Cheng Yulong Huang Peng Shi 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2026年第6期1325-1338,共14页
Effective cooperation is pivotal in distributed learning for multi-agent systems,where the interplay between the quantity and quality of the machine learning models is crucial.This paper reveals the irrationality of i... Effective cooperation is pivotal in distributed learning for multi-agent systems,where the interplay between the quantity and quality of the machine learning models is crucial.This paper reveals the irrationality of indiscriminate inclusion of all models on agents for joint prediction,highlighting the imperative to prioritize quality over quantity in cooperative learning.Specifically,we present the first selective online learning framework for distributed Gaussian process(GP)regression,namely distributed error-informed GP(EIGP),that enables each agent to assess its neighboring collaborators,using the proposed selection function to choose the higher quality GP models with less prediction errors.Moreover,algorithmic enhancements are embedded within the EIGP,including a greedy algorithm(gEIGP)for accelerating prediction and an adaptive algorithm(aEIGP)for improving prediction accuracy.In addition,approaches for fast prediction and model update are introduced in conjunction with the error-informed quantification term iteration and a data deletion strategy to achieve real-time learning operations.Numerical simulations are performed to demonstrate the effectiveness of the developed methodology,showcasing its superiority over the stateof-the-art distributed GP methods with different benchmarks. 展开更多
关键词 Adaptive algorithm cooperative learning distributed learning Gaussian process regression greedy algorithm multi-agent system
暂未订购 下载PDF
An improved Alpha-shape algorithm for extracting section contours of the super-high steel bridge tower using point clouds 认领 引用 被引量：2
6
作者 ZHANG Yiming ZHAO Tianhao +2 位作者 LIAO Ruixuan LI Haoqing WANG Hao 《Journal of Southeast University(English Edition)》 EI CAS 2026年第1期26-35,共10页
The virtual preassembly of super-high steel bridge towers faces a challenge in the efficient and precise extraction of complex cross-sectional features.Factors such as fabrication errors,gravity-induced deformations,a... The virtual preassembly of super-high steel bridge towers faces a challenge in the efficient and precise extraction of complex cross-sectional features.Factors such as fabrication errors,gravity-induced deformations,and temperature fluctuations can compromise the accuracy of contour extraction.To address these limitations,an improved Alpha-shape-based point cloud contour extraction method is proposed.The proposed approach uses a hierarchical strategy to process three-dimensional laser scanning point clouds.The processed data are then subjected to curvatureadaptive voxel filtering to reduce acquisition noise.In addition,an enhanced iterative closest point(ICP)variant with correspondence validation accurately aligns the discrete point cloud segments.The proposed curvature-responsive Alpha-shape framework enables multiscale contour delineation through topology-adaptive threshold modulation,which resolves boundary ambiguities in geometrically complex cross-sections.The method was experimentally validated using field-acquired measurement datasets from the Zhangjinggao Yangtze River Bridge tower segments,confirming its capability to reconstruct noncanonical cross-sectional geometries.Three contour extraction methods,including Poisson reconstruction,the conventional Alpha-shape algorithm,and random sample consensus with ICP(RANSAC-ICP),were compared to evaluate the performance of the proposed Alpha-shape algorithm.The results demonstrate that the proposed method achieves superior contour extraction accuracy and data reduction efficiency,highlighting its effectiveness in contour extraction tasks. 展开更多
关键词 super-high steel bridge tower point cloud contour extraction improved Alpha-shape algorithm
暂未订购 下载PDF
Novel Sea Otter Optimization Algorithm for WSN Coverage Intelligence Optimization 认领 引用 被引量：2
7
作者 WU Jin GAO Yaqiong +2 位作者 SU Zhengdong CHONG Gege XIONG Hao 《Journal of Shanghai Jiaotong university(Science)》 EI 2026年第4期828-842,I0002,共15页
A novel intelligent optimization algorithm inspired by nature,called sea otter optimization algorithm(SOOA),is proposed.The SOOA simulates the natural behaviors of sea otters,such as using tactile senses to search for... A novel intelligent optimization algorithm inspired by nature,called sea otter optimization algorithm(SOOA),is proposed.The SOOA simulates the natural behaviors of sea otters,such as using tactile senses to search for food in seawater,grooming their fur,feeding with the aid of stones,and escaping from danger.In the exploration stage,a wetness factor is introduced to control the behavior of sea otters in foraging and grooming;a danger factor is introduced to control the behavior of sea otters in feeding and avoiding dangers in the exploitation stage,and the behaviors of sea otters in responding to different dangers are mathematically modeled.The proposed algorithm is compared with 9 well-known intelligent optimization algorithms,and evaluated in 13 benchmark functions as well as wireless sensor network coverage optimization problems to verify the effectiveness of the proposed algorithm.The experimental results show that the node coverage after SOOA optimization reaches 91.2%in 2D environment and 90.47%in 3D environment.Compared with other algorithms,SOOA is superior and possesses the ability to solve complex optimization problems. 展开更多
关键词 sea otter optimization algorithm(SOOA) swarm intelligence optimization wireless sensor network coverage optimization
暂未订购 下载PDF
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
8
作者 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
Path Planning for Unmanned Surface Vehicles in Dynamic Environments Based on Artificial Potential Field and Global Guided Reinforcement Learning 认领 引用 被引量：2
9
作者 Shanqiang Li Chaoxi Li 《哈尔滨工程大学学报（英文版）》 CSCD 2026年第2期575-586,共12页
For unmanned surface vehicles(USVs),how to find an effective,feasible path that substantially improves mission success rates and time efficiency in dynamic marine environments is a critical issue.To address the path p... For unmanned surface vehicles(USVs),how to find an effective,feasible path that substantially improves mission success rates and time efficiency in dynamic marine environments is a critical issue.To address the path planning problem for USVs using deep reinforcement learning(DRL)in dynamic ocean environments,an improved algorithm based on Deep Q-Networks(DQN)is proposed,which is called Fast Guided Deep Q-Network Algorithm(FG-DQN).This algorithm combines DQN with the artificial potential field(APF)method and uses the A*algorithm to initialize a guiding path in a global static environment and to provide prior knowledge for the USVs.Additionally,the configuration of the reward function using APF and the guiding path effectively reduces the frequency of random movements during the early exploration phase of the DQN algorithm,which accelerates convergence,improves the computational efficiency of path planning,and increases path safety.Finally,the performance of the presented algorithm is validated through experiments in a 2D environment.Compared with traditional reinforcement learning methods such as Q-learning and Sarsa,as well as the original DQN algorithm,FG-DQN is more effective for USV path planning. 展开更多
关键词 Deep reinforcement learning Path planning Unmanned surface vehicles Fast guided deep Q-Network algorithm
暂未订购 下载PDF
Optimization of the frequency offset increment of FDA-MIMO based on cuckoo search algorithm 认领 引用 被引量：2
10
作者 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
A Load-Balancing Routing Algorithm Based on Ant Colony Optimization and Reinforcement Learning for LEO Satellite Networks 认领 引用
11
作者 Deng Xia Lin Wucheng +3 位作者 Hu Yingxin Hao Miaomiao Chang Le Huang Jiawei 《China Communications》 SCIE EI CSCD 2025年第12期281-294,共14页
Low earth orbit (LEO) satellite networkscan provide wider service coverage and lower latencythan traditional terrestrial networks, which haveattracted considerable attention. However, the unevendistribution of human p... Low earth orbit (LEO) satellite networkscan provide wider service coverage and lower latencythan traditional terrestrial networks, which haveattracted considerable attention. However, the unevendistribution of human population and data trafficon the ground incurs unbalanced traffic load inLEO satellite networks. To this end, we proposea load-balancing routing algorithm for LEO satellitenetworks based on ant colony optimization and reinforcementlearning. In the ant colony algorithm,we improve the pheromone update rule by introducingload-aware heuristic information, e.g., the currentnode transmission overhead, delay and load status, andreinforcement learning-based link quality evaluation.It enables the routing algorithm to select the lightlyloaded node as the next hop to balance the networkload. We simulate and verify the proposed algorithmusing the NS2 simulation platform, and the resultsshow that our algorithm improves the data delivery ratioand throughput while ensuring lower latency andtransmission overhead. 展开更多
关键词 ant colony algorithm low earth orbit(LEO)satellite network reinforcement learning
暂未订购 下载PDF
Geophysics-informed stratigraphic modeling using spatial sequential Bayesian updating algorithm 认领 引用
12
作者 Wei Yan Shouyong Yi +3 位作者 Taosheng Huang Jie Zou Wan-Huan Zhou Ping Shen 《Journal of Rock Mechanics and Geotechnical Engineering》 SCIE CSCD 2025年第7期4400-4412,共13页
Challenges in stratigraphic modeling arise from underground uncertainty.While borehole exploration is reliable,it remains sparse due to economic and site constraints.Electrical resistivity tomography(ERT)as a cost-eff... Challenges in stratigraphic modeling arise from underground uncertainty.While borehole exploration is reliable,it remains sparse due to economic and site constraints.Electrical resistivity tomography(ERT)as a cost-effective geophysical technique can acquire high-density data;however,uncertainty and nonuniqueness inherent in ERT impede its usage for stratigraphy identification.This paper integrates ERT and onsite observations for the first time to propose a novel method for characterizing stratigraphic profiles.The method consists of two steps:(1)ERT for prior knowledge:ERT data are processed by soft clustering using the Gaussian mixture model,followed by probability smoothing to quantify its depthdependent uncertainty;and(2)Observations for calibration:a spatial sequential Bayesian updating(SSBU)algorithm is developed to update the prior knowledge based on likelihoods derived from onsite observations,namely topsoil and boreholes.The effectiveness of the proposed method is validated through its application to a real slope site in Foshan,China.Comparative analysis with advanced borehole-driven methods highlights the superiority of incorporating ERT data in stratigraphic modeling,in terms of prediction accuracy at borehole locations and sensitivity to borehole data.Informed by ERT,reduced sensitivity to boreholes provides a fundamental solution to the longstanding challenge of sparse measurements.The paper further discusses the impact of ERT uncertainty on the proposed model using time-lapse measurements,the impact of model resolution,and applicability in engineering projects.This study,as a breakthrough in stratigraphic modeling,bridges gaps in combining geophysical and geotechnical data to address measurement sparsity and paves the way for more economical geotechnical exploration. 展开更多
关键词 Stratigraphic modeling Electrical resistivity tomography(ERT) Site characterization Spatial sequential Bayesian updating(SSBU)algorithm Sparse measurements
暂未订购 下载PDF
Low-complexity APSK demodulation algorithm based on K-means clustering in LEO satellite communication systems 认领 引用
13
作者 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 认领 引用
14
作者 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
A Quantum-Inspired Algorithm for Clustering and Intrusion Detection 认领 引用
15
作者 Gang Xu Lefeng Wang +5 位作者 Yuwei Huang Yong Lu Xin Liu Weijie Tan Zongpeng Li Xiu-Bo Chen 《Computers, Materials & Continua》 SCIE EI 2026年第4期1180-1215,共36页
The Intrusion Detection System(IDS)is a security mechanism developed to observe network traffic and recognize suspicious or malicious activities.Clustering algorithms are often incorporated into IDS;however,convention... The Intrusion Detection System(IDS)is a security mechanism developed to observe network traffic and recognize suspicious or malicious activities.Clustering algorithms are often incorporated into IDS;however,conventional clustering-based methods face notable drawbacks,including poor scalability in handling high-dimensional datasets and a strong dependence of outcomes on initial conditions.To overcome the performance limitations of existing methods,this study proposes a novel quantum-inspired clustering algorithm that relies on a similarity coefficient-based quantum genetic algorithm(SC-QGA)and an improved quantum artificial bee colony algorithm hybrid K-means(IQABC-K).First,the SC-QGA algorithmis constructed based on quantum computing and integrates similarity coefficient theory to strengthen genetic diversity and feature extraction capabilities.For the subsequent clustering phase,the process based on the IQABC-K algorithm is enhanced with the core improvement of adaptive rotation gate and movement exploitation strategies to balance the exploration capabilities of global search and the exploitation capabilities of local search.Simultaneously,the acceleration of convergence toward the global optimum and a reduction in computational complexity are facilitated by means of the global optimum bootstrap strategy and a linear population reduction strategy.Through experimental evaluation with multiple algorithms and diverse performance metrics,the proposed algorithm confirms reliable accuracy on three datasets:KDD CUP99,NSL_KDD,and UNSW_NB15,achieving accuracy of 98.57%,98.81%,and 98.32%,respectively.These results affirm its potential as an effective solution for practical clustering applications. 展开更多
关键词 Intrusion detection clustering quantum artificial bee colony algorithm K-means quantum genetic algorithm
暂未订购 下载PDF
Optimization of a self-tuning force control system for the milling process using a dynamic enhanced genetic algorithm 认领 引用
16
作者 Yao Li Zhengcai Zhao +3 位作者 Ning Qian Lei Zhang Wenfeng Ding Yucan Fu 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2026年第2期33-43,共11页
When milling structural components with varying axial depths and widths,cutting forces tend to fluctuate,negatively impacting tool life and machining accuracy.To mitigate the force fluctuations and enhance tool longev... When milling structural components with varying axial depths and widths,cutting forces tend to fluctuate,negatively impacting tool life and machining accuracy.To mitigate the force fluctuations and enhance tool longevity,developing a simple,reliable,and easy-to-implement force control system for milling is essential,which is an important step toward advancing intelligent manufacturing.This paper explores the use of genetic algorithms(GA) for powerful optimization capabilities in developing self-tuning milling force controllers.A comprehensive framework for optimizing a fuzzy logic controller using an enhanced GA is specifically designed for the milling process.The optimization integrates the GA with a simulation model,fine-tuning membership functions and optimizing fuzzy rule selection.The enhanced GA incorporates the Integral of Time-weighted Absolute Error(ITAE) as the fitness criterion to improve the robustness and responsiveness of the controller.The optimized fuzzy logic controller is implemented within a computer numerical control system,adjusting feed rates in real-time to control milling forces.The performance of the proposed controller is validated through step and slope milling tests,demonstrating an average control accuracy of 95.52%.Comparative evaluations with other controllers show that the proposed system offers a significant improvement,achieving up to 4.58% better control accuracy in step milling tests. 展开更多
关键词 Optimization Self-tuning Force control system Milling process Genetic algorithm
暂未订购 下载PDF
An Efficient Evolutionary Algorithm for Few-for-Many Optimization 认领 引用
17
作者 Ke Shang Hisao Ishibuchi +1 位作者 Zexuan Zhu Qingfu Zhang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2026年第6期1362-1377,共16页
Few-for-many(F4M)optimization,recently introduced as a novel paradigm in multi-objective optimization,aims to find a small set of solutions that effectively handle a large number of conflicting objectives.Unlike tradi... Few-for-many(F4M)optimization,recently introduced as a novel paradigm in multi-objective optimization,aims to find a small set of solutions that effectively handle a large number of conflicting objectives.Unlike traditional many-objective optimization methods,which typically attempt comprehensive coverage of the Pareto front,F4M optimization emphasizes finding a small representative solution set to efficiently address highdimensional objective spaces.Motivated by the computational complexity and practical relevance of F4M optimization,this paper proposes a new evolutionary algorithm explicitly tailored for efficiently solving F4M optimization problems.Inspired by Smetric selection evolutionary multi-objective optimization algorithm(SMS-EMOA),our proposed approach employs a(μ+1)-evolution strategy guided by the objective of F4M optimization.Furthermore,to facilitate rigorous performance assessment,we propose a novel benchmark test suite specifically designed for F4M optimization by leveraging the similarity betw een the R2indicator and F4M formulations.Our test suite is highly flexible,allowing any existing multi-objective optimization problem to be transformed into a corresponding F4M instance via scalarization using the weighted Tchebycheff function.Comprehensive experimental evaluations on benchmarks demonstrate the superior performance of our algorithm compared to existing state-of-the-art algorithms,especially on instances involving a large number of objectives.The source code of the proposed algorithm will be released publicly.Source code is available at http://gffzz188fe103f8f1460as96cvwk0pb56w6cpn.ffgz.tsg.suse.edu.cn/MOL-SZU/SoM-EMOA. 展开更多
关键词 Evolutionary algorithm few-for-many optimization many-objective optimization (MOO) multi-objective optimization
暂未订购 下载PDF
An algorithm-assisted high-resolution D-TOF imaging system with reconfigurable macropixel-based SPAD image sensor 认领 引用
18
作者 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
Flood predictions from metrics to classes by multiple machine learning algorithms coupling with clustering-deduced membership degree 认领 引用
19
作者 ZHAI Xiaoyan ZHANG Yongyong +5 位作者 XIA Jun ZHANG Yongqiang TANG Qiuhong SHAO Quanxi CHEN Junxu ZHANG Fan 《Journal of Geographical Sciences》 SCIE CSCD 2026年第1期149-176,共28页
Accurate prediction of flood events is important for flood control and risk management.Machine learning techniques contributed greatly to advances in flood predictions,and existing studies mainly focused on predicting... Accurate prediction of flood events is important for flood control and risk management.Machine learning techniques contributed greatly to advances in flood predictions,and existing studies mainly focused on predicting flood resource variables using single or hybrid machine learning techniques.However,class-based flood predictions have rarely been investigated,which can aid in quickly diagnosing comprehensive flood characteristics and proposing targeted management strategies.This study proposed a prediction approach of flood regime metrics and event classes coupling machine learning algorithms with clustering-deduced membership degrees.Five algorithms were adopted for this exploration.Results showed that the class membership degrees accurately determined event classes with class hit rates up to 100%,compared with the four classes clustered from nine regime metrics.The nonlinear algorithms(Multiple Linear Regression,Random Forest,and least squares-Support Vector Machine)outperformed the linear techniques(Multiple Linear Regression and Stepwise Regression)in predicting flood regime metrics.The proposed approach well predicted flood event classes with average class hit rates of 66.0%-85.4%and 47.2%-76.0%in calibration and validation periods,respectively,particularly for the slow and late flood events.The predictive capability of the proposed prediction approach for flood regime metrics and classes was considerably stronger than that of hydrological modeling approach. 展开更多
关键词 flood regime metrics class prediction machine learning algorithms hydrological model
暂未订购 下载PDF
Phased-Enhancement Marine Predators Algorithm for Global Optimization and Medical Insurance Fraud Detection 认领 引用
20
作者 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
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈