QiuLing Tang

Ms. QiuLing Tang

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
Verified
Journal Article
Open access
PDF file
QTQiuLing Tang
QiuLing Tang
WDWanfeng Dou
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 results in a longer computation time to obtain LCP. This paper proposes a method for calculating the LCP using a multi-resolution raster cost surface model to enhance computational performance for large-scale grids. The original raster cost surface is progressively downsampled to generate grids of decreasing resolutions. Subsequently, the path is determined on the low-resolution raster. By performing operations such as filtering directional points and mapping path points, the final path on the high-resolution raster can be obtained. The method enables a parallel computation of paths. Therefore, it significantly improves the efficiency for synthetic raster cost surfaces with continuous or discrete characteristics, as well as for raster cost surfaces generated from real terrain datasets, while also providing an end-to-end path output. The experiments show that 80% of the results are very close to the original LCP, and the accuracy of the remaining paths falls within an acceptable range. At the same time, our method greatly improves the efficiency of path solving on a large-scale raster, fulfilling practical application requirements.

13 September 2023 in Soft Computing
Verified
Journal Article
Closed access
PDF file
YCYan Chen
Yan Chen
QTQiuLing Tang
QiuLing Tang
HMHua Ma
Hua Ma


1 April 2017
Verified
Conference Paper
Closed access
JSJiahao Shi
Jiahao Shi
QTQiuLing Tang
QiuLing Tang
XLXian Li
Xian Li
A decode-and-forward (DF) relaying wireless energy harvesting network, where the energy constrained relay uses the energy harvested from radio-frequency (RF) signals to forward data is considered in this paper. The relay collects energy and data through using time switching-based relaying (TSR) mechanism. For the delay-limited transmission mode, the outage probability is theoretically studied and a close-form expression of the outage probability is provided in the case of high SNR. Besides, the impacts of the relay circuit power on the system performance, i.e. the outage probability and the throughput, are investigated. Finally, numerical simulation results show that the existence of circuit power leads to the optimal energy harvesting time longer and the optimal throughput smaller.