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

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Huang, Wenke Ye, Mang Shi, Zekun Wan, Guancheng Li, He Du, Bo National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering School of Computer Science Wuhan University Wuhan China Taikang Center for Life and Medical Sciences Wuhan University Wuhan China

Backdoor attacks pose a serious threat to federated systems, where malicious clients optimize on the triggered distribution to mislead the global model towards a predefined target. Existing backdoor defense methods typically require either homogeneous assumption, validation datasets, or client optimization conflicts. In our work, we observe that benign heterogeneous distributions and malicious triggered distributions exhibit distinct parameter importance degrees. We introduce the Fisher Discrepancy Cluster and Rescale (FDCR) method, which utilizes Fisher Information to calculate the degree of parameter importance for local distributions. This allows us to reweight client parameter updates and identify those with large discrepancies as backdoor attackers. Furthermore, we prioritize rescaling important parameters to expedite adaptation to the target distribution, encouraging significant elements to contribute more while diminishing the influence of trivial ones. This approach enables FDCR to handle backdoor attacks in heterogeneous federated learning environments. Empirical results on various heterogeneous federated scenarios under backdoor attacks demonstrate the effectiveness of our method. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Double-Blockchain Assisted Secure and Anonymous Data Aggregation for Fog-Enabled Smart Grid

引用

engineering 2022年第1期8卷 159-169页

作者： Siguang Chen Li Yang Chuanxin Zhao Vijayakumar Varadarajan Kun Wang Jiangsu Key Lab of Broadband Wireless Communication and Internet of Things Nanjing University of Posts and TelecommunicationsNanjing 210003China Jiangsu Engineering Research Center of Communication and Network Technology Nanjing University of Posts and TelecommunicationsNanjing 210003China Anhui Provincial Key Laboratory of Network and Information Security Anhui Normal UniversityWuhu 241000China School of Computer Science and Engineering Vellore Institute of TechnologyChennai 600127India Department of Electrical and Computer Engineering University of CaliforniaLos AngelesCA 90095USA

As a future energy system,the smart grid is designed to improve the efficiency of traditional power systems while providing more stable and reliable ***,this efficient and reliable service relies on collecting and analyzing users’electricity consumption data frequently,which induces various security and privacy *** address these challenges,we propose a double-blockchain assisted secure and anonymous data aggregation scheme for fog-enabled smart grid named ***,we design a three-tier architecture-based data aggregation framework by integrating fog computing and the blockchain,which provides strong support for achieving efficient and secure data collection in smart ***,we develop a secure and anonymous data aggregation mechanism with low computational overhead by jointly leveraging the Paillier encryption,batch aggregation signature and anonymous *** particular,the system achieves fine-grained data aggregation and provides effective support for power dispatching and price adjustment by the designed double-blockchain and two-level data ***,the superiority of the proposed scheme is illustrated by a series of security and computation cost analyses.

关键词： Blockchain Fog computing Homomorphic encryption Smart grid Anonymity

来源：评论

学校读者我要写书评

暂无评论

FedSSP: Federated Graph Learning with Spectral Knowledge and Personalized Preference 38

FedSSP: Federated Graph Learning with Spectral Knowledge and...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Tan, Zihan Wan, Guancheng Huang, Wenke Ye, Mang National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering School of Computer Science Wuhan University Wuhan China Taikang Center for Life and Medical Sciences Wuhan University Wuhan China

Personalized Federated Graph Learning (pFGL) facilitates the decentralized training of Graph Neural networks (GNNs) without compromising privacy while accommodating personalized requirements for non-IID participants. In cross-domain scenarios, structural heterogeneity poses significant challenges for pFGL. Nevertheless, previous pFGL methods incorrectly share non-generic knowledge globally and fail to tailor personalized solutions locally under domain structural shift. We innovatively reveal that the spectral nature of graphs can well reflect inherent domain structural shifts. Correspondingly, our method overcomes it by sharing generic spectral knowledge. Moreover, we indicate the biased message-passing schemes for graph structures and propose the personalized preference module. Combining both strategies, we propose our pFGL framework FedSSP which Shares generic Spectral knowledge while satisfying graph Preferences. Furthermore, We perform extensive experiments on cross-dataset and cross-domain settings to demonstrate the superiority of our framework. The code is available at https://***/OakleyTan/FedSSP. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Knowledge Graph Augmented network Towards Multiview Representation Learning for Aspect-Based Sentiment Analysis

