Shaikh Arifuzzaman

Dr. Shaikh Arifuzzaman

Department of Computer Science, University of New Orleans, New Orleans, LA 70148, USA

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
30 June 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
NSNaw Safrin Sattar
Naw Safrin Sattar
SAShaikh Arifuzzaman
Shaikh Arifuzzaman
Social media, such as Twitter, is a source of exchanging information and opinion on global issues such as COVID-19 pandemic. In this study, we work with a database of around 1.2 million tweets collected across five weeks of April–May 2021 to draw conclusions about public sentiments towards the vaccination outlook when vaccinations become widely available to the population during the COVID-19 pandemic. We deploy natural language processing and sentiment analysis techniques to reveal insights about COVID-19 vaccination awareness among the public. Our results show that people have positive sentiments towards taking COVID-19 vaccines instead of some adverse effects of some of the vaccines. We also analyze people’s attitude towards the safety measures of COVID-19 after receiving the vaccines. Again, the positive sentiment is higher than that of negative in terms of maintaining safety measures against COVID-19 among the vaccinated population. We also project that around 62.44% and 48% of the US population will get at least one dose of vaccine and be fully vaccinated, respectively, by the end of July 2021 according to our forecast model. This study will help to understand public reaction and aid the policymakers to project the vaccination campaign as well as health and safety measures in the ongoing global health crisis.

22 January 2022 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
NSNaw Safrin Sattar
Naw Safrin Sattar
SAShaikh Arifuzzaman
Shaikh Arifuzzaman


5 November 2019
Verified
Book Chapter
Closed access
PDF file
JIJoseph Imseis
Joseph Imseis
CNCostain Nachuma
Costain Nachuma
SAShaikh Arifuzzaman
Shaikh Arifuzzaman
MZMinhaz Zibran
Minhaz Zibran
ZBZakirul Alam Bhuiyan
Zakirul Alam Bhuiyan

16 June 2017 in arXiv
Verified
Preprint
Open access
PDF file
SAShaikh Arifuzzaman
Shaikh Arifuzzaman
MKMaleq Khan
Maleq Khan
MMMadhav Marathe
Madhav Marathe
Big graphs (networks) arising in numerous application areas pose significant challenges for graph analysts as these graphs grow to billions of nodes and edges and are prohibitively large to fit in the main memory. Finding the number of triangles in a graph is an important problem in the mining and analysis of graphs. In this paper, we present two efficient MPI-based distributed memory parallel algorithms for counting triangles in big graphs. The first algorithm employs overlapping partitioning and efficient load balancing schemes to provide a very fast parallel algorithm. The algorithm scales well to networks with billions of nodes and can compute the exact number of triangles in a network with 10 billion edges in 16 minutes. The second algorithm divides the network into non-overlapping partitions leading to a space-efficient algorithm. Our results on both artificial and real-world networks demonstrate a significant space saving with this algorithm. We also present a novel approach that reduces communication cost drastically leading the algorithm to both a space- and runtime-efficient algorithm. Further, we demonstrate how our algorithms can be used to list all triangles in a graph and compute clustering coefficients of nodes. Our algorithm can also be adapted to a parallel approximation algorithm using an edge sparsification method.

5 November 2019
Verified
Book Chapter
Closed access
PDF file
JDJanak Dahal
Janak Dahal
EIElias Ioup
Elias Ioup
SAShaikh Arifuzzaman
Shaikh Arifuzzaman
MAMahdi Abdelguerfi
Mahdi Abdelguerfi