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

arXiv 2022年

作者： Li, Yang Lin, Qingfeng Liu, Ya-Feng Ai, Bo Wu, Yik-Chung Shenzhen Research Institute of Big Data Shenzhen518172 China State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China The Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Peng Cheng Laboratory Shenzhen518055 China Henan Joint International Research Laboratory of Intelligent Networking and Data Analysis Zhengzhou University Zhengzhou450001 China

Device activity detection in the emerging cell-free massive multiple-input multiple-output (MIMO) systems has been recognized as a crucial task in machine-type communications, in which multiple access points (APs) jointly identify the active devices from a large number of potential devices based on the received signals. Most of the existing works addressing this problem rely on the impractical assumption that different active devices transmit signals synchronously. However, in practice, synchronization cannot be guaranteed due to the low-cost oscillators, which brings additional discontinuous and nonconvex constraints to the detection problem. To address this challenge, this paper reveals an equivalent reformulation to the asynchronous activity detection problem, which facilitates the development of a centralized algorithm and a distributed algorithm that satisfy the highly nonconvex constraints in a gentle fashion as the iteration number increases, so that the sequence generated by the proposed algorithms can get around bad stationary points. To reduce the capacity requirements of the fronthauls, we further design a communication-efficient accelerated distributed algorithm. Simulation results demonstrate that the proposed centralized and distributed algorithms outperform state-of-the-art approaches, and the proposed accelerated distributed algorithm achieves a close detection performance to that of the centralized algorithm but with a much smaller number of bits to be transmitted on the fronthaul links. Copyright © 2022, The Authors. All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Adaptive Deployment of UAV-Aided Networks Based on Hybrid Deep Reinforcement Learning

Adaptive Deployment of UAV-Aided Networks Based on Hybrid De...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Xiaoyong Ma Shuting Hu Danyang Zhou Yi Zhou Ning Lu School of Computer and Information Engineering Henan University Kaifeng China International Joint Research Laboratory for Cooperative Vehicular Networks of Henan Henan China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng PR China Queen’s University Kingston Ontario Canada

ISBN: (数字)9781728194844

ISBN: (纸本)9781728194851

Unmanned aerial vehicles (UAVs) can be used as air base stations to provide fast wireless connections for ground users. Due to their constraints on both mobility and energy consumption, a key problem is how to deploy UAVs adaptively in a geographic area with changing traffic demand of mobile users, while meeting the aforemetioned constraints. In this paper, we propose an adaptive deployment strategy for UAV-aided networks based on hybrid deep reinforcement learning, where a UAV can adjust its movement direction and distance to serve users who move randomly in the target area. Through hybrid deep reinforcement learning, UAVs can be trained offline to obtain the global state information and learn a completely distributed control strategy, with which each UAV only needs to take actions based on its observed state in the real deployment to be fully adaptive. Moreover, in order to improve the speed and effect of learning, we improve hybrid reinforcement learning, by adding genetic algorithms and TD-error-based resampling optimization mechanism. Simulation results show that the hybrid deep reinforcement learning algorithm has better efficiency and robustness in multi-UAV control, and has better performance in terms of coverage, energy consumption and average throughput, by which average throughput can be increased by 20% to 60%.

关键词： Energy consumption Adaptive systems Simulation Reinforcement learning Throughput Unmanned aerial vehicles Optimization

来源：评论

学校读者我要写书评

暂无评论

Virtual Reality: A Survey of Enabling Technologies and its Applications in IoT

arXiv

引用

arXiv 2021年

作者： Hu, Miao Luo, Xianzhuo Chen, Jiawen Lee, Young Choon Zhou, Yipeng Wu, Di School of Computer Science and Engineering Sun Yat-sen University Guangzhou510275 China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou510006 China Department of Computing Faculty of Science and Engineering Macquarie University SydneyNSW2109 Australia

