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

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

来源：评论

学校读者我要写书评

暂无评论

An Intelligent Privacy Protection Scheme for Efficient Edge Computation Offloading in IoV

引用

Chinese Journal of Electronics 2024年第4期33卷 910-919页

作者： Liang YAO Xiaolong XU Wanchun DOU Muhammad Bilal School of Software Nanjing University of Information Science and Technology State Key Laboratory for Novel Software Technology Nanjing University Department of Computer and Electronics Systems Engineering Hankuk University of Foreign Studies

As a pivotal enabler of intelligent transportation system(ITS), Internet of vehicles(Io V) has aroused extensive attention from academia and industry. The exponential growth of computation-intensive, latency-sensitive,and privacy-aware vehicular applications in Io V result in the transformation from cloud computing to edge computing,which enables tasks to be offloaded to edge nodes(ENs) closer to vehicles for efficient execution. In ITS environment,however, due to dynamic and stochastic computation offloading requests, it is challenging to efficiently orchestrate offloading decisions for application requirements. How to accomplish complex computation offloading of vehicles while ensuring data privacy remains challenging. In this paper, we propose an intelligent computation offloading with privacy protection scheme, named COPP. In particular, an Advanced Encryption Standard-based encryption method is utilized to implement privacy protection. Furthermore, an online offloading scheme is proposed to find optimal offloading policies. Finally, experimental results demonstrate that COPP significantly outperforms benchmark schemes in the performance of both delay and energy consumption.

关键词： Industries Privacy Energy consumption Transportation Computational efficiency Encryption Protection

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Fatigue reliability assessment of turbine blade via direct probability integral method

引用

Chinese Journal of Aeronautics 2025年第4期38卷 305-320页

作者： Guohai CHEN Pengfei GAO Hui LI Dixiong YANG State Key Laboratory of Structural Analysis Optimization and CAE Software for Industrial EquipmentSchool of Mechanics and Aerospace EngineeringDalian University of TechnologyDalian 116024China

Fatigue analysis of engine turbine blade is an essential *** to various uncertainties during the manufacture and operation,the fatigue damage and life of turbine blade present *** this study,the randomness of structural parameters,working condition and vibration environment are considered for fatigue life predication and reliability ***,the lowcycle fatigue problem is modelled as stochastic static system with random parameters,while the high-cycle fatigue problem is considered as stochastic dynamic system under random ***,to deal with the two failure modes,the novel Direct Probability Integral Method(DPIM)is proposed,which is efficient and accurate for solving stochastic static and dynamic *** probability density functions of accumulated damage and fatigue life of turbine blade for low-cycle and high-cycle fatigue problems are achieved,***,the time–frequency hybrid method is advanced to enhance the computational efficiency for governing equation of ***,the results of typical examples demonstrate high accuracy and efficiency of the proposed method by comparison with Monte Carlo simulation and other *** is indicated that the DPIM is a unified method for predication of random fatigue life for low-cycle and highcycle fatigue *** rotational speed,density,fatigue strength coefficient,and fatigue plasticity index have a high sensitivity to fatigue reliability of engine turbine blade.

关键词： Engine turbine blade Low-cycle fatigue High-cycle fatigue Fatigue reliability Direct probability integral method

来源：评论

学校读者我要写书评

暂无评论

A new discrepancy for sample generation in stochastic response analyses of aerospace problems with uncertain parameters

引用

Chinese Journal of Aeronautics 2024年第12期37卷 192-211页

作者： Feng WU Yuelin ZHAO Yuxiang YANG Xiaopeng ZHANG Ning ZHOU State Key Laboratory of Structural Analysis Optimization and CAE Software for Industrial EquipmentSchool of Mechanics and Aerospace EngineeringDalian University of TechnologyDalian 116024China

Good distribution of samples and weights can improve the computational accuracy and efficiency in the stochastic response analyses of aerospace problems with uncertain *** work proposes a new Generalized L2 Discrepancy based on a General Point(GL2D-GP)for generating samples and their corresponding *** proposed GL2D-GP is an extension of the existing discrepancy by introducing the non-same weights and a smaller box to measure probability *** the GL2D-GP can yield a weight optimization formula that generates a set of optimal non-identical weights for a given sample *** minimizing the GL2D-GP assigned to the set of optimal non-same weights,a new sample and weight generation method is *** the proposed method,the samples can be easily generated in terms of the generalized Halton formula with a series of optimal permutation vectors which are found by the intelligent evolutionary *** the sample set is obtained,the optimal weights can be generated in terms of the weight optimization *** numerical examples are presented to verify the high accuracy,efficiency,and strong robustness of the proposed sample generation method based on GL2D-GP.

