Search

The stability of smart grids is crucial for ensuring reliable and efficient power distribution in modern energy systems. This paper presents an optimized Long Short-Term Memory model for predicting smart grid stability, leveraging the Novel Guide-Waterwheel Plant Algorithm (Guide-WWPA) for enhanced performance. Traditional methods often struggle with the complexity and dynamic nature of smart grids, necessitating advanced approaches for accurate predictions. The proposed LSTM model, optimized using Guide-WWPA, addresses these challenges by effectively capturing temporal dependencies and nonlinear relationships in the data. The proposed approach involves a comprehensive preprocessing pipeline to handle data heterogeneity and noise, followed by the implementation of the LSTM model optimized through Guide-WWPA. The Guide-WWPA combines the strength of the WWPA with a novel guidance mechanism, ensuring efficient exploration and exploitation of the search space. The optimized LSTM is evaluated on a real-world smart grid dataset, demonstrating superior performance compared to traditional optimization techniques. Experimental Results indicate significant improvements in prediction accuracy and computational efficiency, highlighting the potential of the Guide-WWPA optimized LSTM for real-time smart grid stability prediction. This work contributes to the development of intelligent energy management systems, offering a robust tool for maintaining grid stability and enhancing overall energy reliability. On the other hand, statistical evaluations were carried out to prove the stability and difference of the proposed methodology. The results of the experiments demonstrate that the Guide-WWPA + LSTM strategy is superior to the other machine learning approaches. [ABSTRACT FROM AUTHOR]

As the number of individuals who drive electric vehicles increases, it is becoming increasingly important to ensure that charging infrastructure is both dependable and conveniently accessible. Methodology: In this paper, a recommendation system is proposed with the purpose of assisting users of electric vehicles in locating charging stations that are closer to them, improving the charging experience, and lowering range anxiety. The proposed method is based on restricted Boltzmann machine learning to collect and evaluate real-time data on a variety of aspects, including the availability of charging stations and historical patterns of consumption. To optimize the parameters of the restricted Boltzmann machine, a new optimization algorithm is proposed and referred to as parallel greylag goose (PGGO) algorithm. The recommendation algorithm takes into consideration a variety of user preferences. These preferences include charging speed, cost, network compatibility, amenities, and proximity to the user's present location. By addressing these preferences, the proposed approach reduces the amount of irritation experienced by users, improves charging performance, and increases customer satisfaction. Results: The findings demonstrate that the method is effective in recommending charging stations that are close to drivers of electric vehicles. On the other hand, the Wilcoxon rank-sum and Analysis of Variance tests are utilized in this work to investigate the statistical significance of the proposed parallel greylag goose optimization method and restricted Boltzmann machine model. The proposed methodology could achieve a recommendation accuracy of 99% when tested on the adopted dataset. Conclusion: Based on the achieved results, the proposed method is effective in recommending systems for the best charging stations for electric vehicles. [ABSTRACT FROM AUTHOR]

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]

Diabetes is a chronic disease that is usually caused when the pancreas fails to produce sufficient insulin or when the body is unable to effectively utilize the insulin produced by the pancreas. Early detection of diabetes enables the implementation of a suitable treatment method, which can lead to a healthy lifestyle. A necessity arises for an automated system capable of diagnosing diabetes using clinical and physical data in cases when the conventional approach to detecting diabetes proves to be arduous. In this paper, a new diabetes classification model based on optimized long short-term memory (LSTM) is presented and evaluated on the Pima Indians Diabetes Database (PIDD). To improve the LSTM model, a novel hybrid waterwheel plant and stochastic fractal search (WWPASFS) is proposed for optimizing its parameters. To confirm the performance superiority of the proposed WWPASFS + LSTM model, it is compared to various machine learning models and metaheuristic optimization methods. In addition, the binary WWPASFS is proposed to extract the relevant features in the PIDD dataset, with the aim of improving the accurate classification of diabetes patients. The WWPASFS + LSTM model attained the highest accuracy of 98.2% in classifying diabetes patients on the dataset in hand. The WWPASFS + LSTM model exhibited superior performance compared to the other five models, namely decision tree, K-nearest neighbors, neural networks, random forest, and support vector machines. On the other hand, the statistical analysis of the proposed approach is studied and the results prove its difference and significance. [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]

