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

arXiv 2025年

作者： Cheng, Zhipeng Xia, Xiaoyu Wang, Hong Liwang, Minghui Chen, Ning Fan, Xuwei Wang, Xianbin School of Future Science and Engineering Soochow University Suzhou215006 China School of Computing Technologies RMIT University MelbourneVIC Australia Department of Control Science and Engineering The National Key Laboratory of Autonomous Intelligent Unmanned Systems Tongji University Shanghai201804 China Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Tongji University Shanghai201804 China Qingdao China College of Computer and Information Sciences Fujian Agriculture and Forestry University Fuzhou350002 China Department of Electrical and Computer Engineering Western University ON Canada

Edge inference (EI) is a key solution to address the growing challenges of delayed response times, limited scalability, and privacy concerns in cloud-based Deep Neural Network (DNN) inference. However, deploying DNN models on resource-constrained edge devices faces more severe challenges, such as model storage limitations, dynamic service requests, and privacy risks. This paper proposes a novel framework for privacy-aware joint DNN model deployment and partition optimization to minimize long-term average inference delay under resource and privacy constraints. Specifically, the problem is formulated as a complex optimization problem considering model deployment, user-server association, and model partition strategies. To handle the NP-hardness and future uncertainties, a Lyapunov-based approach is introduced to transform the long-term optimization into a single-time-slot problem, ensuring system performance. Additionally, a coalition formation game model is proposed for edge server association, and a greedy-based algorithm is developed for model deployment within each coalition to efficiently solve the problem. Extensive simulations show that the proposed algorithms effectively reduce inference delay while satisfying privacy constraints, outperforming baseline approaches in various scenarios. Copyright © 2025, The Authors. All rights reserved.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

GIRP: Energy-Efficient QoS-Oriented Microservice Resource Provisioning via Multi-Objective Multi-Task Reinforcement Learning

引用

IEEE Transactions on Mobile computing 2025年

作者： Yuan, Honggang Wang, Ting Fu, Min Shi, Yuanming East China Normal University MoE Engineering Research Center of Software/Hardware Co-design Technology and Application Shanghai Key Laboratory of Trustworthy Computing Shanghai200062 China National University of Singapore Department of Electrical and Computer Engineering 117583 Singapore ShanghaiTech University School of Information Science and Technology Shanghai201210 China

Microservice architecture has revolutionized web service development by facilitating loosely coupled and independently developable components distributed as containers or virtual machines. While existing studies emphasize end-to-end latency, this paper investigates energy-efficient quality-of-service (QoS)-oriented microservice provisioning, focusing on both QoS satisfaction and power consumption (PC) conservation. We propose the Green and Intelligent Resource Provision (GIRP) architecture, integrating a data-driven energy-latency-aware resource allocation and scheduling manager to balance latency and PC. To reconcile the trade-offs involved, a dual-objective optimization problem is formulated to minimize latency and energy use by selecting proper servers, allocating CPU cores, and determining service replicas. To address challenges with discrete variables, dual objectives, and implicit mappings, we leverage a model-free deep deterministic policy gradient-based reinforcement learning algorithm. Specifically, we develop a multi-task agent via the Multi-gate Mixture-of-Experts model to simultaneously make two separate actions regarding CPU core numbers and service replica numbers, followed by a single-task agent to determine service scheduling. Extensive experiments on the DeathStarBenchmark testbed validate GIRP's effectiveness, demonstrating approximately 52% resource savings and a 43% reduction in PC compared to leading methods like Sinan, Firm, and heuristic-based algorithms. These results highlight GIRP's capability to optimize microservice orchestration by balancing end-to-end latency and power efficiency. © 2025 IEEE. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Adaptive UAV-Assisted Hierarchical Federated Learning: Optimizing Energy, Latency, and Resilience for Dynamic Smart IoT Networks

arXiv

引用

arXiv 2025年

