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

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

来源：评论

学校读者我要写书评

暂无评论

A sharding blockchain-based UAV system for search and rescue missions

引用

Frontiers of Computer Science 2025年第3期19卷 103-118页

作者： Xihan ZHANG Jiashuo ZHANG Jianbo GAO Libin XIA Zhi GUAN Hao HU Zhong CHEN School of Computer Science Peking UniversityBeijing 100871China Peking University Chongqing Research Institute of Big Data Chongqing 401329China National Engineering Research Center for Software Engineering Peking UniversityBeijing 100871China State Key Lab for Novel Software Technology Nanjing UniversityNanjing 210023China

Sharding is a promising technique to tackle the critical weakness of scalability in blockchain-based unmanned aerial vehicle(UAV)search and rescue(SAR)*** breaking up the blockchain network into smaller partitions called shards that run independently and in parallel,shardingbased UAV systems can support a large number of search and rescue UAVs with improved scalability,thereby enhancing the rescue ***,the lack of adaptability and interoperability still hinder the application of sharded blockchain in UAV SAR *** refers to making adjustments to the blockchain towards real-time surrounding situations,while interoperability refers to making cross-shard interactions at the mission *** address the above challenges,we propose a blockchain UAV system for SAR missions based on dynamic sharding *** from the benefits in scalability brought by sharding,our system improves adaptability by dynamically creating configurable and mission-exclusive shards,and improves interoperability by supporting calls between smart contracts that are deployed on different *** implement a prototype of our system based on Quorum,give an analysis of the improved adaptability and interoperability,and conduct experiments to evaluate the *** results show our system can achieve the above goals and overcome the weakness of blockchain-based UAV systems in SAR scenarios.

关键词： blockchain sharding unmanned aerial vehicle search and rescue blockchain interoperability

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Isochron-Based Solution to Pursuit–Evasion Games of Two Heterogeneous Players

引用

IEEE Transactions on Automatic Control 2025年第5期70卷 2811-2826页

作者： Li, Shuai Wang, Chen Xie, Guangming Peking University State Key Laboratory of Turbulence and Complex Systems Intelligent Biomimetic Design Lab College of Engineering Beijing100871 China Peking University National Engineering Research Center of Software Engineering Beijing100871 China Peking University Center for Multi-Agent Research Institute for Artificial Intelligence Beijing100871 China

In this article, we study a pursuit–evasion game between two players with heterogeneous kinematics, where the pursuer is with damped double-integrator dynamics and the evader is with single-integrator dynamics. The pursuer aims at capturing the evader as soon as possible, while the evader wants to avoid or delay the capture. Traditional methods to solve pursuit–evasion games rely on the Hamilton–Jacobi–Isaacs (HJI) equations and retrogressive path equations, which are very complicated and nonintuitive, thus failing to obtain a complete solution. To overcome these challenges, we develop an intuitive isochron-based method to thoroughly analyze all possible situations of the game and a concise geometric approach to calculate the optimal strategies, providing a complete solution to this game. Specifically, the isochron-based method effectively leverages three main factors: the players' motion capability, the pursuer's capture capability, and the players' states. Based on these, we analyze the players' superiority and the geometrical features of their isochrones and the intersections, thus acquiring concise conditions that determine the game's outcome. For the success-capture cases, we propose a new geometric approach to calculate the target points of the players and then obtain the closed-loop state feedback optimal pursuit and evasion strategies. We then get the corresponding value function and provide a validation using the HJI equation. For the success-evasion cases, we exploit the intersection of the players' isochrones to design some effective evasion strategies, which ensure that the evader can always avoid or delay the capture. Finally, some numerical simulations are carried out to validate the effectiveness and applicability of our results. © 1963-2012 IEEE.

关键词： state feedback

来源：评论

学校读者我要写书评

暂无评论

Distributed Task Allocation With Minimum Makespan for Heterogeneous Multiplayer Pursuit–Evasion Games

引用

IEEE Transactions on Automatic Control 2025年第5期70卷 2827-2842页

作者： Li, Shuai Wang, Chen Sun, Jinan Zhang, Shikun Xie, Guangming Peking University State Key Laboratory of Turbulence and Complex Systems Intelligent Biomimetic Design Lab College of Engineering Beijing100871 China Peking University National Engineering Research Center of Software Engineering Beijing100871 China Peking University Center for Multi-Agent Research Institute for Artificial Intelligence Beijing100871 China

In the domain of multiplayer pursuit–evasion games, it is crucial to address the practical aspects of the players' heterogeneity, the distributed control manner, and the pursuers' goal of minimum makespan. However, the three topics have received limited attention in existing literature, both separately and in combination. In this article, we address the multiplayer pursuit–evasion game integrating these key topics, where the pursuers with simple motions strive to capture as many evaders, characterized by damped double integrators, as possible, meanwhile minimizing the task makespan. To this end, we establish an overall framework and sequentially tackle four key issues, leading to an effective solution to the entire problem. We first propose a novel isochron-based method to derive the capture condition and acquire the optimal pursuit and evasion strategies. Then, we enhance the usability of the capture condition by geometrically deriving the analytical form of the pursuer's winning region with respect to a given evader. Third, leveraging the concept of winning regions, we determine the lower boundary of pursuers' sensing range, ensuring sufficient information acquisition for evader allocation while avoiding selection conflicts. Finally, we propose a fully distributed allocation algorithm for each pursuer allowing the pursuer team to converge to the optimal evader allocation. By combining these contributions, we successfully provide an effective solution to the entire problem. Various simulations are conducted to show the effectiveness of our proposed methods. © 1963-2012 IEEE.

