首页 > 最新文献
paperpass

Applied Soft Computing最新文献

英文 中文
RADSCL: Representation augmentation integrated with dual supervised contrastive learning for low-resource text classification 基于双监督对比学习的低资源文本分类表征增强
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-16 DOI: 10.1016/j.asoc.2026.114646
Jun Zhang , Ze Kuang , Fanfan Shen , Jianfeng He , Rui Sun , Yanxiang He
Text classification in low-resource regime is a challenging task. Data augmentation techniques can significantly alleviate the issue of insufficient training samples in such environments by generating new samples. However, existing data augmentation methods have not yet effectively solved the problems of hard samples that are hard to classify and insufficient model generalization ability, which makes the performance of text classification in low-resource regime still has room for improvement. To this end, this paper proposes a method that fuses representational data augmentation and dual supervised contrast learning (RADSCL) in low-resource regime. Representational data augmentation first uses dynamic span-cutoff to remove context-independent words, which reduces the parameters needed for mixup and lowers the computational cost. Then the meaningless property of PAD word embeddings is utilized to perform weighted mixing with the cut-off text to reduce the importance of certain words in the text that affect classification. Through the representation augmentation method proposed in this paper, high-quality hard positive samples can be generated to optimize the decision boundary of the model. On this basis, in view of the current contrastive learning has achieved significant results in enhancing text representation, this paper constructs a dual supervised contrastive learning framework. The framework not only uses supervised contrastive learning to focus on the contrastive relationship between positive and negative samples, but also fully learns the potential semantic relationship between different categories of samples under the role of soft labels. Label distribution contrastive learning further utilizes the distribution information of soft labels based on supervised contrastive learning to impose effective constraints on the text representation, which effectively improves the performance of the text classification model. Multiple sets of experimental results show that the performance of the RADSCL model outperforms any model that incorporates other data augmentation and supervised contrastive learning models by a considerable margin on three benchmark datasets. In particular, the average accuracy of RADSCL is improved by 2.76 %, 2.66 %, 0.91 %, and 2.75 %, respectively, relative to the fusion models such as EDA+CE+SCL, Mixup+CE+SCL, ADV+CE+SCL, and AWD+CE+SCL.
低资源环境下的文本分类是一项具有挑战性的任务。数据增强技术可以通过生成新的样本来显著缓解这种环境下训练样本不足的问题。然而,现有的数据增强方法尚未有效解决硬样本难以分类和模型泛化能力不足的问题,这使得文本分类在低资源状态下的性能仍有提升空间。为此,本文提出了一种在低资源条件下融合表征数据增强和双监督对比学习(RADSCL)的方法。代表性数据增强首先使用动态跨度截断来删除与上下文无关的单词,这减少了混淆所需的参数并降低了计算成本。然后利用PAD词嵌入的无意义特性与截断文本进行加权混合,降低文本中某些影响分类的词的重要性。通过本文提出的表示增强方法,可以生成高质量的硬正样本来优化模型的决策边界。在此基础上,鉴于目前对比学习在增强文本表征方面已经取得了显著的成果,本文构建了一个双监督对比学习框架。该框架不仅利用监督对比学习关注正负样本之间的对比关系,而且在软标签的作用下,充分学习了不同类别样本之间潜在的语义关系。标签分布对比学习进一步利用基于监督对比学习的软标签分布信息对文本表示进行有效约束,有效地提高了文本分类模型的性能。多组实验结果表明,在三个基准数据集上,RADSCL模型的性能明显优于任何包含其他数据增强和监督对比学习模型的模型。与EDA+CE+SCL、Mixup+CE+SCL、ADV+CE+SCL和AWD+CE+SCL等融合模型相比,RADSCL的平均准确率分别提高了2.76 %、2.66 %、0.91 %和2.75 %。
{"title":"RADSCL: Representation augmentation integrated with dual supervised contrastive learning for low-resource text classification","authors":"Jun Zhang ,&nbsp;Ze Kuang ,&nbsp;Fanfan Shen ,&nbsp;Jianfeng He ,&nbsp;Rui Sun ,&nbsp;Yanxiang He","doi":"10.1016/j.asoc.2026.114646","DOIUrl":"10.1016/j.asoc.2026.114646","url":null,"abstract":"<div><div>Text classification in low-resource regime is a challenging task. Data augmentation techniques can significantly alleviate the issue of insufficient training samples in such environments by generating new samples. However, existing data augmentation methods have not yet effectively solved the problems of hard samples that are hard to classify and insufficient model generalization ability, which makes the performance of text classification in low-resource regime still has room for improvement. To this end, this paper proposes a method that fuses representational data augmentation and dual supervised contrast learning (RADSCL) in low-resource regime. Representational data augmentation first uses dynamic span-cutoff to remove context-independent words, which reduces the parameters needed for mixup and lowers the computational cost. Then the meaningless property of PAD word embeddings is utilized to perform weighted mixing with the cut-off text to reduce the importance of certain words in the text that affect classification. Through the representation augmentation method proposed in this paper, high-quality hard positive samples can be generated to optimize the decision boundary of the model. On this basis, in view of the current contrastive learning has achieved significant results in enhancing text representation, this paper constructs a dual supervised contrastive learning framework. The framework not only uses supervised contrastive learning to focus on the contrastive relationship between positive and negative samples, but also fully learns the potential semantic relationship between different categories of samples under the role of soft labels. Label distribution contrastive learning further utilizes the distribution information of soft labels based on supervised contrastive learning to impose effective constraints on the text representation, which effectively improves the performance of the text classification model. Multiple sets of experimental results show that the performance of the RADSCL model outperforms any model that incorporates other data augmentation and supervised contrastive learning models by a considerable margin on three benchmark datasets. In particular, the average accuracy of RADSCL is improved by 2.76 %, 2.66 %, 0.91 %, and 2.75 %, respectively, relative to the fusion models such as EDA+CE+SCL, Mixup+CE+SCL, ADV+CE+SCL, and AWD+CE+SCL.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114646"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039870","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
Relation-aware heterogeneous graph network multi-modal predictive modeling of stock movements 关系感知的异质图网络股票走势多模态预测建模
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-28 DOI: 10.1016/j.asoc.2026.114703
Abdullah Ali Salamai
The predictive modeling of movements in stock price information has been common but a challenging task for achieving sustainable management of stock marketplaces. This can be attributed to the importance of this information in evading market risks and improving financing decisions. This task becomes more challenging because of the availability of different modalities of stock information (i.e., stock prices, tweets, events, charts, etc.) and the presence of lead-lag relationships. In this regard, graph neural networks (GNNs) have recently achieved great improvements in providing effective modeling and analysis of stock relationships. However, multi-modal stock data evolve with dynamism in the form of heterogeneous graph topologies that limit the representation power of the existing GNNs. To this end, this study presents a novel graph intelligence framework called relation-aware heterogeneous graph network (RHGN) for efficient prediction of stock movements from multi-modal information by learning different forms of relational knowledge from heterogeneous graphs constructed for every trading day. In particular, the relational graph convolutions are presented to extract distinctive node-wise relational knowledge from the subgraph of each type of relationship. Then, the multi-relation knowledge passing module is designed to empower the network to model the dynamicity of relational knowledge throughout various types of relationships. Simultaneously, the edge relations are encoded into trainable temporal representations, from which edgewise relational knowledge is learned by capturing the contextual interactions among stock entities. In RHGN, an adversarial graph learning mechanism is introduced to adaptively augment and perturb the node representations based on the gradient information to make the model robust against small oscillations in input data. Experimentations on four public multi-modal stock movement datasets have validated the efficiency of the RHGN over the state-of-the-art.
股票价格信息运动的预测建模已经很普遍,但对于实现股票市场的可持续管理是一项具有挑战性的任务。这可以归因于这些信息在规避市场风险和改善融资决策方面的重要性。由于股票信息的不同形式(即股票价格、推文、事件、图表等)的可用性以及领先-滞后关系的存在,这项任务变得更具挑战性。在这方面,图神经网络(gnn)最近在提供有效的股票关系建模和分析方面取得了很大的进步。然而,多模态库存数据以异构图拓扑的形式动态演化,限制了现有gnn的表示能力。为此,本研究提出了一种新的图智能框架,称为关系感知异构图网络(RHGN),通过从每个交易日构建的异构图中学习不同形式的关系知识,从多模态信息中有效预测股票走势。特别地,提出了关系图卷积,从每种关系类型的子图中提取独特的节点智能关系知识。然后,设计了多关系知识传递模块,使网络能够在各种类型的关系中对关系知识进行动态建模。同时,将边缘关系编码为可训练的时态表示,通过捕获库存实体之间的上下文交互来学习边缘关系知识。在RHGN中,引入了一种对抗图学习机制来自适应地增强和扰动基于梯度信息的节点表示,使模型对输入数据的小振荡具有鲁棒性。在四个公共多模态家畜运动数据集上的实验验证了RHGN的效率。
{"title":"Relation-aware heterogeneous graph network multi-modal predictive modeling of stock movements","authors":"Abdullah Ali Salamai","doi":"10.1016/j.asoc.2026.114703","DOIUrl":"10.1016/j.asoc.2026.114703","url":null,"abstract":"<div><div>The predictive modeling of movements in stock price information has been common but a challenging task for achieving sustainable management of stock marketplaces. This can be attributed to the importance of this information in evading market risks and improving financing decisions. This task becomes more challenging because of the availability of different modalities of stock information (i.e., stock prices, tweets, events, charts, etc.) and the presence of lead-lag relationships. In this regard, graph neural networks (GNNs) have recently achieved great improvements in providing effective modeling and analysis of stock relationships. However, multi-modal stock data evolve with dynamism in the form of heterogeneous graph topologies that limit the representation power of the existing GNNs. To this end, this study presents a novel graph intelligence framework called relation-aware heterogeneous graph network (RHGN) for efficient prediction of stock movements from multi-modal information by learning different forms of relational knowledge from heterogeneous graphs constructed for every trading day. In particular, the relational graph convolutions are presented to extract distinctive node-wise relational knowledge from the subgraph of each type of relationship. Then, the multi-relation knowledge passing module is designed to empower the network to model the dynamicity of relational knowledge throughout various types of relationships. Simultaneously, the edge relations are encoded into trainable temporal representations, from which edgewise relational knowledge is learned by capturing the contextual interactions among stock entities. In RHGN, an adversarial graph learning mechanism is introduced to adaptively augment and perturb the node representations based on the gradient information to make the model robust against small oscillations in input data. Experimentations on four public multi-modal stock movement datasets have validated the efficiency of the RHGN over the state-of-the-art.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114703"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080298","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
Optimization method of process parameters based on the constraints of surface quality and geometric feature of elements during copying turning 仿形车削过程中基于表面质量和零件几何特征约束的工艺参数优化方法
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-27 DOI: 10.1016/j.asoc.2026.114711
Zhiheng Chen , Ning Li , Shiying Tu , Kaimao Zeng , Juan Lu , Dan Chen
Machining quality and performance are key indicators of CNC machine tool. To enhance the machining of non-circular curves and rotating parts on mid- to low-end CNC machines, this study proposes an optimization method for contour turning parameters based on surface quality and geometric feature constraints. The method integrates trajectory and parameter optimization. First, the Double-Heads Snake (DHS) algorithm generates a smooth G-code tool path comprising straight lines, convex arcs, and concave arcs with varying curvatures. Multi-objective optimization models are then developed for these elements to enhance machining quality and performance stability. Using Back Propagation Neural Networks (BPNN), the models predict surface roughness (Ra) and cutting force (F) based on process parameters and curvature radius, analyzing their influence mechanisms. An improved African Vulture multi-objective optimization algorithm (MOAVOAimprove) is proposed and validated against other algorithms using CEC2009 benchmarks, demonstrating superior performance. Surface quality and geometric constraints guide tool path segmentation, merging adjacent path segments with minimal curvature impact on Ra into single regions. Optimized process parameters are then determined for each region based on curvature and multi-objective solutions. The method is applied to non-circular rotating workpieces and compared with Mastercam and experience-based parameters. Results show significant improvements in machining quality, validating the method's effectiveness and practicality.
加工质量和性能是数控机床的关键指标。为了提高中低端数控机床对非圆曲线和旋转零件的加工能力,提出了一种基于表面质量和几何特征约束的轮廓车削参数优化方法。该方法将轨迹优化与参数优化相结合。首先,双头蛇形(DHS)算法生成由不同曲率的直线、凸弧和凹弧组成的光滑g代码刀具路径。为提高加工质量和性能稳定性,建立了多目标优化模型。该模型采用反向传播神经网络(BPNN),基于工艺参数和曲率半径预测表面粗糙度Ra和切削力F,并分析其影响机理。提出了一种改进的非洲秃鹫多目标优化算法(MOAVOAimprove),并在CEC2009基准测试中与其他算法进行了验证,证明了其优越的性能。表面质量和几何约束指导刀具轨迹分割,将曲率对Ra影响最小的相邻轨迹段合并为单个区域。然后根据曲率和多目标解确定每个区域的优化工艺参数。将该方法应用于非圆旋转工件,并与Mastercam和基于经验的参数进行了比较。结果表明,加工质量有明显提高,验证了该方法的有效性和实用性。
{"title":"Optimization method of process parameters based on the constraints of surface quality and geometric feature of elements during copying turning","authors":"Zhiheng Chen ,&nbsp;Ning Li ,&nbsp;Shiying Tu ,&nbsp;Kaimao Zeng ,&nbsp;Juan Lu ,&nbsp;Dan Chen","doi":"10.1016/j.asoc.2026.114711","DOIUrl":"10.1016/j.asoc.2026.114711","url":null,"abstract":"<div><div>Machining quality and performance are key indicators of CNC machine tool. To enhance the machining of non-circular curves and rotating parts on mid- to low-end CNC machines, this study proposes an optimization method for contour turning parameters based on surface quality and geometric feature constraints. The method integrates trajectory and parameter optimization. First, the Double-Heads Snake (DHS) algorithm generates a smooth G-code tool path comprising straight lines, convex arcs, and concave arcs with varying curvatures. Multi-objective optimization models are then developed for these elements to enhance machining quality and performance stability. Using Back Propagation Neural Networks (BPNN), the models predict surface roughness (<em>Ra</em>) and cutting force (<em>F</em>) based on process parameters and curvature radius, analyzing their influence mechanisms. An improved African Vulture multi-objective optimization algorithm (MOAVOA<sub>improve</sub>) is proposed and validated against other algorithms using CEC2009 benchmarks, demonstrating superior performance. Surface quality and geometric constraints guide tool path segmentation, merging adjacent path segments with minimal curvature impact on <em>Ra</em> into single regions. Optimized process parameters are then determined for each region based on curvature and multi-objective solutions. The method is applied to non-circular rotating workpieces and compared with Mastercam and experience-based parameters. Results show significant improvements in machining quality, validating the method's effectiveness and practicality.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114711"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080296","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 multi-modal brain image fusion technique using nakagami imaging and intuitionistic fuzzy sets 基于nakagami成像和直觉模糊集的多模态脑图像融合技术
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-28 DOI: 10.1016/j.asoc.2026.114706
K.G. Lavanya, P. Dhanalakshmi, M. Nandhini
Medical image fusion is essential for consolidating images from diverse modalities into a single image, offering comprehensive information for diagnosis and analysis. With the rapid evolution of brain imaging technologies, researchers increasingly focus on refining fuzzy fusion techniques to utilize the full potential of these modalities. However, existing fuzzy fusion approaches often face three key challenges: difficulty in enhancing low-contrast images, uncertainty in selecting appropriate fuzzy membership functions, and redundancy in preserving important features. To address these shortcomings, a Nakagami distribution and intuitionistic fuzzy set-based multi-modal brain image fusion (NIFMBF) framework is proposed. This method integrates three core innovations: First, Nakagami imaging (NI) is employed to enhance low-contrast areas and reveal imperceptible lesions; second, a novel intuitionistic fuzzy generator (IFG) is designed to transform NI outputs into intuitionistic fuzzy images that effectively handle vagueness and enhance fine structural details; third, gray-level co-occurrence matrix (GLCM)-based contrast feature extraction guides the fusion process, enabling the retention of crucial information while reducing redundant data. Extensive experiments conducted on three benchmark datasets and compared against five state-of-the-art fusion techniques demonstrate the superior performance of the proposed NIFMBF method. Quantitatively, the method achieves an average improvement of 12–20% for every considered fusion metric. Additionally, the proposed framework reduces computational time by nearly 30% highlighting its efficiency. These findings, validated by both qualitative and quantitative evaluations, underscore the efficacy and potential of NIFMBF for medical image fusion.
医学图像融合对于将不同模式的图像合并为单一图像,为诊断和分析提供全面的信息至关重要。随着脑成像技术的快速发展,研究人员越来越关注模糊融合技术的改进,以充分利用这些模式的潜力。然而,现有的模糊融合方法往往面临三个关键挑战:难以增强低对比度图像,选择合适的模糊隶属函数的不确定性,以及保留重要特征的冗余。针对这些不足,提出了一种基于Nakagami分布和直觉模糊集的多模态脑图像融合(NIFMBF)框架。该方法整合了三个核心创新:首先,利用中川成像(Nakagami imaging, NI)增强低对比度区域,显示难以察觉的病变;其次,设计了一种新的直觉模糊生成器(IFG),将NI输出转化为直觉模糊图像,有效地处理模糊性并增强精细结构细节;第三,基于灰度共生矩阵(GLCM)的对比度特征提取指导融合过程,在减少冗余数据的同时保留关键信息。在三个基准数据集上进行了大量实验,并与五种最先进的融合技术进行了比较,证明了所提出的NIFMBF方法的优越性能。在定量上,该方法对每个考虑的融合度量实现了12-20%的平均改进。此外,所提出的框架减少了近30%的计算时间,突出了其效率。这些发现得到了定性和定量评价的验证,强调了NIFMBF在医学图像融合方面的功效和潜力。
{"title":"A multi-modal brain image fusion technique using nakagami imaging and intuitionistic fuzzy sets","authors":"K.G. Lavanya,&nbsp;P. Dhanalakshmi,&nbsp;M. Nandhini","doi":"10.1016/j.asoc.2026.114706","DOIUrl":"10.1016/j.asoc.2026.114706","url":null,"abstract":"<div><div>Medical image fusion is essential for consolidating images from diverse modalities into a single image, offering comprehensive information for diagnosis and analysis. With the rapid evolution of brain imaging technologies, researchers increasingly focus on refining fuzzy fusion techniques to utilize the full potential of these modalities. However, existing fuzzy fusion approaches often face three key challenges: difficulty in enhancing low-contrast images, uncertainty in selecting appropriate fuzzy membership functions, and redundancy in preserving important features. To address these shortcomings, a Nakagami distribution and intuitionistic fuzzy set-based multi-modal brain image fusion (NIFMBF) framework is proposed. This method integrates three core innovations: First, Nakagami imaging (NI) is employed to enhance low-contrast areas and reveal imperceptible lesions; second, a novel intuitionistic fuzzy generator (IFG) is designed to transform NI outputs into intuitionistic fuzzy images that effectively handle vagueness and enhance fine structural details; third, gray-level co-occurrence matrix (GLCM)-based contrast feature extraction guides the fusion process, enabling the retention of crucial information while reducing redundant data. Extensive experiments conducted on three benchmark datasets and compared against five state-of-the-art fusion techniques demonstrate the superior performance of the proposed NIFMBF method. Quantitatively, the method achieves an average improvement of 12–20% for every considered fusion metric. Additionally, the proposed framework reduces computational time by nearly 30% highlighting its efficiency. These findings, validated by both qualitative and quantitative evaluations, underscore the efficacy and potential of NIFMBF for medical image fusion.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114706"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080294","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 swarm based metaheuristic approach in passive compensator tuning strategy incurring system loadability improvement 一种基于群的元启发式方法在无源补偿器调谐策略中引起系统负载性改善
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-05 DOI: 10.1016/j.asoc.2026.114740
Debanjan Mukherjee , Subhajit Mukherjee , Sourav Mallick , Ratan Mandal , Soumya Chatterjee
Optimization issues in practical engineering are frequently nonconvex, discontinuous, and nonlinear. Most of the standard derivative-based optimization techniques either cannot provide the expected outcome for such real issues or do so only after relaxing the nonlinearities. Therefore, due to derivative-free nature, population-based metaheuristic approaches have gained popularity. They may not be totally free from the local optima trapping limitation, despite the fact that they are oblivious to the complexity of the situation. Henceforth, a suitable strategy must be adopted to create a new metaheuristic algorithm for effectively solving the said problems with appreciable accuracy without high linearization of the actual problem. Given this, the recent algorithm of the Levy Flight motivated Adaptive Particle Swarm Optimization (APSOLF) technique is enhanced by the Self-Pollination (SP) strategy; this results in proposing the SP Enhanced APSOLF (EAPSOLF) algorithm which is specifically designed for applying and testing on a nonlinear, complex, constrained optimization problem like single tuned passive compensator tuning problem. Here, two standard power systems i.e., IEEE 5 and IEEE 118 bus systems are considered as the test platforms. Consequently, the system losses are minimized after optimizing the filter settings which also result in improving the bus voltage profile and the enhancement in systems’ Maximum Loadability Limit (MLL) in a remarkable extent. Additionally, the EAPSOLF's effectiveness in solving such real-time engineering issue is compared with other state-of-the-art metaheuristics using different statistical analytical tools. The proposed technique has showed its effectiveness in all test cases.
实际工程中的优化问题往往是非凸的、不连续的和非线性的。大多数标准的基于导数的优化技术要么不能为这类实际问题提供预期的结果,要么只有在放松非线性之后才能实现。因此,由于无导数的性质,基于群体的元启发式方法得到了普及。它们可能无法完全摆脱局部最优陷阱的限制,尽管它们忽略了情况的复杂性。因此,必须采用合适的策略来创建一种新的元启发式算法,以有效地解决上述问题,并具有可观的精度,而不会使实际问题高度线性化。鉴于此,最近的Levy飞行激励自适应粒子群优化(APSOLF)技术算法通过自授粉(SP)策略进行了改进;本文提出了SP Enhanced APSOLF (EAPSOLF)算法,该算法专门用于非线性、复杂、约束优化问题(如单调谐无源补偿器调谐问题)的应用和测试。本文以ieee5和ieee118总线两种标准电源系统作为测试平台。因此,在优化滤波器设置后,系统损耗最小,并且在很大程度上改善了母线电压分布,提高了系统的最大负载限制(MLL)。此外,EAPSOLF在解决此类实时工程问题方面的有效性与使用不同统计分析工具的其他最先进的元启发式方法进行了比较。所提出的技术在所有的测试用例中都显示了它的有效性。
{"title":"A swarm based metaheuristic approach in passive compensator tuning strategy incurring system loadability improvement","authors":"Debanjan Mukherjee ,&nbsp;Subhajit Mukherjee ,&nbsp;Sourav Mallick ,&nbsp;Ratan Mandal ,&nbsp;Soumya Chatterjee","doi":"10.1016/j.asoc.2026.114740","DOIUrl":"10.1016/j.asoc.2026.114740","url":null,"abstract":"<div><div>Optimization issues in practical engineering are frequently nonconvex, discontinuous, and nonlinear. Most of the standard derivative-based optimization techniques either cannot provide the expected outcome for such real issues or do so only after relaxing the nonlinearities. Therefore, due to derivative-free nature, population-based metaheuristic approaches have gained popularity. They may not be totally free from the local optima trapping limitation, despite the fact that they are oblivious to the complexity of the situation. Henceforth, a suitable strategy must be adopted to create a new metaheuristic algorithm for effectively solving the said problems with appreciable accuracy without high linearization of the actual problem. Given this, the recent algorithm of the Levy Flight motivated Adaptive Particle Swarm Optimization (APSOLF) technique is enhanced by the Self-Pollination (SP) strategy; this results in proposing the SP Enhanced APSOLF (EAPSOLF) algorithm which is specifically designed for applying and testing on a nonlinear, complex, constrained optimization problem like single tuned passive compensator tuning problem. Here, two standard power systems i.e., IEEE 5 and IEEE 118 bus systems are considered as the test platforms. Consequently, the system losses are minimized after optimizing the filter settings which also result in improving the bus voltage profile and the enhancement in systems’ Maximum Loadability Limit (MLL) in a remarkable extent. Additionally, the EAPSOLF's effectiveness in solving such real-time engineering issue is compared with other state-of-the-art metaheuristics using different statistical analytical tools. The proposed technique has showed its effectiveness in all test cases.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114740"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191836","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 lightweight ultrasound welding surface defect detection network based robust feature downsampling 基于鲁棒特征降采样的轻型超声焊接表面缺陷检测网络
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-03 DOI: 10.1016/j.asoc.2026.114736
Rui Liu , Zhonghua Shen , Lun Zhao , Yu Ren , Lan Zhang , Liya Li , Jiajin Zhang , Amr Monier
Ultrasonic welding is widely used in high-precision manufacturing because of its environmental benefits and high efficiency. Ultrasonic welding surface defects have significant large span and a background noise. Currently, the accuracy and computational complexity of deep learning-based industrial surface defect detection networks are challenging to meet the requirements. To address these problems, this research proposes a lightweight ultrasonic welding surface defect detection network (LUWDNet) for surface defects in ultrasonic welding wire harness terminals. Firstly, an efficient multi-scale residual block (EMR) is proposed, which uses residual structure and reparameterization technology to improve the feature extraction capability and enhance the network’s ability to extract multi-scale features. Subsequently, a deformable directional residual block (DDR) is proposed, which uses a bidirectional convolution kernel to expand the model’s receptive field. Reduces the impact of noise generated by background information in the model. Moreover, a hierarchical cascade feature fusion block (HCFF) is proposed, which uses dynamic channel adjustment to reduce network computation so that network computation and model size can be better adapted to edge deployment. Finally, the Robust Feature Downsampling Module (RFD) is applied in the network to mitigate the problem of small target loss and excessive noise generated by small targets during the downsampling process. To validate the effectiveness and generalizability of LUWDNet, it achieved 94.2% precision and 88.6% mean average precision (mAP50) with 2.6M parameters and a 6.5M model size in the surface defect dataset of ultrasonic welded wire harness terminals (UWSD). In addition, the satisfactory performance on the public dataset NEU-DET demonstrates the generalizability and stability of LUWDNet, showing its broad prospects in the field of industrial defect detection.
超声波焊接以其环保、高效的优点在高精度制造中得到了广泛的应用。超声波焊接表面缺陷具有明显的大跨度和背景噪声。目前,基于深度学习的工业表面缺陷检测网络的精度和计算复杂度难以满足要求。针对这些问题,本研究提出了一种轻型超声焊接表面缺陷检测网络(LUWDNet),用于超声焊接线束端子的表面缺陷检测。首先,提出了一种高效的多尺度残差块(EMR),利用残差结构和重参数化技术提高特征提取能力,增强网络对多尺度特征的提取能力;在此基础上,提出了一种可变形的定向残差块(DDR),利用双向卷积核扩展模型的接受域。减少模型中背景信息产生的噪声的影响。此外,提出了一种分层级联特征融合块(HCFF),利用动态信道调整减少网络计算,使网络计算和模型大小更好地适应边缘部署。最后,将鲁棒特征下采样模块(Robust Feature Downsampling Module, RFD)应用于网络中,以缓解下采样过程中小目标的损失和小目标产生的过多噪声问题。为了验证LUWDNet的有效性和泛化性,在超声焊接线束终端(UWSD)表面缺陷数据集中,以2.6M参数和6.5M模型尺寸实现了94.2%的精度和88.6%的平均精度(mAP50)。此外,LUWDNet在公共数据集nue - det上令人满意的性能证明了该方法的泛化性和稳定性,显示了其在工业缺陷检测领域的广阔前景。
{"title":"A lightweight ultrasound welding surface defect detection network based robust feature downsampling","authors":"Rui Liu ,&nbsp;Zhonghua Shen ,&nbsp;Lun Zhao ,&nbsp;Yu Ren ,&nbsp;Lan Zhang ,&nbsp;Liya Li ,&nbsp;Jiajin Zhang ,&nbsp;Amr Monier","doi":"10.1016/j.asoc.2026.114736","DOIUrl":"10.1016/j.asoc.2026.114736","url":null,"abstract":"<div><div>Ultrasonic welding is widely used in high-precision manufacturing because of its environmental benefits and high efficiency. Ultrasonic welding surface defects have significant large span and a background noise. Currently, the accuracy and computational complexity of deep learning-based industrial surface defect detection networks are challenging to meet the requirements. To address these problems, this research proposes a lightweight ultrasonic welding surface defect detection network (LUWDNet) for surface defects in ultrasonic welding wire harness terminals. Firstly, an efficient multi-scale residual block (EMR) is proposed, which uses residual structure and reparameterization technology to improve the feature extraction capability and enhance the network’s ability to extract multi-scale features. Subsequently, a deformable directional residual block (DDR) is proposed, which uses a bidirectional convolution kernel to expand the model’s receptive field. Reduces the impact of noise generated by background information in the model. Moreover, a hierarchical cascade feature fusion block (HCFF) is proposed, which uses dynamic channel adjustment to reduce network computation so that network computation and model size can be better adapted to edge deployment. Finally, the Robust Feature Downsampling Module (RFD) is applied in the network to mitigate the problem of small target loss and excessive noise generated by small targets during the downsampling process. To validate the effectiveness and generalizability of LUWDNet, it achieved 94.2% precision and 88.6% mean average precision (mAP50) with 2.6M parameters and a 6.5M model size in the surface defect dataset of ultrasonic welded wire harness terminals (UWSD). In addition, the satisfactory performance on the public dataset NEU-DET demonstrates the generalizability and stability of LUWDNet, showing its broad prospects in the field of industrial defect detection.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114736"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190705","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
Achelous++: Power-oriented multi-task panoptic waterway perception framework based on vision-radar fusion Achelous++:基于视觉雷达融合的功率导向多任务全景水路感知框架
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-05 DOI: 10.1016/j.asoc.2026.114787
Runwei Guan , Haocheng Zhao , Shanliang Yao , Limin Yu , Xiaohui Zhu , Ryan Wen Liu , Eng Gee Lim , Weiping Ding , Yutao Yue , Hui Xiong
Multi-task panoptic perception leveraging multi-sensor fusion is crucial for comprehensively understanding waterway environments, which enhances the robust monitoring and autonomous navigation of unmanned surface vessels. However, the fragmented design inherent in multi-modal and multi-task neural networks inevitably leads to decreased inference speed and increased energy consumption. Therefore, we focus on developing a low-power, lightweight multi-task panoptic perception framework with high liberty for development. In this paper, we propose an end-to-end framework named Achelous++, capable of executing five perception tasks concurrently with high speed and low power consumption, which include object detection, semantic segmentation, drivable-area segmentation, waterline segmentation, and radar point cloud semantic segmentation. Notably, we design an efficient vision-radar fusion module, termed Gating Adaptive Fusion (GAF), to enhance fusion-based perception tasks cost-effectively within a shared computational space. Moreover, we design a dynamic feature routing module called Edge-Context Weighting (ECW) for feature selection in multi-segmentation tasks. Building on this, we also design a series of metrics to evaluate the energy consumption of multi-task perception. Overall, our Achelous++ framework achieves state-of-the-art performance on WaterScenes benchmark. Specifically, the optimal model of Achelous++ framework outperforms other models by approximately 5% mAP and 7% mIoU in object detection and multiple semantic segmentation tasks, while maintaining over 20 FPS and power consumption under 20W on Orin. To the best of our knowledge, Achelous++ is the pioneering fusion-based framework for panoptic perception that integrates five perception tasks.
利用多传感器融合的多任务全景感知技术对于全面了解航道环境,增强无人水面舰艇的鲁棒监测和自主航行能力至关重要。然而,多模态和多任务神经网络固有的碎片化设计不可避免地导致推理速度下降和能量消耗增加。因此,我们专注于开发一种低功耗、轻量级、多任务、具有高度开发自由度的全视感知框架。在本文中,我们提出了一个端到端框架achelous++,能够以高速和低功耗同时执行五项感知任务,包括目标检测、语义分割、可驾驶区域分割、水线分割和雷达点云语义分割。值得注意的是,我们设计了一个高效的视觉雷达融合模块,称为门控自适应融合(GAF),以在共享计算空间内经济有效地增强基于融合的感知任务。此外,我们设计了一个动态特征路由模块,称为边缘上下文加权(ECW),用于多分割任务的特征选择。在此基础上,我们还设计了一系列指标来评估多任务感知的能量消耗。总体而言,我们的achelous++框架在水景基准上实现了最先进的性能。具体而言,acheloul++框架的最优模型在目标检测和多语义分割任务上的mAP和mIoU分别比其他模型高出约5%和7%,同时在Orin上的FPS保持在20以上,功耗在20W以下。据我们所知,achelous++是一个开创性的基于融合的全视感知框架,它集成了五个感知任务。
{"title":"Achelous++: Power-oriented multi-task panoptic waterway perception framework based on vision-radar fusion","authors":"Runwei Guan ,&nbsp;Haocheng Zhao ,&nbsp;Shanliang Yao ,&nbsp;Limin Yu ,&nbsp;Xiaohui Zhu ,&nbsp;Ryan Wen Liu ,&nbsp;Eng Gee Lim ,&nbsp;Weiping Ding ,&nbsp;Yutao Yue ,&nbsp;Hui Xiong","doi":"10.1016/j.asoc.2026.114787","DOIUrl":"10.1016/j.asoc.2026.114787","url":null,"abstract":"<div><div>Multi-task panoptic perception leveraging multi-sensor fusion is crucial for comprehensively understanding waterway environments, which enhances the robust monitoring and autonomous navigation of unmanned surface vessels. However, the fragmented design inherent in multi-modal and multi-task neural networks inevitably leads to decreased inference speed and increased energy consumption. Therefore, we focus on developing a low-power, lightweight multi-task panoptic perception framework with high liberty for development. In this paper, we propose an end-to-end framework named <em>Achelous</em><span><math><mo>+</mo><mo>+</mo></math></span>, capable of executing five perception tasks concurrently with high speed and low power consumption, which include object detection, semantic segmentation, drivable-area segmentation, waterline segmentation, and radar point cloud semantic segmentation. Notably, we design an efficient vision-radar fusion module, termed Gating Adaptive Fusion (GAF), to enhance fusion-based perception tasks cost-effectively within a shared computational space. Moreover, we design a dynamic feature routing module called Edge-Context Weighting (ECW) for feature selection in multi-segmentation tasks. Building on this, we also design a series of metrics to evaluate the energy consumption of multi-task perception. Overall, our <em>Achelous</em><span><math><mo>+</mo><mo>+</mo></math></span> framework achieves state-of-the-art performance on WaterScenes benchmark. Specifically, the optimal model of Achelous<span><math><mo>+</mo><mo>+</mo></math></span> framework outperforms other models by approximately 5% mAP and 7% mIoU in object detection and multiple semantic segmentation tasks, while maintaining over 20 FPS and power consumption under 20W on Orin. To the best of our knowledge, <em>Achelous</em><span><math><mo>+</mo><mo>+</mo></math></span> is the pioneering fusion-based framework for panoptic perception that integrates five perception tasks.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114787"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190768","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 multi-feature collaborative computational neural architecture search method for classifying continuous time series signals 一种用于连续时间序列信号分类的多特征协同计算神经结构搜索方法
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-30 DOI: 10.1016/j.asoc.2026.114731
Rui Zhang , Xin-Yu Li , Yan-Jun Zhang
This paper proposes a multi-feature collaborative computational neural architecture search (MFCC-NAS) method for classifying continuous time series signals. It is designed to enhance the value density of the signals and mitigate the subjective nature of the design of the model architecture while reducing the computational cost of assessing its performance. We first design a representation of sample richness and a metric of their contributions to enhance the richness of the features in them, so that they provide a basis of dense and high-value data. Following this, we develop a MFCC-NAS method that can efficiently construct a model to classify continuous time series signals by using a search space designed for global–local feature separation based on cells, an architecture search strategy for the collaborative computation of global–local features, and a low-cost and robust cascading strategy to evaluate the performance of the architecture. Finally, we design a multi-domain collaborative fusion mechanism to fully integrate convolutional visual features from different spatial domains and obtain a comprehensive representation of the features of the samples. We tested the proposed method through comparative generalization experiments on a dataset of welding defects and the Yaseen dataset. After respective search times of 1.52 h and 1.21 h on these datasets, our model achieved an accuracy of classification of over 98 % on both. Furthermore, the resulting model maintains a compact parameter size and short inference time. These results collectively demonstrate the effectiveness and strong generalization capability of the proposed MFCC-NAS method.
提出了一种用于连续时间序列信号分类的多特征协同计算神经结构搜索(mfc - nas)方法。它旨在增强信号的值密度,减轻模型体系结构设计的主观性,同时降低评估其性能的计算成本。我们首先设计了样本丰富度的表示及其贡献度量,以增强样本中特征的丰富度,从而为密集和高价值的数据提供基础。在此基础上,我们开发了一种mfc - nas方法,该方法通过基于单元的全局-局部特征分离搜索空间,全局-局部特征协同计算的架构搜索策略以及低成本和鲁棒的级联策略来评估架构的性能,可以有效地构建连续时间序列信号分类模型。最后,设计了一种多域协同融合机制,将不同空间域的卷积视觉特征充分融合,得到样本特征的综合表示。通过焊接缺陷数据集和Yaseen数据集的对比泛化实验,验证了该方法的有效性。在这些数据集上分别搜索1.52 h和1.21 h后,我们的模型在两个数据集上都实现了超过98 %的分类准确率。此外,所得到的模型保持了紧凑的参数大小和较短的推理时间。这些结果共同证明了所提出的mfc - nas方法的有效性和较强的泛化能力。
{"title":"A multi-feature collaborative computational neural architecture search method for classifying continuous time series signals","authors":"Rui Zhang ,&nbsp;Xin-Yu Li ,&nbsp;Yan-Jun Zhang","doi":"10.1016/j.asoc.2026.114731","DOIUrl":"10.1016/j.asoc.2026.114731","url":null,"abstract":"<div><div>This paper proposes a multi-feature collaborative computational neural architecture search (MFCC-NAS) method for classifying continuous time series signals. It is designed to enhance the value density of the signals and mitigate the subjective nature of the design of the model architecture while reducing the computational cost of assessing its performance. We first design a representation of sample richness and a metric of their contributions to enhance the richness of the features in them, so that they provide a basis of dense and high-value data. Following this, we develop a MFCC-NAS method that can efficiently construct a model to classify continuous time series signals by using a search space designed for global–local feature separation based on cells, an architecture search strategy for the collaborative computation of global–local features, and a low-cost and robust cascading strategy to evaluate the performance of the architecture. Finally, we design a multi-domain collaborative fusion mechanism to fully integrate convolutional visual features from different spatial domains and obtain a comprehensive representation of the features of the samples. We tested the proposed method through comparative generalization experiments on a dataset of welding defects and the Yaseen dataset. After respective search times of 1.52 h and 1.21 h on these datasets, our model achieved an accuracy of classification of over 98 % on both. Furthermore, the resulting model maintains a compact parameter size and short inference time. These results collectively demonstrate the effectiveness and strong generalization capability of the proposed MFCC-NAS method.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114731"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146096115","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 novel graph neural network-based approach for android malware detection 一种新的基于图神经网络的android恶意软件检测方法
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-28 DOI: 10.1016/j.asoc.2026.114689
Donghai Tian , Zhanyun Niu , Tao Leng , Jiaqing Jiang , Pengxuan Chen , Changzhen Hu , Chong Yuan , Ruilong Deng
With the rapid development of the Internet of Things (IoT) and the Internet of Vehicles (IoV), smartphones have evolved into central hubs for connecting users with various smart devices, making their security increasingly vital. However, the growing prevalence of malicious mobile applications poses significant threats to user privacy and digital assets. Existing machine learning-based mobile malware detection methods often face limitations in terms of robustness and interpretability. To address these challenges, we propose GRED (GNN-based Robust and Explainable Malware Detection), an Android malware detection model that leverages graph neural networks to precisely identify malicious behavior while enhancing both robustness and interpretability. GRED refines Android function call graphs, extracts semantic and structural API features, and utilizes a Top-K-based GNN architecture for effective malware detection. Additionally, it offers multi-perspective interpretability analysis to support an in-depth understanding of detection results. Extensive experiments conducted on two large datasets demonstrate that GRED achieves superior performance compared to existing methods. The interpretability module effectively pinpoints malicious behaviors, thereby assisting security analysts in subsequent investigation and mitigation efforts.
随着物联网(IoT)和车联网(IoV)的快速发展,智能手机已经发展成为连接用户与各种智能设备的中心枢纽,其安全性变得越来越重要。然而,恶意移动应用程序的日益流行对用户隐私和数字资产构成了重大威胁。现有的基于机器学习的移动恶意软件检测方法在鲁棒性和可解释性方面往往面临局限性。为了应对这些挑战,我们提出了GRED(基于gnn的鲁棒和可解释恶意软件检测),这是一种利用图神经网络精确识别恶意行为的Android恶意软件检测模型,同时增强了鲁棒性和可解释性。GRED细化Android函数调用图,提取语义和结构API特征,并利用基于top的GNN架构进行有效的恶意软件检测。此外,它还提供了多角度的可解释性分析,以支持对检测结果的深入理解。在两个大型数据集上进行的大量实验表明,与现有方法相比,GRED取得了更好的性能。可解释性模块有效地查明恶意行为,从而协助安全分析人员进行后续调查和缓解工作。
{"title":"A novel graph neural network-based approach for android malware detection","authors":"Donghai Tian ,&nbsp;Zhanyun Niu ,&nbsp;Tao Leng ,&nbsp;Jiaqing Jiang ,&nbsp;Pengxuan Chen ,&nbsp;Changzhen Hu ,&nbsp;Chong Yuan ,&nbsp;Ruilong Deng","doi":"10.1016/j.asoc.2026.114689","DOIUrl":"10.1016/j.asoc.2026.114689","url":null,"abstract":"<div><div>With the rapid development of the Internet of Things (IoT) and the Internet of Vehicles (IoV), smartphones have evolved into central hubs for connecting users with various smart devices, making their security increasingly vital. However, the growing prevalence of malicious mobile applications poses significant threats to user privacy and digital assets. Existing machine learning-based mobile malware detection methods often face limitations in terms of robustness and interpretability. To address these challenges, we propose GRED (GNN-based Robust and Explainable Malware Detection), an Android malware detection model that leverages graph neural networks to precisely identify malicious behavior while enhancing both robustness and interpretability. GRED refines Android function call graphs, extracts semantic and structural API features, and utilizes a Top-K-based GNN architecture for effective malware detection. Additionally, it offers multi-perspective interpretability analysis to support an in-depth understanding of detection results. Extensive experiments conducted on two large datasets demonstrate that GRED achieves superior performance compared to existing methods. The interpretability module effectively pinpoints malicious behaviors, thereby assisting security analysts in subsequent investigation and mitigation efforts.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114689"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146096145","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
Quantum-enhanced recurrent models for cognitive–motor assessment 认知-运动评估的量子增强循环模型
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-24 DOI: 10.1016/j.asoc.2026.114696
Basma Jalloul, Bassem Bouaziz, Walid Mahdi
Accurate assessment of cognitive and motor function is fundamental for the early detection of neurodegenerative and cerebrovascular conditions such as Mild Cognitive Impairment (MCI), stroke, and Parkinson’s disease. While clinical evaluations are often subjective, recent advances in wearable sensing and pose estimation have enabled objective gait analysis across these disorders. However, the inherent noise, artifacts, and inter-subject variability of real-world clinical data remain challenging for conventional deep learning models, which tend to overfit synthetic data and generalize poorly. In this work, we propose a hybrid soft-computing framework that integrates parameterized quantum circuits with recurrent neural networks (QE-RNNs) to enhance feature representation and robustness. Quantum-enhanced embeddings are executed on real quantum hardware and combined with classical temporal modeling to capture complex brain–motor dynamics. Experimental results across synthetic and clinical gait datasets show that, whereas classical RNNs lose significant accuracy in noisy environments, QE-RNNs maintain strong generalization, achieving up to 99.25% accuracy in stroke-related gait analysis and 81.43% in Parkinson’s motor-state classification. These findings highlight the potential of quantum-inspired soft computing for developing resilient, explainable, and clinically relevant tools for motor assessment.
准确评估认知和运动功能是早期发现神经退行性和脑血管疾病(如轻度认知障碍(MCI)、中风和帕金森病)的基础。虽然临床评估往往是主观的,但最近在可穿戴传感和姿势估计方面的进展使这些疾病的客观步态分析成为可能。然而,现实世界临床数据固有的噪声、伪影和学科间的可变性仍然是传统深度学习模型面临的挑战,这些模型往往会过度拟合合成数据,泛化能力差。在这项工作中,我们提出了一种混合软计算框架,该框架将参数化量子电路与递归神经网络(qe - rnn)集成在一起,以增强特征表示和鲁棒性。量子增强嵌入在真实的量子硬件上执行,并结合经典的时间建模来捕获复杂的脑运动动力学。合成和临床步态数据集的实验结果表明,经典rnn在噪声环境中失去了显著的准确性,而qe - rnn保持了很强的一般化,在卒中相关步态分析中准确率高达99.25%,在帕金森运动状态分类中准确率高达81.43%。这些发现突出了量子启发的软计算在开发有弹性的、可解释的和临床相关的运动评估工具方面的潜力。
{"title":"Quantum-enhanced recurrent models for cognitive–motor assessment","authors":"Basma Jalloul,&nbsp;Bassem Bouaziz,&nbsp;Walid Mahdi","doi":"10.1016/j.asoc.2026.114696","DOIUrl":"10.1016/j.asoc.2026.114696","url":null,"abstract":"<div><div>Accurate assessment of cognitive and motor function is fundamental for the early detection of neurodegenerative and cerebrovascular conditions such as Mild Cognitive Impairment (MCI), stroke, and Parkinson’s disease. While clinical evaluations are often subjective, recent advances in wearable sensing and pose estimation have enabled objective gait analysis across these disorders. However, the inherent noise, artifacts, and inter-subject variability of real-world clinical data remain challenging for conventional deep learning models, which tend to overfit synthetic data and generalize poorly. In this work, we propose a hybrid soft-computing framework that integrates parameterized quantum circuits with recurrent neural networks (QE-RNNs) to enhance feature representation and robustness. Quantum-enhanced embeddings are executed on real quantum hardware and combined with classical temporal modeling to capture complex brain–motor dynamics. Experimental results across synthetic and clinical gait datasets show that, whereas classical RNNs lose significant accuracy in noisy environments, QE-RNNs maintain strong generalization, achieving up to 99.25% accuracy in stroke-related gait analysis and 81.43% in Parkinson’s motor-state classification. These findings highlight the potential of quantum-inspired soft computing for developing resilient, explainable, and clinically relevant tools for motor assessment.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114696"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080041","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
期刊
Applied Soft Computing
全部 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.
﹀
mjeditor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1