Search

The COVID-19 pandemic has led to an incredible amount of fake news and conspiracy theories around the world. Calls for the integration of COVID-19 and fake news-related research have been advanced in various fields. This paper aims to unpack a structured overview of previous research topics and findings and identify gaps. Our goal in this systematic review is to (a) synthesize the selected earlier studies, (b) offer researchers a structural framework for future COVID-19 and fake news research, and (c) recommend relevant areas for future research. In this study, we focus on eighty conceptual and empirical studies on misinformation of COVID-19-related news on social media. We identify vital publications and methodological and theoretical approaches that exist in the COVID-19 literature. The articles were systematically analyzed, focusing on the research context and time frame, data collection/analysis procedures, and equivalence issues. While COVID-19 research has been advancing significantly over the past couple of months, numerous questions remain unexplained in the domain of the social media landscape. For example, our review suggests that researchers should begin to concentrate on a process framework blending Artificial Intelligence (AI) to curb the fake news problem. This can be achieved in all three phases, e.g., the study of individual decisions and experiences, the experiences of groups and organizations and the interactions between them, and finally, the interactions at the broadest level (micro, meso, and macro stages).

Feature selection is an NP-hard problem to remove irrelevant and redundant features with no predictive information to increase the performance of machine learning algorithms. Many wrapper-based methods using metaheuristic algorithms have been proposed to select effective features. However, they achieve differently on medical data, and most of them cannot find those effective features that may fulfill the required accuracy in diagnosing important diseases such as Diabetes, Heart problems, Hepatitis, and Coronavirus, which are targeted datasets in this study. To tackle this drawback, an algorithm is needed that can strike a balance between local and global search strategies in selecting effective features from medical datasets. In this paper, a new binary optimizer algorithm named BSMO is proposed. It is based on the newly proposed starling murmuration optimizer (SMO) that has a high ability to solve different complex and engineering problems, and it is expected that BSMO can also effectively find an optimal subset of features. Two distinct approaches are utilized by the BSMO algorithm when searching medical datasets to find effective features. Each dimension in a continuous solution generated by SMO is simply mapped to 0 or 1 using a variable threshold in the second approach, whereas in the first, binary versions of BSMO are developed using several S-shaped and V-shaped transfer functions. The performance of the proposed BSMO was evaluated using four targeted medical datasets, and results were compared with well-known binary metaheuristic algorithms in terms of different metrics, including fitness, accuracy, sensitivity, specificity, precision, and error. Finally, the superiority of the proposed BSMO algorithm was statistically analyzed using Friedman non-parametric test. The statistical and experimental tests proved that the proposed BSMO attains better performance in comparison to the competitive algorithms such as ACO, BBA, bGWO, and BWOA for selecting effective features from the medical datasets targeted in this study.

Recently, piracy and copyright violations of digital content have become major concerns as computer science has advanced. In order to prevent unauthorized usage of content, digital watermarking is usually employed. This work proposes a new approach to digital image watermarking that makes use of the discrete cosine transform (DCT), discrete wavelet transform (DWT), dipper-throated optimization (DTO), and stochastic fractal search (SFS) algorithms. The proposed approach involves computing the discrete wavelet transform (DWT) on the cover image to extract its sub-components, followed by the performance of a discrete cosine transform (DCT) to convert these sub-components into the frequency domain. Finding the best scale factor for watermarking is a significant challenge in most watermarking methods. The authors used an advanced optimization algorithm, which is referred to as DTOSFS, to determine the best two parameters—namely, the scaling factor and embedding coefficient—to be used while inserting a watermark into a cover image. Using the optimal values of these parameters, a watermark image can be inserted into a cover image more efficiently. The suggested approach is evaluated in comparison with the current gold standard. The normalized cross-correlation (NCC), peak-signal-to-noise ratio (PSNR), and image fidelity (IF) are used to measure the success of the proposed approach. In addition, a statistical analysis is performed to evaluate the significance and superiority of the proposed approach. The experimental results confirm the effectiveness of the proposed approach in improving upon standard watermarking methods based on the DWT and DCT. Moreover, a set of attacks is considered to study the robustness of the proposed approach, and the results confirm the expected outcomes. It is shown by the achieved results that the proposed approach can be utilized for practical digital image watermarking, and that it significantly outperforms other digital image watermarking methods.

