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

arXiv 2024年

作者： You, Changsheng Cai, Yunlong Liu, Yuanwei Di Renzo, Marco Duman, Tolga M. Yener, Aylin Swindlehurst, A. Lee Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen China College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom Université Paris-Saclay CNRS CentraleSupélec Laboratoire des Signaux et Systèmes Gif-sur-Yvette91192 France Department of Electrical and Electronics Engineering Bilkent University Ankara06800 Turkey Departments of Electrical and Computer Engineering Computer Science and Engineering and Integrated Systems Engineering The Ohio State University OH United States Center for Pervasive Communications and Computing University of California IrvineCA92697 United States

To accommodate new applications such as extended reality, fully autonomous vehicular networks and the metaverse, next generation wireless networks are going to be subject to much more stringent performance requirements than the fifth-generation (5G) in terms of data rates, reliability, latency, and connectivity. It is thus necessary to develop next generation advanced transceiver (NGAT) technologies for efficient signal transmission and reception. In this tutorial, we explore the evolution of NGAT from three different perspectives. Specifically, we first provide an overview of new-field NGAT technology, which shifts from conventional far-field channel models to new near-field channel models. Then, three new-form NGAT technologies and their design challenges are presented, including reconfigurable intelligent surfaces, flexible antennas, and holographic multi-input multi-output (MIMO) systems. Subsequently, we discuss recent advances in semantic-aware NGAT technologies, which can utilize new metrics for advanced transceiver designs. Finally, we point out other promising transceiver technologies for future research. Copyright © 2024, The Authors. All rights reserved.

关键词： Near field communication

来源：评论

学校读者我要写书评

暂无评论

Efficient Multi-user Offloading of Personalized Diffusion Models: A DRL-Convex Hybrid Solution

arXiv

引用

arXiv 2024年

作者： Yang, Wanting Xiong, Zehui Guo, Song Mao, Shiwen Kim, Dong In Debbah, Merouane Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong Department of Electrical and Computer Engineering Auburn University Auburn36830 United States Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of KU 6G Research Center Khalifa University of Science and Technology P O Box 127788 Abu Dhabi United Arab Emirates CentraleSupelec University Paris-Saclay Gif-sur-Yvette91192 France

Generative diffusion models like Stable Diffusion are at the forefront of the thriving field of generative models today, celebrated for their robust training methodologies and high-quality photorealistic generation capabilities. These models excel in producing rich content, establishing them as essential tools in the industry. Building on this foundation, the field has seen the rise of personalized content synthesis as a particularly exciting application. However, the large model sizes and iterative nature of inference make it difficult to deploy personalized diffusion models broadly on local devices with heterogeneous computational power. To address this, we propose a novel framework for efficient multi-user offloading of personalized diffusion models. This framework accommodates a variable number of users, each with different computational capabilities, and adapts to the fluctuating computational resources available on edge servers. To enhance computational efficiency and alleviate the storage burden on edge servers, we propose a tailored multi-user hybrid inference approach. This method splits the inference process for each user into two phases, with an optimizable split point. Initially, a cluster-wide model processes low-level semantic information for each user’s prompt using batching techniques. Subsequently, users employ their personalized models to refine these details during the later phase of inference. Given the constraints on edge server computational resources and users’ preferences for low latency and high accuracy, we model the joint optimization of each user’s offloading request handling and split point as an extension of the Generalized Quadratic Assignment Problem (GQAP). Our objective is to maximize a comprehensive metric that balances both latency and accuracy across all users. To solve this NP-hard problem, we transform the GQAP into an adaptive decision sequence, model it as a Markov decision process, and develop a hybrid solution combining dee

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Performance Optimization for Vehicular Cooperative Sensing: A Graph Attention Based Reinforcement Learning Approach

Performance Optimization for Vehicular Cooperative Sensing: ...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Xuefei Li Mingzhe Chen Danpu Liu Zhilong Zhang Tony Q. S. Quek Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering and Institute for Data Science and Computing University of Miami Coral Gables FL USA Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

In this paper, the problem of collaborative vehicle sensing is investigated. In the considered model, a set of cooperative vehicles provide sensing information to sensing request vehicles with limited sensing and communication resources. A base station (BS) determines the subset of sensing request vehicles that each cooperative vehicle will serve and the sub-regions that each cooperative vehicle will detect. We formulate an optimization problem aiming to maximize the number of successfully detected sub-regions of sensing request vehicles while satisfying the cooperative sensing energy requirement by jointly determining the cooperative vehicle association and the sensing sub-region selection. To solve this problem, we propose a graph attention based reinforcement learning (RL) algorithm that can generate the graph information vectors based on the correlation between each cooperative vehicle and each sensing request vehicle. Using the learned graph information, the joint cooperative vehicle association and sensing sub-region selection strategy will be determined. Simulation results show that the proposed scheme can improve the number of successfully detected sub-regions of sensing request vehicles by up to 12.5% compared to the conventional RL algorithm without using graph attention networks (GANs).

