Qiuling Tang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Qiuling Tang has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Jiahao Shi
Institute for Quantum Computing, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
2 shared publications - Xian Li
State Key Laboratory of Coal Combustion
2 shared publications - Hua Ma
Zhengzhou Railway Vocational and Technical College
1 shared publication - Wanfeng Dou
School of Computer and Electronic Information, Nanjing Normal University, Nanjing 210023, China
1 shared publication - Yan Chen
Hong Kong Baptist University, Kowloon Tong, Hong Kong
1 shared publication Yulong Han
Guangxi University
1 shared publication
Latest Publications
- 13 September 2023
- Published by Springer Nature in Soft Computing
- Vol. 28 (6) , 4799-4820
Multi-source adaptive meta-learning framework for domain generalization person re-identification
- 13 September 2023
- Published by Springer Nature in Soft Computing
- Vol. 28 (6) , 4799-4820
Multi-source adaptive meta-learning framework for domain generalization person re-identification
- Open Access
- 17 July 2023
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 12 (7) , 287
An Effective Method for Computing the Least-Cost Path Using a Multi-Resolution Raster Cost Surface Model
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.
- 17 July 2023
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 12 (7) , 287
Open AccessAn Effective Method for Computing the Least-Cost Path Using a Multi-Resolution Raster Cost Surface Model
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.
- 24 February 2018
- Published by Springer Nature
- p. 67-73
Mobile Sink Data Collection Mechanism for Throughput Maximization with RF Energy Harvesting in WSNs
- 24 February 2018
- Published by Springer Nature
- p. 67-73
Mobile Sink Data Collection Mechanism for Throughput Maximization with RF Energy Harvesting in WSNs
- 1 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 327-330
Performance of DF relaying wireless energy harvesting network with considering non-ideal circuit power
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.
- 1 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 327-330
Performance of DF relaying wireless energy harvesting network with considering non-ideal circuit power
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.