Virtual Reality (VR) has shown great potential to revolutionize the market by providing users immersive experiences with freedom of movement. Compared to traditional video streaming, VR is with ultra high-definition and dynamically changes with users’ head and eye movements, which poses significant challenges for the realization of such potential. In this paper, we provide a detailed and systematic survey of enabling technologies of virtual reality and its applications in Internet of Things (IoT). We identify major challenges of virtual reality on system design, view prediction, computation, streaming, and quality of experience evaluation. We discuss each of them by extensively surveying and reviewing related papers in the recent years. We also introduce several use cases of VR for IoT. Last, issues and future research directions are also identified and discussed. Copyright © 2021, The Authors. All rights reserved.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

A queueing-theoretic framework for vehicle dispatching in dynamic car-hailing [technical report]

arXiv

引用

arXiv 2021年

作者： Cheng, Peng Jin, Jiabao Zheng, Libin Chen, Lei Lin, Xuemin East China Normal University Shanghai China The Hong Kong University of Science and Technology Hong Kong Guangdong Key Laboratory of Big Data Analysis and Processing Sun Yat-Sen University Guangzhou China The University of New South Wales Sydney Australia

With the rapid development of smart mobile devices, the car-hailing platforms (e.g., Uber or Lyft) have attracted much attention from the academia and the industry. In this paper, we consider a dynamic car-hailing problem, namely maximum revenue vehicle dispatching (MRVD), in which rider requests dynamically arrive and drivers need to serve riders such that the entire revenue of the platform is maximized. We prove that the MRVD problem is NP-hard and intractable. To handle the MRVD problem, we propose a queueing-based vehicle dispatching framework, which first uses existing machine learning models to predict the future vehicle demand of each region, then estimates the idle time periods of drivers through a double-sided queueing model for each region. With the information of the predicted vehicle demands and estimated idle time periods of drivers, we propose two batch-based vehicle dispatching algorithms to efficiently assign suitable drivers to riders such that the expected overall revenue of the platform is maximized during each batch processing. Through extensive experiments, we demonstrate the efficiency and effectiveness of our proposed approaches over both real and synthetic datasets. In summary, our methods can achieve 3% ∼ 10% increase on overall revenue without sacrificing on running speed compared with the state-of-the-art solutions. Copyright © 2021, The Authors. All rights reserved.

关键词： Queueing theory

来源：评论

学校读者我要写书评

暂无评论

iGniter: Interference-Aware GPU Resource Provisioning for Predictable DNN Inference in the Cloud

arXiv

引用

arXiv 2022年

作者： Xu, Fei Xu, Jianian Chen, Jiabin Chen, Li Shang, Ruitao Zhou, Zhi Liu, Fangming The Shanghai Key Laboratory of Multidimensional Information Processing School of Computer Science and Technology East China Normal University 3663 N. Zhongshan Road Shanghai200062 China The School of Computing and Informatics University of Louisiana at Lafayette 301 East Lewis Street LafayetteLA70504 United States The Guangdong Key Laboratory of Big Data Analysis and Processing School of Computer Science and Engineering Sun Yat-sen University 132 E. Waihuan Road Guangzhou510006 China The National Engineering Research Center for Big Data Technology and System The Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology 1037 Luoyu Road Wuhan430074 China