关键词： Base stations Correlation Network topology Simulation Collaboration Reinforcement learning Vectors Sensors Global communication Optimization

来源：评论

学校读者我要写书评

暂无评论

Optimal AoI-based Block Propagation and Incentive Mechanism for Blockchain Networks in Web 3.0

引用

IEEE Transactions on Cognitive Communications and Networking 2024年

作者： Wen, Jinbo Kang, Jiawen Xiong, Zehui Du, Hongyang Yang, Zhaohui Niyato, Dusit Shen, Meng Jiao, Yutao Zhang, Yang Nanjing University of Aeronautics and Astronautics College of Computer Science and Technology China Guangdong University of Technology School of Automation China Singapore University of Technology and Design Pillar of Information Systems Technology and Design Singapore Hong Kong University Department of Electrical and Electronic Engineering Hong Kong Zhejiang University College of Information Science and Electronic Engineering China Nanyang Technological University College of Computing and Data Science Singapore Beijing Institute of Technology School of Cyberspace Science and Technology China Army Engineering University of PLA College of Communications Engineering China

Web 3.0 is regarded as a revolutionary paradigm that enables users to securely manage data without a centralized authority. Blockchains, which enable data to be managed in a decentralized and transparent manner, are key technologies for achieving Web 3.0 goals. However, blockchain-based Web 3.0 is still in its infancy, such as ensuring block freshness and optimizing block propagation to improve blockchain performance. In this paper, we develop a freshness-aware block propagation optimization framework for Web 3.0. We first propose a novel metric called Age of Block Information (AoBI) based on the concept of age of information to quantify block freshness. AoBI measures the time elapsed from the freshest transaction generation to the completion of block consensus. To make block propagation optimization tractable, we classify miners into five different states and propose a block propagation model for public blockchains inspired by epidemic models. Moreover, considering that the miners are bounded rational, we propose an incentive mechanism based on the evolutionary game for block propagation to improve block propagation efficiency. Numerical results demonstrate that compared with other block propagation mechanisms in public blockchains, the proposed scheme has a higher block forwarding probability, which improves block propagation efficiency and decreases the minimum value of average AoBI. © 2015 IEEE.

关键词： age of information block propagation evolutionary game Web 3.0 wireless networks

来源：评论

学校读者我要写书评

暂无评论

Computation Offloading in Air-Ground Integrated Vehicular Edge Computing Networks

Computation Offloading in Air-Ground Integrated Vehicular Ed...

引用

IEEE Globecom Workshops

作者： Shichao Li Hongbin Chen Fangqing Tan Ning Zhang Siyu Lin Tony Q. S. Quek School of Information and Communication Guilin University of Electronic Technology Guilin China Department of Electrical and Computer Engineering University of Windsor Windsor ON Canada School of Electronic and Information Engineering Beijing Jiaotong University Beijing China Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore

The integration of vehicle edge computing (VEC) and air-ground integrated network is considered as a key technology to achieve autonomous driving, where the tasks can be offloaded to the high altitude platform (HAP) through an unmanned aerial vehicle (UAV) as a relay. In this paper, we investigate a joint access equipment selection and resource allocation problem, with the objective of minimizing the total task offloading delay in the air-ground integrated VEC network. Considering the formulated problem is a non-convex problem, we decompose it into three subproblems: access equipment selection, joint bandwidth and computation resource allocation, and UAV trajectory design. Considering the first subproblem is an integer programming problem, the many-to-one matching method is utilized to solve it. Meanwhile, we utilize the CVX package and successive convex approximation (SCA) method to solve the last two subproblems, respectively. Considering the matching externality, we utilize coalition game method to deal with it. Based on the solutions of the three subproblems, the joint computation offloading and resource allocation (JCORA) algorithm has been proposed. Simulation results show that the proposed JCORA algorithm can reduce the total task offloading delay compared with other algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Federated Cubic Regularized Newton Learning with Sparsification-amplified Differential Privacy

arXiv

引用

arXiv 2024年

