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

E-PRedictor: an approach for early prediction of pull request acceptance

Science China(Information Sciences) 2025年第5期68卷 380-395页

作者： Kexing CHEN Lingfeng BAO Xing HU Xin XIA Xiaohu YANG State Key Laboratory of Blockchain and Data Security Zhejiang University Software Engineering Application Technology Lab

A pull request(PR) is an event in Git where a contributor asks project maintainers to review code he/she wants to merge into a project. The PR mechanism greatly improves the efficiency of distributed software development in the opensource community. Nevertheless, the massive number of PRs in an open-source software(OSS) project increases the workload of developers. To reduce the burden on developers, many previous studies have investigated factors that affect the chance of PRs getting accepted and built prediction models based on these factors. However, most prediction models are built on the data after PRs are submitted for a while(e.g., comments on PRs), making them not useful in practice. Because integrators still need to spend a large amount of effort on inspecting PRs. In this study, we propose an approach named E-PRedictor(earlier PR predictor) to predict whether a PR will be merged when it is created. E-PRedictor combines three dimensions of manual statistic features(i.e., contributor profile, specific pull request, and project profile) and deep semantic features generated by BERT models based on the description and code changes of PRs. To evaluate the performance of E-PRedictor, we collect475192 PRs from 49 popular open-source projects on GitHub. The experiment results show that our proposed approach can effectively predict whether a PR will be merged or not. E-PRedictor outperforms the baseline models(e.g., Random Forest and VDCNN) built on manual features significantly. In terms of F1@Merge, F1@Reject, and AUC(area under the receiver operating characteristic curve), the performance of E-PRedictor is 90.1%, 60.5%, and 85.4%, respectively.

关键词： pull request prediction model GitHub

来源：评论

学校读者我要写书评

暂无评论

Threshold Huffman-Based Covert Timing Channel Detection

引用

International Journal of Network security 2025年第1期27卷 61-71页

作者： Lin, Yuwei Chen, Yonghong Zhuang, Xiaolong Huang, Xuwen School of Computer Science and Technology Huaqiao University Fujian Xiamen361000 China Xiamen Key Laboratory of Data Security and Blockchain Technology Huaqiao University Fujian Xiamen361000 China

Network covert timing channels in computer networks evade effective detection by traditional security mechanisms such as firewalls, posing a significant threat to network security. However, most existing methods struggle to detect such channels when the window size is small. Additionally, the emergence of the new ϵ-κlibur channel has resulted in a decline in performance for detection methods such as GAS, SnapCatch, and DNN when detecting this particular channel. In this paper, we investigate a Huffman tree-based approach for detecting anomalous nodes in traffic and achieving the classification of channels through the design of weight intervals. Our method achieves an average detection rate of over 95% for each channel. Additionally, compared to GAS, SnapCatch, and DNN, our method improves the detection rates for the ϵ-κlibur channel by 11.75%, 8.46%, and 4.81%, respectively. The experimental results demonstrate that our proposed approach successfully detects ϵ-κlibur and achieves detection in a small window. © (2025), (Femto Technique Co., Ltd.). All rights reserved.

关键词： Computer system firewalls

来源：评论

学校读者我要写书评

暂无评论

Block-gram:Mining knowledgeable features for efficiently smart contract vulnerability detection

引用

Digital Communications and Networks 2025年第1期11卷 1-12页

作者： Xueshuo Xie Haolong Wang Zhaolong Jian Yaozheng Fang Zichun Wang Tao Li Tianjin Key Laboratory of Network and Data Security Technology TianjinChina College of Computer Science Nankai UniversityTianjinChina Key Laboratory of Blockchain and Cyberspace Governance of Zhejiang Province China State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesChina

