Arindam Dey

Dr. Arindam Dey

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
7 January 2021 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
Sourav MondalSourav Mondal
Sourav Mondal
ADArindam Dey
Arindam Dey
NDNilanjan De
Nilanjan De
APAnita Pal
Anita Pal
Topological index is a numerical value associated with a chemical constitution for correlation of chemical structure with various physical properties, chemical reactivity or biological activity. In this work, some new indices based on neighborhood degree sum of nodes are proposed. To make the computation of the novel indices convenient, an algorithm is designed. Quantitative structure property relationship (QSPR) study is a good statistical method for investigating drug activity or binding mode for different receptors. QSPR analysis of the newly introduced indices is studied here which reveals their predicting power. A comparative study of the novel indices with some well-known and mostly used indices in structure-property modelling and isomer discrimination is performed. Some mathematical properties of these indices are also discussed here.

24 May 2019 in Mathematics
Verified
Journal Article
Open access
PDF file
CZCen Zuo
Cen Zuo
APAnita Pal
Anita Pal
ADArindam Dey
Arindam Dey
The picture fuzzy set is an efficient mathematical model to deal with uncertain real life problems, in which a intuitionistic fuzzy set may fail to reveal satisfactory results. Picture fuzzy set is an extension of the classical fuzzy set and intuitionistic fuzzy set. It can work very efficiently in uncertain scenarios which involve more answers to these type: yes, no, abstain and refusal. In this paper, we introduce the idea of the picture fuzzy graph based on the picture fuzzy relation. Some types of picture fuzzy graph such as a regular picture fuzzy graph, strong picture fuzzy graph, complete picture fuzzy graph, and complement picture fuzzy graph are introduced and some properties are also described. The idea of an isomorphic picture fuzzy graph is also introduced in this paper. We also define six operations such as Cartesian product, composition, join, direct product, lexicographic and strong product on picture fuzzy graph. Finally, we describe the utility of the picture fuzzy graph and its application in a social network.

9 October 2016 in Mathematics
Verified
Journal Article
Open access
PDF file
ADArindam Dey
Arindam Dey
APAnita Pal
Anita Pal
TPTandra Pal
Tandra Pal
The shortest path problem (SPP) is one of the most important combinatorial optimization problems in graph theory due to its various applications. The uncertainty existing in the real world problems makes it difficult to determine the arc lengths exactly. The fuzzy set is one of the popular tools to represent and handle uncertainty in information due to incompleteness or inexactness. In most cases, the SPP in fuzzy graph, called the fuzzy shortest path problem (FSPP) uses type-1 fuzzy set (T1FS) as arc length. Uncertainty in the evaluation of membership degrees due to inexactness of human perception is not considered in T1FS. An interval type-2 fuzzy set (IT2FS) is able to tackle this uncertainty. In this paper, we use IT2FSs to represent the arc lengths of a fuzzy graph for FSPP. We call this problem an interval type-2 fuzzy shortest path problem (IT2FSPP). We describe the utility of IT2FSs as arc lengths and its application in different real world shortest path problems. Here, we propose an algorithm for IT2FSPP. In the proposed algorithm, we incorporate the uncertainty in Dijkstra’s algorithm for SPP using IT2FS as arc length. The path algebra corresponding to the proposed algorithm and the generalized algorithm based on the path algebra are also presented here. Numerical examples are used to illustrate the effectiveness of the proposed approach.

29 June 2020 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
JPJayanta Pratihar
Jayanta Pratihar
RKRanjan Kumar
Ranjan Kumar
Seyyed Ahmad EdalatpanahSeyyed Ahmad Edalatpanah
Seyyed Ahmad Edalatpanah
ADArindam Dey
Arindam Dey
The fuzzy transportation problem is a very popular, well-known optimization problem in the area of fuzzy set and system. In most of the cases, researchers use type 1 fuzzy set as the cost of the transportation problem. Type 1 fuzzy number is unable to handle the uncertainty due to the description of human perception. Interval type 2 fuzzy set is an extended version of type 1 fuzzy set which can handle this ambiguity. In this paper, the interval type 2 fuzzy set is used in a fuzzy transportation problem to represent the transportation cost, demand, and supply. We define this transportation problem as interval type 2 fuzzy transportation problems. The utility of this type of fuzzy set as costs in transportation problem and its application in different real-world scenarios are described in this paper. Here, we have modified the classical Vogel’s approximation method for solved this fuzzy transportation problem. To the best of our information, there exists no algorithm based on Vogel’s approximation method in the literature for fuzzy transportation problem with interval type 2 fuzzy set as transportation cost, demand, and supply. We have used two Numerical examples to describe the efficiency of the proposed algorithm.

5 April 2019 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
SBSaid Broumi
Said Broumi
ADArindam Dey
Arindam Dey
MTMohamed Talea
Mohamed Talea
ABAssia Bakali
Assia Bakali
Florentin SmarandacheFlorentin Smarandache
Florentin Smarandache
RKRanjan Kumar
Ranjan Kumar
An elongation of the single-valued neutrosophic set is an interval-valued neutrosophic set. It has been demonstrated to deal indeterminacy in a decision-making problem. Real-world problems have some kind of uncertainty in nature and among them; one of the influential problems is solving the shortest path problem (SPP) in interconnections. In this contribution, we consider SPP through Bellman’s algorithm for a network using interval-valued neutrosophic numbers (IVNNs). We proposed a novel algorithm to obtain the neutrosophic shortest path between each pair of nodes. Length of all the edges is accredited an IVNN. Moreover, for the validation of the proposed algorithm, a numerical example has been offered. Also, a comparative analysis has been done with the existing methods which exhibit the advantages of the new algorithm.

15 November 2024 in Scientific Reports
Verified
Journal Article
Open access
PDF file
SHSk Md. Habibullah
Sk Md. Habibullah
SASahabul Alam
Sahabul Alam
SGShivnath Ghosh
Shivnath Ghosh
ADArindam Dey
Arindam Dey
ADAnurag De
Anurag De
Blockchain is a decentralized electronic account book that is secure, open, and impervious to manipulation, and records transactions across numerous computers. Internet of Things (IoT) deployed sensors are limited in bandwidth, processing power, and battery life. Energy efficiency is a vital factor and a decisive matter for energy-bound IoT-based networks. This paper provides an idea of the working principle of blockchain technology in IoT-enabled energy systems. It investigates the fundamentals of blockchain technology, clarifying its decentralized nature, cryptographic mechanisms, and consensus algorithms that ensure data immutability and transparency. It explores how blockchain technology can be integrated with various IoT fields for energy efficiency. The paper investigates the blockchain-based energy consumption approaches in IoT qualitatively, and quantitatively with future research directions and challenges. It is seen that the hybrid blockchain model is suitable for energy efficiency in IoT.