作者： Yang, Xiaohong Liwang, Minghui Fu, Liqun Su, Yuhan Hosseinalipour, Seyyedali Wang, Xianbin Hong, Yiguang School of Informatics Xiamen University Fujian China Department of Control Science and Engineering The National Key Laboratory of Autonomous Intelligent Unmanned Systems China Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Tongji University Shanghai China School of Electronic Science and Engineering Xiamen University Xiamen China Department of Electrical Engineering University at Buffalo-SUNY BuffaloNY United States Department of Electrical and Computer Engineering Western University ON Canada

Hierarchical Federated Learning (HFL) introduces intermediate aggregation layers, addressing the limitations of conventional Federated Learning (FL) in geographically dispersed environments with limited communication infrastructure. An application of HFL is in smart IoT systems, such as remote monitoring, disaster response, and battlefield operations, where cellular connectivity is often unreliable or unavailable. In these scenarios, UAVs serve as mobile aggregators, providing connectivity to the terrestrial IoT devices. This paper studies an HFL architecture for energy-constrained UAVs in smart IoT systems, pioneering a solution to minimize global training cost increased caused by UAV disconnection. In light of this, we formulate a joint optimization problem involving learning configuration, bandwidth allocation, and device-to-UAV association, and perform global aggregation in time before UAV drops disconnect and redeployment of UAVs. The problem explicitly accounts for the dynamic nature of IoT devices and their interruptible communications and is unveiled to be NP-hard. To address this, we decompose it into three subproblems. First, we optimize the learning configuration and bandwidth allocation using an augmented Lagrangian function to reduce training costs. Second, we propose a device fitness score, integrating data heterogeneity (via Kullback-Leibler divergence), device-to-UAV distances, and IoT device resources, and develop a twin-delayed deep deterministic policy gradient (TD3)-based algorithm for dynamic device-to-UAV assignment. Third, We introduce a low-complexity two-stage greedy strategy for finding the location of UAVs redeployment and selecting the appropriate global aggregator UAV. Experiments on real-world datasets demonstrate significant cost reductions and robust performance under communication interruptions. © 2025, CC BY-NC-ND.

关键词： Federated 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

来源：评论

学校读者我要写书评

暂无评论

Advancing IC Fault Localization and Diagnosis Through Machine Learning

Advancing IC Fault Localization and Diagnosis Through Machin...

引用

2025 International Conference on Multi-Agent systems for Collaborative Intelligence, ICMSCI 2025

作者： Rajasekar, P. Kumar, Alok Prema Latha, V. Jayapal, N. Santhoshi, Boddu Soundarya Karthik, K. Sivaramkumar, Mathiyalagan School of Computing Srm Institute of Science and Technology Department of Data Science and Business Systems Tamil Nadu Kattankulathur603203 India Guru Gobind Singh Educational Society Department of Electrical and Electronics Engineering Technical Campus Jharkhand Bokaro827013 India Koneru Lakshmaiah Education Foundation Department of Computer Science and Engineering Andhra Pradesh Vaddeswaram522302 India Kongunadu College of Engineering and Technology Department of Electronics and Communication Engineering Tamil Nadu Trichy621215 India S.R.K.R Engineering College Department of Mechanical Engineering Andhra Pradesh Bhimavaram534204 India Velammal College of Engineering and Technology Department of Electronics and Communication Engineering Tamil Nadu Madurai625009 India Saveetha University Department of Biosciences Chennai602105 India

ISBN: (纸本)9798331509828

