Cloud computing is a ubiquitous network access model to a shared pool of configurable computing resources where available resources must be checked and scheduled using an efficient task scheduler to be assigned to clients. Most of the existing task schedulers, did not achieve the required standards and requirements as some of them only concentrated on waiting time or response time reduction or even both neglecting the starved processes at all. In this paper, we propose a novel hybrid task scheduling algorithm named (SRDQ) combining Shortest-JobFirst (SJF) and Round Robin (RR) schedulers considering a dynamic variable task quantum. The proposed algorithms mainly relies on two basic keys the first having a dynamic task quantum to balance waiting time between short and long tasks while the second involves splitting the ready queue into two sub-queues, Q1 for the short tasks and the other for the long ones. Assigning tasks to resources from Q 1 or Q 2 are done mutually two tasks from Q 1 and one task from Q 2 . For evaluation purpose, three different datasets were utilized during the algorithm simulation conducted using CloudSim environment toolkit 3.0.3 against three different scheduling algorithms SJF, RR and Time Slice Priority Based RR (TSPBRR) Experimentations results and tests indicated the superiority of the proposed algorithm over the state of art in reducing waiting time, response time and partially the starvation of long tasks.

Chest X-ray (CXR) imaging is one of the most feasible diagnosis modalities for early detection of the infection of COVID-19 viruses, which is classified as a pandemic according to the World Health Organization (WHO) report in December 2019. COVID-19 is a rapid natural mutual virus that belongs to the coronavirus family. CXR scans are one of the vital tools to early detect COVID-19 to monitor further and control its virus spread. Classification of COVID-19 aims to detect whether a subject is infected or not. In this article, a model is proposed for analyzing and evaluating grayscale CXR images called Chest X-Ray COVID Network (CXRVN) based on three different COVID-19 X-Ray datasets. The proposed CXRVN model is a lightweight architecture that depends on a single fully connected layer representing the essential features and thus reducing the total memory usage and processing time verse pre-trained models and others. The CXRVN adopts two optimizers: mini-batch gradient descent and Adam optimizer, and the model has almost the same performance. Besides, CXRVN accepts CXR images in grayscale that are a perfect image representation for CXR and consume less memory storage and processing time. Hence, CXRVN can analyze the CXR image with high accuracy in a few milliseconds. The consequences of the learning process focus on decision making using a scoring function called SoftMax that leads to high rate true-positive classification. The CXRVN model is trained using three different datasets and compared to the pre-trained models: GoogleNet, ResNet and AlexNet, using the fine-tuning and transfer learning technologies for the evaluation process. To verify the effectiveness of the CXRVN model, it was evaluated in terms of the well-known performance measures such as precision, sensitivity, F1-score and accuracy. The evaluation results based on sensitivity, precision, recall, accuracy, and F1 score demonstrated that, after GAN augmentation, the accuracy reached 96.7% in experiment 2 (Dataset-2) for two classes and 93.07% in experiment-3 (Dataset-3) for three classes, while the average accuracy of the proposed CXRVN model is 94.5%.

This study presents a secret key sharing protocol that establishes cryptographically secured communication between two entities. A new symmetric key exchange scenario for smart city applications is presented in this research. The protocol is based on the specific properties of the Fuss‐Catalan numbers and the Lattice Path combinatorics. The proposed scenario consists of three phases: generating a Fuss‐Catalan object based on the grid dimension, defining the movement in the Lattice Path Grid and defining the key equalisation rules. In the experimental part, the authors present the security analysis of the protocol as well as its test. Also, they examine the equivalence of the proposed with Maurer's satellite scenario and suggest a new scenario that implements an information‐theoretical protocol for the public key distribution. Additionally, a comparison with related studies and methods is provided, as well as a comparison with satellite scenario, which proves the advantages of solution presented by the authors. Finally, they propose further research directions regarding key management in smart city applications.

