检索结果-内蒙古大学图书馆

31st International Conference on Computational Linguistics, COLING 2025

作者： Cao, Liuwen He, Hongkui Huang, Hailin Wang, Jiexin Cai, Yi School of Software Engineering South China University of Technology China Key Laboratory of Big Data and Intelligent Robot South China University of Technology Ministry of Education China

ISBN: (纸本)9798891761964

Automatic code summarization aims to generate concise natural language descriptions (summary) for source code, which can free software developers from the heavy burden of manual commenting and software maintenance. Existing methods focus on learning a direct mapping from pure code to summaries, overlooking the significant heterogeneity gap between code and summary. Moreover, existing methods lack a human-like re-check process to evaluate whether the generated summaries match well with the code. To address these two limitations, we introduce RBCoSum, a novel framework that incorporates the generated Chain Of Comments (COC) as auxiliary intermediate information for the model to bridge the gap between code and summaries. Also, we propose a rethinking process where a learned ranker trained on our constructed ranking dataset scores the extent of matching between the generated summary and the code, selecting the highest-scoring summary to achieve a re-check process. We conduct extensive experiments to evaluate our approach and compare it with other automatic code summarization models as well as multiple code Large Language Models (LLMs). The experimental results show that RBCoSum is effective and outperforms baselines by a large margin. The human evaluation also proves the summaries generated with RBCoSum are more natural, informative, useful, and truthful. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Enhancing Adversarial Example Transferability via Regularized Constrained Feature Layer

引用

Computers, Materials & Continua 2025年第4期83卷 157-175页

作者： Xiaoyin Yi Long Chen Jiacheng Huang Ning Yu Qian Huang School of Computer Science and Technology Chongqing University of Posts and TelecommunicationsChongqing400065China Chongqing Key Laboratory of Public Big Data Security Technology Chongqing401420China School of Cyber Security and Information Law Chongqing University of Posts and TelecommunicationsChongqing400065China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of EducationChongqing400065China Artificial Intelligence and Big Data College Chongqing Polytechnic University of Electronic TechnologyChongqing401331China

Transfer-based Adversarial Attacks(TAAs)can deceive a victim model even without prior *** is achieved by leveraging the property of adversarial *** is,when generated from a surrogate model,they retain their features if applied to other models due to their good ***,adversarial examples often exhibit overfitting,as they are tailored to exploit the particular architecture and feature representation of source ***,when attempting black-box transfer attacks on different target models,their effectiveness is *** solve this problem,this study proposes an approach based on a Regularized Constrained Feature Layer(RCFL).The proposed method first uses regularization constraints to attenuate the initial examples of low-frequency *** are then added to a pre-specified layer of the source model using the back-propagation technique,in order to modify the original adversarial ***,a regularized loss function is used to enhance the black-box transferability between different target *** proposed method is finally tested on the ImageNet,CIFAR-100,and Stanford Car datasets with various target models,The obtained results demonstrate that it achieves a significantly higher transfer-based adversarial attack success rate compared with baseline techniques.

关键词： Adversarial examples black-box transferability regularized constrained transfer-based adversarial attacks

来源：评论

学校读者我要写书评

暂无评论

Improved quantum image weighted average filtering algorithm

引用

Quantum Information Processing 2025年第5期24卷 1-24页

作者： Yuan, Suzhen Li, Xianli Yinxia, Shu Qing, Xianrong Deng, Jermiah D. College of Opto Electronic Engineering Chongqing University of Posts and Telecommunications Chongqing Chongqing400065 China School of Computing University of Otago Dunedin Dunedin9054 New Zealand School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing Chongqing400065 China Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Big Data Intelligent Computing Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing Chongqing400065 China

Average filtering plays a vital role in image smoothing tasks. However, existing quantum image weighted average filtering methods suffer from high circuit complexity. Therefore, this paper proposes an improved quantum color image weighted average filtering algorithm and its corresponding quantum circuit. First, we improve the quantum circuit to prepare classical color images into a quantum state. Then, an improved quantum divider is developed, and a weighted average filter is constructed using basic quantum image processing modules. Next, to enhance the universality of the filter, a quantum comparator with lower circuit complexity is used to design a noise detection module for distinguishing noise from real signals. Finally, a quantum circuit for color image weighted average filtering is designed, and simulations are conducted on the IBM Quantum Experience (IBM Q) platform to verify the feasibility of our algorithm. The analysis shows that compared with existing methods, this method significantly reduces the circuit complexity and has better filtering performance. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

A numerical magnitude aware multi-channel hierarchical encoding network for math word problem solving

引用

Neural Computing and Applications 2025年第3期37卷 1651-1672页

作者： Xu, Junjie Chen, Yuzhong Xiao, Lingsheng Liao, Hongmiao Zhong, Jiayuan Dong, Chen College of Computer and Data Science Fuzhou University Fujian Province Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fujian Province Fuzhou350108 China

