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

arXiv 2024年

作者： Qin, Zeqing Wu, Yiwei Han, Lansheng School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security China

Large Language Models (LLMs) have shown great promise in vulnerability identification. As C/C++ comprises half of the Open-Source Software (OSS) vulnerabilities over the past decade and updates in OSS mainly occur through commits, enhancing LLMs' ability to identify C/C++ Vulnerability-Contributing Commits (VCCs) is essential. However, current studies primarily focus on further pre-training LLMs on massive code datasets, which is resource-intensive and poses efficiency challenges. In this paper, we enhance the ability of BERT-based LLMs to identify C/C++ VCCs in a lightweight manner. We propose CodeLinguaNexus (CLNX) as a bridge facilitating communication between C/C++ programs and LLMs. Based on commits, CLNX efficiently converts the source code into a more natural representation while preserving key details. Specifically, CLNX first applies structure-level naturalization to decompose complex programs, followed by token-level naturalization to interpret complex symbols. We evaluate CLNX on public datasets of 25,872 C/C++ functions with their commits. The results show that CLNX significantly enhances the performance of LLMs on identifying C/C++ VCCs. Moreover, CLNX-equipped CodeBERT achieves new state-of-the-art and identifies 38 OSS vulnerabilities in the real *** Codes 68M25 Copyright © 2024, The Authors. All rights reserved.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

A granular-ball generation method based on local density for classification

引用

Information Sciences 2025年 717卷

作者： Liu, Fan Zhang, Qinghua Xia, Shuyin Xie, Qin Liao, Wei Zhang, Siyang School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunication Chongqing400065 China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing400065 China Tourism Multi-source Data Perception and Decision Technology Key Laboratory of the Ministry of Culture and Tourism Chongqing400065 China

As a new branch of granular computing, granular-ball computing (GBC) has become increasingly popular due to its high efficiency, robustness, and scalability. However, in classification tasks, the existing mainstream methods for generating granular-ball (GB) have two common issues: GBs generated by the existing methods are not accurate enough to describe the distribution of the original data and there are de-overlap operations in the existing GB generation process, which increase the workload of the GB generation process. Therefore, to solve the above two issues, a GB generation method based on local density (LDGBG) is proposed in this paper. First, centers of GBs are selected based on local density to ensure the generated GBs are more consistent with the original data distribution. Second, the method for calculating radii avoids overlaps and incorporates the idea of compact within class and decentralized between classes, which will improve classification performance. Furthermore, a sparsity index is introduced to assess the sparsity of datasets, thereby enabling more effective utilization of original samples in sparse datasets. Finally, comparative experiments are conducted on 27 benchmark datasets and the experimental results show that LDGBG is superior to the existing mainstream models in effectiveness and robustness. © 2025 Elsevier Inc.

关键词： Classification Granular computing Granular-ball computing Granular-ball generation Local density

来源：评论

学校读者我要写书评

暂无评论

Image-Based Visual Servoing of Manipulators With Unknown Depth: A Recurrent Neural Network Approach

引用

IEEE Transactions on Neural Networks and Learning systems 2024年第6期36卷 10359-10370页

作者： Yinyan Zhang Yuhua Zheng Feng Gao Shuai Li College of Cyber Security and Guangdong Key Laboratory of Data Security and Privacy Preserving Jinan University Guangzhou China School of Intelligent Science and Technology Hangzhou Institute for Advanced Study University of Chinese Academy of Sciences Hangzhou China Zhejiang Lab Hangzhou China

The image-based visual servoing (IBVS) of manipulators is important for intelligent manipulation using visual feedbacks. While the traditional IBVS methods for manipulators require the knowledge of the depth information in the interaction matrix, in this article, we propose a novel IBVS method for manipulators without depth estimation by leveraging the property of the associated image Jacobian. Because of a novel transformation, the IBVS problem is converted into a convex optimization problem subject to the kinematic constraint, joint constraints, and other constraints that are not explicitly related to the depth information. The problem is then solved by developing a recurrent neural network of global asymptotic convergence, and a dynamic neural control law without depth estimation emerges for the IBVS of manipulators. The theoretical guarantee and simulation results are provided to show the efficacy of the proposed method.

