Character-level word encoding deep learning model for combating cyber threats in phishing URL detection

A cyber threat is generally a malicious activity that damages or steals data, or something that disrupts digital life. Such threats include viruses, security breaches, DoS attacks, and data theft. Phishing is a type of cyber threat whereby the attackers mimic a genuine URL or a webpage and steal user data, 21% fall into the phishing category. The novel approach of using the character-level encoding of URLs is introduced. Unlike word-level encoding, the use of character-level encoding decreases the discrete workspace and can be effective even in an energy-constrained environment. The experimental results of comparisons to other state-of-the-art methods demonstrate that the proposed method achieved 98.12% of true positive instances. Moreover, Conclusions: An experimental evaluation was performed to demonstrate the efficiency, and it was observed that the accuracy reached an all-time high of 98.13%. the experiments prove that the proposed method can operate efficiently even in energy-saving modes of phishing detection systems

Health care intelligent system: A neural network based method for early diagnosis of Alzheimer\u27s disease using MRI images

Alzheimer\u27s disease (AD) is a neurodegenerative disease that causes memory loss and is considered the most common type of dementia. In many countries, AD is commonly affecting senior citizens having an aged more than 65 years. Machine learning-based approaches have some limitations due to data pre-processing issues. We propose a health care intelligent system based on a deep convolutional neural network (DCNN) in this research work. It classifies normal control (NC), mild cognitive impairment (MCI), and AD. The proposed model is employed on white matter (WM), and grey matter (GM) tissues with more cognitive decline features. In the experimental process, we used 375 Magnetic Resonance Image (MRI) subjects collected from Alzheimer\u27s disease neuroimaging initiative (ADNI), including 130 NC people, 120 MCI patients, and 125 AD patients. We extract three major regions during pre-processing, that is, WM, GM and cerebrospinal fluid (CSF). This study shows promising classification results for NC versus AD 97.94%, MCI versus AD 92.84%, and NC versus MCI 88.15% on GM images. Furthermore, our proposed model attained 95.97%, 90.82%, and 86.87% on the same three binary classes on WM tissue, respectively. When comparing existing studies in terms of accuracy and other evaluation parameters, we found that our proposed approach shows better results than those approaches based on the CNN method

Comparative Study of Database Security In Cloud Computing Using AES and DES Encryption Algorithms

Security is consider as one of the largest part important aspects in daily computing. The security is important in cloud computing especially for data save in cloud because it have sensitivity and import data as well many user can access to same data. Unfortunately the increase of the cloud user has been accompanied with a increase in malicious action in the cloud and data not be completely trustworthy. Because of that the cloud computing security become big issue in the cloud data. The danger of malicious in the cloud and the crash of cloud services have received a strong interest by researchers. Here, we present a comparative study between state-of-art approaches to overcome these issues. This paper test and compare between the Data Encryption Standard (DES) and Advanced Encryption Standard (AES) in term of different input size that result the AES is faster than DES in the encryption time but in decryption the DES faster than AES from 20KB to 100 KB after that the DES rise sharply and AES rise slightly that make ASE faster than DES in the decryption time from 120 KB to 300KB

SEL-COVIDNET: An intelligent application for the diagnosis of COVID-19 from chest X-rays and CT-scans

COVID-19 detection from medical imaging is a difficult challenge that has piqued the interest of experts worldwide. Chest X-rays and computed tomography (CT) scanning are the essential imaging modalities for diagnosing COVID-19. All researchers focus their efforts on developing viable methods and rapid treatment procedures for this pandemic. Fast and accurate automated detection approaches have been devised to alleviate the need for medical professionals. Deep Learning (DL) technologies have successfully recognized COVID-19 situations. This paper proposes a developed set of nine deep learning models for diagnosing COVID-19 based on transfer learning and implementation in a novel architecture (SEL-COVIDNET). In which we include a global average pooling layer, flattening, and two dense layers that are fully connected. The model’s effectiveness is evaluated using balanced and unbalanced COVID-19 radiography datasets. After that, our model’s performance is analyzed using six evaluation measures: accuracy, sensitivity, specificity, precision, F1-score, and Matthew’s correlation coefficient (MCC). Experiments demonstrated that the proposed SEL-COVIDNET with tuned DenseNet121, InceptionResNetV2, and MobileNetV3Large models outperformed the results of comparative SOTA for multi-class classification (COVID-19 vs. No-finding vs. Pneumonia) in terms of accuracy (98.52%), specificity (98.5%), sensitivity (98.5%), precision (98.7%), F1-score (98.7%), and MCC (97.5%). For the COVID-19 vs. No-finding classification, our method had an accuracy of 99.77%, a specificity of 99.85%, a sensitivity of 99.85%, a precision of 99.55%, an F1-score of 99.7%, and an MCC of 99.4%. The proposed model offers an accurate approach for detecting COVID-19 patients, which aids in the containment of the COVID-19 pandemic

Vertical Fragmentation for Database Using FPClose Algorithm