Math word problem (MWP) represents a critical research area within reading comprehension, where accurate comprehension of math problem text is crucial for generating math expressions. However, current approaches still grapple with unresolved challenges in grasping the sensitivity of math problem text and delineating distinct roles across various clause types, and enhancing numerical representation. To address these challenges, this paper proposes a Numerical Magnitude Aware Multi-Channel Hierarchical Encoding Network (NMA-MHEA) for math expression generation. Firstly, NMA-MHEA implements a multi-channel hierarchical context encoding module to learn context representations at three different channels: intra-clause channel, inter-clause channel, and context-question interaction channel. NMA-MHEA constructs hierarchical constituent-dependency graphs for different levels of sentences and employs a Hierarchical Graph Attention Neural Network (HGAT) to learn syntactic and semantic information within these graphs at the intra-clause and inter-clause channels. NMA-MHEA then refines context clauses using question information at the context-question interaction channel. Secondly, NMA-MHEA designs a number encoding module to enhance the relative magnitude information among numerical values and type information of numerical values. Experimental results on two public benchmark datasets demonstrate that NMA-MHEA outperforms other state-of-the-art models. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Gupacker: Generalized Unpacking Framework for Android Malware

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 4338-4352页

作者： Zheng, Tao Hou, Qiyu Chen, Xingshu Ren, Hao Li, Meng Li, Hongwei Shen, Changxiang Sichuan University School of Cyber Science and Engineering Chengdu610065 China Sichuan University School of Cyber Science and Engineering Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province School of Computer Science and Information Engineering Hefei230002 China University of Padua Department of Mathematics HIT Center Padua35131 Italy University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China Sichuan University Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 China

Android malware authors often use packers to evade analysis. Although many unpacking tools have been proposed, they face two significant challenges: 1) They are easily impeded by anti-analysis techniques employed by packers, preventing efficient collection of hidden Dex data. 2) They are typically designed to unpack a specific packer and cannot handle malware packed with mixed packers. Consequently, many packed malware samples evade detection. To bridge this gap, we propose Gupacker , a novel generalized unpacking framework. Gupacker offers a generic solution for first-generation holistic packer by customizing the Android system source code. It identifies the type of packer and selects an appropriate unpacking function, constructs a deeper active call chain to achieve generic unpacking of second-generation function extraction packers, and uses JNI function and instruction monitoring to handle third-generation virtual obfuscation packer. On this basis, we counteract a diverse array of anti-analysis techniques. We conduct extensive experiments on 5K packed Android malware samples, comparing Gupacker with 2 commercial and 4 state-of-the-art academic unpacking tools. The results demonstrate that Gupacker significantly improves the efficiency of Android malware unpacking with acceptable system overhead. We analyze real packed applications based on Gupacker and found several are second-packed by attackers, including WPS for Android, with tens of millions of users. We receive and responsibly report 13 0day vulnerabilities and also assist in the remediation of all vulnerabilities. © 2005-2012 IEEE.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Multitasking Algorithm for Efficient Multiobjective Recommendations

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第3期6卷 518-532页

作者： Tian, Ye Ji, Luke Hu, Yiwei Ma, Haiping Wu, Le Zhang, Xingyi Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230601 China Anhui University Institutes of Physical Science and Information Technology Hefei230601 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei230029 China

Represented by evolutionary algorithms and swarm intelligence algorithms, nature-inspired metaheuristics have been successfully applied to recommender systems and amply demonstrated effectiveness, in particular, for multiobjective recommendation. Owing to the population-based search paradigm, these algorithms can produce a number of recommendation lists, making diverse tradeoffs between multiple metrics and meeting the requirements of accuracy, novelty, diversity, and other user preferences. However, these algorithms are criticized for the low efficiency of the optimization process, especially when the number of users is large. To address this issue, this article proposes an evolutionary multitasking-based recommendation method, where each task corresponds to a user and all the tasks are optimized simultaneously, thus highly improving the efficiency of recommendation. To enhance the convergence speed, all the users are divided into multiple populations according to the similarity between their preferences, where each population evolves with internal knowledge transfer between users, and all the populations evolve with external knowledge transfer between populations. Experimental results on various datasets verify that the proposed method can better balance between multiple metrics than classical and deep neural network-based recommendation methods and exhibits significantly higher efficiency than evolutionary multiobjective optimization-based recommendation methods. © 2024 IEEE. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

GBSVM: An Efficient and Robust Support Vector Machine Framework via Granular-Ball Computing

引用

IEEE Transactions on Neural Networks and Learning Systems 2025年第5期36卷 9253-9267页

作者： Xia, Shuyin Lian, Xiaoyu Wang, Guoyin Gao, Xinbo Chen, Jiancu Peng, Xiaoli Chongqing University of Posts and Telecommunications Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Big Data Intelligent Computing Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing400065 China

