Diabetic kidney disease is an illness of the glomerulus that interferes with the glomerular filtration barrier (GFB), which is worked to enable kidney to selective purification of water and solutes in addition to limiting the movement of large macromolecules such as albumin. In the glomerular endothelium, mesangial cells, foot cells, and the brush border of the proximal tubules, ACE-2 is expressed and that the kidneys represent the highest-expressing region of this enzyme. Thus, the current study aimed to evaluate ACE-2 level in this case compared to healthy condition. The study Conducted with 120 male and female ranging in age (30-65) years old. Ninety patients with type 2 diabetes subdivided into three groups on the basis of A

Anchusa strigosa L.: Hardy annual biennial or perennial herb, with hairs especially on the leaves., flowers generally regular. Commonly named (Lisan Althour) in Iraq, from Boraginaceae family. The plant contains phenolic acids, flavonoids, alkaloids, sterols, and terpenoids. The Whole plant part defatted with n-hexane for 24 hours. The defatted plant material extracted using absolute methanol by Soxhlet apparatus for 24 hours, the extract fractionated by solvents of different polarity: petroleum ether- chloroform - ethylacetate- and n-butanol respectively. The n-butanol fraction hydrolyzed with 10% HCl for 5 hours by reflex to break down the glycosidic linkage. Rosmarinic acid, caffeic acid, genistein, and silybin were isolated

A novel method for Network Intrusion Detection System (NIDS) has been proposed, based on the concept of how DNA sequence detects disease as both domains have similar conceptual method of detection. Three important steps have been proposed to apply DNA sequence for NIDS: convert the network traffic data into a form of DNA sequence using Cryptography encoding method; discover patterns of Short Tandem Repeats (STR) sequence for each network traffic attack using Teiresias algorithm; and conduct classification process depends upon STR sequence based on Horspool algorithm. 10% KDD Cup 1999 data set is used for training phase. Correct KDD Cup 1999 data set is used for testing phase to evaluate the proposed method. The current experiment results sh

Throughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise closure topological spaces, fibrewise wake topological spaces, fibrewise strong topological spaces over B. Also, we introduce the concepts of fibrewise w-closed (resp., w-coclosed, w-biclosed) and w-open (resp., w-coopen, w-biopen) topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.

The family Ormyridae has been very much neglected by workers and only two species has been recorded so far from Iraq. The present study, based mainly on my collection, deals with five species, of which one is new to science. The new species is described together with notes on locality data, host records, distribution and taxonomical remarks for all the species.

Throughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.

Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if  for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi