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

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

来源：评论

学校读者我要写书评

暂无评论

Machine learning-assisted retrosynthesis planning:Current status and future prospects

引用

Chinese Journal of Chemical engineering 2025年第1期77卷 273-292页

作者： Yixin Wei Leyu Shan Tong Qiu Diannan Lu Zheng Liu Department of Chemical Engineering Tsinghua UniversityBeijing 100084China Beijing Key Laboratory of Industrial Big Data System and Application Beijing 100084China

Machine learning-assisted retrosynthesis planning aims to utilize machine learning(ML)algorithms to find synthetic pathways for target *** recent years,with the development of artificial intelligence(AI),especially ML,researchers’interest in ML-assisted retrosynthesis planning has rapidly increased,bringing development and opportunities to the *** this review,we aim to provide a comprehensive understanding of ML-assisted retrosynthesis *** first discuss the formal definition and the objective of retrosynthesis planning,and organize a modular framework which includes four modules:data preparation,data preprocessing,pathway generation and evaluation,and pathway ***,we sequentially review the current status of the first three modules(except pathway verification)in the ML-assisted retrosynthesis planning framework,including ideas,methods,and latest *** that,we specifically discuss large language models in retrosynthesis ***,we summarize the extant challenges that are faced by current ML-assisted retrosynthesis planning research and offer a perspective on future research directions and development.

关键词： Retrosynthesis planning Machine learning Artificial intelligence Synthetic pathway Chemoinformatics

来源：评论

学校读者我要写书评

暂无评论

Large language model for table processing: a survey

引用

Frontiers of Computer Science 2025年第2期19卷 71-87页

作者： Weizheng LU Jing ZHANG Ju FAN Zihao FU Yueguo CHEN Xiaoyong DU School of Information Renmin University of ChinaBeijing 100872China Key Laboratory of Data Engineering and Knowledge Engineering Beijing 100872China WPS Office Kingsoft Co.Zhuhai 519080China

Tables,typically two-dimensional and structured to store large amounts of data,are essential in daily activities like database queries,spreadsheet manipulations,Web table question answering,and image table information *** these table-centric tasks with Large Language Models(LLMs)or Visual Language Models(VLMs)offers significant public benefits,garnering interest from academia and *** survey provides a comprehensive overview of table-related tasks,examining both user scenarios and technical *** covers traditional tasks like table question answering as well as emerging fields such as spreadsheet manipulation and table data *** summarize the training techniques for LLMs and VLMs tailored for table ***,we discuss prompt engineering,particularly the use of LLM-powered agents,for various tablerelated ***,we highlight several challenges,including diverse user input when serving and slow thinking using chainof-thought.

关键词： data mining and knowledge discovery table processing large language model

来源：评论

学校读者我要写书评

暂无评论

Azimuth-based antenna group delay variation modeling for dual-frequency multi-constellation GBAS

引用

Chinese Journal of Aeronautics 2025年第2期38卷 370-380页

作者： Yuan LIU Yanbo ZHU Kun FANG Zhipeng WANG National Key Laboratory of CNS/ATM School of Electronic and Information EngineeringBeihang UniversityBeijing 100191China Aviation Data Communication Corporation CAACBeijing 100191China

Antenna Group Delay Variation(AGDV)is a hardware error source that affects the performance of Dual-Frequency Multi-Constellation(DFMC)Ground-based Augmentation System(GBAS),and these errors are difficult to distinguish from multipath ***,AGDV is usually modeled as a part of the multipath error,which is called the multipath-AGDV ***,because of the inconsistency of AGDV and multipath when switching among different positioning modes of GBAS,and because the traditional model does not consider the impact of the azimuth on AGDV,using the traditional multipath-AGDV model will cause the protection levels to be inaccurately *** this paper,azimuth-based modeling of AGDV is conducted by using anechoic chamber *** biases and standard deviations of AGDV based on azimuths are analyzed and modeled,and the calculation method for the DFMC GBAS protection level is *** results show that the azimuth-based AGDV model and protection level optimization algorithm can better avoid the error exceeding the protection level than the multipath-AGDV *** with AGDV elevation model,the VPLs of the B1C signal are increased by 0.24 m and 0.06 m,and the VPLs of the B2a signal are reduced by 0.01 m and 0.16 m using the 100 s and 600 s DFree filtering positioning modes,*** changes in the B1C and B2a protection levels reflect the changes in AGDV corresponding to the azimuth for the respective frequencies,further ensuring the integrity of airborne users,especially when they turn near the airport.

关键词： Antenna Group Delay Variation(AGDV) Ground-based Augmentation System(GBAS) Integrity Vertical protection level Navigation

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Clustering-Based (k, t)-Anonymity Algorithm for Graphs

引用

Chinese Journal of Electronics 2025年第1期34卷 365-372页

