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

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

来源：评论

学校读者我要写书评

暂无评论

Attribute grouping-based naive Bayesian classifier

引用

Science China(Information Sciences) 2025年第3期68卷 125-149页

作者： Yulin HE Guiliang OU Philippe FOURNIER-VIGER Joshua Zhexue HUANG Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ) College of Computer Science & Software Engineering Shenzhen University

The naive Bayesian classifier(NBC) is a supervised machine learning algorithm having a simple model structure and good theoretical interpretability. However, the generalization performance of NBC is limited to a large extent by the assumption of attribute independence. To address this issue, this paper proposes a novel attribute grouping-based NBC(AG-NBC), which is a variant of the classical NBC trained with different attribute groups. AG-NBC first applies a novel effective objective function to automatically identify optimal dependent attribute groups(DAGs). Condition attributes in the same DAG are strongly dependent on the class attribute, whereas attributes in different DAGs are independent of one another. Then,for each DAG, a random vector functional link network with a SoftMax layer is trained to output posterior probabilities in the form of joint probability density estimation. The NBC is trained using the grouping attributes that correspond to the original condition attributes. Extensive experiments were conducted to validate the rationality, feasibility, and effectiveness of AG-NBC. Our findings showed that the attribute groups chosen for NBC can accurately represent attribute dependencies and reduce overlaps between different posterior probability densities. In addition, the comparative results with NBC, flexible NBC(FNBC), tree augmented Bayes network(TAN), gain ratio-based attribute weighted naive Bayes(GRAWNB), averaged one-dependence estimators(AODE), weighted AODE(WAODE), independent component analysis-based NBC(ICA-NBC), hidden naive Bayesian(HNB) classifier, and correlation-based feature weighting filter for naive Bayes(CFW) show that AG-NBC obtains statistically better testing accuracies, higher area under the receiver operating characteristic curves(AUCs), and fewer probability mean square errors(PMSEs) than other Bayesian classifiers. The experimental results demonstrate that AG-NBC is a valid and efficient approach for alleviating the attribute i

关键词： naive Bayesian classifier attribute independence assumption attribute grouping dependent attribute group posterior probability class-conditional probability

来源：评论

学校读者我要写书评

暂无评论

Intelligent Inspection of Electronic Devices in Specific Environments via a Novel Cascade Network of Combining Mixed Sampling and Nonstrided Convolution

引用

IEEE Transactions on Systems, Man, and Cybernetics: Systems 2025年第5期55卷 3287-3299页

作者： Liu, Bo Guo, Jing Wang, Yaowei Yang, Chengrong Nan, Fengtao Yang, Yun Yunnan University School of Software Yunnan Provincial Key Laboratory of Software Engineering Kunming650504 China Northwest A&F University College of Information Engineering Xianyang712100 China

In environments where intelligent video surveillance systems (IVSSs) are deployed, particularly in review room, the detection of electronic devices constitutes a crucial task. Nevertheless, this task presents significant challenges attributed to the high rates of false positives and false negatives in electronic device detection (EDD), compounded by the low resolution of objects when viewed from multiple *** address these challenges, we propose a deep learning-based cascaded detection framework. Specifically, we design a mixed region sampling (MRS) method to enhance the foreground perception with background information and image details. We design a nonstrided downsampling method (ASDP) to map the attention spatial features to depth and improve the detection of low-resolution objects with fine-grained features. We enhance the model’s robustness to different viewing angles by feature perturbation during training. Moreover, we use a cascaded strategy to reduce false positives. To evaluate our method, we construct a real review room dataset (EDD) with 28,000 images from multiple angles. Our method improves the multiview generalization performance by 4.48% mAP and 5.62% mAR. On the public datasets Pascal VOC-2007 and visDrone-2019, our method is also superior to other suboptimal methods. We propose a framework for review environment detection, which is accurate, fast, and generalizable to other scenarios. © 2013 IEEE.

关键词： Feature extraction Reviews Detectors Training Object detection Video surveillance Convolution Cameras Visualization Inspection

