首页 > 最新文献
paperpass

计算机科学最新文献

英文 中文
IF:
MergeRepair: An Exploratory Study on Merging Task-Specific Adapters in Code LLMs for Automated Program Repair. 合并修复:用于自动程序修复的代码llm中合并特定任务适配器的探索性研究。
IF 3.4 2区 计算机科学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2027-01-01 Epub Date: 2026-09-25 DOI: 10.1007/s10664-026-10943-y
Meghdad Dehghan, Jie Jw Wu, Fatemeh H Fard, Ali Ouni
<p><p>Large Language Models (LLMs) have shown high capabilities in several software development-related tasks such as program repair, documentation, code refactoring, debugging, and testing. However, training these models requires massive amount of data and significant computational resources. Adapters are specialized, small modules designed for parameter efficient fine-tuning of LLMs for specific tasks, domains, or applications without requiring extensive retraining of the entire model. These adapters offer a more efficient way to customize LLMs for particular needs, leveraging the pre-existing capabilities of the large model. Model (and adapter) merging have emerged as a technique to develop one model capable of multiple tasks, with minimal or no training required. Although model and adapter merging has shown promising performance in domains such as natural language processing and computer vision, its applicability to software engineering tasks remains underexplored. In this paper, we investigate the effectiveness of merged adapters within the context of software engineering, with a particular focus on the Automated Program Repair (APR) task, through our approach, <b>MergeRepair</b>. In particular, we merge multiple task-specific adapters using three different merging methods, including weight-averaging, TIES-Merging, and DARE-TIES, and evaluate the performance of the merged adapter on the APR task. We introduce a <b>continual merging</b> approach, a novel method in which we sequentially merge the task-specific adapters where the order and weight of the merged adapters play a significant role. We further compare the performance of our approach with a baseline method consisting of equal-weight merging applied on parameters of different adapters, where all adapters are of equal importance. Through continual merging, we explore the capability of merged adapters and the effect of task order, as it occurs in real-world software projects. To evaluate our approach, we consider two LLMs, StarCoder2 and Granite models on an APR benchmark, HumanEvalFix, with various combinations of the merged adapters trained on a subset of the CommitPackFT dataset that contains four tasks and APR in Python. The results show that merging task-specific adapters can enhance the performance of models on the APR task, <i>without additional training</i>. In particular, our approach achieves up to 2.38% performance improvement over APR task in terms of pass@1 score when merging APR with Improvement and Misc task-adapters on top of the StarCoder2 model. Performance rises to 4.01% for pass@10 score with the same model and merged adapters. This improvement could be significantly influenced by the base model and the specific task adapters merged, rather than only the number of adapters. The proposed continual merging approach can be effective if the order of merging is efficiently determined. Results show that performance improves when the most effective task-adapter is added last
大型语言模型(llm)在一些软件开发相关的任务中表现出了很高的能力,比如程序修复、文档、代码重构、调试和测试。然而,训练这些模型需要大量的数据和大量的计算资源。适配器是专门的小型模块,用于针对特定任务、领域或应用程序对llm进行参数有效微调,而不需要对整个模型进行广泛的再培训。这些适配器提供了一种更有效的方法来根据特定需求定制llm,利用大型模型的现有功能。模型(和适配器)合并已经作为一种技术出现,用于开发一个能够执行多个任务的模型,只需要很少的培训或不需要培训。尽管模型和适配器合并在自然语言处理和计算机视觉等领域显示出很好的性能,但其对软件工程任务的适用性仍未得到充分探索。在本文中,我们研究了在软件工程上下文中合并适配器的有效性,并通过我们的方法MergeRepair特别关注了自动程序修复(APR)任务。特别是,我们使用三种不同的合并方法合并多个特定于任务的适配器,包括加权平均、ties - merge和DARE-TIES,并评估合并适配器在APR任务上的性能。我们引入了一种持续合并方法,这是一种新的方法,在这种方法中,我们顺序地合并特定于任务的适配器,其中合并适配器的顺序和权重起着重要作用。我们进一步将我们的方法的性能与基线方法进行比较,该方法由应用于不同适配器参数的等权重合并组成,其中所有适配器都具有同等重要性。通过持续的合并,我们探索合并适配器的能力和任务顺序的影响,就像它在真实的软件项目中发生的那样。为了评估我们的方法,我们考虑了两个llm,在APR基准上的StarCoder2和Granite模型,HumanEvalFix,在包含四个任务和Python APR的CommitPackFT数据集的子集上训练合并适配器的各种组合。结果表明,合并特定于任务的适配器可以提高模型在APR任务上的性能,而无需额外的训练。特别是,当在StarCoder2模型之上合并APR与improvement和Misc任务适配器时,我们的方法在pass@1得分方面比APR任务实现了高达2.38%的性能提升。使用相同的模型和合并的适配器,pass@10得分的性能提高到4.01%。这种改进可能会受到基本模型和合并的特定任务适配器的显著影响,而不仅仅是适配器的数量。如果能有效地确定合并顺序,所提出的连续合并方法是有效的。结果表明,在连续合并过程中最后添加最有效的任务适配器可以提高性能。此外,当合并模型中不使用APR适配器时,我们可以获得同等甚至更好的性能,强调了该方法的通用性。这些发现表明,通过适配器合并利用来自其他代码相关任务的知识可以提高APR等新任务的性能,即使数据有限。
{"title":"MergeRepair: An Exploratory Study on Merging Task-Specific Adapters in Code LLMs for Automated Program Repair.","authors":"Meghdad Dehghan, Jie Jw Wu, Fatemeh H Fard, Ali Ouni","doi":"10.1007/s10664-026-10943-y","DOIUrl":"10.1007/s10664-026-10943-y","url":null,"abstract":"&lt;p&gt;&lt;p&gt;Large Language Models (LLMs) have shown high capabilities in several software development-related tasks such as program repair, documentation, code refactoring, debugging, and testing. However, training these models requires massive amount of data and significant computational resources. Adapters are specialized, small modules designed for parameter efficient fine-tuning of LLMs for specific tasks, domains, or applications without requiring extensive retraining of the entire model. These adapters offer a more efficient way to customize LLMs for particular needs, leveraging the pre-existing capabilities of the large model. Model (and adapter) merging have emerged as a technique to develop one model capable of multiple tasks, with minimal or no training required. Although model and adapter merging has shown promising performance in domains such as natural language processing and computer vision, its applicability to software engineering tasks remains underexplored. In this paper, we investigate the effectiveness of merged adapters within the context of software engineering, with a particular focus on the Automated Program Repair (APR) task, through our approach, &lt;b&gt;MergeRepair&lt;/b&gt;. In particular, we merge multiple task-specific adapters using three different merging methods, including weight-averaging, TIES-Merging, and DARE-TIES, and evaluate the performance of the merged adapter on the APR task. We introduce a &lt;b&gt;continual merging&lt;/b&gt; approach, a novel method in which we sequentially merge the task-specific adapters where the order and weight of the merged adapters play a significant role. We further compare the performance of our approach with a baseline method consisting of equal-weight merging applied on parameters of different adapters, where all adapters are of equal importance. Through continual merging, we explore the capability of merged adapters and the effect of task order, as it occurs in real-world software projects. To evaluate our approach, we consider two LLMs, StarCoder2 and Granite models on an APR benchmark, HumanEvalFix, with various combinations of the merged adapters trained on a subset of the CommitPackFT dataset that contains four tasks and APR in Python. The results show that merging task-specific adapters can enhance the performance of models on the APR task, &lt;i&gt;without additional training&lt;/i&gt;. In particular, our approach achieves up to 2.38% performance improvement over APR task in terms of pass@1 score when merging APR with Improvement and Misc task-adapters on top of the StarCoder2 model. Performance rises to 4.01% for pass@10 score with the same model and merged adapters. This improvement could be significantly influenced by the base model and the specific task adapters merged, rather than only the number of adapters. The proposed continual merging approach can be effective if the order of merging is efficiently determined. Results show that performance improves when the most effective task-adapter is added last","PeriodicalId":11525,"journal":{"name":"Empirical Software Engineering","volume":"32 1","pages":"37"},"PeriodicalIF":3.4,"publicationDate":"2027-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13615117/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149059353","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
D3I-COMCF: Dissimilarity-driven dual-interaction via co-occurrence motifs and complementary fragments for drug-drug interaction prediction. D3I-COMCF:通过共现基序和互补片段进行药物-药物相互作用预测的差异性驱动的双重相互作用。
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-12-01 Epub Date: 2026-07-02 DOI: 10.1016/j.neunet.2026.109328
Wentao Xie, Min Jin, Mingjian Yang, Yulu Zhou, Xinhua Liu, Meng Li, Jagath C Rajapakse

Drug-drug interaction (DDI) prediction seeks to identify pharmacodynamic and pharmacokinetic interactions arising from the co-administration of multiple drugs with differing physicochemical properties. However, most existing methods predominantly focus on global molecular or atomic topologies, overlooking the critical role of dynamically derived functional substructures (motifs) in modulating drug activity and the occurrence and strength of DDI. To this end, we propose a dissimilarity-driven dual-interaction via co-occurrence motifs and complementary fragments (D3I-COMCF) framework that deeply integrates molecular-, motif-, and atomic-level information for accurate DDI prediction. Specifically, we construct, for the first time, a co-occurrence motifs molecular interaction graph (CMMIG) that unifies the global molecular structure, local physicochemical properties of motifs, and molecule-motif interaction topology. By weighting rare, dissimilar but information-rich motifs, D3I-COMCF was guided to focus on more discriminative functional units. Moreover, based on the maximum common substructure mapping and its dissimilar one-hop neighbor extension, we dynamically incorporated complementary fragments attached to the shared backbone into a fragment interaction graph, revealing electronic complementarity and spatial cooperativity with computational efficiency. Finally, hierarchical multi-block integration of the three levels enables cross-scale joint representation of drug pairs. Extensive experiments on multiple public datasets verified the effectiveness of D3I-COMCF, which achieved strong and stable performance under standard benchmark protocols and showed promising cold-start generalization and interpretability. Additional hard-negative analysis further indicates that D3I-COMCF remains sensitive to known positive DDIs, while controlling false positives among structurally similar candidate pairs not annotated as known positives remains challenging.

药物-药物相互作用(DDI)预测旨在确定多种具有不同物理化学性质的药物共同施用时产生的药效学和药代动力学相互作用。然而,大多数现有方法主要集中在全局分子或原子拓扑结构上,忽视了动态衍生的功能亚结构(motif)在调节药物活性和DDI的发生和强度方面的关键作用。为此,我们提出了一种差异驱动的双相互作用,通过共现基序和互补片段(D3I-COMCF)框架,该框架深度集成了分子、基序和原子水平的信息,以准确预测DDI。具体而言,我们首次构建了一个共现基序分子相互作用图(CMMIG),该图将整体分子结构、基序局部物理化学性质和分子-基序相互作用拓扑结构统一起来。通过对罕见的、不相似的但信息丰富的基序进行加权,D3I-COMCF被引导到更有鉴别性的功能单元上。此外,基于最大公共子结构映射及其不同的单跳邻居扩展,我们动态地将附加在共享主干上的互补片段合并到片段相互作用图中,揭示了具有计算效率的电子互补性和空间协同性。最后,三个层次的分层多块集成使药物对的跨尺度联合表示成为可能。在多个公共数据集上的大量实验验证了D3I-COMCF的有效性,在标准基准协议下取得了强大而稳定的性能,并表现出良好的冷启动泛化和可解释性。额外的硬阴性分析进一步表明,D3I-COMCF对已知的阳性ddi仍然敏感,而控制结构相似的未标注为已知阳性的候选对中的假阳性仍然具有挑战性。
{"title":"D3I-COMCF: Dissimilarity-driven dual-interaction via co-occurrence motifs and complementary fragments for drug-drug interaction prediction.","authors":"Wentao Xie, Min Jin, Mingjian Yang, Yulu Zhou, Xinhua Liu, Meng Li, Jagath C Rajapakse","doi":"10.1016/j.neunet.2026.109328","DOIUrl":"10.1016/j.neunet.2026.109328","url":null,"abstract":"<p><p>Drug-drug interaction (DDI) prediction seeks to identify pharmacodynamic and pharmacokinetic interactions arising from the co-administration of multiple drugs with differing physicochemical properties. However, most existing methods predominantly focus on global molecular or atomic topologies, overlooking the critical role of dynamically derived functional substructures (motifs) in modulating drug activity and the occurrence and strength of DDI. To this end, we propose a dissimilarity-driven dual-interaction via co-occurrence motifs and complementary fragments (D3I-COMCF) framework that deeply integrates molecular-, motif-, and atomic-level information for accurate DDI prediction. Specifically, we construct, for the first time, a co-occurrence motifs molecular interaction graph (CMMIG) that unifies the global molecular structure, local physicochemical properties of motifs, and molecule-motif interaction topology. By weighting rare, dissimilar but information-rich motifs, D3I-COMCF was guided to focus on more discriminative functional units. Moreover, based on the maximum common substructure mapping and its dissimilar one-hop neighbor extension, we dynamically incorporated complementary fragments attached to the shared backbone into a fragment interaction graph, revealing electronic complementarity and spatial cooperativity with computational efficiency. Finally, hierarchical multi-block integration of the three levels enables cross-scale joint representation of drug pairs. Extensive experiments on multiple public datasets verified the effectiveness of D3I-COMCF, which achieved strong and stable performance under standard benchmark protocols and showed promising cold-start generalization and interpretability. Additional hard-negative analysis further indicates that D3I-COMCF remains sensitive to known positive DDIs, while controlling false positives among structurally similar candidate pairs not annotated as known positives remains challenging.</p>","PeriodicalId":49763,"journal":{"name":"Neural Networks","volume":"204 ","pages":"109328"},"PeriodicalIF":7.2,"publicationDate":"2026-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148406673","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 boundary-regularization-enhanced video anomaly detection network based on context-adaptive spatio-temporal conditional diffusion. 基于上下文自适应时空条件扩散的边界正则化增强视频异常检测网络。
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-12-01 Epub Date: 2026-07-02 DOI: 10.1016/j.neunet.2026.109330
Huilin Liu, Guanghan Sun, Xiaolong Hu, Tian Liu, Wanqi Ma

Unsupervised video anomaly detection aims to learn normal spatio-temporal patterns from unlabeled surveillance data and identify deviations during inference. Existing methods often struggle to capture long-term temporal dependencies and adapt to spatial variations caused by target deformation and viewpoint changes. Although diffusion-based models provide stable distribution modeling, their limited temporal conditioning and fixed spatial representations restrict anomaly discrimination in complex scenes. To address these issues, we propose a boundary regularization enhanced video anomaly detection network based on context-adaptive spatio-temporal conditional diffusion. Rather than relying on rigid feature extraction, our method explicitly models long-range motion evolution and dynamically adapts to spatial variations caused by target deformation and viewpoint shifts. Furthermore, to prevent overfitting to normal behaviors, we introduce a hybrid pseudo-anomaly generation strategy that acts as a boundary regularization constraint, explicitly sharpening the model's discriminative capability against abnormal patterns. Experiments on benchmark datasets including UCSD Ped2, CUHK Avenue, and ShanghaiTech demonstrate that our method significantly improves detection accuracy. By effectively integrating context-adaptive conditioning and boundary regularization, this work establishes a highly discriminative and generalizable paradigm for video anomaly detection, demonstrating strong robustness in complex, real-world surveillance scenarios.

无监督视频异常检测旨在从未标记的监控数据中学习正常的时空模式,并在推理过程中识别偏差。现有的方法往往难以捕捉长期的时间依赖性,并适应由目标变形和视点变化引起的空间变化。尽管基于扩散的模型提供了稳定的分布建模,但其有限的时间条件和固定的空间表示限制了复杂场景中的异常识别。为了解决这些问题,我们提出了一种基于上下文自适应时空条件扩散的边界正则化增强视频异常检测网络。该方法不依赖于刚性特征提取,而是明确地模拟远程运动演化,并动态适应由目标变形和视点变化引起的空间变化。此外,为了防止过度拟合正常行为,我们引入了一种混合伪异常生成策略,作为边界正则化约束,明确地增强了模型对异常模式的判别能力。在UCSD Ped2、CUHK Avenue和ShanghaiTech等基准数据集上的实验表明,我们的方法显著提高了检测精度。通过有效地整合上下文自适应条件和边界正则化,本研究为视频异常检测建立了一个高度判别和可推广的范例,在复杂的现实世界监控场景中展示了强大的鲁棒性。
{"title":"A boundary-regularization-enhanced video anomaly detection network based on context-adaptive spatio-temporal conditional diffusion.","authors":"Huilin Liu, Guanghan Sun, Xiaolong Hu, Tian Liu, Wanqi Ma","doi":"10.1016/j.neunet.2026.109330","DOIUrl":"10.1016/j.neunet.2026.109330","url":null,"abstract":"<p><p>Unsupervised video anomaly detection aims to learn normal spatio-temporal patterns from unlabeled surveillance data and identify deviations during inference. Existing methods often struggle to capture long-term temporal dependencies and adapt to spatial variations caused by target deformation and viewpoint changes. Although diffusion-based models provide stable distribution modeling, their limited temporal conditioning and fixed spatial representations restrict anomaly discrimination in complex scenes. To address these issues, we propose a boundary regularization enhanced video anomaly detection network based on context-adaptive spatio-temporal conditional diffusion. Rather than relying on rigid feature extraction, our method explicitly models long-range motion evolution and dynamically adapts to spatial variations caused by target deformation and viewpoint shifts. Furthermore, to prevent overfitting to normal behaviors, we introduce a hybrid pseudo-anomaly generation strategy that acts as a boundary regularization constraint, explicitly sharpening the model's discriminative capability against abnormal patterns. Experiments on benchmark datasets including UCSD Ped2, CUHK Avenue, and ShanghaiTech demonstrate that our method significantly improves detection accuracy. By effectively integrating context-adaptive conditioning and boundary regularization, this work establishes a highly discriminative and generalizable paradigm for video anomaly detection, demonstrating strong robustness in complex, real-world surveillance scenarios.</p>","PeriodicalId":49763,"journal":{"name":"Neural Networks","volume":"204 ","pages":"109330"},"PeriodicalIF":7.2,"publicationDate":"2026-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148399058","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
Analytical Kinematic Model and RCM Control of a Parallel-Serial Steady-Hand Eye Robot. 并联-串联稳定手眼机器人的解析运动学模型及RCM控制。
IF 3.2 4区 计算机科学 Q2 ENGINEERING, MECHANICAL Pub Date : 2026-11-01 Epub Date: 2026-09-16 DOI: 10.1115/1.4072676
Botao Zhao, Mojtaba Esfandiari, Teng Long, Yub Heo, Haochen Wei, Adnan Munawar, Peter Gehlbach, Peter Kazanzides, Iulian Iordachita

Maintaining a precise remote center of motion is essential for safe and accurate tool manipulation in retinal microsurgery. However, existing numerical Jacobian identification methods for parallel manipulators often exhibit nonlinear, workspace-dependent inaccuracies and require frequent recalibration, limiting their reliability and clinical applicability. To address these challenges, this study presents an analytical kinematic framework for a hybrid parallel-serial robot designed for retinal surgery, known as the Steady-Hand Eye Robot (SHER 3.0). Closed-form solutions for forward and inverse kinematics, as well as analytical formulations of the direct and inverse Jacobians, are derived to ensure consistent motion estimation across the workspace. The kinematic performance of SHER 3.0 is analyzed to evaluate the manipulability and workspace efficiency. Building on these models, a model predictive control strategy is implemented on SHER 3.0, which maintains the remote center of motion constraint at the sclerotomy with sub-millimeter accuracy, with a root mean square error of 0.55 ± 0.12 mm, in a pilot study on a teleoperation experiment. Experimental results demonstrate the effectiveness of the proposed analytical models and control framework in enhancing robot motion stability and robustness of the controller in maintaining the remote center of motion constraints, enabling safe robot-assisted retinal microsurgery.

{"title":"Analytical Kinematic Model and RCM Control of a Parallel-Serial Steady-Hand Eye Robot.","authors":"Botao Zhao, Mojtaba Esfandiari, Teng Long, Yub Heo, Haochen Wei, Adnan Munawar, Peter Gehlbach, Peter Kazanzides, Iulian Iordachita","doi":"10.1115/1.4072676","DOIUrl":"https://doi.org/10.1115/1.4072676","url":null,"abstract":"<p><p>Maintaining a precise remote center of motion is essential for safe and accurate tool manipulation in retinal microsurgery. However, existing numerical Jacobian identification methods for parallel manipulators often exhibit nonlinear, workspace-dependent inaccuracies and require frequent recalibration, limiting their reliability and clinical applicability. To address these challenges, this study presents an analytical kinematic framework for a hybrid parallel-serial robot designed for retinal surgery, known as the Steady-Hand Eye Robot (SHER 3.0). Closed-form solutions for forward and inverse kinematics, as well as analytical formulations of the direct and inverse Jacobians, are derived to ensure consistent motion estimation across the workspace. The kinematic performance of SHER 3.0 is analyzed to evaluate the manipulability and workspace efficiency. Building on these models, a model predictive control strategy is implemented on SHER 3.0, which maintains the remote center of motion constraint at the sclerotomy with sub-millimeter accuracy, with a root mean square error of 0.55 ± 0.12 mm, in a pilot study on a teleoperation experiment. Experimental results demonstrate the effectiveness of the proposed analytical models and control framework in enhancing robot motion stability and robustness of the controller in maintaining the remote center of motion constraints, enabling safe robot-assisted retinal microsurgery.</p>","PeriodicalId":49155,"journal":{"name":"Journal of Mechanisms and Robotics-Transactions of the Asme","volume":"18 11","pages":""},"PeriodicalIF":3.2,"publicationDate":"2026-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13656171/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149185595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Strong evasive backdoor attacks and an ensemble defense
IF 2 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2026-10-20 Epub Date: 2026-10-08 DOI: 10.4218/etrij.2026-0167
Guangmingmei Yang, George Kesidis, David Jonathan Miller

Various defenses have been proposed to counter backdoors in deep neural network classifiers, but due to the diverse mechanisms through which backdoor triggers can be incorporated into data samples, no single defense is universally effective. We introduce an ensemble defense that consolidates the complementary strengths of individual detectors, making the detection system more backdoor mechanism-agnostic, and also providing backdoor inversion, which offers insights into the nature of the detected attack. Our ensemble defense achieves superior detection performance and more robust, accurate backdoor inversion compared to individual detectors. We also employ mixed clean/dirty-label backdoor poisoning, a recent X-to-X backdoor attack that is more surgical, evasive, and harder to detect than traditional dirty-label attacks.

{"title":"Strong evasive backdoor attacks and an ensemble defense","authors":"Guangmingmei Yang,&nbsp;George Kesidis,&nbsp;David Jonathan Miller","doi":"10.4218/etrij.2026-0167","DOIUrl":"https://doi.org/10.4218/etrij.2026-0167","url":null,"abstract":"<p>Various defenses have been proposed to counter backdoors in deep neural network classifiers, but due to the diverse mechanisms through which backdoor triggers can be incorporated into data samples, no single defense is universally effective. We introduce an ensemble defense that consolidates the complementary strengths of individual detectors, making the detection system more backdoor mechanism-agnostic, and also providing backdoor inversion, which offers insights into the nature of the detected attack. Our ensemble defense achieves superior detection performance and more robust, accurate backdoor inversion compared to individual detectors. We also employ mixed clean/dirty-label backdoor poisoning, a recent X-to-X backdoor attack that is more surgical, evasive, and harder to detect than traditional dirty-label attacks.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"48 5","pages":"768-782"},"PeriodicalIF":2.0,"publicationDate":"2026-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2026-0167","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149222797","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
E-NASim: A reinforcement-learning-based cyberattack simulation framework with pre-/post-state modeling based on MITRE ATT&CK
IF 2 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2026-10-20 Epub Date: 2026-07-09 DOI: 10.4218/etrij.2025-0365
Ki Jong Koo, Daesung Moon, Byung Chul Kim, Jae Yong Lee

The increasing prevalence of advanced persistent threats and automated cyberattacks highlights the need for proactive cybersecurity strategies. Reinforcement-learning-based autonomous penetration testing has shown promise; however, many existing simulation environments rely on abstract, probability-driven attack models, resulting in limited reproducibility and gaps relative to real-world conditions. This paper presents E-NASim as a reinforcement-learning-based cyberattack simulation framework that explicitly models attack feasibility and system evolution using pre-/post-attack state (PPS) transitions derived from MITRE ATT&CK subtechniques. In E-NASim, attack execution conditions and state transitions are deterministically governed by PPS definitions, whereas reinforcement learning is used to learn effective multistage attack sequencing under fixed constraints. Experimental results demonstrate that E-NASim enables agents to learn coherent and executable multistage attack strategies in complex network environments, providing a practical foundation for automated penetration testing and security evaluation.

{"title":"E-NASim: A reinforcement-learning-based cyberattack simulation framework with pre-/post-state modeling based on MITRE ATT&CK","authors":"Ki Jong Koo,&nbsp;Daesung Moon,&nbsp;Byung Chul Kim,&nbsp;Jae Yong Lee","doi":"10.4218/etrij.2025-0365","DOIUrl":"https://doi.org/10.4218/etrij.2025-0365","url":null,"abstract":"<p>The increasing prevalence of advanced persistent threats and automated cyberattacks highlights the need for proactive cybersecurity strategies. Reinforcement-learning-based autonomous penetration testing has shown promise; however, many existing simulation environments rely on abstract, probability-driven attack models, resulting in limited reproducibility and gaps relative to real-world conditions. This paper presents E-NASim as a reinforcement-learning-based cyberattack simulation framework that explicitly models attack feasibility and system evolution using pre-/post-attack state (PPS) transitions derived from MITRE ATT&amp;CK subtechniques. In E-NASim, attack execution conditions and state transitions are deterministically governed by PPS definitions, whereas reinforcement learning is used to learn effective multistage attack sequencing under fixed constraints. Experimental results demonstrate that E-NASim enables agents to learn coherent and executable multistage attack strategies in complex network environments, providing a practical foundation for automated penetration testing and security evaluation.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"48 5","pages":"936-957"},"PeriodicalIF":2.0,"publicationDate":"2026-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2025-0365","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149222798","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Cross-corruption distillation for robust instruction following under text corruptions
IF 2 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2026-10-20 Epub Date: 2026-09-21 DOI: 10.4218/etrij.2026-0159
Yongjin Bae, Kyoungman Bae

Traditional knowledge distillation transfers information from a large teacher model to a compact student by aligning static output distributions or internal representations for fixed inputs. Such formulations overlook how predictions change in response to input perturbations, even though robustness is critical for deployment. We interpret distillation as the transfer of functional response behavior under input variations and propose cross-corruption distillation (CCD), which aligns corruption-induced differences in teacher and student output via a Kullback–Leibler objective. Rather than matching absolute logits, CCD distills how the teacher redistributes its prediction mass under perturbations, transferring teacher-conditioned input sensitivity without architectural correspondence. On diverse multimodal benchmarks, CCD performs competitively, often outperforming conventional logit-based distillation. It also slows performance degradation as perturbation strength increases and remains stable across corruption strategies and training schedules. These results position CCD as a response-aware distillation framework integrating robustness directly into the distillation objective.

{"title":"Cross-corruption distillation for robust instruction following under text corruptions","authors":"Yongjin Bae,&nbsp;Kyoungman Bae","doi":"10.4218/etrij.2026-0159","DOIUrl":"https://doi.org/10.4218/etrij.2026-0159","url":null,"abstract":"<p>Traditional knowledge distillation transfers information from a large teacher model to a compact student by aligning static output distributions or internal representations for fixed inputs. Such formulations overlook how predictions change in response to input perturbations, even though robustness is critical for deployment. We interpret distillation as the transfer of functional response behavior under input variations and propose cross-corruption distillation (CCD), which aligns corruption-induced differences in teacher and student output via a Kullback–Leibler objective. Rather than matching absolute logits, CCD distills how the teacher redistributes its prediction mass under perturbations, transferring teacher-conditioned input sensitivity without architectural correspondence. On diverse multimodal benchmarks, CCD performs competitively, often outperforming conventional logit-based distillation. It also slows performance degradation as perturbation strength increases and remains stable across corruption strategies and training schedules. These results position CCD as a response-aware distillation framework integrating robustness directly into the distillation objective.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"48 5","pages":"852-867"},"PeriodicalIF":2.0,"publicationDate":"2026-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2026-0159","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149222840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Cross-lingual safety asymmetry in open-weight LLMs
IF 2 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2026-10-20 Epub Date: 2026-09-28 DOI: 10.4218/etrij.2026-0180
Sungwon Chae, Younghwan Gil

Safety alignment in large language models is overwhelmingly trained on English data, yet models are deployed across typologically diverse languages. We evaluate six open-weight large language models (LLMs) across 17 bilingual Korean/Chinese prompt conditions and three translation engines (NLLB-200, Gemini 3.0 Pro, and GPT-5.2), generating 53 040 AdvBench responses. We also conduct French/Spanish and HarmBench robustness checks. The regex classifier is cross-validated against an open-weight LLM judge (Qwen-2.5-72B, � ∼ 7500 judgments), and we report Wilson 95% confidence intervals. Three findings hold for both classifiers: Safety erosion is language-specific, not generically non-English; Chinese-origin models (Yi, InternLM) exhibit asymmetric vulnerability; and a two-tier pattern persists, where models with target-language safety data resist high-quality translations, and models without such safety data remain vulnerable, regardless of translation quality. These findings reframe cross-lingual safety as a per-language training coverage problem.

{"title":"Cross-lingual safety asymmetry in open-weight LLMs","authors":"Sungwon Chae,&nbsp;Younghwan Gil","doi":"10.4218/etrij.2026-0180","DOIUrl":"https://doi.org/10.4218/etrij.2026-0180","url":null,"abstract":"<p>Safety alignment in large language models is overwhelmingly trained on English data, yet models are deployed across typologically diverse languages. We evaluate six open-weight large language models (LLMs) across 17 bilingual Korean/Chinese prompt conditions and three translation engines (NLLB-200, Gemini 3.0 Pro, and GPT-5.2), generating 53 040 AdvBench responses. We also conduct French/Spanish and HarmBench robustness checks. The regex classifier is cross-validated against an open-weight LLM judge (Qwen-2.5-72B, \u0000<span></span><math>\u0000 <mo>∼</mo></math> 7500 judgments), and we report Wilson 95% confidence intervals. Three findings hold for both classifiers: Safety erosion is language-specific, not generically non-English; Chinese-origin models (Yi, InternLM) exhibit asymmetric vulnerability; and a two-tier pattern persists, where models with target-language safety data resist high-quality translations, and models without such safety data remain vulnerable, regardless of translation quality. These findings reframe cross-lingual safety as a per-language training coverage problem.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"48 5","pages":"807-819"},"PeriodicalIF":2.0,"publicationDate":"2026-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2026-0180","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149222843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Semantic generalisable multimodal AI generated content detection via mixture of orthogonal decomposition and product manifold disentanglement 基于正交分解和积流形解纠缠的语义泛化多模态人工智能生成内容检测
IF 5.8 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-10-20 DOI: 10.1007/s40747-026-02536-5
Qian Liu, Sonja Schimmler, Manfred Hauswirth
The generalisability of AI-Generated Content (AIGC, e.g., images and videos) detection can be decomposed into two tightly coupled subspaces: a semantic subspace and a forgery subspace. State-of-the-art AIGC detectors primarily focus on enhancing generalisability within the forgery subspace, typically neglecting the influences of the semantic subspace. Moreover, most existing AIGC detection methods consolidate all forged images and videos produced by heterogeneous deepfake generation techniques into a single “fake” class. This design choice overlooks the distinctive characteristics and substantial variability associated with different deepfake generation techniques. To address these limitations, we propose a novel Semantic Generalisable Deepfake Detection (SGDFD) framework that integrates a sparsely gated Mixture of ORthogonal Decomposition (MoORD) architecture. The parameter-efficient fine-tuning strategy based on orthogonal decomposition enhances the generalisation capability of the SGDFD model in AIGC detection, while the MoORD architecture further improves its semantic generalisability. In addition, the SGDFD model learns a product-manifold representation that decomposes the monolithic “fake” class into multiple sub-classes, each corresponding to a distinct deepfake generation method. Extensive experiments conducted on 10 real-world AIGC detection datasets under 3 evaluation protocols demonstrate that the proposed SGDFD model achieves state-of-the-art generalisation performance in AIGC detection across both known and unknown semantic categories.
人工智能生成内容(AIGC,如图像和视频)检测的通用性可以分解为两个紧密耦合的子空间:语义子空间和伪造子空间。现有的AIGC检测器主要关注于增强伪造子空间内的通用性,通常忽略了语义子空间的影响。此外,大多数现有的AIGC检测方法将所有由异构深度伪造生成技术产生的伪造图像和视频合并到单个“假”类中。这种设计选择忽略了与不同深度生成技术相关的独特特征和大量可变性。为了解决这些限制,我们提出了一种新的语义广义深度假检测(SGDFD)框架,该框架集成了稀疏门控的正交分解混合(MoORD)架构。基于正交分解的参数高效微调策略增强了SGDFD模型在AIGC检测中的泛化能力,而MoORD架构进一步提高了其语义泛化能力。此外,SGDFD模型学习了一种积流形表示,该表示将单一的“假”类分解为多个子类,每个子类对应于一个不同的深度假生成方法。在3种评估协议下的10个真实AIGC检测数据集上进行的大量实验表明,所提出的SGDFD模型在已知和未知语义类别的AIGC检测中都实现了最先进的泛化性能。
{"title":"Semantic generalisable multimodal AI generated content detection via mixture of orthogonal decomposition and product manifold disentanglement","authors":"Qian Liu, Sonja Schimmler, Manfred Hauswirth","doi":"10.1007/s40747-026-02536-5","DOIUrl":"https://doi.org/10.1007/s40747-026-02536-5","url":null,"abstract":"The generalisability of AI-Generated Content (AIGC, e.g., images and videos) detection can be decomposed into two tightly coupled subspaces: a semantic subspace and a forgery subspace. State-of-the-art AIGC detectors primarily focus on enhancing generalisability within the forgery subspace, typically neglecting the influences of the semantic subspace. Moreover, most existing AIGC detection methods consolidate all forged images and videos produced by heterogeneous deepfake generation techniques into a single “fake” class. This design choice overlooks the distinctive characteristics and substantial variability associated with different deepfake generation techniques. To address these limitations, we propose a novel Semantic Generalisable Deepfake Detection (SGDFD) framework that integrates a sparsely gated Mixture of ORthogonal Decomposition (MoORD) architecture. The parameter-efficient fine-tuning strategy based on orthogonal decomposition enhances the generalisation capability of the SGDFD model in AIGC detection, while the MoORD architecture further improves its semantic generalisability. In addition, the SGDFD model learns a product-manifold representation that decomposes the monolithic “fake” class into multiple sub-classes, each corresponding to a distinct deepfake generation method. Extensive experiments conducted on 10 real-world AIGC detection datasets under 3 evaluation protocols demonstrate that the proposed SGDFD model achieves state-of-the-art generalisation performance in AIGC detection across both known and unknown semantic categories.","PeriodicalId":10524,"journal":{"name":"Complex & Intelligent Systems","volume":"65 1","pages":""},"PeriodicalIF":5.8,"publicationDate":"2026-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149221441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Adaptive orthogonal role-aware transformer for robust instruction alignment
IF 2 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2026-10-20 Epub Date: 2026-06-24 DOI: 10.4218/etrij.2025-0449
Yeo-Chan Yoon, Sookyun Kim, Gyeongmin Kim

Large language models are vulnerable to prompt injection because transformer attention treats tokens too uniformly across system and user roles. We propose the adaptive orthogonal role-aware transformer (AORT), a lightweight retrofit that improves role-sensitive decoding. AORT preserves the base token embeddings and adds at each transformer layer a learned orthonormal re-encoding and a role-gated additive attention bias to maintain separation between instruction and user representations during context mixing. We evaluate AORT on direct and indirect prompt-injection benchmarks, including the BIPIA-text benchmark. AORT achieves the lowest attack success rate (ASR) in most settings and successfully resists all eight evaluated attacks on LLaMA 3.1–8B. AORT reduces the ASR from 13.6% to 2.1% on LLaMA 3.1–8B evaluated with the BIPIA-text benchmark. These findings indicate that explicit role-priority structure in the forward pass can substantially improve prompt-injection robustness with minimal architectural overhead.

{"title":"Adaptive orthogonal role-aware transformer for robust instruction alignment","authors":"Yeo-Chan Yoon,&nbsp;Sookyun Kim,&nbsp;Gyeongmin Kim","doi":"10.4218/etrij.2025-0449","DOIUrl":"https://doi.org/10.4218/etrij.2025-0449","url":null,"abstract":"<p>Large language models are vulnerable to prompt injection because transformer attention treats tokens too uniformly across system and user roles. We propose the <i>adaptive orthogonal role-aware transformer</i> (AORT), a lightweight retrofit that improves role-sensitive decoding. AORT preserves the base token embeddings and adds at each transformer layer a learned orthonormal re-encoding and a role-gated additive attention bias to maintain separation between instruction and user representations during context mixing. We evaluate AORT on direct and indirect prompt-injection benchmarks, including the <i>BIPIA-text</i> benchmark. AORT achieves the lowest attack success rate (ASR) in most settings and successfully resists all eight evaluated attacks on LLaMA 3.1–8B. AORT reduces the ASR from 13.6% to 2.1% on LLaMA 3.1–8B evaluated with the BIPIA-text benchmark. These findings indicate that explicit role-priority structure in the forward pass can substantially improve prompt-injection robustness with minimal architectural overhead.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"48 5","pages":"924-935"},"PeriodicalIF":2.0,"publicationDate":"2026-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2025-0449","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149222841","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
全部 J. Field Rob. J. Bionic Eng. ACTA INFORM Adv. Rob. AI MAG Ann. Math. Artif. Intell. Appl. Bionics Biomech. APPL INTELL APPL COMPUT ELECTROM APPL ARTIF INTELL Artif. Intell. ARTIF INTELL REV CHEMOMETR INTELL LAB China Commun. CMC-Comput. Mater. Continua Complex Intell. Syst. Comput. Sci. Eng. Commun. ACM COMPUTER Comput. Graphics Forum COMPUTING EMPIR SOFTW ENG Enterp. Inf. Syst. EPJ Data Sci. ETRI J EURASIP J WIREL COMM Evolving Systems FORM METHOD SYST DES Front. Neurorob. FRONT COMPUT SCI-CHI IEEE Trans. Commun. IEEE Trans. Comput. Social Syst. IEEE Trans. Dependable Secure Comput. IEEE Trans. Green Commun. Networking IEEE Trans. Cognit. Commun. Networking IEEE Access IEEE Trans. Comput. IEEE Antennas Propag. Mag. IEEE Micro IEEE Trans. Antennas Propag. IEEE Trans. Control Syst. Technol. IEEE Trans. Big Data IEEE Trans. Cybern. IEEE Internet Comput. IEEE Trans. Affective Comput. IEEE Trans. Emerging Top. Comput. Intell. IEEE SECUR PRIV IEEE Trans. Emerging Top. Comput. IEEE Trans. Aerosp. Electron. Syst. IEEE Trans. Broadcast. IEEE Intell. Syst. IEEE Commun. Lett. IEEE Trans. Autom. Control IEEE Trans. Cloud Comput. IEEE Trans. Evol. Comput. IEEE Trans. Consum. Electron. IEEE Trans. Fuzzy Syst. IEEE Trans. Haptic IEEE Trans. Image Process. IEEE Multimedia IEEE Rob. Autom. Lett. IEEE J. Sel. Areas Commun. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. IETE Tech. Rev. IEEE Trans. Serv. Comput. IEEE Trans. Parallel Distrib. Syst. IEEE Trans. Sustainable Comput. IEEE Trans. Multimedia IEEE Trans. Ind. Inf. IEEE Trans. Neural Networks Learn. Syst. IEEE Trans. Software Eng. IEEE-ACM T AUDIO SPE IEEE Wireless Commun. IEEE Wireless Commun. Lett. IET MICROW ANTENNA P IEEE Trans. Visual Comput. Graphics IEEE Trans. Ind. Electron. IET Optoelectron IEEE Trans. Veh. Technol. IEEE Trans. Netw. Serv. Manage. IEEE Trans. Pattern Anal. Mach. Intell. IEEE Trans. Wireless Commun. IEEE ACM T NETWORK IEEE Trans. Inf. Forensics Secur. IEEE Trans. Inf. Theory IEEE Trans. Knowl. Data Eng. INFORM SYST FRONT INFORMS J COMPUT INFOR Int. J. Comput. Vision Int. J. Approximate Reasoning Int. J. Control Int. J. Commun. Syst. Int. J. Imaging Syst. Technol. Int. J. Fuzzy Syst. Int. J. Intell. Syst. Int. J. Network Manage. Int. J. Parallel Program. Int. J. Social Rob. Int. J. Software Tools Technol. Trans.
﹀
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