期刊文献+
共找到282,743篇文章
< 1 2 250 >
每页显示 20 50 100
WWCD优化Canopy-K-means的雷达信号分选算法
1
作者 王之腾 李尚远 +2 位作者 纪存孝 刘畅 严子路 《陆军工程大学学报》 2025年第1期20-26,共7页
雷达信号分选是电子战系统中的关键技术,是战场态势感知的重要环节,新体制雷达技术的快速发展给复杂电磁环境下信号分选带来了严峻挑战。针对传统K-means聚类算法在对雷达全脉冲数据进行信号分选时存在对聚类数K和初始点选择较为敏感的... 雷达信号分选是电子战系统中的关键技术,是战场态势感知的重要环节,新体制雷达技术的快速发展给复杂电磁环境下信号分选带来了严峻挑战。针对传统K-means聚类算法在对雷达全脉冲数据进行信号分选时存在对聚类数K和初始点选择较为敏感的问题,提出了一种基于优化K-means的雷达信号分选算法。通过将水波中心扩散(water wave center diffusion,WWCD)优化算法和Canopy算法相结合,实现了Canopy算法距离阈值的优选,并为后续K-means聚类优化了K值的选择,有效降低了K-means算法对初始聚类数选择的敏感性。实验中,主要通过3个UCI公开数据集和3类频率跳变雷达脉冲数据进行聚类分选效果验证,并与常见的DBSCAN、OPTICS、Canopy-K-means等聚类算法进行了聚类效果对比。结果表明,所提方法有较高的聚类分选准确率,且对初始参数的设置不敏感。 展开更多
关键词 雷达信号分选 水波中心扩散优化 Canopy算法 K-MEANS算法
在线阅读 下载PDF
基于改进Canopy-K-means算法的并行化研究 被引量:12
2
作者 王林 贾钧琛 《计算机测量与控制》 2021年第2期176-179,186,共5页
随着互联网数据的快速增长,原始的K-means算法已经不足以应对大规模数据的聚类需求;为此,提出一种改进的Canopy-K-means聚类算法;首先面对Canopy算法中心点随机选取的不足,引入“最大最小原则”优化Canopy中心点的选取;接着借助三角不... 随着互联网数据的快速增长,原始的K-means算法已经不足以应对大规模数据的聚类需求;为此,提出一种改进的Canopy-K-means聚类算法;首先面对Canopy算法中心点随机选取的不足,引入“最大最小原则”优化Canopy中心点的选取;接着借助三角不等式定理对K-means算法进行优化,减少冗余的距离计算,加快算法的收敛速度;最后结合MapReduce框架并行化实现改进的Canopy-K-means算法;基于构建的微博数据集,对优化后的Canopy-K-means算法进行测试;试验结果表明:对不同数据规模的微博数据集,优化后算法的准确率较K-means算法提高了约15%,较原始的Canopy-K-means算法提高了约7%,算法的执行效率和扩展性也有较大提升。 展开更多
关键词 canopy-k-means算法 文本聚类 最大最小原则 三角不等式 MAPREDUCE
在线阅读 下载PDF
基于Canopy-K-means算法的高校贫困生预测的研究 被引量:3
3
作者 王全民 张书军 《计算机与数字工程》 2020年第12期3012-3016,3041,共6页
高校贫困生的认定和和资助工作对于高等人才的培养、减轻贫困生家庭经济负担是非常重要的;如何做到精准扶贫一直是高校贫苦生认定和资助工作的重点和难点。基于校园一卡通学生消费数据、上网日志等多模态数据,提出了一种基于Canopy-K-me... 高校贫困生的认定和和资助工作对于高等人才的培养、减轻贫困生家庭经济负担是非常重要的;如何做到精准扶贫一直是高校贫苦生认定和资助工作的重点和难点。基于校园一卡通学生消费数据、上网日志等多模态数据,提出了一种基于Canopy-K-means算法的高校贫困生预测的方法。该方法通过引入Canopy改进的聚类算法,得到贫困生所属类别,并将该类学生与实际的贫困生作对比,分析贫困生在校消费习惯和上网行为。该实验能有效地对贫困生进行分类,为学校贫困生认定提供辅助决策作用。 展开更多
关键词 贫困生认定 多模态数据 数据挖掘 canopy-k-means算法
在线阅读 下载PDF
基于信息熵和Canopy-K-Means算法的货车驾驶风格识别 被引量:1
4
作者 李浩 王肇飞 李微 《交通工程》 2024年第7期123-128,共6页
为识别货车的激进驾驶行为,保障货车行车安全,提出1种基于信息熵和Canopy-K-Means算法的货车驾驶风格识别方法。首先,从货车自然驾驶数据中提取出604个驾驶片段,根据信息熵理论计算各个驾驶片段的速度熵值、横向加速度熵值和纵向加速度... 为识别货车的激进驾驶行为,保障货车行车安全,提出1种基于信息熵和Canopy-K-Means算法的货车驾驶风格识别方法。首先,从货车自然驾驶数据中提取出604个驾驶片段,根据信息熵理论计算各个驾驶片段的速度熵值、横向加速度熵值和纵向加速度熵值,构成货车驾驶风格表征指标集;其次,针对K-Means算法的聚类数量主观选取、初始聚类中心随机选取的问题,使用Canopy算法改进K-Means算法(Canopy-K-Means算法);最后,分别使用K-Means算法和Canopy-K-Means算法对货车驾驶风格进行识别。研究结果显示,Canopy-K-Means算法的轮廓系数和Calinski-Harabasz指数均大于K-Means算法,表现出更优的聚类性能。根据Canopy-K-Means算法,可将货车驾驶风格分为沉稳型、常规型和激进型3类,其中激进型货车驾驶风格的指标熵值和极差均较大,存在较高的安全隐患,需要引起相关部门的高度重视。 展开更多
关键词 交通工程 驾驶风格 canopy-k-means算法 信息熵 货车
在线阅读 下载PDF
结合Canopy-K-means算法和出租车轨迹数据的公交车站预测方法 被引量:8
5
作者 刘旭 陈云波 +1 位作者 施昆 黄强 《测绘通报》 CSCD 北大核心 2018年第11期63-68,共6页
公共交通轨迹的规划和站点确定是很困难的,而出租车的GPS数据用处很大,能够挖掘出人们活动的热点,因此利用出租车的GPS数据有助于规划公交站点。本文基于武汉市出租车轨迹数据,提出了一种基于Canopy-K-means算法的公共交通站点的预测方... 公共交通轨迹的规划和站点确定是很困难的,而出租车的GPS数据用处很大,能够挖掘出人们活动的热点,因此利用出租车的GPS数据有助于规划公交站点。本文基于武汉市出租车轨迹数据,提出了一种基于Canopy-K-means算法的公共交通站点的预测方法。该方法通过引入Canopy-K-means改进聚类算法,得到客源地的出行热点区域,并将该区域和已有公交站点对比,分析公交站点存在的合理性;然后采用数理统计的方法,对客流量的时空分布特征进行研究。采用武汉市2014年7月31日—2014年8月12日2064台出租车的GPS坐标数据进行研究,试验结果表明:该方法能有效判断公交站点位置的合理性,为公交车发车频率提供辅助决策支持。 展开更多
关键词 出租车轨迹数据 canopy-k-means算法 公交车站 公交车的发车频率
原文传递
基于Hadoop的Canopy-K-means并行算法的学生成绩与毕业流向关系分析 被引量:11
6
作者 郭卫霞 薛涛 李婷 《西安工程大学学报》 CAS 2018年第6期705-712,共8页
为了探究学生成绩与其毕业去向之间存在的内在关系,提出基于Hadoop的Canopy-Kmeans并行算法并进行分析.首先基于"最小最大原则"确定Canopy的初始中心点并快速粗糙聚类,将其作为K-means算法的初始聚类中心,并基于MapReduce计... 为了探究学生成绩与其毕业去向之间存在的内在关系,提出基于Hadoop的Canopy-Kmeans并行算法并进行分析.首先基于"最小最大原则"确定Canopy的初始中心点并快速粗糙聚类,将其作为K-means算法的初始聚类中心,并基于MapReduce计算框架实现其并行化.然后以西安工程大学2017届毕业生的教务数据为基础,进行海量教务数据的挖掘分析实验,完成相同毕业流向类型学生的聚类,同时分析各毕业流向与课程之间的内在联系.实验结果证明,改进后的Canopy-K-means算法在处理海量数据时,相比传统K-means算法,聚类收敛速度提高约2.1倍,准确率提高约15%,具有良好的聚类效果. 展开更多
关键词 HADOOP canopy-k-means 最小最大原则 MAPREDUCE 教务 毕业流向
在线阅读 下载PDF
基于改进的Canopy-k-means的大跨屋盖表面风荷载分区方法 被引量:1
7
作者 李玉学 纪君 董阳 《河北科技大学学报》 CAS 北大核心 2024年第5期530-538,共9页
针对k-means聚类算法在大跨屋盖结构表面风荷载分区计算中,聚类数k值随机选取容易导致结果不稳定和计算效率低等问题,提出改进的Canopy-k-means聚类算法。首先,引入Canopy算法并对其初始阈值和聚类中心的选取方式进行改进,减少初始值选... 针对k-means聚类算法在大跨屋盖结构表面风荷载分区计算中,聚类数k值随机选取容易导致结果不稳定和计算效率低等问题,提出改进的Canopy-k-means聚类算法。首先,引入Canopy算法并对其初始阈值和聚类中心的选取方式进行改进,减少初始值选取的盲目性,以提高风荷载分区结果的可靠性;其次,通过改进Canopy算法对风荷载数据集进行预处理,快速准确地确定聚类数k值;第三,将改进Canopy算法与k-means结合使用,实现最优分类数k值的精准识别,使得改进的Canopy-k-means聚类算法进行大跨屋盖结构表面风荷载分区时能够快速准确地得到分区结果;最后,以一大跨柱面屋盖干煤棚结构为例,基于风洞试验所得结构表面风荷载数据测试结果,采用所提改进的Canopy-k-means聚类算法对其表面风荷载进行分区计算。结果表明,采用改进的Canopy-k-means聚类算法,将0°、50°和90°风向角时大跨屋盖表面风荷载划分为了3个不同的分区,其对应的SD值分别为2.36、3.51和2.52,较传统k-means聚类算法所得对应值明显降低,类内紧凑性和类间分散性明显提升。所提改进Canopy-k-means聚类算法能够快速准确地得到最优分区结果,对大跨屋盖表面风荷载分区具有工程参考价值。 展开更多
关键词 薄壳结构 风荷载测压 风荷载分区 K-MEANS聚类算法 Canopy算法
在线阅读 下载PDF
基于Canopy-K-means算法的半挂汽车列车行驶数据分析
8
作者 李兵 屈亚洲 +2 位作者 熊乐 王晓亮 赵晨光 《科技和产业》 2021年第8期288-294,共7页
为实时监测车辆行驶状态,建立了基于Canopy-K-means算法的车辆行驶安全特征分类模型。采用Canopy-K-means聚类算法对车辆行驶数据进行挖掘分析,以欧氏距离大小作为数据集属性间的相似性分类指标,得到表征不同行驶安全特征的离线聚类质心... 为实时监测车辆行驶状态,建立了基于Canopy-K-means算法的车辆行驶安全特征分类模型。采用Canopy-K-means聚类算法对车辆行驶数据进行挖掘分析,以欧氏距离大小作为数据集属性间的相似性分类指标,得到表征不同行驶安全特征的离线聚类质心;搭建TruckSim与Simulink联合仿真平台,设置定半径变车速和方向盘斜阶跃输入仿真工况对车辆行驶状态进行在线识别;同时为验证该方法在实车上的应用效果,设置相同工况对离线聚类质心进行验证分析。仿真和实车结果表明:基于Canopy-K-means算法的数据挖掘方法可以对不同行驶状态数据进行分类,得到的表征不同行驶安全特征的聚类质心能在一定程度上对车辆行驶稳定性进行评价,可以作为车辆控制和预警的判定依据。 展开更多
关键词 行驶稳定性 canopy-k-means算法 分类模型 半挂汽车列车 欧氏距离
在线阅读 下载PDF
Method for Estimating the State of Health of Lithium-ion Batteries Based on Differential Thermal Voltammetry and Sparrow Search Algorithm-Elman Neural Network 被引量:1
9
作者 Yu Zhang Daoyu Zhang TiezhouWu 《Energy Engineering》 EI 2025年第1期203-220,共18页
Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,curr... Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,current SOH estimation methods often overlook the valuable temperature information that can effectively characterize battery aging during capacity degradation.Additionally,the Elman neural network,which is commonly employed for SOH estimation,exhibits several drawbacks,including slow training speed,a tendency to become trapped in local minima,and the initialization of weights and thresholds using pseudo-random numbers,leading to unstable model performance.To address these issues,this study addresses the challenge of precise and effective SOH detection by proposing a method for estimating the SOH of lithium-ion batteries based on differential thermal voltammetry(DTV)and an SSA-Elman neural network.Firstly,two health features(HFs)considering temperature factors and battery voltage are extracted fromthe differential thermal voltammetry curves and incremental capacity curves.Next,the Sparrow Search Algorithm(SSA)is employed to optimize the initial weights and thresholds of the Elman neural network,forming the SSA-Elman neural network model.To validate the performance,various neural networks,including the proposed SSA-Elman network,are tested using the Oxford battery aging dataset.The experimental results demonstrate that the method developed in this study achieves superior accuracy and robustness,with a mean absolute error(MAE)of less than 0.9%and a rootmean square error(RMSE)below 1.4%. 展开更多
关键词 Lithium-ion battery state of health differential thermal voltammetry Sparrow Search algorithm
在线阅读 下载PDF
Robustness Optimization Algorithm with Multi-Granularity Integration for Scale-Free Networks Against Malicious Attacks 被引量:1
10
作者 ZHANG Yiheng LI Jinhai 《昆明理工大学学报(自然科学版)》 北大核心 2025年第1期54-71,共18页
Complex network models are frequently employed for simulating and studyingdiverse real-world complex systems.Among these models,scale-free networks typically exhibit greater fragility to malicious attacks.Consequently... Complex network models are frequently employed for simulating and studyingdiverse real-world complex systems.Among these models,scale-free networks typically exhibit greater fragility to malicious attacks.Consequently,enhancing the robustness of scale-free networks has become a pressing issue.To address this problem,this paper proposes a Multi-Granularity Integration Algorithm(MGIA),which aims to improve the robustness of scale-free networks while keeping the initial degree of each node unchanged,ensuring network connectivity and avoiding the generation of multiple edges.The algorithm generates a multi-granularity structure from the initial network to be optimized,then uses different optimization strategies to optimize the networks at various granular layers in this structure,and finally realizes the information exchange between different granular layers,thereby further enhancing the optimization effect.We propose new network refresh,crossover,and mutation operators to ensure that the optimized network satisfies the given constraints.Meanwhile,we propose new network similarity and network dissimilarity evaluation metrics to improve the effectiveness of the optimization operators in the algorithm.In the experiments,the MGIA enhances the robustness of the scale-free network by 67.6%.This improvement is approximately 17.2%higher than the optimization effects achieved by eight currently existing complex network robustness optimization algorithms. 展开更多
关键词 complex network model MULTI-GRANULARITY scale-free networks ROBUSTNESS algorithm integration
原文传递
基于类别偏好Canopy-K-means的协同过滤推荐系统算法 被引量:3
11
作者 邹燕飞 《电子设计工程》 2020年第17期46-51,共6页
协作过滤算法(CF)在推荐系统中难以处理数据的稀疏性和可伸缩性问题。本文提出了基于类别偏好Canopy-K-means的协同过滤算法(CPCKCF),设计了用户项类别偏好比率(UICPR)的定义,并用来计算UICPR矩阵。将Canopy算法作为CPCKCF的前置算法,... 协作过滤算法(CF)在推荐系统中难以处理数据的稀疏性和可伸缩性问题。本文提出了基于类别偏好Canopy-K-means的协同过滤算法(CPCKCF),设计了用户项类别偏好比率(UICPR)的定义,并用来计算UICPR矩阵。将Canopy算法作为CPCKCF的前置算法,并将输出作为K-means算法的输入,其结果用于用户数据进行聚类并找到最近的用户以获得预测得分,使用MovieLens数据集进行的实验结果表明,与传统的基于用户的协作过滤算法相比,所提出的CPCKCF算法将计算效率和推荐精度提高了2.81%。 展开更多
关键词 推荐系统 协同过滤 数据挖掘 Canopy算法 K-MEANS算法
在线阅读 下载PDF
Short-TermWind Power Forecast Based on STL-IAOA-iTransformer Algorithm:A Case Study in Northwest China 被引量:2
12
作者 Zhaowei Yang Bo Yang +5 位作者 Wenqi Liu Miwei Li Jiarong Wang Lin Jiang Yiyan Sang Zhenning Pan 《Energy Engineering》 2025年第2期405-430,共26页
Accurate short-term wind power forecast technique plays a crucial role in maintaining the safety and economic efficiency of smart grids.Although numerous studies have employed various methods to forecast wind power,th... Accurate short-term wind power forecast technique plays a crucial role in maintaining the safety and economic efficiency of smart grids.Although numerous studies have employed various methods to forecast wind power,there remains a research gap in leveraging swarm intelligence algorithms to optimize the hyperparameters of the Transformer model for wind power prediction.To improve the accuracy of short-term wind power forecast,this paper proposes a hybrid short-term wind power forecast approach named STL-IAOA-iTransformer,which is based on seasonal and trend decomposition using LOESS(STL)and iTransformer model optimized by improved arithmetic optimization algorithm(IAOA).First,to fully extract the power data features,STL is used to decompose the original data into components with less redundant information.The extracted components as well as the weather data are then input into iTransformer for short-term wind power forecast.The final predicted short-term wind power curve is obtained by combining the predicted components.To improve the model accuracy,IAOA is employed to optimize the hyperparameters of iTransformer.The proposed approach is validated using real-generation data from different seasons and different power stations inNorthwest China,and ablation experiments have been conducted.Furthermore,to validate the superiority of the proposed approach under different wind characteristics,real power generation data fromsouthwestChina are utilized for experiments.Thecomparative results with the other six state-of-the-art prediction models in experiments show that the proposed model well fits the true value of generation series and achieves high prediction accuracy. 展开更多
关键词 Short-termwind power forecast improved arithmetic optimization algorithm iTransformer algorithm SimuNPS
在线阅读 下载PDF
A LODBO algorithm for multi-UAV search and rescue path planning in disaster areas 被引量:1
13
作者 Liman Yang Xiangyu Zhang +2 位作者 Zhiping Li Lei Li Yan Shi 《Chinese Journal of Aeronautics》 2025年第2期200-213,共14页
In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms... In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms to solve the problem of multi-UAV path planning.The Dung Beetle Optimization(DBO)algorithm has been widely applied due to its diverse search patterns in the above algorithms.However,the update strategies for the rolling and thieving dung beetles of the DBO algorithm are overly simplistic,potentially leading to an inability to fully explore the search space and a tendency to converge to local optima,thereby not guaranteeing the discovery of the optimal path.To address these issues,we propose an improved DBO algorithm guided by the Landmark Operator(LODBO).Specifically,we first use tent mapping to update the population strategy,which enables the algorithm to generate initial solutions with enhanced diversity within the search space.Second,we expand the search range of the rolling ball dung beetle by using the landmark factor.Finally,by using the adaptive factor that changes with the number of iterations.,we improve the global search ability of the stealing dung beetle,making it more likely to escape from local optima.To verify the effectiveness of the proposed method,extensive simulation experiments are conducted,and the result shows that the LODBO algorithm can obtain the optimal path using the shortest time compared with the Genetic Algorithm(GA),the Gray Wolf Optimizer(GWO),the Whale Optimization Algorithm(WOA)and the original DBO algorithm in the disaster search and rescue task set. 展开更多
关键词 Unmanned aerial vehicle Path planning Meta heuristic algorithm DBO algorithm NP-hard problems
原文传递
Research on Euclidean Algorithm and Reection on Its Teaching
14
作者 ZHANG Shaohua 《应用数学》 北大核心 2025年第1期308-310,共3页
In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and t... In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and the greatest common divisor.We further provided several suggestions for teaching. 展开更多
关键词 Euclid's algorithm Division algorithm Bezout's equation
在线阅读 下载PDF
DDoS Attack Autonomous Detection Model Based on Multi-Strategy Integrate Zebra Optimization Algorithm
15
作者 Chunhui Li Xiaoying Wang +2 位作者 Qingjie Zhang Jiaye Liang Aijing Zhang 《Computers, Materials & Continua》 SCIE EI 2025年第1期645-674,共30页
Previous studies have shown that deep learning is very effective in detecting known attacks.However,when facing unknown attacks,models such as Deep Neural Networks(DNN)combined with Long Short-Term Memory(LSTM),Convol... Previous studies have shown that deep learning is very effective in detecting known attacks.However,when facing unknown attacks,models such as Deep Neural Networks(DNN)combined with Long Short-Term Memory(LSTM),Convolutional Neural Networks(CNN)combined with LSTM,and so on are built by simple stacking,which has the problems of feature loss,low efficiency,and low accuracy.Therefore,this paper proposes an autonomous detectionmodel for Distributed Denial of Service attacks,Multi-Scale Convolutional Neural Network-Bidirectional Gated Recurrent Units-Single Headed Attention(MSCNN-BiGRU-SHA),which is based on a Multistrategy Integrated Zebra Optimization Algorithm(MI-ZOA).The model undergoes training and testing with the CICDDoS2019 dataset,and its performance is evaluated on a new GINKS2023 dataset.The hyperparameters for Conv_filter and GRU_unit are optimized using the Multi-strategy Integrated Zebra Optimization Algorithm(MIZOA).The experimental results show that the test accuracy of the MSCNN-BiGRU-SHA model based on the MIZOA proposed in this paper is as high as 0.9971 in the CICDDoS 2019 dataset.The evaluation accuracy of the new dataset GINKS2023 created in this paper is 0.9386.Compared to the MSCNN-BiGRU-SHA model based on the Zebra Optimization Algorithm(ZOA),the detection accuracy on the GINKS2023 dataset has improved by 5.81%,precisionhas increasedby 1.35%,the recallhas improvedby 9%,and theF1scorehas increasedby 5.55%.Compared to the MSCNN-BiGRU-SHA models developed using Grid Search,Random Search,and Bayesian Optimization,the MSCNN-BiGRU-SHA model optimized with the MI-ZOA exhibits better performance in terms of accuracy,precision,recall,and F1 score. 展开更多
关键词 Distributed denial of service attack intrusion detection deep learning zebra optimization algorithm multi-strategy integrated zebra optimization algorithm
在线阅读 下载PDF
Bearing capacity prediction of open caissons in two-layered clays using five tree-based machine learning algorithms 被引量:1
16
作者 Rungroad Suppakul Kongtawan Sangjinda +3 位作者 Wittaya Jitchaijaroen Natakorn Phuksuksakul Suraparb Keawsawasvong Peem Nuaklong 《Intelligent Geoengineering》 2025年第2期55-65,共11页
Open caissons are widely used in foundation engineering because of their load-bearing efficiency and adaptability in diverse soil conditions.However,accurately predicting their undrained bearing capacity in layered so... Open caissons are widely used in foundation engineering because of their load-bearing efficiency and adaptability in diverse soil conditions.However,accurately predicting their undrained bearing capacity in layered soils remains a complex challenge.This study presents a novel application of five ensemble machine(ML)algorithms-random forest(RF),gradient boosting machine(GBM),extreme gradient boosting(XGBoost),adaptive boosting(AdaBoost),and categorical boosting(CatBoost)-to predict the undrained bearing capacity factor(Nc)of circular open caissons embedded in two-layered clay on the basis of results from finite element limit analysis(FELA).The input dataset consists of 1188 numerical simulations using the Tresca failure criterion,varying in geometrical and soil parameters.The FELA was performed via OptumG2 software with adaptive meshing techniques and verified against existing benchmark studies.The ML models were trained on 70% of the dataset and tested on the remaining 30%.Their performance was evaluated using six statistical metrics:coefficient of determination(R²),mean absolute error(MAE),root mean squared error(RMSE),index of scatter(IOS),RMSE-to-standard deviation ratio(RSR),and variance explained factor(VAF).The results indicate that all the models achieved high accuracy,with R²values exceeding 97.6%and RMSE values below 0.02.Among them,AdaBoost and CatBoost consistently outperformed the other methods across both the training and testing datasets,demonstrating superior generalizability and robustness.The proposed ML framework offers an efficient,accurate,and data-driven alternative to traditional methods for estimating caisson capacity in stratified soils.This approach can aid in reducing computational costs while improving reliability in the early stages of foundation design. 展开更多
关键词 Two-layered clay Open caisson Tree-based algorithms FELA Machine learning
在线阅读 下载PDF
Path Planning for Thermal Power Plant Fan Inspection Robot Based on Improved A^(*)Algorithm 被引量:1
17
作者 Wei Zhang Tingfeng Zhang 《Journal of Electronic Research and Application》 2025年第1期233-239,共7页
To improve the efficiency and accuracy of path planning for fan inspection tasks in thermal power plants,this paper proposes an intelligent inspection robot path planning scheme based on an improved A^(*)algorithm.The... To improve the efficiency and accuracy of path planning for fan inspection tasks in thermal power plants,this paper proposes an intelligent inspection robot path planning scheme based on an improved A^(*)algorithm.The inspection robot utilizes multiple sensors to monitor key parameters of the fans,such as vibration,noise,and bearing temperature,and upload the data to the monitoring center.The robot’s inspection path employs the improved A^(*)algorithm,incorporating obstacle penalty terms,path reconstruction,and smoothing optimization techniques,thereby achieving optimal path planning for the inspection robot in complex environments.Simulation results demonstrate that the improved A^(*)algorithm significantly outperforms the traditional A^(*)algorithm in terms of total path distance,smoothness,and detour rate,effectively improving the execution efficiency of inspection tasks. 展开更多
关键词 Power plant fans Inspection robot Path planning Improved A^(*)algorithm
在线阅读 下载PDF
Rapid pathologic grading-based diagnosis of esophageal squamous cell carcinoma via Raman spectroscopy and a deep learning algorithm 被引量:1
18
作者 Xin-Ying Yu Jian Chen +2 位作者 Lian-Yu Li Feng-En Chen Qiang He 《World Journal of Gastroenterology》 2025年第14期32-46,共15页
BACKGROUND Esophageal squamous cell carcinoma is a major histological subtype of esophageal cancer.Many molecular genetic changes are associated with its occurrence.Raman spectroscopy has become a new method for the e... BACKGROUND Esophageal squamous cell carcinoma is a major histological subtype of esophageal cancer.Many molecular genetic changes are associated with its occurrence.Raman spectroscopy has become a new method for the early diagnosis of tumors because it can reflect the structures of substances and their changes at the molecular level.AIM To detect alterations in Raman spectral information across different stages of esophageal neoplasia.METHODS Different grades of esophageal lesions were collected,and a total of 360 groups of Raman spectrum data were collected.A 1D-transformer network model was proposed to handle the task of classifying the spectral data of esophageal squamous cell carcinoma.In addition,a deep learning model was applied to visualize the Raman spectral data and interpret their molecular characteristics.RESULTS A comparison among Raman spectral data with different pathological grades and a visual analysis revealed that the Raman peaks with significant differences were concentrated mainly at 1095 cm^(-1)(DNA,symmetric PO,and stretching vibration),1132 cm^(-1)(cytochrome c),1171 cm^(-1)(acetoacetate),1216 cm^(-1)(amide III),and 1315 cm^(-1)(glycerol).A comparison among the training results of different models revealed that the 1Dtransformer network performed best.A 93.30%accuracy value,a 96.65%specificity value,a 93.30%sensitivity value,and a 93.17%F1 score were achieved.CONCLUSION Raman spectroscopy revealed significantly different waveforms for the different stages of esophageal neoplasia.The combination of Raman spectroscopy and deep learning methods could significantly improve the accuracy of classification. 展开更多
关键词 Raman spectroscopy Esophageal neoplasia Early diagnosis Deep learning algorithm Rapid pathologic grading
暂未订购
An Algorithm for Cloud-based Web Service Combination Optimization Through Plant Growth Simulation
19
作者 Li Qiang Qin Huawei +1 位作者 Qiao Bingqin Wu Ruifang 《系统仿真学报》 北大核心 2025年第2期462-473,共12页
In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-base... In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm. 展开更多
关键词 cloud-based service scheduling algorithm resource constraint load optimization cloud computing plant growth simulation algorithm
原文传递
Improved algorithm of multi-mainlobe interference suppression under uncorrelated and coherent conditions 被引量:1
20
作者 CAI Miaohong CHENG Qiang +1 位作者 MENG Jinli ZHAO Dehua 《Journal of Southeast University(English Edition)》 2025年第1期84-90,共7页
A new method based on the iterative adaptive algorithm(IAA)and blocking matrix preprocessing(BMP)is proposed to study the suppression of multi-mainlobe interference.The algorithm is applied to precisely estimate the s... A new method based on the iterative adaptive algorithm(IAA)and blocking matrix preprocessing(BMP)is proposed to study the suppression of multi-mainlobe interference.The algorithm is applied to precisely estimate the spatial spectrum and the directions of arrival(DOA)of interferences to overcome the drawbacks associated with conventional adaptive beamforming(ABF)methods.The mainlobe interferences are identified by calculating the correlation coefficients between direction steering vectors(SVs)and rejected by the BMP pretreatment.Then,IAA is subsequently employed to reconstruct a sidelobe interference-plus-noise covariance matrix for the preferable ABF and residual interference suppression.Simulation results demonstrate the excellence of the proposed method over normal methods based on BMP and eigen-projection matrix perprocessing(EMP)under both uncorrelated and coherent circumstances. 展开更多
关键词 mainlobe interference suppression adaptive beamforming spatial spectral estimation iterative adaptive algorithm blocking matrix preprocessing
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部