期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到253,914篇文章
< 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
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
Phased-Enhancement Marine Predators Algorithm for Global Optimization and Medical Insurance Fraud Detection 认领 引用
3
作者 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
Collaborative optimization of well operations and adjustment strategies in waterflooding reservoirs using an enhanced adaptive differential evolution algorithm 认领 引用
4
作者 Xian-Min Zhang Jian-Gang Yang +2 位作者 Qi-Hong Feng Ya-Wei Hou Lei Zhang 《Petroleum Science》 SCIE EI CAS CSCD 2026年第5期2735-2757,共23页
Efficient optimization of well operations andadjustment strategies in large-scale waterflooding reservoirs is a high-dimensional and complex challenge due to strong decision coupling and reservoir heterogeneity.This s... Efficient optimization of well operations andadjustment strategies in large-scale waterflooding reservoirs is a high-dimensional and complex challenge due to strong decision coupling and reservoir heterogeneity.This study proposes a collaborative optimization framework that integrates multiple adjustment strategies,includinginfillwell drilling,shut-in of low-efficiency wells,and injectionproduction well conversion.A penalty mechanism is introduced tobalance cumulative oil production maximization with minimum production constraints for infill wells.The core contribution is the development of a multi-strategy enhancedadaptive differential evolution algorithm(E-ADE),which incorporates the follower update mechanism of the SparrowSearch Algorithm(SSA)and the logarithmic spiral search strategy of the Whale Optimization Algorithm(WOA)into the differential evolution(DE)framework.By dynamically adjusting differential evolution vectors and adaptively regulating population size across optimization stages,E-ADE effectively balances global exploration and local exploitation,leading to significantlyimproved convergence speed and optimization accuracy.Benchmark tests on nine multimodalfunctions demonstrate that E-ADEconsistently outperforms classical algorithms,includingDE,GA,PSO,WOA,and SSA.The method is further applied to the PUNQ-S3 reservoir model and the S4 block of the W12-2 oilfield under high water-cut conditions.The results indicate that E-ADE enables adaptive optimization of infillwell placement,shut-in schemes,and welltype conversions,achieving coordinated improvements in both field-scale production andsingle-well performance,and substantially enhancing the efficiency of waterflooding development. 展开更多
关键词 Waterflooding reservoir Collaborative optimization Enhanced adaptive differential evolution algorithm Logarithmic spiral search Shannon entropy
暂未订购 下载PDF
Experience-guided optimization of jacket foundations for offshore wind turbines in varying water depths based on finite element analysis and the genetic algorithm 认领 引用
5
作者 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 认领 引用
6
作者 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
Research on a two-step retracking algorithm for reconstructed waveforms of nearshore radar altimeters 认领 引用
7
作者 Yongjun Jia Xingwei Jiang +1 位作者 Dan Qin Bo Yuan 《Acta Oceanologica Sinica》 SCIE CAS CSCD 2026年第3期216-231,共16页
To enhance the accuracy of nearshore data products obtained from nadir radar altimeters,we introduce a novel two-step retracking algorithm for reconstructed waveforms.This approach utilizes Empirical Mode Decompositio... To enhance the accuracy of nearshore data products obtained from nadir radar altimeters,we introduce a novel two-step retracking algorithm for reconstructed waveforms.This approach utilizes Empirical Mode Decomposition(EMD)to extract trend information from the trailing edge of the waveform.Reconstructed waveforms are formed by linking the leading and trailing edge trend information.The retracking process consists of two steps:the first step focuses on retracking a segment of the leading edge to obtain 4 crucial a priori parameters.In the second step,retracking incorporates both the leading and trailing edges using the previously acquired a priori information.We tested the algorithm using data from the HY-2B radar altimeter.Results indicate that the proposed two-step retracking algorithm outperforms the Maximum Likelihood Estimation(MLE4)algorithm currently used in the operational processing of the HY-2B radar altimeter,as well as the Adaptive Leading Edge Subwaveform(ALES)algorithm,in terms of significant wave height(SWH)and sea level anomalies(SLA).Specifically,the standard deviation of the difference in SWH is reduced by 14%,and the standard deviation of the difference in SLA is reduced by approximately 18%.The two-step retracking algorithm effectively leverages trailing edge information,reduces the influence of peak noise on the leading edge,and improves both the utilization and accuracy of the waveform retracking. 展开更多
关键词 reconstructed waveforms two-step retracking algorithm radar altimeter HY-2B satellite
暂未订购 下载PDF
Millimeter wave imaging of Range Migration Algorithm with adaptive background filtering 认领 引用
8
作者 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
Erratum to“False Data Injection Attacks on Data-Driven Algorithms in Smart Grids Utilizing Distributed Power Supplies”[Engineering 51(2025)62-74] 认领 引用
9
作者 Zengji Liu Mengge Liu +1 位作者 Qi Wang Yi Tang 《Engineering》 SCIE EI CSCD 2026年第5期362-362,共1页
The publisher regrets the CRediT authorship contribution statement was inserted incorrectly and the correct statement should be updated as below:Zengji Liu:Writing-review&editing,Writing-original draft,Visualizati... The publisher regrets the CRediT authorship contribution statement was inserted incorrectly and the correct statement should be updated as below:Zengji Liu:Writing-review&editing,Writing-original draft,Visualization,Validation,Supervision,Software,Resources,Project administration,Methodology,Investigation,Funding acquisition,Formal analysis,Data curation,Conceptualization.Mengge Liu:Writing-review&editing,Writing-original draft,Investigation.Qi Wang:Writing-review&editing,Writing-original draft.Yi Tang:Writing-review&editing,Writing-original draft. 展开更多
关键词 data driven algorithms credit authorship contribution statement false data injection attacks smart grids distributed power supplies
暂未订购 下载PDF
Structural Damage Diagnosis Based onMulti-Stage Sparrow Search Algorithm 认领 引用
10
作者 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
Data-Driven Algorithms for Finite-Horizon and Infinite-Horizon Indefinite Linear Quadratic Stochastic Optimal Control Problems 认领 引用
11
作者 Guangchen Wang Heng Zhang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2026年第6期1459-1469,共11页
This paper is devoted to devising data-driven algorithms for finite-horizon and infinite-horizon linear quadratic stochastic optimal control(LQSOC)problems.In our study,the diffusion terms of system dynamics are permi... This paper is devoted to devising data-driven algorithms for finite-horizon and infinite-horizon linear quadratic stochastic optimal control(LQSOC)problems.In our study,the diffusion terms of system dynamics are permitted to hinge upon both control and state variables,and the weighting matrices of cost functionals are allowed to be indefinite.It is acknowledged that the optimal controls of finite-horizon and infinite-horizon indefinite LQSOC problems are correlated with a generalized differential Riccati equation(GDRE)and a generalized algebraic Riccati equation(GARE).Herein,we propose two data-driven algorithms to approximate the solutions of these Riccati equations,and thereby determine optimal controls,without leveraging the information of all system parameters.Additionally,we prove the convergence of these algorithms and examine the impact of computational errors.Finally,we validate the performance of these data-driven algorithms via three simulation examples. 展开更多
关键词 Data-driven algorithm generalized algebraic Riccati equation (GARE) generalized differential Riccati equation (GDRE) indefinite problem linear quadratic stochastic optimal control (LQSOC)
暂未订购 下载PDF
Information Diffusion Models and Fuzzing Algorithms for a Privacy-Aware Data Transmission Scheduling in 6G Heterogeneous ad hoc Networks 认领 引用 被引量：1
12
作者 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
Structured Random Cycle-Guided Algorithm (SRCA): An Adaptive Metaheuristic Combining Directionally-Guided and Stochastic Search Strategies 认领 引用
13
作者 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
Seismic Data Reconstruction and Noise Suppression Based on an Improved Weighted Fast Projection onto Convex Sets Algorithm 认领 引用
14
作者 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
Optimization of saturated super-twisting sliding mode guidance law using reinforcement learning algorithm 认领 引用
15
作者 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
Algorithmically Enhanced Data-Driven Prediction of Shear Strength for Concrete-Filled Steel Tubes 认领 引用
16
作者 Shengkang Zhang Yong Jin +5 位作者 Soon Poh Yap Haoyun Fan Shiyuan Li Ahmed El-Shafie Zainah Ibrahim Amr El-Dieb 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第1期374-398,共25页
Concrete-filled steel tubes(CFST)are widely utilized in civil engineering due to their superior load-bearing capacity,ductility,and seismic resistance.However,existing design codes,such as AISC and Eurocode 4,tend to ... Concrete-filled steel tubes(CFST)are widely utilized in civil engineering due to their superior load-bearing capacity,ductility,and seismic resistance.However,existing design codes,such as AISC and Eurocode 4,tend to be excessively conservative as they fail to account for the composite action between the steel tube and the concrete core.To address this limitation,this study proposes a hybrid model that integrates XGBoost with the Pied Kingfisher Optimizer(PKO),a nature-inspired algorithm,to enhance the accuracy of shear strength prediction for CFST columns.Additionally,quantile regression is employed to construct prediction intervals for the ultimate shear force,while the Asymmetric Squared Error Loss(ASEL)function is incorporated to mitigate overestimation errors.The computational results demonstrate that the PKO-XGBoost model delivers superior predictive accuracy,achieving a Mean Absolute Percentage Error(MAPE)of 4.431%and R2 of 0.9925 on the test set.Furthermore,the ASEL-PKO-XGBoost model substantially reduces overestimation errors to 28.26%,with negligible impact on predictive performance.Additionally,based on the Genetic Algorithm(GA)and existing equation models,a strength equation model is developed,achieving markedly higher accuracy than existing models(R2=0.934).Lastly,web-based Graphical User Interfaces(GUIs)were developed to enable real-time prediction. 展开更多
关键词 Asymmetric squared error loss genetic algorithm machine learning pied kingfisher optimizer quantile regression
暂未订购 下载PDF
A Hybrid Approach for Query-Based Data Extraction Using Ensemble BERT Model with Walrus Optimization Algorithm 认领 引用
17
作者 Poluru Eswaraiah Uddagiri Sirisha +3 位作者 Shaik Abdul Nabi Revathi Durgam Pallavi Malavath Gilakara Muni Nagamani 《Computers, Materials & Continua》 SCIE EI 2026年第8期1580-1606,共27页
The growing volume of digital text complicates the extraction of relevant information from unstructured data.Transformer models such as BERT,ALBERT,and RoBERTa are powerful,but they may face challenges in hyperparamet... The growing volume of digital text complicates the extraction of relevant information from unstructured data.Transformer models such as BERT,ALBERT,and RoBERTa are powerful,but they may face challenges in hyperparameter optimization and adaptation to new domains.To address this issue,a hybrid ensemble BERT model is suggested,optimized using the Walrus Optimization Algorithm(WaOA).The framework applies PCA to reduce dimensionality,ontology normalization,and K-means clustering to improve semantic comprehension.Experimental results on the SQuAD 2.0 and MS MARCO datasets show that the proposed model outperforms the baseline models.WaOA(Weighted Average of Attention)can improve convergence,reduce training time,and enhance prediction accuracy.The model also improves the semantic relevance of the extracted information.Attention maps visualize the model’s focus on relevant query terms.The method enhances efficiency and cuts redundancy.It also provides a more generalized approach to different query types.The framework promotes consistent and reliable performance across different data conditions,including varying input formats and varying noise levels.It can be generalized to multilingual and domain-specific applications.Overall,the framework provides a scalable and reliable solution to real-world information extraction. 展开更多
关键词 Query-based information extraction ensemble BERT walrus optimization algorithm metaheuristic learning PCA K-means clustering ROUGE t-SNE attention visualization
暂未订购 下载PDF
An Adaptive Imperialist Competitive Algorithm with Cooperation for Flexible Jobshop and Parallel Batch Processing Machine Scheduling 认领 引用
18
作者 Jie Wang Deming Lei 《Computers, Materials & Continua》 SCIE EI 2026年第6期1934-1960,共27页
Both flexible jobshop scheduling and parallel batch processing machine scheduling have been extensively considered;however,the flexible jobshop and parallel batch processing machine scheduling problem(FJPBPMSP)is prev... Both flexible jobshop scheduling and parallel batch processing machine scheduling have been extensively considered;however,the flexible jobshop and parallel batch processing machine scheduling problem(FJPBPMSP)is prevalent in real-life manufacturing processes and is seldom investigated.In this study,FJPBPMSP is examined,where flexible processing and batch processing are performed sequentially.An adaptive imperialist competitive algorithm with cooperation(CAICA)is proposed to minimize makespan and total energy consumption simultaneously.In CAICA,a four-string representation is adopted,and initial empires with novel structures are formed by uniformly dividing the population.An adaptive assimilation and revolution are designed.An adaptive assimilation and revolution are designed.An adaptive imperialist competition with cooperation is provided.Search strategies,imperialists,and colonies are also renewed by new procedures.Computational experiments are conducted on 50 instances.The computational results show that the new strategies of CAICA are effective,and CAICA can provide better results than its comparative algorithms in solving FJPBPMSP. 展开更多
关键词 Flexible jobshop scheduling parallel batch processing scheduling imperialist competition algorithm cooperation
暂未订购 下载PDF
Dendritic Cell Algorithm with Reinforcement Learning for Adaptive Signal Categorization 认领 引用
19
作者 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
Medical data mining for diabetic retinopathy:Imaging modalities and algorithms 认领 引用
20
作者 Bobbinpreet Kaur Sheenam +1 位作者 Aleem Ali Fakhrun Jamal 《Medical Data Mining》 CAS 2026年第3期62-73,共12页
Diabetic retinopathy(DR)is one of the primary issue of vision loss.It is caused by damages of blood vessels of the retina.Advances in imaging technology and the computational intelligence are turning out to be an effe... Diabetic retinopathy(DR)is one of the primary issue of vision loss.It is caused by damages of blood vessels of the retina.Advances in imaging technology and the computational intelligence are turning out to be an effective tool to accurately and early diagnosis of Diabetic retinopathy.This review article highlights a critical analysis of the existing literature on machine learning and deep learning model applied to fundus photography,optical coherence tomography(OCT),and RetCam imaging.Public datasets such as EyePACS,IDRiD,and Messidor have been widely used but remain challenged by variability,class imbalance,and annotation quality.Data mining techniques—such as clustering to discern disease progression trends,feature selection to minimize dimensionality are essential for deriving relevant clinical insights.The results demonstrate that deep learning-based CAD systems surpass typical machine learning methods,with classification accuracies greater than 90%in multi-stage DR severity assessment.Fundus photography integrated with CNN-based models exhibits significant promise for extensive screening,but OCT-based methods offer improved structural examination of retinal layers.Therefore,an overall computer-aided diagnosis(CAD)supported by medical data mining can enable cost-effective,scalable,and precise DR screening,thereby reducing the global burden of diabetes-related blindness. 展开更多
关键词 diabetic retinopathy medical data mining computer-aided diagnosis retinal imaging datasets deep learning algorithms health informatics
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