Energy consumption always represents a challenge in the ad hoc networks which spurred the researchers to benefit from the bio-inspired algorithms and their fitness functions to evaluate nodes energy through the path discovery stage. In this paper we propose energy efficient routing protocol based on the well-known Ad Hoc On-Demand Multipath Distance Vector (AOMDV) routing protocol and a bio-inspired algorithm called Elephant Herding Optimization (EHO). In the proposed EHO-AOMDV the overall consumed energy of nodes is optimized by classifying nodes into two classes, while paths are discovered from the class of the fittest nodes with sufficient energy for transmission to reduce the probability of path failure and the increasing number of dead nodes through higher data loads. The EHO updating operator updates classes based on separating operator that evaluates nodes based on residual energy after each transmission round. Experiments were conducted using Ns-3 with five evaluation metrics routing overhead, packet delivery ratio, average energy consumption, end-to-end delay and number of dead nodes and four implemented protocols the proposed protocol , AOMDV and two bio-inspired protocols ACO-FDRPSO and FF-AOMDV. Results indicated that the proposed EHO-AOMDV attained higher packet delivery ratio with less routing overhead, average energy consumption and number of dead nodes over the state of art while in the end-to-end delay AOMDV has outperformed the proposed protocol.

No abstract

This article suggests a novel enhanced slime mould optimizer (ESMO) that incorporates a chaotic strategy and an elitist group for handling various mathematical optimization benchmark functions and engineering problems. In the newly suggested solver, a chaotic strategy was integrated into the movement updating rule of the basic SMO, whereas the exploitation mechanism was enhanced via searching around an elitist group instead of only the global best dependence. To handle the mathematical optimization problems, 13 benchmark functions were utilized. To handle the engineering optimization problems, the optimal power flow (OPF) was handled first, where three studied cases were considered. The suggested scheme was scrutinized on a typical IEEE test grid, and the simulation results were compared with the results given in the former publications and found to be competitive in terms of the quality of the solution. The suggested ESMO outperformed the basic SMO in terms of the convergence rate, standard deviation, and solution merit. Furthermore, a test was executed to authenticate the statistical efficacy of the suggested ESMO-inspired scheme. The suggested ESMO provided a robust and straightforward solution for the OPF problem under diverse goal functions. Furthermore, the combined heat and electrical power dispatch problem was handled by considering a large-scale test case of 84 diverse units. Similar findings were drawn, where the suggested ESMO showed high superiority compared with the basic SMO and other recent techniques in minimizing the total production costs of heat and electrical energies.

Multipose face recognition system is one of the recent challenges faced by the researchers interested in security applications. Different researches have been introduced discussing the accuracy improvement of multipose face recognition through enhancing the face detector as Viola-Jones, Real Adaboost, and Cascade Object Detector while others concentrated on the recognition systems as support vector machine and deep convolution neural networks. In this paper, a combined adaptive deep learning vector quantization (CADLVQ) classifier is proposed. The proposed classifier has boosted the weakness of the adaptive deep learning vector quantization classifiers through using the majority voting algorithm with the speeded up robust feature extractor. Experimental results indicate that, the proposed classifier provided promising results in terms of sensitivity, specificity, precision, and accuracy compared to recent approaches in deep learning, statistical, and classical neural networks. Finally, the comparison is empirically performed using confusion matrix to ensure the reliability and robustness of the proposed system compared to the state-of art.

Statistical language models estimate the probability for a given sequence of words. Given a sentence s with n words such as s = (w 1 , w 2. .. w n), the language model assigns P(s). Statistical language models assess good word sequence estimations based on the sequence probability estimation. Building robust, fast and accurate language models is one of the main factors in the success of building systems such as machine translation systems and automatic speech recognition systems. Statistical language models can be estimated based on various approaches. Classical language models are estimated based on n-gram word sequences such as P(s) = P(w 1 , w 2. .. w n) = n i=1 P(w i |w i−1) and can be approximated based on the Markov concept for shorter contexts (for example, bigram if n = 2 or trigram if n = 3 and so on). Recent researchers have applied neural networks different architectures to build and estimate language models. The classical feed-forward neural network-based language models have been continuously reporting good results among the traditional n-gram language modeling techniques [1]. It