نتایج جستجو برای: z2 = 0.3 and f3
تعداد نتایج: 16837521 فیلتر نتایج به سال:
We consider the hash function proposals by Mridul et al. presented at FSE 2005. For the proposed 2n-bit compression functions it is proved that collision attacks require Ω(2) queries of the functions in question. In this note it is shown that with O(2n/3) queries one can distinguish the proposed compression functions from a randomly chosen 2n-bit function with very good probability. Finally we ...
let z2 = {0, 1} and g = (v ,e) be a graph. a labeling f : v → z2 induces an edge labeling f* : e →z2 defined by f*(uv) = f(u).f (v). for i ε z2 let vf (i) = v(i) = card{v ε v : f(v) = i} and ef (i) = e(i) = {e ε e : f*(e) = i}. a labeling f is said to be vertex-friendly if | v(0) − v(1) |≤ 1. the vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. in this paper ...
Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper ...
Let M be a right module over a ring R. In this manuscript, we shall study on a special case of F-inverse split modules where F is a fully invariant submodule of M introduced in [12]. We say M is Z 2(M)-inverse split provided f^(-1)(Z2(M)) is a direct summand of M for each endomorphism f of M. We prove that M is Z2(M)-inverse split if and only if M is a direct...
O-01-01 Nutrition survey on Brazilian school children in Japan YUKA KATO O-01-02 Expected ability for globalization in the field of food and nutrition in Japan YUKA SAITO O-01-03 The carrier formation of faculty members who teach international nursing at university Haruka Yokota O-01-04 The prospect of educational program in International Health and Nursing at national nursing colleges in Japan...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید