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

When Software Security Meets Large Language Models:A Survey

IEEE/CAA Journal of Automatica Sinica 2025年第2期12卷 317-334页

作者： Xiaogang Zhu Wei Zhou Qing-Long Han Wanlun Ma Sheng Wen Yang Xiang IEEE the School of Computer and Mathematical Sciences the University of Adelaide the School of Science Computing and Engineering Technologies Swinburne University of Technology

Software security poses substantial risks to our society because software has become part of our life. Numerous techniques have been proposed to resolve or mitigate the impact of software security issues. Among them, software testing and analysis are two of the critical methods, which significantly benefit from the advancements in deep learning technologies. Due to the successful use of deep learning in software security, recently,researchers have explored the potential of using large language models(LLMs) in this area. In this paper, we systematically review the results focusing on LLMs in software security. We analyze the topics of fuzzing, unit test, program repair, bug reproduction, data-driven bug detection, and bug triage. We deconstruct these techniques into several stages and analyze how LLMs can be used in the stages. We also discuss the future directions of using LLMs in software security, including the future directions for the existing use of LLMs and extensions from conventional deep learning research.

关键词： Large language models (LLMs) software analysis software security software testing

来源：评论

学校读者我要写书评

暂无评论

Robust federated contrastive recommender system against targeted model poisoning attack

引用

science China(Information sciences) 2025年第4期68卷 50-65页

作者： Wei YUAN Chaoqun YANG Liang QU Guanhua YE Quoc Viet Hung NGUYEN Hongzhi YIN School of Electrical Engineering and Computer Science The University of Queensland School of Information and Communication Technology Griffith University Deep Neural Computing Company Limited

Federated recommender systems(FedRecs) have garnered increasing attention recently, thanks to their privacypreserving benefits. However, the decentralized and open characteristics of current FedRecs present at least two ***, the performance of FedRecs is compromised due to highly sparse on-device data for each client. Second, the system's robustness is undermined by the vulnerability to model poisoning attacks launched by malicious users. In this paper, we introduce a novel contrastive learning framework designed to fully leverage the client's sparse data through embedding augmentation, referred to as CL4FedRec. Unlike previous contrastive learning approaches in FedRecs that necessitate clients to share their private parameters, our CL4FedRec aligns with the basic FedRec learning protocol, ensuring compatibility with most existing FedRec implementations. We then evaluate the robustness of FedRecs equipped with CL4FedRec by subjecting it to several state-of-the-art model poisoning attacks. Surprisingly, our observations reveal that contrastive learning tends to exacerbate the vulnerability of FedRecs to these attacks. This is attributed to the enhanced embedding uniformity, making the polluted target item embedding easily proximate to popular items. Based on this insight, we propose an enhanced and robust version of CL4FedRec(rCL4FedRec) by introducing a regularizer to maintain the distance among item embeddings with different popularity levels. Extensive experiments conducted on four commonly used recommendation datasets demonstrate that rCL4FedRec significantly enhances both the model's performance and the robustness of FedRecs.

关键词： federated recommender system contrastive learning model poisoning attack and defense

来源：评论

学校读者我要写书评

暂无评论

RE-SEGNN:recurrent semantic evidence-aware graph neural network for temporal knowledge graph forecasting

引用

science China(Information sciences) 2025年第2期68卷 103-119页

作者： Wenyu CAI Mengfan LI Xuanhua SHI Yuanxin FAN Quntao ZHU Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and Technology

Temporal knowledge graph(TKG) reasoning, has seen widespread use for modeling real-world events, particularly in extrapolation settings. Nevertheless, most previous studies are embedded models, which require both entity and relation embedding to make predictions, ignoring the semantic correlations among different entities and relations within the same timestamp. This can lead to random and nonsensical predictions when unseen entities or relations occur. Furthermore, many existing models exhibit limitations in handling highly correlated historical facts with extensive temporal depth. They often either overlook such facts or overly accentuate the relationships between recurring past occurrences and their current counterparts. Due to the dynamic nature of TKG, effectively capturing the evolving semantics between different timestamps can be *** address these shortcomings, we propose the recurrent semantic evidenceaware graph neural network(RE-SEGNN), a novel graph neural network that can learn the semantics of entities and relations simultaneously. For the former challenge, our model can predict a possible answer to missing quadruples based on semantics when facing unseen entities or relations. For the latter problem, based on an obvious established force, both the recency and frequency of semantic history tend to confer a higher reference value for the current. We use the Hawkes process to compute the semantic trend, which allows the semantics of recent facts to gain more attention than those of distant facts. Experimental results show that RE-SEGNN outperforms all SOTA models in entity prediction on 6 widely used datasets, and 5 datasets in relation prediction. Furthermore, the case study shows how our model can deal with unseen entities and relations.

关键词： knowledge graph reasoning temporal knowledge graph Hawkes process semantic evidence

来源：评论

学校读者我要写书评

暂无评论

Exploring the Effectiveness of OKRs in Enhancing Company Objectives: A Comparative Study

引用

IEEE Engineering Management Review 2025年第2期53卷 110-121页

