Background: Non-traumatic Intracerebral Hemorrhage (ICH) results from rupture of blood vessels in the brain. ICH categories can also be considered as being either lobar in location or within the deep white matter. Although hypertension is a major risk factor for ICH in general[11], it is commonly considered to be associated more with patients having deep than with those having lobar haemorrhage.
Objectives: We investigate the relationship between hypertension and deep versus lobar intracerebral hemorrhage (ICH).
Methods: a retrospective review of records of 163 patients aged 18-89 years admitted to Al-Kadhimiya Teaching Hospital (January 2008 - October 2010) and diagnosed with ICH.
Results: There was no significant relationship between hypertension in deep versus lobar intracerebral hemorrhage (p=0.814)
Conclusions: Although the relation between hypertension and ICH was not found to be significant, our study suggests and recommends age-appropriate investigations for patients with ICH, as well as the need to promote patients’ education with regards to this disease and the importance of adherence to treatment of risk factors.
In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise near topological spaces over B. Also, we introduce the concepts of fibrewise near closed and near open topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.
In this paper, we generalized the principle of Banach contractive to the relative formula and then used this formula to prove that the set valued mapping has a fixed point in a complete partial metric space. We also showed that the set-valued mapping can have a fixed point in a complete partial metric space without satisfying the contraction condition. Additionally, we justified an example for our proof.
In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr
... Show MoreComputer theoretical study has been carried out on the design of five electrode immersion electrostatic lens used in electron gun application. The finite element method (FEM) is used in the solution of the Poisson's equation fro determine axial potential distribution, the electron trajectory under Zero magnification condition . The optical properties : focal length ,spherical and chromatic aberrations are calculated,From studying the properties of the designed electron gun. we have good futures for these electron gun where are abeam current 4*10-4A can be supplied by using cathode tip of radius 100 nm.
This paper aims to study the quaternary classical continuous optimal control problem consisting of the quaternary nonlinear parabolic boundary value problem, the cost function, and the equality and inequality constraints on the state and the control. Under appropriate hypotheses, it is demonstrated that the quaternary classical continuous optimal control ruling by the quaternary nonlinear parabolic boundary value problem has a quaternary classical continuous optimal control vector that satisfies the equality constraint and inequality state and control constraint. Moreover, mathematical formulation of the quaternary adjoint equations related to the quaternary state equations is discovered, and then the weak form of the quaternary adjoint
... Show MoreGangyong Lee, S.Tariq Rizvi, and Cosmin S.Roman studied Rickart modules.
The main purpose of this paper is to develop the properties of Rickart modules .
We prove that each injective and prime module is a Rickart module. And we give characterizations of some kind of rings in term of Rickart modules.
In this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).
The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.
Let R be a commutative ring with identity and let M be a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of semi-essential submodules which introduced by Ali S. Mijbass and Nada K. Abdullah, and we make simple changes to the definition relate with the zero submodule, so we say that a submodule N of an R-module M is called semi-essential, if whenever N ∩ P = (0), then P = (0) for each prime submodule P of M. Various properties of semi-essential submodules are considered.
The focus of this research lies in the definition of an important aspect of financial development, which is reflected on the alleviation of poverty in Iraq, namely financial inclusion and then taking the path of achieving a sustainable economy, certainly after reviewing one of the important international experiences in this regard and finally measuring the level of financial inclusion in Iraq and its impact on poverty reduction through the absolute poverty line indicator.
The searching process using a binary codebook of combined Block Truncation Coding (BTC) method and Vector Quantization (VQ), i.e. a full codebook search for each input image vector to find the best matched code word in the codebook, requires a long time. Therefore, in this paper, after designing a small binary codebook, we adopted a new method by rotating each binary code word in this codebook into 900 to 2700 step 900 directions. Then, we systematized each code word depending on its angle to involve four types of binary code books (i.e. Pour when , Flat when , Vertical when, or Zigzag). The proposed scheme was used for decreasing the time of the coding pro
... Show More