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

Aligning enhanced feature representation for generalized zero-shot learning

Science China(Information Sciences) 2025年第2期68卷 74-88页

作者： Zhiyu FANG Xiaobin ZHU Chun YANG Hongyang ZHOU Jingyan QIN Xu-Cheng YIN School of Computer & Communication Engineering University of Science and Technology Beijing

Constructing an effective common latent embedding by aligning the latent spaces of cross-modal variational autoencoders（VAEs） is a popular strategy for generalized zero-shot learning（GZSL）. However, due to the lack of fine-grained instance-wise annotations, existing VAE methods can easily suffer from the posterior collapse problem. In this paper, we propose an innovative asymmetric VAE network by aligning enhanced feature representation（AEFR） for GZSL. Distinguished from general VAE structures, we designed two asymmetric encoders for visual and semantic observations and one decoder for visual reconstruction. Specifically, we propose a simple yet effective gated attention mechanism（GAM） in the visual encoder for enhancing the information interaction between observations and latent variables, alleviating the possible posterior collapse problem effectively. In addition, we propose a novel distributional decoupling-based contrastive learning（D2-CL） to guide learning classification-relevant information while aligning the representations at the taxonomy level in the latent representation space. Extensive experiments on publicly available datasets demonstrate the state-of-the-art performance of our method. The source code is available at https://***/seeyourmind/AEFR.

关键词： generalized zero-shot learning gated attention mechanism contrastive learning multi-modal alignment

来源：评论

学校读者我要写书评

暂无评论

A Novel Certificateless Signature-based Access Control Scheme for Named In-network Computing Service

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer Science 2025年第1期52卷 38-45页

作者： Li, Wanji Liu, Qiangbin Zhu, Yi School of Computer Science and Communication Engineering Jiangsu University Zhenjiang China School of Computer Science and Communication Engineering Jiangsu University Zhenjiang China School of Computer Science and Communication Engineering the Dean of Department of Communication Engineering Jiangsu University Zhenjiang China

Named in-network computing service (NICS) is a potential computing paradigm emerged recently. Benefitted from the characteristics of named addressing and routing, NICS can be flexibly deployed on NDN router side and provide nearby computing service to Internet users. But the NICS feature of dynamic deployment also causes serious security risk of access control. How to independently check out the subscription relationship between requester and requested computing service on NICS side become a challenge. To solve this problem, we propose a novel certificateless signature-based access control scheme (CS-ACS) in this paper. In CS-ACS, the entire user public-private key pairs consist of two parts, user side and source server side. Where, the user public-private key pairs (server side) are generated according to the user ID, service subscription relationship and subscription expiration time. Based on this special design, when authorized user signs the interest packet of invoking specific service using its private key, the NICS can verify the signature then check out whether the requester is a valid subscriber and the subscription is expired or not. Simulation results show that, comparing with fundamental solutions, CS-ACS can avoid extra secret key storage cost on NICS side and markedly shorten authentication delay. © (2025), (International Association of Engineers). All rights reserved.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Defending Federated Learning System from Poisoning Attacks via Efficient Unlearning

引用

computers, Materials & Continua 2025年第4期83卷 239-258页

作者： Long Cai Ke Gu Jiaqi Lei School of Computer and Communication Engineering Changsha University of Science and TechnologyChangsha410114China

Large-scale neural networks-based federated learning(FL)has gained public recognition for its effective capabilities in distributed ***,the open system architecture inherent to federated learning systems raises concerns regarding their vulnerability to potential *** attacks turn into a major menace to federated learning on account of their concealed property and potent destructive *** altering the local model during routine machine learning training,attackers can easily contaminate the global *** detection and aggregation solutions mitigate certain threats,but they are still insufficient to completely eliminate the influence generated by ***,federated unlearning that can remove unreliable models while maintaining the accuracy of the global model has become a *** some existing federated unlearning approaches are rather difficult to be applied in large neural network models because of their high computational ***,we propose SlideFU,an efficient anti-poisoning attack federated unlearning *** primary concept of SlideFU is to employ sliding window to construct the training process,where all operations are confined within the *** design a malicious detection scheme based on principal component analysis(PCA),which calculates the trust factors between compressed models in a low-cost way to eliminate unreliable *** confirming that the global model is under attack,the system activates the federated unlearning process,calibrates the gradients based on the updated direction of the calibration *** on two public datasets demonstrate that our scheme can recover a robust model with extremely high efficiency.

关键词： Federated learning malicious client detection model recovery machine unlearning

