A Real-Time Electrical Load Forecasting in Jordan Using an Enhanced Evolutionary Feedforward Neural Network

Power system planning and expansion start with forecasting the anticipated future load requirement. Load forecasting is essential for the engineering perspective and a financial perspective. It effectively plays a vital role in the conventional monopolistic operation and electrical utility planning to enhance power system operation, security, stability, minimization of operation cost, and zero emissions. TwoWell-developed cases are discussed here to quantify the benefits of additional models, observation, resolution, data type, and how data are necessary for the perception and evolution of the electrical load forecasting in Jordan. Actual load data for more than a year is obtained from the leading electricity company in Jordan. These cases are based on total daily demand and hourly daily demand. This work’s main aim is for easy and accurate computation of week ahead electrical system load forecasting based on Jordan’s current load measurements. The uncertainties in forecasting have the potential to waste money and resources. This research proposes an optimized multi-layered feed-forward neural network using the recent Grey Wolf Optimizer (GWO). The problem of power forecasting is formulated as a minimization problem. The experimental results are compared with popular optimization methods and show that the proposed method provides very competitive forecasting results

An Evolutionary Fake News Detection Method for COVID-19 Pandemic Information

As the COVID-19 pandemic rapidly spreads across the world, regrettably, misinformation and fake news related to COVID-19 have also spread remarkably. Such misinformation has confused people. To be able to detect such COVID-19 misinformation, an effective detection method should be applied to obtain more accurate information. This will help people and researchers easily differentiate between true and fake news. The objective of this research was to introduce an enhanced evolutionary detection approach to obtain better results compared with the previous approaches. The proposed approach aimed to reduce the number of symmetrical features and obtain a high accuracy after implementing three wrapper feature selections for evolutionary classifications using particle swarm optimization (PSO), the genetic algorithm (GA), and the salp swarm algorithm (SSA). The experiments were conducted on one of the popular datasets called the Koirala dataset. Based on the obtained prediction results, the proposed model revealed an optimistic and superior predictability performance with a high accuracy (75.4%) and reduced the number of features to 303. In addition, by comparison with other state-of-the-art classifiers, our results showed that the proposed detection method with the genetic algorithm model outperformed other classifiers in the accurac

IoT Botnet Detection Using Salp Swarm and Ant Lion Hybrid Optimization Model

In the last decade, the devices and appliances utilizing the Internet of Things (IoT) have expanded tremendously, which has led to revolutionary developments in the network industry. Smart homes and cities, wearable devices, traffic monitoring, health systems, and energy savings are typical IoT applications. The diversity in IoT standards, protocols, and computational resources makes them vulnerable to security attackers. Botnets are challenging security threats in IoT devices that cause severe Distributed Denial of Service (DDoS) attacks. Intrusion detection systems (IDS) are necessary for safeguarding Internet-connected frameworks and enhancing insufficient traditional security countermeasures, including authentication and encryption techniques. This paper proposes a wrapper feature selection model (SSA–ALO) by hybridizing the salp swarm algorithm (SSA) and ant lion optimization (ALO). The new model can be integrated with IDS components to handle the high-dimensional space problem and detect IoT attacks with superior efficiency. The experiments were performed using the N-BaIoT benchmark dataset, which was downloaded from the UCI repository. This dataset consists of nine datasets that represent real IoT traffic. The experimental results reveal the outperformance of SSA–ALO compared to existing related approaches using the following evaluation measures: TPR (true positive rate), FPR (false positive rate), G-mean, processing time, and convergence curves. Therefore, the proposed SSA–ALO model can serve IoT applications by detecting intrusions with high true positive rates that reach 99.9% and with a minimal delay even in imbalanced intrusion families

Digital Forensics Classification Based on a Hybrid Neural Network and the Salp Swarm Algorithm

