Tanveer Ahmed
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Tanveer Ahmed has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
Anuj Kumar Bharti
School of Computer Science Engineering and Technology, Bennett University, Greater Noida, India
3 shared publicationsMohd Abuzar Sayeed
School of Computer Science Engineering and Technology, Bennett University, Gautam Buddha Nagar, India
2 shared publicationsMohd Asim Sayeed
School of Computer Applications, Babu Banarasi Das University, Lucknow, India
2 shared publications- Amartya Saran
School of Computer Science Engineering and Technology, Bennett University, Greater Noida, India
1 shared publication - Anuj Kumar Bharti
School of Computer Science Engineering and Technology, Bennett University, Greater Noida, India
1 shared publication Gopinath Sahoo
Department of Mathematics, Bennett University, Greater Noida, India
1 shared publication
Latest Publications
- Open Access
- 13 November 2026
- Published by Springer Nature in Scientific Reports
Recolorized financial time series imaging: a multi-dimensional analysis of MTF, GAF, and recurrence plots for imbalanced stock trend classification
- 13 November 2026
- Published by Springer Nature in Scientific Reports
Open AccessRecolorized financial time series imaging: a multi-dimensional analysis of MTF, GAF, and recurrence plots for imbalanced stock trend classification
- Open Access
- 16 September 2026
- Published by Springer Nature in Scientific Reports
Edge centric dysfunction of default mode network in Alzheimer’s disease using resting state fMRI
Disrupted connectivity of the Default Mode Network (DMN) is observed in Alzheimer’s disease as reported in previous literatures. rs-fMRI analyses relying on global or nodal level connectivity measures may overlook dissimilar edge-level dysconnectivity. We postulated that network level disruptions are better captured at edge-level, where aggregated graph metrics suppress the localized connectivity. In this study, we extract the BOLD time series data from 26 DMN regions defined by the AAL3 Atlas, from rs-fMRI data from Alzheimer’s Disease Neuroimaging Initiative (ADNI). We calculate 325 edge features for every participant using pairwise Pearson correlations between the 26 DMN regions. Node metrics and graph metrics, such as degree, local clustering, betweenness centrality, average neighbour degree, show no significant difference between groups (31 AD patients vs. 40 healthy controls). To find out discriminating edges between pair of regions, we have implemented random forest method. To ensure no leakage of data occurred, we performed feature selection within each cross-validation (CV) fold, and we only used the absolute correlation values for the Mann-Whitney U test on the training data. We then used only the selected edges to train a Random Forest using Fisher Z-transformed values with a repeated stratified cross-validation. While none of the classic edge-wise statistical tests were significant, we achieved stable classification and consistently found a small set of informative edges when using this method. Most connection which are found consistently disrupted involved pathways between hippocampus area and temporal regions, connections includes posterior cingulate regions, anterior cingulate regions, and fronto parietal associations. The data demonstrates that disruptions in the function of the DMN have very specific localizations and would not be identified using node-level connections alone. This edge-based approach thus provides clearer insight and provides biologically plausible evidence of disruptions to the DMN in Alzheimer’s disease.
- 16 September 2026
- Published by Springer Nature in Scientific Reports
Open AccessEdge centric dysfunction of default mode network in Alzheimer’s disease using resting state fMRI
Disrupted connectivity of the Default Mode Network (DMN) is observed in Alzheimer’s disease as reported in previous literatures. rs-fMRI analyses relying on global or nodal level connectivity measures may overlook dissimilar edge-level dysconnectivity. We postulated that network level disruptions are better captured at edge-level, where aggregated graph metrics suppress the localized connectivity. In this study, we extract the BOLD time series data from 26 DMN regions defined by the AAL3 Atlas, from rs-fMRI data from Alzheimer’s Disease Neuroimaging Initiative (ADNI). We calculate 325 edge features for every participant using pairwise Pearson correlations between the 26 DMN regions. Node metrics and graph metrics, such as degree, local clustering, betweenness centrality, average neighbour degree, show no significant difference between groups (31 AD patients vs. 40 healthy controls). To find out discriminating edges between pair of regions, we have implemented random forest method. To ensure no leakage of data occurred, we performed feature selection within each cross-validation (CV) fold, and we only used the absolute correlation values for the Mann-Whitney U test on the training data. We then used only the selected edges to train a Random Forest using Fisher Z-transformed values with a repeated stratified cross-validation. While none of the classic edge-wise statistical tests were significant, we achieved stable classification and consistently found a small set of informative edges when using this method. Most connection which are found consistently disrupted involved pathways between hippocampus area and temporal regions, connections includes posterior cingulate regions, anterior cingulate regions, and fronto parietal associations. The data demonstrates that disruptions in the function of the DMN have very specific localizations and would not be identified using node-level connections alone. This edge-based approach thus provides clearer insight and provides biologically plausible evidence of disruptions to the DMN in Alzheimer’s disease.
- Open Access
- 24 August 2026
- Published by Springer Nature in Scientific Reports
A transport-theoretic freshness–reliability–delay framework for cooperative balloon-assisted UAV relay networks
- 24 August 2026
- Published by Springer Nature in Scientific Reports
Open AccessA transport-theoretic freshness–reliability–delay framework for cooperative balloon-assisted UAV relay networks
- Open Access
- 6 June 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Risk-sensitive mean-field control of large-scale UAV Swarms for stochastic disaster tracking and robust first response
This paper proposes a risk-sensitive mean field optimal control framework for large-scale multi-UAV disaster tracking, guidance, and first response operations in the presence of stochastic uncertainty and communication limitations. As opposed to existing heuristic, clustering approaches, and swarm-based optimization techniques, which are frequently risk neutral and based on deterministic propagation models, the new approach takes into account the stochastic nature of the disaster field, a risk-sensitive performance function of exponential form, and a modified Riccati recursion. Although the backward Riccati recursion is computed offline in a centralized fashion, the real-time computations become fully distributed, whereby each UAV calculates its own control gain using communication with its neighboring UAVs only. Computational complexity is decoupled from the cardinality of the swarm using a mean-field approximation. In addition, entropy-dual formulation guarantees distribution robustness, which takes into account the worst-case disturbance realizations within a bounded Kullback-Leibler divergence ball, irrespective of, and also complementary to, the distributed online computing structure in which each UAV only interacts with its nearest neighbors. Theoretical results on closed-loop Schur stability, risk-admissibility limits, convergence to a mean-field equilibrium, and consistency of distributed consensus algorithms have been rigorously proved and numerically verified. The simulations carried out on a wide range of urban obstacles have shown that the proposed algorithm performs better compared to other methods in terms of efficiency in coverage, mission time, energy consumption, connectivity preservation, path length, and robustness to increased variances in disturbances. The suggested framework is, to the best knowledge of the authors, the first integrated approach to the problem of risk-sensitive mean-field control, entropy-dual distributionally robust optimization, and communication-constrained distributed consensus in the context of disaster relief operations with UAVs.
- 6 June 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Open AccessRisk-sensitive mean-field control of large-scale UAV Swarms for stochastic disaster tracking and robust first response
This paper proposes a risk-sensitive mean field optimal control framework for large-scale multi-UAV disaster tracking, guidance, and first response operations in the presence of stochastic uncertainty and communication limitations. As opposed to existing heuristic, clustering approaches, and swarm-based optimization techniques, which are frequently risk neutral and based on deterministic propagation models, the new approach takes into account the stochastic nature of the disaster field, a risk-sensitive performance function of exponential form, and a modified Riccati recursion. Although the backward Riccati recursion is computed offline in a centralized fashion, the real-time computations become fully distributed, whereby each UAV calculates its own control gain using communication with its neighboring UAVs only. Computational complexity is decoupled from the cardinality of the swarm using a mean-field approximation. In addition, entropy-dual formulation guarantees distribution robustness, which takes into account the worst-case disturbance realizations within a bounded Kullback-Leibler divergence ball, irrespective of, and also complementary to, the distributed online computing structure in which each UAV only interacts with its nearest neighbors. Theoretical results on closed-loop Schur stability, risk-admissibility limits, convergence to a mean-field equilibrium, and consistency of distributed consensus algorithms have been rigorously proved and numerically verified. The simulations carried out on a wide range of urban obstacles have shown that the proposed algorithm performs better compared to other methods in terms of efficiency in coverage, mission time, energy consumption, connectivity preservation, path length, and robustness to increased variances in disturbances. The suggested framework is, to the best knowledge of the authors, the first integrated approach to the problem of risk-sensitive mean-field control, entropy-dual distributionally robust optimization, and communication-constrained distributed consensus in the context of disaster relief operations with UAVs.