Ke Han
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
Research Subjects
Ke Han has a total of 249 co-authors. Here are the top co-authors by number of shared publications:
Terry L. Friesz
19 shared publicationsTao Yao
14 shared publications- Terry L. Friesz
Pennsylvania State University
10 shared publications - Benedetto Piccoli
Rutgers University - Camden
8 shared publications Hongcheng Liu
8 shared publicationsWen Ji
Southwest Jiaotong University
8 shared publications
Latest Publications
- 10 October 2026
- Published by Springer Nature in Multimedia Systems
- Vol. 32 (10) , 629
LiteCrack-SHD: stage-wise heterogeneous modeling for real-time pavement crack segmentation
- 10 October 2026
- Published by Springer Nature in Multimedia Systems
- Vol. 32 (10) , 629
LiteCrack-SHD: stage-wise heterogeneous modeling for real-time pavement crack segmentation
- 18 September 2026
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 194
A revenue-maximizing share-a-ride problem with consideration of recipients’ roaming locations
- 18 September 2026
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 194
A revenue-maximizing share-a-ride problem with consideration of recipients’ roaming locations
- Open Access
- 23 August 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (17) , 8397
Occupancy-Aware High-Speed Rail Pricing with Aggregate Data: A Case Study in China
Aggregate origin–destination data and summary load factors do not identify train-specific flows; imposing each load factor as an exact margin can therefore overstate precision. We develop an auditable high-speed rail pricing framework combining pooled passenger-kilometer entropy completion, an occupancy-aware pivot logit, link-load equilibrium, and exact-grid Pareto enumeration. Historical train shares guide a sensitivity-tested prior, and target elasticities index fare response. For a reconstructed Beijing–Wuhan case, 97,336 discount vectors are evaluated in each of three core scenarios and candidates are screened across 729 crossed baseline and behavioral scenarios. Under the reference scenario (unit elasticity, crowding-equivalent ratio 0.10, threshold 0.80), the closest-to-ideal admissible vector increases modeled-service revenue by 0.106% and yields a full-corridor-fare-equivalent surplus gain of 0.803%, with maximum link occupancy of 77.27%. It is admissible in only 368 scenarios and reaches 104.45% occupancy in the most adverse case; only the status quo is admissible in all scenarios. The framework thus identifies scenario-specific opportunities while separating exact numerical evaluation from empirical identification and operational robustness under aggregate-data limitations.- 23 August 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (17) , 8397
Open AccessOccupancy-Aware High-Speed Rail Pricing with Aggregate Data: A Case Study in China
Aggregate origin–destination data and summary load factors do not identify train-specific flows; imposing each load factor as an exact margin can therefore overstate precision. We develop an auditable high-speed rail pricing framework combining pooled passenger-kilometer entropy completion, an occupancy-aware pivot logit, link-load equilibrium, and exact-grid Pareto enumeration. Historical train shares guide a sensitivity-tested prior, and target elasticities index fare response. For a reconstructed Beijing–Wuhan case, 97,336 discount vectors are evaluated in each of three core scenarios and candidates are screened across 729 crossed baseline and behavioral scenarios. Under the reference scenario (unit elasticity, crowding-equivalent ratio 0.10, threshold 0.80), the closest-to-ideal admissible vector increases modeled-service revenue by 0.106% and yields a full-corridor-fare-equivalent surplus gain of 0.803%, with maximum link occupancy of 77.27%. It is admissible in only 368 scenarios and reaches 104.45% occupancy in the most adverse case; only the status quo is admissible in all scenarios. The framework thus identifies scenario-specific opportunities while separating exact numerical evaluation from empirical identification and operational robustness under aggregate-data limitations. - 20 July 2026
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 220
Combating food waste in imperfect agricultural products with quality decay over two periods
- 20 July 2026
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 220
Combating food waste in imperfect agricultural products with quality decay over two periods
- Open Access
DANet: Joint Density- and Semantics-Adaptive Convolution for 3D Point-Cloud Semantic Segmentation
Semantic segmentation of 3D point clouds remains difficult when LiDAR or depth-camera data are sampled unevenly. This paper presents DANet, a 3D semantic segmentation framework built on joint density- and semantics-adaptive convolution. Its core operator, Density-Adaptive Radius Convolution (DAR-Conv), predicts point-wise neighborhood radii before feature aggregation by combining density-driven initialization with semantics-aware modulation. In this way, dense regions can use compact receptive fields, whereas sparse or semantically complex regions can draw on broader contextual support. DANet also includes a Gated Adaptive Cross-Layer Fusion (GACF) module, which aligns encoder–decoder features and performs gated fusion with residual refinement. Experiments on S3DIS and NPM3D show that DANet obtains the highest reported mean accuracy (mAcc) among the compared methods on S3DIS, and high mean Intersection over Union (mIoU) and overall accuracy (OA) on NPM3D, supporting the usefulness of density- and semantics-aware receptive-field adaptation.
Open AccessDANet: Joint Density- and Semantics-Adaptive Convolution for 3D Point-Cloud Semantic Segmentation
Semantic segmentation of 3D point clouds remains difficult when LiDAR or depth-camera data are sampled unevenly. This paper presents DANet, a 3D semantic segmentation framework built on joint density- and semantics-adaptive convolution. Its core operator, Density-Adaptive Radius Convolution (DAR-Conv), predicts point-wise neighborhood radii before feature aggregation by combining density-driven initialization with semantics-aware modulation. In this way, dense regions can use compact receptive fields, whereas sparse or semantically complex regions can draw on broader contextual support. DANet also includes a Gated Adaptive Cross-Layer Fusion (GACF) module, which aligns encoder–decoder features and performs gated fusion with residual refinement. Experiments on S3DIS and NPM3D show that DANet obtains the highest reported mean accuracy (mAcc) among the compared methods on S3DIS, and high mean Intersection over Union (mIoU) and overall accuracy (OA) on NPM3D, supporting the usefulness of density- and semantics-aware receptive-field adaptation.
- 29 May 2026
- Published by Springer Nature in Applied Spatial Analysis and Policy
- Vol. 19 (2) , 135
Urban Characteristics Driving Spatial Heterogeneity of Ozone Pollution: Insights from Spatial Machine Learning and Geoshapley Analysis
- 29 May 2026
- Published by Springer Nature in Applied Spatial Analysis and Policy
- Vol. 19 (2) , 135
Urban Characteristics Driving Spatial Heterogeneity of Ozone Pollution: Insights from Spatial Machine Learning and Geoshapley Analysis
- 26 April 2026
- Published by Taylor & Francis in Transportmetrica A: Transport Science
- p. 1-28
Dynamic structural analyses of urban construction waste transportation networks
- 26 April 2026
- Published by Taylor & Francis in Transportmetrica A: Transport Science
- p. 1-28
Dynamic structural analyses of urban construction waste transportation networks