来源：评论

学校读者我要写书评

暂无评论

Causal action empowerment for efficient reinforcement learning in embodied agents

引用

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

作者： Hongye CAO Fan FENG Jing HUO Yang GAO National Key Laboratory for Novel Software Technology Nanjing University Department of Electrical Engineering City University of Hong Kong

Reinforcement learning(RL) has been widely adopted for intelligent decision-making in embodied agents due to its effective trial-and-error learning capabilities. However, most RL methods overlook the causal relationships among states and actions during policy exploration and lack the human-like ability to distinguish signal from noise and reason with important abstractions, resulting in poor sample efficiency. To address this issue, we propose a novel method named causal action empowerment(CAE) for efficient RL, designed to improve sample efficiency in policy learning for embodied agents. CAE identifies and leverages causal relationships among states, actions, and rewards to extract controllable state variables and reweight actions for prioritizing high-impact behaviors. Moreover, by integrating a causality-aware empowerment term, CAE significantly enhances an embodied agent's execution of causally-aware behavior for more efficient exploration via boosting controllability in complex embodied environments. Benefiting from these two improvements, CAE bridges the gap between local causal discovery and global causal empowerment. To comprehensively evaluate the effectiveness of CAE, we conduct extensive experiments across 25 tasks in 5 diverse embodied environments, encompassing both locomotion and manipulation skill learning with dense and sparse reward settings. Experimental results demonstrate that CAE consistently outperforms existing methods across this wide range of scenarios, offering a promising avenue for improving sample efficiency in RL.

关键词： reinforcement learning causal empowerment embodied agents sample efficiency

来源：评论

学校读者我要写书评

暂无评论

IPFA-Net: Important Points Feature Aggregating Net for Point Cloud Classification and Segmentation

引用

Chinese Journal of Electronics 2025年第1期34卷 322-337页

作者： Jingya Wang Yu Zhang Bin Zhang Jinxiang Xia Weidong Wang School of Information and Software Engineering University of Electronic Science and Technology of China National Key Laboratory of Automotive Chassis Integration and Bionics Jilin University

This paper focuses on the problems of point cloud deep neural networks in classification and segmentation tasks, including losing important information during down-sampling, ignoring relationships among points when extracting features, and network performance being susceptible to the sparsity of point cloud. To begin with, this paper proposes a farthest point sampling-important points sampling method for down-sampling, which can preserve important information of point clouds and maintain the geometry of input data. Then, the local feature relation aggregating method is proposed for feature extraction, improving the network's ability to learn contextual information and extract rich local region features. Based on these methods, the important points feature aggregating net(IPFA-Net) is designed for point cloud classification and segmentation tasks. Furthermore, this paper proposes the multi-scale multi-density feature connecting method to reduce the negative impact of point cloud data sparsity on network performance. Finally, the effectiveness of IPFA-Net is demonstrated through experiments on ModelNet40, ShapeNet part, and ScanNet v2 datasets. IPFA-Net is robust to reducing the number of point clouds, with only a 3.3% decrease in accuracy under a 16-fold reduction of point number. In the part segmentation experiments, our method achieves the best segmentation performance for five objects.

关键词： Point cloud compression Representation learning Geometry Fuses Semantics Artificial neural networks Feature extraction Sampling methods Robustness Data mining

来源：评论

学校读者我要写书评

暂无评论

Deep learning-based software engineering: progress,challenges, and opportunities

引用

Science China(Information Sciences) 2025年第1期68卷 57-144页