引用

IEEE Transactions on Knowledge and Data engineering 2023年第10期35卷 10098-10111页

作者： Zhong, Qihuang Ding, Liang Liu, Juhua Du, Bo Jin, Hua Tao, Dacheng Wuhan University National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence School of Computer Science Hubei Key Laboratory of Multimedia and Network Communication Engineering Hubei Wuhan430072 China Jd Explore Academy at *** Beijing100101 China Wuhan University Research Center for Graphic Communication Printing and Packaging Institute of Artificial Intelligence Hubei Wuhan430072 China Hospital of Kunming University of Science and Technology Kunming650032 China

Aspect-based sentiment analysis (ABSA) is a fine-grained task of sentiment analysis. To better comprehend long complicated sentences and obtain accurate aspect-specific information, linguistic and commonsense knowledge are generally required in this task. However, most current methods employ complicated and inefficient approaches to incorporate external knowledge, e.g., directly searching the graph nodes. Additionally, the complementarity between external knowledge and linguistic information has not been thoroughly studied. To this end, we propose a knowledge graph augmented network (KGAN), which aims to effectively incorporate external knowledge with explicitly syntactic and contextual information. In particular, KGAN captures the sentiment feature representations from multiple different perspectives, i.e., context-, syntax- and knowledge-based. First, KGAN learns the contextual and syntactic representations in parallel to fully extract the semantic features. Then, KGAN integrates the knowledge graphs into the embedding space, based on which the aspect-specific knowledge representations are further obtained via an attention mechanism. Last, we propose a hierarchical fusion module to complement these multi-view representations in a local-to-global manner. Extensive experiments on five popular ABSA benchmarks demonstrate the effectiveness and robustness of our KGAN. Notably, with the help of the pretrained model of RoBERTa, KGAN achieves a new record of state-of-the-art performance among all datasets. © 1989-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

The Proof is in the Pudding: Decision-Oriented Machine-Type Wireless Video Transmission

The Proof is in the Pudding: Decision-Oriented Machine-Type ...

引用

2024 IEEE Global communications Conference, GLOBECOM 2024

作者： Song, Jie Gao, Yun Wu, Dan Zhou, Liang Qian, Yi Nanjing University of Posts and Telecommunications Ministry of Education Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing China Army Engineering University of Pla Institute of Communications Engineering Nanjing China University of Nebraska-Lincoln Department of Electrical and Computer Engineering Lincoln United States

ISBN: (纸本)9798350351255

With the rise of the Internet of Everything, machine-type wireless video applications like intelligent surveillance are increasingly becoming mainstream network services. However, the massive transmission of video streams heavily burdens wireless networks. Existing methods typically establish a correlation between the transmitted content and the quality of experience or service, making it challenging to balance trade-offs among decision quality, bandwidth utilization, and latency requirements. To address this issue fundamentally, this paper proposes a novel perspective by designing wireless video transmission strategies from the angle of decision quality, where only the content that impacts the decision outcomes is transmitted. The highlight of this paper is designing a lightweight yet efficient binary classifier that predicts whether the current content will change decision outcomes based on content discrepancies, measured only through pixel-level differences and macroblock-level similarity. Furthermore, these discrepancies can be used to distinguish the background, thereby further saving bandwidth by reusing the background information. Additionally, a fine-tuning module is incorporated to flexibly update the classifier model, ensuring adaptability across various scenarios. Extensive results demonstrate that the proposed strategy achieves over 81% redundant bandwidth savings while maintaining decision quality and catering to strict latency requirements on computation-constrained devices. © 2024 IEEE.

关键词： Television transmission

来源：评论

学校读者我要写书评

暂无评论

A Theory of Transfer-Based Black-Box Attacks: Explanation and Implications 37

A Theory of Transfer-Based Black-Box Attacks: Explanation an...

引用

37th Conference on Neural Information Processing Systems, NeurIPS 2023

作者： Chen, Yanbo Liu, Weiwei School of Computer Science Wuhan University National Engineering Research Center for Multimedia Software Wuhan University Institute of Artificial Intelligence Wuhan University Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University