Smart contracts are widely used on the blockchain to implement complex transactions,such as decentralized applications on *** vulnerability detection of large-scale smart contracts is critical,as attacks on smart contracts often cause huge economic *** it is difficult to repair and update smart contracts,it is necessary to find the vulnerabilities before they are ***,code analysis,which requires traversal paths,and learning methods,which require many features to be trained,are too time-consuming to detect large-scale on-chain ***-based methods will obtain detection models from a feature space compared to code analysis methods such as symbol *** the existing features lack the interpretability of the detection results and training model,even worse,the large-scale feature space also affects the efficiency of *** paper focuses on improving the detection efficiency by reducing the dimension of the features,combined with expert *** this paper,a feature extraction model Block-gram is proposed to form low-dimensional knowledge-based features from ***,the metadata is separated and the runtime code is converted into a sequence of opcodes,which are divided into segments based on some instructions(jumps,etc.).Then,scalable Block-gram features,including 4-dimensional block features and 8-dimensional attribute features,are mined for the learning-based model ***,feature contributions are calculated from SHAP values to measure the relationship between our features and the results of the detection *** addition,six types of vulnerability labels are made on a dataset containing 33,885 contracts,and these knowledge-based features are evaluated using seven state-of-the-art learning algorithms,which show that the average detection latency speeds up 25×to 650×,compared with the features extracted by N-gram,and also can enhance the interpretability of the detection model.

关键词： Smart contract Bytecode&opcode Knowledgeable features Vulnerability detection Feature contribution

来源：评论

学校读者我要写书评

暂无评论

Defending data Inference Attacks Against Machine Learning Models by Mitigating Prediction Distinguishability

引用

IEEE Transactions on Dependable and Secure Computing 2025年第3期22卷 2687-2704页

作者： Yang, Ziqi Zhu, Yiran Wan, Jie Xiang, ChuXiao Tang, Tong Wang, Yilin Xu, Ruite Wang, Lijin Zhang, Fan Xu, Jiarong Qin, Zhan Zhejiang University State Key Laboratory of Blockchain and Data Security Hangzhou310027 China Institute of Blockchain and Data Security Hangzhou310027 China Zhejiang University College of Computer Science and Technology Hangzhou310027 China Fudan University Department of Information Management and Business Intelligence Shanghai200437 China

Neural networks are vulnerable to data inference attacks, including the membership inference attack, the model inversion attack, and the attribute inference attack. In this paper, we propose PURIFIER to defend against membership inference attacks by quantifying the differences between dataset members and non-members in three dimensions: individual shape, statistical distribution, and prediction label. PURIFIER involves transforming the confidence scores produced by the target classifier, resulting in purified confidence scores that are indistinguishable across the dimensions above. We conduct experiments on widely-used datasets and models. The results show that Purifier offers robust defense against membership inference attacks with superior efficacy compared to prior defense techniques while maintaining minimal utility degradation (e.g., less than 0.7% classification accuracy drop of most datasets). Additionally, our extended experiments explore the effectiveness of PURIFIER in defending against the model inversion attack and the attribute inference attack. © 2004-2012 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Interaction Confidence Attention for Human–Object Interaction Detection

引用

International Journal of Computer Vision 2025年 1-20页

作者： Zhang, Hong-Bo Lin, Wang-Kai Su, Hang Lei, Qing Liu, Jing-Hua Du, Ji-Xiang Department of Computer Science and Technology Huaqiao University Xiamen361021 China Fujian Key Laboratory of Big Data Intelligence and Security Huaqiao University Xiamen361021 China Xiamen Key Laboratory of Computer Vision and Pattern Recognition Huaqiao University Xiamen361021 China Fujian Province University Xiamen361021 China

In human–object interaction (HOI) detection task, ensuring that interactive pairs receive higher attention weights while reducing the weight of non-interaction pairs is imperative for enhancing HOI detection accuracy. Guiding attention learning is also a key aspect of existing transformer-based algorithms. To tackle this challenge, this study proposes a novel approach termed Interaction Confidence Score Learning Attention (ICSLA), which introduces weakening and augmentation operations into the original attention weight calculation and feature extraction processes. In ICSLA, feature learning is coupled with confidence score learning, simultaneously. Leveraging ICSLA, a new and universal decoder is devised, establishing a transformer-based one-stage HOI detection architecture. Experimental results demonstrate the effectiveness of the proposed method in improving HOI detection accuracy, offering valuable insights for further optimization of attention mechanisms. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Augmentation operation Human–object interaction detection Interaction confidence score learning attention Weakening operation