作者： Xiangping CHEN Xing HU Yuan HUANG He JIANG Weixing JI Yanjie JIANG Yanyan JIANG Bo LIU Hui LIU Xiaochen LI Xiaoli LIAN Guozhu MENG Xin PENG Hailong SUN Lin SHI Bo WANG Chong WANG Jiayi WANG Tiantian WANG Jifeng XUAN Xin XIA Yibiao YANG Yixin YANG Li ZHANG Yuming ZHOU Lu ZHANG School of Journalism and Communication Sun Yat-sen University School of Software Technology Zhejiang University School of Software Engineering Sun Yat-sen University School of Software Dalian University of Technology School of Computer Science and Technology Beijing Institute of Technology Key Laboratory of High Confidence Software Technologies (Peking University) Ministry of EducationSchool of Computer Science Peking University State Key Laboratory for Novel Software Technology Nanjing University School of Computer Science and Engineering Beihang University Institute of Information Engineering Chinese Academy of Sciences School of Computer Science Fudan University State Key Laboratory of Complex & Critical Software Environment (CCSE) School of Software Beihang University School of Computer and Information Technology Beijing Jiaotong University School of Computer Science and Technology Harbin Institute of Technology School of Computer Science Wuhan University Huawei Technologies

Researchers have recently achieved significant advances in deep learning techniques, which in turn has substantially advanced other research disciplines, such as natural language processing, image processing, speech recognition, and software engineering. Various deep learning techniques have been successfully employed to facilitate software engineering tasks, including code generation, software refactoring, and fault localization. Many studies have also been presented in top conferences and journals, demonstrating the applications of deep learning techniques in resolving various software engineering tasks. However,although several surveys have provided overall pictures of the application of deep learning techniques in software engineering,they focus more on learning techniques, that is, what kind of deep learning techniques are employed and how deep models are trained or fine-tuned for software engineering tasks. We still lack surveys explaining the advances of subareas in software engineering driven by deep learning techniques, as well as challenges and opportunities in each subarea. To this end, in this study, we present the first task-oriented survey on deep learning-based software engineering. It covers twelve major software engineering subareas significantly impacted by deep learning techniques. Such subareas spread out through the whole lifecycle of software development and maintenance, including requirements engineering, software development, testing, maintenance, and developer collaboration. As we believe that deep learning may provide an opportunity to revolutionize the whole discipline of software engineering, providing one survey covering as many subareas as possible in software engineering can help future research push forward the frontier of deep learning-based software engineering more systematically. For each of the selected subareas,we highlight the major advances achieved by applying deep learning techniques with pointers to the available datasets i

关键词： deep learning software engineering software benchmark software artifact representation survey

来源：评论

学校读者我要写书评

暂无评论

Successive Interference Cancellation-Enabled Timely Status Update in Linear Multi-hop Wireless Networks

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 5298-5311页

作者： Han, Xinhui Pan, Haoyuan Wang, Zhaorui Li, Jianqiang Shenzhen University College of Computer Science and Software Engineering Shenzhen China Future Network of Intelligence Institute The School of Science and Engineering Shenzhen China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology The College of Computer Science and Software Engineering Shenzhen China

We investigate the timely status update in linear multi-hop wireless networks, where a source tries to deliver status update packets to a destination through a sequence of half-duplex relays. Timeliness is measured by the age of information (AoI) metric. Maintaining a low AoI at the destination typically necessitates frequent transmission of update packets from the source. However, high packet transmission frequency in multi-hop scenarios can result in mutual wireless interference at intermediate relays. Specifically, when an intermediate relay receives wireless signals of a new packet from its previous node, simultaneous transmission of an old packet by its subsequent node to the next hop may cause wireless signals to interfere at the intermediate relay, conventionally leading to packet collision. A key motivation to solve this issue is that the intermediate relay has previously received the old packet (which can thus be forwarded to the subsequent node for further relaying). Hence, successive interference cancellation (SIC) can be employed to mitigate interference of the old packet and recover the new packet. This paper designs an SIC-enabled packet relaying scheme tailored to low AoI. Initially focusing on a three-hop network, we subsequently extend our approach to general multi-hop networks. We model the multi-hop relaying scheme using a Markov chain to derive the theoretical average AoI. Theoretical and simulation results indicate that the SIC-enabled packet relaying scheme significantly reduces the average AoI compared to the non-SIC approaches, owing to an increased packet transmission frequency at the source and the effectiveness of SIC techniques at the relays. © 2002-2012 IEEE.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