Fault localization and diagnosis of Integrated Circuits (ICs) are essential for maintaining dependability in contemporary electronic systems. This research presents a sophisticated system utilizing Data Augmentation, Wrapper-based feature selection, and deep learning to improve the precision of defect identification and localization. Data Augmentation methods, such as synthetic fault data generation via SMOTE, rectify dataset imbalances, facilitating the model's generalization across various fault scenarios. Wrapper-based feature selection utilizes Recursive Feature Elimination (RFE) to discern the most significant characteristics, including timing delays, voltage levels, and signal patterns, so diminishing dimensionality while preserving essential information. The framework is centred around a deep learning model that integrates Convolutional Neural Networks (CNNs) for spatial fault detection and Long Short-Term Memory (LSTM) networks for temporal analysis. Experimental findings indicate a notable enhancement in fault localization precision, less false positives, and improved model interpretability. This method offers a scalable and resilient alternative for integrated circuit defect diagnosis, tackling the increasing complexity of contemporary electronic systems. © 2025 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Preserving Location Privacy of IoT Devices in Heterogeneous Edge computing Architecture Through Deniability-Based Authentication

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Ali, Ikram Li, Jianqiang Chen, Jie Chen, Yong Ullah, Shamsher Wakeel, Abdul Shenzhen University National Engineering Laboratory of Big Data System Computing Technology Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China University of Electronic Science and Technology of China School of Automation Engineering Chengdu611731 China National University of Sciences and Technology Military College of Signals Department of Electrical Engineering Islamabad Pakistan

Edge computing moves cloud services closer to consumer Internet of Things (IoT) devices, reducing latency and bandwidth usage. This setup enables faster responses but also introduces new security challenges, particularly concerning location privacy when sender and receiver use different security techniques. The authentication process in such architectures can expose the location of IoT devices. To address this issue, researchers have proposed various privacy-preserving schemes. However, these are computationally heavy for IoT devices. To tackle this issue, we propose two novel heterogeneous deniable authentication schemes: HDA-IoT-I and HDA-IoT-II. These schemes use public-key infrastructure and identity-based cryptography to protect the location privacy of IoT devices in heterogeneous edge computing environments. Our schemes enable the designated edge device to verify the source of a message without being able to prove its origin to a third party, thus preserving privacy. Additionally, they incorporate a batch verification method, which speeds up the verification of multiple deniable authenticators. The proposed schemes are formally proven secure in the random oracle model based on the hardness assumption of elliptic curve inverse computational Diffie-Hellman problem. The performance evaluation demonstrate that our schemes significantly enhance computational and communication efficiency, making them suitable for IoT devices. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic Control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

LEARNING EFFICIENT POSITIONAL ENCODINGS WITH GRAPH NEURAL NETWORKS

arXiv

引用

arXiv 2025年

作者： Kanatsoulis, Charilaos I. Choi, Evelyn Jegelka, Stephanie Leskovec, Jure Ribeiro, Alejandro Dept. of Computer Science Stanford University United States School of Computation Information and Technology Technical University of Munich Computer Science & Artificial Intelligence Laboratory Massachusetts Institute of Technology United States Dept. of Electrical and Systems Engineering University of Pennsylvania United States

Positional encodings (PEs) are essential for effective graph representation learning because they provide position awareness in inherently position-agnostic transformer architectures and increase the expressive capacity of Graph Neural Networks (GNNs). However, designing powerful and efficient PEs for graphs poses significant challenges due to the absence of canonical node ordering and the scale of the graph. In this work, we identify four key properties that graph PEs should satisfy: stability, expressive power, scalability, and genericness. We find that existing eigenvector-based PE methods often fall short of jointly satisfying these criteria. To address this gap, we introduce PEARL, a novel framework of learnable PEs for graphs. Our primary insight is that message-passing GNNs function as nonlinear mappings of eigenvectors, enabling the design of GNN architectures for generating powerful and efficient PEs. A crucial challenge lies in initializing node attributes in a manner that is both expressive and permutation equivariant. We tackle this by initializing GNNs with random node inputs or standard basis vectors, thereby unlocking the expressive power of message-passing operations, while employing statistical pooling functions to maintain permutation equivariance. Our analysis demonstrates that PEARL approximates equivariant functions of eigenvectors with linear complexity, while rigorously establishing its stability and high expressive power. Experimental evaluations show that PEARL outperforms lightweight versions of eigenvector-based PEs and achieves comparable performance to full eigenvector-based PEs, but with one or two orders of magnitude lower complexity. Our code is available at https://***/ehejin/Pearl-PE. Copyright © 2025, The Authors. All rights reserved.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Vehicular Road Crack Detection with Deep Learning: A New Online Benchmark for Comprehensive Evaluation of Existing Algorithms

