Slurry-infiltrated fibrous concrete (SIFCON) is a special type of concrete that has great strength, as well as high ductility. However, the unit weight is high, which exceeds the unit weight of fiber-reinforced concrete, because of the high fiber content. This research aims to verify the compressive and flexural strength, as well as the density of SIFCON when using two different fibers (steel and polyolefin). Sometimes mono type of fiber steel or polyolefin, sometimes by hybridizing two types of fiber steel + polyplefin. Volume fraction (6% for all species) was used. Hook-end steel fiber and polyolefin fiber are used. With hybridization, a total volume fraction of 6% was used, which is 2/3 steel fibers with 1/3 polyolefin and vice versa. In addition, silica fume replaced 10% of the weight of cement. After checking all the results, the highest compressive strength was achieved in the SNS (symbol of mix SIFCON with 6% steel fiber) series by 81 MPa, as well as the highest flexural strength by 23 MPa, but it was the highest density of 2,490 kg/m3. The series contained 2/3 polyolefin and 1/3 steel fibers, which are ideal as they significantly reduced the density of the steel fiber series 2,490–2,210 kg/m3, as well as there was no significant reduction in strength as it achieved 67 MPa in the compressive strength and 19 MPa in the flexural strength, which are values suitable for high SIFCON applications.
The petrophysical analysis is very important to understand the factors controlling the reservoir quality and production wells. In the current study, the petrophysical evaluation was accomplished to hydrocarbon assessment based on well log data of four wells of Early Cretaceous carbonate reservoir Yamama Formation in Abu-Amood oil field in the southern part of Iraq. The available well logs such as sonic, density, neutron, gamma ray, SP, and resistivity logs for wells AAm-1, AAm-2, AAm-3, and AAm-5 were used to delineate the reservoir characteristics of the Yamama Formation. Lithologic and mineralogic studies were performed using porosity logs combination cross plots such as density vs. neutron cross plot and M-N mineralogy plot. Thes
... Show MoreThroughout 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.
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