Computing the antiperiod(s) of a string

A string S[1, n] is a power (or repetition or tandem repeat) of order k and period n/k, if it can be decomposed into k consecutive identical blocks of length n/k. Powers and periods are fundamental structures in the study of strings and algorithms to compute them efficiently have been widely studied. Recently, Fici et al. (Proc. ICALP 2016) introduced an antipower of order k to be a string composed of k distinct blocks of the same length, n/k, called the antiperiod. An arbitrary string will have antiperiod t if it is prefix of an antipower with antiperiod t. In this paper, we describe efficient algorithm for computing the smallest antiperiod of a string S of length n in O(n) time. We also describe an algorithm to compute all the antiperiods of S that runs in O(n log n) time. © Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, and Simon J. Puglisi.Peer reviewe

Modified arithmetic optimization algorithm with Deep Learning based data analytics for depression detection

Depression detection is the procedure of recognizing the individuals exhibiting depression symptoms, which is a mental illness that is characterized by hopelessness, feelings of sadness, persistence and loss of interest in day-to-day activities. Depression detection in Social Networking Sites (SNS) is a challenging task due to the huge volume of data and its complicated variations. However, it is feasible to detect the depression of the individuals by examining the user-generated content utilizing Deep Learning (DL), Machine Learning (ML) and Natural Language Processing (NLP) approaches. These techniques demonstrate optimum outcomes in early and accurate detection of depression, which in turn can support in enhancing the treatment outcomes and avoid more complications related to depression. In order to provide more insights, both ML and DL approaches possibly offer unique features. These features support the evaluation of unique patterns that are hidden in online interactions and address them to expose the mental state amongst the SNS users. In the current study, we develop the Modified Arithmetic Optimization Algorithm with Deep Learning for Depression Detection in Twitter Data (MAOADL-DDTD) technique. The presented MAOADL-DDTD technique focuses on identification and classification of the depression sentiments in Twitter data. In the presented MAOADL-DDTD technique, the noise in the tweets is pre-processed in different ways. In addition to this, the Glove word embedding technique is used to extract the features from the preprocessed data. For depression detection, the Sparse Autoencoder (SAE) model is applied. The MAOA is used for optimum hyperparameter tuning of the SAE approach so as to optimize the performance of the SAE model, which helps in accomplishing better detection performance. The MAOADL-DDTD algorithm is simulated using the benchmark database and experimentally validated. The experimental values of the MAOADL-DDTD methodology establish its promising performance over another recent state-of-the-art approaches

IUPACpal: efficient identification of inverted repeats in IUPAC-encoded DNA sequences

Background: An inverted repeat is a DNA sequence followed downstream by its reverse complement, potentially with a gap in the centre. Inverted repeats are found in both prokaryotic and eukaryotic genomes and they have been linked with countless possible functions. Many international consortia provide a comprehensive description of common genetic variation making alternative sequence representations, such as IUPAC encoding, necessary for leveraging the full potential of such broad variation datasets. Results: We present IUPACpal, an exact tool for efficient identification of inverted repeats in IUPAC-encoded DNA sequences allowing also for potential mismatches and gaps in the inverted repeats. Conclusion: Within the parameters that were tested, our experimental results show that IUPACpal compares favourably to a similar application packaged with EMBOSS. We show that IUPACpal identifies many previously unidentified inverted repeats when compared with EMBOSS, and that this is also performed with orders of magnitude improved speed.</p

Modified Red Fox Optimizer With Deep Learning Enabled False Data Injection Attack Detection

Recently, power systems are drastically developed and shifted towards cyber-physical power systems (CPPS). The CPPS involve numerous sensor devices which generates enormous quantities of information. The data gathered from each sensing component needs to accomplish to reliability which are highly prone to attacks. Amongst various kinds of attacks, false data injection attack (FDIA) can seriously affects energy efficiency of CPPS. Current data driven approach utilized for designing FDIA frequently depends on distinct environmental and assumption conditions making them unrealistic and ineffective. In this paper, we present a modified Red Fox Optimizer with Deep Learning enabled FDIA detection (MRFODL-FDIAD) in the CPPS environment. The presented MRFODL-FDIAD technique mainly detects and classifies FDIAs in the CPPS environment. It encompasses a three stage process namely pre-processing, detection, and parameter tuning. For FDIA detection, the MRFODL-FDIAD technique uses multihead attention-based long short term memory (MBALSTM) technique. To improve the detection performance of the MBALSTM model, the MRFO technique can be exploited in this study. The experimental evaluation of the MRFODL-FDIAD approach was performed on standard IEEE bus system. Extensive set of experimentations highlighted the supremacy of the MRFODL-FDIAD technique