ISBN: (纸本)9781713899921

Transfer-based attacks [1] are a practical method of black-box adversarial attacks in which the attacker aims to craft adversarial examples from a source model that is transferable to the target model. Many empirical works [2-6] have tried to explain the transferability of adversarial examples from different angles. However, these works only provide ad hoc explanations without quantitative analyses. The theory behind transfer-based attacks remains a mystery. This paper studies transfer-based attacks under a unified theoretical framework. We propose an explanatory model, called the manifold attack model, that formalizes popular beliefs and explains the existing empirical results. Our model explains why adversarial examples are transferable even when the source model is inaccurate as observed in Papernot et al. [7]. Moreover, our model implies that the existence of transferable adversarial examples depends on the "curvature" of the data manifold, which further explains why the success rates of transfer-based attacks are hard to improve. We also discuss our model's expressive power and applicability. © 2023 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Diverse Co-saliency Feature Learning for Text-Based Person Retrieval

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 5465-5477页

作者： You, Shuai Chen, Cuiqun Feng, Yujian Liu, Hai Ji, Yimu Ye, Mang Nanjing University of Posts and Telecommunications (NJUPT) School of Internet of Things Nanjing China Anhui University School of Computer Science and Technology Hefei China South China Normal University school of computer Guangdong China NJUPT School of Computer Science Nanjing China Wuhan University National Engineering Research Center for Multimedia Software Hubei Key Laboratory of Multimedia and Network Communication Engineering Institute of Artificial Intelligence School of Computer Science Wuhan 430072 China

Text-based Person Retrieval (TPR) plays a pivotal role in video surveillance systems for safeguarding public safety. As a fine-grained retrieval task, TPR faces the significant challenge of precisely capturing highly discriminative features across image and text modalities. Existing methods primarily focus on establishing modality-shared feature spaces to bridge cross-modal discrepancies. However, these methods are prone to disturbances from irrelevant information, such as background noises in the visual modality, and often over-emphasize specific local regions while neglecting the capture of diverse discriminative modal features, thereby limiting the robustness of cross-modal matching. In this paper, we introduce a novel framework, termed the Diverse Co-saliency Feature Learning network (DCFL), which mines the co-saliency information between image and text modalities and enhances the diversity of cross-modal discriminative features while mitigating the interference of noise. Specifically, to construct cross-modal co-saliency features, we devise the Intra-modal Saliency Feature Learning (ISFL) and Cross-modal Saliency Feature Matching (CSFM) modules. ISFL employs a weighted mask mechanism to guide the model in reducing the impact of noise information in both modalities. Complementing ISFL, CSFM establishes consistent relationships between saliency features across modalities, leveraging text descriptions to align pedestrian-relevant visual regions. Furthermore, we propose the Diverse Co-saliency Feature Mining (DCFM) to bolster the diversity of discriminative co-saliency features across both image and text modalities. This module integrates a diversity regularization term, enabling the extraction of varied visual cues and capturing comprehensive features of the target individual. Extensive benchmark experiments demonstrate a substantial superiority of our approach over the state-of-the-art methods. The code will be released publicly. © 2005-2012 IEEE.

关键词： Co-saliency features modeling Diverse Co-saliency features Mining Text-based person retrieval

来源：评论

学校读者我要写书评

暂无评论

Adversarial Self-Training Improves Robustness and Generalization for Gradual Domain Adaptation 37

Adversarial Self-Training Improves Robustness and Generaliza...

引用

37th Conference on Neural Information Processing Systems, NeurIPS 2023

作者： Shi, Lianghe Liu, Weiwei School of Computer Science Wuhan University National Engineering Research Center for Multimedia Software Wuhan University Institute of Artificial Intelligence Wuhan University Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University

ISBN: (纸本)9781713899921

