Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
A Selective-Discrete Particle Swarm Optimization Algorithm For Solving A Class Of Orienteering Problems, Aldy Gunawan, Vincent F. Yu, Perwira Redi, Parida Jewpanya, Hoong Chuin Lau
A Selective-Discrete Particle Swarm Optimization Algorithm For Solving A Class Of Orienteering Problems, Aldy Gunawan, Vincent F. Yu, Perwira Redi, Parida Jewpanya, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This study addresses a class of NP-hard problem called the Orienteering Problem (OP), which belongs to a well-known class of vehicle routing problems. In the OP, a set of nodes that associated with a location and a score is given. The time required to travel between each pair of nodes is known in advance. The total travel time is limited by a predetermined time budget. The objective is to select a subset of nodes to be visited that maximizes the total collected score within a path. The Team OP (TOP) is an extension of OP that incorporates multiple paths. Another …
Temporal Understanding Of Human Mobility: A Multi-Time Scale Analysis, Tongtong Liu, Zheng Yang, Yi Zhao, Chenshu Wu, Zimu Zhou, Yunhao Liu
Temporal Understanding Of Human Mobility: A Multi-Time Scale Analysis, Tongtong Liu, Zheng Yang, Yi Zhao, Chenshu Wu, Zimu Zhou, Yunhao Liu
Research Collection School Of Computing and Information Systems
The recent availability of digital traces generated by cellphone calls has significantly increased the scientific understanding of human mobility. Until now, however, based on low time resolution measurements, previous works have ignored to study human mobility under various time scales due to sparse and irregular calls, particularly in the era of mobile Internet. In this paper, we introduced Mobile Flow Records, flow-level data access records of online activity of smartphone users, to explore human mobility. Mobile Flow Records collect high-resolution information of large populations. By exploiting this kind of data, we show the models and statistics of human mobility at …
Accelerating Dynamic Graph Analytics On Gpus, Mo Shan, Yuchen Li, Bingsheng He, Kian-Lee Tan
Accelerating Dynamic Graph Analytics On Gpus, Mo Shan, Yuchen Li, Bingsheng He, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
As graph analytics often involves compute-intensive operations,GPUs have been extensively used to accelerate the processing. However, in many applications such as social networks, cyber security, and fraud detection, their representative graphs evolve frequently and one has to perform are build of the graph structure on GPUs to incorporate the updates. Hence, rebuilding the graphs becomes the bottleneck of processing high-speed graph streams. In this paper,we propose a GPU-based dynamic graph storage scheme to support existing graph algorithms easily. Furthermore,we propose parallel update algorithms to support efficient stream updates so that the maintained graph is immediately available for high-speed analytic processing …