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

Diffusion-based Reinforcement Learning for Edge-enabled AI-Generated Content Services

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Du, Hongyang Li, Zonghang Niyato, Dusit Kang, Jiawen Xiong, Zehui Huang, Huawei Mao, Shiwen The School of Computer Science and Engineering The Energy Research Institute @ NTU Interdisciplinary Graduate Program Nanyang Technological University Singapore The School of Information and Communication Engineering University of Electronic Sciences and Technology of China Chengdu China The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore The School of Software Engineering Sun Yat-Sen University Zhuhai China The Department of Electrical and Computer Engineering Auburn University Auburn United States

As Metaverse emerges as the next-generation Internet paradigm, the ability to efficiently generate content is paramount. AI-Generated Content (AIGC) emerges as a key solution, yet the resource-intensive nature of large Generative AI (GAI) models presents challenges. To address this issue, we introduce an AIGC-as-a-Service (AaaS) architecture, which deploys AIGC models in wireless edge networks to ensure broad AIGC services accessibility for Metaverse users. Nonetheless, an important aspect of providing personalized user experiences requires carefully selecting AIGC Service Providers (ASPs) capable of effectively executing user tasks, which is complicated by environmental uncertainty and variability. Addressing this gap in current research, we introduce the AI-Generated Optimal Decision (AGOD) algorithm, a diffusion model-based approach for generating the optimal ASP selection decisions. Integrating AGOD with Deep Reinforcement Learning (DRL), we develop the Deep Diffusion Soft Actor-Critic (D2SAC) algorithm, enhancing the efficiency and effectiveness of ASP selection. Our comprehensive experiments demonstrate that D2SAC outperforms seven leading DRL algorithms. Furthermore, the proposed AGOD algorithm has the potential for extension to various optimization problems in wireless networks, positioning it as a promising approach for future research on AIGC-driven services. The implementation of our proposed method is available at: https://***/Lizonghang/AGOD. © 2023, CC BY.

关键词： Reinforcement learning

Performance Analysis and Optimization for Jammer-Aided Multi-Antenna UAV Covert Communication

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Du, Hongyang Niyato, Dusit Xie, Yuan-Ai Cheng, Yanyu Kang, Jiawen Kim, Dong In The School of Computer Science and Engineering Energy Research Institute @ NTU Interdisciplinary Graduate Program Nanyang Technological University Singapore The School of Computer Science and Engineering Nanyang Technological University Singapore The Institute of Electrical Engineering Yanshan University Qinhuangdao066004 China Alibaba-NTU Singapore Joint Research Institute Nanyang Technological University Singapore639798 Singapore The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

Unmanned aerial vehicles (UAVs) have attracted a lot of research attention because of their high mobility and low cost in serving as temporary aerial base stations (BSs) and providing high data rates for next-generation communication networks. To protect user privacy while avoiding detection by a warden, we investigate a jammer-aided UAV covert communication system, which aims to maximize the user's covert rate with optimized transmit and jamming power. The UAV is equipped with multi-antennas to serve multi-users simultaneously and enhance the Quality of Service. By considering the general composite fading and shadowing channel models, we derive the exact probability density (PDF) and cumulative distribution functions (CDF) of the signal-to-interference-plus-noise ratio (SINR). The obtained PDF and CDF are used to derive the closed-form expressions for detection error probability and covert rate. Furthermore, the covert rate maximization problem is formulated as a Nash bargaining game, and the Nash bargaining solution (NBS) is introduced to investigate the negotiation among users. To solve the NBS, we propose two algorithms, i.e., particle swarm optimization-based and joint two-stage power allocation algorithms, to achieve covertness and high data rates under the warden's optimal detection threshold. All formulated problems are proven to be convex, and the complexity is analyzed. The numerical results are presented to verify the theoretical performance analysis and show the effectiveness and success of achieving the covert communication of our algorithms. © 2022, CC BY.

关键词： Unmanned aerial vehicles (UAV)

