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

5th International Conference on Security and Privacy in New computing Environments, SPNCE 2022

作者： Zhang, Hongbin Yin, Yan Zhao, Dongmei Liu, Bin Wang, Yanxia Liu, Zhen School of Information Science and Engineering Hebei University of Science and Technology Shijiazhuang050000 China Hebei Key Laboratory of Network and Information Security Hebei Normal University Hebei Shijiazhuang050024 China School of Economics and Management Hebei University of Science and Technology Shijiazhuang050000 China Research Center of Big Data and Social Computing Hebei University of Science and Technology Shijiazhuang050000 China Hebei Geological Workers’ University Shijiazhuang050081 China

ISBN: (纸本)9783031306228

Game theory has been widely used in network security situational awareness. However, most of the currently proposed game-based offensive and defensive situational awareness methods are for traffic data, and there are fewer models or methods for analysis using vulnerability data. To overcome these issues, this paper proposes collecting periodic security vulnerability information in the network and utilizing the change in vulnerability status to achieve network security situational awareness. At this time, a network attack and defense game model based on incomplete information is proposed, which uses the state changes of the vulnerability life cycle to model the attack and defense behavior, calculates the benefits of both attack and defense through the evaluation of the exploitability of the vulnerability, and then quantifies the security situation value. We carried out the experiments using the vulnerability dataset, which was obtained by scanning the IP addresses of several enterprises in Hebei Province, China. The experimental results show that the approach of using network security vulnerabilities to assess network security status is feasible. © 2023, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Downstream-agnostic Adversarial Examples

Downstream-agnostic Adversarial Examples

引用

International Conference on Computer Vision (ICCV)

作者： Ziqi Zhou Shengshan Hu Ruizhi Zhao Qian Wang Leo Yu Zhang Junhui Hou Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology 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 School of Cyber Science and Engineering Wuhan University School of Information and Communication Technology Griffith University Department of Computer Science City University of Hong Kong School of Computer Science and Technology Huazhong University of Science and Technology Cluster and Grid Computing Lab

Self-supervised learning usually uses a large amount of unlabeled data to pre-train an encoder which can be used as a general-purpose feature extractor, such that downstream users only need to perform fine-tuning operations to enjoy the benefit of "large model". Despite this promising prospect, the security of pre-trained encoder has not been thoroughly investigated yet, especially when the pre-trained encoder is publicly available for commercial *** this paper, we propose AdvEncoder, the first framework for generating downstream-agnostic universal adversarial examples based on the pre-trained encoder. AdvEncoder aims to construct a universal adversarial perturbation or patch for a set of natural images that can fool all the downstream tasks inheriting the victim pre-trained encoder. Unlike traditional adversarial example works, the pre-trained encoder only outputs feature vectors rather than classification labels. Therefore, we first exploit the high frequency component information of the image to guide the generation of adversarial examples. Then we design a generative attack framework to construct adversarial perturbations/patches by learning the distribution of the attack surrogate dataset to improve their attack success rates and transferability. Our results show that an attacker can successfully attack downstream tasks without knowing either the pre-training dataset or the downstream dataset. We also tailor four defenses for pre-trained encoders, the results of which further prove the attack ability of AdvEncoder. Our codes are available at: https://***/CGCL-codes/AdvEncoder.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FedAA: A Reinforcement Learning Perspective on Adaptive Aggregation for Fair and Robust Federated Learning 39

FedAA: A Reinforcement Learning Perspective on Adaptive Aggr...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： He, Jialuo Chen, Wei Zhang, Xiaojin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China School of Microelectronics and Communication Engineering Chongqing University Chongqing400044 China School of Software Engineering Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)157735897X

Federated Learning (FL) has emerged as a promising approach for privacy-preserving model training across decentralized devices. However, it faces challenges such as statistical heterogeneity and susceptibility to adversarial attacks, which can impact model robustness and fairness. Personalized FL attempts to provide some relief by customizing models for individual clients. However, it falls short in addressing server-side aggregation vulnerabilities. We introduce a novel method called FedAA, which optimizes client contributions via Adaptive Aggregation to enhance model robustness against malicious clients and ensure fairness across participants in non-identically distributed settings. To achieve this goal, we propose an approach involving a Deep Deterministic Policy Gradient-based algorithm for continuous control of aggregation weights, an innovative client selection method based on model parameter distances, and a reward mechanism guided by validation set performance. Empirically, extensive experiments demonstrate that, in terms of robustness, FedAA outperforms the state-of-the-art methods, while maintaining comparable levels of fairness, offering a promising solution to build resilient and fair federated systems. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Trust Evaluation Model of Social Internet of Things Based on Multi-relationships

