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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

LIOF: Make the Learned Index Learn Faster With Higher Accuracy

引用

IEEE Transactions on knowledge and data engineering 2025年第6期37卷 3499-3513页

作者： Ji, Tao Zhong, Kai Sun, Luming Li, Yiyan Li, Cuiping Chen, Hong Ministry of Education Key Laboratory of Data Engineering and Knowledge Engineering Beijing100872 China Renmin University of China School of Information Beijing100872 China Yunxi Technology Company Ltd. Shanghai200120 China

Learned indexes, emerging as a promising alternative to traditional indexes like B+Tree, utilize machine learning models to enhance query performance and reduce memory usage. However, the widespread adoption of learned indexes is limited by their expensive training cost and the need for high accuracy of internal models. Although some studies attempt to optimize the building process of these learned indexes, existing methods are restrictive in scope and applicability. They are usually tailored to specific index types and heavily rely on pre-trained model knowledge, making deployment a challenging task. In this work, we introduce the Learned Index Optimization Framework (LIOF), a general and easily integrated solution aimed at expediting the training process and improving the accuracy of index model for one-dimensional and multi-dimensional learned indexes. The optimization of LIOF for the learned indexes is intuitive, directly providing optimized parameters for index models based on the distribution of node data. By leveraging the correlation between key distribution and node model parameters, LIOF significantly reduces the training epochs required for each node model. Initially, we introduce an optimization strategy inspired by optimization-based meta-learning to train the LIOF to generate optimized initial parameters for index node models. Subsequently, we present a data-driven encoder and a parameter-centric decoder network, which adaptively translate key distribution into a latent variable representation and decode it into optimized node model initialization. Additionally, to further utilize characteristics of key distribution, we propose a monotonic regularizer and focal loss, guiding LIOF training towards efficiency and precision. Through extensive experimentation on real-world and synthetic datasets, we demonstrate that LIOF provides substantial enhancements in both training efficiency and the predictive accuracy for learned indexes. © 1989-2012 IEEE.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Bayesian Network Reconstruction and Iterative Divergence Problem Solving Method Based on Norm Minimization

引用

Computer Modeling in engineering & Sciences 2025年第4期143卷 617-637页

作者： Kuo Li Aimin Wang Limin Wang Yuetan Zhao Xinyu Zhu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun130012China College of Software Jilin UniversityChangchun130012China

A Bayesian network reconstruction method based on norm minimization is proposed to address the sparsity and iterative divergence issues in network reconstruction caused by noise and missing *** method achieves precise adjustment of the network structure by constructing a preliminary random network model and introducing small-world network characteristics and combines L1 norm minimization regularization techniques to control model complexity and optimize the inference process of variable *** the experiment of game network reconstruction,when the success rate of the L1 norm minimization model’s existence connection reconstruction reaches 100%,the minimum data required is about 40%,while the minimum data required for a sparse Bayesian learning network is about 45%.In terms of operational efficiency,the running time for minimizing the L1 normis basically maintained at 1.0 s,while the success rate of connection reconstruction increases significantly with an increase in data volume,reaching a maximum of 13.2 ***,in the case of a signal-to-noise ratio of 10 dB,the L1 model achieves a 100% success rate in the reconstruction of existing connections,while the sparse Bayesian network had the highest success rate of 90% in the reconstruction of non-existent *** the analysis of actual cases,the maximum lift and drop track of the research method is 0.08 *** mean square error is 5.74 cm^(2).The results indicate that this norm minimization-based method has good performance in data efficiency and model stability,effectively reducing the impact of outliers on the reconstruction results to more accurately reflect the actual situation.

关键词： Bayesian norm minimization network reconstruction iterative divergence sparsity

来源：评论

学校读者我要写书评

暂无评论

Gupacker: Generalized Unpacking Framework for Android Malware

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 4338-4352页

作者： Zheng, Tao Hou, Qiyu Chen, Xingshu Ren, Hao Li, Meng Li, Hongwei Shen, Changxiang Sichuan University School of Cyber Science and Engineering Chengdu610065 China Sichuan University School of Cyber Science and Engineering Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province School of Computer Science and Information Engineering Hefei230002 China University of Padua Department of Mathematics HIT Center Padua35131 Italy University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China Sichuan University Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 China

