首页 > 最新文献

Computers & Electrical Engineering最新文献

英文 中文
VGPDFL-SkinSeg: Enhancing model generalisation with data diversity via voting-based client selection and gradual pruning for decentralised federated skin lesion segmentation VGPDFL-SkinSeg:通过基于投票的客户端选择和对分散的联邦皮肤病变分割的逐步修剪来增强数据多样性的模型泛化
IF 4.9 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-02-04 DOI: 10.1016/j.compeleceng.2026.111022
Monika Srivastava , Gautam Kumar , Rishav Singh
In medical imaging, the segmentation of skin lesions plays a vital role in detecting and treating skin cancer. Deep learning demonstrates its efficacy in this process. However, it largely relies on extensive and well-annotated datasets that are often limited by healthcare agencies privacy restrictions and institutional data silos. Federated Learning (FL) emerged as a boon, enabling collaborative training without sharing data. Yet, in a real-world setting, healthcare bodies may possess various computational capacities that can affect the consistency of the FL framework, posing the requirement of generalising the model architecture. This study proposes a Decentralised Federated Learning (DFL) framework to improve model generalisation for Skin Lesion Segmentation (SkinSeg). It incorporates a novel Voting (V)-based client selection mechanism to identify the most suitable local model based on performance metrics and dataset size. The selected model is then subjected to Gradual Pruning (GP) via a modified Lottery Ticket Hypothesis (LTH) to reduce model complexity while preserving segmentation quality. The pruned model is then broadcast to all clients for further training. The VGPDFL-SkinSeg substantially improved over State-Of-The-Art FL frameworks on benchmark datasets HAM10K, ISIC-2016/17/18 and DermIs+DermQuest. It achieved a client-wise average Dice Coefficient (DSC) of 90.09%, 96.60% Accuracy, 82.45% meanIOU, 13.63% HD95 and 5.20% ASSD. Initially, each client starts with different segmentation models, reflecting practical diverse systems, and gradually converges towards homogeneity. The study shows that gradual pruning up to 40% yields better segmentation quality than fixed pruning at the beginning and is consistent with client scaling.
在医学影像学中,皮肤病灶的分割在皮肤癌的检测和治疗中起着至关重要的作用。深度学习在这个过程中证明了它的有效性。然而,它在很大程度上依赖于广泛且注释良好的数据集,这些数据集通常受到医疗机构隐私限制和机构数据孤岛的限制。联邦学习(FL)的出现是一个福音,使协作训练无需共享数据。然而,在现实环境中,医疗保健机构可能拥有各种计算能力,这些计算能力可能会影响FL框架的一致性,从而提出了一般化模型体系结构的要求。本研究提出了一个去中心化联邦学习(DFL)框架来改进皮肤病变分割(SkinSeg)的模型泛化。它结合了一种新颖的基于投票(V)的客户端选择机制,以根据性能指标和数据集大小确定最合适的本地模型。然后,通过改进的彩票假设(LTH)对所选模型进行逐步修剪(GP),以降低模型复杂性,同时保持分割质量。然后将修剪后的模型广播给所有客户进行进一步培训。VGPDFL-SkinSeg在基准数据集HAM10K、ISIC-2016/17/18和DermIs+DermQuest上大大改进了最先进的FL框架。它实现了客户平均骰子系数(DSC)为90.09%,准确率为96.60%,平均ou为82.45%,HD95为13.63%,ASSD为5.20%。最初,每个客户都有不同的细分模型,反映了实际的多样化系统,并逐渐向同质化收敛。研究表明,高达40%的逐渐修剪比开始时的固定修剪产生更好的分割质量,并且与客户端扩展一致。
{"title":"VGPDFL-SkinSeg: Enhancing model generalisation with data diversity via voting-based client selection and gradual pruning for decentralised federated skin lesion segmentation","authors":"Monika Srivastava ,&nbsp;Gautam Kumar ,&nbsp;Rishav Singh","doi":"10.1016/j.compeleceng.2026.111022","DOIUrl":"10.1016/j.compeleceng.2026.111022","url":null,"abstract":"<div><div>In medical imaging, the segmentation of skin lesions plays a vital role in detecting and treating skin cancer. Deep learning demonstrates its efficacy in this process. However, it largely relies on extensive and well-annotated datasets that are often limited by healthcare agencies privacy restrictions and institutional data silos. Federated Learning (FL) emerged as a boon, enabling collaborative training without sharing data. Yet, in a real-world setting, healthcare bodies may possess various computational capacities that can affect the consistency of the FL framework, posing the requirement of generalising the model architecture. This study proposes a Decentralised Federated Learning (DFL) framework to improve model generalisation for Skin Lesion Segmentation (SkinSeg). It incorporates a novel Voting (V)-based client selection mechanism to identify the most suitable local model based on performance metrics and dataset size. The selected model is then subjected to Gradual Pruning (GP) via a modified Lottery Ticket Hypothesis (LTH) to reduce model complexity while preserving segmentation quality. The pruned model is then broadcast to all clients for further training. The VGPDFL-SkinSeg substantially improved over State-Of-The-Art FL frameworks on benchmark datasets HAM10K, ISIC-2016/17/18 and DermIs+DermQuest. It achieved a client-wise average Dice Coefficient (DSC) of 90.09%, 96.60% Accuracy, 82.45% meanIOU, 13.63% HD95 and 5.20% ASSD. Initially, each client starts with different segmentation models, reflecting practical diverse systems, and gradually converges towards homogeneity. The study shows that gradual pruning up to 40% yields better segmentation quality than fixed pruning at the beginning and is consistent with client scaling.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"132 ","pages":"Article 111022"},"PeriodicalIF":4.9,"publicationDate":"2026-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A novel EEG motor imagery classification model using feature fusion of temporal convolution and attention 基于时间卷积和注意力特征融合的脑电运动图像分类模型
IF 4.9 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-02-03 DOI: 10.1016/j.compeleceng.2026.110990
Mohammad Bdaqli, Saeed Meshgini, Reza Afrouzian
Motor imagery classification using electroencephalography (EEG) signals is a fundamental component of Brain-Computer Interface (BCI) systems. It enables individuals with physical disabilities to control robotic limbs and perform various movements. However, the inherently noisy nature of EEG signals poses significant challenges for their effective utilization in this domain. In this study, we propose a novel end-to-end deep learning model based on feature fusion of multiple deep learning blocks, including a Convolutional Neural Network (CNN), Temporal Convolutional Network (TCN), and Squeeze and Excitation (SE) attention mechanism, enabling the model to learn discriminative features for classifying raw motor imagery signals without any preprocessing. The proposed architecture employs novel feature fusion strategies to maximize classification performance and computational efficiency. The CNN extracts initial spatial features, the TCN captures temporal dependencies, and the SE attention mechanism emphasizes the most informative features from the CNN output. The model was evaluated on the BCI Competition IV 2a and 2b datasets. Training was conducted for 500 epochs (2a dataset) and 200 epochs (2b dataset), using only the first session of each subject for training and validation. The average classification accuracies on the completely isolated test sets (second session) were 78.12 % and 85.72 % for the 2a and 2b datasets, respectively. These results demonstrate that the proposed model effectively classifies multi-class motor imagery signals.
利用脑电图(EEG)信号进行运动图像分类是脑机接口(BCI)系统的基本组成部分。它使身体残疾的人能够控制机械肢体并进行各种运动。然而,脑电信号固有的噪声特性对其在该领域的有效利用提出了重大挑战。在这项研究中,我们提出了一种新的端到端深度学习模型,该模型基于多个深度学习模块的特征融合,包括卷积神经网络(CNN)、时间卷积网络(TCN)和挤压和激励(SE)注意机制,使模型能够在不进行任何预处理的情况下学习判别特征,用于对原始运动图像信号进行分类。该体系结构采用新颖的特征融合策略,最大限度地提高分类性能和计算效率。CNN提取初始空间特征,TCN捕获时间依赖性,SE注意机制强调CNN输出中信息量最大的特征。该模型在BCI Competition IV 2a和2b数据集上进行了评估。对500个epoch (2a数据集)和200个epoch (2b数据集)进行训练,仅使用每个主题的第一个会话进行训练和验证。对于2a和2b数据集,完全隔离测试集(第二次)的平均分类准确率分别为78.12%和85.72%。结果表明,该模型能有效地对多类运动图像信号进行分类。
{"title":"A novel EEG motor imagery classification model using feature fusion of temporal convolution and attention","authors":"Mohammad Bdaqli,&nbsp;Saeed Meshgini,&nbsp;Reza Afrouzian","doi":"10.1016/j.compeleceng.2026.110990","DOIUrl":"10.1016/j.compeleceng.2026.110990","url":null,"abstract":"<div><div>Motor imagery classification using electroencephalography (EEG) signals is a fundamental component of Brain-Computer Interface (BCI) systems. It enables individuals with physical disabilities to control robotic limbs and perform various movements. However, the inherently noisy nature of EEG signals poses significant challenges for their effective utilization in this domain. In this study, we propose a novel end-to-end deep learning model based on feature fusion of multiple deep learning blocks, including a Convolutional Neural Network (CNN), Temporal Convolutional Network (TCN), and Squeeze and Excitation (SE) attention mechanism, enabling the model to learn discriminative features for classifying raw motor imagery signals without any preprocessing. The proposed architecture employs novel feature fusion strategies to maximize classification performance and computational efficiency. The CNN extracts initial spatial features, the TCN captures temporal dependencies, and the SE attention mechanism emphasizes the most informative features from the CNN output. The model was evaluated on the BCI Competition IV 2a and 2b datasets. Training was conducted for 500 epochs (2a dataset) and 200 epochs (2b dataset), using only the first session of each subject for training and validation. The average classification accuracies on the completely isolated test sets (second session) were 78.12 % and 85.72 % for the 2a and 2b datasets, respectively. These results demonstrate that the proposed model effectively classifies multi-class motor imagery signals.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"132 ","pages":"Article 110990"},"PeriodicalIF":4.9,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174183","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
QR-MRMC-CLPAS: Quantum-resistant multi-replica and multi-cloud certificateless public auditing scheme based on module lattices QR-MRMC-CLPAS:基于模块格的抗量子多副本多云无证书公共审计方案
IF 4.9 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-02-03 DOI: 10.1016/j.compeleceng.2026.111000
Renuka Cheeturi , Syam Kumar Pasupuleti , Rashmi Ranjan Rout
Multi-replica and multi-cloud public auditing (MRMC-PA) is a method used to ensure data availability and integrity by verifying multiple copies of data stored across multiple cloud environments. However, existing MRMC-PA schemes are vulnerable to quantum attacks and incur high computational and communication overhead due to their reliance on pairing-based cryptography (PBC). In addition, they provide limited support for dynamic data operations across all replicas and suffer from either the certificate management problem (CMP) or the key escrow problem (KEP). To address these limitations, this paper proposes a quantum-resistant, multi-replica, and multi-cloud certificateless public auditing scheme (QR-MRMC-CLPAS) based on lattice-based cryptography over module lattices instead of PBC. The security of QR-MRMC-CLPAS is proven under the Module Learning With Errors (M-LWE) and Module Small Integer Solution (M-SIS) assumptions. To support data dynamics, we introduce a dynamic replica version table that ensures both consistency and integrity of multiple replicas across multi-cloud environments. Furthermore, the use of certificateless cryptography eliminates CMP and KEP. Performance analysis and experimental results demonstrate that QR-MRMC-CLPAS achieves significantly higher computational and communication efficiency compared to existing MRMC-PA schemes while ensuring strong quantum resilience.
多副本和多云公共审计(MRMC-PA)是一种通过验证存储在多个云环境中的数据的多个副本来确保数据可用性和完整性的方法。然而,现有的MRMC-PA方案容易受到量子攻击,并且由于依赖基于配对的加密(PBC)而导致高计算和通信开销。此外,它们对跨所有副本的动态数据操作提供有限的支持,并且存在证书管理问题(CMP)或密钥托管问题(KEP)。为了解决这些限制,本文提出了一种基于模块格而不是PBC的基于格加密的抗量子、多副本和多云无证书公共审计方案(QR-MRMC-CLPAS)。在有误差模块学习(M-LWE)和模块小整数解(M-SIS)假设下证明了QR-MRMC-CLPAS的安全性。为了支持数据动态,我们引入了一个动态副本版本表,以确保跨多云环境的多个副本的一致性和完整性。此外,使用无证书加密消除了CMP和KEP。性能分析和实验结果表明,与现有的MRMC-PA方案相比,QR-MRMC-CLPAS方案在保证强量子弹性的同时,实现了更高的计算和通信效率。
{"title":"QR-MRMC-CLPAS: Quantum-resistant multi-replica and multi-cloud certificateless public auditing scheme based on module lattices","authors":"Renuka Cheeturi ,&nbsp;Syam Kumar Pasupuleti ,&nbsp;Rashmi Ranjan Rout","doi":"10.1016/j.compeleceng.2026.111000","DOIUrl":"10.1016/j.compeleceng.2026.111000","url":null,"abstract":"<div><div>Multi-replica and multi-cloud public auditing (MRMC-PA) is a method used to ensure data availability and integrity by verifying multiple copies of data stored across multiple cloud environments. However, existing MRMC-PA schemes are vulnerable to quantum attacks and incur high computational and communication overhead due to their reliance on pairing-based cryptography (PBC). In addition, they provide limited support for dynamic data operations across all replicas and suffer from either the certificate management problem (CMP) or the key escrow problem (KEP). To address these limitations, this paper proposes a quantum-resistant, multi-replica, and multi-cloud certificateless public auditing scheme (QR-MRMC-CLPAS) based on lattice-based cryptography over module lattices instead of PBC. The security of QR-MRMC-CLPAS is proven under the Module Learning With Errors (M-LWE) and Module Small Integer Solution (M-SIS) assumptions. To support data dynamics, we introduce a dynamic replica version table that ensures both consistency and integrity of multiple replicas across multi-cloud environments. Furthermore, the use of certificateless cryptography eliminates CMP and KEP. Performance analysis and experimental results demonstrate that QR-MRMC-CLPAS achieves significantly higher computational and communication efficiency compared to existing MRMC-PA schemes while ensuring strong quantum resilience.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"132 ","pages":"Article 111000"},"PeriodicalIF":4.9,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An extensive examination of adaptive intelligence in cloud-to-edge systems for Healthcare 5.0 对医疗保健5.0的云到边缘系统中的自适应智能的广泛研究
IF 4.9 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-02-03 DOI: 10.1016/j.compeleceng.2026.111006
Shamsul Haq, Prabal Verma
Healthcare 5.0 is a transformative paradigm that revolutionizes healthcare delivery and improves patient outcomes through incorporating cutting-edge technologies. In this alignment, the paper describes the understanding of Healthcare 5.0 involving different emerging technologies and their roles in effective decision outcomes with proper examples. In correspondence to the significance of Healthcare 5.0, the paper is preceded by focusing on the importance of cloud and edge computing in such environments. It also covers different tools and techniques, analytical methods and advanced emerging analytical algorithms for disease management and treatment optimization. Consequently, it examines the applications of edge computing with emerging analytical technologies in healthcare, showcasing various use cases such as remote patient monitoring, personalized medicine, intelligent healthcare systems, and data-driven decision support resulting in improved patient care and operational efficiency. Subsequently, the statistical results with the systematic framework are performed on the basis of 563 papers published in reputed journals and organizations for the comprehensive analysis of existing technologies and to identify research solutions and challenges in the development of Smart Healthcare. Finally, we summarize our key findings and propose future directions for research and smart healthcare development.
Healthcare 5.0是一种变革性范例,它通过整合尖端技术彻底改变了医疗保健服务并改善了患者的治疗效果。本文通过适当的示例描述了对涉及不同新兴技术的Healthcare 5.0的理解,以及它们在有效决策结果中的作用。与医疗保健5.0的重要性相对应,本文首先重点介绍了云计算和边缘计算在此类环境中的重要性。它还涵盖了疾病管理和治疗优化的不同工具和技术,分析方法和先进的新兴分析算法。因此,本文探讨了边缘计算与新兴分析技术在医疗保健领域的应用,展示了各种用例,如远程患者监控、个性化医疗、智能医疗保健系统和数据驱动的决策支持,从而改善了患者护理和运营效率。随后,以发表在知名期刊和机构的563篇论文为基础,在系统框架下进行统计结果,对现有技术进行综合分析,找出智慧医疗发展中的研究解决方案和挑战。最后,我们总结了我们的主要发现,并提出了未来的研究方向和智能医疗发展。
{"title":"An extensive examination of adaptive intelligence in cloud-to-edge systems for Healthcare 5.0","authors":"Shamsul Haq,&nbsp;Prabal Verma","doi":"10.1016/j.compeleceng.2026.111006","DOIUrl":"10.1016/j.compeleceng.2026.111006","url":null,"abstract":"<div><div>Healthcare 5.0 is a transformative paradigm that revolutionizes healthcare delivery and improves patient outcomes through incorporating cutting-edge technologies. In this alignment, the paper describes the understanding of Healthcare 5.0 involving different emerging technologies and their roles in effective decision outcomes with proper examples. In correspondence to the significance of Healthcare 5.0, the paper is preceded by focusing on the importance of cloud and edge computing in such environments. It also covers different tools and techniques, analytical methods and advanced emerging analytical algorithms for disease management and treatment optimization. Consequently, it examines the applications of edge computing with emerging analytical technologies in healthcare, showcasing various use cases such as remote patient monitoring, personalized medicine, intelligent healthcare systems, and data-driven decision support resulting in improved patient care and operational efficiency. Subsequently, the statistical results with the systematic framework are performed on the basis of 563 papers published in reputed journals and organizations for the comprehensive analysis of existing technologies and to identify research solutions and challenges in the development of Smart Healthcare. Finally, we summarize our key findings and propose future directions for research and smart healthcare development.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"132 ","pages":"Article 111006"},"PeriodicalIF":4.9,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An energy-efficient privacy-preserving framework for intrusion detection in the internet of vehicles 一种节能的车联网入侵检测隐私保护框架
IF 4.9 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-02-02 DOI: 10.1016/j.compeleceng.2026.111003
Arash Heidari , Ahmad Khonsari , Seyed Hamed Rastegar
Connected vehicles rely on continuous Vehicle-to-Everything (V2X) communication, which exposes the Internet of Vehicles (IoV) to latency-sensitive and privacy-critical cyberattacks. This paper presents Federated Learning with Intelligent Traffic-aware Energy optimization (FLITE), an energy-efficient, privacy-preserving framework for intrusion detection that trains a lightweight Gated Recurrent Unit (GRU) detector on vehicles using federated learning while keeping raw telemetry local. A deep reinforcement learning–based scheduler at roadside units selects clients and transmit powers based on data quality, channel state, and device energy, reducing redundant communication. Experiments on multiple vehicular and network intrusion datasets show that FLITE achieves up to 99.8% accuracy and improves F1-score and recall by about 2–3 percentage points over strong baselines, while reducing energy consumption by 36–45%, communication overhead by more than 60%, and detection delay by up to 60%. These results demonstrate that FLITE enables real-time, fleet-wide intrusion detection for large-scale IoV deployments under realistic resource constraints.
联网汽车依赖于持续的车联网(V2X)通信,这使得车联网(IoV)容易受到延迟敏感和隐私关键型网络攻击。本文提出了具有智能交通感知能量优化(FLITE)的联邦学习,这是一种节能,隐私保护的入侵检测框架,它使用联邦学习在车辆上训练轻量级门控循环单元(GRU)检测器,同时保持原始遥测本地。基于深度强化学习的路边单元调度程序根据数据质量、信道状态和设备能量选择客户端和传输功率,从而减少冗余通信。在多个车辆和网络入侵数据集上的实验表明,FLITE的准确率高达99.8%,比强基线提高了f1分数和召回率约2-3个百分点,同时能耗降低36-45%,通信开销降低60%以上,检测延迟降低60%。这些结果表明,FLITE能够在现实资源约束下实现大规模车联网部署的实时、全车队入侵检测。
{"title":"An energy-efficient privacy-preserving framework for intrusion detection in the internet of vehicles","authors":"Arash Heidari ,&nbsp;Ahmad Khonsari ,&nbsp;Seyed Hamed Rastegar","doi":"10.1016/j.compeleceng.2026.111003","DOIUrl":"10.1016/j.compeleceng.2026.111003","url":null,"abstract":"<div><div>Connected vehicles rely on continuous Vehicle-to-Everything (V2X) communication, which exposes the Internet of Vehicles (IoV) to latency-sensitive and privacy-critical cyberattacks. This paper presents Federated Learning with Intelligent Traffic-aware Energy optimization (FLITE), an energy-efficient, privacy-preserving framework for intrusion detection that trains a lightweight Gated Recurrent Unit (GRU) detector on vehicles using federated learning while keeping raw telemetry local. A deep reinforcement learning–based scheduler at roadside units selects clients and transmit powers based on data quality, channel state, and device energy, reducing redundant communication. Experiments on multiple vehicular and network intrusion datasets show that FLITE achieves up to 99.8% accuracy and improves F1-score and recall by about 2–3 percentage points over strong baselines, while reducing energy consumption by 36–45%, communication overhead by more than 60%, and detection delay by up to 60%. These results demonstrate that FLITE enables real-time, fleet-wide intrusion detection for large-scale IoV deployments under realistic resource constraints.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"132 ","pages":"Article 111003"},"PeriodicalIF":4.9,"publicationDate":"2026-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174202","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Real-time phishing uniform resource locator detection based on hybrid embedding transformer and retraining-free inferencing 基于混合嵌入变压器和无需再训练推理的实时网络钓鱼统一资源定位器检测
IF 4.9 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-02-02 DOI: 10.1016/j.compeleceng.2026.111001
Dam Minh Linh , Huynh Trong Thua , Tran Cong Hung
Phishing attacks that evade traditional detection mechanisms by exploiting deceptive uniform resource locators (URLs) remain a significant cybersecurity threat. This study proposes an adaptive phishing URL detection framework that integrates Levenshtein distance-based string similarity, a hybrid embedding transformer (HET) encoder-based server-side verification mechanism, and a dynamically updated local blacklist. First, a rapid local lookup is executed to identify known phishing URLs. If the input URL is absent from the blacklist, the Levenshtein distance algorithm detects subtle character-level variations, identifying typosquatting and obfuscation effectively. For ambiguous cases, the HET-based module uses a lightweight post-hoc inference method that classifies URL embeddings via k-nearest neighbor voting based on Euclidean similarity in the latent space, thereby avoiding retraining and enabling real-time adaptation to emerging phishing threats. Confirmed phishing URLs are added iteratively to the local repository to improve detection continuously, enhancing future classification accuracy. Experimental evaluation on a large-scale dataset comprising 235,795 URLs revealed that the proposed method outperforms state-of-the-art approaches, achieving a detection accuracy of 99.8 %, with a false-positive rate of 0.441 % and false-negative rate of 0.0617 %. Additionally, real-time validation using a Chrome browser extension confirmed rapid processing, with an average processing time of 4.43–6.84 ms per URL on a dataset comprising 5,000 URLs. These results highlight the efficiency of the proposed framework in real-world cybersecurity contexts, enabling high detection accuracy, fast response times, and adaptability to evolving phishing strategies, and underscore the importance of proactive threat intelligence and real-time phishing mitigation in developing scalable, high-performance security infrastructures.
通过利用欺骗性的统一资源定位器(url)来逃避传统检测机制的网络钓鱼攻击仍然是一个重大的网络安全威胁。本研究提出了一种自适应网络钓鱼URL检测框架,该框架集成了基于Levenshtein距离的字符串相似性、基于混合嵌入转换器(HET)编码器的服务器端验证机制和动态更新的本地黑名单。首先,执行快速本地查找以识别已知的网络钓鱼url。如果输入URL不在黑名单中,Levenshtein距离算法会检测细微的字符级变化,有效地识别误输入和混淆。对于模棱两可的情况,基于het的模块使用轻量级的即时推理方法,通过基于潜在空间欧几里得相似性的k近邻投票对URL嵌入进行分类,从而避免了重新训练并能够实时适应新出现的网络钓鱼威胁。已确认的网络钓鱼url被迭代地添加到本地存储库中,以不断改进检测,提高未来的分类准确性。在包含235,795个url的大规模数据集上进行的实验评估表明,该方法优于现有的方法,检测准确率为99.8%,假阳性率为0.441%,假阴性率为0.0617%。此外,使用Chrome浏览器扩展的实时验证证实了快速处理,在包含5,000个URL的数据集上,每个URL的平均处理时间为4.43-6.84 ms。这些结果突出了所提出的框架在现实网络安全环境中的效率,实现了高检测精度、快速响应时间和对不断发展的网络钓鱼策略的适应性,并强调了主动威胁情报和实时网络钓鱼缓解在开发可扩展、高性能安全基础设施中的重要性。
{"title":"Real-time phishing uniform resource locator detection based on hybrid embedding transformer and retraining-free inferencing","authors":"Dam Minh Linh ,&nbsp;Huynh Trong Thua ,&nbsp;Tran Cong Hung","doi":"10.1016/j.compeleceng.2026.111001","DOIUrl":"10.1016/j.compeleceng.2026.111001","url":null,"abstract":"<div><div>Phishing attacks that evade traditional detection mechanisms by exploiting deceptive uniform resource locators (URLs) remain a significant cybersecurity threat. This study proposes an adaptive phishing URL detection framework that integrates Levenshtein distance-based string similarity, a hybrid embedding transformer (HET) encoder-based server-side verification mechanism, and a dynamically updated local blacklist. First, a rapid local lookup is executed to identify known phishing URLs. If the input URL is absent from the blacklist, the Levenshtein distance algorithm detects subtle character-level variations, identifying typosquatting and obfuscation effectively. For ambiguous cases, the HET-based module uses a lightweight post-hoc inference method that classifies URL embeddings via k-nearest neighbor voting based on Euclidean similarity in the latent space, thereby avoiding retraining and enabling real-time adaptation to emerging phishing threats. Confirmed phishing URLs are added iteratively to the local repository to improve detection continuously, enhancing future classification accuracy. Experimental evaluation on a large-scale dataset comprising 235,795 URLs revealed that the proposed method outperforms state-of-the-art approaches, achieving a detection accuracy of 99.8 %, with a false-positive rate of 0.441 % and false-negative rate of 0.0617 %. Additionally, real-time validation using a Chrome browser extension confirmed rapid processing, with an average processing time of 4.43–6.84 ms per URL on a dataset comprising 5,000 URLs. These results highlight the efficiency of the proposed framework in real-world cybersecurity contexts, enabling high detection accuracy, fast response times, and adaptability to evolving phishing strategies, and underscore the importance of proactive threat intelligence and real-time phishing mitigation in developing scalable, high-performance security infrastructures.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"132 ","pages":"Article 111001"},"PeriodicalIF":4.9,"publicationDate":"2026-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174203","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A hybrid deep learning approach for malware detection using generative adversarial network-based augmentation and multilevel feature selection 基于生成对抗网络增强和多层次特征选择的恶意软件检测混合深度学习方法
IF 4.9 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-02-01 DOI: 10.1016/j.compeleceng.2026.110997
Jaber Parchami , Seyed Reza Talebiyan , Abbas Abdulhussein Dahham , Dhulfiqar Dhurgham Husam , Ali Darroudi
The increasing prevalence of cyber threats has made malware detection a critical task for ensuring digital security. In this study, we propose a novel hybrid approach, termed Hybrid Deep Learning Network with Multilevel Feature Selection (HDLNet-MFS), for the classification and detection of various types of malwares. The proposed HDLNet-MFS framework employs a two-stage architecture comprising feature extraction and feature selection. To extract discriminative features from the two-dimensional representations of malware samples, a parallel combination of the pre-trained Inception V3 network and the Gray Level Co-occurrence Matrix (GLCM) algorithm is utilized, enabling the simultaneous capture of spatial and statistical texture features. For feature selection, a hybrid Neighborhood Component Analysis (NCA) - Minimum Redundancy Maximum Relevance (mRMR) algorithm is introduced, which effectively reduces feature dimensionality and ranks features based on their relevance to the classification task, allowing for the selection of the most informative attributes. Moreover, to address the data imbalance problem, especially for minority classes, Generative Adversarial Networks (GANs) are employed to augment the training data. The proposed approach aims to tackle key challenges such as class imbalance, limited training samples, high-dimensional feature spaces, and redundancy, thereby offering a robust and efficient solution for accurate malware classification. Experimental results demonstrate that HDLNet-MFS achieves an average classification accuracy of 99.74 % across 25 malware classes on the MalImg dataset, highlighting the precision, robustness, and effectiveness of the proposed system. Furthermore, the model exhibits high computational efficiency, achieving an average inference time of 0.84 seconds, which underscores its suitability for real-time or near–real-time malware detection scenarios in practical cybersecurity environments. The complete implementation of the proposed method is publicly available at: github.com/jaberparchami-tech/Malware-Detection-Hybrid-Framework.
网络威胁的日益普遍使得恶意软件检测成为确保数字安全的关键任务。在这项研究中,我们提出了一种新的混合方法,称为具有多层特征选择的混合深度学习网络(HDLNet-MFS),用于分类和检测各种类型的恶意软件。提出的HDLNet-MFS框架采用两阶段架构,包括特征提取和特征选择。为了从恶意软件样本的二维表示中提取判别特征,使用了预训练的Inception V3网络和灰度共生矩阵(GLCM)算法的并行组合,实现了空间和统计纹理特征的同时捕获。在特征选择方面,引入了一种混合邻域成分分析(NCA) -最小冗余最大相关性(mRMR)算法,该算法有效地降低了特征维数,并根据特征与分类任务的相关性对特征进行排序,从而选择信息量最大的属性。此外,为了解决数据不平衡问题,特别是对于少数类,使用生成对抗网络(GANs)来增强训练数据。该方法旨在解决类不平衡、训练样本有限、高维特征空间和冗余等关键挑战,从而为准确的恶意软件分类提供鲁棒和高效的解决方案。实验结果表明,HDLNet-MFS在MalImg数据集上对25个恶意软件类的平均分类准确率达到99.74%,突出了该系统的精度、鲁棒性和有效性。此外,该模型具有较高的计算效率,平均推理时间为0.84秒,适合实际网络安全环境中的实时或近实时恶意软件检测场景。建议的方法的完整实现可在:github.com/jaberparchami-tech/Malware-Detection-Hybrid-Framework上公开获得。
{"title":"A hybrid deep learning approach for malware detection using generative adversarial network-based augmentation and multilevel feature selection","authors":"Jaber Parchami ,&nbsp;Seyed Reza Talebiyan ,&nbsp;Abbas Abdulhussein Dahham ,&nbsp;Dhulfiqar Dhurgham Husam ,&nbsp;Ali Darroudi","doi":"10.1016/j.compeleceng.2026.110997","DOIUrl":"10.1016/j.compeleceng.2026.110997","url":null,"abstract":"<div><div>The increasing prevalence of cyber threats has made malware detection a critical task for ensuring digital security. In this study, we propose a novel hybrid approach, termed Hybrid Deep Learning Network with Multilevel Feature Selection (HDLNet-MFS), for the classification and detection of various types of malwares. The proposed HDLNet-MFS framework employs a two-stage architecture comprising feature extraction and feature selection. To extract discriminative features from the two-dimensional representations of malware samples, a parallel combination of the pre-trained Inception V3 network and the Gray Level Co-occurrence Matrix (GLCM) algorithm is utilized, enabling the simultaneous capture of spatial and statistical texture features. For feature selection, a hybrid Neighborhood Component Analysis (NCA) - Minimum Redundancy Maximum Relevance (mRMR) algorithm is introduced, which effectively reduces feature dimensionality and ranks features based on their relevance to the classification task, allowing for the selection of the most informative attributes. Moreover, to address the data imbalance problem, especially for minority classes, Generative Adversarial Networks (GANs) are employed to augment the training data. The proposed approach aims to tackle key challenges such as class imbalance, limited training samples, high-dimensional feature spaces, and redundancy, thereby offering a robust and efficient solution for accurate malware classification. Experimental results demonstrate that HDLNet-MFS achieves an average classification accuracy of 99.74 % across 25 malware classes on the MalImg dataset, highlighting the precision, robustness, and effectiveness of the proposed system. Furthermore, the model exhibits high computational efficiency, achieving an average inference time of 0.84 seconds, which underscores its suitability for real-time or near–real-time malware detection scenarios in practical cybersecurity environments. The complete implementation of the proposed method is publicly available at: github.com/jaberparchami-tech/Malware-Detection-Hybrid-Framework.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"132 ","pages":"Article 110997"},"PeriodicalIF":4.9,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146174249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
BMGANet: A deep learning model for source code vulnerability detection by integrating token-level and function-level features BMGANet:通过集成令牌级和功能级特性,用于源代码漏洞检测的深度学习模型
IF 4.9 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-30 DOI: 10.1016/j.compeleceng.2026.110999
Erzhou Zhu, Xiangshan Qu, Xiaohan Liu, Xuejian Li
Deep learning is widely used in vulnerability detection due to its high accuracy. However, existing models often fail to capture both token-level and function-level features. To address this limitation, a BERT-based Multi-Granularity Attention Network (BMGANet) is proposed. In the BMGANet model, Program Dependence Graphs (PDGs) are first constructed using the Joern tool, and Abstract Syntax Trees (ASTs) are extracted according to predefined vulnerability rules. Cross-user-defined-function program slicing and code normalization are then applied to enhance analysis efficiency. Processed code slices are fed into a BERT network to extract initial token-level and function-level features. To overcome BERT’s limitation in modeling temporal dependencies, an LSTM network and a multi-head attention mechanism are sequentially employed to refine token-level features. The refined token-level features are then fused with function-level features for accurate vulnerability detection. Two pretraining tasks, namely the dynamic masked token prediction and the inter-code-line logical correlation prediction, are introduced to strengthen the model’s ability to handle semantic gaps and weak logical connections. Experimental results on both synthetic and real-world datasets show that BMGANet outperforms state-of-the-art methods.
深度学习以其较高的准确率在漏洞检测中得到了广泛的应用。然而,现有的模型常常不能同时捕获令牌级和功能级的特性。为了解决这一问题,提出了一种基于bert的多粒度注意力网络(BMGANet)。在BMGANet模型中,首先使用Joern工具构建程序依赖图(PDGs),并根据预定义的漏洞规则提取抽象语法树(ast)。然后应用跨用户定义函数的程序切片和代码规范化来提高分析效率。处理后的代码片被馈送到BERT网络中,以提取初始的令牌级和功能级特征。为了克服BERT在建模时间依赖性方面的局限性,本文采用LSTM网络和多头注意机制来改进标记级特征。然后将改进的令牌级特征与功能级特征融合,以实现准确的漏洞检测。引入动态掩码令牌预测和代码行间逻辑关联预测两项预训练任务,增强模型对语义间隙和弱逻辑连接的处理能力。在合成数据集和真实数据集上的实验结果表明,BMGANet优于最先进的方法。
{"title":"BMGANet: A deep learning model for source code vulnerability detection by integrating token-level and function-level features","authors":"Erzhou Zhu,&nbsp;Xiangshan Qu,&nbsp;Xiaohan Liu,&nbsp;Xuejian Li","doi":"10.1016/j.compeleceng.2026.110999","DOIUrl":"10.1016/j.compeleceng.2026.110999","url":null,"abstract":"<div><div>Deep learning is widely used in vulnerability detection due to its high accuracy. However, existing models often fail to capture both token-level and function-level features. To address this limitation, a BERT-based Multi-Granularity Attention Network (BMGANet) is proposed. In the BMGANet model, Program Dependence Graphs (PDGs) are first constructed using the Joern tool, and Abstract Syntax Trees (ASTs) are extracted according to predefined vulnerability rules. Cross-user-defined-function program slicing and code normalization are then applied to enhance analysis efficiency. Processed code slices are fed into a BERT network to extract initial token-level and function-level features. To overcome BERT’s limitation in modeling temporal dependencies, an LSTM network and a multi-head attention mechanism are sequentially employed to refine token-level features. The refined token-level features are then fused with function-level features for accurate vulnerability detection. Two pretraining tasks, namely the dynamic masked token prediction and the inter-code-line logical correlation prediction, are introduced to strengthen the model’s ability to handle semantic gaps and weak logical connections. Experimental results on both synthetic and real-world datasets show that BMGANet outperforms state-of-the-art methods.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"132 ","pages":"Article 110999"},"PeriodicalIF":4.9,"publicationDate":"2026-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A framework for handling class imbalance in malicious URL dataset 一个处理恶意URL数据集中类不平衡的框架
IF 4.9 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-30 DOI: 10.1016/j.compeleceng.2026.111004
K.G. Raghavendra Narayan , Srijanee Mookherji , Vanga Odelu , Rajendra Prasath
With the advancement of technology, cyberattacks on Internet-based services such as email, e-commerce, social networking, and electronic healthcare are increasing. Since many of these services are accessed through URLs, they have become a primary source for cyberattacks, including phishing and malware. Anti-Phishing Working Group (APWG) reported nearly 1 million phishing attacks in the first quarter of 2025. Early detection of malicious URLs is therefore critical to preventing these threats. Therefore, an efficient detection of malicious URLs is an emerging research problem. However, most ML/DL-based studies focus on overall model accuracy and tend to be biased towards majority classes in imbalanced datasets. In this paper, we propose a machine learning-based malicious URL detection framework specifically designed for imbalanced datasets. We use the ISCX-URL2016 dataset to evaluate model performance across multiple ML algorithms and classbalancing techniques. Our proposed framework, combining the LightGBM classifier with ADASYN oversampling, achieves 99.76% accuracy in multi-class and 99.92% in binary classification. Notably, it shows a 5.93% improvement in detecting phishing URLs, a minority class in the dataset, over existing models. A significant achievement of our approach is its uniform performance across all classes, effectively reducing bias towards majority classes, while existing models fail to achieve it, particularly minority classes. We also validated the proposed model using recent datasets. We further evaluate the framework using various feature selection techniques, demonstrating its effectiveness with fewer features. Additionally, we perform statistical significance testing to validate the reliability of our model, confirming its suitability for real-world applications.
随着技术的进步,针对基于互联网的服务(如电子邮件、电子商务、社交网络和电子医疗保健)的网络攻击正在增加。由于这些服务中的许多都是通过url访问的,因此它们已成为网络攻击的主要来源,包括网络钓鱼和恶意软件。反网络钓鱼工作组(APWG)报告称,2025年第一季度发生了近100万次网络钓鱼攻击。因此,早期检测恶意url对于防止这些威胁至关重要。因此,如何有效地检测恶意url是一个新兴的研究课题。然而,大多数基于ML/ dl的研究关注的是整体模型的准确性,并且倾向于不平衡数据集中的大多数类别。在本文中,我们提出了一个专门针对不平衡数据集设计的基于机器学习的恶意URL检测框架。我们使用ISCX-URL2016数据集来评估跨多种ML算法和类平衡技术的模型性能。我们提出的框架将LightGBM分类器与ADASYN过采样相结合,在多类分类中达到99.76%的准确率,在二元分类中达到99.92%的准确率。值得注意的是,与现有模型相比,它在检测网络钓鱼url(数据集中的少数类)方面提高了5.93%。我们的方法的一个重要成就是它在所有类别中的统一表现,有效地减少了对多数类别的偏见,而现有模型无法实现这一点,特别是少数类别。我们还使用最近的数据集验证了所提出的模型。我们使用各种特征选择技术进一步评估该框架,证明其在较少特征下的有效性。此外,我们执行统计显著性检验来验证我们的模型的可靠性,确认其适用于现实世界的应用。
{"title":"A framework for handling class imbalance in malicious URL dataset","authors":"K.G. Raghavendra Narayan ,&nbsp;Srijanee Mookherji ,&nbsp;Vanga Odelu ,&nbsp;Rajendra Prasath","doi":"10.1016/j.compeleceng.2026.111004","DOIUrl":"10.1016/j.compeleceng.2026.111004","url":null,"abstract":"<div><div>With the advancement of technology, cyberattacks on Internet-based services such as email, e-commerce, social networking, and electronic healthcare are increasing. Since many of these services are accessed through URLs, they have become a primary source for cyberattacks, including phishing and malware. Anti-Phishing Working Group (APWG) reported nearly 1 million phishing attacks in the first quarter of 2025. Early detection of malicious URLs is therefore critical to preventing these threats. Therefore, an efficient detection of malicious URLs is an emerging research problem. However, most ML/DL-based studies focus on overall model accuracy and tend to be biased towards majority classes in imbalanced datasets. In this paper, we propose a machine learning-based malicious URL detection framework specifically designed for imbalanced datasets. We use the ISCX-URL2016 dataset to evaluate model performance across multiple ML algorithms and classbalancing techniques. Our proposed framework, combining the LightGBM classifier with ADASYN oversampling, achieves 99.76% accuracy in multi-class and 99.92% in binary classification. Notably, it shows a 5.93% improvement in detecting phishing URLs, a minority class in the dataset, over existing models. A significant achievement of our approach is its uniform performance across all classes, effectively reducing bias towards majority classes, while existing models fail to achieve it, particularly minority classes. We also validated the proposed model using recent datasets. We further evaluate the framework using various feature selection techniques, demonstrating its effectiveness with fewer features. Additionally, we perform statistical significance testing to validate the reliability of our model, confirming its suitability for real-world applications.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"132 ","pages":"Article 111004"},"PeriodicalIF":4.9,"publicationDate":"2026-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimization of hybrid flow shop scheduling with batch processing and variable sublots via a multi-agent deep reinforcement learning–guided hybrid algorithm 基于多智能体深度强化学习引导的批处理可变子批混合流水车间调度优化
IF 4.9 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-30 DOI: 10.1016/j.compeleceng.2026.110987
Qian Zheng , Yuyan Han , Yuting Wang , Daqing Liu , Mingxiao Ma , Leilei Meng
This paper investigates the Hybrid Flow Shop Scheduling Problem with Batch Processing Machines and Variable Sublots (HFSP-BVS), considering sequence-dependent setup times and transportation times, with the objective of minimizing total tardiness. The complexity of HFSP-BVS lies in the tight coupling among lot sequencing, lot splitting, and machine assignment, making it highly challenging in modern manufacturing environments. To address this problem, a Mixed-Integer Linear Programming (MILP) model is formulated and validated using the Gurobi solver. Subsequently, a hybrid algorithm, MADDQN_IG, is proposed by integrating the Multi-Agent Double Deep Q-Network (MADDQN) with Iterated Greedy (IG). The algorithm incorporates four key components: (1) a triple two-layer initialization strategy; (2) a dual-layer destruction-reconstruction parameter selection agent; (3) a local search strategy selection agent; and (4) a multi-agent DDQN construction and training process. These elements are embedded within a unified framework to enhance search efficiency and optimization depth. Extensive computational experiments on 100 benchmark instances demonstrate that MADDQN_IG consistently outperforms existing advanced algorithms (NCIG, QABC, vCCEA, GA), achieving superior solution quality and robustness within limited computation time. Specifically, under three termination criteria (δ = 100, 200, 300), MADDQN_IG improves the ARDI by 78.57%–98.57% and ranks first in the Friedman test, confirming the effectiveness and adaptability of the proposed framework.
本文研究了具有批处理机和可变子批的混合流水车间调度问题,考虑了顺序相关的设置时间和运输时间,以最小化总延误为目标。HFSP-BVS的复杂性在于批排序、批拆分和机器分配之间的紧密耦合,这使得它在现代制造环境中极具挑战性。为了解决这个问题,提出了一个混合整数线性规划(MILP)模型,并使用Gurobi求解器进行了验证。随后,将Multi-Agent Double Deep Q-Network (MADDQN)算法与迭代贪婪(IG)算法相结合,提出了一种混合算法MADDQN_IG。该算法包含四个关键部分:(1)三层两层初始化策略;(2)双层破坏重建参数选择剂;(3)局部搜索策略选择代理;(4)多智能体DDQN构建和训练过程。这些元素被嵌入到一个统一的框架中,以提高搜索效率和优化深度。在100个基准实例上的大量计算实验表明,MADDQN_IG持续优于现有的高级算法(NCIG、QABC、vCCEA、GA),在有限的计算时间内实现了卓越的解质量和鲁棒性。具体而言,在三个终止准则(δ = 100,200,300)下,MADDQN_IG将ARDI提高了78.57%-98.57%,在Friedman检验中排名第一,证实了所提框架的有效性和适应性。
{"title":"Optimization of hybrid flow shop scheduling with batch processing and variable sublots via a multi-agent deep reinforcement learning–guided hybrid algorithm","authors":"Qian Zheng ,&nbsp;Yuyan Han ,&nbsp;Yuting Wang ,&nbsp;Daqing Liu ,&nbsp;Mingxiao Ma ,&nbsp;Leilei Meng","doi":"10.1016/j.compeleceng.2026.110987","DOIUrl":"10.1016/j.compeleceng.2026.110987","url":null,"abstract":"<div><div>This paper investigates the Hybrid Flow Shop Scheduling Problem with Batch Processing Machines and Variable Sublots (HFSP-BVS), considering sequence-dependent setup times and transportation times, with the objective of minimizing total tardiness. The complexity of HFSP-BVS lies in the tight coupling among lot sequencing, lot splitting, and machine assignment, making it highly challenging in modern manufacturing environments. To address this problem, a Mixed-Integer Linear Programming (MILP) model is formulated and validated using the Gurobi solver. Subsequently, a hybrid algorithm, MADDQN_IG, is proposed by integrating the Multi-Agent Double Deep Q-Network (MADDQN) with Iterated Greedy (IG). The algorithm incorporates four key components: (1) a triple two-layer initialization strategy; (2) a dual-layer destruction-reconstruction parameter selection agent; (3) a local search strategy selection agent; and (4) a multi-agent DDQN construction and training process. These elements are embedded within a unified framework to enhance search efficiency and optimization depth. Extensive computational experiments on 100 benchmark instances demonstrate that MADDQN_IG consistently outperforms existing advanced algorithms (NCIG, QABC, vCCEA, GA), achieving superior solution quality and robustness within limited computation time. Specifically, under three termination criteria (<em><strong>δ</strong></em> = 100, 200, 300), MADDQN_IG improves the ARDI by 78.57%–98.57% and ranks first in the Friedman test, confirming the effectiveness and adaptability of the proposed framework.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"132 ","pages":"Article 110987"},"PeriodicalIF":4.9,"publicationDate":"2026-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Computers & Electrical Engineering
全部 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