Blockchain‐based IoT architecture to secure healthcare system using identity‐based encryption

P Sharma, NR Moparthi, S Namasudra… - Expert …, 2022 - Wiley Online Library
Nowadays, blockchain and Internet of Things (IoT) are two emerging areas of the
Information Technology (IT) sector. These two emerging areas are used in various fields …

[PDF][PDF] Flight-schedule using Dijkstra's algorithm with comparison of routes findings

IE Salem, MM Mijwil, AW Abdulqader… - International Journal of …, 2022 - researchgate.net
The Dijkstra algorithm, also termed the shortest-route algorithm, is a model that is
categorized within the search algorithms. Its purpose is to discover the shortest-route, from …

Semantic analysis on social networks: A survey

S Bayrakdar, I Yucedag, M Simsek… - International Journal of …, 2020 - Wiley Online Library
As social networks are getting more and more popular day by day, large numbers of users
becoming constantly active social network users. In this way, there is a huge amount of data …

AntLP: ant‐based label propagation algorithm for community detection in social networks

R Hosseini, A Rezvanian - CAAI Transactions on Intelligence …, 2020 - Wiley Online Library
In social network analysis, community detection is one of the significant tasks to study the
structure and characteristics of the networks. In recent years, several intelligent and meta …

Path Querying in Graph Databases: A systematic mapping study

R García, R Angles - IEEE Access, 2024 - ieeexplore.ieee.org
Path querying refers to the evaluation of path queries in a graph database. New research in
this topic is crucial for the development of graph database systems as path queries are …

Parallel Contraction Hierarchies Construction on Road Networks

Z Chen, X Ji, L Yuan, X Lin, W Zhang… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Shortest path query on road networks is a fundamental problem to support many location-
based services and wide variant applications. Contraction Hierarchies (CH) is widely …

Approximate normalized cuts without Eigen-decomposition

H Jia, S Ding, M Du, Y Xue - Information Sciences, 2016 - Elsevier
Most traditional weighted graph clustering algorithms are solved by spectral method, which
is only suitable for small scale datasets because of the high space and time complexity. How …

A hybrid single-source shortest path algorithm

H Arslan, M Manguoğlu - Turkish Journal of Electrical …, 2019 - journals.tubitak.gov.tr
The single-source shortest path problem arises in many applications, such as roads, social
applications, and computer networks. Finding the shortest path is challenging, especially for …

Exploring and predicting the knowledge development in the field of energy storage: evidence from the emerging startup landscape

CH Song - Energies, 2021 - mdpi.com
The distribution and deployment of energy storage systems on a larger scale will be a key
element of successfully managing the sustainable energy transition by balancing the power …

Analytics in human resource management the OpenSKIMR approach

P Mirski, R Bernsteiner, D Radi - Procedia computer science, 2017 - Elsevier
Matching skill sets of individuals with highly demanded skill sets of jobs or occupations in
the IT area is a great challenge–adding necessary learning items and visualizing the result …