Shahid Ali
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
Shahid Ali has a total of 55 co-authors. Here are the top co-authors by number of shared publications:
Sachi Nandan Mohanty
School of Computer Science and Engineering, VIT-AP University, Amaravati, Andhra Pradesh, India
5 shared publications- Ganesh Reddy Karri
School of Computer Science and Engineering, VIT-AP university, Amaravati, India
4 shared publications Emad A. A. Ismail
Dept. of Quantitative Analysis, College of Business Administration, King Saud University, Riyadh, Saudi Arabia
3 shared publicationsFuad A. Awwad
Department of Quantitative Analysis, College of Business Administration, King Saud University, Riyadh, Saudi Arabia
3 shared publicationsMuhammad Ijaz Khan
Department of Mathematics and Statistics, Riphah International University, Islamabad, Pakistan
2 shared publications- Sudheer Mangalampalli
Department of Computer Science and Engineering, Manipal Institute of Technology Bengaluru, Manipal Academy of Higher Education, Manipal, Karnataka, India
2 shared publications
Latest Publications
- Open Access
- 26 August 2025
- Published by Institute of Central Computation and Knowledge Inc. in ICCK Journal of Applied Mathematics
- Vol. 1 (2) , 66-85
Modified Hiemenz Stagnation Point Flow of Second Grade Nano Fluid
Three-dimensional (3D) flow of a viscoelastic fluid in the neighborhood of new family of modified stagnation point depending on shear to strain ratio over a flat surface is numerically investigated. Similarity equations are obtained from the fundamental conservation laws of mass, momentum, energy and nanoparticle concentration. The resulting set of nonlinear equations are solved numerically using an implicit finite difference scheme known as Keller-Box Method. A comparative analysis for modified Hiemenz flow, non-axisymmetric stagnation point and axisymmetric stagnation point flow is carried out. Velocity, temperature and concentration profiles, skin frictions local Nusselt and Sherwood numbers are graphically presented and their variation with involved parameters is discussed in detail. It is found that the velocity, temperature and concentration profiles are all enhanced as the Weissenberg number $We$ increases, whereas the wall shear stresses $f''(0)$ and $g''(0)$, the local Nusselt number and the local Sherwood number are all reduced. For the axisymmetric Newtonian limit the computed wall shear stress $f''(0) = 1.31195$ recovers the classical Homann value, and the critical shear-to-strain ratio at which $g''(0)$ vanishes is found to be $\gamma_c = 1.1482$.- 26 August 2025
- Published by Institute of Central Computation and Knowledge Inc. in ICCK Journal of Applied Mathematics
- Vol. 1 (2) , 66-85
Open AccessModified Hiemenz Stagnation Point Flow of Second Grade Nano Fluid
Three-dimensional (3D) flow of a viscoelastic fluid in the neighborhood of new family of modified stagnation point depending on shear to strain ratio over a flat surface is numerically investigated. Similarity equations are obtained from the fundamental conservation laws of mass, momentum, energy and nanoparticle concentration. The resulting set of nonlinear equations are solved numerically using an implicit finite difference scheme known as Keller-Box Method. A comparative analysis for modified Hiemenz flow, non-axisymmetric stagnation point and axisymmetric stagnation point flow is carried out. Velocity, temperature and concentration profiles, skin frictions local Nusselt and Sherwood numbers are graphically presented and their variation with involved parameters is discussed in detail. It is found that the velocity, temperature and concentration profiles are all enhanced as the Weissenberg number $We$ increases, whereas the wall shear stresses $f''(0)$ and $g''(0)$, the local Nusselt number and the local Sherwood number are all reduced. For the axisymmetric Newtonian limit the computed wall shear stress $f''(0) = 1.31195$ recovers the classical Homann value, and the critical shear-to-strain ratio at which $g''(0)$ vanishes is found to be $\gamma_c = 1.1482$. - 1 December 2024
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 58 (6) , 735-743
Altitude-Based Dynamics Modulation and Power Analysis in LEO Satellites
Efficient signal modulation schemes are crucial for optimizing communication performance in low Earth orbit (LEO) satellite systems. Traditionally, uniform
- 1 December 2024
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 58 (6) , 735-743
Altitude-Based Dynamics Modulation and Power Analysis in LEO Satellites
Efficient signal modulation schemes are crucial for optimizing communication performance in low Earth orbit (LEO) satellite systems. Traditionally, uniform
- Open Access
- 17 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 136628-136656
Prioritized Task Offloading Mechanism in Cloud-Fog Computing Using Improved Asynchronous Advantage Actor Critic Algorithm
Task scheduling is a crucial aspect in cloud computing paradigm as tasks with different processing capacities arise from heterogeneous resources and scheduling these different tasks to precise virtual machines (VM) in cloud datacenters is a crucial job for the Cloud Service Provider (CSP) as it is an NP-hard problem. Ineffective scheduling of tasks in cloud paradigm leads to increase in execution time in turn it effects quality of service which is a huge challenge in cloud paradigm. Scheduling tasks to VMs in datacenters which are located at far distances also plays a major part in quality of service of CSP especially in the case of time sensitive tasks. Many of the earlier authors proposed task offloading mechanisms using metaheuristic techniques and machine learning approaches but still there is a chance to improve offloading process by prioritizing tasks based on their runtime capacities, sizes onto fog nodes and schedule them onto precise VMs while addressing important concerns in cloud/fog computing paradigm such as makespan, consumption of energy. In this research, we proposed a task offloading mechanism (PTOMCFIA3C) which considers priorities of tasks and based on the priorities induced into the scheduling offloading mechanism will decide whether to offload tasks to fog/cloud nodes. PTOMCFIA3C modeled using improved Asynchronous Advantage Actor Critic algorithm a deep reinforcement learning technique which is improved by inducing RCNN which can accelerate its learning capability and optimizes scheduling process by offloading tasks to Fog/cloud nodes. Extensive simulations are conducted using simpy by taking the real-time computing worklogs. Simulations conducted in two phases. In the first phase, parameters evaluated with fixed nodes while in second phase parameters evaluated with variable nodes. Proposed PTOMCFIA3C evaluated over existing baseline approaches RATS-HM, MOABCQ, FOG-AMOSM and our proposed task offloading mechanism PTOMCFIA3C generated optimized schedules while improving makespan by 81.09%, consumption of energy by 79.33% significantly over compared approaches.
- 17 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 136628-136656
Open AccessPrioritized Task Offloading Mechanism in Cloud-Fog Computing Using Improved Asynchronous Advantage Actor Critic Algorithm
Task scheduling is a crucial aspect in cloud computing paradigm as tasks with different processing capacities arise from heterogeneous resources and scheduling these different tasks to precise virtual machines (VM) in cloud datacenters is a crucial job for the Cloud Service Provider (CSP) as it is an NP-hard problem. Ineffective scheduling of tasks in cloud paradigm leads to increase in execution time in turn it effects quality of service which is a huge challenge in cloud paradigm. Scheduling tasks to VMs in datacenters which are located at far distances also plays a major part in quality of service of CSP especially in the case of time sensitive tasks. Many of the earlier authors proposed task offloading mechanisms using metaheuristic techniques and machine learning approaches but still there is a chance to improve offloading process by prioritizing tasks based on their runtime capacities, sizes onto fog nodes and schedule them onto precise VMs while addressing important concerns in cloud/fog computing paradigm such as makespan, consumption of energy. In this research, we proposed a task offloading mechanism (PTOMCFIA3C) which considers priorities of tasks and based on the priorities induced into the scheduling offloading mechanism will decide whether to offload tasks to fog/cloud nodes. PTOMCFIA3C modeled using improved Asynchronous Advantage Actor Critic algorithm a deep reinforcement learning technique which is improved by inducing RCNN which can accelerate its learning capability and optimizes scheduling process by offloading tasks to Fog/cloud nodes. Extensive simulations are conducted using simpy by taking the real-time computing worklogs. Simulations conducted in two phases. In the first phase, parameters evaluated with fixed nodes while in second phase parameters evaluated with variable nodes. Proposed PTOMCFIA3C evaluated over existing baseline approaches RATS-HM, MOABCQ, FOG-AMOSM and our proposed task offloading mechanism PTOMCFIA3C generated optimized schedules while improving makespan by 81.09%, consumption of energy by 79.33% significantly over compared approaches.
- Open Access
- 30 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 108897-108920
Efficient Hybrid DDPG Task Scheduler for HPC and HTC in Cloud Environment
Task Scheduling is a crucial challenge in cloud computing as diversified tasks come rapidly onto cloud console dynamically from heterogeneous resources which consists of different task lengths, processing capacities. Generating schedules for these type of tasks is a challenge for Cloud Service Provider(CSP).Therefore, to generate task schedules in cloud paradigm effectively by considering type of task arising to cloud console and match it with respective Virtual Machine (VM), a task scheduler is formulated by using Deep Deterministic Policy Gradient (DDPG) algorithm which is used as methodology to design scheduler. This scheduler works in three stages. In the initial stage, tasks are classified based on length and processing capacity to identify them whether they are High Performance Computing (HPC) tasks or High Throughput Computing (HTC) tasks. After classification, in the second stage, resources are to be tracked which matches the corresponding nature of tasks. Finally, in the third stage, according to the VM priorities calculated based on electricity unit cost and tasks are mapped according to the priorities to the corresponding VMs. Simulations are conducted using Cloudsim with fabricated workload distributions and realtime worklogs. Finally, our proposed Hybrid workload Deep Deterministic Policy Gradient Task scheduler(HDDPGTS) evaluated over DQN, A2C algorithms. From results, it proved that our proposed HDDPGTS significantly improved makespan, Energy consumption, scheduling overhead, scalability over baseline approaches.
- 30 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 108897-108920
Open AccessEfficient Hybrid DDPG Task Scheduler for HPC and HTC in Cloud Environment
Task Scheduling is a crucial challenge in cloud computing as diversified tasks come rapidly onto cloud console dynamically from heterogeneous resources which consists of different task lengths, processing capacities. Generating schedules for these type of tasks is a challenge for Cloud Service Provider(CSP).Therefore, to generate task schedules in cloud paradigm effectively by considering type of task arising to cloud console and match it with respective Virtual Machine (VM), a task scheduler is formulated by using Deep Deterministic Policy Gradient (DDPG) algorithm which is used as methodology to design scheduler. This scheduler works in three stages. In the initial stage, tasks are classified based on length and processing capacity to identify them whether they are High Performance Computing (HPC) tasks or High Throughput Computing (HTC) tasks. After classification, in the second stage, resources are to be tracked which matches the corresponding nature of tasks. Finally, in the third stage, according to the VM priorities calculated based on electricity unit cost and tasks are mapped according to the priorities to the corresponding VMs. Simulations are conducted using Cloudsim with fabricated workload distributions and realtime worklogs. Finally, our proposed Hybrid workload Deep Deterministic Policy Gradient Task scheduler(HDDPGTS) evaluated over DQN, A2C algorithms. From results, it proved that our proposed HDDPGTS significantly improved makespan, Energy consumption, scheduling overhead, scalability over baseline approaches.
- 9 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 13 (6) , 1690-1694
A New MIMO Scheme for Saving Power Consumption
In this letter, we introduce a novel transmission scheme to a multi-input multi-output (MIMO) system employing an M × M antenna structure. The conventional MIMO loads parallel signals onto all transmit antennas to realize essentially M separate channels to achieve high channel capacity. In contrast, the proposed method can dynamically activate a subset of the transmit antennas at each transmission while maintaining the same channel capacity as conventional MIMO. The dynamic activation of the transmit antennas offers a statistically similar advantage to spatial modulation, leading to a reduced number of active RF chains and power saving as well. The theoretical analysis is conducted through the proposed transformation matrix that operates from the signal source to the transmit signal. The effectiveness of this approach is investigated regarding capacity issues and antenna utilization, which are confirmed by simulation results.
- 9 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 13 (6) , 1690-1694
A New MIMO Scheme for Saving Power Consumption
In this letter, we introduce a novel transmission scheme to a multi-input multi-output (MIMO) system employing an M × M antenna structure. The conventional MIMO loads parallel signals onto all transmit antennas to realize essentially M separate channels to achieve high channel capacity. In contrast, the proposed method can dynamically activate a subset of the transmit antennas at each transmission while maintaining the same channel capacity as conventional MIMO. The dynamic activation of the transmit antennas offers a statistically similar advantage to spatial modulation, leading to a reduced number of active RF chains and power saving as well. The theoretical analysis is conducted through the proposed transformation matrix that operates from the signal source to the transmit signal. The effectiveness of this approach is investigated regarding capacity issues and antenna utilization, which are confirmed by simulation results.
- 28 February 2024
- Published by Springer Nature in Journal of Thermal Analysis and Calorimetry
- Vol. 149 (16) , 8911-8925
Impact of wall velocity ratios on mixed convection heat transfer in porous cavities with nanoliquids
- 28 February 2024
- Published by Springer Nature in Journal of Thermal Analysis and Calorimetry
- Vol. 149 (16) , 8911-8925
Impact of wall velocity ratios on mixed convection heat transfer in porous cavities with nanoliquids
- Open Access
- 29 January 2024
- Published by Elsevier in Results in Engineering
- Vol. 21
Analysis of peristalsis blood flow mechanism using non-newtonian fluid and variable liquid characteristics
- 29 January 2024
- Published by Elsevier in Results in Engineering
- Vol. 21
Open AccessAnalysis of peristalsis blood flow mechanism using non-newtonian fluid and variable liquid characteristics
- Open Access
- 17 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 11354-11377
Multi-Objective Prioritized Task Scheduler Using Improved Asynchronous Advantage Actor Critic (a3c) Algorithm in Multi Cloud Environment
Task scheduling is a crucial challenge in cloud computing paradigm as variety of tasks with different runtime processing capacities generated from various heterogeneous devices are coming up to cloud application console which effects system performance in terms of makespan, resource utilization, resource cost. Therefore, traditional scheduling algorithms may not adapt to this paradigm efficiently. Many existing authors developed various task schedulers by using metaheuristic approaches to solve Task scheduling problem(TSP) to get near optimal solutions but still TSP is a highly dynamic challenging scenario as it is a NP hard problem. To tackle this challenge, this paper introduces a multi objective prioritized task scheduler using improved asynchronous advantage actor critic(a3c) algorithm which uses priorities of tasks based on length of tasks, runtime processing capacities and priorities of VMs based on electricity unit cost using multi cloud environment. Scheduling process carried out in two stages. In the first stage, all incoming tasks, VM priorities are calculated at the task manager level and in the second stage, Priorities are fed to (MOPTSA3C) scheduler to generate scheduling decisions to map tasks effectively onto VMs by considering priorities and schedule tasks based on cost, resource utilization, makespan in the available multi cloud environment. Extensive simulations are conducted on Cloudsim toolkit by giving input trace different fabricated data distributions and real time worklogs of HPC2N, NASA datasets to the scheduler. For evaluating the efficacy of proposed MOPTSA3C, it compared against existing techniques i.e. DQN, A2C, MOABCQ. From the results, it is evident that proposed MOPTSA3C outperforms existing algorithms for makespan, resource utilization, resource cost, reliability.
- 17 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 11354-11377
Open AccessMulti-Objective Prioritized Task Scheduler Using Improved Asynchronous Advantage Actor Critic (a3c) Algorithm in Multi Cloud Environment
Task scheduling is a crucial challenge in cloud computing paradigm as variety of tasks with different runtime processing capacities generated from various heterogeneous devices are coming up to cloud application console which effects system performance in terms of makespan, resource utilization, resource cost. Therefore, traditional scheduling algorithms may not adapt to this paradigm efficiently. Many existing authors developed various task schedulers by using metaheuristic approaches to solve Task scheduling problem(TSP) to get near optimal solutions but still TSP is a highly dynamic challenging scenario as it is a NP hard problem. To tackle this challenge, this paper introduces a multi objective prioritized task scheduler using improved asynchronous advantage actor critic(a3c) algorithm which uses priorities of tasks based on length of tasks, runtime processing capacities and priorities of VMs based on electricity unit cost using multi cloud environment. Scheduling process carried out in two stages. In the first stage, all incoming tasks, VM priorities are calculated at the task manager level and in the second stage, Priorities are fed to (MOPTSA3C) scheduler to generate scheduling decisions to map tasks effectively onto VMs by considering priorities and schedule tasks based on cost, resource utilization, makespan in the available multi cloud environment. Extensive simulations are conducted on Cloudsim toolkit by giving input trace different fabricated data distributions and real time worklogs of HPC2N, NASA datasets to the scheduler. For evaluating the efficacy of proposed MOPTSA3C, it compared against existing techniques i.e. DQN, A2C, MOABCQ. From the results, it is evident that proposed MOPTSA3C outperforms existing algorithms for makespan, resource utilization, resource cost, reliability.
- Open Access
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 136541-136551
Performance Analysis of Cycle GAN in Photo to Portrait Transfiguration Using Deep Learning Optimizers
In the realm of computer vision, image transformations play a pivotal role across various domains such as healthcare, image enhancement, artist painting identification, genome sequencing, and more. While supervised learning demands a substantial volume of annotated images for training models, Cycle-GAN emerges as a potent solution for training models with fewer paired sources and target images in an unsupervised manner. This study introduces a novel system aimed at generating Monet-style paintings from realistic images, leveraging the Cycle-GAN methodology. Given the scarcity of Monet paintings, our system employs a combination of generator and discriminator neural networks to produce new Monet-style artworks. The model is trained using Cycle-GAN in conjunction with deep learning optimizers like RMSprop, ADAM, and SGD. The training dataset, Monet2Photo, comprises two distinct image categories: Monet paintings (300 samples) and natural photographs (7028 samples). The Monet-style images are utilized for training the model, while the raw photo images serve as the test set. Notably, the proposed model exhibits commendable performance, particularly when utilizing the SGD optimizer, as evidenced by favorable outcomes in terms of generator and discriminator losses.
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 136541-136551
Open AccessPerformance Analysis of Cycle GAN in Photo to Portrait Transfiguration Using Deep Learning Optimizers
In the realm of computer vision, image transformations play a pivotal role across various domains such as healthcare, image enhancement, artist painting identification, genome sequencing, and more. While supervised learning demands a substantial volume of annotated images for training models, Cycle-GAN emerges as a potent solution for training models with fewer paired sources and target images in an unsupervised manner. This study introduces a novel system aimed at generating Monet-style paintings from realistic images, leveraging the Cycle-GAN methodology. Given the scarcity of Monet paintings, our system employs a combination of generator and discriminator neural networks to produce new Monet-style artworks. The model is trained using Cycle-GAN in conjunction with deep learning optimizers like RMSprop, ADAM, and SGD. The training dataset, Monet2Photo, comprises two distinct image categories: Monet paintings (300 samples) and natural photographs (7028 samples). The Monet-style images are utilized for training the model, while the raw photo images serve as the test set. Notably, the proposed model exhibits commendable performance, particularly when utilizing the SGD optimizer, as evidenced by favorable outcomes in terms of generator and discriminator losses.
- Open Access
- 27 November 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-20
An efficient framework for obtaining the initial cluster centers
Clustering is an important tool for data mining since it can determine key patterns without any prior supervisory information. The initial selection of cluster centers plays a key role in the ultimate effect of clustering. More often researchers adopt the random approach for this purpose in an urge to get the centers in no time for speeding up their model. However, by doing this they sacrifice the true essence of subgroup formation and in numerous occasions ends up in achieving malicious clustering. Due to this reason we were inclined towards suggesting a qualitative approach for obtaining the initial cluster centers and also focused on attaining the well-separated clusters. Our initial contributions were an alteration to the classical K-Means algorithm in an attempt to obtain the near-optimal cluster centers. Few fresh approaches were earlier suggested by us namely, far efficient K-means (FEKM), modified center K-means (MCKM) and modified FEKM using Quickhull (MFQ) which resulted in producing the factual centers leading to excellent clusters formation. K-means, which randomly selects the centers, seem to meet its convergence slightly earlier than these methods, which is the latter’s only weakness. An incessant study was continued in this regard to minimize the computational efficiency of our methods and we came up with farthest leap center selection (FLCS). All these methods were thoroughly analyzed by considering the clustering effectiveness, correctness, homogeneity, completeness, complexity and their actual execution time of convergence. For this reason performance indices like Dunn’s Index, Davies–Bouldin’s Index, and silhouette coefficient were used, for correctness Rand measure was used, for homogeneity and completeness V-measure was used. Experimental results on versatile real world datasets, taken from UCI repository, suggested that both FEKM and FLCS obtain well-separated centers while the later converges earlier.
- 27 November 2023
- Published by Springer Nature in Scientific Reports
- Vol. 13 (1) , 1-20
Open AccessAn efficient framework for obtaining the initial cluster centers
Clustering is an important tool for data mining since it can determine key patterns without any prior supervisory information. The initial selection of cluster centers plays a key role in the ultimate effect of clustering. More often researchers adopt the random approach for this purpose in an urge to get the centers in no time for speeding up their model. However, by doing this they sacrifice the true essence of subgroup formation and in numerous occasions ends up in achieving malicious clustering. Due to this reason we were inclined towards suggesting a qualitative approach for obtaining the initial cluster centers and also focused on attaining the well-separated clusters. Our initial contributions were an alteration to the classical K-Means algorithm in an attempt to obtain the near-optimal cluster centers. Few fresh approaches were earlier suggested by us namely, far efficient K-means (FEKM), modified center K-means (MCKM) and modified FEKM using Quickhull (MFQ) which resulted in producing the factual centers leading to excellent clusters formation. K-means, which randomly selects the centers, seem to meet its convergence slightly earlier than these methods, which is the latter’s only weakness. An incessant study was continued in this regard to minimize the computational efficiency of our methods and we came up with farthest leap center selection (FLCS). All these methods were thoroughly analyzed by considering the clustering effectiveness, correctness, homogeneity, completeness, complexity and their actual execution time of convergence. For this reason performance indices like Dunn’s Index, Davies–Bouldin’s Index, and silhouette coefficient were used, for correctness Rand measure was used, for homogeneity and completeness V-measure was used. Experimental results on versatile real world datasets, taken from UCI repository, suggested that both FEKM and FLCS obtain well-separated centers while the later converges earlier.