A new metaheuristic called the Walrus Optimizer (WO) is inspired by the ways in which walruses move, roost, feed, spawn, gather, and flee in response to important cues (safety and danger signals). In this work, the WO was used to address the economic load dispatch (ELD) issue, which is one of the essential parts of a power system. One type of ELD was designed to reduce fuel consumption expenses. A variety of methodologies were used to compare the WO's performance in order to determine its reliability. These methods included rime-ice algorithm (RIME), moth search algorithm (MSA), the snow ablation algorithm (SAO), and chimp optimization algorithm (ChOA) for the identical case study. We employed six scenarios: Six generators operating at two loads of 700 and 1000 MW each were employed in the first two cases for the ELD problem. For the ELD problem, the second two scenarios involved ten generators operating at two loads of 2000 MW and 1000 MW. Twenty generators operating at a 3000 MW load were the five cases for the ELD issue. Thirty generators operating at a 5000 MW load were the six cases for the ELD issue. The power mismatch factor was the main cause of ELD problems. The ideal value of this component should be close to zero. Using the WO approach, the ideal power mismatch values of 4.1922E-13 and 4.5119E-13 were found for six generator units at demand loads of 700 MW and 1000 MW, respectively. Using metrics for the minimum, mean, maximum, and standard deviation of fitness function, the procedures were evaluated over thirty separate runs. The WO outperformed all other algorithms, as seen by the results generated for the six ELD case studies. [ABSTRACT FROM AUTHOR]

The rising popularity of electric vehicles (EVs) can be attributed to their positive impact on the environment and their ability to lower operational expenses. Nevertheless, the task of determining the most suitable EV types for a specific site continues to pose difficulties, mostly due to the wide range of consumer preferences and the inherent limits of EVs. This study introduces a new voting classifier model that incorporates the Al-Biruni earth radius optimization algorithm, which is derived from the stochastic fractal search. The model aims to predict the optimal EVtype for a given location by considering factors such as user preferences, availability of charging infrastructure, and distance to the destination. The proposed classification methodology entails the utilization of ensemble learning, which can be subdivided into two distinct stages: pre-classification and classification. During the initial stage of classification, the process of data preprocessing involves converting unprocessed data into a refined, systematic, and well-arranged format that is appropriate for subsequent analysis or modeling. During the classification phase, a majority vote ensemble learning method is utilized to categorize unlabeled data properly and efficiently. This method consists of three independent classifiers. The efficacy and efficiency of the suggested method are showcased through simulation experiments. The results indicate that the collaborative classification method performs very well and consistently in classifying EV populations. In comparison to similar classification approaches, the suggested method demonstrates improved performance in terms of assessment metrics such as accuracy, sensitivity, specificity, and F-score. The improvements observed in these metrics are 91.22%, 94.34%, 89.5%, and 88.5%, respectively. These results highlight the overall effectiveness of the proposed method. Hence, the suggested approach is seen more favorable for implementing the voting classifier in the context of the EV population across different geographical areas. [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]

Face mask detection has several applications, including real-time surveillance, biometrics, etc. Identifying face masks is also helpful for crowd control and ensuring people wear them publicly. With monitoring personnel, it is impossible to ensure that people wear face masks; automated systems are a much superior option for face mask detection and monitoring. This paper introduces a simple and efficient approach for masked face detection. The architecture of the proposed approach is very straightforward; it combines deep learning and local binary patterns to extract features and classify them as masked or unmasked. The proposed system requires hardware with minimal power consumption compared to state-of-the-art deep learning algorithms. Our proposed system maintains two steps. At first, this work extracted the local features of an image by using a local binary pattern descriptor, and then we used deep learning to extract global features. The proposed approach has achieved excellent accuracy and high performance. The performance of the proposed method was tested on three benchmark datasets: the realworld masked faces dataset (RMFD), the simulated masked faces dataset (SMFD), and labeled faces in the wild (LFW). Performancemetrics for the proposed technique weremeasured in terms of accuracy, precision, recall, and F1-score. Results indicated the efficiency of the proposed technique, providing accuracies of 99.86%, 99.98%, and 100% for RMFD, SMFD, and LFW, respectively. Moreover, the proposed method outperformed state-of-the-art deep learningmethods in the recent bibliography for the same problem under study and on the same evaluation datasets. [ABSTRACT FROM AUTHOR]

Orthogonal generalized Laguerre moments of fractional orders (FrGLMs) are signal and image descriptors. The utilization of the FrGLMs in the analysis of big-size signals encounters three challenges. First, calculating the high-order moments is a time-consuming process. Second, accumulating numerical errors leads to numerical instability and degrades the reconstructed signals' quality. Third, the QR decomposition technique is needed to preserve the orthogonality of the higher-order moments. In this paper, the authors derived a new recurrence formula for calculating the FrGLMs, significantly reducing the computational CPU times. We used the Schwarz–Rutishauser algorithm as an alternative to the QR decomposition technique. The proposed method for computing FrGLMs for big-size signals is accurate, simple, and fast. The proposed algorithm has been tested using the MIT-BIH arrhythmia benchmark dataset. The results show the proposed method's superiority over existing methods in terms of processing time and reconstruction capability. Concerning the reconstructed capability, it has achieved superiority with average values of 25.3233 and 15.6507 with the two metrics PSNR and MSE, respectively. Concerning the elapsed reconstruction time, it also achieved high superiority with an efficiency gain of 0.8. The proposed method is suitable for utilization in the Internet of Healthcare Things. [ABSTRACT FROM AUTHOR]

