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

Virtual Network Embedding: Literature Assessment, Recent Advancements, Opportunities, and Challenges

IEEE Communications Surveys and Tutorials 2025年

作者： Satpathy, Anurag Sahoo, Manmath Narayan Swain, Chittaranjan Bellavista, Paolo Guizani, Mohsen Muhammad, Khan Bakshi, Sambit Missouri University of Science and Technology Department of Computer Science RollaMO United States National Institute of Technology Visual Surveillance Laboratory Department of Computer Science and Engineering Odisha Rourkela769008 India Atal Bihari Vajpayee Indian Institute of Information Technology and Management Department of Computer Science and Engineering Gwalior India Department of Computer Science and Engineering Italy Machine Learning Department Abu Dhabi United Arab Emirates Department of Applied Artificial Intelligence School of Convergence College of Computing and Informatics Seoul03063 Korea Republic of

Network virtualization (NV) allows service providers (SPs) to instantiate logically isolated entities called virtual networks (VNs) on top of a substrate network (SN). Though VNs bring about multiple benefits, particularly in terms of economic costs and elasticity, they also force various technical challenges to be addressed. The primary one is the issue of optimally allocating resources to VNs, also termed virtual network embedding (VNE). This paper presents an exhaustive survey of VNE by extensively covering the state-of-the-art research field in this very active field and focusing on the emerging research trends in industry and academia over the last decade. In addition, this survey originally contributes to the literature by proposing a novel taxonomy for existing VNE solutions and providing a thorough comparative study of their strategies. © 1998-2012 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

A comparative study of the performance of ten metaheuristic algorithms for parameter estimation of solar photovoltaic models

引用

PeerJ computer science 2025年 11卷 e2646-e2646页

作者： Zga, Adel Zitouni, Farouq Harous, Saad Sallam, Karam Almazyad, Abdulaziz S. Xiong, Guojiang Mohamed, Ali Wagdy Department of Computer Science and Information Technology Laboratory of Artificial Intelligence and Information Technology Kasdi Merbah University Ouargla Algeria Department of Computer Science College of Computing and Informatics University of Sharjah Sharjah United Arab Emirates Department of Computer Engineering College of Computer and Information Sciences King Saud University Riyadh Saudi Arabia Guizhou Key Laboratory of Intelligent Technology in Power System College of Electrical Engineering Guizhou University Guiyang China Operations Research Department Faculty of Graduate Studies for Statistical Research Cairo University Giza Egypt Applied Science Research Center Applied Science Private University Amman Jordan

This study conducts a comparative analysis of the performance of ten novel and wellperforming metaheuristic algorithms for parameter estimation of solar photovoltaic models. This optimization problem involves accurately identifying parameters that reflect the complex and nonlinear behaviours of photovoltaic cells affected by changing environmental conditions and material inconsistencies. This estimation is challenging due to computational complexity and the risk of optimization errors, which can hinder reliable performance predictions. The algorithms evaluated include the Crayfish Optimization Algorithm, the Golf Optimization Algorithm, the Coati Optimization Algorithm, the Crested Porcupine Optimizer, the Growth Optimizer, the Artificial Protozoa Optimizer, the Secretary Bird Optimization Algorithm, the Mother Optimization Algorithm, the Election Optimizer Algorithm, and the Technical and Vocational Education and Training-Based Optimizer. These algorithms are applied to solve four well-established photovoltaic models: the singlediode model, the double-diode model, the triple-diode model, and different photovoltaic module models. The study focuses on key performance metrics such as execution time, number of function evaluations, and solution optimality. The results reveal significant differences in the efficiency and accuracy of the algorithms, with some algorithms demonstrating superior performance in specific models. The Friedman test was utilized to rank the performance of the various algorithms, revealing the Growth Optimizer as the top performer across all the considered models. This optimizer achieved a root mean square error of 9.8602187789E−04 for the single-diode model, 9.8248487610E−04 for both the double-diode and triplediode models and 1.2307306856E−02 for the photovoltaic module model. This consistent success indicates that the Growth Optimizer is a strong contender for future enhancements aimed at further boosting its efficiency and effectiveness. Its

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic Encryption

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Li, Yuqing Yan, Nan Chen, Jing Wang, Xiong Hong, Jianan He, Kun Wang, Wei Li, Bo Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Wuhan University RiZhao Information Technology Institute Rizhao276800 China Huazhong University of Science and Technology 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 Wuhan430074 China Shanghai Jiao Tong University School of Cyber Science and Engineering Shanghai200240 China Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

