Asphalt pavement properties in Iraq are highly affected by elevated summer air temperatures. One of these properties is stiffness (resilient modulus). To explain the effect of air temperatures on stiffness of asphalt concrete, it is necessary to determine the distribution of temperatures through the pavement asphalt concrete layers. In this study, the distribution of pavement temperatures at three depths (2cm,7cm, 10cm) below the pavement surface is determined by using the temperature data logger instrument. A relationship for determining pavement temperature as related to depth and air temperature has been suggested. To achieve the objective of this thesis, the prepared specimens have been tested for indirect tension in accordance with ASTM D4123, using the pnuematic repeated load apparatus, in order to determine the values of resilient modulus at three different temperatures (10, 25, 40) °C. From results of testing, it is observed that the resilient modulus decreases with increase in test temperature by a rate of 8.78×10 Psi/C' for asphalt concrete wearing courses. An increase in optimum asphalt content by 0.1% (by weight of total mixture) causes a decrease in resilient modulus by 22% at a temperature of 40C". A statistical model for the prediction of resilient modulus has been developed depending on mixture variables of: asphalt content, asphalt hinder viscosity, surface area of combined aggregates, air voids of compacted mixture and test temperature.
This study deals with thirty non-insulin dependent diabetes mellitus patients suffering from diabetic nephropathy in addition to twenty five healthy control.Some biochemical parameters were determined in the serum of all subjects enrolled in the study.These parameters are serum glucose,serum urea,serum creatinine,total serum protein and serum albumin.The aim of the present study was to estimate these parameters in diabetic nephropathy patients. The results of the present study revealed a significant increase in glucose,urea and creatinine in patients as compared to controls . Also a significant decrease was found in total serum protein, serum albumin and albumin to globulin ratio (A/G) in patients compared to controls,whi
... Show MoreIn this paper, we introduce the concept of almost Quasi-Frobcnius fuzzy ring as a " " of Quasi-Frobenius ring. We give some properties about this concept with qoutient fuzzy ring. Also, we study the fuzzy external direct sum of fuzzy rings.
Watermarking operation can be defined as a process of embedding special wanted and reversible information in important secure files to protect the ownership or information of the wanted cover file based on the proposed singular value decomposition (SVD) watermark. The proposed method for digital watermark has very huge domain for constructing final number and this mean protecting watermark from conflict. The cover file is the important image need to be protected. A hidden watermark is a unique number extracted from the cover file by performing proposed related and successive operations, starting by dividing the original image into four various parts with unequal size. Each part of these four treated as a separate matrix and applying SVD
... Show MoreWe claim that a proper subact Ṅ have been compactly packed (c.P) in generalization idea of c.P modules to S Acts. whether for all family of prime subact {Pα}(α∈λ) for some β∈λ Pβ ⊇ Ṅ when ∪(α∈λ)Pα, ⊇ N. We refer to an S-Act Ṁ as c.P. if every subact is compactly packed. We study various properties of c.P S-Acts.
The Video effect on Youths Value
In this paper is to introduce the concept of hyper AT-algebras is a generalization of AT-algebras and study a hyper structure AT-algebra and investigate some of its properties. “Also, hyper AT-subalgebras and hyper AT-ideal of hyper AT-algebras are studied. We study on the fuzzy theory of hyper AT-ideal of hyper AT-algebras hyper AT-algebra”. “We study homomorphism of hyper AT-algebras which are a common generalization of AT-algebras.
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