7 citations · 16 across the 6 of their papers we have counts for
7 papers
Causally-Aware Spatio-Temporal Multi-Graph Convolution Network for Accurate and Reliable Traffic Prediction
Pingping Dong, Xiao-Lin Wang, Indranil Bose +3
Accurate and reliable prediction has profound implications to a wide range of applications. In this study, we focus on an instance of spatio-temporal learning problem--traffic pred…
Classifier-guided neural blind deconvolution: a physics-informed denoising module for bearing fault diagnosis under heavy noise
Jing-Xiao Liao, Chao He, Jipu Li +3
Blind deconvolution (BD) has been demonstrated as an efficacious approach for extracting bearing fault-specific features from vibration signals under strong background noise. Despi…
A class-weighted supervised contrastive learning long-tailed bearing fault diagnosis approach using quadratic neural network
Wei-En Yu, Jinwei Sun, Shiping Zhang +2
Deep learning has achieved remarkable success in bearing fault diagnosis. However, its performance oftentimes deteriorates when dealing with highly imbalanced or long-tailed data,…
BearingPGA-Net: A Lightweight and Deployable Bearing Fault Diagnosis Network via Decoupled Knowledge Distillation and FPGA Acceleration
Jing-Xiao Liao, Sheng-Lai Wei, Chen-Long Xie +5
Deep learning has achieved remarkable success in the field of bearing fault diagnosis. However, this success comes with larger models and more complex computations, which cannot be…
A Comprehensive Review of Digital Twin -- Part 2: Roles of Uncertainty Quantification and Optimization, a Battery Digital Twin, and Perspectives
Adam Thelen, Xiaoge Zhang, Olga Fink +7
As an emerging technology in the era of Industry 4.0, digital twin is gaining unprecedented attention because of its promise to further optimize process design, quality control, he…
A bio-inspired algorithm for fuzzy user equilibrium problem by aid of Physarum Polycephalum
Yang Liu, Xiaoge Zhang, Yong Deng
The user equilibrium in traffic assignment problem is based on the fact that travelers choose the minimum-cost path between every origin-destination pair and on the assumption that…