Salabat Khan

Salabat Khan

Auto-generated profile, based on publicly available information

Salabat Khan

National University of Computer and Emerging Sciences

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
1 December 2009
Verified
Conference Paper
Closed access
SKSalabat Khan
Salabat Khan
MBMohsin Bilal
Mohsin Bilal
MSM. Sharif
M. Sharif
MSMalik Sajid
Malik Sajid
RBRauf Baig
Rauf Baig
In this paper, a solution is proposed for n-Queen problem based on ACO (ant colony optimization). The n-Queen problem become intractable for large values of `n' and thus placed in NP (non-deterministic polynomial) class problem. The n-Queen problem is basically a generalized form of 8-Queen problem. In 8-Queen problem, the goal is to place 8 queens such that no queen can kill the other using standard chess queen moves. So, in this paper, the proposed solution will be applied to 8-Queen problem. The solution can very easily be extended to the generalized form of the problem for large values of `n'. The paper contains the detail discussion of problem background, problem complexity, ant colony optimization (swarm intelligence) and a fair amount of experimental graphs.

18 October 2023 in IEEE Access
Verified
Journal Article
Open access
RXRongxu Xu
Rongxu Xu
CPChan-Won Park
Chan-Won Park
SKSalabat Khan
Salabat Khan
WJWenquan Jin
Wenquan Jin
SMSa Jim Soe Moe
Sa Jim Soe Moe
DKDo Hyun Kim
Do Hyun Kim
In this paper, we address the challenge of limited resources in Internet of Things (IoT) devices by proposing a solution based on digital twin in distributed edge computing networks. Edge computing is a promising approach that moves computing resources closer to the network’s edge to reduce response times in IoT applications. However, simply offloading tasks from IoT devices to edge computing does not accelerate user control. To enhance task performance and improve user management experience, we introduce optimized task scheduling and virtual object management based on a digital twin concept. Our system incorporates virtualization, synchronization, visualization, and simulation functionalities to provide digital twin capabilities. Additionally, we develop a user-friendly web application with a graphical user interface (GUI) for intuitive management of edge computing services. To support our approach, we implement an edge computing supervisor that generates virtualized objects such as edge gateways, IoT devices, and services. These virtual objects serve as resources for creating tasks. Using our proposed digital twin platform, users can dynamically create new tasks based on demand, easily deploy and execute tasks in specific locations, and dynamically allocate edge network resources according to task requirements. An optimized task scheduling mathematical model is presented to compare task scheduling done with and without optimization. Further, the edge computing and digital twin based optimized task scheduling method is integrated with Federated Learning for collaborative learning and privacy preserved computation of sensors sensitive data. We demonstrate the effectiveness of our system by generating tasks for data collection related to indoor environment for prediction of Predicted Mean Vote (PMV) for thermal comfort index of smart homes occupants using HTTP and IoTivity-based devices in distributed edge computing networks. These tasks are properly delivered and executed on the expected edge gateways, showcasing the successful integration of our digital twin platform with edge computing networks. Further, the optimized task scheduling has improved the overall performance of the proposed system, keeping in view latency and processing time.

1 January 2012
Verified
Conference Paper
Closed access
MHM. Hussain
M. Hussain
SKS. Khan
S. Khan
GMGhulam Muhammad
Ghulam Muhammad
MBM. Berbar
M. Berbar
GBG. Bebis
G. Bebis

1 November 2012
Verified
Conference Paper
Closed access
MHMuhammad Hussain
Muhammad Hussain
SKSalabat Khan
Salabat Khan
GMGhulam Muhammad
Ghulam Muhammad
GBGeorge Bebis
George Bebis
Masses are among the early signs of breast cancer, which is the second major cause of death in women. For mass detection, a mammogram is segmented into regions of interest (ROIs) that contain masses as well as suspicious normal tissues, which lead to false positives. The problem is to reduce the false positives by classifying ROIs as masses and normal tissues. Further, the detected masses are needed to be discriminated as benign and malignant. We investigate the performance of six different Gabor feature extraction approaches for these mass classification problems. These techniques employ Gabor filter banks for extracting multiscale and multiorientation texture features which represent structural properties of masses and normal dense tissues in mammograms. The feature extraction approaches are evaluated over the ROIs extracted from MIAS database. Successive Enhancement Learning based weighted Support Vector Machine (SELwSVM) is used to efficiently classify the generated unbalanced datasets. The best performance in terms of area under ROC curve (Az = 1.0) is obtained by the Gabor features extracted using first order statistics of the Gabor responses and LDA.

1 January 2010
Verified
Conference Paper
Closed access
SKSalabat Khan
Salabat Khan
WSWaseem Shahzad
Waseem Shahzad
FKFarrukh Aslam Khan
Farrukh Aslam Khan
It is hard for the cryptanalysts to apply traditional techniques and brute-force attacks against feistel ciphers due to their inherent structure based on high nonlinearity and low autocorrelation. In this paper, we propose a technique for the cryptanalysis of four-rounded Data Encryption Standard (DES) based on Binary Ant Colony Optimization (BACO). A known-plaintext attack is used to recover the secret key of the DES cipher. The environment for the ants is a directed graph, which we call search space, is constructed for efficiently searching the secret key. We also develop a heuristic function which measures the quality of a constructed solution. Several optimum keys are computed over different runs on the basis of routes completed by the ants. These optimum keys are then used to find each individual bit of the 56 bit secret key used by DES. The results of our experiments show that ACO is an effective technique for the cryptanalysis of four-rounded DES. To the best of our knowledge, this is the first time that BACO has been used for this specific problem.

28 August 2017 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
MDMehr Yahya Durrani
Mehr Yahya Durrani
SKSalabat Khan
Salabat Khan
SKShehzad Khalid
Shehzad Khalid