نتایج جستجو برای: 18 f dg petct petct
تعداد نتایج: 641213 فیلتر نتایج به سال:
It is a pleasure to introduce the 3rd in the series of Thematic Issues on organo-fluorine chemistry for the Beilstein Journal of Organic Chemistry (BJOC). These series have become progressively more successful over time in terms of the number and quality of the contributions received. It is also pleasing to note that the profile and impact factor of the journal has increased steadily over this ...
We report on a first-principles study of the troilite phase of iron sulfide (FeS). We show that even if, a few decades ago, this material was thought to be ferroelectric, the structural transition from the high P6_{3}/mmc to the low P6[over ¯]2c symmetry phase does not involve polar instabilities, though the space inversion center symmetry is broken. Our calculations and symmetry analysis never...
Primer extension studies have shown that the Y-family DNA polymerase IV (Dpo4) from Sulfolobus solfataricus P2 can preferentially insert C opposite N-(deoxyguanosin-8-yl)-2-acetylaminofluorene (AAF-dG) [F. Boudsocq, S. Iwai, F. Hanaoka and R. Woodgate (2001) Nucleic Acids Res., 29, 4607-4616]. Our goal is to elucidate on a structural level how AAF-dG can be harbored in the Dpo4 active site oppo...
LetG be a simple connected graph such that δ(G) ≥ 3. For every function f : V (G) → {1, 2}, where x∈V (G) f(x) is even, the square graph G has an f -factor. All graphs considered are assumed to be simple and finite. We refer the reader to [2] for standard graph theoretic terms not defined in this paper. Let G be a graph. The degree dG(u) of a vertex u in G is the number of edges of G incident w...
For sufficiently differentiable univariate functions f, g and their composite h = g(f) we prove that dg(f(x)) df(x)n = n ∑
Let G be a 2-connected claw-free graph such that δ(G) ≥ 5. Then for every function f : V (G) → {1, 2}, where x∈V (G) f(x) is even, G has an f -factor. All graphs considered are assumed to be simple and finite. We refer the reader to [1] for standard graph theoretic terms not defined in this paper. Let G be a graph. The degree dG(u) of a vertex u in G is the number of edges of G incident with u....
Most cancer deaths are a consequence of resistance to conventional chemotherapy and radiation therapy. This may be attributable to unique phenotypic characteristics of solid tumors. We have exploited two well-described characteristics of solid tumors commonly associated with treatment failure, high glucose use and hypoxia, to design a unique therapy based on the selective accumulation of two cy...
The present thesis is focused on the development and application of narrow scanned high energy photon beams for radiation therapy. The introduction of physically and biologically optimized intensity modulated radiation therapy (IMRT) requires a flexible and accurate dose delivery method to maximize the treatment outcome. Narrow scanned photon beams is a fast option for IMRT since it is not depe...
and Applied Analysis 3 The following are examples of G-metric spaces. Example 1.8 see 7 . Let R, d be the usual metric space. Define Gs by Gs ( x, y, z ) d ( x, y ) d ( y, z ) d x, z , 1.4 for all x, y, z ∈ R. Then it is clear that R, Gs is a G-metric space. Example 1.9 see 7 . Let X {a, b}. Define G on X ×X ×X by G a, a, a G b, b, b 0, G a, a, b 1, G a, b, b 2 1.5 and extend G to X ×X ×X by us...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید