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

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

2011
Yaniv Altshuler Vladimir Yanovski

This document contains several corrections and remarks for the Dynamic Cooperative Cleaners problem and for the CLEAN and SWEEP cleaning protocols, which were presented in previous works [1, 2].

2015
Søren Dahlgaard Mathias Bæk Tejs Knudsen Noy Rotbart

We consider ancestry labeling schemes: Given a rooted tree T , assign a binary string (label) to each node, such that given the labels of any two nodes, one can determine whether the first is an ancestor of the second in T . Recently, Fraigniaud and Korman [STOC’10] showed that such labels can be assigned using log n+O(log log n) bits per label, solving a long standing open question and matchin...

2016
Anna Vasileva Doris Schmedding

In diesem Beitrag wird der Zusammenhang zwischen Code-Qualität und UMLModellen in einem Software-Entwicklungsprozess in der Informatik-Ausbildung vorgestellt. Es wird untersucht, welche der im Code sichtbar werdenden Mängel bereits im Modell erkannt werden können. Werkzeuge zur statischen Code-Analyse und Refactoring-Techniken unterstützen die Studierenden beim Entdecken und Beseitigen der Qual...

Journal: :Policy Futures in Education 2012

Let R be an associative ring with unity. An element a in R is said to be r-clean if a = e+r, where e is an idempotent and r is a regular (von Neumann) element in R. If every element of R is r-clean, then R is called an r-clean ring. In this paper, we prove that the concepts of clean ring and r-clean ring are equivalent for abelian rings. Further we prove that if 0 and 1 are the only idempotents...

Journal: :Physical review. D, Particles and fields 1996
Davydychev Osland Tarasov

One-loop off-shell contributions to the three-gluon vertex are calculated, in arbitrary covariant gauge and in arbitrary space-time dimension, including quark-loop contributions (with massless quarks). It is shown how one can get the results for all on-shell limits of interest directly from the general off-shell expression. The corresponding general expressions for the one-loop ghost-gluon vert...

Journal: :bulletin of the iranian mathematical society 2013
n. ashrafi e. nasibi

let r be an associative ring with unity. an element a in r is said to be r-clean if a = e+r, where e is an idempotent and r is a regular (von neumann) element in r. if every element of r is r-clean, then r is called an r-clean ring. in this paper, we prove that the concepts of clean ring and r-clean ring are equivalent for abelian rings. further we prove that if 0 and 1 are the only idempotents...

Journal: :bulletin of the iranian mathematical society 0
n. ashrafi semnan university e. nasibi semnan university

let r be an associative ring with unity. an element a in r is said to be r-clean if a = e+r, where e is an idempotent and r is a regular (von neumann) element in r. if every element of r is r-clean, then r is called an r-clean ring. in this paper, we prove that the concepts of clean ring and r-clean ring are equivalent for abelian rings. further we prove that if 0 and 1 are the only idempotents...

Journal: :The Iowa Review 1999

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

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