Search

To reduce the negative effects that conventional modes of transportation have on the environment, researchers are working to increase the use of electric vehicles. The demand for environmentally friendly transportation may be hampered by obstacles such as a restricted range and extended rates of recharge. The establishment of urban charging infrastructure that includes both fast and ultra-fast terminals is essential to address this issue. Nevertheless, the powering of these terminals presents challenges because of the high energy requirements, which may influence the quality of service. Modelling the maximum hourly capacity of each station based on its geographic location is necessary to arrive at an accurate estimation of the resources required for charging infrastructure. It is vital to do an analysis of specific regional traffic patterns, such as road networks, route details, junction density, and economic zones, rather than making arbitrary conclusions about traffic patterns. When vehicle traffic is simulated using this data and other variables, it is possible to detect limits in the design of the current traffic engineering system. Initially, the binary graylag goose optimization (bGGO) algorithm is utilized for the purpose of feature selection. Subsequently, the graylag goose optimization (GGO) algorithm is utilized as a voting classifier as a decision algorithm to allocate demand to charging stations while taking into consideration the cost variable of traffic congestion. Based on the results of the analysis of variance (ANOVA), a comprehensive summary of the components that contribute to the observed variability in the dataset is provided. The results of the Wilcoxon Signed Rank Test compare the actual median accuracy values of several different algorithms, such as the voting GGO algorithm, the voting grey wolf optimization algorithm (GWO), the voting whale optimization algorithm (WOA), the voting particle swarm optimization (PSO), the voting firefly algorithm (FA), and the voting genetic algorithm (GA), to the theoretical median that would be expected that there is no difference. [ABSTRACT FROM AUTHOR]

The networks of wireless sensors provide the ground for a range of applications, including environmental monitoring and industrial operations. Ensuring the networks can overcome obstacles like power and communication reliability and sensor coverage is the crux of network optimization. Network infrastructure planning should be focused on increasing performance, and it should be affected by the detailed data about node distribution. This work recommends the creation of each sensor's specs and radius of influence based on a particular geographical location, which will contribute to better network planning and design. By using the ARIMA model for time series forecasting and the Al-Biruni Earth Radius algorithm for optimization, our approach bridges the gap between successive terrains while seeking the equilibrium between exploration and exploitation. Through implementing adaptive protocols according to varying environments and sensor constraints, our study aspires to improve overall network operation. We compare the Al-Biruni Earth Radius algorithm along with Gray Wolf Optimization, Particle Swarm Optimization, Genetic Algorithms, and Whale Optimization about performance on real-world problems. Being the most efficient in the optimization process, Biruni displays the lowest error rate at 0.00032. The two other statistical techniques, like ANOVA, are also useful in discovering the factors influencing the nature of sensor data and network-specific problems. Due to the multi-faceted support the comprehensive approach promotes, there is a chance to understand the dynamics that affect the optimization outcomes better so decisions about network design can be made. Through delivering better performance and reliability for various in-situ applications, this research leads to a fusion of time series forecasters and a customized optimizer algorithm. [ABSTRACT FROM AUTHOR]

The use of privacy-enhanced facial recognition has increased in response to growing concerns about data security and privacy in the digital age. This trend is spurred by rising demand for face recognition technology in a variety of industries, including access control, law enforcement, surveillance, and internet communication. However, the growing usage of face recognition technology has created serious concerns about data monitoring and user privacy preferences, especially in context-aware systems. In response to these problems, this study provides a novel framework that integrates sophisticated approaches such as Generative Adversarial Networks (GANs), Blockchain, and distributed computing to solve privacy concerns while maintaining exact face recognition. The framework's painstaking design and execution strive to strike a compromise between precise face recognition and protecting personal data integrity in an increasingly interconnected environment. Using cutting-edge tools like Dlib for face analysis,Ray Cluster for distributed computing, and Blockchain for decentralized identity verification, the proposed system provides scalable and secure facial analysis while protecting user privacy. The study's contributions include the creation of a sustainable and scalable solution for privacy-aware face recognition, the implementation of flexible privacy computing approaches based on Blockchain networks, and the demonstration of higher performance over previous methods. Specifically, the proposed StyleGAN model has an outstanding accuracy rate of 93.84% while processing high-resolution images from the CelebA-HQ dataset, beating other evaluated models such as Progressive GAN 90.27%, CycleGAN 89.80%, and MGAN 80.80%. With improvements in accuracy, speed, and privacy protection, the framework has great promise for practical use in a variety of fields that need face recognition technology. This study paves the way for future research in privacy-enhanced face recognition systems, emphasizing the significance of using cutting-edge technology to meet rising privacy issues in digital identity. [ABSTRACT FROM AUTHOR]

