
Rawaa Dawoud Al-Dabbagh received her BSc degree in Computer Science from the University of Al-Nahrain in 1995, followed by a Master's degree in Computer Science from the University of Baghdad in 2000, and a PhD in Artificial Intelligence from the University of Malaya in 2015. She is currently an Assistant Professor at the Department of Computer Science, University of Baghdad. Dr. Rawaa is the author and co-author of more than 20 publications in international journals and conference proceedings. She is actively involved in research and teaching consultancy for major corporations in Artificial Intelligence projects and courses. Her research interests include soft computing, machine learning, evolutionary computation, robotics, logic programming, and reasoning.
PHD (2015), UNIVERSITY OF MALAYA (UM)
MSC (2000), UNIVERSITY OF BAGHDAD (UOB)
BSC (1995), AL-NAHRAIN UNIVERSITY
Teaching, planning and delivering lectures, conducting seminars, and supervising undergraduate and postgraduate student projects.
Conducting original research in the field of AI, publishing scholarly articles in academic journals, and presenting findings at conferences. I may also collaborate with other researchers in research projects.
Participating in departmental and faculty committees, contributing to curriculum development, and engaging in outreach activities with the community or professional organizations.
Member, IEEE- Institute of Electrical and Electronics Engineers, United States
I am a scholar in Soft Computing and Metaheuristic Optimization
Introduction to Artificial Intelligence, Undergraduate study (Third Class) 2015-present
Robot Control, Undergraduate study (Fourth Class) 2015-present
Evolutionary Computing, Postgraduate study (Higher Diploma) 2015-2018
Advanced Artificial Intelligence, Postgraduate study (Master) 2019-2020
Research Methodology, Postgraduate study (Master) 2020-2021
Machine Learning, Postgraduate study (Higher Diploma) 2020-2023
Advanced Artificial Intelligence, Postgraduate study (Master) 2023-2024
Nowadays, information systems constitute a crucial part of organizations; by losing security, these organizations will lose plenty of competitive advantages as well. The core point of information security (InfoSecu) is risk management. There are a great deal of research works and standards in security risk management (ISRM) including NIST 800-30 and ISO/IEC 27005. However, only few works of research focus on InfoSecu risk reduction, while the standards explain general principles and guidelines. They do not provide any implementation details regarding ISRM; as such reducing the InfoSecu risks in uncertain environments is painstaking. Thus, this paper applied a genetic algorithm (GA) for InfoSecu risk reduction in uncertainty. Finally, the ef
... Show MoreSensibly highlighting the hidden structures of many real-world networks has attracted growing interest and triggered a vast array of techniques on what is called nowadays community detection (CD) problem. Non-deterministic metaheuristics are proved to competitively transcending the limits of the counterpart deterministic heuristics in solving community detection problem. Despite the increasing interest, most of the existing metaheuristic based community detection (MCD) algorithms reflect one traditional language. Generally, they tend to explicitly project some features of real communities into different definitions of single or multi-objective optimization functions. The design of other operators, however, remains canonical lacking any inte
... Show MoreOptimization is essentially the art, science and mathematics of choosing the best among a given set of finite or infinite alternatives. Though currently optimization is an interdisciplinary subject cutting through the boundaries of mathematics, economics, engineering, natural sciences, and many other fields of human Endeavour it had its root in antiquity. In modern day language the problem mathematically is as follows - Among all closed curves of a given length find the one that closes maximum area. This is called the Isoperimetric problem. This problem is now mentioned in a regular fashion in any course in the Calculus of Variations. However, most problems of antiquity came from geometry and since there were no general methods to solve suc
... Show MoreRecently Genetic Algorithms (GAs) have frequently been used for optimizing the solution of estimation problems. One of the main advantages of using these techniques is that they require no knowledge or gradient information about the response surface. The poor behavior of genetic algorithms in some problems, sometimes attributed to design operators, has led to the development of other types of algorithms. One such class of these algorithms is compact Genetic Algorithm (cGA), it dramatically reduces the number of bits reqyuired to store the poulation and has a faster convergence speed. In this paper compact Genetic Algorithm is used to optimize the maximum likelihood estimator of the first order moving avergae model MA(1). Simulation results
... Show MoreSteganography is a useful technique that helps in securing data in communication using different data carriers like audio, video, image and text. The most popular type of steganography is image steganography. It mostly uses least significant bit (LSB) technique to hide the data but the probability of detecting the hidden data using this technique is high. RGB is a color model which uses LSB to hide the data in three color channels, where each pixel is represented by three bytes to indicate the intensity of red, green and blue in that pixel. In this paper, steganography based RGB image is proposed which depends on genetic algorithm (GA). GA is used to generate random key that represents the best ordering of secret (image/text) blocks to b
... Show MoreThe main intention of this study was to investigate the development of a new optimization technique based on the differential evolution (DE) algorithm, for the purpose of linear frequency modulation radar signal de-noising. As the standard DE algorithm is a fixed length optimizer, it is not suitable for solving signal de-noising problems that call for variability. A modified crossover scheme called rand-length crossover was designed to fit the proposed variable-length DE, and the new DE algorithm is referred to as the random variable-length crossover differential evolution (rvlx-DE) algorithm. The measurement results demonstrate a highly efficient capability for target detection in terms of frequency response and peak forming that was isola
... Show MorePalm vein recognition technology is a one of the most effective biometric technologies for personal identification. Palm acquisition techniques are either contact-based or contactless-based. The contactless-based palm vein system is considered more accurate and efficient when used in modern applications, but it may suffer from problems like pose variations and the delay in the matching process. This paper proposes a contactless-based identification system for palm vein that involves two main steps; First, the central region of the palm is cropped using fast extract region of interest algorithm, then the features are extracted and classified using altered structure of Residual Attention Network, which is a developed version of convolution
... Show MoreThe industrial factory is one of the challenging environments for future wireless communication systems, where the goal is to produce products with low cost in short time. This high level of network performance is achieved by distributing massive MIMO that provides indoor networks with joint beamforming that enhances 5G network capacity and user experience as well. Judging from the importance of this topic, this study introduces a new optimization problem concerning the investigation of multi-beam antenna (MBA) coverage possibilities in 5G network for indoor environments, named Base-station Beams Distribution Problem (BBDP). This problem has an extensive number of parameters and constrains including user’s location, required d
... Show MoreComplex detection in protein-protein interaction (PPI) networks is one of the major issues facing scientific study in biological networks. In PPINs, proteins are distributed differently as groups (complexes). These groups can be identified as having a great internal density in the number of edges inside the groups while having the least possible number of edges between these groups. The most common methods for finding such complexes are evolutionary algorithms (EAs), which have been used widely in literature for this objective. Despite the reliability of these complicated detection models, they are mostly based on topological (graph) qualities, and the biological implications of the PPI networks have been rarely explored. In thi
... Show MoreWithin the framework of big data, energy issues are highly significant. Despite the significance of energy, theoretical studies focusing primarily on the issue of energy within big data analytics in relation to computational intelligent algorithms are scarce. The purpose of this study is to explore the theoretical aspects of energy issues in big data analytics in relation to computational intelligent algorithms since this is critical in exploring the emperica aspects of big data. In this chapter, we present a theoretical study of energy issues related to applications of computational intelligent algorithms in big data analytics. This work highlights that big data analytics using computational intelligent algorithms generates a very high amo
... Show MoreThe continuous increases in the size of current telecommunication infrastructures have led to the many challenges that existing algorithms face in underlying optimization. The unrealistic assumptions and low efficiency of the traditional algorithms make them unable to solve large real-life problems at reasonable times.
The use of approximate optimization techniques, such as adaptive metaheuristic algorithms, has become more prevalent in a diverse research area. In this paper, we proposed the use of a self-adaptive differential evolution (jDE) algorithm to solve the radio network planning (RNP) problem in the context of the upcoming generation 5G. The experimental results prove the jDE with best vecto
The majority of real-world problems involve not only finding the optimal solution, but also this solution must satisfy one or more constraints. Differential evolution (DE) algorithm with constraints handling has been proposed to solve one of the most fundamental problems in cellular network design. This proposed method has been applied to solve the radio network planning (RNP) in the forthcoming 5G Long Term Evolution (5G LTE) wireless cellular network, that satisfies both deployment cost and energy savings by reducing the number of deployed micro base stations (BSs) in an area of interest. Practically, this has been implemented using constrained strategy that must guarantee good coverage for the users as well. Three differential evolution
... Show MoreA new Differential Evolution (ARDE) algorithm is introduced that automatically adapt a repository of DE strategies and parameters adaptation schemes of the mutation factor and the crossover rate to avoid the problems of stagnation and make DE responds to a wide range of function characteristics at different stages of the evolution. ARDE algorithm makes use of JADE strategy and the MDE_pBX parameters adaptive schemes as frameworks. Then a new adaptive procedure called adaptive repository (AR) has been developed to select the appropriate combinations of the JADE strategies and the parameter control schemes of the MDE_pBX to generate the next population based on their fitness values. Experimental results have been presented to confirm the reli
... Show MoreMost heuristic search method's performances are dependent on parameter choices. These parameter settings govern how new candidate solutions are generated and then applied by the algorithm. They essentially play a key role in determining the quality of the solution obtained and the efficiency of the search. Their fine-tuning techniques are still an on-going research area. Differential Evolution (DE) algorithm is a very powerful optimization method and has become popular in many fields. Based on the prolonged research work on DE, it is now arguably one of the most outstanding stochastic optimization algorithms for real-parameter optimization. One reason for its popularity is its widely appreciated property of having only a small number of par
... Show MoreA new modified differential evolution algorithm DE-BEA, is proposed to improve the reliability of the standard DE/current-to-rand/1/bin by implementing a new mutation scheme inspired by the bacterial evolutionary algorithm (BEA). The crossover and the selection schemes of the DE method are also modified to fit the new DE-BEA mechanism. The new scheme diversifies the population by applying to all the individuals a segment based scheme that generates multiple copies (clones) from each individual one-by-one and applies the BEA segment-wise mechanism. These new steps are embedded in the DE/current-to-rand/bin scheme. The performance of the new algorithm has been compared with several DE variants over eighteen benchmark functions including sever
... Show MoreSignal denoising is directly related to sample estimation of received signals, either by estimating the equation parameters for the target reflections or the surrounding noise and clutter accompanying the data of interest. Radar signals recorded using analogue or digital devices are not immune to noise. Random or white noise with no coherency is mainly produced in the form of random electrons, and caused by heat, environment, and stray circuitry loses. These factors influence the output signal voltage, thus creating detectable noise. Differential Evolution (DE) is an effectual, competent, and robust optimisation method used to solve different problems in the engineering and scientific domains, such as in signal processing. This paper looks
... Show MoreIn this paper, a compact genetic algorithm (CGA) is enhanced by integrating its selection strategy with a steepest descent algorithm (SDA) as a local search method to give I-CGA-SDA. This system is an attempt to avoid the large CPU time and computational complexity of the standard genetic algorithm. Here, CGA dramatically reduces the number of bits required to store the population and has a faster convergence. Consequently, this integrated system is used to optimize the maximum likelihood function lnL(φ1, θ1) of the mixed model. Simulation results based on MSE were compared with those obtained from the SDA and showed that the hybrid genetic algorithm (HGA) and I-CGA-SDA can give a good estimator of (φ1, θ1) for the ARMA(1,1) model. Anot
... Show MoreThis paper presents a hybrid genetic algorithm (hGA) for optimizing the maximum likelihood function ln(L(phi(1),theta(1)))of the mixed model ARMA(1,1). The presented hybrid genetic algorithm (hGA) couples two processes: the canonical genetic algorithm (cGA) composed of three main steps: selection, local recombination and mutation, with the local search algorithm represent by steepest descent algorithm (sDA) which is defined by three basic parameters: frequency, probability, and number of local search iterations. The experimental design is based on simulating the cGA, hGA, and sDA algorithms with different values of model parameters, and sample size(n). The study contains comparison among these algorithms depending on MSE value. One can conc
... Show MoreThe increasing availability of computing power in the past two decades has been use to develop new techniques for optimizing solution of estimation problem. Today's computational capacity and the widespread availability of computers have enabled development of new generation of intelligent computing techniques, such as our interest algorithm, this paper presents one of new class of stochastic search algorithm (known as Canonical Genetic' Algorithm ‘CGA’) for optimizing the maximum likelihood function strategy is composed of three main steps: recombination, mutation, and selection. The experimental design is based on simulating the CGA with different values of are compared with those of moment method. Based on MSE value obtained from bot
... Show MoreThe research deals with an evolutionary-based mutation with functional annotation to identify protein complexes within PPI networks. An important field of research in computational biology is the difficult and fundamental challenge of revealing complexes in protein interaction networks. The complex detection models that have been developed to tackle challenges are mostly dependent on topological properties and rarely use the biological properties of PPI networks. This research aims to push the evolutionary algorithm to its maximum by employing gene ontology (GO) to communicate across proteins based on biological information similarity for direct genes. The outcomes show that the suggested method can be utilized to improve the
... Show More