Due to the easily access to the satellite images, Google Earth (GE) images have become more popular than other online virtual globes. However, the popularity of GE is not an indication of its accuracy. A considerable amount of literature has been published on evaluating the positional accuracy of GE data; however there are few studies which have investigated the subject of improving the GE accuracy. In this paper, a practical method for enhancing the horizontal positional accuracy of GE is suggested by establishing ten reference points, in University of Baghdad main campus, using different Global Navigation Satellite System (GNSS) observation techniques: Rapid Static, Post-Processing Kinematic, and Network. Then, the GE image for the study

Purpose: The concept of complete street is one of the modern trends concerned with diversifying means of transportation and reducing the disadvantages of mechanical transportation modes. This paper discusses the role of complete streets can play in developing the urban environment in the Alyarmok District of Baghdad.   Method/design/approach: The linear regression method used to analyze the opinions of 100 respondents surveyed in the study area in order to find the relationship between the urban environment and the complete street elements.   Theoretical framework: The Modern trends in urban planning aim to find alternatives to the policies of traditional transportation planning that focus on vehicular mobi

Implementation of TSFS (Transposition, Substitution, Folding, and Shifting) algorithm as an encryption algorithm in database security had limitations in character set and the number of keys used. The proposed cryptosystem is based on making some enhancements on the phases of TSFS encryption algorithm by computing the determinant of the keys matrices which affects the implementation of the algorithm phases. These changes showed high security to the database against different types of security attacks by achieving both goals of confusion and diffusion.

KE Sharquie, AA Noaimi, Glob Dermatol, 2014 - Cited by 6

Botnet detection develops a challenging problem in numerous fields such as order, cybersecurity, law, finance, healthcare, and so on. The botnet signifies the group of co-operated Internet connected devices controlled by cyber criminals for starting co-ordinated attacks and applying various malicious events. While the botnet is seamlessly dynamic with developing counter-measures projected by both network and host-based detection techniques, the convention techniques are failed to attain sufficient safety to botnet threats. Thus, machine learning approaches are established for detecting and classifying botnets for cybersecurity. This article presents a novel dragonfly algorithm with multi-class support vector machines enabled botnet

Isradipine belong to dihydropyridine (DHP) class of calcium channel blockers (CCBs). It is  used in the treatment of hypertension, angina pectoris, in addition to Parkinson disease. It goes under the BCS class II drug (low solubility-high permeability). The drug will experience extensive first-pass metabolism in liver, therefore, oral bio-availability will be approximately15 to 24 %.

 The aim of this study was to formulate and optimize a stable  nanoparticles of a highly hydrophobic drug, isradipine by anti-solvent microprecipitation Method to achieve the higher in vitro dissolution rate, so that it will be absorbed by intestinal lymphatic transport in order to avoid hepatic first-pass metabolism&nbs

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app