作者： Yuanyuan Wang Xing Zhang Zhiguang Chu Wei Shi Xiang Li School of Electronics and Information Engineering Liaoning University of Technology Key Laboratory of Security for Network and Data in Industrial Internet of Liaoning Province Faculty of Information Technology Beijing University of Technology

As people become increasingly reliant on the Internet, securely storing and publishing private data has become an important issue. In real life, the release of graph data can lead to privacy breaches, which is a highly challenging problem. Although current research has addressed the issue of identity disclosure, there are still two challenges: First, the privacy protection for large-scale datasets is not yet comprehensive; Second, it is difficult to simultaneously protect the privacy of nodes, edges, and attributes in social networks. To address these issues, this paper proposes a(k,t)-graph anonymity algorithm based on enhanced clustering. The algorithm uses k-means++ clustering for k-anonymity and t-closeness to improve k-anonymity. We evaluate the privacy and efficiency of this method on two datasets and achieved good results. This research is of great significance for addressing the problem of privacy breaches that may arise from the publication of graph data.

关键词： data privacy Uncertainty Social networking (online) Publishing Heuristic algorithms Scalability Clustering algorithms Privacy breach Internet Protection

来源：评论

学校读者我要写书评

暂无评论

Broadband nanotubes-based nonlinear modulators for erbium- and thulium-doped lasers

引用

Ceramics International 2025年第12期51卷 16606-16612页

作者： Zhang, Congyu Lyu, Wenhao Lyu, Yunyu Zhang, He Zhao, Ruiyi Ma, Weihao Fu, Bo Key Laboratory of Precision Opto-Mechatronics Technology School of Instrumentation and Optoelectronic Engineering Beihang University Beijing100191 China Key Laboratory of Big Data-Based Precision Medicine Ministry of Industry and Information Technology School of Engineering Medicine Beihang University Beijing100191 China

Carbon-based nanomaterials have become a long-term research hotspot in the fields of material science and nanotechnology. Carbon nanotubes as one-dimensional nanomaterials have shown great application value in the fields of electronics and optoelectronics. Herein, stable mode-locked pulsed lasers in both 1.5- and 2-μm bands were achieved by combining and balancing the stimulated emission effect of rare-earth ions and saturable absorption effect of carbon nanotubes. In the Er-doped fiber laser, pulses with a SNR of 61 dB and a peak power of 2.97 W were achieved at the wavelength of 1565.8 nm. Meanwhile, bound states were observed in the same laser, where the time delay of pulses was adjustable from 9.84 to 21.77 ps by tuning the pump power and polarization state. In the Tm-doped laser, output pulses were obtained at the wavelength of 1921.0 nm with a 60-dB SNR and a 12.82-W peak power. These results demonstrate that carbon nanotubes are ideal candidates for saturable absorber in mode-locked fiber lasers, which can be applied to a variety of applications, including fiber optic sensing, optical communication, and nanoscale processing. © 2024 Elsevier Ltd and Techna Group S.r.l.

关键词： Mode-locked fiber lasers

来源：评论

学校读者我要写书评

暂无评论

Sequential Fusion of Text-close and Text-far Representations for Multimodal Sentiment Analysis 31

Sequential Fusion of Text-close and Text-far Representations...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Sun, Kaiwei Tian, Mi Key Laboratory of Data Engineering and Visual Computing Chongqing University of Posts and Telecommunications Chongqing China

ISBN: (纸本)9798891761964

Multimodal Sentiment Analysis (MSA) aims to identify human attitudes from diverse modalities such as visual, audio and text modalities. Recent studies suggest that the text modality tends to be the most effective, which has encouraged models to consider text as its core modality. However, previous methods primarily concentrate on projecting modalities other than text into a space close to the text modality and learning an identical representation, which does not fully make use of the auxiliary information provided by audio and visual modalities. In this paper, we propose a framework, Sequential Fusion of Text-close and Text-far Representations (SFTTR), aiming to refine multimodal representations from multimodal data which should contain both representations close to and far from the text modality. Specifically, we employ contrastive learning to sufficiently explore the information similarities and differences between text and audio/visual modalities. Moreover, to fuse the extracted representations more effectively, we design a sequential cross-modal encoder to sequentially fuse representations that are close to and far from the text modality. Experiments on three public benchmark datasets, MOSI, MOSEI, and CH-SIMS, demonstrate the superiority of the proposed method over the state-of-the-arts. © 2025 Association for Computational Linguistics.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Dependency-augmented graph aggregation networks for document-level relation extraction with cross-sentence semantics

引用

Journal of King Saud University - Computer and Information Sciences 2025年第3期37卷 1-12页

作者： Che, Shasha He, Qing Yang, Zhihao Li, Yanbo Du, Nisuo College of Big Data and Information Engineering Guizhou University Guiyang China Guizhou Provincial Key Laboratory of Public Big Data Guizhou University Guiyang China