Granular-ball support vector machine (GBSVM) is a significant attempt to construct a classifier using the coarse-to-fine granularity of a granular ball as input, rather than a single data point. It is the first classifier whose input contains no points. However, the existing model has some errors, and its dual model has not been derived. As a result, the current algorithm cannot be implemented or applied. To address these problems, we fix the errors of the original model of the existing GBSVM and derive its dual model. Furthermore, a particle swarm optimization (PSO) algorithm is designed to solve the dual problem. The sequential minimal optimization (SMO) algorithm is also carefully designed to solve the dual problem. The latter is faster and more stable. The experimental results on the UCI benchmark datasets demonstrate that GBSVM is more robust and efficient. © 2012 IEEE.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Enhancing graph representation learning via type-aware decoupling and node influence allocation

引用

Applied Intelligence 2025年第6期55卷 1-14页

作者： Zhu, Guochang Hu, Jun Liu, Li Zhang, Qinghua Wang, Guoyin School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongwen Road Chongqing Chongqing400065 China Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongwen Road Chongqing Chongqing400065 China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing400065 China

The traditional graph representation methods can fit the information of graph with low-dimensional vectors, but they cannot interpret their composition, resulting in insufficient security. Graph decoupling, as a method of graph representation, can analyze the latent factors composing the graph representation vectors. However, in current graph decoupling methods, the number of factors is a hyperparameter, and enforce uniform decoupling vector dimensions which leads to information loss or redundancy. To address these issues, we propose a type-aware graph decoupling based on influence called Variational Graph Decoupling Auto-Encoder (VGDAE). It uses node labels as interpretable and objectively existing natural semantics for decoupling and allocates embedding space based on node influence, addressing the issues of manually setting the number of factors in traditional graph decoupling and the mismatch between node information size and embedding space. On the Cora, Citeseer, and fb-CMU datasets, VGDAE shows the impact of different node classes as decoupling targets on classification tasks. Furthermore, we perform visualization of the representations, VGDAE exhibits performance improvements of 2% in classification tasks and 12% in clustering tasks when compared with baseline models. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

Stacking U-Nets in U-shape: Redesigning the Information Flow in Model-based Networks for MRI Reconstruction

Stacking U-Nets in U-shape: Redesigning the Information Flow...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Qiao, Xiaoyu Li, Weisheng Xiao, Bin Huang, Yuping Yang, Lijian Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Cyberspace Big Data Intelligent Security Chongqing University of Posts and Telecommunications Ministry of Education Chongqing China

ISBN: (纸本)9798350368741

Model-based networks have shown convincing performance in MRI reconstruction. However, the unrolled cascades within the networks are constrained to solely obtain information from the preceding counterpart, resulting in potential error accumulation. Moreover, the linear structure fails to address the challenge of recovering fine-grained details. To tackle these problems, we propose to redesign the information flow in model-based networks. Our method features a large U-shaped network, where the nodes are built with unrolled cascades and U-Net-based regularizers. We design an input-level integration module to help the cascades acquire information from adjacent and skip-connected counterparts, building robust mappings to the target. We further design a coarse-to-fine feature-level integration module, aiming at guiding the network to progressively recover fine details. Intermediate reconstructions produced by subnetworks of different scales are integrated, enabling the extraction of complementary information to enhance the final performance. Compared with cutting-edge methods on different datasets, our method exhibits superior performances. © 2025 IEEE.

关键词： compressed sensing deep learning model-based MRI reconstruction U-Net

来源：评论

学校读者我要写书评

暂无评论

Subsampling Decomposition based k-Space Refinement for Accelerated MRI Reconstruction

Subsampling Decomposition based k-Space Refinement for Accel...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

ISBN: (纸本)9798350368741

In accelerated MRI reconstruction problem, directly recovering all the missing k-space data from undersampled measurements is highly ill-posed and often leads to suboptimal performance. To address the problem, we propose a novel deep unfolding network (DUN) with subsampling decomposition (SD) based k-space refinement to mitigate the ill-posedness. Our method employs a parallel network architecture with a primary branch unfolded by gradient descent-inspired optimization process (GD-PB) for reconstruction. Additionally, we introduce an SD-based auxiliary branch (SD-AB) that decompose the inverse problem into moderately corrupted subproblems. We design a novel subsampling mask predictor that captures both global and local spatial correlations in k-space, ensuring the SD-AB effectively preserves the most well-reconstructed subsets as reliable region (RR). The RR in SD-AB is used to periodically refine the intermediate outputs of the GD-PB, achieving improved accuracy. Experimental results reveal that our method significantly outperforms conventional and SD-based DUN techniques, achieving superior PSNR and SSIM results compared with cutting-edge methods. © 2025 IEEE.

关键词： compressed sensing deep unfolded network MRI reconstruction parallel imaging subsampling decomposition

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：