No abstract

To increase mobile batteries' lifetime and improve quality of experience for computation-intensive and latencysensitive applications, mobile edge computing has received significant interest. Designing energy-efficient mobile edge computing systems requires joint optimization of communication and computation resources. In this paper, we consider energy-efficient resource allocation for a multi-user mobile edge computing system. First, we establish on two computation-efficient models with negligible and non-negligible base station (BS) executing durations, respectively. Then, under each model, we formulate the overall weighted sum energy consumption minimization problem by optimally allocating communication and computation resources. The optimization problem for negligible BS executing duration is convex, and we obtain the optimal solution in closed-form to this problem. The optimization problem for non-negligible BS executing duration is NP-hard in general, and we obtain a suboptimal solution with low-complexity to this problem, by connecting it to a three-stage flow-shop scheduling problem and wisely utilizing Johnson's algorithm. Finally, numerical results show that the proposed solutions outperform some baseline schemes.

The appearance of generative adversarial networks (GAN) provides a new approach and framework for computer vision. Compared with traditional machine learning algorithms, GAN works via adversarial training concept and is more powerful in both feature learning and representation. GAN also exhibits some problems, such as non-convergence, model collapse, and uncontrollability due to high degree of freedom. How to improve the theory of GAN and apply it to computer-vision-related tasks have now attracted much research efforts. In this paper, recently proposed GAN models and their applications in computer vision are systematically reviewed. In particular, we firstly survey the history and development of generative algorithms, the mechanism of GAN, its fundamental network structures, and theoretical analysis of the original GAN. Classical GAN algorithms are then compared comprehensively in terms of the mechanism, visual results of generated samples, and Frechet Inception Distance. These networks are further evaluated from network construction, performance, and applicability aspects by extensive experiments conducted over public datasets. After that, several typical applications of GAN in computer vision, including high-quality samples generation, style transfer, and image translation, are examined. Finally, some existing problems of GAN are summarized and discussed and potential future research topics are forecasted. INDEX TERMS Deep learning, generative adversarial networks (GAN), computer vision (CV), image generation, style transfer, image inpainting.

No abstract

In this letter, we study optimal multicast of tiled 360 virtual reality (VR) video from one server (base station or access point) to multiple users. We consider random viewing directions and random channel conditions, and adopt time division multiple access (TDMA). For given video quality, we optimize the transmission time and power allocation to minimize the average transmission energy. For given transmission energy budget, we optimize the transmission time and power allocation as well as the encoding rate of each tile to maximize the received video quality. These two optimization problems are challenging non-convex problems. We obtain globally optimal closed-form solutions of the two non-convex problems, which reveal important design insights for multicast of tiled 360 VR video. Finally, numerical results demonstrate the advantage of the proposed solutions.