关键词： Stochastic systems Aerospace engineering Monte Carlo methods Sample generation Generalized discrepancy Non-same weights

来源：评论

学校读者我要写书评

暂无评论

Planning of DC Electric Spring with Particle Swarm Optimization and Elitist Non-dominated Sorting Genetic Algorithm

引用

CSEE Journal of Power and Energy Systems 2024年第2期10卷 574-583页

作者： Qingsong Wang Siwei Li Hao Ding Ming Cheng Giuseppe Buja School of Electrical Engineering and Jiangsu Provincial Key Laboratory of Smart Grid Technology and Equipment Southeast UniversityNanjing 210096China School of Software Engineering Southeast universitySuzhou 215123China

This paper addresses the planning problem of parallel DC electric springs (DCESs). DCES, a demand-side management method, realizes automatic matching of power consumption and power generation by adjusting non-critical load (NCL) and internal storage. It can offer higher power quality to critical load (CL), reduce power imbalance and relieve pressure on energy storage systems (RESs). In this paper, a planning method for parallel DCESs is proposed to maximize stability gain, economic benefits, and penetration of RESs. The planning model is a master optimization with sub-optimization to highlight the priority of objectives. Master optimization is used to improve stability of the network, and sub-optimization aims to improve economic benefit and allowable penetration of RESs. This issue is a multivariable nonlinear mixed integer problem, requiring huge calculations by using common solvers. Therefore, particle Swarm optimization (PSO) and Elitist non-dominated sorting genetic algorithm (NSGA-II) were used to solve this model. Considering uncertainty of RESs, this paper verifies effectiveness of the proposed planning method on IEEE 33-bus system based on deterministic scenarios obtained by scenario analysis.

关键词： DC distribution network DC electric spring non-dominated sorting genetic algorithm particle swarm optimization renewable energy source

来源：评论

学校读者我要写书评

暂无评论

How far are we to GPT-4V?Closing the gap to commercial multimodal models with open-source suites

引用

Science China(Information Sciences) 2024年第12期67卷 5-22页

作者： Zhe CHEN Weiyun WANG Hao TIAN Shenglong YE Zhangwei GAO Erfei CUI Wenwen TONG Kongzhi HU Jiapeng LUO Zheng MA Ji MA Jiaqi WANG Xiaoyi DONG Hang YAN Hewei GUO Conghui HE Botian SHI Zhenjiang JIN Chao XU Bin WANG Xingjian WEI Wei LI Wenjian ZHANG Bo ZHANG Pinlong CAI Licheng WEN Xiangchao YAN Min DOU Lewei LU Xizhou ZHU Tong LU Dahua LIN Yu QIAO Jifeng DAI Wenhai WANG State Key Laboratory for Novel Software Technology Nanjing University Shanghai AI Laboratory School of Computer Science Fudan University SenseTime Research Department of Information Engineering The Chinese University of Hong Kong Department of Electronic Engineering Tsinghua University

In this paper, we introduce InternVL 1.5, an open-source multimodal large language model(MLLM) to bridge the capability gap between open-source and proprietary commercial models in multimodal understanding. We introduce three simple improvements.(1) Strong vision encoder: we explored a continuous learning strategy for the large-scale vision foundation model — InternViT-6B, boosting its visual understanding capabilities, and making it can be transferred and reused in different LLMs.(2) Dynamic high-resolution: we divide images into tiles ranging from 1 to 40 of 448×448 pixels according to the aspect ratio and resolution of the input images, which supports up to 4K resolution input.(3) High-quality bilingual dataset: we carefully collected a high-quality bilingual dataset that covers common scenes, document images,and annotated them with English and Chinese question-answer pairs, significantly enhancing performance in optical character recognition(OCR) and Chinese-related tasks. We evaluate InternVL 1.5 through a series of benchmarks and comparative studies. Compared to both open-source and proprietary commercial models, InternVL 1.5 shows competitive performance, achieving state-of-the-art results in 8 of 18 multimodal benchmarks. Code and models are available at https://***/OpenGVLab/InternVL.

关键词： multimodal model open-source vision encoder dynamic resolution bilingual dataset

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：