Gradual Domain Adaptation (GDA), in which the learner is provided with additional intermediate domains, has been theoretically and empirically studied in many contexts. Despite its vital role in security-critical scenarios, the adversarial robustness of the GDA model remains unexplored. In this paper, we adopt the effective gradual self-training method and replace vanilla self-training with adversarial self-training (AST). AST first predicts labels on the unlabeled data and then adversarially trains the model on the pseudo-labeled distribution. Intriguingly, we find that gradual AST improves not only adversarial accuracy but also clean accuracy on the target domain. We reveal that this is because adversarial training (AT) performs better than standard training when the pseudo-labels contain a portion of incorrect labels. Accordingly, we first present the generalization error bounds for gradual AST in a multiclass classification setting. We then use the optimal value of the Subset Sum Problem to bridge the standard error on a real distribution and the adversarial error on a pseudo-labeled distribution. The result indicates that AT may obtain a tighter bound than standard training on data with incorrect pseudo-labels. We further present an example of a conditional Gaussian distribution to provide more insights into why gradual AST can improve the clean accuracy for GDA. © 2023 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cycle Self-Refinement for Multi-Source Domain Adaptation 38

Cycle Self-Refinement for Multi-Source Domain Adaptation

引用

38th AAAI Conference on Artificial Intelligence, AAAI 2024

作者： Zhou, Chaoyang Wang, Zengmao Du, Bo Luo, Yong School of Computer Science Wuhan University China National Engineering Research Center for Multimedia Software Wuhan University China Institute of Artificial Intelligence Wuhan University China Key Laboratory of Multimedia and Network Communication Engineering Wuhan University China Hubei Luojia Laboratory China

ISBN: (纸本)1577358872

Multi-source domain adaptation (MSDA) aims to transfer knowledge from multiple source domains to the unlabeled target domain. In this paper, we propose a cycle self-refinement domain adaptation method, which progressively attempts to learn the dominant transferable knowledge in each source domain in a cycle manner. Specifically, several source-specific networks and a domain-ensemble network are adopted in the proposed method. The source-specific networks are adopted to provide the dominant transferable knowledge in each source domain for instance-level ensemble on predictions of the samples in target domain. Then these samples with high-confidence ensemble predictions are adopted to refine the domain-ensemble network. Meanwhile, to guide each source-specific network to learn more dominant transferable knowledge, we force the features of the target domain from the domain-ensemble network and the features of each source domain from the corresponding source-specific network to be aligned with their predictions from the corresponding networks. Thus the adaptation ability of source-specific networks and the domain-ensemble network can be improved progressively. Extensive experiments on Office-31, Office-Home and DomainNet show that the proposed method outperforms the state-of-the-art methods for most tasks. Copyright © 2024, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Lattice-Based Cryptography and NTRU: Quantum-Resistant Encryption Algorithms 4

Lattice-Based Cryptography and NTRU: Quantum-Resistant Encry...

引用

4th International Conference on Emerging Systems and Intelligent Computing, ESIC 2024

作者： Nisha, F. Lenin, J. Saravanan, S.K. Rohit, V. Robin Selvam, P.D. Rajmohan, M. Cmr University School of Engineering and Technology Computer Science & Engineering Karnataka Bengaluru India Alliance University Alliance College of Engineering and Design Department of Computer Science & Engineering Karnataka Bengaluru India Simats Saveetha School of Engineering Department of BigData and Network Security Tamil Nadu Chennai India Presidency University Computer Science & Engineering School of Computer Science & Engineering and Information Science Karnataka Bengaluru India Vel Tech High Tech Dr.Rangarajan Dr.Sakunthala Engineering College Department of Electronics and Communication Engineering Tamil Nadu Chennai India Hindustan Institute of Technology and Science Department of Electronics and Communication Engineering Tamil Nadu Chennai India

ISBN: (纸本)9798350349856

The quantum-resistant qualities of various encryption methods, such as N-th degree Truncated polynomial Ring Units (NTRU) Encrypt, NTRU Sign, Ring-Lizard, and Kyber protocols are becoming more important in light of the ever-evolving nature of digital threats. An-depth analysis of the mathematical derivation of these algorithms, as well as a determination of their computing efficiency and resistance to quantum assaults is discussed in this paper. Techniques of the Ring-Lizard and Kyber algorithms to lattice-based encryption are analyzed. The study gives an overview of quantum-resistant capabilities of these algorithms and their performance measures. Strengths and weaknesses of the NTRU Encrypt, NTRU Sign, Ring-Lizard, and Kyber algorithms are discussed. The results give useful insights for cybersecurity practitioners, academics, and policymakers, aiding them in making educated choices to protect digital infrastructures against quantum attacks. © 2024 IEEE.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：