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

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

来源：评论

学校读者我要写书评

暂无评论

Deep learning-based open API recommendation for Mashup development

引用

Science China(Information Sciences) 2023年第7期66卷 94-111页

作者： Ye WANG Junwu CHEN Qiao HUANG Xin XIA Bo JIANG School of Computer and Information Engineering Zhejiang Gongshang University Software Engineering Application Technology Lab

Mashup developers often need to find open application programming interfaces(APIs) for their composition application development. Although most enterprises and service organizations have encapsulated their businesses or resources online as open APIs, finding the right high-quality open APIs is not an easy task from a library with several open APIs. To solve this problem, this paper proposes a deep learning-based open API recommendation(DLOAR) approach. First, the hierarchical density-based spatial clustering of applications with a noise topic model is constructed to build topic models for Mashup clusters. Second,developers' requirement keywords are extracted by the Text Rank algorithm, and the language model is built. Third, a neural network-based three-level similarity calculation is performed to find the most relevant open APIs. Finally, we complement the relevant information of open APIs in the recommended list to help developers make better choices. We evaluate the DLOAR approach on a real dataset and compare it with commonly used open API recommendation approaches: term frequency-inverse document frequency, latent dirichlet allocation, Word2Vec, and Sentence-BERT. The results show that the DLOAR approach has better performance than the other approaches in terms of precision, recall, F1-measure, mean average precision,and mean reciprocal rank.

关键词： Mashup development open API recommendation deep learning neural network service discovery

来源：评论

学校读者我要写书评

暂无评论

A Helmet Detection Algorithm Based on Transformers with Deformable Attention Module

引用

Chinese Journal of Electronics 2025年第1期34卷 229-241页

作者： Songle Chen Hongbo Sun Yuxin Wu Lei Shang Xiukai Ruan Engineering Research Center of Post Big Data Technology and Application of Jiangsu Province Nanjing University of Posts and Telecommunications State Key Lab for Novel Software Technology Nanjing University Institute of Intelligent Locks Wenzhou University

Wearing a helmet is one of the effective measures to protect workers' safety. To address the challenges of severe occlusion, multi-scale, and small target issues in helmet detection, this paper proposes a helmet detection algorithm based on deformable attention transformers. The main contributions of this paper are as follows. A compact end-to-end network architecture for safety helmet detection based on transformers is proposed. It cancels the computationally intensive transformer encoder module in the existing detection transformer(DETR) and uses the transformer decoder module directly on the output of feature extraction for query decoding, which effectively improves the efficiency of helmet detection. A novel feature extraction network named Swin transformer with deformable attention module(DSwin transformer) is proposed. By sparse cross-window attention, it enhances the contextual awareness of multi-scale features extracted by Swin transformer, and keeps high computational efficiency simultaneously. The proposed method generates the query reference points and query embeddings based on the joint prediction probabilities, and selects an appropriate number of decoding feature maps and sparse sampling points for query decoding, which further enhance the inference capability and processing speed. On the benchmark safety-helmet-wearing-dataset(SHWD), the proposed method achieves the average detection accuracy mAP@0.5 of 95.4% with 133.35G floating-point operations per second(FLOPs) and 20 frames per second(FPS), the state-of-the-art method for safety helmet detection.

关键词： Head Accuracy Network architecture Benchmark testing Transformers Feature extraction Safety Decoding Computational efficiency Detection algorithms

来源：评论

学校读者我要写书评

暂无评论

Dual Prompt-Based Few-Shot Learning for Automated Vulnerability Patch Localization 31

Dual Prompt-Based Few-Shot Learning for Automated Vulnerabil...

引用

31st IEEE International Conference on software Analysis, Evolution and Reengineering, SANER 2024

作者： Zhang, Junwei Hu, Xing Bao, Lingfeng Xia, Xin Li, Shanping Zhejiang University The State Key Laboratory of Blockchain and Data Security Hangzhou China Software Engineering Application Technology Lab Huawei China

ISBN: (纸本)9798350330663