In recent times, cybercrime has increased significantly and dramatically. This made the need for Digital Forensics (DF) urgent. The main objective of DF is to keep proof in its original state by identifying, collecting, analyzing, and evaluating digital data to rebuild past acts. The proof of cybercrime can be found inside a computer’s system files. This paper investigates the viability of Multilayer perceptron (MLP) in DF application. The proposed method relies on analyzing the file system in a computer to determine if it is tampered by a specific computer program. A dataset describes a set of features of file system activities in a given period. These data are used to train the MLP and build a training model for classification purposes. Identifying the optimal set of MLP parameters (weights and biases) is a challenging matter in training MLPs. Using traditional training algorithms causes stagnation in local minima and slow convergence. This paper proposes a Salp Swarm Algorithm (SSA) as a trainer for MLP using an optimized set of MLP parameters. SSA has proved its applicability in different applications and obtained promising optimization results. This motivated us to apply SSA in the context of DF to train MLP as it was never used for this purpose before. The results are validated by comparisons with other meta-heuristic algorithms. The SSAMLP-DF is the best algorithm because it achieves the highest accuracy results, minimum error rate, and best convergence scale

Predictive factors and adverse perinatal outcomes associated with maternal smoking status

Abstract To identify risk factors for smoking among pregnant women, and adverse perinatal outcomes among pregnant women. A case–control study of singleton full-term pregnant women who gave birth at a university hospital in Jordan in June 2020. Pregnant women were divided into three groups according to their smoking status, active, passive, and non-smokers. They were interviewed using a semi-structured questionnaire that included demographic data, current pregnancy history, and neonatal outcomes. Low-level maternal education, unemployment, secondary antenatal care, and having a smoking husband were identified as risk factors for smoke exposure among pregnant women. The risk for cesarean section was ninefold higher in nulliparous smoking women. Women with low family income, those who did not receive information about the hazards of smoking, unemployed passive smoking women, and multiparty raised the risk of neonatal intensive care unit admission among active smoking women. This risk increased in active and passive women with lower levels of education, and inactive smoking women with low family income by 25 times compared to women with a higher level of education. Smoking is associated with adverse perinatal outcomes. Appropriate preventive strategies should address modifiable risk factors for smoking during pregnancy

Novel memetic of beluga whale optimization with self-adaptive exploration-exploitation balance for global optimization and engineering problems

A population-based optimizer called beluga whale optimization (BWO) depicts behavioral patterns of water aerobics, foraging, and diving whales. BWO runs effectively, nevertheless it retains numerous of deficiencies that has to be strengthened. Premature convergence and a disparity between exploitation and exploration are some of these challenges. Furthermore, the absence of a transfer parameter in the typical BWO when moving from the exploration phase to the exploitation phase has a direct impact on the algorithms performance. This work proposes a novel modified BWO (mBWO) optimizer that incorporates an elite evolution strategy, a randomization control factor, and a transition factor between exploitation and exploitation. The elite strategy preserves the top candidates for the subsequent generation so it helps generate effective solutions with meaningful differences between them to prevent settling into local maxima. The elite random mutation improves the search strategy and offers a more crucial exploration ability that prevents stagnation in the local optimum. The mBWO incorporates a controlling factor to direct the algorithm away from the local optima region during the randomization phase of the BWO. Gaussian local mutation (GM) acts on the initial position vector to produce a new location. Because of this, the majority of altered operators are scattered close to the original position, which is comparable to carrying out a local search in a small region. The original method can now depart the local optimal zone because to this modification, which also increases the optimizers optimization precision control randomization traverses the search space using random placements, which can lead to stagnation in the local optimal zone. Transition factor (TF) phase are used to make the transitions of the agents from exploration to exploitation gradually concerning the amount of time required. The mBWO undergoes comparison to the original BWO and 10 additional optimizers using 29 CEC2017 functions. Eight engineering problems are addressed by mBWO, involving the design of welded beams, three-bar trusses, tension/compression springs, speed reducers, the best design of industrial refrigeration systems, pressure vessel design challenges, cantilever beam designs, and multi-product batch plants. In both constrained and unconstrained settings, the results of mBWO preformed superior to those of other methods.Funding Agencies|Linkoping University</p