GPUs are essential to accelerating the latency-sensitive deep neural network (DNN) inference workloads in cloud datacenters. To fully utilize GPU resources, spatial sharing of GPUs among co-located DNN inference workloads becomes increasingly compelling. However, GPU sharing inevitably brings severe performance interference among co-located inference workloads, as motivated by an empirical measurement study of DNN inference on EC2 GPU instances. While existing works on guaranteeing inference performance service level objectives (SLOs) focus on either temporal sharing of GPUs or reactive GPU resource scaling and inference migration techniques, how to proactively mitigate such severe performance interference has received comparatively little attention. In this paper, we propose iGniter, an interference-aware GPU resource provisioning framework for cost-efficiently achieving predictable DNN inference in the cloud. iGniter is comprised of two key components: (1) a lightweight DNN inference performance model, which leverages the system and workload metrics that are practically accessible to capture the performance interference;(2) A cost-efficient GPU resource provisioning strategy that jointly optimizes the GPU resource allocation and adaptive batching based on our inference performance model, with the aim of achieving predictable performance of DNN inference workloads. We implement a prototype of iGniter based on the NVIDIA Triton inference server hosted on EC2 GPU instances. Extensive prototype experiments on four representative DNN models and datasets demonstrate that iGniter can guarantee the performance SLOs of DNN inference workloads with practically acceptable runtime overhead, while saving the monetary cost by up to 25% in comparison to the state-of-the-art GPU resource provisioning strategies. Copyright © 2022, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Cider: Highly efficient processing of densely overlapped communities in big graphs 3rd

Cider: Highly efficient processing of densely overlapped com...

引用

3rd APWeb and WAIM Joint Conference on Web and big data, APWeb-WAIM 2019

作者： Chen, Yadi Bai, Wen Chen, Runyuan Wu, Di Ye, Guoqiao Huang, Zhichuan School of Data and Computer Science Sun Yat-sen University Guangzhou510006 China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou510006 China

ISBN: (纸本)9783030260712

As one of the most fundamental operations in graph analytics, community detection is to find groups of vertices that are more densely connected internally than with the rest of the graph. However, the detection of densely overlapped communities in big graphs is extremely challenging due to high time complexity. In this paper, we propose an effective and efficient graph algorithm called Cider to detect densely overlapped communities in big graphs. The intuition behind our algorithm is to exploit inherent properties of densely overlapped communities, and expand the community by minimizing its conductance. To make Cider more efficient, we extend the algorithm to expand the community more quickly by merging vertices in batches. We explicitly derive the time complexity of our algorithm and conclude that it can be implemented in near-linear time. Besides, we also implement a parallelized version of Cider to further improve its performance. Experimental results on real datasets show that our algorithms outperform existing approaches in terms of Flake Out Degree Fraction (FODF) and F1 Score. © 2019, Springer Nature Switzerland AG.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

REST: Relational event-driven stock trend forecasting

arXiv

引用

arXiv 2021年

作者： Xu, Wentao Liu, Weiqing Xu, Chang Bian, Jiang Yin, Jian Liu, Tie-Yan School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Microsoft Research Asia Beijing China School of Artificial Intelligence Sun Yat-sen University Zhuhai China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China

Stock trend forecasting, aiming at predicting the stock future trends, is crucial for investors to seek maximized profits from the stock market. Many event-driven methods utilized the events extracted from news, social media, and discussion board to forecast the stock trend in recent years. However, existing event-driven methods have two main shortcomings: 1) overlooking the influence of event information differentiated by the stock-dependent properties;2) neglecting the effect of event information from other related stocks. In this paper, we propose a relational event-driven stock trend forecasting (REST) framework, which can address the shortcoming of existing methods. To remedy the first shortcoming, we propose to model the stock context and learn the effect of event information on the stocks under different contexts. To address the second shortcoming, we construct a stock graph and design a new propagation layer to propagate the effect of event information from related stocks. The experimental studies on the real-world data demonstrate the efficiency of our REST framework. The results of investment simulation show that our framework can achieve a higher return of investment than baselines. © 2021, CC BY.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Unsupervised hashing with contrastive information bottleneck

arXiv

引用

arXiv 2021年

作者： Qiu, Zexuan Su, Qinliang Ou, Zijing Yu, Jianxing Chen, Changyou School of Computer Science and Engineering Sun Yat-sen University Guangzhou China School of Artificial Intelligence Sun Yat-sen University Guangdong China CSE Department SUNY at Buffalo Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China