Vulnerabilities are disclosed with corresponding patches so that users can remediate them in time. However, there are instances where patches are not released with the disclosed vulnerabilities, causing hidden dangers, especially if dependent software remains uninformed about the affected code repository. Hence, it is crucial to automatically locate security patches for disclosed vulnerabilities among a multitude of commits. Despite the promising performance of existing learning-based localization approaches, they still suffer from the following limitations: (1) They cannot perform well in data scarcity scenarios. Most neural models require extensive datasets to capture the semantic correlations between the vulnerability description and code commits, while the number of disclosed vulnerabilities with patches is limited. (2) They struggle to capture the deep semantic correlations between the vulnerability description and code commits due to inherent differences in semantics and characters between code changes and commit messages. It is difficult to use one model to capture the semantic correlations between vulnerability descriptions and code commits. To mitigate these two limitations, in this paper, we propose a novel security patch localization approach named Prom VPat, which utilizes the dual prompt tuning channel to capture the semantic correlation between vulnerability descriptions and commits, especially in data scarcity (i.e., few-shot) scenarios. We first input the commit message and code changes with the vulnerability description into the prompt generator to generate two new inputs with prompt templates. Then, we adopt a pre-trained language model (i.e., PLM) as the encoder, utilize the prompt tuning method to fine-tune the encoder, and generate two correlation probabilities as the semantic features. In addition, we extract 26 handcrafted features from the vulnerability descriptions and the code commits. Finally, we utilize the attention mechanism to fuse the

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Investigating White-Box Attacks for On-Device Models 24

Investigating White-Box Attacks for On-Device Models

引用

44th ACM/IEEE International Conference on software engineering, ICSE 2024

作者： Zhou, Mingyi Gao, Xiang Wu, Jing Liu, Kui Sun, Hailong Li, Li Monash University MelbourneVIC Australia Beihang University Beijing China Huawei Software Engineering Application Technology Lab China Beihang University Beijing China Yunnan Key Laboratory of Software Engineering China

ISBN: (纸本)9798400702174

Numerous mobile apps have leveraged deep learning capabilities. However, on-device models are vulnerable to attacks as they can be easily extracted from their corresponding mobile apps. Although the structure and parameters information of these models can be accessed, existing on-device attacking approaches only generate black-box attacks (i.e., indirect white-box attacks), which are less effective and efficient than white-box strategies. This is because mobile deep learning (DL) frameworks like TensorFlow Lite (TFLite) do not support gradient computing (referred to as non-debuggable models), which is necessary for white-box attacking algorithms. Thus, we argue that existing findings may underestimate the harm-fulness of on-device attacks. To validate this, we systematically analyze the difficulties of transforming the on-device model to its debuggable version and propose a Reverse engineering framework for On-device Models (REOM), which automatically reverses the compiled on-device TFLite model to its debuggable version, enabling attackers to launch white-box attacks. Our empirical results show that our approach is effective in achieving automated transformation (i.e., 92.6%) among 244 TFLite models. Compared with previous attacks using surrogate models, REOM enables attackers to achieve higher attack success rates (10.23%→89.03%) with a hun-dred times smaller attack perturbations (1.0→0.01). Our findings emphasize the need for developers to carefully consider their model deployment strategies, and use white-box methods to evaluate the vulnerability of on-device models. Our artifacts11https://***/zhoumingyi/REOM are available. © 2024 ACM.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Practical Program Repair via Preference-based Ensemble Strategy 24

Practical Program Repair via Preference-based Ensemble Strat...

引用

46th IEEE/ACM International Conference on software engineering, ICSE 2024

作者： Zhong, Wenkang Xu, Tongtong Li, Chuanyi Ge, Jidong Liu, Kui Bissyandé, Tegawendé F. Luo, Bin Ng, Vincent National Key Laboratory for Novel Software Technology Nanjing University Nanjing China Huawei Software Engineering Application Technology Lab Hangzhou China University of Luxembourg Luxembourg Human Language Technology Research Institute University of Texas at Dallas RichardsonTX United States

ISBN: (纸本)9798400702174