关键词： Kinematics Cameras Optimization Jacobian matrices Visual servoing Recurrent neural networks Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Spiderweb Protector: Biomimetic Defense Against Targeted Attacks on Graph Neural Networks

Spiderweb Protector: Biomimetic Defense Against Targeted Att...

引用

International Conference on Wavelet Active Media Technology and Information Processing (ICWAMTIP)

作者： Zeyu Zhou Yuanyuan Huang Yongli Wang Siyu Li Jiazhong Lu Peilin He Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu University of Information Technology Chengdu China Dazhou key Laboratory of Government data security Dazhou China Department of Informatics and Networked Systems University of Pittsburgh Pittsburgh United States

ISBN: (数字)9798331519254

ISBN: (纸本)9798331519261

Graph Neural Networks (GNNs) have emerged as powerful tools across diverse applications, including social networks, bioinformatics, and recommendation systems. However, their susceptibility to adversarial attacks, particularly targeted attacks, poses a significant challenge. Targeted attacks exploit the message-passing mechanism of GNNs to induce severe performance degradation, even with minimal perturbations. Inspired by the self-repair and adaptive behaviors of spider webs, this paper introduces SpiderWeb Protector, a biomimetic defense strategy designed to enhance GNN robustness. The proposed method integrates three core components: Community-Centric Graph Update, which selectively reinforces key graph structures; Topology Feature Merging, which improves feature representation by incorporating structural insights; and Edge Pruning, which dynamically removes adversarial connections. Comprehensive experiments on three datasets (Cora, Citeseer and Cora_ml) and two GNN models (GCN and GIN) demonstrate the superior performance of SpiderWeb Protector against both direct and influence-targeted attacks, achieving state-of-the-art results.

关键词： Technological innovation Social networking (online) Biomimetics Merging Refining Graph neural networks Robustness Topology Recommender systems Resilience

来源：评论

学校读者我要写书评

暂无评论

Modeling Layout Reading Order as Ordering Relations for Visually-rich Document Understanding

Modeling Layout Reading Order as Ordering Relations for Visu...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Zhang, Chong Tu, Yi Zhao, Yixi Yuan, Chenshu Chen, Huan Zhang, Yue Chai, Mingxu Guo, Ya Zhu, Huijia Zhang, Qi Gui, Tao School of Computer Science Fudan University Shanghai China Shanghai Key Laboratory of Intelligent Information Processing Shanghai China Ant Tiansuan Security Lab Ant Group Hangzhou China School of Statistics and Data Science Nankai University Tianjin China Institute of Modern Languages and Linguistics Fudan University Shanghai China

ISBN: (纸本)9798891761643

Modeling and leveraging layout reading order in visually-rich documents (VrDs) is critical in document intelligence as it captures the rich structure semantics within documents. Previous works typically formulated layout reading order as a permutation of layout elements, i.e. a sequence containing all the layout elements. However, we argue that this formulation does not adequately convey the complete reading order information in the layout, which may potentially lead to performance decline in downstream VrD tasks. To address this issue, we propose to model the layout reading order as ordering relations over the set of layout elements, which have sufficient expressive capability for the complete reading order information. To enable empirical evaluation on methods towards the improved form of reading order prediction (ROP), we establish a comprehensive benchmark dataset including the reading order annotation as relations over layout elements, together with a relation-extraction-based method that outperforms previous methods. Moreover, to highlight the practical benefits of introducing the improved form of layout reading order, we propose a reading-order-relation-enhancing pipeline to improve model performance on any arbitrary VrD task by introducing additional reading order relation inputs. Comprehensive results demonstrate that the pipeline generally benefits downstream VrD tasks: (1) with utilizing the reading order relation information, the enhanced downstream models achieve SOTA results on both two task settings of the targeted dataset;(2) with utilizing the pseudo reading order information generated by the proposed ROP model, the performance of the enhanced models has improved across all three models and eight cross-domain VrD-IE/QA task settings without targeted optimization. © 2024 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Self-feedback LSTM regression model for real-time particle source apportionment