Trust Evaluation Model of Social Internet of Things Based on...

引用

2022 International Conference on Networking and Network Applications, NaNA 2022

作者： Fan, Fan Zhang, Hongbin Zhao, Dongmei Wang, Yanxia Liu, Bin Liu, Jian Hebei University of Science and Technology School of Information Science and Engineering Shijiazhuang China Hebei Normal University Hebei Key Laboratory of Network and Information Security Shijiazhuang China Hebei Geological Workers' University Shijiazhuang China Hebei University of Science and Technology School of Economics and Management Research Center of Big Data and Social Computing Shijiazhuang China

ISBN: (数字)9781665461313

ISBN: (纸本)9781665461313

Trust plays a vital role in ensuring the security of the Social Internet of Things. Due to the increased mobility of intelligent devices, there are frequent interactions between machines and changes in social relationships. It leads to a possible data sparsity problem in the Social Internet of Things. Therefore, it is presented that the trust evaluation model is based on various social relationships. The model considers the impact of multiple dynamically changing social relationships between nodes on trust. The implicit social relationship is mined based on the stated social relationship and potential attributes connecting nodes. It addresses the scarcity issue and the slow start of the Social Internet of Things. Simulations on the Santander Smart Cities dataset demonstrate that the approach improves the accuracy and convergence of trust evaluation in both sparse and regular networks. © 2022 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Efficient and High-quality Recommendations via Momentum-incorporated Parallel Stochastic Gradient Descent-Based Learning

引用

IEEE/CAA Journal of Automatica Sinica 2021年第2期8卷 402-411页

作者： Xin Luo Wen Qin Ani Dong Khaled Sedraoui MengChu Zhou the School of Computer Science and Technology Dongguan University of TechnologyDongguan 523808 Hengrui(Chongqing)Artificial Intelligence Research Center Department of Big Data Analyses TechniquesCloudwalkChongqing 401331China the School of Computer Science and Technology Chongqing University of Posts and TelecommunicationsChongqing 400065 Chongqing Engineering Research Center of Big Data Application for Smart Cities Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China the Department of Computer and Information Science City College of Dongguan University of TechnologyDongguan 523419China the Department of Electrical and Computer Engineering Faculty of Engineeringand Center of Research Excellence in Renewable Energy and Power SystemsKing Abdulaziz UniversityJeddah 21481Saudi Arabia the Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102 USA the Center of Research Excellence in Renewable Energy and Power Systems King Abdulaziz UniversityJeddah 21481Saudi Arabia

A recommender system(RS)relying on latent factor analysis usually adopts stochastic gradient descent(SGD)as its learning ***,owing to its serial mechanism,an SGD algorithm suffers from low efficiency and scalability when handling large-scale industrial *** at addressing this issue,this study proposes a momentum-incorporated parallel stochastic gradient descent(MPSGD)algorithm,whose main idea is two-fold:a)implementing parallelization via a novel datasplitting strategy,and b)accelerating convergence rate by integrating momentum effects into its training *** it,an MPSGD-based latent factor(MLF)model is achieved,which is capable of performing efficient and high-quality *** results on four high-dimensional and sparse matrices generated by industrial RS indicate that owing to an MPSGD algorithm,an MLF model outperforms the existing state-of-the-art ones in both computational efficiency and scalability.

关键词： big data industrial application industrial data latent factor analysis machine learning parallel algorithm recommender system(RS) stochastic gradient descent(SGD)

来源：评论

学校读者我要写书评

暂无评论

Why Does Little Robustness Help? A Further Step Towards Understanding Adversarial Transferability

arXiv

引用

arXiv 2023年

作者： Zhang, Yechao Hu, Shengshan Zhang, Leo Yu Shi, Junyu Li, Minghui Liu, Xiaogeng Wan, Wei Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia School of Computer Science and Technology 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 China Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab

Adversarial examples for deep neural networks (DNNs) have been shown to be transferable: examples that successfully fool one white-box surrogate model can also deceive other black-box models with different architectures. Although a bunch of empirical studies have provided guidance on generating highly transferable adversarial examples, many of these findings fail to be well explained and even lead to confusing or inconsistent advice for practical use. In this paper, we take a further step towards understanding adversarial transferability, with a particular focus on surrogate aspects. Starting from the intriguing "little robustness" phenomenon, where models adversarially trained with mildly perturbed adversarial samples can serve as better surrogates for transfer attacks, we attribute it to a trade-off between two dominant factors: model smoothness and gradient similarity. Our research focuses on their joint effects on transferability, rather than demonstrating the separate relationships alone. Through a combination of theoretical and empirical analyses, we hypothesize that the data distribution shift induced by off-manifold samples in adversarial training is the reason that impairs gradient similarity. Building on these insights, we further explore the impacts of prevalent data augmentation and gradient regularization on transferability and analyze how the trade-off manifest in various training methods, thus building a comprehensive blueprint for the regulation mechanisms behind transferability. Finally, we provide a general route for constructing superior surrogates to boost transferability, which optimizes both model smoothness and gradient similarity simultaneously, e.g., the combination of input gradient regularization and sharpness-aware minimization (SAM), validated by extensive experiments. In summary, we call for attention to the united impacts of these two factors for launching effective transfer attacks, rather than optimizing one while ignoring the other,

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Deformable registration framework for glioma images with absent correspondence based on auxiliary-image-aided intensity-consistency constraint

Deformable registration framework for glioma images with abs...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Kun Tang Lihui Wang Menglong Yang Jingwen Xu Xinyu Cheng Jian Zhang Yuemin Zhu Hongjiang Wei Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang China INSA Lyon CNRS Inserm Univ Lyon Lyon France School of Biomedical Engineering Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Considering the tumor aggressive nature and the significant changes in anatomical structure, aligning the preoperative and follow up scans of glioma patients remains a challenge due to the presence of regions with absent correspondence. To address this challenge, this work proposed a novel bidirectional unsupervised deformable image registration framework for image pairs with missing correspondence based on an auxiliary-image-aided intensity-consistency constraint (ICC) strategy. Specifically, for any fixed and moving image pairs, we introduced an auxiliary image and warped it directly to fixed/moving image or warped it twice through a transition of moving/fixed image. By comparing the difference between these warped images, the weighting maps to identify and exclude regions with absent correspondence between fixed and moving image pairs can be generated. To verify the effectiveness of the proposed framework, we combined it with several deep learning-based registration models and tested it on BraTS-Reg challenge dataset, the results demonstrated that the proposed ICC strategy can improve the registration performance for all the models, with the improvement of average target registration error (TRE) and success rate (SR) being up to 44.9% and 66.7%, respectively. Comparing against the best existing forward-backward consistency strategy for dealing with missing correspondence registration, our auxiliary-image-aided ICC strategy can also decrease average TRE by 2.9%, demonstrating the superiority of the proposed framework. The present work is not limited to the glioma images, it can be used to address the registration problems for any image pairs with absent correspondence or inconsistent intensity.

关键词： Image registration Pathology Deformation Magnetic resonance imaging Anatomical structure Bioinformatics Tumors Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Tumor State-Space Network for High and Low Grade Glioma Classification

Tumor State-Space Network for High and Low Grade Glioma Clas...

引用

International Conference on Signal Processing Proceedings (ICSP)

作者： Qijian Chen Lihui Wang Zeyu Deng Li Wang Chen Ye YueMin Zhu Engineering Research Center of Text Computing Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China INSA Lyon CNRS Inserm IRP Metislab CREATIS UMR5220 U1206 University Lyon Lyon France

ISBN: (数字)9798350387384

ISBN: (纸本)9798350387391

Accurately predicting the grade of gliomas is crucial for choosing right treatment plans. While current methods using radiomics and deep learning can predict glioma grades effectively using magnetic resonance imaging (MRI), they overlook dynamic changes in the tumor and its neighboring areas. To address this issue, we propose a tumor state-space network (TSSNet), which fully exploits changes in the tumor region and its surroundings through dynamical updating strategy. The experimental results demonstrated that TSSNet achieves 90.32% accuracy and 93.55% area under the curve (AUC) for the prediction of high-grade and low-grade gliomas, respectively, which are 2.4% and 2.5% higher than the best state-of-the-art deep learning models. Moreover, the proposed state-space module can effectively enhance prediction performance, which is advantageous for personalized glioma treatment.

