Bipin Gaikwad
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
Bipin Gaikwad has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
Abani Patra
2 shared publications- Abani Patra
Data Intensive Studies Center, Tufts University, Medford, MA 02155, USA
2 shared publications Abhijit Karmakar
2 shared publications- Joseph Patrick White
Center for Computational Research, University at Buffalo, Buffalo, NY, USA
2 shared publications - Nikolay A. Simakov
Center for Computational Research, Center for Computational Research, University at Buffalo, Buffalo, NY, USA
2 shared publications - Shivanshu Mishra
Department of Electrical and Computer Engineering University of Minnesota Minneapolis MN 55455 USA
2 shared publications
Latest Publications
- Open Access
- 4 October 2026
- Published by Elsevier in SSRN Electronic Journal
On Multi-entity, Multivariate Quickest Change Point Detection
We propose an unsupervised learning framework for online quickest Change Point Detection (qCPD) for multi-entity, multivariate time series data, a problem setting in which system-level behavioral shifts must be detected across a population of interacting entities whose number and behavior may be uncertain or evolve. This setting, motivated by applications such as crowd monitoring where traditional sensing methods (e.g., video surveillance) may be infeasible, is not addressed by existing single-stream CPD methods or multi-entity anomaly detection techniques. We introduce IDfN-to-SWAS, a two-stage detection pipeline in which entity-level deviations from nominal behavior, Individual Deviation from Normality (IDfN) scores, are aggregated into a System-Wide Anomaly Score (SWAS). A CUSUM-based sequential detector is applied to the SWAS to identify persistent or abrupt system-level changes with low detection delay. The framework requires only training data obtained under normal system operation to determine the model required for IDfN calculation. Importantly, it naturally supports variable entity counts without retraining and is compatible with a wide range of anomaly scoring backbones. Evaluations on synthetic datasets and crowd simulations, explicitly designed for anomaly detection in group behaviors, demonstrate that our method accurately detects system-level changes, offering a scalable and privacy-preserving solution for monitoring complex multi-entity systems. To support reproducible benchmarking in this emerging problem domain, we additionally release three first-of-their-kind multi-entity multivariate datasets explicitly designed for evaluating system-level CPD in interactive multi-entity systems.
- 4 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessOn Multi-entity, Multivariate Quickest Change Point Detection
We propose an unsupervised learning framework for online quickest Change Point Detection (qCPD) for multi-entity, multivariate time series data, a problem setting in which system-level behavioral shifts must be detected across a population of interacting entities whose number and behavior may be uncertain or evolve. This setting, motivated by applications such as crowd monitoring where traditional sensing methods (e.g., video surveillance) may be infeasible, is not addressed by existing single-stream CPD methods or multi-entity anomaly detection techniques. We introduce IDfN-to-SWAS, a two-stage detection pipeline in which entity-level deviations from nominal behavior, Individual Deviation from Normality (IDfN) scores, are aggregated into a System-Wide Anomaly Score (SWAS). A CUSUM-based sequential detector is applied to the SWAS to identify persistent or abrupt system-level changes with low detection delay. The framework requires only training data obtained under normal system operation to determine the model required for IDfN calculation. Importantly, it naturally supports variable entity counts without retraining and is compatible with a wide range of anomaly scoring backbones. Evaluations on synthetic datasets and crowd simulations, explicitly designed for anomaly detection in group behaviors, demonstrate that our method accurately detects system-level changes, offering a scalable and privacy-preserving solution for monitoring complex multi-entity systems. To support reproducible benchmarking in this emerging problem domain, we additionally release three first-of-their-kind multi-entity multivariate datasets explicitly designed for evaluating system-level CPD in interactive multi-entity systems.
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Analyzing HPC Job Wait Times under Resource Scaling Using Historical Workload Data
Understanding the impact of hardware configuration, infrastructure investments, and operational policies on job wait times in high-performance computing (HPC) systems is a challenging problem primarily due to the lack of effective tools that are built on controlled, real-world observations across different system configurations. In this work, we present a data-driven framework that leverages historical job traces to estimate the impact of resource modifications on queue performance. Using job data collected from multiple HPC systems during periods with no hardware changes, we construct a synthetic scheduler that replays real job submission patterns and resource requests, while using ground-truth runtimes to model execution. This enables controlled, counterfactual evaluation of infrastructure changes without modifying production systems. We perform experiments by scaling system resources, including GPUs and CPU cores. Our results on GPU-based systems show that increasing GPU capacity leads to significant reductions in wait times, while CPU-only scaling provides minimal benefit. To quantify these effects, we introduce the Weighted Wait-Time Score (WWS), a bounded metric that captures both typical and tail wait-time behavior. Our experiments show that informed resource scaling improves WWS (up to 92% relative gain in WWS for low-baseline systems), capturing gains in both typical and tail wait-time behavior under this metric. We further formulate a cost-aware optimization framework to guide resource allocation under budget constraints. Our approach offers a data-driven way to evaluate HPC upgrades and supports future predictive optimization and better resource use. Overall, this work provides (i) a trace-driven framework for evaluating resource scaling effects, (ii) a bounded metric (WWS) for comparing wait-time performance, and (iii) a pathway to optimal user wait time optimization based resource allocation in HPC systems.
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Open AccessAnalyzing HPC Job Wait Times under Resource Scaling Using Historical Workload Data
Understanding the impact of hardware configuration, infrastructure investments, and operational policies on job wait times in high-performance computing (HPC) systems is a challenging problem primarily due to the lack of effective tools that are built on controlled, real-world observations across different system configurations. In this work, we present a data-driven framework that leverages historical job traces to estimate the impact of resource modifications on queue performance. Using job data collected from multiple HPC systems during periods with no hardware changes, we construct a synthetic scheduler that replays real job submission patterns and resource requests, while using ground-truth runtimes to model execution. This enables controlled, counterfactual evaluation of infrastructure changes without modifying production systems. We perform experiments by scaling system resources, including GPUs and CPU cores. Our results on GPU-based systems show that increasing GPU capacity leads to significant reductions in wait times, while CPU-only scaling provides minimal benefit. To quantify these effects, we introduce the Weighted Wait-Time Score (WWS), a bounded metric that captures both typical and tail wait-time behavior. Our experiments show that informed resource scaling improves WWS (up to 92% relative gain in WWS for low-baseline systems), capturing gains in both typical and tail wait-time behavior under this metric. We further formulate a cost-aware optimization framework to guide resource allocation under budget constraints. Our approach offers a data-driven way to evaluate HPC upgrades and supports future predictive optimization and better resource use. Overall, this work provides (i) a trace-driven framework for evaluating resource scaling effects, (ii) a bounded metric (WWS) for comparing wait-time performance, and (iii) a pathway to optimal user wait time optimization based resource allocation in HPC systems.
- Open Access
- 18 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Predictive Modeling of HPC Job Queue Times: Improving User Decision-Making and Resource Utilization
- 18 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessPredictive Modeling of HPC Job Queue Times: Improving User Decision-Making and Resource Utilization
- 29 November 2024
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 140
Self-supervised anomaly detection and localization for X-ray cargo images: Generalization to novel anomalies
- 29 November 2024
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 140
Self-supervised anomaly detection and localization for X-ray cargo images: Generalization to novel anomalies
- 12 June 2023
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 234
Real-time distributed video analytics for privacy-aware person search
- 12 June 2023
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 234
Real-time distributed video analytics for privacy-aware person search
- 29 August 2022
- Published by Elsevier in Materials Science in Semiconductor Processing
- Vol. 152
Prediction of threshold voltage of GaN HEMTs using deep learning model designed by genetic algorithm
- 29 August 2022
- Published by Elsevier in Materials Science in Semiconductor Processing
- Vol. 152
Prediction of threshold voltage of GaN HEMTs using deep learning model designed by genetic algorithm
- 22 July 2022
- Published by AIP Publishing in Journal of Applied Physics
- Vol. 132 (4) , 044902
Semi-supervised physics guided deep learning framework: An application in modeling of gallium nitride based high electron mobility transistors
This research article proposes a deep learning framework that addresses two major hurdles in adopting deep learning techniques for solving physics-based problems. One is the requirement of a large data set for training the deep learning (DL) model and another is the consistency of a DL model with the physics of a phenomenon. The framework is generic that can be applied to model a phenomenon in physics if its behavior is known. A semi-supervised physics guided neural network (SPGNN) has been developed based on our framework to demonstrate the concept. SPGNN models the I–V characteristics of gallium nitride based high electron mobility transistors (GaN HEMTs). A two-stage method has been proposed to train a DL model. In the first stage, the DL model is trained via an unsupervised learning method using the analytical physics-based model of a field-effect transistor (FET) as a loss function of the DL model that incorporates the physics of the FET in the DL model. Later, the DL model is fine-tuned with a small set of experimental data in the second stage. Performance of SPGNN has been assessed on various sizes of the data set with 100, 500, 1000, 1500, and 2000 samples. SPGNN significantly reduces the training data requirement by more than 80% and provides better performance than a traditionally trained neural network (TTNN), even for the unseen test data set. SPGNN predicts 32.4% of the unseen test data with less than 1% of error and only 0.4% of the unseen test data with more than 10% of error.
- 22 July 2022
- Published by AIP Publishing in Journal of Applied Physics
- Vol. 132 (4) , 044902
Semi-supervised physics guided deep learning framework: An application in modeling of gallium nitride based high electron mobility transistors
This research article proposes a deep learning framework that addresses two major hurdles in adopting deep learning techniques for solving physics-based problems. One is the requirement of a large data set for training the deep learning (DL) model and another is the consistency of a DL model with the physics of a phenomenon. The framework is generic that can be applied to model a phenomenon in physics if its behavior is known. A semi-supervised physics guided neural network (SPGNN) has been developed based on our framework to demonstrate the concept. SPGNN models the I–V characteristics of gallium nitride based high electron mobility transistors (GaN HEMTs). A two-stage method has been proposed to train a DL model. In the first stage, the DL model is trained via an unsupervised learning method using the analytical physics-based model of a field-effect transistor (FET) as a loss function of the DL model that incorporates the physics of the FET in the DL model. Later, the DL model is fine-tuned with a small set of experimental data in the second stage. Performance of SPGNN has been assessed on various sizes of the data set with 100, 500, 1000, 1500, and 2000 samples. SPGNN significantly reduces the training data requirement by more than 80% and provides better performance than a traditionally trained neural network (TTNN), even for the unseen test data set. SPGNN predicts 32.4% of the unseen test data with less than 1% of error and only 0.4% of the unseen test data with more than 10% of error.
- 24 February 2022
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 99
End-to-end person re-identification: Real-time video surveillance over edge-cloud environment
- 24 February 2022
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 99
End-to-end person re-identification: Real-time video surveillance over edge-cloud environment
- 2 February 2021
- Published by Springer Nature in Journal of Real-Time Image Processing
- Vol. 18 (6) , 1993-2007
Smart surveillance system for real-time multi-person multi-camera tracking at the edge
- 2 February 2021
- Published by Springer Nature in Journal of Real-Time Image Processing
- Vol. 18 (6) , 1993-2007
Smart surveillance system for real-time multi-person multi-camera tracking at the edge