Abstract

The maritime transportation industry is a prime target for cybersecurity attacks due to the inherent risks of transmitting sensitive information required for its smooth operation. The introduction of digital systems in maritime transport has made them susceptible to a range of cybersecurity threats. These attacks can lead to the unauthorized acquisition and misuse of vulnerable data, such as personal information of crew and passengers, vessel location, route, schedule, and other related information. To address this issue, a new lightweight authentication protocol has been proposed by utilizing drone technology in conjunction with the 5th generation mobile network (5G) communication. The effectiveness of the proposed protocol has been analyzed, which demonstrates its ability to withstand various security attacks while maintaining low communication and computation costs. Furthermore, it successfully meets the security and functionality requirements of anonymity and untraceability. A comprehensive simulation study and simulation using the network simulator (NS3) have been conducted to assess the impact on various network performance parameters for the proposed scheme. In addition, various experiments using machine-learning algorithms for Big data analytics show the efficiency of the proposed scheme in terms of accuracy, precision, recall and F1 score.

Abstract

No Results Found

Abstract

Indian folk paintings have a rich mosaic of symbols, colors, textures, and stories making them an invaluable repository of cultural legacy. The paper presents a novel approach to classifying these paintings into distinct art forms and tagging them with their unique salient features. A custom dataset named FolkTalent, comprising 2279 digital images of paintings across 12 different forms, has been prepared using websites that are direct outlets of Indian folk paintings. Tags covering a wide range of attributes like color, theme, artistic style, and patterns are generated using GPT4, and verified by an expert for each painting. Classification is performed employing the RandomForest ensemble technique on fine-tuned Convolutional Neural Network (CNN) models to classify Indian folk paintings, achieving an accuracy of 91.83%. Tagging is accomplished via the prominent fine-tuned CNN-based backbones with a custom classifier attached to its top to perform multi-label image classification. The generated tags offer a deeper insight into the painting, enabling an enhanced search experience based on theme and visual attributes. The proposed hybrid model sets a new benchmark in folk painting classification and tagging, significantly contributing to cataloging India’s folk-art heritage.

Abstract

No Results Found

Abstract

In a prior study, a novel deterministic compartmental model known as the SEIHRK model was introduced, shedding light on the pivotal role of test kits as an intervention strategy for mitigating epidemics. Particularly in heterogeneous networks, it was empirically demonstrated that strategically distributing a limited number of test kits among nodes with higher degrees substantially diminishes the outbreak size. The network's dynamics were explored under varying values of infection rate. In this research, we expand upon these findings to investigate the influence of migration on infection dynamics within distinct communities of the network. Notably, we observe that nodes equipped with test kits and those without tend to segregate into two separate clusters when coupling strength is low, but beyond a critical threshold coupling coefficient, they coalesce into a unified cluster. Building on this clustering phenomenon, we develop a reduced equation model and rigorously validate its accuracy through comprehensive simulations. We show that this property is observed in both complete and random graphs.

Abstract

PageRank is a metric that assigns importance to the vertices of a graph based on its neighbors and their scores. Recently, there has been increasing interest in computing PageRank on dynamic graphs, where the graph structure evolves due to edge insertions and deletions. However, traditional barrier-based approaches for updating PageRanks encounter significant wait times on certain graph structures, leading to high overall runtimes. Additionally, the growing trend of multicore architectures with increased core counts has raised concerns about random thread delays and failures. In this study, we propose a lock-free algorithm for updating PageRank scores on dynamic graphs. First, we introduce our Dynamic Frontier (DF) approach, which identifies and processes vertices likely to change PageRanks with minimal overhead. Subsequently, we integrate DF with our lock-free and fault-tolerant PageRank (Alg. DF_LF), incorporating a helping mechanism among threads between its two phases. Experimental results demonstrate that Alg. DF_LF not only eliminates waiting times at iteration barriers but also withstands random thread delays and crashes. On average, it is 4.6x faster than lock-free Naive-dynamic PageRank (Alg. ND_LF).

Abstract

Community detection refers to the identification of coherent partitions in networks. In this poster, we present a parallel dynamic Louvain algorithm that finds communities in rapidly evolving graphs. Given a batch update of edge deletions or insertions, our algorithm identifies an approximate set of affected vertices in the graph with minimal overhead and updates the community membership of each vertex. This process repeats until convergence. Our approach achieves a mean speedup of 7.3x, compared to our parallel and optimized implementation of Delta-screening combined with Louvain, a recently proposed stateof-the-art approach.

Abstract

Community detection is the problem of identifying natural divisions in networks. A relevant challenge in this problem is to find communities on rapidly evolving graphs. In this paper, we present our parallel Dynamic Frontier (DF) approach. Given a batch update of edge deletions or insertions, this approach incrementally identifies an approximate set of affected vertices in the graph with minimal overhead. We apply this approach to both Louvain, a high quality, and Label Propagation Algorithm (LPA), a fast static community detection algorithm. Our approach achieves a mean speedup of 7.3x and 6.7x, when applied to Louvain and LPA respectively, compared to our parallel and optimized implementation of ∆-screening, a recently proposed state-of-the-art approach. Finally, we show how to combine Louvain and LPA with the DF approach to arrive at a hybrid algorithm. This algorithm produces highquality communities while providing a speedup of 2.0x on top of DF-based Louvain.

Abstract

Identifying keywords in an open-vocabulary context is crucial for personalizing interactions with smart devices. Previous approaches to open vocabulary keyword spotting dependon a shared embedding space created by audio and text encoders. However, these approaches suffer from heterogeneous modality representations (i.e., audio-text mismatch). To address this issue, our proposed framework leverages knowledge acquired from a pre-trained text-to-speech (TTS) system. This knowledge transfer allows for the incorporation of awareness of audio projections into the text representations derived from the text encoder. The performance of the proposed approach is compared with various baseline methods across four different datasets. The robustness of our proposed model is evaluated by assessing its performance across different word lengths and in an Out-of-Vocabulary (OOV) scenario. Additionally, the effectiveness of transfer learning from the TTS system is investigated by analyzing its different intermediate representations. The experimental results indicate that, in the challenging LibriPhrase Hard dataset, the proposed approach outperformed the cross-modality correspondence detector (CMCD) method by a significant improvement of 8.22% in area under the curve (AUC) and 12.56% in equal error rate (EER).

Abstract

No Results Found