作者： Criado, Juan M. Gutierrez, Gema Garzas, Javier Cano, Emilio L. De Lena, M. Teresa Gonzalez Moguerza, Javier M. School of Engineering and Computer Science Statistic and Computing Department Mostoles Madrid28933 Spain

The use of management by objectives (MBOs) methodologies, particularly the objectives and key results (OKRs) framework, has gained widespread attention in recent years as a means of improving organizational performance. This article aims to show that OKRs, a key MBO method, can enhance company performance and employee satisfaction. We conducted a comparative and retroactive analysis of MBO methods used in the 20th and 21st centuries, and surveyed 238 people in nine countries and various companies and positions. We analyzed the results of the survey and compared the variables associated with best practices in the OKR methodology. Our study examined a diverse range of companies, positions, qualifications, and ages, which provides an analysis of whether or not OKRs are being used in the organization and a comprehensive understanding of how OKRs can be implemented across in different contexts. By identifying the best variables associated with optimal performance and employee satisfaction, this article provides practical guidance for organizations seeking to adopt OKR methodology. Furthermore, this article can contribute to the development of best practices in the area of management by objectives, particularly in the context of OKRs, leading to more effective and efficient goal-setting practices in organizations. © 2024 IEEE.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Algorithms for online fault tolerance server consolidation

引用

Digital Communications and Networks 2025年第2期11卷 514-523页

作者： Boyu Li Bin Wu Meng Shen Hao Peng Weisheng Li Hong Zhang Jie Gan Zhihong Tian Guangquan Xu College of Intelligence and Computing Tianjin University School of Cyberspace Science and Technology Beijing Institute of Technology School of Computer Science and Technology Zhejiang Normal University School of Computer Science and Technology Chongqing University of Posts and Telecommunications School of Astronautics Beihang University School of Computer Science University of Sydney Cyberspace Institute of Advanced Technology Guangzhou University

We study a novel replication mechanism to ensure service continuity against multiple simultaneous server failures. In this mechanism, each item represents a computing task and is replicated into ξ + 1 servers for some integer ξ ≥ 1, with workloads specified by the amount of required resources. If one or more servers fail, the affected workloads can be redirected to other servers that host replicas associated with the same item, such that the service is not interrupted by the failure of up to ξ servers. This requires that any feasible assignment algorithm must reserve some capacity in each server to accommodate the workload redirected from potential failed servers without overloading, and determining the optimal method for reserving capacity becomes a key issue. Unlike existing algorithms that assume that no two servers share replicas of more than one item, we first formulate capacity reservation for a general arbitrary scenario. Due to the combinatorial nature of this problem, finding the optimal solution is difficult. To this end, we propose a Generalized and Simple Calculating Reserved Capacity(GSCRC) algorithm, with a time complexity only related to the number of items packed in the server. In conjunction with GSCRC, we propose a robust replica packing algorithm with capacity optimization(RobustPack), which aims to minimize the number of servers hosting replicas and tolerate multiple server failures. Through theoretical analysis and experimental evaluations, we show that the RobustPack algorithm can achieve better performance.

关键词： Cloud computing Server consolidation Replica Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Federated learning for Healthcare 5.0: a comprehensive survey, taxonomy, challenges, and solutions

引用

Soft computing 2025年第2期29卷 673-700页

作者： Amin, Muhammad Sadiq Ahmad, Shabir Loh, Woong-Kee School of Electrical and Computer Science National University of Science and Technology Islamabad Pakistan School of Computing Gachon University Seongnam13120 Korea Republic of

The advent of Healthcare 5.0 heralds a groundbreaking revolution in digital healthcare, superseding the achievements of its predecessor, Healthcare 4.0. Integrating cutting-edge technologies such as the Internet of Medical Things (IoMT), smart wearables, and the extraordinary capabilities of Artificial Intelligence (AI), Healthcare 5.0 envisions a unified framework that grants seamless access to health records, fosters interconnectedness among individuals, resources, and institutions, and empowers intelligent responses to medical concerns. However, the realization of Healthcare 5.0 faces a significant challenge in the form of high-speed data transmission using smart devices. Conventional AI approaches relying on centralized data processing raise compelling concerns surrounding information privacy and scalability within the Healthcare 5.0 context. Amidst this backdrop, federated learning emerges as a beacon of hope, offering a decentralized AI paradigm that facilitates on-device machine learning without compromising end-user privacy through centralized data export. Safeguarding data integrity, federated learning holds the key to unlocking the full potential of Healthcare 5.0. In this pioneering study, we conduct an extensive survey, exploring the transformative implications of federated learning within the realm of Healthcare 5.0. By shedding light on recent advancements tailored to this paradigm, we delve into the fundamental concepts of resource-awareness, privacy preservation, incentivization, and personalization, all within the framework of federated learning. Moreover, we meticulously scrutinize key parameters including security, sparsification, quantization, robustness, scalability, and privacy, providing an authentic evaluation of the current progress in federated learning for Healthcare 5.0. This comprehensive survey serves as an indispensable cornerstone for the evolution of Healthcare 5.0, offering invaluable insights into its unique requirements and untapp

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