A multi-projection recurrent model for hypernym detection and discovery

引用

Frontiers of Computer Science 2025年第4期19卷 29-42页

作者： Xuefeng ZHANG Junfan CHEN Zheyan LUO Yuhang BAI Chunming HU Richong ZHANG School of Computer Science and Engineering Beihang UniversityBeijing 100191China School of Software Beihang UniversityBeijing 100191China Zhongguancun Laboratory Beijing 100094China

Hypernym detection and discovery are fundamental tasks in natural language *** former task aims to identify all possible hypernyms of a given hyponym term,whereas the latter attempts to determine whether the given two terms hold a hypernymy relation or *** research on hypernym detection and discovery tasks projects a term into various semantic spaces with single mapping *** their success,these methods may not be adequate in capturing complex semantic relevance between hyponym/hypernymy pairs in two ***,they may fall short in modeling the hierarchical structure in the hypernymy relations,which may help them learn better term ***,the polysemy phenomenon that hypernyms may express distinct senses is *** this paper,we propose a Multi-Projection Recurrent model(MPR)to simultaneously capture the hierarchical relationships between terms and deal with diverse senses caused by the polysemy ***,we build a multi-projection mapping block to deal with the polysemy phenomenon,which learns various word senses by multiple ***,we adopt a hierarchy-aware recurrent block with the recurrent operation followed by a multi-hop aggregation module to capture the hierarchical structure of hypernym *** on 11 benchmark datasets in various task settings illustrate that our multi-projection recurrent model outperforms the *** experimental analysis and case study demonstrate that our multi-projection module and the recurrent structure are effective for hypernym detection and discovery tasks.

关键词： natural language processing hypernym detection recurrent model

来源：评论

学校读者我要写书评

暂无评论

AsyCo: an asymmetric dual-task co-training model for partial-label learning

引用

Science China(Information Sciences) 2025年第5期68卷 332-347页

作者： Beibei LI Yiyuan ZHENG Beihong JIN Tao XIANG Haobo WANG Lei FENG College of Computer Science Chongqing University State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences School of Software Technology Zhejiang University School of Computer Science and Engineering Nanyang Technological University

Partial-label learning(PLL) is a typical problem of weakly supervised learning, where each training instance is annotated with a set of candidate labels. Self-training PLL models achieve state-of-the-art performance but suffer from error accumulation problems caused by mistakenly disambiguated instances. Although co-training can alleviate this issue by training two networks simultaneously and allowing them to interact with each other, most existing co-training methods train two structurally identical networks with the same task, i.e., are symmetric, rendering it insufficient for them to correct each other due to their similar limitations. Therefore, in this paper, we propose an asymmetric dual-task co-training PLL model called AsyCo,which forces its two networks, i.e., a disambiguation network and an auxiliary network, to learn from different views explicitly by optimizing distinct tasks. Specifically, the disambiguation network is trained with a self-training PLL task to learn label confidence, while the auxiliary network is trained in a supervised learning paradigm to learn from the noisy pairwise similarity labels that are constructed according to the learned label confidence. Finally, the error accumulation problem is mitigated via information distillation and confidence refinement. Extensive experiments on both uniform and instance-dependent partially labeled datasets demonstrate the effectiveness of AsyCo.

关键词： machine learning weakly supervised learning partial-label learning co-training models candidate label sets

来源：评论

学校读者我要写书评

暂无评论

GTE: learning code AST representation efficiently and effectively

引用

Science China(Information Sciences) 2025年第3期68卷 393-394页

作者： Yihao QIN Shangwen WANG Bo LIN Kang YANG Xiaoguang MAO College of Computer Science and Technology National University of Defense Technology Key Laboratory of Software Engineering for Complex Systems National University of Defense Technology

With the development of deep learning in recent years, code representation learning techniques have become the foundation of many software engineering tasks such as program classification [1] and defect detection. Earlier approaches treat the code as token sequences and use CNN, RNN, and the Transformer models to learn code representations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：