引用

Journal of Environmental Sciences 2022年第4期34卷 10-20页

作者： Wei Wang Weiman Xu Shuai Deng Yimeng Chai Ruoyu Ma Guoliang Shi Bo Xu Mei Li Yue Li Trusted AI System Laboratory College of Computer ScienceNankai UniversityTianjin 300350China KLMDASR Tianjin Key Laboratory of Network and Data Security TechnologyTianjin 300350China State Environmental Protection Key Laboratory of Urban Ambient Air Particulate Matter Pollution Prevention and Control College of Environmental Science and EngineeringNankai UniversityTianjin 300071China Institute of Mass Spectrometry and Atmospheric Environment Guangdong Provincial Engineering Research Center for on-line source apportionment system of air pollution Jinan UniversityGuangzhou 510632China Guangdong-Hongkong-Macao Joint Laboratory of Collaborative Innovation for Environmental Quality Guangzhou 510632China

Atmospheric particulate matter pollution has attracted much wider attention *** recent years,the development of atmospheric particle collection techniques has put forwards new demands on the real-time source apportionments *** demands are summarized,in this paper,as how to set up new restraints in apportionment and how to develop a non-linear regression model to process complicated circumstances,such as the existence of secondary source and similar *** this study,we firstly analyze the possible and potential restraints in single particle source apportionment,then propose a novel three-step self-feedback long short-term memory(SF-LSTM)network for approximating the source *** proposed deep learning neural network includes three modules,as generation,scoring and refining,and regeneration *** from the scoring modules,SF-LSTM implants four loss functions representing four restraints to be followed in the apportionment,meanwhile,the regeneration module calculates the source contribution in a non-linear *** results show that the model outperforms the conventional regression methods in the overall performance of the four evaluation indicators(residual sum of squares,stability,sparsity,negativity)for the ***,in short time-resolution analyzing,SF-LSTM provides better results under the restraint of stability.

关键词： Time series Regression Self-feedback LSTM network Particle source apportionment

来源：评论

学校读者我要写书评

暂无评论

Stealthy Backdoor Attack Towards Federated Automatic Speaker Verification

Stealthy Backdoor Attack Towards Federated Automatic Speaker...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Longling Zhang Lyqi Liu Dan Meng Jun Wang Shengshan Hu School of Cyber Science and Engineering Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security OPPO Research Institute China

Automatic speech verification (ASV) authenticates individuals based on distinct vocal patterns, playing a pivotal role in many applications such as voice-based unlocking systems for devices. The ASV system comprises three stages: training, registration, and validation. The model refines using voice data in training, extracts vocal features in registration, and contrasts these with speech patterns in validation. Modern ASV models, primarily grounded in DNN architectures, require extensive data for training. Federated learning (FL) fosters model-sharing across multiple clients while ensuring data privacy. Due to its open architecture, FL is vulnerable to backdoor attacks. However, training a stealthy backdoor attack in FL presents challenges, including diminished attack generalization owing to data heterogeneity, and conspicuous triggers that render them easily detectable. In this paper, we propose a Federated Stealthy Backdoor Attack method ($FedSBA$). FedSBA aims to improve the attack model’s generalization, enhance its persistence, and elude anomaly detection under the heterogeneous data distribution. FedSBA constructs an attack model based on a personalized transformer and encompasses a stealthy trigger. Moreover, we also propose a defensive strategy that utilizes an adaptive weight aggregation scheme. The stealthiness and effectiveness of FedSBA are demonstrated by exhibiting superior performance in comparison to previous works.

关键词：

来源：评论

学校读者我要写书评

暂无评论

BDLR:lncRNA identification using ensemble learning

引用

BIOCELL 2022年第4期46卷 951-960页

作者： LEJUN GONG SHEHAI ZHOU JINGMEI CHEN YONGMIN LI LI ZHANG ZHIHONG GAO Jiangsu Key Lab of Big Data Security&Intelligent Processing School of Computer Science Nanjing University of Posts and TelecommunicationsNanjing210046China Smart Health Big Data Analysis and Location Services Engineering Laboratory of Jiangsu Province Nanjing210046China Zhejiang Engineering Research Center of Intelligent Medicine Wenzhou325035China College of Computer Science and Technology Nanjing Forestry UniversityNanjing210037China

