|
|
|
|
|
Sanaz Gheibi, Tania Banerjee, Sanjay Ranka and Sartaj Sahni
This paper proposes a new time-respecting graph (TRG) representation for contact sequence temporal graphs. Our representation is more memory-efficient than previously proposed representations and has run-time advantages over the ordered sequence of edges...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yanqi Wang, Xinyan Qin, Wenxing Jia, Jin Lei, Dexin Wang, Tianming Feng, Yujie Zeng and Jie Song
In order to improve the flight efficiency of a flying?walking power transmission line inspection robot (FPTLIR) during flight missions, an accurate energy consumption model is constructed, and a multiobjective optimization approach using the improved NSG...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sergio Jesús González-Ambriz, Rolando Menchaca-Méndez, Sergio Alejandro Pinacho-Castellanos and Mario Eduardo Rivero-Ángeles
This paper presents the spectral gap-based topology control algorithm (SGTC) for wireless backhaul networks, a novel approach that employs the Laplacian Spectral Gap (LSG) to find expander-like graphs that optimize the topology of the network in terms of...
ver más
|
|
|
|
|
|
|
|
|
|
|
Qiuling Tang and Wanfeng Dou
Calculating the least-cost path (LCP) is a fundamental operation in raster-based geographic information systems (GIS). The LCP is applied to raster cost surfaces, in which it determines the most cost-effective path. Increasing the raster resolution resul...
ver más
|
|
|
|
|
|
|
|
|
|
|
Juarez Machado da Silva, Gabriel de Oliveira Ramos and Jorge Luis Victória Barbosa
The Shortest Path (SP) problem resembles a variety of real-world situations where one needs to find paths between origins and destinations. A generalization of the SP is the Dynamic Shortest Path (DSP) problem, which also models changes in the graph at a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yifu Ge, Zhongyu He and Kai Shang
Exploring the relationship between leisure walking and the built environment will provide an improvement in human health and well-being. It is, therefore, necessary to explore the most relevant scale for leisure walking and how the association between th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Reza Hosseini, Daoqin Tong, Samsung Lim, Qian Chayn Sun, Gunho Sohn, Gyözö Gidófalvi, Abbas Alimohammadi and Seyedehsan Seyedabrishami
Unlike car navigation, where almost all vehicles can traverse every route, one route might not be optimal or even suitable for all pedestrians. Route geometry information, including tortuosity, twists and turns along roads, junctions, and road slopes, am...
ver más
|
|
|
|
|
|
|
|
|
|
|
Bi Yu Chen, Huihuang Huang, Hui-Ping Chen, Wenxuan Liu, Xuan-Yan Chen and Tao Jia
The order k Voronoi diagram (OkVD) is an effective geometric construction to partition the geographical space into a set of Voronoi regions such that all locations within a Voronoi region share the same k nearest points of interest (POIs). Despite the br...
ver más
|
|
|
|
|
|
|
|
|
|
|
Zhenyu Tian, Jiali You and Linlin Hu
Network layer multicast is a powerful method for transmitting data from sources to multiple group members. When joining a multicast group, a group member first sends a request to a designated router (DR). Then, the DR selects a node in the existing multi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Joo Young Kim and Young Ook Kim
Numerous pedestrians interact with the subway station space by finding entrances into this closed area to use the subway system; further, they may use transfer transportation facilities or the complex functions nearby, such as commercial. Many studies ex...
ver más
|
|
|
|
|
|