Sharfuddin Mahmood
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sharfuddin Mahmood has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Dip Nandi
Department of Computer Science, American International University-Bangladesh (AIUB), Dhaka, Bangladesh
3 shared publications - Kazi Redwan
Department of Computer Science American International University-Bangladesh Dhaka 22-46069- Bangladesh
2 shared publications - A. K. M. Emran
Washington University of Science and Technology (WUST)
1 shared publication - Amina Tasnim Oishe
American International University – Bangladesh
1 shared publication - Hasan Mahmud
American International University – Bangladesh
1 shared publication - James Harland
RMIT University
1 shared publication
Latest Publications
- 6 October 2026
- Published by Springer Nature
- p. 36-45
Deep Convolutional Neural Networks for Precision Agriculture: Automated Pomegranate Disease Classification
- 6 October 2026
- Published by Springer Nature
- p. 36-45
Deep Convolutional Neural Networks for Precision Agriculture: Automated Pomegranate Disease Classification
- 1 April 2026
- Published by Springer Nature
- p. 463-477
Bidirectional GRU-Enhanced Deep Learning Framework for Reliable Classification of False Narratives
- 1 April 2026
- Published by Springer Nature
- p. 463-477
Bidirectional GRU-Enhanced Deep Learning Framework for Reliable Classification of False Narratives
- Open Access
- 4 May 2025
- Published by Wiley in Plant Direct
- Vol. 9 (5) , e70076
InsightNet: A Deep Learning Framework for Enhanced Plant Disease Detection and Explainable Insights
Sustainable agriculture holds the key in meeting food production requirements for a rapidly growing population without exacerbating environmental degradation. Plant leaf diseases pose a critical threat to crop yield and quality. Existing inspection methods are labor‐intensive and prone to human errors, while lacking support for large‐scale agriculture. This research aims to enhance plant health by developing advanced deep learning models for the detection and classification of plant diseases across a variety of species. A deep learning model based on the paradigm of the MobileNet architecture is proposed, which employs a dedicated design through deeper convolutional layers, dropout regularization, and fully connected layers. This results in significant improvements in disease classification in tomato, bean, and chili plants, with accuracy rates of 97.90%, 98.12%, and 97.95%, respectively. Moreover, Grad‐CAM is used to shed light on the decision‐making process of the proposed model. The work contributes to the advancement of precision farming and sustainable agricultural practices, supporting timely and accurate plant disease diagnosis.
- 4 May 2025
- Published by Wiley in Plant Direct
- Vol. 9 (5) , e70076
Open AccessInsightNet: A Deep Learning Framework for Enhanced Plant Disease Detection and Explainable Insights
Sustainable agriculture holds the key in meeting food production requirements for a rapidly growing population without exacerbating environmental degradation. Plant leaf diseases pose a critical threat to crop yield and quality. Existing inspection methods are labor‐intensive and prone to human errors, while lacking support for large‐scale agriculture. This research aims to enhance plant health by developing advanced deep learning models for the detection and classification of plant diseases across a variety of species. A deep learning model based on the paradigm of the MobileNet architecture is proposed, which employs a dedicated design through deeper convolutional layers, dropout regularization, and fully connected layers. This results in significant improvements in disease classification in tomato, bean, and chili plants, with accuracy rates of 97.90%, 98.12%, and 97.95%, respectively. Moreover, Grad‐CAM is used to shed light on the decision‐making process of the proposed model. The work contributes to the advancement of precision farming and sustainable agricultural practices, supporting timely and accurate plant disease diagnosis.
- 1 January 2025
- Published by Springer Nature
- p. 46-60
Enhancing Candidate Selection with NLP-Driven Resume Analysis for Industry 4.0 Recruitment Systems
- 1 January 2025
- Published by Springer Nature
- p. 46-60
Enhancing Candidate Selection with NLP-Driven Resume Analysis for Industry 4.0 Recruitment Systems
- Top Cited PapersOpen Access
- 8 August 2023
- Published by MECS Publisher in International Journal of Mathematical Sciences and Computing
- Vol. 9 (3) , 46-57
Blockchain: A Comparative Study of Consensus Algorithms PoW, PoS, PoA, PoV
Since the inception of Blockchain, the computer database has been evolving into innovative technologies. Recent technologies emerge, the use of Blockchain is also flourishing. All the technologies from Blockchain use a mutual algorithm to operate. The consensus algorithm is the process that assures mutual agreements and stores information in the decentralized database of the network. Blockchain's biggest drawback is the exposure to scalability. However, using the correct consensus for the relevant work can ensure efficiency in data storage, transaction finality, and data integrity. In this paper, a comparison study has been made among the following consensus algorithms: Proof of Work (PoW), Proof of Stake (PoS), Proof of Authority (PoA), and Proof of Vote (PoV). This study aims to provide readers with elementary knowledge about blockchain, more specifically its consensus protocols. It covers their origins, how they operate, and their strengths and weaknesses. We have made a significant study of these consensus protocols and uncovered some of their advantages and disadvantages in relation to characteristics details such as security, energy efficiency, scalability, and IoT (Internet of Things) compatibility. This information will assist future researchers to understand the characteristics of our selected consensus algorithms.
- 8 August 2023
- Published by MECS Publisher in International Journal of Mathematical Sciences and Computing
- Vol. 9 (3) , 46-57
Top Cited PapersOpen AccessBlockchain: A Comparative Study of Consensus Algorithms PoW, PoS, PoA, PoV
Since the inception of Blockchain, the computer database has been evolving into innovative technologies. Recent technologies emerge, the use of Blockchain is also flourishing. All the technologies from Blockchain use a mutual algorithm to operate. The consensus algorithm is the process that assures mutual agreements and stores information in the decentralized database of the network. Blockchain's biggest drawback is the exposure to scalability. However, using the correct consensus for the relevant work can ensure efficiency in data storage, transaction finality, and data integrity. In this paper, a comparison study has been made among the following consensus algorithms: Proof of Work (PoW), Proof of Stake (PoS), Proof of Authority (PoA), and Proof of Vote (PoV). This study aims to provide readers with elementary knowledge about blockchain, more specifically its consensus protocols. It covers their origins, how they operate, and their strengths and weaknesses. We have made a significant study of these consensus protocols and uncovered some of their advantages and disadvantages in relation to characteristics details such as security, energy efficiency, scalability, and IoT (Internet of Things) compatibility. This information will assist future researchers to understand the characteristics of our selected consensus algorithms.
- Open Access
- 8 April 2016
- Published by MECS Publisher in International Journal of Modern Education and Computer Science
- Vol. 8 (4) , 33-45
Test Case Prioritization based on Fault Dependency
Software testers should prioritize test cases so that important ones are run earlier in the regression testing process to reduce the cost of regression testing. Test case prioritization techniques schedule test cases for execution in an order that improves the performance of regression testing. One of the performance goals i.e. the fault detection rate, measures how quickly faults are detected during the testing process. Improved rate of fault dependency detection can provide faster feedback on software and let developers debug the leading faults at first that cause other faults to appear later. Another performance goal i.e. severity detection rate among faults, measures how quickly more severe faults are detected earlier during testing process. Previous studies addressed the second goal, but did not consider dependency among faults. In this paper an algorithm is proposed to prioritize test cases based on rate of severity detection associated with dependent faults. The aim is to detect more severe leading faults earlier with least amount of execution time and to identify the effectiveness of prioritized test case.
- 8 April 2016
- Published by MECS Publisher in International Journal of Modern Education and Computer Science
- Vol. 8 (4) , 33-45
Open AccessTest Case Prioritization based on Fault Dependency
Software testers should prioritize test cases so that important ones are run earlier in the regression testing process to reduce the cost of regression testing. Test case prioritization techniques schedule test cases for execution in an order that improves the performance of regression testing. One of the performance goals i.e. the fault detection rate, measures how quickly faults are detected during the testing process. Improved rate of fault dependency detection can provide faster feedback on software and let developers debug the leading faults at first that cause other faults to appear later. Another performance goal i.e. severity detection rate among faults, measures how quickly more severe faults are detected earlier during testing process. Previous studies addressed the second goal, but did not consider dependency among faults. In this paper an algorithm is proposed to prioritize test cases based on rate of severity detection associated with dependent faults. The aim is to detect more severe leading faults earlier with least amount of execution time and to identify the effectiveness of prioritized test case.
- Open Access
- 8 August 2015
- Published by MECS Publisher in International Journal of Modern Education and Computer Science
- Vol. 7 (8) , 25-37
Investigation of Participation and Quality of Online Interaction
Advances in computer mediated communication technologies have sparked and continue to facilitate the proliferation of online courses, degree programs, and educational institutions. Leading the way with these advances has been the use of asynchronous discussion forums. However merely setting up a discussion forum does not always ensure quality participation and interaction. The way the course is managed has an impact on the participation as well. This paper compares the difference in course management over four study periods and discusses the resulting consequences on the participation and achievement of the students. This paper also investigates the quality of interaction as perceived by fully online students. The main benefits of this research are that it provides a guideline regarding what course management factors can make the difference in online participation in fully online courses, and how the quality of interaction can be designed.
- 8 August 2015
- Published by MECS Publisher in International Journal of Modern Education and Computer Science
- Vol. 7 (8) , 25-37
Open AccessInvestigation of Participation and Quality of Online Interaction
Advances in computer mediated communication technologies have sparked and continue to facilitate the proliferation of online courses, degree programs, and educational institutions. Leading the way with these advances has been the use of asynchronous discussion forums. However merely setting up a discussion forum does not always ensure quality participation and interaction. The way the course is managed has an impact on the participation as well. This paper compares the difference in course management over four study periods and discusses the resulting consequences on the participation and achievement of the students. This paper also investigates the quality of interaction as perceived by fully online students. The main benefits of this research are that it provides a guideline regarding what course management factors can make the difference in online participation in fully online courses, and how the quality of interaction can be designed.
- Open Access
- 8 June 2015
- Published by MECS Publisher in International Journal of Modern Education and Computer Science
- Vol. 7 (6) , 37-42
A Proposed Modification of K-Means Algorithm
K-means algorithm is one of the most popular algorithms for data clustering. With this algorithm, data of similar types are tried to be clustered together from a large data set with brute force strategy which is done by repeated calculations. As a result, the computational complexity of this algorithm is very high. Several researches have been carried out to minimize this complexity. This paper presents the result of our research, which proposes a modified version of k-means algorithm with an improved technique to divide the data set into specific numbers of clusters with the help of several check point values. It requires less computation and has enhanced accuracy than the traditional k-means algorithm as well as some modified variant of the traditional k-Means.
- 8 June 2015
- Published by MECS Publisher in International Journal of Modern Education and Computer Science
- Vol. 7 (6) , 37-42
Open AccessA Proposed Modification of K-Means Algorithm
K-means algorithm is one of the most popular algorithms for data clustering. With this algorithm, data of similar types are tried to be clustered together from a large data set with brute force strategy which is done by repeated calculations. As a result, the computational complexity of this algorithm is very high. Several researches have been carried out to minimize this complexity. This paper presents the result of our research, which proposes a modified version of k-means algorithm with an improved technique to divide the data set into specific numbers of clusters with the help of several check point values. It requires less computation and has enhanced accuracy than the traditional k-means algorithm as well as some modified variant of the traditional k-Means.