Novel hybrid of AOA-BSA with double adaptive and random spare for global optimization and engineering problems

Archimedes Optimization Algorithm (AOA) is a new physics-based optimizer that sim-ulates Archimedes principles. AOA has been used in a variety of real-world applications because of potential properties such as a limited number of control parameters, adaptability, and changing the set of solutions to prevent being trapped in local optima. Despite the wide acceptance of AOA, it has some drawbacks, such as the assumption that individuals modify their locations depending on altered densities, volumes, and accelerations. This causes various shortcomings such as stagnation into local optimal regions, low diversity of the population, weakness of exploitation phase, and slow convergence curve. Thus, the exploitation of a specific local region in the conventional AOA may be examined to achieve a balance between exploitation and exploration capabilities in the AOA. The bird Swarm Algorithm (BSA) has an efficient exploitation strategy and a strong ability of search process. In this study, a hybrid optimizer called AOA-BSA is proposed to overcome the limitations of AOA by replacing its exploitation phase with a BSA exploitation one. Moreover, a transition operator is used to have a high balance between exploration and exploitation. To test and examine the AOA-BSA performance, in the first experimental series, 29 unconstrained functions from CEC2017 have been used whereas the series of the second experiments use seven constrained engi-neering problems to test the AOA-BSAs ability in handling unconstrained issues. The performance of the suggested algorithm is compared with 10 optimizers. These are the original algorithms and 8 other algorithms. The first experiments results show the effectiveness of the AOA-BSA in optimiz-ing the functions of the CEC2017 test suite. AOABSA outperforms the other metaheuristic algo-rithms compared with it across 16 functions. The results of AOABSA are statically validated using Wilcoxon Rank sum. The AOABSA shows superior convergence capability. This is due to the added power to the AOA by the integration with BSA to balance exploration and exploitation. This is not only seen in the faster convergence achieved by the AOABSA, but also in the optimal solutions found by the search process. For further validation of the AOABSA, an extensive statis-tical analysis is performed during the search process by recording the ratios of the exploration and exploitation. For engineering problems, AOABSA achieves competitive results compared with other algorithms. the convergence curve of the AOABSA reaches the lowest values of the problem. It also has the minimum standard deviation which indicates the robustness of the algorithm in solv-ing these problems. Also, it obtained competitive results compared with other counterparts algo-rithms regarding the values of the problem variables and convergence behavior that reaches the best minimum values. (c) 2023 THE AUTHORS. Published by Elsevier BV on behalf of Faculty of Engineering, Alexandria University This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/ licenses/by-nc-nd/4.0/)

An effective networks intrusion detection approach based on hybrid Harris Hawks and multi-layer perceptron

This paper proposes an Intrusion Detection System (IDS) employing the Harris Hawks Optimization algorithm (HHO) to optimize Multilayer Perceptron learning by optimizing bias and weight parameters. HHO-MLP aims to select optimal parameters in its learning process to minimize intrusion detection errors in networks. HHO-MLP has been implemented using EvoloPy NN framework, an open-source Python tool specialized for training MLPs using evolutionary algorithms. For purposes of comparing the HHO model against other evolutionary methodologies currently available, specificity and sensitivity measures, accuracy measures, and mse and rmse measures have been calculated using KDD datasets. Experiments have demonstrated the HHO MLP method is effective at identifying malicious patterns. HHO-MLP has been tested against evolutionary algorithms like Butterfly Optimization Algorithm (BOA), Grasshopper Optimization Algorithms (GOA), and Black Widow Optimizations (BOW), with validation by Random Forest (RF), XGBoost. HHO-MLP showed superior performance by attaining top scores with accuracy rate of 93.17%, sensitivity level of 89.25%, and specificity percentage of 95.41%

A Review of the Modification Strategies of the Nature Inspired Algorithms for Feature Selection Problem