Deep Learning with Greedy Layer-Wise Compound Scaling for Temperature and Humidity Prediction in Solar Dryer Dome

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Cenggoro, Tjeng Wawan Elwirehardja, Gregorius Natanael Dominic, Nicholas Setiawan, Karli Eka Rahutomo, Reza Djuana, Endang Gunawan, Fergyanto E. Budiman, Arief S. Romeli, Sugiarto Pardamean, Bens Computer Science Department School of Computer Science Bina Nusantara University Jakarta11480 Indonesia Bioinformatics and Data Science Research Center Bina Nusantara University Jakarta11480 Indonesia Computer Science Department BINUS Graduate Program Master of Computer Science Program Bina Nusantara University Jakarta11480 Indonesia Information Systems Department School of Information Systems Bina Nusantara University Jakarta11480 Indonesia Electrical Engineering Department Faculty of Industrial Technology Universitas Trisakti Jakarta11440 Indonesia Industrial Engineering Department BINUS Graduate Program Master of Industrial Engineering Bina Nusantara University Jakarta11480 Indonesia Department of Manufacturing and Mechanical Engineering and Technology Oregon Institute of Technology Klamath FallsOR97601 United States PT. Impack Pratama Industri Jakarta Indonesia

Drying has been an eco-friendly and cost-efficient method to reduce post-harvest losses of agricultural crops. In various countries, the technique has been widely utilized in the form of Solar Dryer Dome (SDD) buildings. Accurate indoor microclimate forecasting is very important to implement smart control systems in SDDs that can maintain the ideal conditions, as the availability of solar energy is limited only at daytimes and the temperature may drop significantly during nighttimes in remote areas. The microclimate variables that play an important role in maintaining ideal environmental conditions include temperature and relative humidity. © 2022, The Authors. All rights reserved.

关键词： Forecasting

Impact of Image Enhancement for Osteoporosis Detection Based on Deep Learning Algorithm

学校读者我要写书评

暂无评论

Impact of Image Enhancement for Osteoporosis Detection Based...

computer System, Information Technology, and Electrical engineering (COSITE), International Conference on

作者： Riza Dianil Iman Roslidar Roslidar Kahlil Muchtar Amalia Amalia Mohammad Syaryadhi Alfatirta Mufti Novi Maulina Department of Electrical and Computer Engineering Universitas Syiah Kuala Banda Aceh Indonesia Department of Computer Science Universitas Sumatera Utara Medan Indonesia Graduate School of System Designs Tokyo Metropolitan University Tokyo Japan Doctorate Student of Doctoral Program in Medical Sciences Faculty of Medicine Universitas Syiah Kuala Banda Aceh Indonesia

Osteoporosis can be defined as a degenerative disease with reduced bone mass and changes in bone architecture that can lead to bone fragility and the risk of fractures. This abnormality can be indicated by the bone density which in visual can be determined using X-Ray images. However, X-Ray images are susceptible to noise, while in image analysis image contrast affects deep learning abilities. Hence, the CLAHE (Contrast Limited Adaptive Histogram Equalization) algorithm is used as a contrast enhancement technique in X-Ray images. This study aims to build a deep learning model using the CLAHE-enhanced image dataset with the ResNet-50 and ResNet-101 architectures. The model was built using two different datasets, namely the original image dataset and the CLAHE-enhanced image dataset. The result shows that the highest performance is given by the ResNet-101 model using the CLAHE-enhanced image dataset with an accuracy rate of 96%, precision of 95%, specificity of 95%, recall of 97% and an Fl-score of 96%, respectively. By using the CLAHE algorithm, the resulting image has high contrast and looks better at displaying features in the image so as to produce better model performance.

关键词：

GraCo: Granularity-Controllable Interactive Segmentation

学校读者我要写书评

暂无评论

GraCo: Granularity-Controllable Interactive Segmentation

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Yian Zhao Kehan Li Zesen Cheng Pengchong Qiao Xiawu Zheng Rongrong Ji Chang Liu Li Yuan Jie Chen School of Electronic and Computer Engineering Peking University Shenzhen China AI for Science (AI4S)-Preferred Program Peking University Shenzhen Graduate School China Peng Cheng Laboratory Shenzhen China Key Laboratory of Multimedia Trusted Perception and Efficient Computing Ministry of Education of China Xiamen University China Department of Automation and BNRist Tsinghua University Beijing China

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