来源：评论

学校读者我要写书评

暂无评论

PriChain: Efficient Privacy-Preserving Fine-Grained Redactable Blockchains in Decentralized Settings

引用

Chinese Journal of Electronics 2025年第1期34卷 82-97页

作者： Hongchen Guo Weilin Gan Mingyang Zhao Chuan Zhang Tong Wu Liehuang Zhu Jingfeng Xue School of Computer Science and Technology Beijing Institute of Technology School of Cyberspace Science and Technology Beijing Institute of Technology School of Computer and Communication Engineering University of Science and Technology Beijing

Recently, redactable blockchain has been proposed and leveraged in a wide range of real systems for its unique properties of decentralization, traceability, and transparency while ensuring controllable on-chain data redaction. However, the development of redactable blockchain is now obstructed by three limitations, which are data privacy breaches, high communication overhead, and low searching efficiency, respectively. In this paper, we propose PriChain, the first efficient privacy-preserving fine-grained redactable blockchain in decentralized settings. PriChain provides data owners with rights to control who can read and redact on-chain data while maintaining downward compatibility, ensuring the one who can redact will be able to read. Specifically, inspired by the concept of multi-authority attribute-based encryption, we utilize the isomorphism of the access control tree, realizing fine-grained redaction mechanism, downward compatibility, and collusion resistance. With the newly designed structure, PriChain can realize O（n） communication and storage overhead compared to prior O（n2） schemes. Furthermore, we integrate multiple access trees into a tree-based dictionary, optimizing searching efficiency. Theoretical analysis proves that PriChain is secure against the chosen-plaintext attack and has competitive complexity. The experimental evaluations show that PriChain realizes 10× efficiency improvement of searching and 100× lower communication and storage overhead on average compared with existing schemes.

关键词： Resistance Access control Data privacy Dictionaries Blockchains Encryption Complexity theory Usability Protection

来源：评论

学校读者我要写书评

暂无评论

A Transferable-experience-based Routing Mechanism for Named Computing Power Network

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer Science 2025年第4期52卷 1235-1243页

作者： Dai, Yakai Zhu, Yi School of Computer Science and Communication Engineering Jiangsu University Zhenjiang212013 China

Computing-aware routing is the core technology of Computing Power Network. Through independently determining the forwarding target in each router, computingaware routing aims at scheduling the computing task to an optimal Computing Service Provider (CSP). However, current computing-aware routing schemes only depend on the collected computing and network resource information, do not consider the experience of CSPs in handling similar tasks, resulting in excessive invocation time. Facing this problem, this paper proposes a novel routing mechanism based on transfer learning experience in named computing power network (NRS-TLE). NRS-TLE introduces the accuracy of trained classification models as the experience of CSP, and design a tcce-function to evaluate the task completion capabilities of different CSPs at NDN routers. Based on the evaluation results of the tcce- function, NDN routers further perform a probabilistic routing scheme. The simulation results show that, comparing with traditional routing scheme SAC-NSGA-II, the computing service invocation time under NRS-TLE will decrease by a minimum of 26.42% and a maximum of 40.22%. © 2025 IAENG International Journal of computer Science

关键词： Computing power

来源：评论

学校读者我要写书评

暂无评论

A blockchain-based privacy-preserving and collusion-resistant scheme(PPCR)for double auctions

引用

Digital communications and Networks 2025年第1期11卷 116-125页

作者： Xuedan Jia Liangmin Wang Ke Cheng Pujie Jing Xiangmei Song School of Computer Science and Communication Engineering Jiangsu UniversityZhenjiang 212013China School of Cyber Science and Engineering Southeast UniversityNanjing 211102China School of Computer Science and Technology Xidian UniversityXi’an 710071China

Electronic auctions(e-auctions)remove the physical limitations of traditional auctions and bring this mechanism to the general ***,most e-auction schemes involve a trusted auctioneer,which is not always credible in *** studies have applied cryptography tools to solve this problem by distributing trust,but they ignore the existence of *** this paper,a blockchain-based Privacy-Preserving and Collusion-Resistant scheme(PPCR)for double auctions is proposed by employing both cryptography and blockchain technology,which is the first decentralized and collusion-resistant double auction scheme that guarantees bidder anonymity and bid privacy.A two-server-based auction framework is designed to support off-chain allocation with privacy preservation and on-chain dispute resolution for collusion resistance.A Dispute Resolution agreement(DR)is provided to the auctioneer to prove that they have conducted the auction correctly and the result is fair and *** addition,a Concise Dispute Resolution protocol(CDR)is designed to handle situations where the number of accused winners is small,significantly reducing the computation cost of dispute *** experimental results confirm that PPCR can indeed achieve efficient collusion resistance and verifiability of auction results with low on-chain and off-chain computational overhead.