To date, over 40 Automated Program Repair (APR) tools have been designed with varying bug-fixing strategies, which have been demonstrated to have complementary performance in terms of being effective for different bug classes. Intuitively, it should be feasible to improve the overall bug-fixing performance of APR via assembling existing tools. Unfortunately, simply invoking all available APR tools for a given bug can result in unacceptable costs on APR execution as well as on patch validation (via expensive testing). Therefore, while assembling existing tools is appealing, it requires an efficient strategy to reconcile the need to fix more bugs and the requirements for practicality. In light of this problem, we propose a Preference-based Ensemble Program Repair framework (P-EPR), which seeks to effectively rank APR tools for repairing different bugs. P-EPR is the first non-learning-based APR ensemble method that is novel in its exploitation of repair patterns as a major source of knowledge for ranking APR tools and its reliance on a dynamic update strategy that enables it to immediately exploit and benefit from newly derived repair results. Experimental results show that P-EPR outperforms existing strategies significantly both in flexibility and effectiveness. © 2024 IEEE Computer Society. All rights reserved.

关键词： Well testing

来源：评论

学校读者我要写书评

暂无评论

PS3: Precise Patch Presence Test Based on Semantic Symbolic Signature 24

PS3: Precise Patch Presence Test Based on Semantic Symbolic ...

引用

44th ACM/IEEE International Conference on software engineering, ICSE 2024

作者： Zhan, Qi Hu, Xing Li, Zhiyang Xia, Xin Lo, David Li, Shanping Zhejiang University The State Key Laboratory of Blockchain and Data Security Hangzhou China Zhejiang University Hangzhou China Software Engineering Application Technology Lab Huawei China Singapore Management University Singapore

ISBN: (纸本)9798400702174

During software development, vulnerabilities have posed a significant threat to users. Patches are the most effective way to combat vulnerabilities. In a large-scale software system, testing the presence of a security patch in every affected binary is crucial to ensure system security. Identifying whether a binary has been patched for a known vulnerability is challenging, as there may only be small differences between patched and vulnerable versions. Existing approaches mainly focus on detecting patches that are compiled in the same compiler options. However, it is common for developers to compile programs with very different compiler options in different situations, which causes inaccuracy for existing methods. In this paper, we propose a new approach named PS3, referring to precise patch presence test based on semantic-level symbolic signature. PS3 exploits symbolic emulation to extract signatures that are stable under different compiler options. Then PS3 can precisely test the presence of the patch by comparing the signatures between the reference and the target at semantic level. To evaluate the effectiveness of our approach, we constructed a dataset consisting of 3,631 (CVE, binary) pairs of 62 recent CVEs in four C/C++ projects. The experimental results show that PS3 achieves scores of 0.82, 0.97, and 0.89 in terms of precision, recall, and F1 score, respectively. PS3 outperforms the state-of-the-art baselines by improving 33% in terms of F1 score and remains stable in different compiler options. © 2024 ACM.

关键词： software design

来源：评论

学校读者我要写书评

暂无评论

Deep Assessment of Code Review Generation Approaches: Beyond Lexical Similarity

arXiv

引用

arXiv 2025年

作者： Jiang, Yanjie Liu, Hui Chen, Tianyi Fan, Fu Dong, Chunhao Liu, Kui Zhang, Lu Peking University China Beijing Institute of Technology China Huawei Software Engineering Application Technology Lab China

Code review is a standard practice for ensuring the quality of software projects, and recent research has focused extensively on automated code review. While significant advancements have been made in generating code reviews, the automated assessment of these reviews remains less explored, with existing approaches and metrics often proving inaccurate. Current metrics, such as BLEU, primarily rely on lexical similarity between generated and reference reviews. However, such metrics tend to underestimate reviews that articulate the expected issues in ways different from the references. In this paper, we explore how semantic similarity between generated and reference reviews can enhance the automated assessment of code reviews. We first present a benchmark called GradedReviews, which is constructed by collecting real-world code reviews from open-source projects, generating reviews using state-of-the-art approaches, and manually assessing their quality. We then evaluate existing metrics for code review assessment using this benchmark, revealing their limitations. To address these limitations, we propose two novel semantic-based approaches for assessing code reviews. The first approach involves converting both the generated review and its reference into digital vectors using a deep learning model and then measuring their semantic similarity through Cosine similarity. The second approach generates a prompt based on the generated review and its reference, submits this prompt to ChatGPT, and requests ChatGPT to rate the generated review according to explicitly defined criteria. Our evaluation on the GradedReviews benchmark indicates that the proposed semantic-based approaches significantly outperform existing state-of-the-art metrics in assessing generated code review, improving the correlation coefficient between the resulting scores and human scores from 0.22 to 0.47. © 2025, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Green Federated Learning over Cloud-RAN with Limited Fronthaul and Quantized Neural Networks 3

