Mirza Mohammad Sufyan Beg

Prof. Dr. Mirza Mohammad Sufyan Beg


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
12 July 2018 in Entropy
Verified
Journal Article
Open access
PDF file
EAEesa Alsolami
Eesa Alsolami
MAMusheer Ahmad
Musheer Ahmad
Christos VolosChristos Volos
Christos Volos
MDMohammad Najam Doja
Mohammad Najam Doja
MBMirza Mohammad Sufyan Beg
Mirza Mohammad Sufyan Beg
In this paper, we present a novel method to construct cryptographically strong bijective substitution-boxes based on the complicated dynamics of a new hyperchaotic system. The new hyperchaotic system was found to have good characteristics when compared with other systems utilized for S-box construction. The performance assessment of the proposed S-box method was carried out based on criteria, such as high nonlinearity, a good avalanche effect, bit-independent criteria, and low differential uniformity. The proposed method was also analyzed for the batch-generation of 8 × 8 S-boxes. The analyses found that through a proposed purely chaos-based method, an 8 × 8 S-box with a maximum average high nonlinearity of 108.5, or S-boxes with differential uniformity as low as 8, can be retrieved. Moreover, small-sized S-boxes with high nonlinearity and low differential uniformity are also obtainable. A performance comparison of the anticipated method with recent S-box proposals proved its dominance and effectiveness for a strong bijective S-box construction.

Verified
Journal Article
Open access
PDF file
MHMD HUSSAIN
MD HUSSAIN
MBMirza Mohammad Sufyan Beg
Mirza Mohammad Sufyan Beg
The fast-paced development of power systems necessitates the smart grid (SG) to facilitate real-time control and monitoring with bidirectional communication and electricity flows. In order to meet the computational requirements for SG applications, cloud computing (CC) provides flexible resources and services shared in network, parallel processing, and omnipresent access. Even though CC model is considered to be efficient for SG, it fails to guarantee the Quality-of-Experience (QoE) requirements for the SG services, viz. latency, bandwidth, energy consumption, and network cost. Fog Computing (FC) extends CC by deploying localized computing and processing facilities into the edge of the network, offering location-awareness, low latency, and latency-sensitive analytics for mission critical requirements of SG applications. By deploying localized computing facilities at the premise of users, it pre-stores the cloud data and distributes to SG users with fast-rate local connections. In this paper, we first examine the current state of cloud based SG architectures and highlight the motivation(s) for adopting FC as a technology enabler for real-time SG analytics. We also present a three layer FC-based SG architecture, characterizing its features towards integrating massive number of Internet of Things (IoT) devices into future SG. We then propose a cost optimization model for FC that jointly investigates data consumer association, workload distribution, virtual machine placement and Quality-of-Service (QoS) constraints. The formulated model is a Mixed-Integer Nonlinear Programming (MINLP) problem which is solved using Modified Differential Evolution (MDE) algorithm. We evaluate the proposed framework on real world parameters and show that for a network with approximately 50% time critical applications, the overall service latency for FC is nearly half to that of cloud paradigm. We also observed that the FC lowers the aggregated power consumption of the generic CC model by more than 44%.

17 January 2023 in SN Computer Science
Verified
Journal Article
Closed access
PDF file
BSBushra Siddique
Bushra Siddique
MBMirza Mohammad Sufyan Beg
Mirza Mohammad Sufyan Beg


1 January 2020 in Journal of Interdisciplinary Mathematics
Verified
Journal Article
Closed access
NANadeem Akhtar
Nadeem Akhtar
MBMirza Mohammad Sufyan Beg
Mirza Mohammad Sufyan Beg
MHMuzakkir Hussain
Muzakkir Hussain
Extractive multi-document summarization methods based on topic models find relevant general concepts or topics that are most representative of the documents. These topics are used for sentence ranking and selection. In this paper, a two level topic model using spike and slab prior is proposed that identify better general topics for summarization. Spike and slab prior is used earlier for finding aspect specific topics. Proposed two level model uses spike and slab prior to achieve better general topics at high level of topic hierarchy. Experiments conducted on DUC2007 dataset show that proposed model is able to identify more summary oriented general words and improve ROUGE score.

1 January 2015 in Procedia Computer Science
Verified
Journal Article
Open access
ARAbdul Rahman
Abdul Rahman
TATanvir Ahmad
Tanvir Ahmad
MBMirza Mohammad Sufyan Beg
Mirza Mohammad Sufyan Beg
In perception based imaging, Sketching With Words (SWW) is a well-established methodology in which the objects of computation are fuzzy geometric objects (f-objects).The problem of facial imaging of criminal on the basis of onlooker statement is not lack of method and measures but the modeling of onlooker(s) mind set. Because the onlooker has to give statements about different human face parts like forehead, eyes, nose, and chin etc.The concept of fuzzy similarity (f-similarity) and proper aggregation of components of face may provide more flexibility to onlooker(s). In proposed work onlooker(s) statement is recorded. Thereafter it is compared with existing statements. The f-similarity with different faces in database is estimated by using ‘as many as possible’ linguistic quantifier. Three types of constraints over size of parts of face ‘small’, ‘medium’, and ‘large’ are considered. Possibilistic constraints with linguistic hedges and negation operator like ‘very long’, ‘not long’, ‘not very long’ etc. are used. Moreover we have generated ranking of alike faces in decreasing order by using the concepts of f-similarity and relevance matrix.