Debasish Jana

Dr. Debasish Jana

University of California, Los Angeles, Los Angeles, California, USA
+3
orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
12 January 2022 in Mechanical Systems and Signal Processing
Verified
Journal Article
Closed access
DJDebasish Jana
Debasish Jana
JPJayant Patil
Jayant Patil
SHSudheendra Herkal
Sudheendra Herkal
SNSatish Nagarajaiah
Satish Nagarajaiah
LDLeonardo Duenas-Osorio
Leonardo Duenas-Osorio


1 March 2022 in Mechanical Systems and Signal Processing
Verified
Journal Article
Closed access
WCWei Chen
Wei Chen
DJDebasish Jana
Debasish Jana
ASAryan Singh
Aryan Singh
MJMengshi Jin
Mengshi Jin
MCMattia Cenedese
Mattia Cenedese
JNJean-Philippe Noël
Jean-Philippe Noël

21 December 2023 in PLOS ONE
Verified
Journal Article
Open access
PDF file
DJDebasish Jana
Debasish Jana
SMSven Malama
Sven Malama
SNSriram Narasimhan
Sriram Narasimhan
ETErtugrul Taciroglu
Ertugrul Taciroglu
Transportation networks play a crucial role in society by enabling the smooth movement of people and goods during regular times and acting as arteries for evacuations during catastrophes and natural disasters. Identifying the critical road segments in a large and complex network is essential for planners and emergency managers to enhance the network’s efficiency, robustness, and resilience to such stressors. We propose a novel approach to rapidly identify critical and vital network components (road segments in a transportation network) for resilience improvement or post-disaster recovery. We pose the transportation network as a graph with roads as edges and intersections as nodes and deploy a Graph Neural Network (GNN) trained on a broad range of network parameter changes and disruption events to rank the importance of road segments. The trained GNN model can rapidly estimate the criticality rank of individual road segments in the modified network resulting from an interruption. We address two main limitations in the existing literature that can arise in capital planning or during emergencies: ranking a complete network after changes to components and addressing situations in post-disaster recovery sequencing where some critical segments cannot be recovered. Importantly, our approach overcomes the computational overhead associated with the repeated calculation of network performance metrics, which can limit its use in large networks. To highlight scenarios where our method can prove beneficial, we present examples of synthetic graphs and two real-world transportation networks. Through these examples, we show how our method can support planners and emergency managers in undertaking rapid decisions for planning infrastructure hardening measures in large networks or during emergencies, which otherwise would require repeated ranking calculations for the entire network.

1 March 2022 in Mechanical Systems and Signal Processing
Verified
Journal Article
Closed access
MJMengshi Jin
Mengshi Jin
GKGiancarlo Kosova
Giancarlo Kosova
MCMattia Cenedese
Mattia Cenedese
WCWei Chen
Wei Chen
ASAryan Singh
Aryan Singh
JNJean-Philippe Noël
Jean-Philippe Noël