This survey is an effort to provide a research repository and a useful reference for researchers to guide them when planning to develop new Nature-inspired Algorithms tailored to solve Feature Selection problems (NIAs-FS). We identified and performed a thorough literature review in three main streams of research lines: Feature selection problem, optimization algorithms, particularly, meta-heuristic algorithms, and modifications applied to NIAs to tackle the FS problem. We provide a detailed overview of 156 different articles about NIAs modifications for tackling FS. We support our discussions by analytical views, visualized statistics, applied examples, open-source software systems, and discuss open issues related to FS and NIAs. Finally, the survey summarizes the main foundations of NIAs-FS with approximately 34 different operators investigated. The most popular operator is chaotic maps. Hybridization is the most widely used modification technique. There are three types of hybridization: Integrating NIA with another NIA, integrating NIA with a classifier, and integrating NIA with a classifier. The most widely used hybridization is the one that integrates a classifier with the NIA. Microarray and medical applications are the dominated applications where most of the NIA-FS are modified and used. Despite the popularity of the NIAs-FS, there are still many areas that need further investigation

Elección de un método adecuado de priorización de requisitos: un estudio

Software requirements prioritization plays a crucial role in software development. It can be viewed as the process of ordering requirements by determining which requirements must be done first and which can be done later. Powerful requirements prioritization techniques are of paramount importance to finish the implementation on time and within budget. Many factors affect requirement prioritization such as stakeholder expectations, complexity, dependency, scalability, risk, and cost. Therefore, finding the proper order of requirements is a challenging process. Hence, different types of requirements prioritization techniques have been developed to support this task. In this survey, we propose a novel classification that can classify the prioritization techniques under two major classes: relative and exact prioritization techniques class, where each class is divided into two subclasses. We depend in our classification on the way the value of ranking is given to the requirement, either explicitly as a specific value in the case of the exact prioritization techniques class, or implicitly in the case of the Relative prioritization technique class. An overview of fifteen different requirements prioritization techniques are presented and organized according to the proposed classification criteria’s. Moreover, we make a comparison between methods that are related to the same subclass to analyze their strengths and weaknesses. Based on the comparison results, the properties for each proposed subclass of techniques are identified. Depending on these properties, we present some recommendations to help project managers in the process of selecting the most suitable technique to prioritize requirements based on their project characteristics (number of requirements, time, cost, and accuracy).La priorización de requisitos de software desempeña un papel crucial en el desarrollo de software. Puede verse como el proceso de ordenar los requisitos determinando cuáles deben hacerse primero y cuáles pueden hacerse después. Unas técnicas potentes de priorización de requisitos son de vital importancia para terminar la implementación a tiempo y sin salirse del presupuesto. Muchos factores afectan a la priorización de requisitos, como las expectativas de las partes interesadas, la complejidad, la dependencia, la escalabilidad, el riesgo y el coste. Por lo tanto, encontrar el orden adecuado de los requisitos es un proceso difícil. De ahí que se hayan desarrollado distintos tipos de técnicas de priorización de requisitos para apoyar esta tarea. En este estudio, proponemos una clasificación novedosa que puede clasificar las técnicas de priorización en dos clases principales: clase de técnicas de priorización relativa y clase de técnicas de priorización exacta, donde cada clase se divide en dos subclases. En nuestra clasificación dependemos de la forma en que se da el valor de clasificación al requisito, ya sea explícitamente como un valor específico en el caso de la clase de técnicas de priorización exacta, o implícitamente en el caso de la clase de técnicas de priorización relativa. Se presenta una visión general de quince técnicas diferentes de priorización de requisitos, organizadas según los criterios de clasificación propuestos. Además, se realiza una comparación entre métodos relacionados con la misma subclase para analizar sus puntos fuertes y débiles. A partir de los resultados de la comparación, se identifican las propiedades de cada subclase de técnicas propuesta. En función de estas propiedades, presentamos algunas recomendaciones para ayudar a los gestores de proyectos en el proceso de selección de la técnica más adecuada para priorizar requisitos en función de las características del proyecto (número de requisitos, tiempo, coste y precisión).Facultad de Informátic