关键词： Privacy protection Collusion resistance Secure protocol Blockchain-based double auction Dispute resolution

来源：评论

学校读者我要写书评

暂无评论

Preamble slice orderly queue access scheme in cell-free dense communication systems

引用

Digital communications and Networks 2025年第1期11卷 126-135页

作者： Jun Sun Mengzhu Guo Jian Liu School of Telecommunications and Information Engineering Nanjing University of Posts and TelecommunicationsNanjing 210003China School of Computer and Communication Engineering University of Science and TechnologyBeijing 100083China

High reliability applications in dense access scenarios have become one of the main goals of 6G *** solve the access collision of dense Machine Type communication(MTC)devices in cell-free communication systems,an intelligent cooperative secure access scheme based on multi-agent reinforcement learning and federated learning is proposed,that is,the Preamble Slice Orderly Queue Access(PSOQA)*** this scheme,the preamble arrangement is combined with the access *** preamble arrangement is realized by preamble slices which is from the virtual preamble *** access devices learn to queue orderly by deep reinforcement *** orderly queue weakens the random and avoids collision.A preamble slice is assigned to an orderly access queue at each access *** orderly queue is determined by interaction information among multiple *** the federated reinforcement learning framework,the PSOQA scheme is implemented to guarantee the privacy and security of ***,the access performance of PSOQA is compared with other random contention schemes in different load *** results show that PSOQA can not only improve the access success rate but also guarantee low-latency tolerant performances.

关键词： Machine type communication Random access Reinforcement learning Access success probability Federated learning

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving explainable AI: a survey

引用

Science China(Information Sciences) 2025年第1期68卷 23-56页

作者： Thanh Tam NGUYEN Thanh Trung HUYNH Zhao REN Thanh Toan NGUYEN Phi Le NGUYEN Hongzhi YIN Quoc Viet Hung NGUYEN School of Information and Communication Technology Griffith University School of Computer and Communication Sciences Ecole Polytechnique Federale de Lausanne Faculty of Mathematics and Computer Science University of Bremen Faculty of Information Technology HUTECH University Department of Computer Science Hanoi University of Science and Technology School of Electrical Engineering and Computer Science The University of Queensland

As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.

关键词： privacy-preserving explainable AI privacy attacks privacy defences PrivEx PPXAI

来源：评论

学校读者我要写书评

暂无评论

Fake Face Detection Based on Fusion of Spatial Texture and High-Frequency Noise

引用

Chinese Journal of Electronics 2025年第1期34卷 212-221页

作者： Dengyong Zhang Feifan Qi Jiahao Chen Jiaxin Chen Rongrong Gong Yuehong Tian Lebing Zhang Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication Engineering Changsha University of Science and Technology School of Computer and Communication Engineering Changsha University of Science and Technology Changsha Social Work College Changkuangao Beijing Technology Co. Ltd. School of Computer and Artificial Intelligence Huaihua University

The rapid development of the Internet has led to the widespread dissemination of manipulated facial images, significantly impacting people's daily lives. With the continuous advancement of Deepfake technology, the generated counterfeit facial images have become increasingly challenging to distinguish. There is an urgent need for a more robust and convincing detection method. Current detection methods mainly operate in the spatial domain and transform the spatial domain into other domains for analysis. With the emergence of transformers, some researchers have also combined traditional convolutional networks with transformers for detection. This paper explores the artifacts left by Deepfakes in various domains and, based on this exploration, proposes a detection method that utilizes the steganalysis rich model to extract high-frequency noise to complement spatial features. We have designed two main modules to fully leverage the interaction between these two aspects based on traditional convolutional neural networks. The first is the multi-scale mixed feature attention module, which introduces artifacts from high-frequency noise into spatial textures, thereby enhancing the model's learning of spatial texture features. The second is the multi-scale channel attention module, which reduces the impact of background noise by weighting the features. Our proposed method was experimentally evaluated on mainstream datasets, and a significant amount of experimental results demonstrate the effectiveness of our approach in detecting Deepfake forged faces, outperforming the majority of existing methods.

关键词： Deepfakes Adaptation models Attention mechanisms Noise Transforms Transformers Feature extraction Internet Convolutional neural networks Faces

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：