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.

Irrigation scheduling techniques is one of the suggested solutions for water scarcity problem. The study aims to show the possibility of using practical and applicable irrigation scheduling program which was designed by Water Resources Department at the University of Baghdad by using Spreadsheet Formulas for Microsoft Excel program, version 2007, with some modification to generalize it and made it applicable to various climatic zone and different soil types, as a salvation for the shortage of irrigation water inside the irrigation projects. Irrigation projects which incidence of Tigris River basin will be taken as an applicable example. This program was based on water budgeting and programmed depending on scientific concepts which facili

During the period October 2003 till July 2004, about (253) urine samples have been collected from urinary tract infection. The study has shown that the bacterium Proteus mirabilis is the responsible for (11.85%) of the urinary tracts infections. Also, the study has declared that the ratio of separation this bacterium from women was (7.51%) and it is higher than the ratio of separation in both men and children which ranged (1. 58%) and (2.76%) respectively . About (30) samples of stool have been collected from children and the ratio of isolation this bacterium has been showen to be( 30%) from children aged bellow 3 years,as well as, we have got bacterial cultures related to P.mirabilis isolated from the infections of middle-ear and b

In the current study, different concentrations of miltefosine drug, which is the first effective and safe oral treatment for visceral leishmaniasis, was evaluated against L. donovani promastigotes in comparison with pentosam drug. Direct counting microscopic assay was used to find 50% inhibitory concentration (IC50) of miltefosine and pentostam against L. donovani promastigotes. The IC50 of miltefosine drug was 45.42μg/ml, 46.76μg/ml and 36.68μg/ml after 24 hr, 48hr and 72hr respectively, In comparison with IC 50 of pentostam drug was 75.39 μg/ml after 72hr. There were significant differences (P˂0.05) between IC50 values of miltefosine and pentostam drugs from first day to third day.

Background : Knee flexors tightness has been documented in apparently healthy adults and in those with musculoskeletal problems, but the influence of age on the tightness has not been studied in Iraq. This study was therefore designed to determine the influence of age on knee flexors tightness in apparently healthy subjects.Methods: Knee flexors tightness was measured using the active knee extension test (AKET) in 200 apparently healthy male and female subjects, aged 13 to 59 years. The subjects were recruited into 5 age groups using the purposive sampling technique.Knee flexors tightness was compared across the age groups using one-way analysis ofvariance (ANOVA). The independent t-test was used to compare knee flexors tightness on both

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