Cross-silo federated learning (FL) enables multiple institutions (clients) to collaboratively build a global model without sharing private data. To prevent privacy leakage during aggregation, homomorphic encryption (HE) is widely used to encrypt model updates, yet incurs high computation and communication overheads. To reduce these overheads, packed HE (PHE) has been proposed to encrypt multiple plaintexts into a single ciphertext. However, the original design of PHE assumes all clients share a single private key, making the system vulnerable to security threats of ciphertexts being intercepted and decrypted by honest-but-curious clients. Also, it does not consider the heterogeneity among different clients, resulting in undermined training efficiency with slow convergence and stragglers. To address these challenges, we propose FedPHE, a secure and efficient FL framework with PHE by jointly exploiting contribution-aware secure aggregation and straggler-resistant client selection. Using CKKS with sparsification and blinding, FedPHE achieves efficient secure aggregation that allows clients to only provide obscured encrypted updates while the server can perform aggregation by accounting for contributions of local updates. To mitigate the straggler effect, we devise a perturbed sketch-based selection to cherry-pick representative clients with heterogeneous models and computing capabilities in a communication-efficient and privacy-preserving manner. We show, through rigorous security analysis and extensive experiments, that FedPHE can efficiently safeguard clients' privacy, achieve 2.45-6.56× training speedup, cut the communication overhead by 1.32-24.85×, and reduce straggler effects by 1.89-2.78×. © 2004-2012 IEEE.

关键词： Privacy by design

来源：评论

学校读者我要写书评

暂无评论

Continual Reinforcement Learning for Digital Twin Synchronization Optimization

引用

IEEE Transactions on Mobile computing 2025年

作者： Tong, Haonan Chen, Mingzhe Zhao, Jun Hu, Ye Yang, Zhaohui Liu, Yuchen Yin, Changchuan Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence Beijing Advanced Information Network Laboratory Beijing China College of Computing and Data Science Singapore University of Miami Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing Coral Gables33146 United States University of Miami Department of Industrial and Systems Engineering Coral Gables33146 United States Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China North Carolina State University Department of Computer Science RaleighNC27695 United States Beijing Key Laboratory of Network System Architecture and Convergence China Beijing University of Posts and Telecommunications Beijing Advanced Information Network Laboratory Beijing100876 China

This article investigates the adaptive resource allocation scheme for digital twin (DT) synchronization optimization over dynamic wireless networks. In our considered model, a base station (BS) continuously collects factory physical object state data from wireless devices to build a real-time virtual DT system for factory event analysis. Due to continuous data transmission, maintaining DT synchronization must use extensive wireless resources. To address this issue, a subset of devices is selected to transmit their sensing data, and resource block (RB) allocation is optimized. This problem is formulated as a constrained Markov process (CMDP) problem that minimizes the long-term mismatch between the physical and virtual systems. To solve this CMDP, we first transform the problem into a dual problem that refines RB constraint impacts on device scheduling strategies. We then propose a continual reinforcement learning (CRL) algorithm to solve the dual problem. The CRL algorithm learns a stable policy across historical experiences for quick adaptation to dynamics in physical states and network capacity. Simulation results show that the CRL can adapt quickly to network capacity changes and reduce normalized root mean square error (NRMSE) between physical and virtual states by up to 55.2%, using the same RB number as traditional methods. © 2025 IEEE. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

MRLATO: An Adaptive Task Offloading Mechanism Based on Meta Reinforcement Learning in Edge computing Environment

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Zhang, Peiying Liu, Jiamin Guizani, Maher Wang, Jian Kumar, Neeraj Tan, Lizhuang Qingdao Institute of Software College of Computer Science and Technology Qingdao266580 China Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software Qingdao266580 China Ministry of Education Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Jinan250014 China University of Texas Arlington Computer Science and Engineering Department TX United States College of Science Qingdao266580 China Thapar University Department of Computer Science and Engineering Patiala147004 India Jinan250014 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan250014 China

Traditional cloud computing models struggle to meet the requirements of latency-sensitive applications when processing large amounts of data. As a solution, Multi-access Edge computing (MEC) extends computing resources to the edge of the network to reduce processing delays and improve user experience. However, in dynamically changing edge computing environments, effective decision making on whether to offload tasks to edge servers remains a core challenge. For this purpose, we propose MRLATO, an adaptive task offloading mechanism based on Meta Reinforcement Learning (MRL), which exploits a large amount of a priori knowledge of different tasks to achieve fast adaptation. The task offloading process is modelled as multiple Markov Decision Processes (MDPs) and solved using a Sequence to Sequence (Seq2Seq) neural network integrating multi-head attention and recursive task sequencing. It is shown by the experimental results that the proposed method has the lowest latency in all experimental settings and the convergence efficiency is improved by 14.06% compared to the traditional Deep Reinforcement Learning (DRL) algorithm. This research fully demonstrates the significant benefits of the deep integration of MRL with the edge computing domain, providing new optimisation ideas for task offloading decisions. © 1967-2012 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

