Search Results for author: Jun Cai

Found 6 papers, 1 papers with code

A Revolution of Personalized Healthcare: Enabling Human Digital Twin with Mobile AIGC

no code implementations22 Jul 2023 Jiayuan Chen, Changyan Yi, Hongyang Du, Dusit Niyato, Jiawen Kang, Jun Cai, Xuemin, Shen

To promote the development of this new breed of paradigm, in this article, we propose a system architecture of mobile AIGC-driven HDT and highlight the corresponding design requirements and challenges.

Active RIS-aided EH-NOMA Networks: A Deep Reinforcement Learning Approach

no code implementations11 Apr 2023 Zhaoyuan Shi, Huabing Lu, Xianzhong Xie, Helin Yang, Chongwen Huang, Jun Cai, Zhiguo Ding

The problem of joint control of the RIS's amplification matrix and phase shift matrix is formulated to maximize the communication success ratio with considering the quality of service (QoS) requirements of users, dynamic communication state, and dynamic available energy of RIS.

reinforcement-learning

Deep Reinforcement Learning Based Multidimensional Resource Management for Energy Harvesting Cognitive NOMA Communications

no code implementations17 Sep 2021 Zhaoyuan Shi, Xianzhong Xie, Huabing Lu, Helin Yang, Jun Cai, Zhiguo Ding

Due to the non-convexity of this optimization problem and the stochastic nature of the wireless environment, we propose a distributed multidimensional resource management algorithm based on deep reinforcement learning (DRL).

Management reinforcement-learning +1

Advanced NOMA Assisted Semi-Grant-Free Transmission Schemes for Randomly Distributed Users

no code implementations17 Dec 2020 Huabing Lu, Xianzhong Xie, Zhaoyuan Shi, Hongjiang Lei, Helin Yang, Jun Cai

Non-orthogonal multiple access (NOMA) assisted semi-grant-free (SGF) transmission has recently received significant research attention due to its outstanding ability of serving grant-free (GF) users with grant-based (GB) users' spectrum, which greatly improves the spectrum efficiency and effectively relieves the massive access problem of 5G and beyond networks.

Information Theory Information Theory

A practical heuristic for finding graph minors

1 code implementation10 Jun 2014 Jun Cai, William G. Macready, Aidan Roy

We present a heuristic algorithm for finding a graph $H$ as a minor of a graph $G$ that is practical for sparse $G$ and $H$ with hundreds of vertices.

Quantum Physics Data Structures and Algorithms Combinatorics 05C83, 81P68

Cannot find the paper you are looking for? You can Submit a new open access paper.