Vertical fragmentation technique is used to enhance the performance of database system and reduce the number of access to irrelevant instances by splitting a table or relation into different fragments vertically. The partitioning design can be derived using FPClose algorithm, which is a data mining algorithm used to extract the frequent closed itemsets in a dataset. A new design approach is implemented to perform fragmentation. A benchmark with different minimum support levels is tested. The obtained results from FPClose algorithm are compared with the Apriori algorithm

A study of positive exponential consensus on DeGroot model

A nonlinear consensus model is assigned to resolve the consensus problem of multi-agent systems (MAS). Other studies have constructed consensus systems based on low-complexity computation linear equations or complex nonlinear equations. Linear equations are less efficient in reaching a consensus due to their slow computation process, where nonlinear equations are more efficient. The three major challenges in designing nonlinear consensus equations are: building a system of nonlinear equations that have solution, easy to calculate, and less time consuming. This study aims to create a consensus system that is nonlinear and easy to calculate. According to our survey, the DeGroot model (DGM) of 1974 is a linear model and the first effect consensus model with a flexible computation process for finite nodes. We examine if raising the exponential level for the initial cases of agents allows the system to achieve a consensus and move the DGM to a nonlinear level. The results show that by raising the exponent, the DGM is able to reach a consensus. The consensus of the DGM reaches a certain positive value that depends on the initial states of the agents and the transition matrix, whereas the consensus of the proposed exponential DGM (EDGM) reaches zero with a flexible and unrestricted matrix. Moreover, EDGM is a nonlinear model and reaches the consensus faster than the DGM linear model. The results are supported by theoretical evidence and numerical analysis

Horizontal Review on Video Surveillance for Smart Cities: Edge Devices, Applications, Datasets, and Future Trends

The automation strategy of today’s smart cities relies on large IoT (internet of Things) systems that collect big data analytics to gain insights. Although there have been recent reviews in this field, there is a remarkable gap that addresses four sides of the problem. Namely, the application of video surveillance in smart cities, algorithms, datasets, and embedded systems. In this paper, we discuss the latest datasets used, the algorithms used, and the recent advances in embedded systems to form edge vision computing are introduced. Moreover, future trends and challenges are addressed

Recent advances in passive UHF-RFID tag antenna design for improved read range in product packaging applications: a comprehensive review

Radio frequency identification (RFID) is a rapidly developing technology, and RFID sensors have become important components in many common technology applications. The passive ultra-high frequency (UHF) tags used in RFID sensors have a higher data transfer rate and longer read range and usually come in unique small and portable application designs. However, these tags suffer from significant frequency interference when mounted on metallic materials or placed near liquid surfaces. This paper presents the recent advancements made in passive UHF-RFID tag designs proposed to resolve the interference problems. We focus on those designs that are intended to improve antenna read range as well as scalability designs for miniaturized application

A generalized laser simulator algorithm for mobile robot path planning with obstacle avoidance

This paper aims to develop a new mobile robot path planning algorithm, called generalized laser simulator (GLS), for navigating autonomously mobile robots in the presence of static and dynamic obstacles. This algorithm enables a mobile robot to identify a feasible path while finding the target and avoiding obstacles while moving in complex regions. An optimal path between the start and target point is found by forming a wave of points in all directions towards the target position considering target minimum and border maximum distance principles. The algorithm will select the minimum path from the candidate points to target while avoiding obstacles. The obstacle borders are regarded as the environment’s borders for static obstacle avoidance. However, once dynamic obstacles appear in front of the GLS waves, the system detects them as new dynamic obstacle borders. Several experiments were carried out to validate the effectiveness and practicality of the GLS algorithm, including path-planning experiments in the presence of obstacles in a complex dynamic environment. The findings indicate that the robot could successfully find the correct path while avoiding obstacles. The proposed method is compared to other popular methods in terms of speed and path length in both real and simulated environments. According to the results, the GLS algorithm outperformed the original laser simulator (LS) method in path and success rate. With application of the all-direction border scan, it outperforms the A-star (A*) and PRM algorithms and provides safer and shorter paths. Furthermore, the path planning approach was validated for local planning in simulation and real-world tests, in which the proposed method produced the best path compared to the original LS algorithm

A fast non-linear symmetry approach for guaranteed consensus in network of multi-agent systems

There has been tremendous work on multi-agent systems (MAS) in recent years. MAS consist of multiple autonomous agents that interact with each order to solve a complex problem. Several applications of MAS can be found in computer networks, smart grids, and the modeling of complex systems. Despite numerous benefits, a significant challenge for MAS is achieving a consensus among agents in a shared target task, which is difficult without applying certain mathematical equations. Non-linear models offer better possibility of resolving consensus for MAS; however, existing non-linear models are considerably complicated and present no guarantees for achieving consensus. This paper proposes a non-linear mathematical model of semi symmetry quadratic operator (SSQO) in order to resolve the issue of consensus in networks of MAS. The model is based on stochastic quadratic operator theory, with added new notations. An important feature for the proposed model is low complexity, fast consensus, and a guaranteed capability to reach a consensus. We present an evaluation of the proposed SSQO model and comparison with other existing models. We demonstrate that an average consensus can be achieved with our model in addition to the emulation effects for the MAS consensus