Tomato leaf diseases significantly impact crop production, necessitating early detection for sustainable farming. Deep Learning (DL) has recently shown excellent results in identifying and classifying tomato leaf diseases. However, current DL methods often require substantial computational resources, hindering their application on resource-constrained devices.We propose theDeepTomatoDetectionNetwork (DTomatoDNet), a lightweightDLbased framework comprising 19 learnable layers for efficient tomato leaf disease classification to overcome this. The Convn kernels used in the proposed (DTomatoDNet) framework is 1×1, which reduces the number of parameters and helps inmore detailed and descriptive feature extraction for classification. The proposedDTomatoDNetmodel is trained from scratch to determine the classification success rate. 10,000 tomato leaf images (1000 images per class) from the publicly accessible dataset, covering one healthy category and nine disease categories, are utilized in training the proposed DTomatoDNet approach. More specifically, we classified tomato leaf images into Target Spot (TS), Early Blight (EB), Late Blight (LB), Bacterial Spot (BS), LeafMold (LM), Tomato Yellow Leaf Curl Virus (YLCV), Septoria Leaf Spot (SLS), Spider Mites (SM), Tomato Mosaic Virus (MV), and Tomato Healthy (H). The proposedDTomatoDNet approach obtains a classification accuracy of 99.34%, demonstrating excellent accuracy in differentiating between tomato diseases.Themodel could be used onmobile platforms because it is lightweight and designed with fewer layers. Tomato farmers can utilize the proposed DTomatoDNetmethodology to detect disease more quickly and easily once it has been integrated into mobile platforms by developing a mobile application. [ABSTRACT FROM AUTHOR]

With the capacities of self-learning, acquainted capacities, high-speed looking for ideal arrangements, solid nonlinear fitting, and mapping self-assertively complex nonlinear relations, neural systems have made incredible advances and accomplished broad application over the final half-century. As one of the foremost conspicuous methods for fake insights, neural systems are growing toward high computational speed andmoo control utilization. Due to the inborn impediments of electronic gadgets, it may be troublesome for electronic-implemented neural systems to make the strides these two exhibitions encourage. Optical neural systems can combine optoelectronic procedures and neural organizationmodels to provide ways to break the bottleneck. This paper outlines optical neural networks of feedforward repetitive and spiking models to give a clearer picture of history, wildernesses, and future optical neural systems. The framework demonstrates neural systems in optic communication with the serial and parallel setup. The graphene-based laser structure for fiber optic communication is discussed. The comparison of different balance plans for photonic neural systems is made within the setting of hereditary calculation and molecule swarm optimization. In expansion, the execution comparison of routine photonic neural, time-domain with and without extending commotion is additionally expounded. The challenges and future patterns of optical neural systems on the growing scale and applications of in situ preparing nonlinear computing will hence be uncovered. [ABSTRACT FROM AUTHOR]

In computer vision, emotion recognition using facial expression images is considered an important research issue. Deep learning advances in recent years have aided in attaining improved results in this issue. According to recent studies, multiple facial expressions may be included in facial photographs representing a particular type of emotion. It is feasible and useful to convert face photos into collections of visual words and carry out global expression recognition. The main contribution of this paper is to propose a facial expression recognition model (FERM) depending on an optimized Support Vector Machine (SVM). To test the performance of the proposed model (FERM), AffectNet is used. AffectNet uses 1250 emotion-related keywords in six different languages to search three major search engines and get over 1,000,000 facial photos online. The FERM is composed of three main phases: (i) the Data preparation phase, (ii) Applying grid search for optimization, and (iii) the categorization phase. Linear discriminant analysis (LDA) is used to categorize the data into eight labels (neutral, happy, sad, surprised, fear, disgust, angry, and contempt). Due to using LDA, the performance of categorization via SVM has been obviously enhanced. Grid search is used to find the optimal values for hyperparameters of SVM (C and gamma). The proposed optimized SVM algorithm has achieved an accuracy of 99% and a 98% F1 score. [ABSTRACT FROM AUTHOR]