作者： Huo, Wei Liu, Changxin Ding, Kemi Johansson, Karl Henrik Shi, Ling Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures StockholmSE-10044 Sweden School of System Design and Intelligent Manufacturing Southern University of Science and Technology Shenzhen518055 China

This paper investigates the use of the cubic-regularized Newton method within a federated learning framework while addressing two major concerns that commonly arise in federated learning: privacy leakage and communication bottleneck. We introduce a federated learning algorithm called Differentially Private Federated Cubic Regularized Newton (DP-FCRN). By leveraging second-order techniques, our algorithm achieves lower iteration complexity compared to first-order methods. We also incorporate noise perturbation during local computations to ensure privacy. Furthermore, we employ sparsification in uplink transmission, which not only reduces the communication costs but also amplifies the privacy guarantee. Specifically, this approach reduces the necessary noise intensity without compromising privacy protection. We analyze the convergence properties of our algorithm and establish the privacy guarantee. Finally, we validate the effectiveness of the proposed algorithm through experiments on a benchmark dataset. © 2024, CC BY.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Deep learning model compression using network sensitivity and gradients

arXiv

引用

arXiv 2022年

作者： Sakthi, Madhumitha Yadla, Niranjan Pawate, Raj Electrical and Computer Engineering The University of Texas Austin United States Tensilica IPG Cadence Design Systems Inc. United States

Deep learning model compression is an improving and important field for the edge deployment of deep learning models. Given the increasing size of the models and their corresponding power consumption, it is vital to decrease the model size and compute requirement without a significant drop in the model’s performance. In this paper, we present model compression algorithms for both non-retraining and retraining conditions. In the first case where retraining of the model is not feasible due to lack of access to the original data or absence of necessary compute resources while only having access to off-the-shelf models, we propose the Bin & Quant algorithm for compression of the deep learning models using the sensitivity of the network parameters. This results in 13x compression of the speech command and control model and 7x compression of the DeepSpeech2 models. In the second case when the models can be retrained and utmost compression is required for the negligible loss in accuracy, we propose our novel gradient-weighted k-means clustering algorithm (GWK). This method uses the gradients in identifying the important weight values in a given cluster and nudges the centroid towards those values, thereby giving importance to sensitive weights. Our method effectively combines product quantization with the EWGS [1] algorithm for sub-1bit representation of the quantized models. We test our GWK algorithm on the CIFAR10 dataset across a range of models such as ResNet20, ResNet56, MobileNetv2 and show 35x compression on quantized models for less than 2% absolute loss in accuracy compared to the floating-point models. © 2022, CC BY.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Deep Learning-Based Automated Segmentation of Fiber Breaks in Advanced Composites 38

Deep Learning-Based Automated Segmentation of Fiber Breaks i...

引用

38th Technical Conference of the American Society for Composites, ASC 2023

作者： Jain, Sudhir Li, Carina Xiaochen Vuong, Daniel McGllick, Matthew Saifaee, Saeed Furtado, Carolina Kopp, Reed Joseph, Joshua Adjodah, Dhaval Rosini, Sebastian Sinclair, Ian Spearing, S. Mark Wardle, Brian L. Integrated Design and Management Program Massachusetts Institute of Technology CambridgeMA02139 United States Department of Aeronautics and Astronautics Massachusetts Institute of Technology CambridgeMA02139 United States Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States MIT Media Lab Massachusetts Institute of Technology CambridgeMA02139 United States Department of Mechanical Engineering University of Southampton SouthamptonSO17 1BJ United Kingdom Departments of Aeronautics and Astronautics and Mechanical Engineering Massachusetts Institute of Technology CambridgeMA02139 United States

ISBN: (纸本)9781605956916

The heterogeneity of the microstructure and the anisotropy of the mechanical properties of carbon fiber reinforced polymer composites (CFRP) are associated with complex damage mechanisms that make failure prediction highly challenging. Typical damage mechanisms for CFRP include: (i) interlaminar cracking (delamination), (ii) matrix cracking, and (iii) fiber breakage. X-ray computed tomography (CT) has been utilized recently to identify the complex damage in progressive failure of CFRP in 3D and 4D (3D spatial and 1D temporal). However, these scans contain a large amount of data (≈10 GB/mm3), which makes it challenging to extract mechanistic insights in a reasonable time frame. In previous work, we presented the first deep learning (DL) convolutional neural network (CNN) segmentation of multiclass microscale matrix damage in CFRP. The trained CNN segments complex and sparse composite matrix damage mechanism to ≈ 99.99% agreement, with nearly 100% of human time eliminated, providing higher accuracy compared to human segmentation. In this work, we developed CNN-based method for the automated segmentation of fiber breaks using synchrotron radiation-based CT (SRCT) scans that have been human-labeled. The model employed a U-Net full CNN as the high-level encoder (feature extraction)-decoder (feature localization) structure, and VGG16 as the deep CNN backbone via the publicly available Segmentation Models GitHub repository. An unbiased evaluation was performed comparing the machine vs. the human-labeled ground truth. Finally, active learning was presented for the machine-assisted relabeling of datasets containing fiber breaks. The deep learning-based automated segmentation method demonstrated accurate identification (> 90%) of fiber breakage for CFRP. © 2023 by DEStech Publications, Inc. and American Society for Composites. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Generative AI-empowered Simulation for Autonomous Driving in Vehicular Mixed Reality Metaverses

arXiv

引用

arXiv 2023年

作者： Xu, Minrui Niyato, Dusit Chen, Junlong Zhang, Hongliang Kang, Jiawen Xiong, Zehui Mao, Shiwen Han, Zhu The School of Computer Science and Engineering Nanyang Technological University Singapore308232 Singapore The School of Electronics Peking University Beijing100871 China The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore487372 Singapore The Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States The Department of Electrical and Computer Engineering University of Houston HoustonTX77004 United States The Department of Computer Science and Engineering Kyung Hee University Seoul446-701 Korea Republic of

In the vehicular mixed reality (MR) Metaverse, the distance between physical and virtual entities can be overcome by fusing the physical and virtual environments with multidimensional communications in autonomous driving systems. Assisted by digital twin (DT) technologies, connected autonomous vehicles (AVs), roadside units (RSU), and virtual simulators can maintain the vehicular MR Metaverse via digital simulations for sharing data and making driving decisions collaboratively. However, large-scale traffic and driving simulation via realistic data collection and fusion from the physical world for online prediction and offline training in autonomous driving systems are difficult and costly. In this paper, we propose an autonomous driving architecture, where generative AI is leveraged to synthesize unlimited conditioned traffic and driving data in simulations for improving driving safety and traffic efficiency. First, we propose a multi-task DT offloading model for the reliable execution of heterogeneous DT tasks with different requirements at RSUs. Then, based on the preferences of AV’s DTs and collected realistic data, virtual simulators can synthesize unlimited conditioned driving and traffic datasets to further improve robustness. Finally, we propose a multi-task enhanced auction-based mechanism to provide fine-grained incentives for RSUs in providing resources for autonomous driving. The property analysis and experimental results demonstrate that the proposed mechanism and architecture are strategy-proof and effective, respectively. © 2023, CC BY.

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

Sparks of GPTs in Edge Intelligence for Metaverse: Caching and Inference for Mobile AIGC Services

arXiv

引用

arXiv 2023年

作者： Xu, Minrui Niyato, Dusit Zhang, Hongliang Kang, Jiawen Xiong, Zehui Mao, Shiwen Han, Zhu School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore School of Electronics Peking University Beijing100871 China School of Automation Guangdong University of Technology China Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore487372 Singapore Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States Department of Electrical and Computer Engineering University of Houston HoustonTX77004 United States Department of Computer Science and Engineering Kyung Hee University Seoul446-701 Korea Republic of

Aiming at achieving artificial general intelligence (AGI) for Metaverse, pretrained foundation models (PFMs), e.g., generative pretrained transformers (GPTs), can effectively provide various AI services, such as autonomous driving, digital twins, and AI-generated content (AIGC) for extended reality. With the advantages of low latency and privacy-preserving, serving PFMs of mobile AI services in edge intelligence is a viable solution for caching and executing PFMs on edge servers with limited computing resources and GPU memory. However, PFMs typically consist of billions of parameters that are computation and memory-intensive for edge servers during loading and execution. In this article, we investigate edge PFM serving problems for mobile AIGC services of Metaverse. First, we introduce the fundamentals of PFMs and discuss their characteristic fine-tuning and inference methods in edge intelligence. Then, we propose a novel framework of joint model caching and inference for managing models and allocating resources to satisfy users’ requests efficiently. Furthermore, considering the in-context learning ability of PFMs, we propose a new metric to evaluate the freshness and relevance between examples in demonstrations and executing tasks, namely the Age of Context (AoC). Finally, we propose a least context algorithm for managing cached models at edge servers by balancing the tradeoff among latency, energy consumption, and accuracy. © 2023, CC BY.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：