The convergence speed is the most important feature of Back-Propagation (BP) algorithm. A lot of improvements were proposed to this algorithm since its presentation, in order to speed up the convergence phase. In this paper, a new modified BP algorithm called Speeding up Back-Propagation Learning (SUBPL) algorithm is proposed and compared to the standard BP. Different data sets were implemented and experimented to verify the improvement in SUBPL.

The research aims to find out the effect of PEDODE Strategy on the acquisition of historical concepts of First Intermediate Grade. To achieve this goal, the researcher has put forward this zero hypothesis: There is no statistically significant difference at the level of (05,0) between the mean of the students' marks in the experimental group who study the history subject using PEDODE strategy and that of the students' marks in the control group who study the subject according to the traditional method in the post-testing on the acquisition of historical concepts. The sample of the study consists of (62 female-students) of First Intermediate Grade in the Directorate of Baghdad Education/ Karkh2nd for the academic year 2016-2017. The sampl

The present study aimed to determine the genetic divergence of seven maize genotypes (Al-Maha, Sumer, Al-Fajr, Baghdad, 5018, 4 × 1 single hybrid, and 4 × 2 single hybrid) under two varied levels of nitrogen fertilization (92 and 276 kg N ha-1). The experiment occurred in 2022 in a randomized complete block design (RCBD) with a split-plot arrangement and three replications at the College of Agricultural Engineering Sciences, University of Baghdad, Iraq. The nitrogen fertilization levels served as main plots, with the maize genotypes allocated as the subplots. The results revealed that genetic variance was higher than the environmental variance for most traits, and the coefficient of phenotypic variation was close to the genetic va

     Evolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust E

Most of the medical datasets suffer from missing data, due to the expense of some tests or human faults while recording these tests. This issue affects the performance of the machine learning models because the values of some features will be missing. Therefore, there is a need for a specific type of methods for imputing these missing data. In this research, the salp swarm algorithm (SSA) is used for generating and imputing the missing values in the pain in my ass (also known Pima) Indian diabetes disease (PIDD) dataset, the proposed algorithm is called (ISSA). The obtained results showed that the classification performance of three different classifiers which are support vector machine (SVM), K-nearest neighbour (KNN), and Naïve B

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord

 Data Driven Requirement Engineering (DDRE) represents a vision for a shift from the static traditional methods of doing requirements engineering to dynamic data-driven user-centered methods. Data available and the increasingly complex requirements of system software whose functions can adapt to changing needs to gain the trust of its users, an approach is needed in a continuous software engineering process. This need drives the emergence of new challenges in the discipline of requirements engineering to meet the required changes. The problem in this study was the method in data discrepancies which resulted in the needs elicitation process being hampered and in the end software development found discrepancies and could not meet the need

The aim of this paper is to present method for solving ordinary differential equations of eighth order with two point boundary conditions. We propose two-point osculatory interpolation to construct polynomial solution.