In terms of security and privacy, mobile ad-hoc network (MANET) continues to be in demand for additional debate and development. As more MANET applications become data-oriented, implementing a secure and reliable data transfer protocol becomes a major concern in the architecture. However, MANET's lack of infrastructure, unpredictable topology, and restricted resources, as well as the lack of a previously permitted trust relationship among connected nodes, contribute to the attack detection burden. A novel detection approach is presented in this paper to classify passive and active black-hole attacks. The proposed approach is based on the dipper throated optimization (DTO) algorithm, which presents a plausible path out of multiple paths for statistics transmission to boost MANETs' quality of service. A group of selected packet features will then be weighed by the DTO-based multi-layer perceptron (DTO-MLP), and these features are collected from nodes using the Low Energy Adaptive Clustering Hierarchical (LEACH) clustering technique. MLP is a powerful classifier and the DTO weight optimization method has a significant impact on improving the classification process by strengthening the weights of key features while suppressing the weights ofminor features. This hybridmethod is primarily designed to combat active black-hole assaults. Using the LEACH clustering phase, however, can also detect passive black-hole attacks. The effect of mobility variation on detection error and routing overhead is explored and evaluated using the suggested approach. For diverse mobility situations, the results demonstrate up to 97% detection accuracy and faster execution time. Furthermore, the suggested approach uses an adjustable threshold value to make a correct conclusion regarding whether a node is malicious or benign. [ABSTRACT FROM AUTHOR]

Selecting the most relevant subset of features from a dataset is a vital step in data mining and machine learning. Each feature in a dataset has 2n possible subsets, making it challenging to select the optimum collection of features using typical methods. As a result, a new metaheuristicsbased feature selection method based on the dipper-throated and grey-wolf optimization (DTO-GW) algorithms has been developed in this research. Instability can result when the selection of features is subject to metaheuristics, which can lead to a wide range of results. Thus, we adopted hybrid optimization in our method of optimizing, which allowed us to better balance exploration and harvesting chores more equitably. We propose utilizing the binary DTO-GW search approach we previously devised for selecting the optimal subset of attributes. In the proposed method, the number of features selected is minimized, while classification accuracy is increased. To test the proposed method's performance against eleven other state-of-theart approaches, eight datasets from the UCI repository were used, such as binary grey wolf search (bGWO), binary hybrid grey wolf, and particle swarm optimization (bGWO-PSO), bPSO, binary stochastic fractal search (bSFS), binary whale optimization algorithm (bWOA), binary modified grey wolf optimization (bMGWO), binary multiverse optimization (bMVO), binary bowerbird optimization (bSBO), binary hysteresis optimization (bHy), and binary hysteresis optimization (bHWO). The suggested method is superior and successful in handling the problem of feature selection, according to the results of the experiments. [ABSTRACT FROM AUTHOR]

In data mining and machine learning, feature selection is a critical part of the process of selecting the optimal subset of features based on the target data. There are 2n potential feature subsets for every n features in a dataset, making it difficult to pick the best set of features using standard approaches. Consequently, in this research, a new metaheuristics-based feature selection technique based on an adaptive squirrel search optimization algorithm (ASSOA) has been proposed. When using metaheuristics to pick features, it is common for the selection of features to vary across runs, which can lead to instability. Because of this, we used the adaptive squirrel search to balance exploration and exploitation duties more evenly in the optimization process. For the selection of the best subset of features, we recommend using the binary ASSOA search strategy we developed before. According to the suggested approach, the number of features picked is reduced while maximizing classification accuracy. A ten-feature dataset from the University of California, Irvine (UCI) repository was used to test the proposed method's performance vs. eleven other state-of-the-art approaches, including binary grey wolf optimization (bGWO), binary hybrid grey wolf and particle swarm optimization (bGWO-PSO), bPSO, binary stochastic fractal search (bSFS), binary whale optimization algorithm (bWOA), binary modified grey wolf optimization (bMGWO), binary multiverse optimization (bMVO), binary bowerbird optimization (bSBO), binary hybrid GWO and genetic algorithm (bGWO-GA), binary firefly algorithm (bFA), and bGAmethods. Experimental results confirm the superiority and effectiveness of the proposed algorithm for solving the problem of feature selection. [ABSTRACT FROM AUTHOR]

