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

Online Queue-Aware Service Migration and Resource Allocation in Mobile Edge Computing

IEEE Transactions on Vehicular technology 2025年第5期74卷 8063-8078页

作者： Du, An Jia, Jie Chen, Jian Wang, Xingwei Huang, Min Northeastern University School of Computer Science and Engineering The Engineering Research Center of Security Technology of Complex Network System Shenyang110819 China Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China Northeastern University College of Information Science and Engineering State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China

Mobile edge computing (MEC) integrated with network Functions Virtualization (NFV) helps run a wide range of services implemented by Virtual network Functions (VNFs) deployed at MEC networks. This emerging paradigm offers flexible edge resource management for Internet Service Providers (ISPs) and improves service satisfaction of diverse applications. However, a critical challenge lies in processing extremely unpredictable and bursty traffic flow, especially in event-trigger sensing tasks. In this paper, we study queue-aware service migration and resource allocation in an MEC network, where different devices with different arrival patterns request different network services. To this end, we first formulate a novel long-term operation cost minimization problem subject to the stability of multiple queues by adopting a simultaneous migration scheme and determining resource allocation dynamically. To address the problem efficiently, we propose an online control framework to make decisions without any prior system *** first adopt the Lyapunov optimization technique to decompose the long-term optimization problem into multiper-slot subproblems. Then, we adopt a decoupled optimization algorithm based on the coordinate descent method and augmented Lagrangian method to solve the offline mixed integer non-linear programming (MINLP) subproblems. Extensive results reveal that the proposed online optimization framework can efficiently balance queue stability and cost consumption. © 1967-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Image Emotion Classification network Based on Multilayer Attentional Interaction,Adaptive Feature Aggregation

引用

computers, Materials & Continua 2023年第5期75卷 4273-4291页

作者： Xiaorui Zhang Chunlin Yuan Wei Sun Sunil Kumar Jha Engineering Research Center of Digital Forensics Ministry of EducationJiangsu Engineering Center of Network MonitoringSchool of Computer and SoftwareNanjing University of Information Science&TechnologyNanjing210044China Wuxi Research Institute Nanjing University of Information Science&TechnologyWuxi214100China Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology(CICAEET) Nanjing University of Information Science&TechnologyNanjing210044China School of Automation Nanjing University of Information Science&TechnologyNanjing210044China Adani University AhmedabadGujaratIndia

The image emotion classification task aims to use the model to automatically predict the emotional response of people when they see the *** have shown that certain local regions are more likely to inspire an emotional response than the whole ***,existing methods perform poorly in predicting the details of emotional regions and are prone to overfitting during training due to the small size of the ***,this study proposes an image emotion classification network based on multilayer attentional interaction and adaptive feature *** perform more accurate emotional region prediction,this study designs a multilayer attentional interaction *** module calculates spatial attention maps for higher-layer semantic features and fusion features through amultilayer shuffle attention *** layer-by-layer up-sampling and gating operations,the higher-layer features guide the lower-layer features to learn,eventually achieving sentiment region prediction at the optimal *** complement the important information lost by layer-by-layer fusion,this study not only adds an intra-layer fusion to the multilayer attention interaction module but also designs an adaptive feature aggregation *** module uses global average pooling to compress spatial information and connect channel information from all ***,the module adaptively generates a set of aggregated weights through two fully connected layers to augment the original features of each ***,the semantics and details of the different layers are aggregated through gating operations and residual connectivity to complement the lost *** reduce overfitting on small datasets,the network is pre-trained on the FI dataset,and further weight fine-tuning is performed on the small *** experimental results on the FI,Twitter I and Emotion ROI(Region of Interest)datasets show that the proposed network exceeds existing image emotion classification methods

关键词： Attentionmechanism emotional region prediction image emotion classification transfer learning

来源：评论

学校读者我要写书评

暂无评论

Local Features Meet Stochastic Anonymization: Revolutionizing Privacy-Preserving Face Recognition for Black-Box Models

arXiv

引用

arXiv 2024年

作者： Liu, Yuanwei Jia, Chengyu Xiao, Ruqi Jia, Xuemei Wei, Hui Jiang, Kui Wang, Zheng National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence School of Computer Science Wuhan University China Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University China School of Computer Science and Technology Harbin Institute of Technology Harbin China

The task of privacy-preserving face recognition (PPFR) currently faces two major unsolved challenges: (1) existing methods are typically effective only on specific face recognition models and struggle to generalize to black-box face recognition models;(2) current methods employ data-driven reversible representation encoding for privacy protection, making them susceptible to adversarial learning and reconstruction of the original image. We observe that face recognition models primarily rely on local features (e.g., face contour, skin texture, and so on) for identification. Thus, by disrupting global features while enhancing local features, we achieve effective recognition even in black-box environments. Additionally, to prevent adversarial models from learning and reversing the anonymization process, we adopt an adversarial learning-based approach with irreversible stochastic injection to ensure the stochastic nature of the anonymization. Experimental results demonstrate that our method achieves an average recognition accuracy of 94.21% on black-box models, outperforming existing methods in both privacy protection and anti-reconstruction capabilities. Copyright © 2024, The Authors. All rights reserved.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

DQ-WiAPDoM: A DQN-based AP Deployment Optimization Method for Wi-Fi FTM Positioning 2

DQ-WiAPDoM: A DQN-based AP Deployment Optimization Method fo...

引用

2nd International Conference on Smart Technologies and Systems for Next Generation Computing, ICSTSN 2023

作者： Liu, Zihao Li, Han Gao, Bo Xiong, Ke Fan, Pingyi Beijing Jiaotong University School of Computer and Information Technology Beijing China Engineering Research Center of Network Management Technology for High Speed Railway Ministry of Education School of Computer and Information Technology Beijing Jiaotong University Beijing China Tsinghua University Department of Electronic Engineering Beijing China

ISBN: (纸本)9798350348002

This paper focuses on how to optimize the deployment location of the anchor Wi-Fi access points (APs) in order to enhance the indoor positioning performance of the finetime measurement (FTM) protocol. Compared to conventional Wi-Fi positioning, FTM protocol is able to achieve relatively good indoor positioning performance since it estimates distance between a sender and its receiver with the flight duration of Wi-Fi signals. However, the FTM-based positioning accuracy in NLoS environments is still not high, which restricts its application in indoor scenarios. To this end, we formulate an optimization problem to maximize the total number of LoS paths by optimizing the locations of the anchor APs. To solve the problem, we propose a Deep Q-network (DQN)-based AP deployment optimization method (DQ-WiAPDoM), which utilizes DQN to optimize the locations of APs such that the total number of LoS paths over all covered area is maximized. Experimental results show that DQ-WiAPDoM converges well and is able to reduce the average positioning error efficiently. © 2023 IEEE.

关键词： Wi-Fi

来源：评论

学校读者我要写书评

暂无评论

Joint User Cooperation and Scheduling for Federated Learning in CFmMIMO networks 2

Joint User Cooperation and Scheduling for Federated Learning...

引用

2nd International Conference on Smart Technologies and Systems for Next Generation Computing, ICSTSN 2023

作者： Bao, Han Gao, Bo Xiong, Ke Fan, Pingyi Beijing Jiaotong University School of Computer and Information Technology Beijing China Beijing Jiaotong University Engineering Research Center of Network Management Technology for High Speed Railway Ministry of Education School of Computer and Information Technology Beijing China Tsinghua University Department of Electronic Engineering Beijing China

ISBN: (纸本)9798350348002

This paper proposes a joint user cooperation and scheduling (JUCS) method to minimize the maximum transmission time among users in the synchronous federated learning (FL) architecture, since the user with the worst quality link limits the training performance of FL. To this end, an optimization problem is formulated to find the optimal user cooperation pairing and the power control coefficients. Meanwhile, as the links among users operate on the same frequency bands, the interface between them is taken into account in this paper. As the problem is non-convex, we decouple it into two sub-problems. For the first sub-problem, we propose a fair scheduling (FS)-based algorithm to schedule the helping users to pair with the ones who are required to be assisted. For the second sub-problem, an algorithm based on deterministic policy gradient (DDPG) is proposed to find the optimized power control coefficients. Experiments show that the proposed JUCS method shortens about 34.48% transmission time of the worst user in FL compared to the traditional one without JUCS. © 2023 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Encryption Traffic Classification Based on Mining Traffic Context and Transport Relationship

Encryption Traffic Classification Based on Mining Traffic Co...

引用

2025 IEEE Wireless Communications and networking Conference, WCNC 2025