Many unsupervised hashing methods are implicitly established on the idea of reconstructing the input data, which basically encourages the hashing codes to retain as much information of original data as possible. However, this requirement may force the models spending lots of their effort on reconstructing the unuseful background information, while ignoring to preserve the discriminative semantic information that is more important for the hashing task. To tackle this problem, inspired by the recent success of contrastive learning in learning continuous representations, we propose to adapt this framework to learn binary hashing codes. Specifically, we first propose to modify the objective function to meet the specific requirement of hashing and then introduce a probabilistic binary representation layer into the model to facilitate end-to-end training of the entire model. We further prove the strong connection between the proposed contrastive-learning-based hashing method and the mutual information, and show that the proposed model can be considered under the broader framework of the information bottleneck (IB). Under this perspective, a more general hashing model is naturally obtained. Extensive experimental results on three benchmark image datasets demonstrate that the proposed hashing method significantly outperforms existing baselines. © 2021, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Neural multi-objective combinatorial optimization with diversity enhancement 23

Neural multi-objective combinatorial optimization with diver...

引用

Proceedings of the 37th International Conference on Neural Information processing Systems

作者： Jinbiao Chen Zizhen Zhang Zhiguang Cao Yaoxin Wu Yining Ma Te Ye Jiahai Wang School of Computer Science and Engineering Sun Yat-sen University P.R. China School of Computing and Information Systems Singapore Management University Singapore Department of Industrial Engineering & Innovation Sciences Eindhoven University of Technology Netherlands Department of Industrial Systems Engineering & Management National University of Singapore Singapore School of Computer Science and Engineering Sun Yat-sen University P.R. China and Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Sun Yat-sen University P.R. China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou P.R. China

Most of existing neural methods for multi-objective combinatorial optimization (MOCO) problems solely rely on decomposition, which often leads to repetitive solutions for the respective subproblems, thus a limited Pareto set. Beyond decomposition, we propose a novel neural heuristic with diversity enhancement (NHDE) to produce more Pareto solutions from two perspectives. On the one hand, to hinder duplicated solutions for different subproblems, we propose an indicator-enhanced deep reinforcement learning method to guide the model, and design a heterogeneous graph attention mechanism to capture the relations between the instance graph and the Pareto front graph. On the other hand, to excavate more solutions in the neighborhood of each subproblem, we present a multiple Pareto optima strategy to sample and preserve desirable solutions. Experimental results on classic MOCO problems show that our NHDE is able to generate a Pareto front with higher diversity, thereby achieving superior overall performance. Moreover, our NHDE is generic and can be applied to different neural methods for MOCO.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Exploring the regulatory function of the N-terminal domain of SARS-CoV-2 spike protein through molecular dynamics simulation

arXiv

引用

arXiv 2021年

作者： Li, Yao Wang, Tong Zhang, Juanrong Shao, Bin Gong, Haipeng Wang, Yusong Liu, Siyuan Liu, Tie-Yan MOE Key Laboratory of Bioinformatics School of Life Sciences Tsinghua University Beijing100084 China Beijing Advanced Innovation Center for Structural Biology Tsinghua University Beijing100084 China Microsoft Research Asia Beijing China School of Data and Computer Science Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China

SARS-CoV-2 is what has caused the COVID-19 pandemic. Early viral infection is mediated by the SARS-CoV-2 homo-trimeric Spike (S) protein with its receptor binding domains (RBDs) in the receptor-accessible state. We performed molecular dynamics simulation on the S protein with a focus on the function of its N-terminal domains (NTDs). Our study reveals that the NTD acts as a "wedge" and plays a crucial regulatory role in the conformational changes of the S protein. The complete RBD structural transition is allowed only when the neighboring NTD that typically prohibits the RBD’s movements as a wedge detaches and swings away. Based on this NTD "wedge" model, we propose that the NTD-RBD interface should be a potential drug target. Copyright © 2021, The Authors. All rights reserved.

关键词： SARS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：