Long non-coding RNAs(lncRNAs)play an important role in many life activities such as epigenetic material regulation,cell cycle regulation,dosage compensation and cell differentiation regulation,and are associated with many human *** are many limitations in identifying and annotating lncRNAs using traditional biological experimental *** the development of high-throughput sequencing technology,it is of great practical significance to identify the lncRNAs from massive RNA sequence data using machine learning *** on the Bagging method and Decision Tree algorithm in ensemble learning,this paper proposes a method of lncRNAs gene sequence identification called *** identification results of this classification method are compared with the identification results of several models including Byes,Support Vector Machine,Logical Regression,Decision Tree and Random *** experimental results show that the lncRNAs identification method named BDLR proposed in this paper has an accuracy of 86.61%in the human test set and 90.34%in the mouse for lncRNAs,which is more than the identification results of the other ***,the proposed method offers a reference for researchers to identify lncRNAs using the ensemble learning.

关键词： lncRNAs High-throughput sequencing Ensemble learning Bagging Decision Tree

来源：评论

学校读者我要写书评

暂无评论

An Efficient Watermarking Method for Latent Diffusion Models via Low-Rank Adaptation

arXiv

引用

arXiv 2024年

作者： Lin, Dongdong Li, Yue Tondi, Benedetta Li, Bin Barni, Mauro Guangdong Provincial Key Laboratory of Intelligent Information Processing The Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen518060 China Huaqiao University China Xiamen Key Laboratory of Data Security and Blockchain Technology Xiamen361021 China Department of Information Engineering and Mathematics The University of Siena Italy

The rapid proliferation of deep neural networks (DNNs) is driving a surge in model watermarking technologies, as the trained deep models themselves serve as intellectual properties. The core of existing model watermarking techniques involves modifying or tuning the models’ weights. However, with the emergence of increasingly complex models, ensuring the efficiency of watermarking process is essential to manage the growing computational demands. Prioritizing efficiency not only optimizes resource utilization, making the watermarking process more applicable, but also minimizes potential impacts on model performance. In this letter, we propose an efficient watermarking method for latent diffusion models (LDMs) which is based on Low-Rank Adaptation (LoRA). We specifically choose to add trainable low-rank matrices to the existing weight matrices of the models to embed watermark, while keeping the original weights frozen. Moreover, we also propose a dynamic loss weight tuning algorithm to balance the generative task with the watermark embedding task, ensuring that the model can be watermarked with a limited impact on the quality of the generated images. Experimental results show that the proposed method ensures fast watermark embedding and maintains a very low bit error rate of the watermark, a high-quality of the generated image, and a zero false negative rate (FNR) for verification. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

A Botnet data Collection Method for Industrial Internet 20

A Botnet Data Collection Method for Industrial Internet

引用

20th International Computer Conference on Wavelet Active Media Technology and Information Processing, ICCWAMTIP 2023

作者： Jian, Shu Bo, Xian Chenli, Wang Jiazhong, Lu Yuanyuan, Huang Shuo, Han School of Cybersecurity Chengdu University of Information Technology Sichuan Chengdu610225 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Sichuan Chengdu610225 China Northwestern University Department of Statistics and Data Sciences EvanstonIL60202 United States

ISBN: (纸本)9798350318982

Industrial internet security is related to industrial production operations and national economic security. Network intrusion detection dataset in industrial control environment can effectively train detection models and mitigate network attacks, which is an indispensable component for industrial internet security. In this paper, we propose a data collection method for industrial Internet-oriented botnet by classifying traffic packets according to network traffic features and industrial control identification codes, containing the status of industrial control devices. This method can greatly improve the detection accuracy of the model in the industrial internet. To create a botnet incursion dataset in the industrial control environment, we simultaneously employed the existing industrial control devices to gather both industrial control and botnet network traffic. Finally, we used an AI-based model to detect the botnet. © 2023 IEEE.

关键词： Botnet

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：