作者： Gai, Weilin Zhang, Runqing Zhang, Huiyuan Guo, Yu Yin, Jun Zhang, Peng Tca Institute of Software Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China National Computer Network Emergency Response TechnicalTeam Coordination Center of China Beijing China School of Cyber Science and Engineering Nanjing University of Science and Technology Nanjing China

ISBN: (纸本)9798350368369

This paper proposes a novel ETC-MTCTR, which is designed to enable more accurate, versatile and efficient traffic classification in the context of multi-scenario, low-resource encrypted traffic. Through three modules of Datagram Token conversion, pretraining and fine-tuning, the method uses large-scale unlabeled encrypted traffic for pretraining, mining and learning the traffic context and transmission relationship of encrypted traffic classification tasks, so that a small number of labeled data samples can be effectively used in the fine-tuning stage. Significantly improve the performance of the model on specific downstream classification tasks, enhance the accuracy, adaptability and robustness of the model in diverse environments, limited resources and new encryption security protocols, and realize efficient encryption traffic classification in multi-scenario and low-resource background. The results show that ETC-MTCTR achieves the best performance on three tasks: encryption malware classification, VPN encrypted traffic classification, and TLS 1.3 encryption application classification. Its F1 score is improved by 0.22% in the classification task of encrypted malware, 1.4% in the classification task of VPN encrypted traffic App, 4.56% in the classification task of VPN encrypted traffic Service, and 9.89% in the classification task of TLS 1.3 encrypted application, which is significantly better than other comparison methods. © 2025 IEEE.

关键词： Traffic control

来源：评论

学校读者我要写书评

暂无评论

FedSSP: federated graph learning with spectral knowledge and personalized preference 24

FedSSP: federated graph learning with spectral knowledge and...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Zihan Tan Guancheng Wan Wenke Huang Mang Ye 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 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 and Taikang Center for Life and Medical Sciences Wuhan University Wuhan China

ISBN: (纸本)9798331314385

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sample complexity for distributionally robust learning under χ2-divergence

引用

The Journal of Machine Learning Research 2023年第1期24卷 10845-10871页

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

This paper investigates the sample complexity of learning a distributionally robust predictor under a particular distributional shift based on χ2-divergence, which is well known for its computational feasibility and statistical properties. We demonstrate that any hypothesis class ℌ with finite VC dimension is distributionally robustly learnable. Moreover, we show that when the perturbation size is smaller than a constant, finite VC dimension is also necessary for distributionally robust learning by deriving a lower bound of sample complexity in terms of VC dimension.

关键词： distributionally robustness PAC learning sample complexity χ2-divergence

来源：评论

学校读者我要写书评

暂无评论

Parameter disparities dissection for backdoor defense in heterogeneous federated learning 24

Parameter disparities dissection for backdoor defense in het...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Wenke Huang Mang Ye Zekun Shi Guancheng Wan He Li Bo Du 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 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 and Taikang Center for Life and Medical Sciences Wuhan University Wuhan China

ISBN: (纸本)9798331314385

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

BAV-DSS: Blockchain Assisted Verifiable Data Sharing Scheme with Fast Encryption and Outsourced Decryption for IoT 24th

BAV-DSS: Blockchain Assisted Verifiable Data Sharing Scheme ...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Huang, Yao Yu, Zhongyuan Wang, Guijuan Chai, Baobao Zhang, Hongliang Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan250353 China School of Information Science and Engineering Lanzhou University Lanzhou730000 China School of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China

ISBN: (纸本)9789819615414

Many sophisticated cloud platforms are available to provide services such as storage and computation for Internet of Things (IoT) applications. However, with the concerns about the semi-trusted nature of cloud platforms, data security and privacy have been gaining broad attention. In this paper, we propose a blockchain-assisted verifiable data sharing scheme (BAV-DSS) for IoT. The BAV-DSS features fine-grained access control, fast encryption, and outsourced decryption with verifiability. Specifically, with the application of ciphertext-policy attribute-based encryption (CP-ABE), flexible access control is enabled. Blockchain is employed to store public keys, generate account addresses, and perform data verification. Furthermore, the selective replayable chosen ciphertext attacks (sRCCA) security of BAV-DSS is proved, and the simulation results indicate that BAV-DSS obtains high efficiency and practicality compared to other schemes. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：