Irregular Tensor Low-Rank Representation for Hyperspectral Image Representation

引用

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 2025年 PP卷 PP页

作者： Bo Han Yuheng Jia Hui Liu Junhui Hou School of Computer Science and Engineering Southeast University Nanjing China School of Computer Science and Engineering and the Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Ministry of Education Southeast University Nanjing China School of Computing Information Sciences Saint Francis University Tseung Kwan O Hong Kong Department of Computer Science City University of Hong Kong Kowloon Tong Hong Kong

Spectral variations pose a common challenge in analyzing hyperspectral images (HSI). To address this, low-rank tensor representation has emerged as a robust strategy, leveraging inherent correlations within HSI data. However, the spatial distribution of ground objects in HSIs is inherently irregular, existing naturally in tensor format, with numerous class-specific regions manifesting as irregular tensors. Current low-rank representation techniques are designed for regular tensor structures and overlook this fundamental irregularity in real-world HSIs, leading to performance limitations. To tackle this issue, we propose a novel model for irregular tensor low-rank representation tailored to efficiently model irregular 3D cubes. By incorporating a non-convex nuclear norm to promote low-rankness and integrating a global negative low-rank term to enhance the discriminative ability, our proposed model is formulated as a constrained optimization problem and solved using an alternating augmented Lagrangian method. Experimental validation conducted on four public datasets demonstrates the superior performance of our method compared to existing state-of-the-art approaches. The code is publicly available at https://***/hb-studying/ITLRR.

关键词： Tensors Three-dimensional displays Matrix decomposition Hyperspectral imaging Sparse matrices Indexes Solid modeling Fast Fourier transforms Correlation Optimization

来源：评论

学校读者我要写书评

暂无评论

Questionable Fairness in Federated Learning

Questionable Fairness in Federated Learning

引用

Conference on Data science and Machine Learning Applications (CDMA)

作者： Raed Alharbi Truc Nguyen Nooshin Yousefzadeh Ahmed Aljohani College of Computing and Informatics Saudi Electronic University Riyadh Saudi Arabia Computatioual Science Center National Renewable Energy Laboratory Golden CO USA Computer and Information Science and Engineering Department University of Florida Gainesville FL USA Computer Science and Engineering University of North Texas Denton USA

ISBN: (数字)9798331539696

ISBN: (纸本)9798331539702

Federated learning (FL) has emerged as a powerful framework for training deep learning models across numerous distributed clients, where a central server distributes and aggregates model updates without accessing clients' raw data, ensuring privacy. However, this decentralized approach introduces significant challenges regarding fairness. Existing research shows that non-i.i.d. data distributions among clients can lead to biased global models, particularly affecting decisions based on sensitive attributes. This paper aims to investigate these fairness issues rigorously by analyzing how disparities in client data distribution impact model fairness. We conduct experiments using various models and datasets to evaluate and mitigate biases. We also propose novel data partitioning strategies to reflect real-world client data distributions accurately. Our finding shows that FL is highly vulnerable to the fairness problem due to the Non-IID property. The experiment's code can be found here: https://***/raed19/Questionable-Fairness-in-Federated-Learning.

关键词： Training Deep learning Data privacy Federated learning Prevention and mitigation Distributed databases Data science Data models Servers Multiaccess communication

来源：评论

学校读者我要写书评

暂无评论

SEDNet: Synergistic Learning Network with Embedded Encoder and Dense Atrous Convolution for Vehicle Re-identification

引用

Alexandria engineering Journal 2025年 128卷 297-305页

作者： Mingfu Xiong Tanghao Gui Zhihong Sun Saeed Anwar Aziz Alotaibi Khan Muhammad School of Computer Science and Artificial Intelligence Wuhan Textile University Wuhan 430200 China Department of Information Security Naval University of Engineering Wuhan 430030 China The University of Western Australia (UWA) Crawley 6009 Australia Department of Computer Science College of Computing and Information Technology Taif University Taif 21974 Saudi Arabia Visual Analytics for Knowledge Laboratory (VIS2KNOW Lab) Department of Applied Artificial Intelligence College of Computing and Informatics Sungkyunkwan University Seoul 03063 South Korea