来源：评论

学校读者我要写书评

暂无评论

GoPIM: GCN-Oriented Pipeline Optimization for PIM Accelerators 31

GoPIM: GCN-Oriented Pipeline Optimization for PIM Accelerato...

引用

31st IEEE International Symposium on High Performance Computer Architecture, HPCA 2025

作者： Yang, Siling He, Shuibing Wang, Wenjiong Yin, Yanlong Wu, Tong Chen, Weijian Zhang, Xuechen Sun, Xian-He Feng, Dan The State Key Laboratory of Blockchain and Data Security Zhejiang University China Zhejiang Lab China Institute of Blockchain and Data Security China Zhejiang Key Laboratory of Big Data Intelligent Computing China Washington State University Vancouver United States Illinois Institute of Technology United States Huazhong University of Science and Technology China Wuhan National Laboratory for Optoelectronics China

ISBN: (纸本)9798331506476

Graph convolutional networks (GCNs) are popular for a variety of graph learning tasks. ReRAM-based processing-in-memory (PIM) accelerators are promising to expedite GCN training owing to their in-situ computing capability. However, existing accelerators can be severely underutilized even with pipelines, due to the oversight of the skewed execution times of various GCN stages and the ignorance of skewed degrees of graph vertices. In this work, we propose GOPIM, a GCN-oriented pipeline optimization for PIM accelerators to expedite GCN training. First, GOPIM proposes an ML-based scheme that allocates crossbar resources to the most needed stages to streamline the overall pipeline. Second, GOPIM utilizes a selective vertex updating technique that evenly distributes vertices on crossbars by interleaved mapping. These techniques collectively reduce the overall execution time without losing much accuracy. We also provide a practical architecture design for GOPIM. Our experimental results show that, GoPIM achieves up to 191 × speedup and 16.1 × energy saving, compared to the state-of-the-art work. © 2025 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

MagShadow: Physical Adversarial Example Attacks via Electromagnetic Injection

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Liu, Ziwei Lin, Feng Ba, Zhongjie Lu, Li Ren, Kui Zhejiang University State Key Laboratory of Blockchain and Data Security School of Cyber Science and Technology China Institute of Blockchain and Data Security Hangzhou China

Physical adversarial examples (AEs) have become an increasing threat to deploying deep neural network (DNN) models in the real world. Popular approaches adopt sticking-based or projecting-based strategies that stick the printed adversarial patches to objects or directly project the AE onto objects. Although effective, these methods require access to target objects and generate visible artifacts, which reduces the attack's stealthiness. In this paper, we propose MagShadow, a new attack vector that leverages imperceptible electromagnetic (EM) signals to realize physical AEs. MagShadow utilizes the CCD camera sensor's susceptibility to EM injection attacks and induces fine-grained adversarial perturbations on the camera's captured image by injecting carefully-crafted signals with a low-cost portable device. As MagShadow directly manipulates the image sensor's output with EM signals, the attack requires no access to the target object and can keep stealthy. We study the feasibility of MagShadow in two typical DNN application scenarios (image classification and object detection) and design a framework to implement four different types of attacks, i.e., untargeted, targeted, hiding, and appearing attacks. Extensive real-world experiments on five different cameras are conducted, which demonstrate MagShadow's effectiveness against different popular DNN models (Inception v3, ResNet101, YOLO v3/v4). © 2004-2012 IEEE.

关键词： CCD cameras

来源：评论

学校读者我要写书评

暂无评论

How Do Recommendation Models Amplify Popularity Bias? An Analysis from the Spectral Perspective 25