arXiv

引用

arXiv 2025年

作者： Ma, Nachuan Song, Zhengfei Hu, Qiang Liu, Chuang-Wei Han, Yu Zhang, Yanting Fan, Rui Xie, Lihua College of Electronics & Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems the State Key Laboratory of Intelligent Autonomous Systems Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai201804 China School of Computer Science and Technology Donghua University Shanghai201620 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore

In the emerging field of urban digital twins (UDTs), advancing intelligent road inspection (IRI) vehicles with automatic road crack detection systems is essential for maintaining civil infrastructure. Over the past decade, deep learning-based road crack detection methods have been developed to detect cracks more efficiently, accurately, and objectively, with the goal of replacing manual visual inspection. Nonetheless, there is a lack of systematic reviews on state-of-the-art (SoTA) deep learning techniques, especially data-fusion and label-efficient algorithms for this task. This paper thoroughly reviews the SoTA deep learning-based algorithms, including (1) supervised, (2) unsupervised, (3) semi-supervised, and (4) weakly-supervised methods developed for road crack detection. Also, we create a dataset called UDTIRI-Crack, comprising 2, 500 high-quality images from seven public annotated sources, as the first extensive online benchmark in this field. Comprehensive experiments are conducted to compare the detection performance, computational efficiency, and generalizability of public SoTA deep learning-based algorithms for road crack detection. In addition, the feasibility of foundation models and large language models (LLMs) for road crack detection is explored. Afterwards, the existing challenges and future development trends of deep learning-based road crack detection algorithms are discussed. We believe this review can serve as practical guidance for developing intelligent road detection vehicles with the next-generation road condition assessment systems. The released benchmark UDTIRI-Crack is available at https://***/submission/. © 2025, CC BY.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

User Grouping-Based Hierarchical Rate-Splitting Multiple Access for Reconfigurable Intelligent Surface-Assisted Downlink Communication

引用

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Yang, Zhixiang Feng, Lei Zhou, Fanqin Xie, Kunyi Qiu, Xuesong Xiong, Zehui Yuen, Chau Han, Zhu Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing100876 China Singapore University of Technology and Design Pillar of Information Systems Technology and Design Singapore487372 Singapore Nanyang Technological University School of Electrical and Electronic Engineering Singapore639798 Singapore University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

The joint optimization of rate-splitting multiple access (RSMA) and reconfigurable intelligent surface (RIS) offers a mutually beneficial solution. In this paper, we study a RIS-assisted downlink user grouping-based hierarchical RSMA communication network, where the base station transmits the common streams and private streams simultaneously to serve multiple users. The sum rate (SR) optimization problem is constructed to jointly optimize user grouping, beamforming, and rate splitting. To tackle the NP-hard problem, a user grouping algorithm is first provided to form the hierarchical RSMA model. Next, an equivalent weighted minimum mean-square error (WMMSE) problem is constructed and a WMMSE-based block coordinate descent (BCD) algorithm is designed to update the remaining variables in an iterated way. Specifically, the optimization of transmit beamforming and the rate splitting matrix is reduced to solving a typical convex quadratically constrained quadratic program problem. The solution for passive beamforming is recovered from the intermediate result obtained by the manifold optimization method. Finally, the process of the BCD algorithm is presented. The numerical results indicate that the proposed scheme evidently surpasses one-layer RSMA scheme, NOMA scheme, SDMA scheme, and no RIS scheme, especially in overloaded scenarios. The proposed scheme further increases the SR of common steams compared to the hierarchical RSMA scheme and significantly reduces computational complexity compared to the generalized RSMA scheme. © 2015 IEEE.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：