Green Federated Learning over Cloud-RAN with Limited Frontha...

引用

3rd IEEE International Mediterranean Conference on Communications and Networking, MeditCom 2023

作者： Wang, Jiali Mao, Yijie Wang, Ting Shi, Yuanming Shanghai Key Lab. of Trustworthy Computing East China Normal University MoE Engineering Research Center of Software/Hardware Co-Design Technology and Application China China

ISBN: (纸本)9798350333732

In this paper, we investigate a green federated learning (FL) framework over cloud radio access network (Cloud-RAN) system that comprises a server, multiple devices and remote radio heads (RRHs). Each device utilizes quantized neural networks (QNNs) and sends quantized model parameters to the server to save energy consumption via RRHs. The server aggregates all the signals to update the global model parameters and broadcasts the updated parameters to the selected devices. In this context, we propose an energy consumption model for the QNN training and communication model over Cloud-RAN. We develop an energy minimization problem based on the proposed energy model. We jointly design fronthaul rate allocation, device transmit power, and precision level of QNNs while ensuring target accuracy, transmit power budget and limited fronthaul capacity. Guided by the convergence analysis, we adopt alternative optimization method to solve the energy minimization problem. The simulation outcomes demonstrate that the FL framework suggested can considerably diminish energy usage in comparison to other traditional methods. This has immense potential in realizing a sustainable and eco-friendly FL over Cloud-RAN. © 2023 IEEE.

关键词： Radio access networks

来源：评论

学校读者我要写书评

暂无评论

Image super‐resolution via dynamic network

引用

CAAI Transactions on Intelligence technology 2024年第4期9卷 837-849页

作者： Chunwei Tian Xuanyu Zhang Qi Zhang Mingming Yang Zhaojie Ju School of Software Northwestern Polytechnical UniversityXi'anChina National Engineering Laboratory for Integrated Aero‐Space‐Ground‐Ocean Big Data Application Technology Xi'anChina Research&Development Institute Northwestern Polytechnical UniversityShenzhenChina School of Economics and Management Harbin Institute of Technology at WeihaiWeihaiChina Tencent AI Lab ShenzhenChina School of Computing University of PortsmouthPortsmouthUK

Convolutional neural networks depend on deep network architectures to extract accurate information for image super‐***,obtained information of these con-volutional neural networks cannot completely express predicted high‐quality images for complex scenes.A dynamic network for image super‐resolution(DSRNet)is presented,which contains a residual enhancement block,wide enhancement block,feature refine-ment block and construction *** residual enhancement block is composed of a residual enhanced architecture to facilitate hierarchical features for image super‐*** enhance robustness of obtained super‐resolution model for complex scenes,a wide enhancement block achieves a dynamic architecture to learn more robust information to enhance applicability of an obtained super‐resolution model for varying *** prevent interference of components in a wide enhancement block,a refine-ment block utilises a stacked architecture to accurately learn obtained ***,a residual learning operation is embedded in the refinement block to prevent long‐term dependency ***,a construction block is responsible for reconstructing high‐quality *** heterogeneous architecture can not only facilitate richer structural information,but also be lightweight,which is suitable for mobile digital *** results show that our method is more competitive in terms of performance,recovering time of image super‐resolution and *** code of DSRNet can be obtained at https://***/hellloxiaotian/DSRNet.

关键词： CNN dynamic network image super‐resolution lightweight network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：