نتایج جستجو برای: clean

تعداد نتایج: 32669  

ژورنال: :پژوهش در پزشکی 0
سیدحسین فخرایی بخش نوزادان، مرکز پزشکی و درمانی کودکان مفید، دانشگاه علوم پزشکی و خدمات بهداشتی- درمانی شهید بهشتی فرزانه نوری

سابقه و هدف: امفالیت یا التهاب و عفونت نسج نرم اطراف ناف یکی از بیماریهای مهم دوران نوزادی است که با خطر بروز سپتی سمی، پریتونیت و عفونت ارگانهای داخلی به دلیل آمبولیهای سپتیک همراه است. جهت بررسی تاثیر استفاده و یا عدم استفاده از الکل (clean cord care) در مراقبت از بندناف نوزادان، مطالعه ای در زایشگاه شهید فیاض بخش کرج در ماههای مرداد تا بهمن 1378 به عمل آوردیم. مواد و روشها: مطالعه حاضر به صو...

H. Haj Seyyed Javadi M. Maleki S. Jamshidvand,

In this paper, we introduce the new notion of strongly J-clean rings associated with polynomial identity g(x) = 0, as a generalization of strongly J-clean rings. We denote strongly J-clean rings associated with polynomial identity g(x) = 0 by strongly g(x)-J-clean rings. Next, we investigate some properties of strongly g(x)-J-clean.

Journal: :Rocky Mountain Journal of Mathematics 2006

2011
Jagjit Singh Jihoon Kwon Youngwook Kim

We track multiple human subjects using ultra-wide band (UWB) radar based on their target signatures. To resolve the correspondence problem, the use of CLEAN algorithm is proposed. Walking two human subjects are measured by UWB radar. The feasibility of classification is investigated using the suggested method.

Journal: :Environmental Science and Pollution Research 2016

H. Haj Seyyed Javadi N. Vahedian Javaheri S. Jamshidvand,

In this paper, we introduce the new notion of n-f-clean rings as a generalization of f-clean rings. Next, we investigate some properties of such rings. We prove that $M_n(R)$ is n-f-clean for any n-f-clean ring R. We also, get a condition under which the denitions of n-cleanness and n-f-cleanness are equivalent.

Journal: :Inf. Process. Lett. 2009
Serge Gaspers Margaret-Ellen Messinger Richard J. Nowakowski Pawel Pralat

We prove a relationship between the Cleaning problem and the Balanced Vertex– Ordering problem, namely that the minimum total imbalance of a graph equals twice the brush number of a graph. This equality has consequences for both problems. On one hand, it allows us to prove the NP-completeness of the Cleaning problem, which was conjectured by Messinger et al. [7]. On the other hand, it also enab...

2015
Volker Freudenthaler Meinhard Seefeldner Silke Groß Ulla Wandinger

Linear depolarization ratios in clean air ranges were measured with POLIS-6 at 355 and 532 nm. The mean deviation from the theoretical values, including the rotational Raman lines within the filter bandwidths, amounts to 0.0005 at 355 nm and to 0.0012 at 532 nm. The mean uncertainty of the measured linear depolarization ratio of clean air is about 0.0005 at 355 nm and about 0.0006 at 532 nm.

Nahid Ashrafi, Zahra Ahmadi,

A ring $R$ with identity is called ``clean'' if $~$for every element $ain R$, there exist an idempotent $e$ and a unit $u$ in $R$ such that $a=u+e$. Let $C(R)$ denote the center of a ring $R$ and $g(x)$ be a polynomial in $C(R)[x]$. An element $rin R$ is called ``g(x)-clean'' if $r=u+s$ where $g(s)=0$ and $u$ is a unit of $R$ and, $R$ is $g(x)$-clean if every element is $g(x)$-clean. In this pa...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید