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

18th International Conference on Wireless Artificial Intelligent Computing Systems and Applications, WASA 2024

作者： Zhang, Jie Zhang, Hongliang Wang, Guijuan Dong, Anming Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan250353 China

ISBN: (纸本)9783031714665

Federated learning (FL) is an emerging distributed machine learning paradigm that enables participants to cooperatively train learning tasks without revealing the raw data. However, the distributed nature of FL makes it susceptible to poisoning attacks, especially when the local data of participants are non-independent and identically diatributed (non-IID). Although several defense methods have been proposed to mitigate poisoning attacks, their effectiveness is limited by the specific assumptions about the data distribution. In this work, we propose a new defense strategy, FedAPA (Federated Prototype Learning Against Poisoning Attacks). Specifically, we use abstract class prototypes to communicate between the clients and server, thus effectively alleviating the impact of non-IID data. Moreover, we propose a new abnormal client detection method that aims to mitigate the impact of malicious clients while distinguishing between malicious and benign clients, thereby effectively defending against poisoning attacks. Extensive experiments on different datasets show that FedAPA can effectively resist the poisoning attacks under various data distributions. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Multi-class Bitcoin mixing service identification based on graph classification

引用

Digital Communications and networks 2024年第6期10卷 1881-1893页

作者： Xiaoyan Hu Meiqun Gui Guang Cheng Ruidong Li Hua Wu School of Cyber Science&Engineering Southeast UniversityNanjing 211189China Purple Mountain Laboratories for Network and Communication Security Nanjing 211111China Jiangsu Provincial Engineering Research Center of Security for Ubiquitous Network Nanjing 211189China Key Laboratory of Computer Network and Information Integration Southeast UniversityMinistry of EducationChina Research Base of International Cyberspace Governance Southeast UniversityNanjing 211189China Institute of Science and Engineering Kanazawa UniversityKakumaKanazawa920-1192Japan

Due to its anonymity and decentralization,Bitcoin has long been a haven for various illegal *** generally legalize illicit funds by Bitcoin mixing ***,it is critical to investigate the mixing services in cryptocurrency anti-money *** studies treat different mixing services as a class of suspicious Bitcoin ***,they are limited by relying on expert experience or needing to deal with large-scale *** far,multi-class mixing service identification has not been explored *** is challenging since mixing services share a similar procedure,presenting no sharp ***,mixing service identification facilitates the healthy development of Bitcoin,supports financial forensics for cryptocurrency regulation and legislation,and provides technical means for fine-grained blockchain *** paper aims to achieve multi-class Bitcoin Mixing Service Identification with a Graph Classification(BMSI-GC)***,BMSI-GC constructs 2-hop ego networks(2-egonets)of mixing services based on their historical ***,it applies graph2vec,a graph classification model mainly used to calculate the similarity between graphs,to automatically extract address features from the constructed ***,it trains a multilayer perceptron classifier to perform classification based on the extracted ***-GC is flexible without handling the full-size network and handcrafting address ***,the differences in transaction patterns of mixing services reflected in the 2-egonets provide adequate information for *** experimental study demonstrates that BMSI-GC performs excellently in multi-class Bitcoin mixing service identification,achieving an average identification F1-score of 95.08%.

关键词： Bitcoin Anti-money laundering Mixing service Ego network Graph classification

来源：评论

学校读者我要写书评

暂无评论

Weighted Adversarial Transfer network-Based Fault Diagnosis Method for Gearboxes 11

Weighted Adversarial Transfer Network-Based Fault Diagnosis ...

引用

11th Joint International information Technology and Artificial Intelligence Conference, ITAIC 2023

作者： Wang, Dan Meng, Qinglong Hao, Huijuan Cheng, Guanghe Tang, Yongwei Bai, Jinqiang Key Laboratory of Computing Power Network and Information Security Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350333664

In this paper, we address the issue of gearbox fault diagnosis under changing working conditions and the limitations of migration learning algorithms that are only applicable to scenarios with identical labels in both the source and target domains. Our proposed solution is a weighted adversarial migration network model that is based on weighted adversarial migration. To transfer knowledge from the source domain to the target domain, we use transfer learning. Additionally, to tackle the problem of new fault classes in the target domain, we utilize a deep residual network to extract similar data features between different working conditions. This allows us to train a labelled classifier to identify known fault classes and some new target samples in both the source and target domains. We generate weights using auxiliary classifiers and discriminators to assess the importance of matching feature distributions between the known and unknown classes of samples. The experimental results demonstrate that our model can successfully migrate labelled datasets to unlabelled similar datasets in open set scenarios. It also has excellent fault diagnosis capabilities and high accuracy for gearboxes with variable operating conditions. © 2023 IEEE.

关键词： adversarial training deep transfer learning fault diagnosis weighting strategy

来源：评论

学校读者我要写书评

暂无评论

Optimization Strategy for Remote Differential Upgrade of IoT Firmware 11

Optimization Strategy for Remote Differential Upgrade of IoT...

引用

11th Joint International information Technology and Artificial Intelligence Conference, ITAIC 2023

作者： Ding, Wenkang Sun, Ruirui Meng, Qinglong Wan, Zhong Cheng, Guanghe Hao, Huijuan Bai, Jinqiang Key Laboratory of Computing Power Network and Information Security Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350333664

With the continuous increase of IoT devices, the management and optimization of devices become particularly important. The update cycle of device functions is short, and in order to facilitate management and optimize device performance, a fast and convenient upgrade method is needed to solve this problem. Remote upgrade technology is mainly divided into full package upgrade and differential upgrade. Compared to full package upgrade, differential upgrade has obvious advantages in remote upgrade of large files. The main problem with current differential upgrade is the problem of slow generation speed while ensuring a certain size range of differential packages. This article proposes an improved Bsdiff algorithm to solve the problem of slow generation speed of differential packages. Experimental verification shows that the efficiency of remote upgrade has been improved, Improved the speed of differential packet generation and upgrade efficiency while ensuring the size of differential packets. © 2023 IEEE.

关键词： Block Optimization Strategy Bsdiff Difference Algorithm IoT Firmware Libdivsufsort Remote Upgrade

来源：评论

学校读者我要写书评

暂无评论

A Novel Construction of Updatable Identity-Based Hash Proof System and Its Applications

引用

Chinese Journal of Electronics 2023年第3期32卷 564-576页

作者： QIAO Zirui ZHOU Yanwei YANG Bo ZHANG Wenzheng ZHANG Mingwu School of Computer Science Shaanxi Normal University State Key Laboratory of Cryptology Science and Technology on Communication Security Laboratory Henan Key Laboratory of Network Cryptography Technology School of Computere Hubei University of Technology

In the previous works, to further provide the continuous leakage resilience for the identity-based encryption scheme, a new cryptography primitive, called updatable identity-based hash proof system(U-IB-HPS),was proposed. However, most of the existing constructions have some deficiencies, they either do not have perfect key update function or the corresponding security with tight reduction relies on a non-static complexity assumption. To address the above problems, a new construction of U-IB-HPS is created, and the corresponding security of our system is proved based on the static complexity assumption. Also, the corresponding comparisons and analysis of performances show that our proposal not only achieves the perfect key update function and the anonymity, but also has the tight security reduction. In additional, our proposal achieves the same computational efficiency as other previous systems. To further illustrate the practical function of U-IB-HPS, a generic method of non-interactive data authorization protocol with continuous leakage resilience is designed by employing U-IB-HPS as an underlying tool, which can provide continuous leakage-resilient data authorization function for the cloud computing. Hence, the application field of U-IB-HPS is further extended through our study.

关键词： Authorization Cloud computing Protocols Identity-based encryption Complexity theory Computational efficiency Proposals

来源：评论

学校读者我要写书评

暂无评论

Job2Vec: A Self-Supervised Contrastive Learning Based HPC Job Power Consumption Prediction Framework 29

Job2Vec: A Self-Supervised Contrastive Learning Based HPC Jo...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Zhang, Jie Song, Jian Li, Xiang Tian, Xuesen Zhao, Zhigang Wu, Lu Wang, Chunxiao Key Laboratory of Computing Power Network and Information Security Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350330717

In the context of the rapid development of big data and artificial intelligence, the field of HPC is facing significant challenges in energy consumption. To address this challenge, this paper proposes a power consumption prediction framework for HPC jobs based on self-supervised contrastive learning, named Job2Vec. Firstly, HPC jobs are clustered into different clusters based on job logs and power consumption curve shapes. Next, high-quality features of power consumption data at different granularities within each cluster are captured through self-supervised contrastive learning. Lastly, an incremental update strategy is introduced to handle the dynamic changes in HPC data. The experimental results demonstrate that, on the Jinan Supercomputing dataset comprising 1170 HPC jobs, the Job2Vec framework outperforms the baseline models overall in terms of prediction performance. Additionally, we also investigated the model's performance in single-step and multi-step forecasting, the impact of different indicators on prediction accuracy, and conducted ablation experiments to confirm the indispensability of each module. This is the first time that self-supervised contrastive learning has been introduced into the HPC field, aiming to provide support for energy scheduling in data centers. © 2023 IEEE.

关键词： Contrastive Learning HPC Power Consumption Prediction

来源：评论

学校读者我要写书评

暂无评论

JTEA: Implementing Semi-Supervised Entity Alignment Using Joint Teaching Strategies

JTEA: Implementing Semi-Supervised Entity Alignment Using Jo...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Lu, Kai Zhao, Jing Ding, Lichao Hao, Zenghao Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan China Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781665410205

Entity alignment(EA) aims to identify equivalent entities in different knowledge graphs or data sources and establish correspondences between them. In recent years, embedding-based methods have made significant progress in the field of entity alignment, yet the shortage of adequate training data (i.e., seed entity pairs) continues to be a primary challenge. Traditional semi-supervised methods typically address this issue by generating potential mappings (i.e., pseudo-mappings) for unlabeled entities. However, these methods often suffer from the influence of erroneous potential mappings or overlook the uncertainty of potential mappings. Therefore, we propose a novel semi-supervised entity alignment method called JTEA. This method combines seed entity pairs with potential mappings through end-to-end joint training, providing strong guidance for model training. In constructing potential mappings, we propose a bidirectional matching strategy (BMS), which generates more detailed potential mappings by jointly adjusting decisions in different directions and uses a joint matching confidence score to characterize its uncertainty. Furthermore, we also introduce a method of matching diversity alignment selection, aiming to screen out more reliable entity alignments to further improve the performance and stability of the model. We conducted a large number of experiments on the benchmark dataset to fully validate the effectiveness of the JTEA method. © 2024 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

SCARE: A Novel Framework to Enhance Chinese Harmful Memes Detection

引用

IEEE Transactions on Affective Computing 2024年第02期16卷 933-945页

作者： Gu, Tianlong Feng, Mingfeng Feng, Xuan Wang, Xuemin Jinan University College of Information Science and Technology College of Cyber Security Guangzhou China Guilin University of Electronic Science and Technology College of Computer and Information Security Guilin541004 China Guangxi Key Laboratory of Trusted Software Guilin541004 China

Harmful meme detection presents a significant multimodal challenge that necessitates contextual background knowledge and comprehensive inference. Although some research studies have been related to harmful meme detection in English, detecting harmful memes in Chinese is also an unresolved issue. In this paper, to bridge this gap, we constructed a Chinese harmful meme detection dataset, named CHMEMES. Furthermore, existing multimodal alignment methods have shown poor performance in tasks involving harmful meme detection, where there is a mismatch between the image and text components. To improve the task, we propose a multimodal framework Semantic Contrastive Alignment fRamEwork (SCARE), which enables fully representing both cross-modal and intra-modal information. For cross-modal information, we introduce a crossmodal contrast alignment objective to maximize the mutual information between image and text. For intra-modal information, we design a new intra-modal contrast objective to achieve more robust visual and textual representation learning. Moreover, we present a simple yet efficient vision prompt tuning paradigm for parameter-efficient harmful meme detection. We conduct extensive experiments on the constructed Chinese dataset and the existing English dataset. Experimental results show that our method outperforms state-of-the-art baselines in harmful meme detection. © 2010-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Semantic Relation-Based Cross Attention network for Image-Text Retrieval

Semantic Relation-Based Cross Attention Network for Image-Te...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Zhou, Huanxiao Geng, Yushui Zhao, Jing Ma, Xishan Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan China Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China Jinan China

ISBN: (纸本)9781665410205

Image-text retrieval refers to querying the text or image of another modality given an image or text, and its key lies in the ability to accurately measure the similarity between text and image. Most of the existing retrieval methods only utilize the intramodal relations of each modality or the intermodal relations of the two modalities to perform the retrieval task. To address the above problems, we integrate the intra-modal and inter-modal relations and propose a Semantic Relation-based Cross Attention network(SRCAN). In our proposed method, we first mine the possible intra-modal associations between regions in an image and between words in a text to obtain features with semantic relationships, and then capture the fine-grained associations between segments through the cross-attention mechanism. Finally, we balance the intra-modal and inter-modal relationships to improve the performance of the model. Our proposed method is experimentally validated on two datasets, Flickr30K and MS-COCO, and the experimental results show that our method achieves superior results. © 2024 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ADACQR: Enhancing Query Reformulation for Conversational Search via Sparse and Dense Retrieval Alignment 31

ADACQR: Enhancing Query Reformulation for Conversational Sea...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Lai, Yilong Wu, Jialong Zhang, Congzhi Sun, Haowen Zhou, Deyu School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University China

ISBN: (纸本)9798891761964

Conversational Query Reformulation (CQR) has significantly advanced in addressing the challenges of conversational search, particularly those stemming from the latent user intent and the need for historical context. Recent works aimed to boost the performance of CQR through alignment. However, they are designed for one specific retrieval system, which potentially results in sub-optimal generalization. To overcome this limitation, we present a novel framework ADACQR. By aligning reformulation models with both term-based and semantic-based retrieval systems, ADACQR enhances the generalizability of information-seeking queries among diverse retrieval environments through a two-stage training strategy. Moreover, two effective approaches are proposed to obtain superior labels and diverse input candidates, boosting the efficiency and robustness of the framework. Experimental results on the TopiOCQA, QReCC and TREC CAsT datasets demonstrate that ADACQR outperforms the existing methods in a more efficient framework, offering both quantitative and qualitative improvements in conversational query reformulation. © 2025 Association for Computational Linguistics.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：