Human detection is a special application of object recognition and is considered one of the greatest challenges in computer vision. It is the starting point of a number of applications, including public safety and security surveillance around the world. Human detection technologies have advanced significantly in recent years due to the rapid development of deep learning techniques. Despite recent advances, we still need to adopt the best network-design practices that enable compact sizes, deep designs, and fast training times while maintaining high accuracies. In this article, we propose ReSTiNet, a novel compressed convolutional neural network that addresses the issues of size, detection speed, and accuracy. Following SqueezeNet, ReSTiNet adopts the fire modules by examining the number of fire modules and their placement within the model to reduce the number of parameters and thus the model size. The residual connections within the fire modules in ReSTiNet are interpolated and finely constructed to improve feature propagation and ensure the largest possible information flow in the model, with the goal of further improving the proposed ReSTiNet in terms of detection speed and accuracy. The proposed algorithm downsizes the previously popular Tiny-YOLO model and improves the following features: (1) faster detection speed; (2) compact model size; (3) solving the overfitting problems; and (4) superior performance than other lightweight models such as MobileNet and SqueezeNet in terms of mAP. The proposed model was trained and tested using MS COCO and Pascal VOC datasets. The resulting ReSTiNet model is 10.7 MB in size (almost five times smaller than Tiny-YOLO), but it achieves an mAP of 63.74% on PASCAL VOC and 27.3% on MS COCO datasets using Tesla k80 GPU.

Dynamic Multi-Objective Optimization Problems (DMOPs) and Many-Objective Optimization Problems (MaOPs) are two classes of the optimization field that have potential applications in engineering. Modified Multi-Objective Evolutionary Algorithms hybrid approaches seem to be suitable to effectively deal with such problems. However, the standard Crow Search Algorithm has not been considered for either DMOPs or MaOPs to date. This paper proposes a Distributed Bi-behaviors Crow Search Algorithm (DB-CSA) with two different mechanisms, one corresponding to the search behavior and another to the exploitative behavior with a dynamic switch mechanism. The bi-behaviors CSA chasing profile is defined based on a large Gaussian-like Beta-1 function, which ensures diversity enhancement, while the narrow Gaussian Beta-2 function is used to improve the solution tuning and convergence behavior. Two variants of the proposed DB-CSA approach are developed: the first variant is used to solve a set of MaOPs with 2, 3, 5, 7, 8, 10,15 objectives, and the second aims to solve several types of DMOPs with different time-varying Pareto optimal sets and a Pareto optimal front. The second variant of DB-CSA algorithm (DB-CSA-II) is proposed to solve DMOPs, including a dynamic optimization process to effectively detect and react to the dynamic change. The Inverted General Distance, the Mean Inverted General Distance and the Hypervolume Difference are the main measurement metrics used to compare the DB-CSA approach to the state-of-the-art MOEAs. The Taguchi method has been used to manage the meta-parameters of the DB-CSA algorithm. All quantitative results are analyzed using the non-parametric Wilcoxon signed rank test with 0.05 significance level, which validated the efficiency of the proposed method for solving 44 test beds (21 DMOPs and 23 MaOPS).

In this paper, a new modified particle swarm optimization, m-PSO, is proposed, in which the novelty consists of proposing a fitness-based particle swarm optimization algorithm, PSO, which adapts the particles’ behavior rather than the PSO parameters and where particles evolve differently considering their level of optimality. A multi-objective optimization, MO, approach is then built based on m-PSO. In the proposed method, particles with fitness better than the mean local best are only updated toward the global best, while others keep moving in a classical manner. The proposed m-PSO and its multi-objective version MO-m-PSO are then employed to solve the inverse kinematics of a 5-DOF robotic arm which is 3D-printed for educational use. In the MO-m-PSO approach of inverse kinematics, the arm IK problem is formulated as a multi-objective problem searching for an appropriate solution that takes into consideration the end-effector position and orientation with a Pareto front strategy. The IK problem is addressed as the optimization of the end-effector position and orientation based on the forward kinematics model of the systems which is built using the Denavit–Hartenberg approach. Such an approach allows to avoid classical inverse kinematics solvers challenges such as singularities, which may simply harm the existence of an inverse expression. Experimental investigations included the capacity of the proposal to handle random single points in the workspace and also a circular path planning with a specific orientation. The comparative analysis showed that the mono-objective m-PSO is better than the classical PSO, the CSA, and SSA. The multi-objective variants returned accurate results, fair and better solutions compared to multi-objective variants of MO-PSO, MO-JAYA algorithm, and MO-CSA. Even if the proposed method were applied to solve the inverse kinematics of and educational robotics arms for a single point as well as for a geometric shape, it may be transposed to solve related industrial robotized arms withthe only condition of having their forward kinematics model.