How Do Recommendation Models Amplify Popularity Bias? An Ana...

引用

18th ACM International Conference on Web Search and data Mining, WSDM 2025

作者： Lin, Siyi Gao, Chongming Chen, Jiawei Zhou, Sheng Hu, Binbin Feng, Yan Chen, Chun Wang, Can Zhejiang University Hangzhou China University of Science and Technology of China Hefei China Ant Group Hangzhou China State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China College of Computer Science and Technology Zhejiang University Hangzhou China Institute of Blockchain and Data Security Zhejiang University Hangzhou China

ISBN: (纸本)9798400713293

Recommendation Systems (RS) are often plagued by popularity bias. When training a recommendation model on a typically long-tailed dataset, the model tends to not only inherit this bias but often exacerbate it, resulting in over-representation of popular items in the recommendation lists. This study conducts comprehensive empirical and theoretical analyses to expose the root causes of this phenomenon, yielding two core insights: 1) Item popularity is memorized in the principal spectrum of the score matrix predicted by the recommendation model;2) The dimension reduction phenomenon amplifies the relative prominence of the principal spectrum, thereby intensifying the popularity bias. Building on these insights, we propose a novel debiasing strategy that leverages a spectral norm regularizer to penalize the magnitude of the principal singular value. We have developed an efficient algorithm to expedite the calculation of the spectral norm by exploiting the spectral property of the score matrix. Extensive experiments across seven real-world datasets and three testing paradigms have been conducted to validate the superiority of the proposed method. © 2025 Copyright held by the owner/author(s).

关键词： popularity bias

来源：评论

学校读者我要写书评

暂无评论

Protecting Your Voice: Temporal-aware Robust Watermarking

arXiv

引用

arXiv 2025年

作者： Li, Yue Liu, Weizhi Lin, Dongdong College of Computer Science and Technology National Huaqiao University Xiamen361021 China Xiamen Key Laboratory of Data Security and Blockchain Technology Xiamen361021 China

The rapid advancement of generative models has led to the synthesis of real-fake ambiguous voices. To erase the ambiguity, embedding watermarks into the frequency-domain features of synthesized voices has become a common routine. However, the robustness achieved by choosing the frequency domain often comes at the expense of fine-grained voice features, leading to a loss of fidelity. Maximizing the comprehensive learning of time-domain features to enhance fidelity while maintaining robustness, we pioneer a temporal-aware robust watermarking (True) method for protecting the speech and singing voice. For this purpose, the integrated content-driven encoder is designed for watermarked waveform reconstruction, which is structurally lightweight. Additionally, the temporal-aware gated convolutional network is meticulously designed to bit-wise recover the watermark. Comprehensive experiments and comparisons with existing state-of-the-art methods have demonstrated the superior fidelity and vigorous robustness of the proposed True achieving an average PESQ score of 4.63. Copyright © 2025, The Authors. All rights reserved.

关键词： Bode diagrams

来源：评论

学校读者我要写书评

暂无评论

Sequential Indifferentiability of 7-Round Misty Structures

Sequential Indifferentiability of 7-Round Misty Structures

引用

Cryptographers’ Track at the RSA Conference, CT-RSA 2025

作者： Ai, Jiayi Guo, Chun School of Cyber Science and Technology Shandong University Qingdao China The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Key Laboratory of Cryptologic Technology and Information Security of Ministry of Education Shandong University Shandong Qingdao266237 China Shandong Research Institute of Industrial Technology Shandong Jinan250102 China

ISBN: (纸本)9783031886607

We investigate the Misty structure with respect to the security notion of sequential indifferentiability of Mandal et al. (TCC 2012). As our main result, we prove sequential indifferentiability for 7-round Misty structures using seven independent random permutations in the rounds. We also prove insecurity for 5 rounds by exhibiting an attack. Our main result implies known-key security of 7 rounds in the sense of correlation intractability, providing the first known-key security results on Misty structures to our knowledge. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：