نتایج جستجو برای: v2 f

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

Journal: :Clinical cancer research : an official journal of the American Association for Cancer Research 2016
Erjian Wang Dana J Nickens Akintunde Bello Reza Khosravan Michael Amantea Keith D Wilner Kourosh Parivar Weiwei Tan

PURPOSE We assessed the effect of baseline patient demographic and disease characteristics on the crizotinib pharmacokinetic parameters oral clearance (CL/F), volume of distribution (V2/F), and area under the curve at steady state (AUCss) following multiple crizotinib 250-mg twice-daily dosing in patients with ALK-positive cancer. EXPERIMENTAL DESIGN A pharmacokinetic model was fit to data fr...

2008
Matthias Uhl

a) Zeigen Sie, dass B := (v1, v2, v3, v4) eine Basis von W := Lin(v1, v2, v3, v4) ist. b) Für f ∈ W definiere D(f) := f ′. Begründen Sie, dass D von W nach W abbildet, und zeigen Sie, dass die Abbildung D : W → W, f 7→ f ′, linear ist. c) Geben Sie die Darstellungsmatrix von D : W → W und D : W → W bezüglich der Basis B von W an. (Dabei ist D(f) := D(D(f)) für f ∈ W .) d) Sei g : (−π, π)→ R, x ...

Journal: :Australasian J. Combinatorics 2012
Nader Jafari Rad Chun-Hung Liu

A Roman dominating function (RDF) on a graph G = (V,E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of an RDF f is the value f(V (G)) = ∑ u∈V (G) f(u). A function f : V (G) → {0, 1, 2} with the ordered partition (V0, V1, V2) of V (G), where Vi = {v ∈ V (G) | f(v) = i} for i = 0...

2008
PIERRE GILLIBERT P. GILLIBERT

We denote by Conc A the semilattice of all compact congruences of an algebra A. Given a variety V of algebras, we denote by Conc V the class of all semilattices isomorphic to Conc A for some A ∈ V. Given V1 and V2 varieties of algebras, the critical point of V1 under V2 is defined as crit(V1;V2) = min{cardD | D ∈ Conc V1 − Conc V2}. Given a finitely generated variety V of modular lattices, we o...

Journal: :CoRR 2014
Hovhannes Tananyan Raffi R. Kamalian

The existence of a partition of the common set of the vertices of two forests into two subsets, when difference of their capacities in the neighbourhood of each vertex of each forest not greater than 2 is proved, and an example, which shows that improvement of the specified constant is impossible is brought. In this paper we continue researches started in [1-2], devoted to locally-balanced part...

Journal: :Math. Program. 2005
Liang Zhao Hiroshi Nagamochi Toshihide Ibaraki

Abstract. Given a system (V, T, f, k), where V is a finite set, T ⊆ V , f : 2 → R is a submodular function and k ≥ 2 is an integer, the general multiway partition problem (MPP) asks to find a k-partition P = {V1, V2, . . ., Vk} of V that satisfies Vi∩T 6= ∅ for all i and minimizes f(V1)+f(V2)+ · · ·+f(Vk), where P is a k-partition of V if (i) Vi 6= ∅, (ii) Vi ∩ Vj = ∅, i 6= j, and (iii) V1 ∪ V2...

2006
DAVID L. WEHLAU

Let Cp denote the cyclic group of order p where p ≥ 3 is prime. We denote by Vn the indecomposable n dimensional representation of Cp over a field F of characteristic p. We compute a set of generators, in fact a SAGBI basis, for the ring of invariants F[V2 ⊕ V2 ⊕ V3]p .

Journal: :Circulation 1956
A BUFALARI D FURBETTA F SANTUCCI P SOLINAS

The negative U wave has been studied in 200 electrocardiograms. Six different types of negativity of the U wave are recognized; a seventh type includes the alterations of the T-U segment. Electro-cardiographic and clinical data are correlated with these changes. Two hypotheses to explain the vairing morphology of the negative U wave are discussed. U NTIL quite recently neither the genesis of th...

2015

Solution: Let G(V,E) denote the graph in question; we construct a new graph H(W,F ) in which an ordinary single particle random walk corresponds to the two particle random walk on G. Take W = V × V = {(v1, v2)|v1, v2 ∈ V } and F = {((v1, v2), (w1, w2))|(v1, w1), (v2, w2) ∈ E}. The idea here is that a uniform random walk on H encodes the state of a two particle random walk on G (in the same way ...

Journal: :Symmetry 2021

Let G be a graph with no isolated vertex and let N(v) the open neighbourhood of v∈V(G). f:V(G)→{0,1,2} function Vi={v∈V(G):f(v)=i} for every i∈{0,1,2}. We say that f is strongly total Roman dominating on if subgraph induced by V1∪V2 has N(v)∩V2≠∅ v∈V(G)\V2. The domination number G, denoted γtRs(G), defined as minimum weight ω(f)=∑x∈V(G)f(x) among all functions G. This paper devoted to study it ...

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

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