Managing physical objects in the network's periphery is made possible by the Internet of Things (IoT), revolutionizing human life. Open attacks and unauthorized access are possible with these IoT devices, which exchange data to enable remote access. These attacks are often detected using intrusion detection methodologies, although these systems' effectiveness and accuracy are subpar. This paper proposes a new voting classifier composed of an ensemble of machine learning models trained and optimized using metaheuristic optimization. The employed metaheuristic optimizer is a new version of the whale optimization algorithm (WOA), which is guided by the dipper throated optimizer (DTO) to improve the exploration process of the traditionalWOA optimizer. The proposed voting classifier categorizes the network intrusions robustly and efficiently. To assess the proposed approach, a dataset created from IoT devices is employed to record the efficiency of the proposed algorithm for binary attack categorization. The dataset records are balanced using the locality-sensitive hashing (LSH) and Synthetic Minority Oversampling Technique (SMOTE). The evaluation of the achieved results is performed in terms of statistical analysis and visual plots to prove the proposed approach's effectiveness, stability, and significance. The achieved results confirmed the superiority of the proposed algorithm for the task of network intrusion detection. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is a modern approach that enables connection with a wide variety of devices remotely. Due to the resource constraints and open nature of IoT nodes, the routing protocol for low power and lossy (RPL) networks may be vulnerable to several routing attacks. That's why a network intrusion detection system (NIDS) is needed to guard against routing assaults on RPL-based IoT networks. The imbalance between the false and valid attacks in the training set degrades the performance of machine learning employed to detect network attacks. Therefore, we propose in this paper a novel approach to balance the dataset classes based on metaheuristic optimization applied to locality-sensitive hashing and synthetic minority oversampling technique (LSH-SMOTE). The proposed optimization approach is based on a new hybrid between the grey wolf and dipper throated optimization algorithms. To prove the effectiveness of the proposed approach, a set of experiments were conducted to evaluate the performance of NIDS for three cases, namely, detection without dataset balancing, detection with SMOTE balancing, and detection with the proposed optimized LSHSOMTE balancing. Experimental results showed that the proposed approach outperforms the other approaches and could boost the detection accuracy. In addition, a statistical analysis is performed to study the significance and stability of the proposed approach. The conducted experiments include seven different types of attack cases in the RPL-NIDS17 dataset. Based on the proposed approach, the achieved accuracy is (98.1%), sensitivity is (97.8%), and specificity is (98.8%). [ABSTRACT FROM AUTHOR]

Applications of internet-of-things (IoT) are increasingly being used in many facets of our daily life, which results in an enormous volume of data. Cloud computing and fog computing, two of the most common technologies used in IoT applications, have led to major security concerns. Cyberattacks are on the rise as a result of the usage of these technologies since present security measures are insufficient. Several artificial intelligence (AI) based security solutions, such as intrusion detection systems (IDS), have been proposed in recent years. Intelligent technologies that require data preprocessing and machine learning algorithm-performance augmentation require the use of feature selection (FS) techniques to increase classification accuracy by minimizing the number of features selected. On the other hand, metaheuristic optimization algorithms have been widely used in feature selection in recent decades. In this paper, we proposed a hybrid optimization algorithm for feature selection in IDS. The proposed algorithm is based on grey wolf (GW), and dipper throated optimization (DTO) algorithms and is referred to as GWDTO. The proposed algorithm has a better balance between the exploration and exploitation steps of the optimization process and thus could achieve better performance. On the employed IoT-IDS dataset, the performance of the proposed GWDTO algorithm was assessed using a set of evaluation metrics and compared to other optimization approaches in the literature to validate its superiority. In addition, a statistical analysis is performed to assess the stability and effectiveness of the proposed approach. Experimental results confirmed the superiority of the proposed approach in boosting the classification accuracy of the intrusion in IoT-based networks. [ABSTRACT FROM AUTHOR]