HDeFC: Hierarchical Secure Fuzzy Deduplication Based on Fog computing

引用

IEEE Internet of Things Journal 2025年第9期12卷 12658-12668页

作者： Tang, Zehui Zeng, Shengke Han, Song Liu, Jun He, Mingxing Xihua University School of Computer and Software Engineering Chengdu610039 China Hangzhou City University School of Computer and Computing Science Hangzhou310015 China

Secure deduplication not only optimizes cloud storage but also prevents data leakage. However, traditional schemes are with high computation and communication costs to deal with large-scale multimedia data. To address this problem, we propose a fog computing-based fuzzy deduplication (HDeFC), a two-stage privacy-preserving deduplication protocol. Our approach prevents guessing attacks and single point of failure, besides that also implements noninteractive Proof of Ownership and label consistency verification. In addition, we also achieve the access permission for only legitimate users. Our performance evaluation shows that the hierarchical setting is efficient in deduplication. © 2014 IEEE.

关键词： Information leakage

来源：评论

学校读者我要写书评

暂无评论

Quantifying and Exploiting Adversarial Vulnerability: Gradient-Based Input Pre-Filtering for Enhanced Performance in Black-Box Attacks

引用

ACM Transactions on Privacy and Security 2025年第2期28卷 1-30页

作者： Karunanayake, Naveen Silva, Bhanuka Ginige, Yasod Seneviratne, Suranga Chawla, Sanjay The University of Sydney School of Computer Science Sydney Australia Qatar Computing Research Institute Doha Qatar

We investigate the vulnerability of inputs in an adversarial setting and demonstrate that certain samples are more susceptible to adversarial perturbations compared to others. Specifically, we employ a simple yet effective approach to quantify the adversarial vulnerability of inputs, which relies on the clipped gradients of the loss with respect to the input. Our observations indicate that inputs with a low percentage of zero gradient components tend to be more vulnerable to attacks. These findings are supported by a theoretical explanation on a linear model and empirical evidence on deep neural networks. Across all datasets we tested, we find that inputs with the lowest zero gradient percentage, on average, exhibit 34.5% more susceptibility to adversarial attacks than randomly selected inputs. Additionally, we demonstrate that the zero gradient percentage, as a metric, transfers across different model architectures. Finally, we propose a novel black-box attack pipeline that enhances the efficiency of conventional query-based black-box attacks and show that input pre-filtering based on Zero Gradient Percentage can boost the attack success rates, particularly under low perturbation levels. On average, across all datasets we test, our approach outperforms the conventional shadow model-based and query-based black-box attack pipelines by 44.9% and 30.4%, respectively. © 2025 Copyright held by the owner/author(s).

关键词： Wiener filtering

来源：评论

学校读者我要写书评

暂无评论

Geometric-like imaginarity:Quantification and state conversion

引用

science China(Physics,Mechanics & Astronomy) 2025年第2期68卷 13-22页

作者： Meng-Li Guo Bo Li Shao-Ming Fei School of Science East China University of TechnologyNanchang 330006China School of Computer and Computing Science Hangzhou City University Hangzhou 310015China School of Mathematical Sciences Capital Normal UniversityBeijing 100048China

From the perspective of resource-theoretic approach,this study explores the quantification of imaginary in quantum *** propose a well defined measure of imaginarity,the geometric-like measure of *** with the usual geometric imaginarity measure,this geometric-like measure of imaginarity exhibits smaller decay difference under quantum noisy channels and higher *** applications,we show that both the optimal probability of state transformations from a pure state to an arbitrary mixed state via real operations,and the maximal probability of stochastic-approximate state transformations from a pure state to an arbitrary mixed state via real operations with a given fidelity f,are given by the geometric-like measure of imaginarity.

关键词： quantum resource theory imaginarity geometric-like channels state transformations

来源：评论

学校读者我要写书评

暂无评论

The Security of Using Large Language Models:A Survey With Emphasis on ChatGPT

引用

IEEE/CAA Journal of Automatica Sinica 2025年第1期12卷 1-26页

作者： Wei Zhou Xiaogang Zhu Qing-Long Han Lin Li Xiao Chen Sheng Wen Yang Xiang the School of Science Computing and Engineering Technologies Swinburne University of Technology IEEE the School of Computer and Mathematical Sciences the University of Adelaide Adelaide the Faculty of Science and Engineering Southern Cross University the School of Information and Physical Sciences the University of Newcastle

ChatGPT is a powerful artificial intelligence(AI)language model that has demonstrated significant improvements in various natural language processing(NLP) tasks. However, like any technology, it presents potential security risks that need to be carefully evaluated and addressed. In this survey, we provide an overview of the current state of research on security of using ChatGPT, with aspects of bias, disinformation, ethics, misuse,attacks and privacy. We review and discuss the literature on these topics and highlight open research questions and future *** this survey, we aim to contribute to the academic discourse on AI security, enriching the understanding of potential risks and mitigations. We anticipate that this survey will be valuable for various stakeholders involved in AI development and usage, including AI researchers, developers, policy makers, and end-users.

关键词： Artificial intelligence (AI) ChatGPT large language models (LLMs) security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：