Interactive Segmentation (IS) segments specific objects or parts in the image according to user input. Current IS pipelines fall into two categories: single-granularity out-put and multi-granularity output. The latter aims to allevi-ate the spatial ambiguity present in the former. However, the multi-granularity output pipeline suffers from limited interaction flexibility and produces redundant results. In this work, we introduce Granularity-Controllable Interactive Segmentation (GraCo), a novel approach that allows precise control of prediction granularity by introducing ad-ditional parameters to input. This enhances the customization of the interactive system and eliminates redundancy while resolving ambiguity. Nevertheless, the exorbitant cost of annotating multi-granularity masks and the lack of avail-able datasets with granularity annotations make it difficult for models to acquire the necessary guidance to control out-put granularity. To address this problem, we design an any-granularity mask generator that exploits the semantic property of the pre-trained IS model to automatically gen-erate abundant mask-granularity pairs without requiring additional manual annotation. Based on these pairs, we propose a granularity-controllable learning strategy that efficiently imparts the granularity controllability to the IS model. Extensive experiments on intricate scenarios at ob-ject and part levels demonstrate that our GraCo has signifi-cant advantages over previous methods. This highlights the potential of GraCo to be a flexible annotation tool, capable of adapting to diverse segmentation scenarios. The project page: https://***/GraCo.

关键词： Image segmentation Adaptation models Annotations Interactive systems Pipelines Semantics Redundancy

Enhancing Deep Reinforcement Learning: A Tutorial on Generative Diffusion Models in Network Optimization

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Du, Hongyang Zhang, Ruichen Liu, Yinqiu Wang, Jiacheng Lin, Yijing Li, Zonghang Niyato, Dusit Kang, Jiawen Xiong, Zehui Cui, Shuguang Ai, Bo Zhou, Haibo Kim, Dong In The School of Computer Science and Engineering The Energy Research Institute @ NTU Interdisciplinary Graduate Program Nanyang Technological University Singapore The School of Computer Science and Engineering Nanyang Technological University Singapore The State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications China The School of Information and Communication Engineering University of Electronic Sciences and Technology of China Chengdu China The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore Shenzhen China The State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China School of Electronic Science and Engineering Nanjing University Jiangsu Nanjing210093 China The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

Generative Diffusion Models (GDMs) have emerged as a transformative force in the realm of Generative Artificial Intelligence (GenAI), demonstrating their versatility and efficacy across various applications. The ability to model complex data distributions and generate high-quality samples has made GDMs particularly effective in tasks such as image generation and reinforcement learning. Furthermore, their iterative nature, which involves a series of noise addition and denoising steps, is a powerful and unique approach to learning and generating data. This paper serves as a comprehensive tutorial on applying GDMs in network optimization tasks. We delve into the strengths of GDMs, emphasizing their wide applicability across various domains, such as vision, text, and audio generation. We detail how GDMs can be effectively harnessed to solve complex optimization problems inherent in networks. The paper first provides a basic background of GDMs and their applications in network optimization. This is followed by a series of case studies, showcasing the integration of GDMs with Deep Reinforcement Learning (DRL), incentive mechanism design, Semantic Communications (SemCom), Internet of Vehicles (IoV) networks, etc. These case studies underscore the practicality and efficacy of GDMs in real-world scenarios, offering insights into network design. We conclude with a discussion on potential future directions for GDM research and applications, providing major insights into how they can continue to shape the future of network optimization. © 2023, CC BY.

关键词： Reinforcement learning

Chat-UniVi: Unified Visual Representation Empowers Large Language Models with Image and Video Understanding

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Jin, Peng Takanobu, Ryuichi Zhang, Wancai Cao, Xiaochun Yuan, Li School of Electronic and Computer Engineering Peking University Shenzhen China Peng Cheng Laboratory Shenzhen China -Preferred Program Peking University Shenzhen Graduate School Shenzhen China Nari Technology Co. Ltd. China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus Shenzhen China

