Sudhir Kumar Mohapatra

Prof. Sudhir Kumar Mohapatra

Faculty of Emerging Technologies, Sri Sri University, Cuttack, India
orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
6 February 2022 in Sensors
Verified
Journal Article
Open access
PDF file
PBPRASANTA KUMAR BAL
PRASANTA KUMAR BAL
Sudhir Kumar MohapatraSudhir Kumar Mohapatra
Sudhir Kumar Mohapatra
TDTapan Kumar Das
Tapan Kumar Das
KSKathiravan Srinivasan
Kathiravan Srinivasan
Yuh-Chung HuYuh-Chung Hu
Yuh-Chung Hu
The rapid growth of cloud computing environment with many clients ranging from personal users to big corporate or business houses has become a challenge for cloud organizations to handle the massive volume of data and various resources in the cloud. Inefficient management of resources can degrade the performance of cloud computing. Therefore, resources must be evenly allocated to different stakeholders without compromising the organization’s profit as well as users’ satisfaction. A customer’s request cannot be withheld indefinitely just because the fundamental resources are not free on the board. In this paper, a combined resource allocation security with efficient task scheduling in cloud computing using a hybrid machine learning (RATS-HM) technique is proposed to overcome those problems. The proposed RATS-HM techniques are given as follows: First, an improved cat swarm optimization algorithm-based short scheduler for task scheduling (ICS-TS) minimizes the make-span time and maximizes throughput. Second, a group optimization-based deep neural network (GO-DNN) for efficient resource allocation using different design constraints includes bandwidth and resource load. Third, a lightweight authentication scheme, i.e., NSUPREME is proposed for data encryption to provide security to data storage. Finally, the proposed RATS-HM technique is simulated with a different simulation setup, and the results are compared with state-of-art techniques to prove the effectiveness. The results regarding resource utilization, energy consumption, response time, etc., show that the proposed technique is superior to the existing one.

14 November 2022 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
NSNatnael Tilahun Sinshaw
Natnael Tilahun Sinshaw
BABeakal Gizachew Assefa
Beakal Gizachew Assefa
Sudhir Kumar MohapatraSudhir Kumar Mohapatra
Sudhir Kumar Mohapatra
ABAsrat Mulatu Beyene
Asrat Mulatu Beyene
In most developing countries, the contribution of agriculture to gross domestic product is significant. Plant disease is one of the major factors that adversely affect crop yield. Traditional plant disease detection techniques are time-consuming, biased, and ineffective. Potato is among the top consumed plants in the world, in general, and in developing countries, in particular. However, potato is affected by different kinds of diseases which minimize their yield and quantity. The advancement in AI and machine learning has paved the way for new methods of tackling plant disease detection. This study presents a comprehensive systematic literature review on the major diseases that harm potato crops. In this effort, computer vision-based techniques are employed to identify potato diseases, and types of machine learning algorithms used are surveyed. In this review, 39 primary studies that have provided useful information about the research questions are chosen. Accordingly, the most common potato diseases are found to be late blight, early blight, and bacterial wilt. Furthermore, the review discovered that deep learning algorithms were more frequently used to detect crop diseases than classical machine learning algorithms. Finally, the review categorized the state-of-the-art algorithms and identifies open research problems in the area.

15 September 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Sudhir Kumar MohapatraSudhir Kumar Mohapatra
Sudhir Kumar Mohapatra
SPSrinivas Prasad
Srinivas Prasad
DBDwiti Krishna Bebarta
Dwiti Krishna Bebarta
TDTapan Kumar Das
Tapan Kumar Das
KSKathiravan Srinivasan
Kathiravan Srinivasan
Yuh-Chung HuYuh-Chung Hu
Yuh-Chung Hu
Hate speech on social media may spread quickly through online users and subsequently, may even escalate into local vile violence and heinous crimes. This paper proposes a hate speech detection model by means of machine learning and text mining feature extraction techniques. In this study, the authors collected the hate speech of English-Odia code mixed data from a Facebook public page and manually organized them into three classes. In order to build binary and ternary datasets, the data are further converted into binary classes. The modeling of hate speech employs the combination of a machine learning algorithm and features extraction. Support vector machine (SVM), naïve Bayes (NB) and random forest (RF) models were trained using the whole dataset, with the extracted feature based on word unigram, bigram, trigram, combined n-grams, term frequency-inverse document frequency (TF-IDF), combined n-grams weighted by TF-IDF and word2vec for both the datasets. Using the two datasets, we developed two kinds of models with each feature—binary models and ternary models. The models based on SVM with word2vec achieved better performance than the NB and RF models for both the binary and ternary categories. The result reveals that the ternary models achieved less confusion between hate and non-hate speech than the binary models.

20 August 2020 in Journal of The Institution of Engineers (India): Series B
Verified
Journal Article
Closed access
PDF file
Sudhir Kumar MohapatraSudhir Kumar Mohapatra
Sudhir Kumar Mohapatra
AMArnab Kumar Mishra
Arnab Kumar Mishra
SPSrinivas Prasad
Srinivas Prasad

1 March 2014
Verified
Conference Paper
Closed access
Sudhir Kumar MohapatraSudhir Kumar Mohapatra
Sudhir Kumar Mohapatra
SPSrinivas Prasad
Srinivas Prasad
Software testing is one of the important stages of software development. In software development, developers always depend on testing to reveal bugs. In the maintenance stage test suite size grow because of integration of new technique. Addition of new technique force to create new test case which increase the size of test suite. In regression testing new test case may be added to the test suite during the whole testing process. These additions of test cases create possibility of presence of redundant test cases. Due to limitation of time and resource, reduction techniques should be used to identify and remove them. Research shows that a subset of the test case in a suit may still satisfy all the test objectives which is called as representative set. Redundant test case increase the execution cost of the test suite, in spite of NP-completeness of the problem there are few good reduction techniques have been available. In this paper a new approach for test case reduction is proposed. This algorithm use genetic algorithm technique iteratively with varying chromosome length to reduce test case in a test suit by finding representative set of test cases that are fulfill the testing criteria.

1 December 2015 in International Journal of Electrical and Computer Engineering (IJECE)
Verified
Journal Article
Open access
PDF file
Sudhir Kumar MohapatraSudhir Kumar Mohapatra
Sudhir Kumar Mohapatra
SPSrinivas Prasad
Srinivas Prasad
DLDac-Nhuong Le
Dac-Nhuong Le
Software testing is one in all the vital stages of system development. In software development, developers continually depend upon testing to reveal bugs. Within the maintenance stage test suite size grow due to integration of new functionalities. Addition of latest technique force to make new test case which increase the cost of test suite. In regression testing new test case could also be added to the test suite throughout the entire testing process. These additions of test cases produce risk of presence of redundant test cases. Because of limitation of time and resource, reduction techniques should be accustomed determine and take away. Analysis shows that a set of the test case in a suit should satisfy all the test objectives that is named as representative set. Redundant test case increase the execution price of the test suite, in spite of NP-completeness of the problem there are few sensible reduction techniques are available. During this paper the previous GA primarily based technique proposed is improved to search out cost optimum representative set using ant colony optimization.