Background: Opportunistic viral infections make an important threat to renal transplantation recipients (RTRs), and with the use of more intense newly-developed immunosuppressive drugs; the risk of renal allograft loss due to reactivation of these viruses has increased considerably. At the top priority of these viruses lie BK polyomavirus (BKV) and human cytomegalovirus (CMV). Reactivation of these viruses in these chronically immunosuppressed RTRs can lead to renal impairment and subsequently allograft loss, unless early detected and properly treated. Objectives: The study aimed to detect and quantify plasma viral load of BKV and CMV in RTRs using quantitative real time PCR (qRT-PCR), in order to study the prevalence of these two viruses i
... Show MoreThis paper performance for preparation and identification of six new complexes of a number of transition metals Cr (lII), Mn (I1), Fe (l), Co (II), Ni (I1), Cu (Il) with: N - (3,4,5-Trimethoxy phenyl-N - benzoyl Thiourea (TMPBT) as a bidentet ligand. The prepared complexes have been characterized, identified on the basis of elemental analysis (C.H.N), atomic absorption, molar conductivity, molar-ratio ,pH effect study, I. Rand UV spectra studies. The complexes have the structural formula ML2X3 for Cr (III), Fe (III), and ML2X2 for Mn (II), Ni (II), and MLX2 for Co (Il) , Cu (Il).
The accumulation of construction and demolition waste is one of the major problems in modern construction. Hence, this research investigates the use of waste brick in concrete. Seven different concrete mixes were investigated in this study: a control concrete mix, three mixes with volumetric replacement (10, 20, and 30)% of natural aggregate with brick aggregate, and two mixes with the addition of nano brick powder at a percentage level of 5– 10% by weight of cementitious materials. And the last one was mixed with 10% nano brick and 10% coarse brick aggregate. The experimental results for the additive of nano brick powder showed an enhancement in mechanical properties (compressive,
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 Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show More