Image authentication techniques have recently received a lot of attention for protecting images against unauthorized access. Due to the wide use of the Internet nowadays, the need to ensure data integrity and authentication increases. Many techniques, such as watermarking and encryption, are used for securing images transmitted via the Internet. The majority of watermarking systems are PC-based, but they are not very portable. Hardwarebased watermarkingmethods need to be developed to accommodate real-time applications and provide portability. This paper presents hybrid data security techniques using a zero watermarkingmethod to provide copyright protection for the transmitted color images using multi-channel orthogonal Legendre Fourier moments of fractional orders (MFrLFMs) and the advanced encryption standard (AES) algorithm on a low-cost Raspberry Pi. In order to increase embedding robustness, the watermark picture is scrambled using the Arnold method. Zero watermarking is implemented on the Raspberry Pi to produce a real-time ownership verification key. Before sending the ownership verification key and the original image to the monitoring station, we can encrypt the transmitted data with AES for additional security and hide any viewable information. The receiver next verifies the received image's integrity to confirmits authenticity and that it has not been tampered with. We assessed the suggested algorithm's resistance tomany attacks. The suggested algorithm provides a reasonable degree of robustness while still being perceptible. The proposed method provides improved bit error rate (BER) and normalized correlation (NC) values compared to previous zero watermarking approaches. AES performance analysis is performed to demonstrate its effectiveness. Using a 256 × 256 image size, it takes only 2 s to apply the zero-watermark algorithm on the Raspberry Pi. [ABSTRACT FROM AUTHOR]

One of the significant health issues affecting women that impacts their fertility and results in serious health concerns is Polycystic ovarian syndrome (PCOS). Consequently, timely screening of polycystic ovarian syndrome can help in the process of recovery. Finding a method to aid doctors in this procedure was crucial due to the difficulties in detecting this condition. This research aimed to determine whether it is possible to optimize the detection of PCOS utilizing Deep Learning algorithms and methodologies. Additionally, feature selection methods that produce the most important subset of features can speed up calculation and enhance the effectiveness of classifiers. In this research, the tri-stage wrapper method is used because it reduces the computation time. The proposed study for the Automatic diagnosis of PCOS contains preprocessing, data normalization, feature selection, and classification. A dataset with 39 characteristics, including metabolism, neuroimaging, hormones, and biochemical information for 541 subjects, was employed in this scenario. To start, this research pre-processed the information. Next for feature selection, a tri-stage wrapper method such as Mutual Information, ReliefF, Chi-Square, and Xvariance is used. Then, various classification methods are tested and trained. Deep learning techniques including convolutional neural network (CNN), multi-layer perceptron (MLP), Recurrent neural network (RNN), and Bi long short-term memory (Bi-LSTM) are utilized for categorization. The experimental finding demonstrates that with effective feature extraction process using tri stage wrapper method + CNN delivers the highest precision (97%), high accuracy (98.67%), and recall (89%) when compared with other machine learning algorithms. [ABSTRACT FROM AUTHOR]

Test case selection is to minimize the time and effort spent on software testing in real-time practice. During software testing, software firms need techniques to finish the testing in a stipulated time while uncompromising on quality. The motto is to select a subset of test cases rather than take up all available test cases to uncover most bugs. Our proposed model in the research study effort is termed SCARF-RT, which stands for Similarity coefficient (SC), Creating Acronyms, Regression test (RT), and Fuzzy set (FS) with Dataset (DS). Clustering of test cases using ranking and also based on similarity coefficients is to be implemented. This research considered eleven different features for clustering the test cases. Two techniques have been used. Firstly, each cluster will, to a certain extent, encompass a collection of distinct traits. Depending on the coverage of the feature, a cluster of test cases might be chosen. The ranking approach was used to create these groupings. The second methodology finds similarity among test cases based on eleven features. Then, the maxmin composition is used to find fuzzy equivalences upon which clusters are formed. Most similar test cases are clustered. Test cases of every cluster are selected as a test suite. The outcomes of this research show that the selected test cases based on the proposed approaches are better than existing methodologies in selecting test cases with less duration and at the same time not compromising on quality. Both fuzzy rank-based clustering and similarity coefficient-based clustering test case selection approaches have been developed and implemented. With the help of these methods, testers may quickly choose test cases based on the suggested characteristics and complete regression testing more quickly. [ABSTRACT FROM AUTHOR]