关键词： Deep learning Accuracy Magnetic resonance imaging Signal processing Predictive models Tumors Radiomics

来源：评论

学校读者我要写书评

暂无评论

Predicting drug transcriptional response similarity using Signed Graph Convolutional Network

Predicting drug transcriptional response similarity using Si...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Wang, Ziyan Hong, Chengzhi Liu, Xuan Xiong, Zhankun Liu, Feng Zhang, Wen Wuhan University School of Computer Science Wuhan430072 China Huazhong Agricultural University College of Informatics Wuhan430070 China Huazhong Agricultural University Agricultural Bioinformatics Key Laboratory of Hubei Province Key Laboratory of Smart Farming for Agricultural Animals Ministry of Agriculture Hubei Engineering Technology Research Center of Agricultural Big Data Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan430070 China

ISBN: (纸本)9781665468190

Exploring the transcriptional response after employing chemical compounds assists in treating gene-related diseases and understanding biological activity of compounds. Calculating the similarity of drug transcriptional response can help to discover novel compounds that have the similar biological activity to known drugs for treating the same disease. Considering the transcriptional profiles of compounds are limited and harder to get than the structure of compounds, it is worth modeling the structure-transcriptional response similarity relationship. In this paper, we propose a signed graph convolutional network (SGCN)-based method, namely SGCN-DTRS, to predict drug transcriptional response similarity, which is quantitatively measured by Connectivity Map (CMap) scores, from their structures. SGCNDTRS constructs a CMap signed network from compounds and their CMap scores in the training data, which takes compounds as nodes, molecular structural representations of compounds as the attributes of nodes, and similarity relations between compounds as edges. Then SGCN-DTRS learns the CMap compound embeddings to predict CMap scores of pairwise compounds. Extensive experiments verify the superiority of the proposed method against the compared state-of-the-art methods and reveal that the relational information of the CMap data, which is learned from CMap signed network, is important for the CMap score prediction. SGCN-DTRS can not only work for the compounds in the training set but also is applicable to unseen compounds. © 2022 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Towards high-throughput and low-latency billion-scale vector search via CPU/GPU collaborative filtering and re-ranking 25

Towards high-throughput and low-latency billion-scale vector...

引用

Proceedings of the 23rd USENIX Conference on File and Storage Technologies

作者： Bing Tian Haikun Liu Yuhang Tang Shihai Xiao Zhuohui Duan Xiaofei Liao Hai Jin Xuecang Zhang Junhua Zhu Yu Zhang National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Huawei Technologies Co. Ltd Towards high-throughput and low-latency billion-scale vector search via CPU/GPU collaborative filtering and re-ranking

ISBN: (纸本)9781939133458

Approximate nearest neighbor search (ANNS) has emerged as a crucial component of database and AI infrastructure. Ever-increasing vector datasets pose significant challenges in terms of performance, cost, and accuracy for ANNS services. None of modern ANNS systems can address these issues simultaneously. In this paper, we present Fusion-ANNS, a high-throughput, low-latency, cost-efficient, and high-accuracy ANNS system for billion-scale datasets using SSDs and only one entry-level GPU. The key idea of Fusion-ANNS lies in CPU/GPU collaborative filtering and reranking mechanisms, which significantly reduce I/O operations across CPUs, GPU, and SSDs to break through the I/O performance bottleneck. Specifically, we propose three novel designs: (1) multi-tiered indexing to avoid data swapping between CPUs and GPU, (2) heuristic re-ranking to eliminate unnecessary I/Os and computations while guaranteeing high accuracy, and (3) redundant-aware I/O deduplication to further improve I/O efficiency. We implement FusionANNS and compare it with the state-of-the-art SSD-based ANNS system-SPANN and GPU-accelerated in-memory ANNS system-RUMMY. Experimental results show that FusionANNS achieves 1) 9.4-13.1× higher query per second (QPS) and 5.7-8.8× higher cost efficiency compared with SPANN; 2) and 2-4.9× higher QPS and 2.3-6.8× higher cost efficiency compared with RUMMY, while guaranteeing low latency and high accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：