期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到245,084篇文章
< 1 2 … 250 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
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
Gravitational Dynamic Radius Nearest Neighbor Trained by Fuzzy Enhanced Hiking Optimization Algorithm for Imbalanced Data Classification 认领 引用
2
作者 Zahra Beheshti 《Journal of Bionic Engineering》 SCIE EI CSCD 2026年第3期1826-1848,共23页
Imbalanced data classification is one of the most critical challenges in machine learning.Standard classifiers do not provide adequate accuracy for detecting minority samples because these classifiers are biased towar... Imbalanced data classification is one of the most critical challenges in machine learning.Standard classifiers do not provide adequate accuracy for detecting minority samples because these classifiers are biased toward the majority samples.To overcome this drawback,many methods have been proposed.One prominent method is the Gravitational Fixed Radius Nearest Neighbor(GFRNN)algorithm,which applies Newton’s law of universal gravitation to determine the class of a test sample based on two parameters:mass and radius.Although GFRNN shows good performance on some imbalanced datasets,it faces several fundamental problems,including ignoring the data distribution and the improper calculation of radius and mass.In this study,a Gravitational Dynamic Radius Nearest Neighbor trained by a Fuzzy Enhanced Hiking Optimization Algorithm(FEHOA-GDRNN)is proposed to improve GFRNN performance.In FEHOA-GDRNN,Enhanced Hiking Optimization Algorithm(EHOA)applies a new spider web search to find better solution based on a Mamdani Fuzzy Inference System(FIS).FEHOA-GDRNN is evaluated on 40 imbalanced datasets and its results are compared with GDRNN trained by Fuzzy HOA(FHOA-GDRNN),GFRNN trained by HOA(HOA-GFRNN),GFRNN and its various versions(IGFRNN,I-GFRNN,and EGDRNN),Cost-Sensitive Support Vector Machine with an RBF kernel(CS-SVM-RBF),Cost-Sensitive Support Vector Machine with a Linear kernel(CS-SVM-Linear),Cost-Sensitive Naïve Bayes(CS-NB),Binary Decision tree(BDT),Random Forest(RF),Gaussian-Probabilistic Neural Network(GaussianPNN)and Skew-Probabilistic Neural Network(SkewPNN).Moreover,the results of the proposed classifier are compared with those of several Fuzzy K-Nearest Neighbor(FKNN).The results demonstrate that FEHOA-GDRNN outperforms other methods in key metrics,including Average Accuracy(AAcc)and Geometric Mean(GM). 展开更多
关键词 Imbalanced data Classification Gravitational Fixed Radius Nearest Neighbor(GFRNN) Mamdani Fuzzy Inference System Hiking Optimization Algorithm(HOA)
Optimization of the frequency offset increment of FDA-MIMO based on cuckoo search algorithm 认领 引用 被引量：1
3
作者 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 认领 引用
4
作者 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 认领 引用
5
作者 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 认领 引用
6
作者 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
Structured Random Cycle-Guided Algorithm (SRCA): An Adaptive Metaheuristic Combining Directionally-Guided and Stochastic Search Strategies 认领 引用
7
作者 Giuseppe Marannano Antonino Cirello Tommaso Ingrassia 《Computers, Materials & Continua》 SCIE EI 2026年第6期1873-1898,共26页
In response to the growing need for adaptive optimization algorithms capable of handling complex,multimodal,and high-dimensional search spaces,this paper introduces the Structured Random Cycle-guided Algorithm(SRCA).S... In response to the growing need for adaptive optimization algorithms capable of handling complex,multimodal,and high-dimensional search spaces,this paper introduces the Structured Random Cycle-guided Algorithm(SRCA).SRCA is not presented as a fundamentally new optimization paradigm,but rather as an architectural synthesis and a unified adaptive framework for dynamic operator selection.Based on a cycle-structured architecture,directional and stochastic search behaviors are dynamically selected at the individual level.The algorithm orchestrates well-established structured movements with a diverse pool of stochastic exploration strategies,enabling a coherent and adaptive balance between exploration and exploitation throughout the optimization process.Unlike traditional metaheuristics that rely on fixed behavioral roles or static movement schemes,SRCA allows each individual to adapt its search strategy based on real-time population feedback,monitored through convergence and dispersion indicators.The performance of SRCA is quantitatively assessed under strictly identical experimental conditions on a comprehensive set of 23 benchmark functions,including multimodal and high-dimensional problems,as well as on six classical constrained engineering design problems.Numerical results demonstrate competitive convergence reliability and robustness across diverse optimization tasks,confirming the effectiveness of the proposed adaptive cycle-based framework. 展开更多
关键词 Metaheuristic algorithms optimization constrained optimization benchmark functions structured random cycle-guided algorithm
暂未订购 下载PDF
Optimization of a self-tuning force control system for the milling process using a dynamic enhanced genetic algorithm 认领 引用
8
作者 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 认领 引用
9
作者 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://gffzz188fe103f8f1460as5p90bcvbc6nv6uxp.ffgz.tsg.suse.edu.cn/MOL-SZU/SoM-EMOA. 展开更多
关键词 Evolutionary algorithm few-for-many optimization many-objective optimization (MOO) multi-objective optimization
暂未订购 下载PDF
Flood predictions from metrics to classes by multiple machine learning algorithms coupling with clustering-deduced membership degree 认领 引用
10
作者 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
An algorithm-assisted high-resolution D-TOF imaging system with reconfigurable macropixel-based SPAD image sensor 认领 引用
11
作者 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 认领 引用
12
作者 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 认领 引用
13
作者 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
RRT*-GSQ:A hybrid sampling path planning algorithm for complex orchard scenarios 认领 引用
14
作者 ZHU Qingzhen ZHAO Jiamuyang +1 位作者 DAI Xu YU Yang 《农业工程学报》 EI CAS CSCD 北大核心 2026年第3期13-25,共13页
Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT*),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narr... Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT*),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narrow passages,slow convergence,and high computational costs.To address these challenges,this paper proposes a novel hybrid global path planning algorithm integrating Gaussian sampling and quadtree optimization(RRT*-GSQ).This methodology aims to enhance path planning by synergistically combining a Gaussian mixture sampling strategy to improve node generation in critical regions,an adaptive step-size and direction optimization mechanism for enhanced obstacle avoidance,a Quadtree-AABB collision detection framework to lower computational complexity,and a dynamic iteration control strategy for more efficient convergence.In obstacle-free and obstructed scenarios,compared with the conventional RRT*,the proposed algorithm reduced the number of node evaluations by 67.57%and 62.72%,and decreased the search time by 79.72%and 78.52%,respectively.In path tracking tests,the proposed algorithm achieved substantial reductions in RMSE of the final path compared to the conventional RRT*.Specifically,the lateral RMSE was reduced by 41.5%in obstacle-free environments and 59.3%in obstructed environments,while the longitudinal RMSE was reduced by 57.2%and 58.5%,respectively.Furthermore,the maximum absolute errors in both lateral and longitudinal directions were constrained within 0.75 m.Field validation experiments in an operational orchard confirmed the algorithm's practical effectiveness,showing reductions in the mean tracking error of 47.6%(obstacle-free)and 58.3%(with obstructed),alongside a 5.1%and 7.2%shortening of the path length compared to the baseline method.The proposed algorithm effectively enhances path planning efficiency and navigation accuracy for robots,presenting a superior solution for high-precision autonomous navigation of agricultural robots in orchard environments and holding significant value for engineering applications. 展开更多
关键词 robot path planning orchard improved RRT*algorithm Gaussian sampling autonomous navigation
暂未订购 下载PDF
An Enhanced Genetic Algorithm via an Innovative Elite Retention Strategy for Task Offloading in MEC Scenarios 认领 引用
15
作者 Chengyu Hou Wenzao Li +3 位作者 Hanyun Li Kui Liu Zhuoning Zhao Hongping Shu 《Computers, Materials & Continua》 SCIE EI 2026年第8期2198-2218,共21页
The rapid growth of Internet of Things(IoT)and 5G technologies has led to a sharp increase in computing demands from wireless devices,making efficient task offloading a critical challenge.Key issues include reducing a... The rapid growth of Internet of Things(IoT)and 5G technologies has led to a sharp increase in computing demands from wireless devices,making efficient task offloading a critical challenge.Key issues include reducing application latency,lowering the energy consumption of terminal devices,and improving overall system performance,all of which directly affect user experience.Traditional genetic algorithms(GA),inspired by biological evolution,have been widely used in task offloading,but they often suffer from slow convergence and a tendency to fall into local optima in complex scenarios,limiting their effectiveness.To address these drawbacks,this paper proposes a task offloading strategy based on a refined elite mechanism in a GA.The algorithm introduces multi-point variation in both crossover and mutation operations to enhance population diversity,avoid local optima,and accelerate convergence.This design leverages the GA’s strength in multi-objective optimization,which outperforms other bionic heuristic algorithms that excel in single domains.Comparative experiments with GA,ant colony optimization,Deep Q-Network,Greedy algorithms,simulated annealing algorithm and particle swarm optimization,show that the proposed algorithm improves convergence speed by 35%,reduces task completion time by 6%,and optimizes energy consumption by approximately 18%. 展开更多
关键词 Task offloading genetic algorithm bandwidth constraint mobile edge computing
暂未订购 下载PDF
A game theoretic model and a double oracle algorithm for the heterogeneous weapon target assignment problem 认领 引用
16
作者 MA Yingying LUO He +2 位作者 WANG Guoqiang ZHU Waiming HU Xiaoxuan 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2026年第2期548-566,共19页
Weapon target assignment(WTA)problem is a critical problem in multiplatform confrontation.This paper studies a static WTA problem with heterogeneous weapons in multi-platform air combat scenarios,called heterogeneous ... Weapon target assignment(WTA)problem is a critical problem in multiplatform confrontation.This paper studies a static WTA problem with heterogeneous weapons in multi-platform air combat scenarios,called heterogeneous WTA(HWTA)problem.Heterogeneous indicates that the engagement platforms carry multiple kinds of weapons for different tactical purposes.The targets assigned and the weapons used by one side’s platforms will affect the survival probability and capability of the other side’s platforms.The goal of each side in HWTA is to find a solution to determine the kind of weapon used and the target assigned for each platform,so as to maximize their combat effectiveness.The problem is formulated as a two-player noncooperative game model with considering the conflicts between the engaged sides.The Nash equilibrium is an effective solution to the game in which no player has an incentive to deviate.However,the number of pure strategies in HWTA increases exponentially with the engagement platforms.To improve computing efficiency,a double oracle algorithm with constructive heuristic(DOCH)is developed,within which the constructive heuristic is embedded to solve the oracle subproblems efficiently.Numerical experiments are conducted to verify the effectiveness of the DOCH.The results show that the DOCH can find effective strategies for platforms to improve combat effectiveness.Moreover,the DOCH can find high-quality solutions in seconds,significantly outperforming the state-of-the-art algorithms in terms of computational efficiency,especially for large-scale problems. 展开更多
关键词 weapon target assignment noncooperative game double oracle algorithm constructive heuristic
暂未订购 下载PDF
Experience-guided optimization of jacket foundations for offshore wind turbines in varying water depths based on finite element analysis and the genetic algorithm 认领 引用
17
作者 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
Intelligent identification for discrete memristive neuron map:An adaptive chaos game optimization algorithm studied from the perspectives of different sample sizes and objective functions 认领 引用
18
作者 Yuexi Peng Xinyi Luo +2 位作者 Zhijun Li Mengjiao Wang Minglin Ma 《Chinese Physics B》 SCIE EI CAS CSCD 2026年第6期276-291,共16页
Discrete memristive neuron systems have attracted considerable attention due to their nonlinear dynamical properties,low computational overhead,and ease of hardware implementation.For the practical engineering applica... Discrete memristive neuron systems have attracted considerable attention due to their nonlinear dynamical properties,low computational overhead,and ease of hardware implementation.For the practical engineering applications of discrete memristive neuron systems,effective control remains a key issue.Parameter identification using intelligent optimization algorithms is an important approach for controlling complex nonlinear systems.However,classical algorithms are prone to falling into local optima and often exhibit high computational complexity,resulting in slow convergence.Therefore,a new algorithm named adaptive chaos game optimization(ACGO)is proposed to address these issues.By introducing a differential evolution mutation strategy and a Cauchy adaptive parameter mechanism,the ACGO algorithm can effectively balance global exploration and local exploitation capabilities.To verify the effectiveness of the proposed algorithm,it is applied to parameter identification in five discrete memristive neuron maps(DMNMs)and compared with seven intelligent optimization algorithms.Simulation results demonstrate that the ACGO algorithm achieves higher accuracy and faster convergence.In addition,an in-depth investigation is conducted into the effects of sample size and objective function on identification performance.The results indicate that setting the sample size to 4 and selecting the mean squared error(MSE)as the objective function can achieve better identification performance and a high level of robustness. 展开更多
关键词 discrete memristive neuron map parameter identification chaos game optimization algorithm sample size
暂未订购 下载PDF
An improved Alpha-shape algorithm for extracting section contours of the super-high steel bridge tower using point clouds 认领 引用
19
作者 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
Equivalent Modeling with Passive Filter Parameter Clustering for Photovoltaic Power Stations Based on a Particle Swarm Optimization K-Means Algorithm 认领 引用
20
作者 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
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