Electrocardiogram (ECG) signal is a measure of the heart's electrical activity. Recently, ECG detection and classification have benefited from the use of computer-aided systems by cardiologists. The goal of this paper is to improve the accuracy of ECG classification by combining the Dipper Throated Optimization (DTO) and Differential Evolution Algorithm (DEA) into a unified algorithm to optimize the hyperparameters of neural network (NN) for boosting the ECG classification accuracy. In addition, we proposed a new feature selection method for selecting the significant feature that can improve the overall performance. To prove the superiority of the proposed approach, several experimentswere conducted to compare the results achieved by the proposed approach and other competing approaches. Moreover, statistical analysis is performed to study the significance and stability of the proposed approach using Wilcoxon and ANOVA tests. Experimental results confirmed the superiority and effectiveness of the proposed approach. The classification accuracy achieved by the proposed approach is (99.98%). [ABSTRACT FROM AUTHOR]

Metamaterial Antennas are a type of antenna that uses metamaterial to enhance performance. The bandwidth restriction associated with small antennas can be solved using metamaterial antennas. Machine learning is gaining popularity as a way to improve solutions in a range of fields. Machine learning approaches are currently a big part of current research, and they're likely to be huge in the future. The model utilized determines the accuracy of the prediction in large part. The goal of this paper is to develop an optimized ensemble model for forecasting the metamaterial antenna's bandwidth and gain. The basic models employed in the developed ensemble are Support Vector Regression (SVR), K-NearestRegression (KNR), Multi-Layer Perceptron (MLP), Decision Trees (DT), and Random Forest (RF). The percentages of contribution of these models in the ensemble model are weighted and optimized using the dipper throated optimization (DTO) algorithm. To choose the best features from the dataset, the binary (bDTO) algorithm is exploited. The proposed ensemble model is compared to the base models and results are recorded and analyzed statistically. In addition, two other ensembles are incorporated in the conducted experiments for comparison. These ensembles are average ensemble and K-nearest neighbors (KNN)-based ensemble. The comparison is performed in terms of eleven evaluation criteria. The evaluation results confirmed the superiority of the proposed model when compared with the basic models and the other ensemble models. [ABSTRACT FROM AUTHOR]

Effective technology for wind direction forecasting can be realized using the recent advances in machine learning. Consequently, the stability and safety of power systems are expected to be significantly improved. However, the unstable and unpredictable qualities of the wind predict the wind direction a challenging problem. This paper proposes a practical forecasting approach based on the weighted ensemble of machine learning models. This weighted ensemble is optimized using awhale optimization algorithm guided by particle swarm optimization (PSO-Guided WOA). The proposed optimized weighted ensemble predicts the wind direction given a set of input features. The conducted experiments employed the wind power forecasting dataset, freely available on Kaggle and developed to predict the regular power generation at sevenwind farms over forty-eight hours. The recorded results of the conducted experiments emphasize the effectiveness of the proposed ensemble in achieving accurate predictions of the wind direction. In addition, a comparison is established between the proposed optimized ensemble and other competing optimized ensembles to prove its superiority. Moreover, statistical analysis using one-way analysis of variance (ANOVA) and Wilcoxon’s rank-sum are provided based on the recorded results to confirm the excellent accuracy achieved by the proposed optimized weighted ensemble. [ABSTRACT FROM AUTHOR]

Most children and elderly people worldwide die from pneumonia, which is a contagious illness that causes lung ulcers. For diagnosing pneumonia from chest X-ray images, many deep learning models have been put forth. The goal of this research is to develop an effective and strong approach for detecting and categorizing pneumonia cases. By varying the deep learning approach, three pre-trained models, GoogLeNet, ResNet18, and DenseNet121, are employed in this research to extract the main features of pneumonia and normal cases. In addition, the binary dipper throated optimization (DTO) algorithm is utilized to select the most significant features, which are then fed to the K-nearest neighbor (KNN) classifier for getting the final classification decision. To guarantee the best performance of KNN, its main parameter (K) is optimized using the continuous DTO algorithm. To test the proposed approach, six evaluation metrics were employed namely, positive and negative predictive values, accuracy, specificity, sensitivity, and F1-score. Moreover, the proposed approach is compared with other traditional approaches, and the findings confirmed the superiority of the proposed approach in terms of all the evaluation metrics. The minimum accuracy achieved by the proposed approach is (98.5%), and the maximum accuracy is (99.8%) when different test cases are included in the evaluation experiments. [ABSTRACT FROM AUTHOR]

Vehicular communication is the backbone of future Intelligent Transportation Systems (ITS). It offers a network-based solution for vehicle safety, cooperative awareness, and traffic management applications. For safety applications, Basic Safety Messages (BSM) containing mobility information is shared by the vehicles in their neighborhood to continuously monitor other nearby vehicles and prepare a local traffic map. BSMs are shared using mode 4 of Cellular V2X (C-V2X) communications in which resources are allocated in an ad hoc manner. However, the strict packet transmission requirements of BSM and hidden node problem causes packet collisions in a vehicular network, thus reducing the reliability of safety applications. Moreover, as vehicles choose the transmission resources in a distributed manner in mode 4 of CV2X, the packet collision problem is further aggravated. This paper presents a novel solution in the form of a Space Division Multiple Access (SDMA) protocol that intelligently schedules BSM transmissions using vehicle position data to reduce concurrent transmissions from hidden node interferers. The proposed protocol works by dividing road segments into clusters and subclusters. Several sub-frames are allocated to a cluster and these sub-frames are reused after a certain distance. Within a cluster, sub-channels are allocated to sub-clusters. We implement the proposed SDMA protocol and evaluate its performance in a highway vehicular network. Simulation results show that the proposedSDMAprotocol outperforms standard Sensing-Based Semi Persistent Scheduling (SB-SPS) in terms of safety range and packet delay. [ABSTRACT FROM AUTHOR]

The design of an antenna requires a careful selection of its parameters to retain the desired performance. However, this task is time-consuming when the traditional approaches are employed, which represents a significant challenge. On the other hand, machine learning presents an effective solution to this challenge through a set of regression models that can robustly assist antenna designers to find out the best set of design parameters to achieve the intended performance. In this paper, we propose a novel approach for accurately predicting the bandwidth of metamaterial antenna. The proposed approach is based on employing the recently emerged guided whale optimization algorithm using adaptive particle swarm optimization to optimize the parameters of the long-short-term memory (LSTM) deep network. This optimized network is used to retrieve the metamaterial bandwidth given a set of features. In addition, the superiority of the proposed approach is examined in terms of a comparison with the traditional multilayer perceptron (ML), Knearest neighbors (K-NN), and the basic LSTM in terms of several evaluation criteria such as root mean square error (RMSE), mean absolute error (MAE), and mean bias error (MBE). Experimental results show that the proposed approach could achieve RMSE of (0.003018), MAE of (0.001871), and MBE of (0.000205). These values are better than those of the other competing models. [ABSTRACT FROM AUTHOR]

One of the most common kinds of cancer is breast cancer. The early detection of it may help lower its overall rates of mortality. In this paper, we robustly propose a novel approach for detecting and classifying breast cancer regions in thermal images. The proposed approach starts with data preprocessing the input images and segmenting the significant regions of interest. In addition, to properly train the machine learning models, data augmentation is applied to increase the number of segmented regions using various scaling ratios. On the other hand, to extract the relevant features from the breast cancer cases, a set of deep neural networks (VGGNet, ResNet-50, AlexNet, and GoogLeNet) are employed. The resulting set of features is processed using the binary dipper throated algorithm to select the most effective features that can realize high classification accuracy. The selected features are used to train a neural network to finally classify the thermal images of breast cancer. To achieve accurate classification, the parameters of the employed neural network are optimized using the continuous dipper throated optimization algorithm. Experimental results show the effectiveness of the proposed approach in classifying the breast cancer cases when compared to other recent approaches in the literature. Moreover, several experiments were conducted to compare the performance of the proposed approach with the other approaches. The results of these experiments emphasized the superiority of the proposed approach. [ABSTRACT FROM AUTHOR]