Large language models have demonstrated impressive universal capabilities across a wide range of open-ended tasks and have extended their utility to encompass multimodal conversations. However, existing methods encounter challenges in effectively handling both image and video understanding, particularly with limited visual tokens. In this work, we introduce Chat-UniVi, a Unified Vision-language model capable of comprehending and engaging in conversations involving images and videos through a unified visual representation. Specifically, we employ a set of dynamic visual tokens to uniformly represent images and videos. This representation framework empowers the model to efficiently utilize a limited number of visual tokens to simultaneously capture the spatial details necessary for images and the comprehensive temporal relationship required for videos. Moreover, we leverage a multi-scale representation, enabling the model to perceive both high-level semantic concepts and low-level visual details. Notably, Chat-UniVi is trained on a mixed dataset containing both images and videos, allowing direct application to tasks involving both mediums without requiring any modifications. Extensive experimental results demonstrate that Chat-UniVi consistently outperforms even existing methods exclusively designed for either images or videos. Code is available at https://***/PKU-YuanGroup/Chat-UniVi. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

CONVERGENCE SPEED AND APPROXIMATION ACCURACY OF NUMERICAL MCMC

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Cui, Tiangang Dong, Jing Jasra, Ajay Tong, Xin T. School of Mathematics Monash University Australia Graduate School of Business Columbia University United States Applied Mathematics and Computational Science Program Computer Electrical Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Saudi Arabia Department of Mathematics National University of Singapore Singapore

When implementing Markov Chain Monte Carlo (MCMC) algorithms, perturbation caused by numerical errors is sometimes inevitable. This paper studies how perturbation of MCMC affects the convergence speed and Monte Carlo estimation accuracy. Our results show that when the original Markov chain converges to stationarity fast enough and the perturbed transition kernel is a good approximation to the original transition kernel, the corresponding perturbed sampler has similar convergence speed and high approximation accuracy as well. We discuss two different analysis frameworks: ergodicity and spectral gap, both are widely used in the literature. Our results can be easily extended to obtain non-asymptotic error bounds for MCMC estimators. We also demonstrate how to apply our convergence and approximation results to the analysis of specific sampling algorithms, including Random walk Metropolis and Metropolis adjusted Langevin algorithm with perturbed target densities, and parallel tempering Monte Carlo with perturbed densities. Finally we present some simple numerical examples to verify our theoretical claims. Copyright © 2022, The Authors. All rights reserved.

关键词： Inverse problems

Economics of Semantic Communication System: An Auction Approach

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Liew, Zi Qin Du, Hongyang Yang, Wei Lim, Bryan Xiong, Zehui Niyato, Dusit Miao, Chunyan Kim, Dong In Alibaba-NTU Singapore Joint Research Institute Nanyang Technological Univerity Singapore The School of Computer Science and Engineering The Energy Research Institute NTU Interdisciplinary Graduate Program Nanyang Technological University Singapore The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore The School of Computer Science and Engineering Nanyang Technological University Singapore The School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore Nanyang Technological University Singapore639798 Singapore The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

Semantic communication technologies enable wireless edge devices to communicate effectively by transmitting semantic meaning of data. Edge components, such as vehicles in next-generation intelligent transport systems, use well-trained semantic models to encode and decode semantic information extracted from raw and sensor data. However, the limitation in computing resources makes it difficult to support the training process of accurate semantic models on edge devices. As such, edge devices can buy the pretrained semantic models from semantic model providers, which is called "semantic model trading". Upon collecting semantic information with the semantic models, the edge devices can then sell the extracted semantic information, e.g., information about urban road conditions or traffic signs, to the interested buyers for profit, which is called "semantic information trading". To facilitate both types of the trades, effective incentive mechanisms should be designed. Thus, in this paper, we propose a hierarchical trading system to support both semantic model trading and semantic information trading jointly. The proposed incentive mechanism helps to maximize the revenue of semantic model providers in the semantic model trading, and effectively incentivizes model providers to participate in the development of semantic communication systems. For semantic information trading, our designed auction approach can support the trading between multiple semantic information sellers and buyers, while ensuring individual rationality, incentive compatibility, and budget balance, and moreover, allowing them achieve higher utilities than the baseline method. Copyright © 2022, The Authors. All rights reserved.

关键词： Commerce