关键词： Games Resource management Sensors Robot sensing systems Mathematical models Heuristic algorithms Decentralized control Usability Biomimetics Topology

来源：评论

学校读者我要写书评

暂无评论

Layout Decomposition via Boolean Satisfiability

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年第3期44卷 1112-1125页

作者： Liu, Hongduo Liao, Peiyu Zou, Mengchuan Pang, Bowen Li, Xijun Yuan, Mingxuan Ho, Tsung-Yi Yu, Bei The Chinese University of Hong Kong Department of Computer Science and Engineering Hong Kong Hong Kong Huawei Noah's Ark Lab Hong Kong Hong Kong Institute of Software Chinese Academy of Sciences State Key Laboratory of Computer Science Beijing100190 China

Multiple patterning lithography (MPL) has been introduced in the integrated circuits manufacturing industry to enhance feature density as the technology node advances. A crucial step of MPL is assigning layout features to different masks, namely layout decomposition. Exact algorithms like integer linear programming (ILP) can solve layout decomposition to optimality but lack scalability for dense patterns. Relaxation algorithms (e.g., linear programming and semi-definite programming) and heuristics (e.g., exact cover) are capable of handling large cases at the cost of inferior solution quality. These methods rely on different mathematical solvers and expert-designed heuristics to offer a balance between solution quality and computational efficiency. In this article, we propose a unified layout decomposition framework comprising three algorithms: 1) satisfiability (SAT)-exact;2) SAT-bilevel;and 3) SAT-fast, all leveraging the capabilities of Boolean SAT solvers. The SAT-exact ensures optimality, but with faster convergence than ILP, SAT-bilevel addresses the decomposition as a bilevel optimization problem for rapid near-optimal solutions, and SAT-fast handles very large layouts in an incremental manner. Experimental results demonstrate our framework's superiority over existing state-of-the-art methods in terms of solution quality and runtime. © 2024 IEEE.

关键词： Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A theoretical and experimental study of deformation mechanism dictated by disclination-dislocation coupling in Mg alloys at different temperatures

引用

材料科学技术（英文版） 2025年第5期208卷 176-188页

作者： Chunfeng Du Yipeng Gao Yizhen Li Quan Li Min Zha Cheng Wang Hailong Jia Hui-Yuan Wang Key Laboratory of Automobile Materials of Ministry of Education&School of Materials Science and Engineering Nanling CampusJilin UniversityChangchun 130025China Key Laboratory of Automobile Materials of Ministry of Education&School of Materials Science and Engineering Nanling CampusJilin UniversityChangchun 130025China International Center of Future Science Jilin UniversityChangchun 130012China International Center of Future Science Jilin UniversityChangchun 130012China State Key Lab of Superhard Materials and Key Laboratory of Material Simulation Methods&Software of Ministry of Education College of PhysicsJilin UniversityChangchun 130012China Key Laboratory of Automobile Materials of Ministry of Education&School of Materials Science and Engineering Nanling CampusJilin UniversityChangchun 130025China International Center of Future Science Jilin UniversityChangchun 130012China State Key Laboratory of Reliability and Intelligence of Electrical Equipment School of Material Science and EngineeringHebei University of TechnologyTianjin 300130China

Dislocations and disclinations are fundamental topological defects within crystals,which determine the mechanical properties of metals and *** their important roles in multiple physical mecha-nisms,e.g.,dynamic recovery and grain boundary mediated plasticity,the intrinsic coupling and corre-lation between disclinations and dislocations,and their impacts on the deformation behavior of metallic materials still remain obscure,partially due to the lack of a theoretical tool to capture the rotational na-ture of *** using a Lie-algebra-based theoretical framework,we obtain a general equation to quantify the intrinsic coupling of disclinations and *** quasi in-situ electron backscat-ter diffraction characterizations and disclination/dislocation density analyses in Mg alloys,the generation,coevolution and reactions of disclinations and dislocations during dynamic recovery and superplastic de-formation have been quantitatively *** has been demonstrated that the obtained governing equa-tion can capture multiple physical processes associated with mechanical deformation of metals,e.g.,grain rotation and grain boundary migration,at both room temperature and high *** establishing the disclination-dislocation coupling equation within a Lie algebra description,our work provides new insights for exploring the coevolution and reaction of disclinations/dislocations,with profound implica-tions for elucidating the microstructure-property relationship and underlying deformation mechanisms in metallic materials.

关键词： Magnesium alloys Dislocations Grain boundaries Plastic deformation Grain rotation Disclination-dislocation coupling

来源：评论

学校读者我要写书评

暂无评论

ESA: Example Sieve Approach for Multi-Positive and Unlabeled Learning 25

ESA: Example Sieve Approach for Multi-Positive and Unlabeled...

引用

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

作者： Li, Zhongnian Wei, Meng Ying, Peng Xu, Xinzheng School of Computer Science and Technology China University of Mining and Technology Xuzhou China Mine Digitization Engineering Research Center of the Ministry of Education Xuzhou China State Key Lab. for Novel Software Technology Nanjing University Nanjing China

ISBN: (纸本)9798400713293

Learning from Multi-Positive and Unlabeled (MPU) data has gradually attracted significant attention from practical applications. Unfortunately, the risk of MPU also suffer from the shift of minimum risk, particularly when the models are very flexible as shown in Fig.1. In this paper, to alleviate the shifting of minimum risk problem, we propose an Example Sieve Approach (ESA) to select examples for training a multi-class classifier. Specifically, we sieve out some examples by utilizing the Certain Loss (CL) value of each example in the training stage and analyze the consistency of the proposed risk estimator. Besides, we show that the estimation error of proposed ESA obtains the optimal parametric convergence rate. Extensive experiments on various real-world datasets show the proposed approach outperforms previous methods. Source code is available at https://***/WilsonMqz/ESA. © 2025 Copyright held by the owner/author(s).

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

CODESWIFT: Accelerating LLM Inference for Efficient Code Generation

arXiv

引用

arXiv 2025年

作者： Zhao, Qianhui Zhang, Li Liu, Fang Lian, Xiaoli Meng, Qiaoyuanhe Jiao, Ziqian Zhou, Zetong Zhang, Borui Guo, Runlin Li, Jia School of Computer Science and Engineering State Key Laboratory of Complex & Critical Software Environment Beihang University China Key Lab of High Confidence Software Technology Peking University China

Code generation is a latency-sensitive task that demands high timeliness, but the autoregressive decoding mechanism of Large Language Models (LLMs) leads to poor inference efficiency. Existing LLM inference acceleration methods mainly focus on standalone functions using only built-in components. Moreover, they treat code like natural language sequences, ignoring its unique syntax and semantic characteristics. As a result, the effectiveness of these approaches in code generation tasks remains limited and fails to align with real-world programming scenarios. To alleviate this issue, we propose CODESWIFT, a simple yet highly efficient inference acceleration approach specifically designed for code generation, without comprising the quality of the output. CODESWIFT constructs a multi-source datastore, providing access to both general and project-specific knowledge, facilitating the retrieval of high-quality draft sequences. Moreover, CODESWIFT reduces retrieval cost by controlling retrieval timing, and enhances efficiency through parallel retrieval and a context- and LLM preference-aware cache. Experimental results show that CODESWIFT can reach up to 2.53× and 2.54× speedup compared to autoregressive decoding in repository-level and standalone code generation tasks, respectively, outperforming state-of-the-art inference acceleration approaches by up to 88%. Our code and data are available at https://***/r/CodeSwift. Copyright © 2025, The Authors. All rights reserved.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Time Domain Analysis for Motions of Ships With the Effects of Steady Flow Using a Rankine Panel Method

引用

Journal of Offshore Mechanics and Arctic engineering 2025年第4期147卷 041203页

作者： Zhou, Bo Wu, Zhifei Wang, Yu Han, Xiaoshuang Zhang, Teng Zhang, Guiyong State Key Lab of Structural Analysis Optimization and CAE Software for Industrial Equipment School of Naval Architecture Engineering Dalian University of Technology Dalian 116024 China Marine Engineering College Dalian Maritime University Dalian 116026 China

A novel numerical approach, leveraging the 3D time domain Rankine panel method, has been introduced to simulate ship motions while accounting for the effects of ship wave. This method treats ship wave as steady flow, enabling a more accurate representation of physical phenomena. The underlying numerical formulation used to solve the ship wave potential is comprehensively derived, establishing the unsteady disturbance potential's boundary value problem and incorporating the effects of steady motion. Wave forces and motion responses of various ship forms were computed and compared with experimental data and results from other numerical techniques. The findings reveal that calculations based on uniform stream exhibit significantly larger errors than those considering double body flow or ship wave. For the Wigley I and S175 models, the discrepancies between double body flow and ship wave predictions are relatively minor, with ship wave calculations demonstrating slightly higher accuracy. In contrast, for the intricate KRISO Container Ship (KCS) model, where ship wave is more pronounced, the error margin for ship wave calculations relative to experimental results remains within 21.9%, while errors for double body flow calculations can reach up to 50.2%. This highlights the superior accuracy of ship wave-based calculations for the KCS model. Overall, the proposed method effectively captures the influence of steady flow and demonstrates significant advantages in computing pronounced ship wave generated during realistic ship motion.

关键词： Ships ship motion Rankine panel method Waves Flow (Dynamics) hydrodynamics wave mechanics and wave effects computational fluid dynamics ship wave Boundary-value problems steady flow

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：