Chaotic Mapping Lion Optimization Algorithm-Based Node Localization Approach for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) contain several small, autonomous sensor nodes (SNs) able to process, transfer, and wirelessly sense data. These networks find applications in various domains like environmental monitoring, industrial automation, healthcare, and surveillance. Node Localization (NL) is a major problem in WSNs, aiming to define the geographical positions of sensors correctly. Accurate localization is essential for distinct WSN applications comprising target tracking, environmental monitoring, and data routing. Therefore, this paper develops a Chaotic Mapping Lion Optimization Algorithm-based Node Localization Approach (CMLOA-NLA) for WSNs. The purpose of the CMLOA-NLA algorithm is to define the localization of unknown nodes based on the anchor nodes (ANs) as a reference point. In addition, the CMLOA is mainly derived from the combination of the tent chaotic mapping concept into the standard LOA, which tends to improve the convergence speed and precision of NL. With extensive simulations and comparison results with recent localization approaches, the effectual performance of the CMLOA-NLA technique is illustrated. The experimental outcomes demonstrate considerable improvement in terms of accuracy as well as efficiency. Furthermore, the CMLOA-NLA technique was demonstrated to be highly robust against localization error and transmission range with a minimum average localization error of 2.09%. Keywords: anchor nodes; metaheuristic optimization algorithm; node localization; tent chaotic mapping; wireless sensor network

Efficient Identification of k-Closed Strings

A closed string contains a proper factor occurring as both a prefix and a suffix but not elsewhere in the string. Closed strings were introduced by Fici (WORDS 2011) as objects of combinatorial interest. This paper addresses a new problem by extending the closed string problem to the k-closed string problem, for which a level of approximation is permitted up to a number of Hamming distance errors, set by the parameter k. We address the problem of deciding whether or not a given string of length n over an integer alphabet is k-closed and additionally specifying the border resulting in the string being k-closed. Specifically, we present an (kn)-time and (n)-space algorithm to achieve this along with the pseudocode of an implementation and proof-of-concept experimental results

Modeling of Blockchain Assisted Intrusion Detection on IoT Healthcare System Using Ant Lion Optimizer With Hybrid Deep Learning

An IoT healthcare system refers to the use of Internet of Things (IoT) devices and technologies in the healthcare industry. It involves the integration of various interconnected devices, sensors, and systems to collect, monitor, and transmit health-related data for medical purposes. Blockchain-assisted intrusion detection on IoT healthcare systems is an innovative approach to enhancing the security and privacy of sensitive medical data. By combining the decentralized and immutable nature of blockchain technology with intrusion detection systems (IDS), it is possible to create a more robust and trustworthy security framework for IoT healthcare systems. With this motivation, this study presents Blockchain Assisted IoT Healthcare System using Ant Lion Optimizer with Hybrid Deep Learning (BHS-ALOHDL) technique. The presented BHS-ALOHDL technique enables IoT devices in the healthcare sector to transmit medical data securely and detects intrusions in the system. To accomplish this, the BHS-ALOHDL technique performs ALO based feature subset selection (ALO-FSS) system to produce a series of feature vectors. The HDL model integrates convolutional neural network (CNN) features and long short-term memory (LSTM) model for intrusion detection. Lastly, the flower pollination algorithm (FPA) is exploited for the optimal hyperparameter tuning of the HDL approach, which results in an enhanced detection rate. The experimental outcome of the BHS-ALOHDL system was tested on two benchmark datasets and the outcomes indicate the promising performance of the BHS-ALOHDL technique over other models

Detecting and Preventing False Nodes and Messages in Vehicular Ad-Hoc Networking (VANET)

Vehicular ad-hoc network (VANET) is an advanced mobile wireless network. The escalation of equipped vehicles on the road grabs the attention of researchers and is constantly striving to take it further. This type of wireless network infrastructure helps to establish communication between vehicles. Roadside units, sensors, and vehicular nodes are the critical components of our work to protect the vehicular network. This research is focused on detecting and preventing fake vehicular nodes and their messages by applying fake node detection and prevention algorithms and counterfeit message detection and prevention algorithms. In our proposed approach, the fake node detection and prevention algorithms check the node profile after establishing the mesh structure. If the profile attribute named &#x201C;Pen/Rew&#x201D; satisfies the condition that should be less than or equal to a threshold value (zero), the fake message detection and prevention process starts. The message will be accepted once the situation is satisfied; otherwise, it is declared fake. We utilized ONE (opportunistic network environment) simulator to generate node movement models, route messages between nodes, and visualize mobility and messaging passing in real time. The results indicated that our proposed work perfectly detects and prevents fake nodes and messages