Android malware authors often use packers to evade analysis. Although many unpacking tools have been proposed, they face two significant challenges: 1) They are easily impeded by anti-analysis techniques employed by packers, preventing efficient collection of hidden Dex data. 2) They are typically designed to unpack a specific packer and cannot handle malware packed with mixed packers. Consequently, many packed malware samples evade detection. To bridge this gap, we propose Gupacker , a novel generalized unpacking framework. Gupacker offers a generic solution for first-generation holistic packer by customizing the Android system source code. It identifies the type of packer and selects an appropriate unpacking function, constructs a deeper active call chain to achieve generic unpacking of second-generation function extraction packers, and uses JNI function and instruction monitoring to handle third-generation virtual obfuscation packer. On this basis, we counteract a diverse array of anti-analysis techniques. We conduct extensive experiments on 5K packed Android malware samples, comparing Gupacker with 2 commercial and 4 state-of-the-art academic unpacking tools. The results demonstrate that Gupacker significantly improves the efficiency of Android malware unpacking with acceptable system overhead. We analyze real packed applications based on Gupacker and found several are second-packed by attackers, including WPS for Android, with tens of millions of users. We receive and responsibly report 13 0day vulnerabilities and also assist in the remediation of all vulnerabilities. © 2005-2012 IEEE.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

Enhancing Extractive Question Answering in Multiparty Dialogues with Logical Inference Memory Network 31

Enhancing Extractive Question Answering in Multiparty Dialog...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Zhou, Shu Zhao, Rui Zhou, Zhengda Yi, Haohan Zheng, Xuhui Wang, Hao Nanjing University China Key Laboratory of Data Engineering and Knowledge Services in Jiangsu Provincial Universities Nanjing University China University of Technology Sydney Australia

ISBN: (纸本)9798891761964

Multiparty dialogue question answering (QA) within machine reading comprehension (MRC) presents significant challenges due to the complex interplay of information across multiple speakers and the need for advanced logical reasoning. While existing models often focus on separating dialogue information based on speakers and utterances, they rarely address the crucial aspect of logical inference, leading to suboptimal performance in understanding and answering questions. To bridge this gap, we introduce the Logical Inference Memory Network (LIMN), a novel architecture designed for extractive QA in multiparty dialogues. LIMN incorporates a unique inference module pretrained on plain text QA datasets (like SQuAD 2.0), enabling it to transfer robust logical reasoning abilities to the dialogue domain. This module generates representations that are specifically attuned to logical inference, which are then integrated into the dialogue context. Furthermore, we propose a key-utterance-based interaction mechanism that dynamically focuses on the most relevant utterances within the dialogue, enhancing the model's ability to pinpoint answers. To ensure robust performance, LIMN employs a multitask learning strategy that jointly optimizes for answer extraction, answerability prediction, key-utterance identification, and masked speaker prediction. Extensive experiments on the Molweni and FriendsQA benchmarks, encompassing 25,000 and 10,000 questions respectively, demonstrate that LIMN achieves state-of-the-art results, affirming the effectiveness of incorporating logical inference in multiparty dialogue QA. © 2025 Association for Computational Linguistics.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Dual AAV Cluster-Assisted Maritime Physical-Layer Secure Communications via Collaborative Beamforming

引用

IEEE Internet of Things Journal 2025年第9期12卷 12589-12607页

作者： Huang, Jiawei Wang, Aimin Sun, Geng Li, Jiahui Wang, Jiacheng Du, Hongyang Niyato, Dusit Jilin University College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanyang Technological University College of Computing and Data Science Jurong West 639798 Singapore The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong

Autonomous aerial vehicles (AAVs) can be utilized as relay platforms to assist maritime wireless communications. However, complex channels and multipath effects at sea can adversely affect the quality of AAV transmitted signals. Collaborative beamforming (CB) can enhance the signal strength and range to assist the AAV relay for remote maritime communications. However, due to the open nature of AAV channels, security issue requires special consideration. This article proposes a dual AAV cluster-assisted system via CB to achieve physical-layer security in maritime wireless communications. Specifically, one AAV cluster forms a maritime AAV-enabled virtual antenna array (MUVAA) relay to forward data signals to the remote legitimate vessel, and the other AAV cluster forms an MUVAA jammer to send jamming signals to the remote eavesdropper. In this system, we formulate a secure and energy-efficient maritime communication multiobjective optimization problem (SEMCMOP) to maximize the signal-to-interference-plus-noise ratio (SINR) of the legitimate vessel, minimize the SINR of the eavesdropping vessel and minimize the total flight energy consumption of AAVs. Since the SEMCMOP is an NP-hard and large-scale optimization problem, we propose an improved swarm intelligence optimization algorithm with chaotic solution initialization and hybrid solution update strategies to solve the problem. Simulation results indicate that the proposed algorithm outperforms other comparison algorithms, and it can achieve more efficient signal transmission by using the CB-based method. © 2014 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：