As smart cities (SCs) emerge, the Internet of Things (IoT) is able to simplify more sophisticated and ubiquitous applications employed within these cities. In this regard, we investigate seven predominant sectors including the environment, public transport, utilities, street lighting, waste management, public safety, and smart parking that have a great effect on SC development. Our findings show that for the environment sector, cleaner air and water systems connected to IoT-driven sensors are used to detect the amount of CO2, sulfur oxides, and nitrogen to monitor air quality and to detect water leakage and pH levels. For public transport, IoT systems help traffic management and prevent train delays, for the utilities sector IoT systems are used for reducing overall bills and related costs as well as electricity consumption management. For the street-lighting sector, IoT systems are used for better control of streetlamps and saving energy associated with urban street lighting. For waste management, IoT systems for waste collection and gathering of data regarding the level of waste in the container are effective. In addition, for public safety these systems are important in order to prevent vehicle theft and smartphone loss and to enhance public safety. Finally, IoT systems are effective in reducing congestion in cities and helping drivers to find vacant parking spots using intelligent smart parking.

The students’ performance prediction (SPP) problem is a challenging problem that managers face at any institution. Collecting educational quantitative and qualitative data from many resources such as exam centers, virtual courses, e-learning educational systems, and other resources is not a simple task. Even after collecting data, we might face imbalanced data, missing data, biased data, and different data types such as strings, numbers, and letters. One of the most common challenges in this area is the large number of attributes (features). Determining the highly valuable features is needed to improve the overall students’ performance. This paper proposes an evolutionary-based SPP model utilizing an enhanced form of the Whale Optimization Algorithm (EWOA) as a wrapper feature selection to keep the most informative features and enhance the prediction quality. The proposed EWOA combines the Whale Optimization Algorithm (WOA) with Sine Cosine Algorithm (SCA) and Logistic Chaotic Map (LCM) to improve the overall performance of WOA. The SCA will empower the exploitation process inside WOA and minimize the probability of being stuck in local optima. The main idea is to enhance the worst half of the population in WOA using SCA. Besides, LCM strategy is employed to control the population diversity and improve the exploration process. As such, we handled the imbalanced data using the Adaptive Synthetic (ADASYN) sampling technique and converting WOA to binary variant employing transfer functions (TFs) that belong to different families (S-shaped and V-shaped). Two real educational datasets are used, and five different classifiers are employed: the Decision Trees (DT), k-Nearest Neighbors (k-NN), Naive Bayes (NB), Linear Discriminant Analysis (LDA), and LogitBoost (LB). The obtained results show that the LDA classifier is the most reliable classifier with both datasets. In addition, the proposed EWOA outperforms other methods in the literature as wrapper feature selection with selected transfer functions.

Swarm Intelligence (SI) Algorithms imitate the collective behavior of various swarms or groups in nature. In this work, three representative examples of SI algorithms have been selected and thoroughly described, namely the Grey Wolf Optimizer (GWO), the Whale Optimization Algorithm (WOA), and the Salp Swarm Algorithm (SSA). Firstly, the selected SI algorithms are reviewed in the literature, specifically for optimization problems in antenna design. Secondly, a comparative study is performed against widely known test functions. Thirdly, such SI algorithms are applied to the synthesis of linear antenna arrays for optimizing the peak sidelobe level (pSLL). Numerical tests show that the WOA outperforms the GWO and the SSA algorithms, as well as the well-known Particle Swarm Optimizer (PSO), in terms of average ranking. Finally, the WOA is exploited for solving a more computational complex problem concerned with the synthesis of an dual-band aperture-coupled E-shaped antenna operating in the 5G frequency bands.