To address the issue of information redundancy (such as color and vehicle model) caused by excessive emphasis on local features in vehicle re-identification, this paper proposes a Synergistic Learning Network with Embedded Encoder and Dense Atrous Convolution (SEDNet). The proposed SEDNet framework consists of three unique branches: a global embedded multi-head encoder (GEME), local dual-dense atrous convolution (LDAC), and auxiliary attribute embedding (AAM). The GEME branch integrates the global appearance features of the vehicle to enhance consistency in descriptions from different perspectives. To suppress redundant information such as color and vehicle model information, and refine local features, the LDAC branch employs an attention mechanism to capture multiscale features using convolutional kernels with varying dilation rates. In addition, the AAM branch uses vehicle metadata, such as direction and camera perspectives, to enhance feature robustness. Our proposed SEDNet method has been rigorously tested on the mainstream benchmark vehicle re-identification datasets, including VeRi-776, VehicleID, and VeRi-Wild. The results show that our method enhances the mAP by 2.2%, 2.2%, and 0.2%, respectively, when compared to the latest methods, all evaluated on a regular scale. Additional experiments conducted on the Market-1501 and DukeMTMC-reID datasets further verify our method’s generalization capability.

关键词： Vehicle re-identification Embedded encoder Dense atrous convolution Intelligent networks Synergistic learning

来源：评论

学校读者我要写书评

暂无评论

Backdoor-Empowered Regulable Privilege Authorization for Edge-Level Graph Learning in 6G Vehicular Networks

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Yang, Xiao Li, Gaolei Wu, Jun Zhou, Kai Li, Jianhua Yang, Wu Shanghai Jiao Tong University School of Electronic Information and Electrical Engineering Shanghai China Shanghai Key Laboratory of Integrated Administration Technologies for Information Security Shanghai China The Hong Kong Polytechnic University Department of Computing Hong Kong Harbin Engineering University College of Computer Science and Technology Harbin China

Edge-Level Graph Learning System (EGLS) exhibits diverse applicability in flow prediction, route planning, and accident forecasting. Existing EGLS studies extremely stress absolute fairness and impartiality for all users, resultantly depriving its flexibility and humanity in addressing special circumstances and rendering the privilege authorization for exceptional responses challenging to achieve. To address this limitation, we present BackPriv, the first privilege authorization methodology enabling regulable privilege assignment or revocation in EGLS. Specifically, it is achieved through a creative edge backdoor mechanism, wherein the edge training samples are poisoned via user-specific privilege tokens to induce privilege outputs from the well-trained EGLS for authorized users. Moreover, related EGLS regulating strategies were proposed to dynamically realize the addition and revocation of user privileges by system retraining to guarantee privilege control in EGLS. Additionally, a Graph Mutual information-based adaptive privilege token generation method is introduced to reduce the impact of privilege authorization on normal inputs and augment authorization functionality. Based on experiments with multiple real-world datasets, BackPriv demonstrates high success rates of privilege authorization under various scenarios ( 100%) and exerts minimal impact on normal task performance for regular inputs (mean accuracy drop 0.32%). © 1975-2011 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Reversible Data Hiding With Secret Encrypted Image Sharing and Adaptive Coding

引用

IEEE Internet of Things Journal 2025年

作者： Fang, Guangtian Wang, Feng Zhao, Chenbin Qin, Chuan Chang, Ching-Chun Chang, Chin-Chen Fujian University of Technology College of Computer Science and Mathematics Fuzhou350118 China Fujian University of Technology College of Computer Science and Mathematics Key Laboratory of Big Data Mining and Applications Fuzhou350118 China Monash University Faculty of IT Department of Software Systems and Cybersecurity VIC3800 Australia Ministry of Education School of Cyber Science and Engineering Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan430072 China University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China Feng Chia University Information and Communication Security Research Center Taichuang 40724 Taiwan Feng Chia University Department of Information Engineering and Computer Science Taichung40724 Taiwan

To ensure the security of image information and facilitate efficient management in the cloud, the utilization of reversible data hiding in encrypted images (RDHEI) has emerged as pivotal. However, most existing RDHEI schemes suffer from lower security and limited embedding capacity. To tackle these challenges, we propose a reversible data hiding with secret encrypted image sharing and adaptive coding scheme. Specifically, in the encryption phase, we introduce an improved secret sharing (SS) encryption method based on the chinese remainder theorem for polynomials (CRTP). This method not only improves the security of encrypted images but also vacates a larger room for embedding. In the embedding phase, we introduce an adaptive coding embedding approach using XOR preservation (XORP) and huffman coding, which provides high embedding capacity. Experimental results and security analysis demonstrate that our proposed encryption method achieves optimal values in security indicators for encrypted images, such as information entropy, histograms, NPCR and UACI. The proposed embedding method is superior to some state-of-the-art schemes in terms of embedding capacity. Furthermore, in datasets BOSSBase and BOWS2, the average embedding rates of the proposed embedding approach can reach 2.1745 bpp and 2.0656 bpp, respectively. © 2025 IEEE.

关键词： adaptive coding chinese remainder theorem for polynomials encrypted images Reversible data hiding secret sharing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：