<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Collection:</title>
    <link>http://localhost:8080/xmlui/handle/123456789/212</link>
    <description />
    <pubDate>Sun, 26 Apr 2026 08:07:03 GMT</pubDate>
    <dc:date>2026-04-26T08:07:03Z</dc:date>
    <item>
      <title>Modelling Renewable Energy-Based Cloud Computing Environment by Harnessing Solar Energy</title>
      <link>http://localhost:8080/xmlui/handle/123456789/3839</link>
      <description>Title: Modelling Renewable Energy-Based Cloud Computing Environment by Harnessing Solar Energy
Authors: Nayak, Sanjib Kumar; Padhee, Subhransu; Panda, Sanjaya Kumar
Description: NITW</description>
      <pubDate>Wed, 01 Jan 2025 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://localhost:8080/xmlui/handle/123456789/3839</guid>
      <dc:date>2025-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>An Efficient Approach for Energy Conservation in Cloud Computing Environment</title>
      <link>http://localhost:8080/xmlui/handle/123456789/3838</link>
      <description>Title: An Efficient Approach for Energy Conservation in Cloud Computing Environment
Authors: Pande, Sohan Kumar; Panda, Sanjaya Kumar; Sahu, Preeti Ranjan
Abstract: Recent trends of technology have explored a&#xD;
numerous applications of cloud services, which require a&#xD;
significant amount of energy. In the present scenario, most of&#xD;
the energy sources are limited and have a greenhouse effect on&#xD;
the environment. Therefore, it is the need of the hour that the&#xD;
energy consumed by the cloud service providers must be&#xD;
reduced and it is a great challenge to the research community to&#xD;
develop energy-efficient algorithms. To design the same, some&#xD;
researchers tried to maximize the average resource utilization,&#xD;
whereas some researchers tried to minimize the makespan.&#xD;
However, they have not considered different types of resources&#xD;
that are present in the physical machines. In this paper, we&#xD;
propose a task scheduling algorithm, which tries to improve&#xD;
utilization of resources (like CPU, disk, I/O) explicitly, which in&#xD;
turn increases the utilization of active resources. For this, the&#xD;
proposed algorithm uses a fitness value, which is a function of&#xD;
CPU, disk and I/O utilization, and processing time of the task.&#xD;
To demonstrate the performance of the proposed algorithm,&#xD;
extensive simulations are performed on both proposed&#xD;
algorithm and existing algorithm MaxUtil using synthetic&#xD;
datasets. From the simulation results, it can be observed that&#xD;
the proposed algorithm is a better energy-efficient algorithm&#xD;
and consumes less energy than the MaxUtil algorithm.
Description: NITW</description>
      <pubDate>Wed, 01 Jan 2025 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://localhost:8080/xmlui/handle/123456789/3838</guid>
      <dc:date>2025-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>An Item-Oriented Collaborative Filtering Algorithm for Recommender Systems</title>
      <link>http://localhost:8080/xmlui/handle/123456789/3836</link>
      <description>Title: An Item-Oriented Collaborative Filtering Algorithm for Recommender Systems
Authors: Panda, Sanjaya Kumar; Senapati, Manas Ranjan; Sahu, Pradip Kumar
Abstract: Recommender systems (RSs) are one of the&#xD;
popular, common and widespread applications in today’s&#xD;
business. It predicts the rating that a user is likely to give an&#xD;
item and finds a list of items to recommend the user. In this&#xD;
context, it is primarily categorized into collaborative&#xD;
filtering-based (CF) RS and content-based RS. In the CF, the&#xD;
RS suggests the items that are based on the behavior of similar&#xD;
users and its past behavior. One of the well-known algorithms&#xD;
in the CF is k-nearest neighbor (kNN), which relies on the&#xD;
behavior (rating) of k similar users (items) in oriented to users&#xD;
(items). However, it suffers from the unknown rating problem&#xD;
and the insufficient neighbor problem if the k similar users&#xD;
(items) have not rated the corresponding item (with respect to&#xD;
the corresponding user). Therefore, we develop an&#xD;
item-oriented CF (ICF) algorithm for RSs to overcome the&#xD;
problems associated with the kNN algorithm. The proposed&#xD;
algorithm ICF selects k similar items of a given item by finding&#xD;
the similarity count of the neighbors. We implement both the&#xD;
algorithms and compare with the kNN algorithm using four&#xD;
datasets to show the superiority of the proposed algorithm ICF&#xD;
in terms of two errors, namely mean absolute error (MAE), root&#xD;
mean square error (RMSE), precision, recall and F-score.
Description: NITW</description>
      <pubDate>Wed, 01 Jan 2025 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://localhost:8080/xmlui/handle/123456789/3836</guid>
      <dc:date>2025-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Smart Municipal Services and Predictive Healthcare: A Thermal Imaging Perspective</title>
      <link>http://localhost:8080/xmlui/handle/123456789/3834</link>
      <description>Title: Smart Municipal Services and Predictive Healthcare: A Thermal Imaging Perspective
Authors: Jena, Kalyan Kumar; Bhoi, Sourav Kumar; Panda, Sanjaya Kumar
Abstract: In the present day, diabetes is viewed as a serious problem. It can be promoted and&#xD;
campaigned as a smart municipal service to create awareness. The heart, nerves, eyes, and&#xD;
other human disorders, among others, might all be negatively impacted by this illness. Thus,&#xD;
early detection of diabetes patients is crucial to implement preventative treatments as soon as&#xD;
possible. In this work, a machine intelligence (MI) based approach is proposed for classifying&#xD;
diabetic and non-diabetic patients from the thermal image analysis of the human foot. This&#xD;
approach is focused on several machine learning (ML) models, such as k-nearest neighbour&#xD;
(KNN), decision tree (DT), AdaBoost (AB), and Naive Bayes (NB), to carry out such&#xD;
classification mechanisms. This study employs a cross-validation mechanism with the&#xD;
number of folds (NFD) set to 3, 5, and 10. By analysing the percentage of classification&#xD;
accuracy (CA) based on the dataset for different ML-based models, KNN achieved superior&#xD;
classification results than DT, AB, and NB, which are 93.30%, 94.60%, and 95.10%, for&#xD;
NFDs 3, 5, and 10, respectively.
Description: NITW</description>
      <pubDate>Wed, 01 Jan 2025 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://localhost:8080/xmlui/handle/123456789/3834</guid>
      <dc:date>2025-01-01T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

