首页 > 最新文献

Expert Systems with Applications最新文献

英文 中文
D2A2: Enhancing LLM knowledge distillation efficiency and performance with difficulty-aware and adaptive distillation framework D2A2:利用困难感知和自适应蒸馏框架提高法学硕士知识蒸馏的效率和性能
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-02 DOI: 10.1016/j.eswa.2026.131393
Bolei He , Xinran He , Yikun Wang , Zhenhua Ling
With the proliferation of large language models (LLMs), knowledge distillation (KD) has emerged as a promising methodology to address the challenges of large model sizes and high computational costs in real-world applications. However, existing KD methods often ignore the difficulty variations within the datasets used for distillation, leading to inefficient resource allocation and suboptimal training outcomes. In this paper, we propose Difficulty-Aware and Adaptive Distillation (D2A2), an efficient and performance-enhancing distillation framework. The key idea is to incorporate the inherent difficulty of problems, as indicated by the uncertainty of LLMs shown when making decisions about the ultimate predictions, into the distillation process. Specifically, we integrate this into data filtering and model training phases to enhance the effectiveness of distillation. In difficulty-aware data filtering phase, we prioritize difficult samples for further distillation based on their semantic uncertainty. In difficulty-adaptive training phase, we dynamically adjust the focus on challenging samples by updating the distillation loss based on the student model’s performance. Comprehensive experiments demonstrate our framework outperforms existing methods with fewer data and exhibits versatile performance across various models and datasets.
随着大型语言模型(llm)的激增,知识蒸馏(KD)已经成为一种有前途的方法,可以解决现实应用中大型模型大小和高计算成本的挑战。然而,现有的KD方法往往忽略了用于蒸馏的数据集中的难度变化,导致资源分配效率低下和训练结果不理想。在本文中,我们提出了困难感知和自适应蒸馏(D2A2),这是一种高效的、提高性能的蒸馏框架。关键思想是将问题的固有困难,如llm在做出最终预测决策时所显示的不确定性所表明的那样,纳入蒸馏过程。具体而言,我们将其集成到数据过滤和模型训练阶段,以提高蒸馏的有效性。在困难感知数据过滤阶段,我们根据困难样本的语义不确定性对其进行优先级排序。在难度自适应训练阶段,我们根据学生模型的表现,通过更新蒸馏损失来动态调整对挑战样本的关注。综合实验表明,我们的框架在数据较少的情况下优于现有的方法,并在各种模型和数据集上表现出通用的性能。
{"title":"D2A2: Enhancing LLM knowledge distillation efficiency and performance with difficulty-aware and adaptive distillation framework","authors":"Bolei He ,&nbsp;Xinran He ,&nbsp;Yikun Wang ,&nbsp;Zhenhua Ling","doi":"10.1016/j.eswa.2026.131393","DOIUrl":"10.1016/j.eswa.2026.131393","url":null,"abstract":"<div><div>With the proliferation of large language models (LLMs), knowledge distillation (KD) has emerged as a promising methodology to address the challenges of large model sizes and high computational costs in real-world applications. However, existing KD methods often ignore the difficulty variations within the datasets used for distillation, leading to inefficient resource allocation and suboptimal training outcomes. In this paper, we propose <strong><u>D</u>ifficulty-<u>A</u>ware and <u>A</u>daptive <u>D</u>istillation</strong> (D2A2), an efficient and performance-enhancing distillation framework. The key idea is to incorporate the inherent difficulty of problems, as indicated by the uncertainty of LLMs shown when making decisions about the ultimate predictions, into the distillation process. Specifically, we integrate this into data filtering and model training phases to enhance the effectiveness of distillation. In difficulty-aware data filtering phase, we prioritize difficult samples for further distillation based on their semantic uncertainty. In difficulty-adaptive training phase, we dynamically adjust the focus on challenging samples by updating the distillation loss based on the student model’s performance. Comprehensive experiments demonstrate our framework outperforms existing methods with fewer data and exhibits versatile performance across various models and datasets.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"311 ","pages":"Article 131393"},"PeriodicalIF":7.5,"publicationDate":"2026-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190266","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Explicitly learning semantic relevance for salient object detection in remote sensing images 明确学习遥感图像中显著目标检测的语义相关性
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-02 DOI: 10.1016/j.eswa.2026.131387
Tao Gao , Weiguang Zhao , Mengkun Liu , Ting Chen , Ziqi Li
Salient object detection in remote sensing images (RSI-SOD) is crucial for computer vision in both high-altitude and low-altitude scenarios. Most existing methods primarily focus on multiscale feature integration, yet they encounter difficulties in achieving precise segmentation, particularly when confronted with complex object topologies and cluttered backgrounds. To address this, we propose a novel framework, ELSRNet, tailored to capturing the intrinsic semantic differences among features with diverse attributes, thereby facilitating pixel-wise separation of salient regions. This approach incorporates the deployment of a Foreground-Background Semantic Perception module (FBSP), which explicitly scrutinizes the semantic interactions through a more comprehensive Attention Guided Loss, ultimately strengthening the capacity to learn objects with complex structural characteristics. Going further, considering that the coupling between noise norms and convolutional kernels in cluttered backgrounds may amplify irrelevant responses and lead to false saliency predictions, the Non-Matching Feature Enhancement block (NMFE) is introduced to suppress such interference based on matching scores, and further refine the features through a gating mechanism. Concluding the process, the Global Perceptual Feature Aggregation module (GPFA) is designed to decouple features into semantic and structural information. It achieves saliency region localization while preserving fine-grained boundaries, producing high-quality saliency detection results. Experimental results and theoretical analysis reveal that the proposed network outperforms existing methods in enhancing detection capabilities across three benchmark datasets.
遥感图像中的显著目标检测(rssi - sod)对于高、低空场景下的计算机视觉都至关重要。大多数现有的方法主要集中在多尺度特征集成上,但它们在实现精确分割方面存在困难,特别是在面对复杂的目标拓扑和杂乱的背景时。为了解决这个问题,我们提出了一个新的框架,ELSRNet,专门用于捕获具有不同属性的特征之间的内在语义差异,从而促进显着区域的逐像素分离。该方法结合了前景-背景语义感知模块(FBSP)的部署,该模块通过更全面的注意力引导损失来明确审查语义交互,最终增强了学习具有复杂结构特征的物体的能力。进一步,考虑到噪声规范与卷积核之间的耦合可能会放大不相关的响应并导致错误的显著性预测,引入非匹配特征增强块(NMFE)来基于匹配分数抑制这种干扰,并通过门控机制进一步细化特征。最后,设计了全局感知特征聚合模块(GPFA),将特征解耦为语义信息和结构信息。在保持细粒度边界的同时,实现了显著性区域定位,产生了高质量的显著性检测结果。实验结果和理论分析表明,该网络在提高三个基准数据集的检测能力方面优于现有方法。
{"title":"Explicitly learning semantic relevance for salient object detection in remote sensing images","authors":"Tao Gao ,&nbsp;Weiguang Zhao ,&nbsp;Mengkun Liu ,&nbsp;Ting Chen ,&nbsp;Ziqi Li","doi":"10.1016/j.eswa.2026.131387","DOIUrl":"10.1016/j.eswa.2026.131387","url":null,"abstract":"<div><div>Salient object detection in remote sensing images (RSI-SOD) is crucial for computer vision in both high-altitude and low-altitude scenarios. Most existing methods primarily focus on multiscale feature integration, yet they encounter difficulties in achieving precise segmentation, particularly when confronted with complex object topologies and cluttered backgrounds. To address this, we propose a novel framework, ELSRNet, tailored to capturing the intrinsic semantic differences among features with diverse attributes, thereby facilitating pixel-wise separation of salient regions. This approach incorporates the deployment of a Foreground-Background Semantic Perception module (FBSP), which explicitly scrutinizes the semantic interactions through a more comprehensive Attention Guided Loss, ultimately strengthening the capacity to learn objects with complex structural characteristics. Going further, considering that the coupling between noise norms and convolutional kernels in cluttered backgrounds may amplify irrelevant responses and lead to false saliency predictions, the Non-Matching Feature Enhancement block (NMFE) is introduced to suppress such interference based on matching scores, and further refine the features through a gating mechanism. Concluding the process, the Global Perceptual Feature Aggregation module (GPFA) is designed to decouple features into semantic and structural information. It achieves saliency region localization while preserving fine-grained boundaries, producing high-quality saliency detection results. Experimental results and theoretical analysis reveal that the proposed network outperforms existing methods in enhancing detection capabilities across three benchmark datasets.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"312 ","pages":"Article 131387"},"PeriodicalIF":7.5,"publicationDate":"2026-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146192710","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Prediction of mechanical properties and inner-outer loop control strategy for galvannealed steel strips 镀锌钢带力学性能预测及内外环控制策略
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-01 DOI: 10.1016/j.eswa.2026.131453
Ji Zhang , Zhixuan Wang , Zhuo Wang , Haibo Yuan , Liansheng Cheng , Zhenhua Bai
The accurate prediction and effective control of mechanical properties are crucial for galvannealed steel strips, a cornerstone material in the automotive, home appliance, and construction industries. This study addresses the inherent complexities of its multi-process production, including continuous annealing, galvannealing, and temper rolling, where non-linear interactions significantly influence the final mechanical properties. This study propose a novel intelligent prediction and control system that integrates a Bayesian Neural Network (BNN) with a Multi-Head Attention mechanism for precise mechanical property prediction, alongside an innovative inner and outer loop control strategy. The BNN quantifies prediction uncertainty and provides confidence intervals, enhancing decision-making reliability. The Multi-Head Attention mechanism effectively captures complex non-linear relationships among diverse process parameters. Furthermore, the hierarchical inner and outer loop control strategy, based on Non-dominated Sorting Genetic Algorithm III (NSGA-III), enables rapid, localized adjustments during temper rolling (inner loop) and comprehensive global optimization across continuous annealing and temper rolling (outer loop) when larger deviations occur. This approach significantly improves control timeliness and efficiency, achieving superior multi-objective trade-offs. Experimental results demonstrate the system’s high accuracy, robustness, and ability to ensure mechanical properties consistently meet stringent target ranges, even under uncertainty.
作为汽车、家电和建筑行业的基础材料,准确预测和有效控制镀锌钢带的机械性能至关重要。本研究解决了其多工艺生产的固有复杂性,包括连续退火,镀锌和回火轧制,其中非线性相互作用显着影响最终的机械性能。本研究提出了一种新颖的智能预测和控制系统,该系统将贝叶斯神经网络(BNN)与多头注意机制相结合,用于精确的机械性能预测,以及创新的内环和外环控制策略。BNN量化了预测的不确定性并提供了置信区间,提高了决策的可靠性。多头注意机制有效地捕捉了不同工艺参数之间复杂的非线性关系。此外,基于非支配排序遗传算法III (NSGA-III)的分层内外环控制策略能够在回火轧制(内环)期间进行快速、局部调整,并在发生较大偏差时实现跨连续退火和回火轧制(外环)的全面全局优化。该方法显著提高了控制及时性和效率,实现了优越的多目标权衡。实验结果表明,即使在不确定的情况下,该系统也具有高精度、鲁棒性和确保机械性能始终满足严格目标范围的能力。
{"title":"Prediction of mechanical properties and inner-outer loop control strategy for galvannealed steel strips","authors":"Ji Zhang ,&nbsp;Zhixuan Wang ,&nbsp;Zhuo Wang ,&nbsp;Haibo Yuan ,&nbsp;Liansheng Cheng ,&nbsp;Zhenhua Bai","doi":"10.1016/j.eswa.2026.131453","DOIUrl":"10.1016/j.eswa.2026.131453","url":null,"abstract":"<div><div>The accurate prediction and effective control of mechanical properties are crucial for galvannealed steel strips, a cornerstone material in the automotive, home appliance, and construction industries. This study addresses the inherent complexities of its multi-process production, including continuous annealing, galvannealing, and temper rolling, where non-linear interactions significantly influence the final mechanical properties. This study propose a novel intelligent prediction and control system that integrates a Bayesian Neural Network (BNN) with a Multi-Head Attention mechanism for precise mechanical property prediction, alongside an innovative inner and outer loop control strategy. The BNN quantifies prediction uncertainty and provides confidence intervals, enhancing decision-making reliability. The Multi-Head Attention mechanism effectively captures complex non-linear relationships among diverse process parameters. Furthermore, the hierarchical inner and outer loop control strategy, based on Non-dominated Sorting Genetic Algorithm III (NSGA-III), enables rapid, localized adjustments during temper rolling (inner loop) and comprehensive global optimization across continuous annealing and temper rolling (outer loop) when larger deviations occur. This approach significantly improves control timeliness and efficiency, achieving superior multi-objective trade-offs. Experimental results demonstrate the system’s high accuracy, robustness, and ability to ensure mechanical properties consistently meet stringent target ranges, even under uncertainty.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"311 ","pages":"Article 131453"},"PeriodicalIF":7.5,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A heterogeneous Hopfield neural network with discrete memristor: modeling, dynamics, and application in medical image encryption 具有离散忆阻器的异构Hopfield神经网络:建模、动态和在医学图像加密中的应用
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-01 DOI: 10.1016/j.eswa.2026.131457
Huiqun Zou , Yang Lu , Wenjiao Li , Wenhui Li , Xiuli Chai
Memristors and activation functions critically shape the nonlinear dynamics of Hopfield neural networks. While previous studies explored memristor modeling and heterogeneous activation separately, their combination to form heterogeneous memristive networks remains insufficiently explored. This paper bridges this gap by proposing a novel Heterogeneous Hopfield Neural Network with Discrete Memristor (HHNN-DM), coupling a discrete memristor with heterogeneous activations to mimic neural diversity. By analyzing dissipation, equilibrium stability, bifurcation diagrams, and Lyapunov exponents, we demonstrate that heterogeneous activation mechanisms significantly enhance network complexity and unpredictability under memristive interactions. This synergy gives rise to rich chaotic behaviors, such as periodic orbits, bifurcations, transient chaos, and chaotic bursting. As these biologically inspired chaotic dynamics, the resulting high-quality chaotic sequences are well suited for cryptographic applications. Furthermore, a Heterogeneous Hopfield Neural Network–based Medical Image Encryption Algorithm (HHNN-MIEA) is developed to enhance security in remote medical image transmission, integrating an X-fractal curve sorting matrix for permutation with multi-logical diffusion driven by chaotic sequences. Experimental results verify that the HHNN-MIEA achieves high security in aspects such as key sensitivity, information entropy without compromising efficiency, highlighting its effectiveness, robustness and reliable solution for secure medical image transmission.
记忆电阻器和激活函数是Hopfield神经网络非线性动力学的关键。虽然以前的研究分别探讨了忆阻器建模和异质激活,但它们的组合形成异质忆阻网络的探索仍然不够充分。本文通过提出一种具有离散忆阻器的新型异质Hopfield神经网络(HHNN-DM)来弥补这一差距,将离散忆阻器与异质激活耦合起来以模拟神经多样性。通过对耗散、平衡稳定性、分岔图和Lyapunov指数的分析,我们证明了在记忆相互作用下,异质激活机制显著提高了网络的复杂性和不可预测性。这种协同作用产生了丰富的混沌行为,如周期轨道、分岔、瞬态混沌和混沌爆发。由于这些受生物学启发的混沌动力学,由此产生的高质量混沌序列非常适合密码学应用。在此基础上,提出了一种基于异构Hopfield神经网络的医学图像加密算法(HHNN-MIEA),将x分形曲线排序矩阵与混沌序列驱动的多逻辑扩散相结合,提高了医学图像远程传输的安全性。实验结果表明,在不影响效率的前提下,HHNN-MIEA在密钥灵敏度、信息熵等方面实现了较高的安全性,突出了其有效性、鲁棒性和可靠的医学图像安全传输解决方案。
{"title":"A heterogeneous Hopfield neural network with discrete memristor: modeling, dynamics, and application in medical image encryption","authors":"Huiqun Zou ,&nbsp;Yang Lu ,&nbsp;Wenjiao Li ,&nbsp;Wenhui Li ,&nbsp;Xiuli Chai","doi":"10.1016/j.eswa.2026.131457","DOIUrl":"10.1016/j.eswa.2026.131457","url":null,"abstract":"<div><div>Memristors and activation functions critically shape the nonlinear dynamics of Hopfield neural networks. While previous studies explored memristor modeling and heterogeneous activation separately, their combination to form heterogeneous memristive networks remains insufficiently explored. This paper bridges this gap by proposing a novel Heterogeneous Hopfield Neural Network with Discrete Memristor (HHNN-DM), coupling a discrete memristor with heterogeneous activations to mimic neural diversity. By analyzing dissipation, equilibrium stability, bifurcation diagrams, and Lyapunov exponents, we demonstrate that heterogeneous activation mechanisms significantly enhance network complexity and unpredictability under memristive interactions. This synergy gives rise to rich chaotic behaviors, such as periodic orbits, bifurcations, transient chaos, and chaotic bursting. As these biologically inspired chaotic dynamics, the resulting high-quality chaotic sequences are well suited for cryptographic applications. Furthermore, a Heterogeneous Hopfield Neural Network–based Medical Image Encryption Algorithm (HHNN-MIEA) is developed to enhance security in remote medical image transmission, integrating an X-fractal curve sorting matrix for permutation with multi-logical diffusion driven by chaotic sequences. Experimental results verify that the HHNN-MIEA achieves high security in aspects such as key sensitivity, information entropy without compromising efficiency, highlighting its effectiveness, robustness and reliable solution for secure medical image transmission.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"312 ","pages":"Article 131457"},"PeriodicalIF":7.5,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146122715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Budget-constrained workflow scheduling using task prediction in hybrid environments 混合环境下使用任务预测的预算约束工作流调度
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-31 DOI: 10.1016/j.eswa.2026.131436
Changhong Tai , Huiying Jin , Qi Wang , Hai Dong , Pengcheng Zhang
This paper addresses the challenges of workflow scheduling in hybrid cloud environments, where unknown task execution times and resource demand deviations often lead to prolonged makespan and scheduling failures. We propose FBiLSTM-DPBWS, a novel budget-constrained workflow scheduling algorithm. The core contributions of this algorithm are reflected at two levels: Firstly, a novel FBiLSTM regression prediction model is proposed. By integrating the Flash Attention mechanism with bidirectional long short-term memory networks, it can accurately and synchronously predict the instruction counts of all subtasks based solely on the directed acyclic graph structure and prior information about the workflow before task execution, thereby estimating their execution times on heterogeneous resources. This fundamentally addresses the challenge of unknown execution times. Secondly, a dynamic critical-path-priority-based budget-constrained workflow scheduling algorithm, DPBWS, is designed. Instead of simply combining virtual machine and serverless function resources, this algorithm dynamically adjusts the priority of critical-path tasks. It adaptively selects the optimal resource type based on predicted instruction counts, real-time budget consumption, and the task’s compute or data-intensive characteristics. The algorithm explicitly accounts for the fundamental billing differences between these resource types (whole-unit rental per billing period vs. fine-grained billing based on actual execution time), thereby minimizing makespan and maximizing scheduling success rates under limited budgets. Experiments conducted on six real-world and five large-scale synthetic datasets demonstrate that the FBiLSTM model achieves prediction accuracies ranging from 97.80% to 99.62%. Under the same budget, DPBWS significantly reduces makespan compared to the best-performing baseline and achieves scheduling success rates from 98.62% to 100% across all datasets. These results confirm the superiority, robustness, and practical applicability of the proposed method in hybrid cloud environments.
本文讨论了混合云环境中工作流调度的挑战,在混合云环境中,未知的任务执行时间和资源需求偏差通常会导致长时间的完工时间和调度失败。提出了一种新的预算约束工作流调度算法FBiLSTM-DPBWS。该算法的核心贡献体现在两个层面:首先,提出了一种新的FBiLSTM回归预测模型;该算法将Flash注意机制与双向长短期记忆网络相结合,仅根据任务执行前的有向无环图结构和工作流程的先验信息,就能准确、同步地预测子任务的指令数,从而估计子任务在异构资源上的执行时间。这从根本上解决了未知执行时间的挑战。其次,设计了基于动态关键路径优先级的预算约束工作流调度算法DPBWS。该算法不是简单地结合虚拟机和无服务器功能资源,而是动态调整关键路径任务的优先级。它根据预测的指令计数、实时预算消耗以及任务的计算或数据密集型特征,自适应地选择最优资源类型。该算法显式地考虑了这些资源类型之间的基本计费差异(每个计费周期的全单元租金与基于实际执行时间的细粒度计费),从而在有限的预算下最小化完工时间并最大化调度成功率。在6个真实数据集和5个大规模合成数据集上进行的实验表明,FBiLSTM模型的预测准确率在97.80% ~ 99.62%之间。在相同的预算下,与性能最好的基线相比,DPBWS显著减少了完工时间,并在所有数据集上实现了从98.62%到100%的调度成功率。这些结果证实了该方法在混合云环境下的优越性、鲁棒性和实用性。
{"title":"Budget-constrained workflow scheduling using task prediction in hybrid environments","authors":"Changhong Tai ,&nbsp;Huiying Jin ,&nbsp;Qi Wang ,&nbsp;Hai Dong ,&nbsp;Pengcheng Zhang","doi":"10.1016/j.eswa.2026.131436","DOIUrl":"10.1016/j.eswa.2026.131436","url":null,"abstract":"<div><div>This paper addresses the challenges of workflow scheduling in hybrid cloud environments, where unknown task execution times and resource demand deviations often lead to prolonged makespan and scheduling failures. We propose FBiLSTM-DPBWS, a novel budget-constrained workflow scheduling algorithm. The core contributions of this algorithm are reflected at two levels: Firstly, a novel FBiLSTM regression prediction model is proposed. By integrating the Flash Attention mechanism with bidirectional long short-term memory networks, it can accurately and synchronously predict the instruction counts of all subtasks based solely on the directed acyclic graph structure and prior information about the workflow before task execution, thereby estimating their execution times on heterogeneous resources. This fundamentally addresses the challenge of unknown execution times. Secondly, a dynamic critical-path-priority-based budget-constrained workflow scheduling algorithm, DPBWS, is designed. Instead of simply combining virtual machine and serverless function resources, this algorithm dynamically adjusts the priority of critical-path tasks. It adaptively selects the optimal resource type based on predicted instruction counts, real-time budget consumption, and the task’s compute or data-intensive characteristics. The algorithm explicitly accounts for the fundamental billing differences between these resource types (whole-unit rental per billing period vs. fine-grained billing based on actual execution time), thereby minimizing makespan and maximizing scheduling success rates under limited budgets. Experiments conducted on six real-world and five large-scale synthetic datasets demonstrate that the FBiLSTM model achieves prediction accuracies ranging from 97.80% to 99.62%. Under the same budget, DPBWS significantly reduces makespan compared to the best-performing baseline and achieves scheduling success rates from 98.62% to 100% across all datasets. These results confirm the superiority, robustness, and practical applicability of the proposed method in hybrid cloud environments.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"312 ","pages":"Article 131436"},"PeriodicalIF":7.5,"publicationDate":"2026-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146192852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Real-time prediction of fire propagation in tunnels with discontinuous combustible materials based on bidirectional long short-term memory networks 基于双向长短期记忆网络的不连续可燃材料隧道火灾传播实时预测
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-31 DOI: 10.1016/j.eswa.2026.131435
Jianhua Chen , Qiuju Ma , Zhennan Chen , Yubo Sun , Nan Chen , Yiyan Zhang
Fires involving discontinuous combustible materials in tunnels develop rapidly and unpredictably, posing serious risks to evacuation and firefighting operations. Conventional prediction approaches based on empirical correlations or numerical simulations are limited in responsiveness and cannot meet the demands of real-time intelligent fire management. This study presents a bidirectional long short-term memory (BiLSTM) deep learning framework for real-time prediction of tunnel fire evolution. A transient fire database was established from a series of scaled tunnel experiments under varying fire intensities and source spacings. Using real-time temperature data collected from 26 ceiling thermocouples, the model concurrently predicts the longitudinal temperature distribution, mass loss rate, and fire spread probability with a 30-s forecasting horizon. The results demonstrate that coupling BiLSTM with Internet of Things (IoT) sensor data achieves accurate and robust spatiotemporal prediction of dynamic fire behavior. The proposed framework provides a practical foundation for intelligent tunnel monitoring, early-warning systems, and data-driven decision support in emergency response.
隧道中不连续可燃物引发的火灾发展迅速,难以预测,给疏散和消防作业带来严重风险。传统的基于经验关联或数值模拟的预测方法响应能力有限,不能满足实时智能火灾管理的要求。提出了一种双向长短期记忆(BiLSTM)深度学习框架,用于隧道火灾演变的实时预测。通过一系列不同火灾强度和火源间距的隧道试验,建立了瞬态火灾数据库。该模型利用从26个天花板热电偶收集的实时温度数据,在30秒的预测范围内同时预测纵向温度分布、质量损失率和火势蔓延概率。结果表明,BiLSTM与物联网(IoT)传感器数据的耦合可以实现对动态火灾行为的准确、鲁棒的时空预测。提出的框架为智能隧道监测、预警系统和数据驱动的应急决策支持提供了实用基础。
{"title":"Real-time prediction of fire propagation in tunnels with discontinuous combustible materials based on bidirectional long short-term memory networks","authors":"Jianhua Chen ,&nbsp;Qiuju Ma ,&nbsp;Zhennan Chen ,&nbsp;Yubo Sun ,&nbsp;Nan Chen ,&nbsp;Yiyan Zhang","doi":"10.1016/j.eswa.2026.131435","DOIUrl":"10.1016/j.eswa.2026.131435","url":null,"abstract":"<div><div>Fires involving discontinuous combustible materials in tunnels develop rapidly and unpredictably, posing serious risks to evacuation and firefighting operations. Conventional prediction approaches based on empirical correlations or numerical simulations are limited in responsiveness and cannot meet the demands of real-time intelligent fire management. This study presents a bidirectional long short-term memory (BiLSTM) deep learning framework for real-time prediction of tunnel fire evolution. A transient fire database was established from a series of scaled tunnel experiments under varying fire intensities and source spacings. Using real-time temperature data collected from 26 ceiling thermocouples, the model concurrently predicts the longitudinal temperature distribution, mass loss rate, and fire spread probability with a 30-s forecasting horizon. The results demonstrate that coupling BiLSTM with Internet of Things (IoT) sensor data achieves accurate and robust spatiotemporal prediction of dynamic fire behavior. The proposed framework provides a practical foundation for intelligent tunnel monitoring, early-warning systems, and data-driven decision support in emergency response.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"311 ","pages":"Article 131435"},"PeriodicalIF":7.5,"publicationDate":"2026-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient workflow offloading in private clouds using serverless computing 使用无服务器计算在私有云中高效地卸载工作流
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-31 DOI: 10.1016/j.eswa.2026.131460
Shukun Yu , Quanwang Wu , Kun Cai , Taolin Guo , Zhuo Jiang , Tianhao Sun
Although private clouds provide workflow execution environments with enhanced data security, greater administrative control, and predictable resource provisioning, they often suffer from limited elasticity and struggle to adapt to dynamic and bursty workload patterns. Serverless computing, characterized by elastic scaling, pay-per-use pricing model, and event-driven execution, presents a promising paradigm to address these limitations. Hence, this paper explores integrating private clouds with serverless computing to enable efficient workflow offloading. A systematic workflow offloading framework is established for minimizing monetary costs under workflow deadlines. A Deadline-Aware Task Offloading (DATO) heuristic algorithm is proposed, which strategically offloads workflow tasks between serverless platforms and private cloud resources. It employs latest-start-time prioritization to sort tasks from different workflows, and dynamically determines optimal offloading decisions by balancing task characteristics, resource availability, and cost considerations. Evaluation experiments have been carried out with realistic workflows and platform settings. The results demonstrate the excellent performance of DATO in reducing costs under deadline constraints compared with traditional approaches.
尽管私有云为工作流执行环境提供了增强的数据安全性、更好的管理控制和可预测的资源供应,但它们的弹性往往有限,难以适应动态和突发的工作负载模式。无服务器计算的特点是弹性伸缩、按使用付费的定价模型和事件驱动的执行,为解决这些限制提供了一个很有前途的范例。因此,本文探讨了将私有云与无服务器计算集成在一起,以实现高效的工作流卸载。建立了一个系统的工作流卸载框架,以最大限度地减少工作流截止日期下的货币成本。提出了一种基于截止日期感知的任务卸载(DATO)启发式算法,在无服务器平台和私有云资源之间策略性地进行工作流任务的卸载。它采用最新开始时间优先级来对来自不同工作流的任务进行排序,并通过平衡任务特征、资源可用性和成本考虑来动态确定最佳卸载决策。在实际工作流程和平台设置下进行了评估实验。结果表明,与传统方法相比,DATO在期限约束下降低成本方面具有优异的性能。
{"title":"Efficient workflow offloading in private clouds using serverless computing","authors":"Shukun Yu ,&nbsp;Quanwang Wu ,&nbsp;Kun Cai ,&nbsp;Taolin Guo ,&nbsp;Zhuo Jiang ,&nbsp;Tianhao Sun","doi":"10.1016/j.eswa.2026.131460","DOIUrl":"10.1016/j.eswa.2026.131460","url":null,"abstract":"<div><div>Although private clouds provide workflow execution environments with enhanced data security, greater administrative control, and predictable resource provisioning, they often suffer from limited elasticity and struggle to adapt to dynamic and bursty workload patterns. Serverless computing, characterized by elastic scaling, pay-per-use pricing model, and event-driven execution, presents a promising paradigm to address these limitations. Hence, this paper explores integrating private clouds with serverless computing to enable efficient workflow offloading. A systematic workflow offloading framework is established for minimizing monetary costs under workflow deadlines. A Deadline-Aware Task Offloading (DATO) heuristic algorithm is proposed, which strategically offloads workflow tasks between serverless platforms and private cloud resources. It employs latest-start-time prioritization to sort tasks from different workflows, and dynamically determines optimal offloading decisions by balancing task characteristics, resource availability, and cost considerations. Evaluation experiments have been carried out with realistic workflows and platform settings. The results demonstrate the excellent performance of DATO in reducing costs under deadline constraints compared with traditional approaches.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"312 ","pages":"Article 131460"},"PeriodicalIF":7.5,"publicationDate":"2026-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146122665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An efficient big data framework for validating the random walk hypothesis in high-frequency markets via neural networks and large language models 通过神经网络和大型语言模型验证高频市场随机游走假设的有效大数据框架
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-31 DOI: 10.1016/j.eswa.2026.131358
Yueyue Sun , Chi Chiu So , Su Tan , Siu Pang Yung , Junmin Wang
Financial market efficiency, commonly formalized through the Random Walk Hypothesis, remains a central issue in quantitative finance. Conventional statistical tests, while rigorous, often provide limited insight into the practical predictability of market prices. To complement these tests, we propose Machine Learning Market Randomness Testing (MART), an efficient prediction-based framework that evaluates market efficiency through the directional forecasting performance of machine learning models. Within this framework, simple neural networks (NNs) and large language models (LLMs) serve as predictive agents for validating the effectiveness of the proposed approach. The LLM module further employs compact batching and iterative summarization to efficiently process large-scale high-frequency datasets while reducing computational cost and preventing information leakage. Empirical results from the MART framework, applied to high-frequency data at tick, 1-min, 5-min, and 15-min intervals across ten major global stock indices, reveal frequency-dependent deviations from market efficiency. At finer temporal resolutions—particularly at tick, 1-min, and 5-min levels—MART identifies statistically significant predictability consistent with classical statistical tests and translates it into economically meaningful cumulative returns through NN-based predictions, whereas LLM-based implementations fail to demonstrate comparable forecasting performance under few-shot conditions. Overall, MART establishes a generalizable and statistically grounded approach for testing market efficiency, bridging predictive modeling with formal inference, and providing new empirical evidence on frequency-dependent deviations from the Random Walk Hypothesis.
金融市场效率,通常通过随机漫步假设形式化,仍然是定量金融的核心问题。传统的统计测试虽然严格,但往往对市场价格的实际可预测性提供有限的见解。为了补充这些测试,我们提出了机器学习市场随机性测试(MART),这是一个有效的基于预测的框架,通过机器学习模型的定向预测性能来评估市场效率。在这个框架内,简单的神经网络(nn)和大型语言模型(llm)作为预测代理来验证所提出方法的有效性。LLM模块进一步采用紧凑的批处理和迭代总结,高效处理大规模高频数据集,同时降低计算成本,防止信息泄露。来自MART框架的实证结果,应用于10个主要全球股票指数中间隔1分钟、1分钟、5分钟和15分钟的高频数据,揭示了与市场效率相关的频率依赖偏差。在更精细的时间分辨率下,特别是在1分钟、1分钟和5分钟的水平上,mart识别出与经典统计测试一致的统计上显著的可预测性,并通过基于神经网络的预测将其转化为经济上有意义的累积回报,而基于llm的实现无法在少量条件下展示可比的预测性能。总体而言,MART建立了一种可推广的、基于统计的方法来测试市场效率,将预测建模与正式推理联系起来,并为随机漫步假设的频率相关偏差提供了新的经验证据。
{"title":"An efficient big data framework for validating the random walk hypothesis in high-frequency markets via neural networks and large language models","authors":"Yueyue Sun ,&nbsp;Chi Chiu So ,&nbsp;Su Tan ,&nbsp;Siu Pang Yung ,&nbsp;Junmin Wang","doi":"10.1016/j.eswa.2026.131358","DOIUrl":"10.1016/j.eswa.2026.131358","url":null,"abstract":"<div><div>Financial market efficiency, commonly formalized through the Random Walk Hypothesis, remains a central issue in quantitative finance. Conventional statistical tests, while rigorous, often provide limited insight into the practical predictability of market prices. To complement these tests, we propose <u>M</u>achine Learning M<u>a</u>rket <u>R</u>andomness <u>T</u>esting (MART), an efficient prediction-based framework that evaluates market efficiency through the directional forecasting performance of machine learning models. Within this framework, simple neural networks (NNs) and large language models (LLMs) serve as predictive agents for validating the effectiveness of the proposed approach. The LLM module further employs compact batching and iterative summarization to efficiently process large-scale high-frequency datasets while reducing computational cost and preventing information leakage. Empirical results from the MART framework, applied to high-frequency data at tick, 1-min, 5-min, and 15-min intervals across ten major global stock indices, reveal frequency-dependent deviations from market efficiency. At finer temporal resolutions—particularly at tick, 1-min, and 5-min levels—MART identifies statistically significant predictability consistent with classical statistical tests and translates it into economically meaningful cumulative returns through NN-based predictions, whereas LLM-based implementations fail to demonstrate comparable forecasting performance under few-shot conditions. Overall, MART establishes a generalizable and statistically grounded approach for testing market efficiency, bridging predictive modeling with formal inference, and providing new empirical evidence on frequency-dependent deviations from the Random Walk Hypothesis.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"311 ","pages":"Article 131358"},"PeriodicalIF":7.5,"publicationDate":"2026-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
When coordinated response meets complexity in catastrophes: Unlocking cross-sectoral emergency resource sharing 当协调响应应对灾难的复杂性:开启跨部门应急资源共享
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-31 DOI: 10.1016/j.eswa.2026.131459
Yue Feng , Yingyi Zhang , Ming Cong , Lili Rong
Catastrophic events trigger surging and uneven demands across emergency subjects, necessitating cross-sectoral resource sharing to reconcile imbalances between demand and available resources. However, actionable insights on how to implement such sharing effectively remain scarce. This study innovatively presents a scenario-adaptive “tasks-subjects-resources” sharing framework and formulate a scenario-tailored multi-objective optimization model that jointly minimizes resource shortage cost and coordination cost while improving task-execution efficiency. To solve the model efficiently, a flow-constrained NSGA-II (FC-NSGA-II) algorithm is designed, incorporating structural characteristics of resource sharing. Comparative experiments show that FC-NSGA-II consistently outperforms SPEA2 and MOPSO in terms of hypervolume (HV) and inverted generational distance (IGD), with statistical significance confirmed by Friedman and Nemenyi tests. The scenario-driven Chebyshev decision protocol (SCDP) is further proposed that identifies context-appropriate sharing strategies to support actionable decisions. Moreover, quantifying trade-offs across multiple sharing levers in major epidemic and earthquake cases reveals consistent threshold and diminishing-return effects, whereby performance improves markedly under moderate sharing but yields only limited marginal gains as sharing expands further. Specifically, most efficiency gains and shortage reductions are achieved when local resource retention exceeds approximately 30%. Expanding share-eligible resource types or participating subjects beyond about 80% yields limited additional benefits while coordination costs continue to rise. Likewise, full demand fulfillment is not necessary, as a coverage level near 70% captures most benefits with manageable coordination cost. Our study advances cross-sectoral resource coordination, paving the way for more resilient and intelligent response system to time-critical catastrophes.
灾难性事件引发紧急事项之间的需求激增和不平衡,因此需要跨部门资源共享,以调和需求与可用资源之间的不平衡。然而,关于如何有效实施这种共享的可行见解仍然很少。本研究创新性地提出了一个场景自适应的“任务-主体-资源”共享框架,构建了一个场景化的多目标优化模型,在提高任务执行效率的同时,共同实现了资源短缺成本和协调成本的最小化。为了高效求解该模型,设计了一种流约束NSGA-II (FC-NSGA-II)算法,结合资源共享的结构特点。对比实验表明,FC-NSGA-II在hypervolume (HV)和倒代距离(IGD)方面始终优于SPEA2和MOPSO, Friedman和Nemenyi检验证实了这一差异具有统计学意义。进一步提出了场景驱动的Chebyshev决策协议(SCDP),该协议确定了适合上下文的共享策略,以支持可操作的决策。此外,在重大流行病和地震情况下,对多个共享杠杆之间的权衡进行量化,发现了一致的阈值效应和收益递减效应,即在适度共享的情况下,绩效显著改善,但随着共享的进一步扩大,仅产生有限的边际收益。具体来说,当本地资源保留率超过约30%时,大多数效率提高和短缺减少就能实现。在协调成本持续上升的情况下,将合股资源类型或参与主体扩大至约80%以上的额外收益有限。同样,完全的需求实现也不是必要的,因为接近70%的覆盖水平可以获得大部分的好处,并且具有可管理的协调成本。我们的研究促进了跨部门的资源协调,为建立更有弹性和更智能的响应系统来应对时间紧迫的灾难铺平了道路。
{"title":"When coordinated response meets complexity in catastrophes: Unlocking cross-sectoral emergency resource sharing","authors":"Yue Feng ,&nbsp;Yingyi Zhang ,&nbsp;Ming Cong ,&nbsp;Lili Rong","doi":"10.1016/j.eswa.2026.131459","DOIUrl":"10.1016/j.eswa.2026.131459","url":null,"abstract":"<div><div>Catastrophic events trigger surging and uneven demands across emergency subjects, necessitating cross-sectoral resource sharing to reconcile imbalances between demand and available resources. However, actionable insights on how to implement such sharing effectively remain scarce. This study innovatively presents a scenario-adaptive “tasks-subjects-resources” sharing framework and formulate a scenario-tailored multi-objective optimization model that jointly minimizes resource shortage cost and coordination cost while improving task-execution efficiency. To solve the model efficiently, a flow-constrained NSGA-II (FC-NSGA-II) algorithm is designed, incorporating structural characteristics of resource sharing. Comparative experiments show that FC-NSGA-II consistently outperforms SPEA2 and MOPSO in terms of hypervolume (HV) and inverted generational distance (IGD), with statistical significance confirmed by Friedman and Nemenyi tests. The scenario-driven Chebyshev decision protocol (SCDP) is further proposed that identifies context-appropriate sharing strategies to support actionable decisions. Moreover, quantifying trade-offs across multiple sharing levers in major epidemic and earthquake cases reveals consistent threshold and diminishing-return effects, whereby performance improves markedly under moderate sharing but yields only limited marginal gains as sharing expands further. Specifically, most efficiency gains and shortage reductions are achieved when local resource retention exceeds approximately 30%. Expanding share-eligible resource types or participating subjects beyond about 80% yields limited additional benefits while coordination costs continue to rise. Likewise, full demand fulfillment is not necessary, as a coverage level near 70% captures most benefits with manageable coordination cost. Our study advances cross-sectoral resource coordination, paving the way for more resilient and intelligent response system to time-critical catastrophes.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"311 ","pages":"Article 131459"},"PeriodicalIF":7.5,"publicationDate":"2026-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190906","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
3D-DCASphereNet: 3D dynamic convolutional attention network with spherical representation for high heterogeneity in lung nodule detection 3D- dcaspherenet:三维动态卷积注意网络,具有球面表示,用于肺结节检测的高异质性
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-01-30 DOI: 10.1016/j.eswa.2026.131375
Jingjing Yu , Hanchao Wang , Yiling Wen , Shihao Chen , Yuetong An , Xiaheng Lu , Xuelei He
Automatic and accurate detection of lung nodules in 3D CT scans is crucial for the early diagnosis of lung cancer. Although conventional anchor-based convolutional neural networks (CNNs) demonstrate reasonable performance, they exhibit several inherent limitations: (1) difficulty in adapting to the diverse morphological, structural, and density variations of nodules; (2) reduced sensitivity to nodules with indistinct boundaries or high tissue heterogeneity; (3) dependence on manually predefined anchor parameters, such as size and aspect ratio. To address these issues, this paper proposes an anchor-free framework 3D-DCASphereNet, which integrates attention-based 3D dynamic residual module, and a sphere representation method with geometric constraints to enhance detection accuracy and robustness. The network architecture adopts attention-based 3D dynamic residual module combined with a spatial coordinate map to adaptively capture various features and spatial location information of lung nodules, especially for ill-defined nodules and heterogeneous tissues. To overcomes the morphological bias of bounding boxes for irregular nodules, a loss function LS_VDIoU based on geometry-driven spherical representation is proposed to evaluate the overlapping regions of spheres and optimizes the geometric shape and spatial location differences of objects. Finally, a KD-Tree-based center point matching strategy is employed to enhance anchor-free detection capabilities while accelerating search and matching efficiency. Experiments on the LUNA16 dataset demonstrate that 3D-DCASphereNet achieves an average sensitivity of 89.51% under the condition of 7 predefined false positives per scan, outperforming existing state-of-the-art methods.
在三维CT扫描中自动准确地发现肺结节对于肺癌的早期诊断至关重要。尽管传统的基于锚点的卷积神经网络(cnn)表现出合理的性能,但它们存在一些固有的局限性:(1)难以适应结节的不同形态、结构和密度变化;(2)对边界不清或组织异质性高的结节敏感性降低;(3)依赖于手动预定义的锚点参数,如大小和纵横比。针对这些问题,本文提出了无锚框架3D- dcaspherenet,该框架集成了基于注意力的三维动态残差模块和几何约束的球体表示方法,以提高检测精度和鲁棒性。网络架构采用基于注意力的三维动态残差模块,结合空间坐标图,自适应捕获肺结节的各种特征和空间位置信息,特别是对于定义不清的结节和异质组织。为了克服不规则结节边界盒的形态偏差,提出了一种基于几何驱动球面表示的损失函数LS_VDIoU来评估球体的重叠区域,优化目标的几何形状和空间位置差异。最后,采用基于kd树的中心点匹配策略,增强无锚点检测能力,提高搜索和匹配效率。在LUNA16数据集上的实验表明,3D-DCASphereNet在每次扫描有7个预定义误报的情况下,平均灵敏度达到89.51%,优于现有的最先进的方法。
{"title":"3D-DCASphereNet: 3D dynamic convolutional attention network with spherical representation for high heterogeneity in lung nodule detection","authors":"Jingjing Yu ,&nbsp;Hanchao Wang ,&nbsp;Yiling Wen ,&nbsp;Shihao Chen ,&nbsp;Yuetong An ,&nbsp;Xiaheng Lu ,&nbsp;Xuelei He","doi":"10.1016/j.eswa.2026.131375","DOIUrl":"10.1016/j.eswa.2026.131375","url":null,"abstract":"<div><div>Automatic and accurate detection of lung nodules in 3D CT scans is crucial for the early diagnosis of lung cancer. Although conventional anchor-based convolutional neural networks (CNNs) demonstrate reasonable performance, they exhibit several inherent limitations: (1) difficulty in adapting to the diverse morphological, structural, and density variations of nodules; (2) reduced sensitivity to nodules with indistinct boundaries or high tissue heterogeneity; (3) dependence on manually predefined anchor parameters, such as size and aspect ratio. To address these issues, this paper proposes an anchor-free framework <em>3D-DCASphereNet</em>, which integrates attention-based 3D dynamic residual module, and a sphere representation method with geometric constraints to enhance detection accuracy and robustness. The network architecture adopts attention-based 3D dynamic residual module combined with a spatial coordinate map to adaptively capture various features and spatial location information of lung nodules, especially for ill-defined nodules and heterogeneous tissues. To overcomes the morphological bias of bounding boxes for irregular nodules, a loss function <span><math><msub><mi>L</mi><mrow><mtext>S</mtext><mo>_</mo><mtext>VDIoU</mtext></mrow></msub></math></span> based on geometry-driven spherical representation is proposed to evaluate the overlapping regions of spheres and optimizes the geometric shape and spatial location differences of objects. Finally, a <em>KD-Tree</em>-based center point matching strategy is employed to enhance anchor-free detection capabilities while accelerating search and matching efficiency. Experiments on the LUNA16 dataset demonstrate that <em>3D-DCASphereNet</em> achieves an average sensitivity of 89.51% under the condition of 7 predefined false positives per scan, outperforming existing state-of-the-art methods.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"311 ","pages":"Article 131375"},"PeriodicalIF":7.5,"publicationDate":"2026-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190899","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Expert Systems with Applications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1