期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到247,153篇文章
< 1 2 … 250 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Identification of small impact craters in Chang’e-4 landing areas using a new multi-scale fusion crater detection algorithm 认领 引用
1
作者 FangChao Liu HuiWen Liu +7 位作者 Li Zhang Jian Chen DiJun Guo Bo Li ChangQing Liu ZongCheng Ling Ying-Bo Lu JunSheng Yao 《Earth and Planetary Physics》 EI CSCD 2026年第1期92-104,共13页
Impact craters are important for understanding the evolution of lunar geologic and surface erosion rates,among other functions.However,the morphological characteristics of these micro impact craters are not obvious an... Impact craters are important for understanding the evolution of lunar geologic and surface erosion rates,among other functions.However,the morphological characteristics of these micro impact craters are not obvious and they are numerous,resulting in low detection accuracy by deep learning models.Therefore,we proposed a new multi-scale fusion crater detection algorithm(MSF-CDA)based on the YOLO11 to improve the accuracy of lunar impact crater detection,especially for small craters with a diameter of140 m.We then trained three submodels separately with these three datasets.Additionally,we designed a slicing-amplifying-slicing strategy to enhance the ability to extract features from small craters.To handle redundant predictions,we proposed a new Non-Maximum Suppression with Area Filtering method to fuse the results in overlapping targets within the multi-scale submodels.Finally,our new MSF-CDA method achieved high detection performance,with the Precision,Recall,and F1 score having values of 0.991,0.987,and 0.989,respectively,perfectly addressing the problems induced by the lesser features and sample imbalance of small craters.Our MSF-CDA can provide strong data support for more in-depth study of the geological evolution of the lunar surface and finer geological age estimations.This strategy can also be used to detect other small objects with lesser features and sample imbalance problems.We detected approximately 500,000 impact craters in an area of approximately 214 km2 around the CE-4 landing area.By statistically analyzing the new data,we updated the distribution function of the number and diameter of impact craters.Finally,we identified the most suitable lighting conditions for detecting impact crater targets by analyzing the effect of different lighting conditions on the detection accuracy. 展开更多
关键词 impact craters Chang’e-4 landing area multi-scale automatic detection YOLO11 Fusion algorithm
暂未订购 下载PDF
Hierarchical algorithm for large-scale irregular packing problems 认领 引用
2
作者 Xiao LIU 《ENGINEERING Information Technology & Electronic Engineering》 SCIE EI CSCD 2026年第3期69-80,共12页
To address the challenge of large-scale packing problems,this paper proposes a novel hierarchical algorithm based on the geometrical classification of parts.The algorithm begins by classifying parts into three levels ... To address the challenge of large-scale packing problems,this paper proposes a novel hierarchical algorithm based on the geometrical classification of parts.The algorithm begins by classifying parts into three levels based on their area and fullness and then applies distinct packing strategies to each category.An innovative“shape matching”method is introduced,which,together with the“box stacking”(for rectangular parts)and“gravity packing,”forms a comprehensive hierarchical packing system.Level-1 comprises large rectangular parts,which are arranged using the box stacking algorithm.By aligning the corner points of the parts’bounding boxes,this method avoids the hooking issue commonly encountered in gravity packing.Level-2 includes both large,irregular parts and medium-sized parts.They are first processed using the shape matching algorithm,where rotation and translation are applied to achieve contour complementarity.The quality of the match is evaluated using the shape matching coefficient(SMC).If the SMC fails to reach the preset quality threshold,the system switches to box stacking(for large,irregular parts)or gravity packing(for medium-sized parts).Level-3 comprises the remaining smaller parts and those that failed to pack in the previous two levels.For these parts,shape matching is attempted first,and the system resorts to gravity packing in case of failure.The experimental and comparative results demonstrate that the proposed hierarchical algorithm achieves higher material utilization than the traditional gravity packing algorithm.This improvement is facilitated by the box stacking and shape matching strategies,which promote a more orderly and compact arrangement of parts. 展开更多
关键词 Large-scale packing Hierarchical algorithm Box stacking Shape matching Gravity packing Principle of minimum potential energy
暂未订购 下载PDF
Research on heuristic approximation algorithm of the densest k-subgraph discovery in large-scale dynamic graphs 认领 引用
3
作者 HAN Tao TIAN Yuxi +1 位作者 ZHAO Jianwei WANG Senzhang 《Journal of Southeast University(English Edition)》 EI CAS 2026年第1期74-79,共6页
To address the issue that static densest subgraph mining algorithms often exhibit low efficiency when handling large scale dynamic graphs,this paper proposes a heuristic approximation algorithm.The algorithm approxima... To address the issue that static densest subgraph mining algorithms often exhibit low efficiency when handling large scale dynamic graphs,this paper proposes a heuristic approximation algorithm.The algorithm approximates the densest k-subgraphs of the entire graph through four steps:partitioning the large-scale dynamic graph,constructing a partial set of the densest k-subgraphs,heuristically merging the subgraph sets,and finally extracting the densest k-subgraphs.This approach significantly reduces the computational time for large-scale dynamic graphs while simultaneously improving the quality of the resulting subgraphs.This algorithm is applicable to various definitions of“density”and can accommodate diverse requirements on the number of edges.When integrated with existing static densest subgraph detection algorithms,it achieves scalability and computational efficiency.Theoretical analysis demonstrates that the optimal density of the densest k-subgraphs extracted by the proposed algorithm reaches 0.9.To evaluate the performance of the algorithm,experiments were conducted on four billion-scale datasets:Friendster,Orkut,YouTube,and DBLP.The results indicate that the proposed algorithm outperforms static methods in both runtime efficiency and subgraph quality on large-scale dynamic graphs. 展开更多
关键词 the densest k-subgraph features heuristic approximation algorithm optimal density
暂未订购 下载PDF
Enhanced multiscale quantum approximate optimization algorithm in multibody combinatorial optimization problems 认领 引用
4
作者 Lei-Lei Chen Ping Zou Ya-Fei Yu 《Chinese Physics B》 SCIE EI CAS CSCD 2026年第7期424-434,共11页
At present,the quantum approximate optimization algorithm(QAOA)faces scalability challenges in high-dimensional combinatorial optimization problems due to exponentially growing computational costs and reachability def... At present,the quantum approximate optimization algorithm(QAOA)faces scalability challenges in high-dimensional combinatorial optimization problems due to exponentially growing computational costs and reachability deficits for noisy intermediate-scale quantum(NISQ)devices.This study focuses on the multiscale quantum approximate optimization algorithm(MQAOA),which integrates renormalization group(RG)transformations with QAOA to address these limitations.Based on the connections between the variables in the problem to be solved,the weighted maximal matching method is employed to generate a variable partitioning strategy guiding the RG transformation.This approach not only extends the applicability of MQAOA to satisfiability(SAT)problems—including those with three-body and higher-order interactions in the problem Hamiltonian—but also eliminates the algorithm's sensitivity to problem density.Validations conducted on quantum simulators show that,after running two-round MQAOA,its capability is enhanced to identify optimal solutions with approximately 97%success probability as defined by the ground-state overlap for Max-2-SAT problems(78%success probability for Max-3-SAT problems).The results confirm the feasibility of MQAOA and establish it as a resource-efficient framework for complex combinatorial optimization problems,providing a pathway for NISQ-era deployment. 展开更多
关键词 quantum algorithm parameterized quantum circuit renormalization group transformation combinatorial optimization Max-SAT problems
暂未订购 下载PDF
A fast algorithm for solving the scattering problem from an open rectangular cavity 认领 引用
5
作者 HAN Shangqi LI Yuan 《黑龙江大学自然科学学报》 CAS 2026年第1期31-41,共11页
This paper presents a fast algorithm for solving the scattering problem from an open rectangular cavity embedded in the ground plane.The computational region is chosen as the union of two rectangular regions:one is a ... This paper presents a fast algorithm for solving the scattering problem from an open rectangular cavity embedded in the ground plane.The computational region is chosen as the union of two rectangular regions:one is a region above the ground,the other one is a region containing the cavity.The finite difference scheme is constructed in each region.An intermediate layer of the mesh is shared by both regions,which is the key of the algorithm.A cyclic reduction method is employed to solve the difference equation in the region above the ground.Then the numerical solution on the cavity aperture can be obtained.The numerical experiments are provided to verify the feasibility of the proposed algorithm. 展开更多
关键词 scattering problem cavity Helmholtz equation fast algorithm difference equation cyclic reduction method
暂未订购 下载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
Steel Surface Defect Detection via the Multiscale Edge Enhancement Method 认领 引用 被引量：1
7
作者 Yuanyuan Wang Yemeng Zhu +2 位作者 Xiuchuan Chen Tongtong Yin Shiwei Su 《Computers, Materials & Continua》 SCIE EI 2026年第3期1006-1032,共27页
To solve the false detection and missed detection problems caused by various types and sizes of defects in the detection of steel surface defects,similar defects and background features,and similarities between differ... To solve the false detection and missed detection problems caused by various types and sizes of defects in the detection of steel surface defects,similar defects and background features,and similarities between different defects,this paper proposes a lightweight detection model named multiscale edge and squeeze-and-excitation attention detection network(MSESE),which is built upon the You Only Look Once version 11 nano(YOLOv11n).To address the difficulty of locating defect edges,we first propose an edge enhancement module(EEM),apply it to the process of multiscale feature extraction,and then propose a multiscale edge enhancement module(MSEEM).By obtaining defect features from different scales and enhancing their edge contours,the module uses the dual-domain selection mechanism to effectively focus on the important areas in the image to ensure that the feature images have richer information and clearer contour features.By fusing the squeeze-and-excitation attention mechanism with the EEM,we obtain a lighter module that can enhance the representation of edge features,which is named the edge enhancement module with squeeze-and-excitation attention(EEMSE).This module was subsequently integrated into the detection head.The enhanced detection head achieves improved edge feature enhancement with reduced computational overhead,while effectively adjusting channel-wise importance and further refining feature representation.Experiments on the NEU-DET dataset show that,compared with the original YOLOv11n,the improved model achieves improvements of 4.1%and 2.2%in terms of mAP@0.5 and mAP@0.5:0.95,respectively,and the GFLOPs value decreases from the original value of 6.4 to 6.2.Furthermore,when compared to current mainstream models,Mamba-YOLOT and RTDETR-R34,our method achieves superior performance with 6.5%and 8.9%higher mAP@0.5,respectively,while maintaining a more compact parameter footprint.These results collectively validate the effectiveness and efficiency of our proposed approach. 展开更多
关键词 Steel defects object detection algorithms small target multiscale attention mechanism
暂未订购 下载PDF
Novel Sea Otter Optimization Algorithm for WSN Coverage Intelligence Optimization 认领 引用 被引量：2
8
作者 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
9
作者 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
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
一种基于通用系统管理的SCA软件设计 认领 引用
11
作者 王婷 刘思琦 +1 位作者 雷煜靓 尉嘉维 《航空计算技术》 2026年第3期62-67,共6页
结合机载综合射频一体化设计需求,在原有任务系统之通用系统管理(GSM)技术和射频软件通信架构(SCA)技术基础上,分析了二者融合架构的优势及关键技术,提出一种新的协同设计方案。方案明确了GSM“总管理者”、SCA“被管理者”的角色定位,... 结合机载综合射频一体化设计需求,在原有任务系统之通用系统管理(GSM)技术和射频软件通信架构(SCA)技术基础上,分析了二者融合架构的优势及关键技术,提出一种新的协同设计方案。方案明确了GSM“总管理者”、SCA“被管理者”的角色定位,构建主从节点分布式融合部署架构、设计覆盖健康状态、版本查询、波形管理、事件上报的四类标准化逻辑接口,以及SCA的域描述文件(Domain Profile)部署设计,最后梳理系统启动、故障监测、波形任务重构等四类典型运行场景及软件交互序列。方案可为机载传感器信号处理和信息处理集成提供一种新思路。 展开更多
关键词 综合射频 GSM SDR SCA
暂未订购 下载PDF
Low-complexity APSK demodulation algorithm based on K-means clustering in LEO satellite communication systems 认领 引用
12
作者 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 认领 引用
13
作者 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 认领 引用
14
作者 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 认领 引用
15
作者 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 认领 引用
16
作者 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://gffzz188fe103f8f1460as6uwcxuf0wbfx6f9x.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 认领 引用
17
作者 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 认领 引用
18
作者 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 认领 引用
19
作者 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 认领 引用
20
作者 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
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