Finding semantic relationships between words in several sentences is the goal of document-level relation extraction (DocRE), a crucial problem in natural language processing. Current research is unable to accurately characterize long-range interdependence and cross-sentence interactions, which restricts their capacity to capture document-level semantics. In order to alleviate this issue, we introduce the Dependency-Augmented Graph Aggregation Network(DAGA), which is a novel DocRE model. In particular, we design a Dependency Graph Aggregation Module (DGAM) that integrates Sentence Related Graph and Dependency Structure Graph to explore both local and global relational patterns. To explicitly capture document-level sentence-related dependencies and semantic interactions, we propose Dependency-Augmented Attention Mechanism (DAAM). Results from experiments show that our suggested approach improves the F1 score by 1.39 and the Ign F1 score by 1.52 on publicly available benchmark datasets. In summary, DAGA demonstrates higher performance in dealing with complicated semantic relationships at the document level. © The Author(s) 2025.

关键词： Cross-sentence relationships Dependency structure graph Document-level relation extraction Multi-head attention Semantic relations

来源：评论

学校读者我要写书评

暂无评论

HTOTP: Honey Time-Based One-Time Passwords

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 4438-4453页

作者： Ding, Zixuan Wang, Ding Nankai University College of Cryptology and Cyber Science Key Laboratory of Data and Intelligent System Security Ministry of Education Tianjin300350 China Chinese Academy of Sciences Key Laboratory of Cyberspace Security Defense Institute of Information Engineering Beijing100085 China

One-Time Passwords (OTPs) play a crucial role in Two-Factor Authentication (2FA) and Multi-Factor Authentication (MFA) by adding an additional layer of security. OTPs effectively reduce the risk of static passwords being intercepted and reused. Nevertheless, both academic schemes and industrial solutions face security threats stemming from server/device compromises and OTP factor forgery. Chain-based asymmetric OTP schemes are a promising approach to addressing the problem of server compromise but still face threats from device compromise and pre-generated chain leakage. We emphasize that since devices directly store the OTP seed, OTP authentication is essentially equivalent to verifying device possession. This means that in existing OTP schemes, OTP forgery and device compromise remain prevalent and difficult to overcome. In this work, we propose a brand new scheme to address OTP factor forgery and server/device compromises. For the first time, our scheme constructs a tightly coupled architecture between the password factor and the OTP factor. The OTP seed is derived from a password and a device-stored salt, preventing OTP seed extraction and OTP forgery even in the event of a device compromise. Through the integration of "honeywords" with the tightly coupled OTP architecture, the server stores decoy OTP seeds generated by decoy passwords, providing resistance against server compromises and partial password guessing from devices. We conduct a comprehensive evaluation of our OTP schemes. The computational overhead is correlated with the number of honeywords, and with the recommended set size of 20, the total verification overhead is approximately 0.24~ms . Additionally, we propose formal security properties and application metrics, and rigorously prove our scheme’s resistance against server/device compromise attacks and guessing attacks. Our scheme is the first to achieve comprehensive OTP security with low overhead. © 2005-2012 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Joint Estimation of SOH and RUL for Lithium-Ion Batteries Based on Improved Twin Support Vector Machineh

引用

Energy engineering 2025年第1期122卷 243-264页

作者： Liyao Yang Hongyan Ma Yingda Zhang Wei He School of Electrical and Information Engineering Beijing University of Civil Engineering and ArchitectureBeijing100044China Institute of Distributed Energy Storage Safety Big Data Beijing100044China Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing100044China

Accurately estimating the State of Health(SOH)and Remaining Useful Life(RUL)of lithium-ion batteries(LIBs)is crucial for the continuous and stable operation of battery management ***,due to the complex internal chemical systems of LIBs and the nonlinear degradation of their performance,direct measurement of SOH and RUL is *** address these issues,the Twin Support Vector Machine(TWSVM)method is proposed to predict SOH and ***,the constant current charging time of the lithium battery is extracted as a health indicator(HI),decomposed using Variational Modal Decomposition(VMD),and feature correlations are computed using Importance of Random Forest Features(RF)to maximize the extraction of critical factors influencing battery performance ***,to enhance the global search capability of the Convolution Optimization Algorithm(COA),improvements are made using Good Point Set theory and the Differential Evolution *** Improved Convolution Optimization Algorithm(ICOA)is employed to optimize TWSVM parameters for constructing SOH and RUL prediction ***,the proposed models are validated using NASA and CALCE lithium-ion battery *** results demonstrate that the proposed models achieve an RMSE not exceeding 0.007 and an MAPE not exceeding 0.0082 for SOH and RUL prediction,with a relative error in RUL prediction within the range of[-1.8%,2%].Compared to other models,the proposed model not only exhibits superior fitting capability but also demonstrates robust performance.

关键词： State of health remaining useful life variational modal decomposition random forest twin support vector machine convolutional optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：