نتایج جستجو برای: with adjusted assumption

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

Journal: :SN Comprehensive Clinical Medicine 2022

Abstract Survival (overall, event free, etc.) is the most-used outcome in clinical oncology studies. This study analyzed methodological reporting of survival analysis pediatric leukemia studies, focusing on Cox proportional hazards (PH). We performed a systematic review studies published between 2012 and 2021 five highest-ranking hematology journals. The included had to focus utilize analyses. ...

2009
Kazumasa Nomura Paul Terwilliger

Let K denote a field and let V denote a vector space over K with finite positive dimension. We consider a pair of linear transformations A : V → V and A∗ : V → V that satisfy the following conditions: (i) each of A,A∗ is diagonalizable; (ii) there exists an ordering {Vi} d i=0 of the eigenspaces of A such that A ∗Vi ⊆ Vi−1+Vi+Vi+1 for 0 ≤ i ≤ d, where V−1 = 0 and Vd+1 = 0; (iii) there exists an...

2014
Hongyong Cui Jie Xin Anran Li Lucas Jódar

and Applied Analysis 3 Remark 5. Assumption (13) holds if the system has a unique solution. For brevity, we rewrite system (2)∼(5) in the vector form by introducing W(x, t) = (u(x, t), n(x, t)) and Y(x, t) = (a(x, t), b(x, t)). We denote by E 0 = H 2 ⋂H 1 0 (Ω) × H 1 0 (Ω) the space of vector functionsW(x, t) = (u(x, t), n(x, t)) with norm E0 = {‖u‖ 2 H 2 + ‖n‖ 2 H 1} 1/2 . (14) Similarly, we d...

2011
Bernardo M. David Anderson C. A. Nascimento Rafael Tonicelli

We introduce a general construction of fully simulatable oblivious transfer based on lossy encryption. Furthermore, we extend the common definition of lossy encryption by introducing the notion of computationally lossy encryption. If the cryptosystem used is computationally lossy, our general construction yields oblivious transfer protocols with computational security for both parties. Otherwis...

Journal: :IACR Cryptology ePrint Archive 2015
Michel Abdalla Florian Bourse Angelo De Caro David Pointcheval

Functional encryption is a new paradigm in public-key encryption that allows users to finely control the amount of information that is revealed by a ciphertext to a given receiver. Recent papers have focused their attention on constructing schemes for general functionalities at expense of efficiency. Our goal, in this paper, is to construct functional encryption schemes for less general functio...

2008
Tom H. Koornwinder

This paper builds on the previous paper by the author, where a relationship between Zhedanov’s algebra AW (3) and the double affine Hecke algebra (DAHA) corresponding to the Askey-Wilson polynomials was established. It is shown here that the spherical subalgebra of this DAHA is isomorphic to AW (3) with an additional relation that the Casimir operator equals an explicit constant. A similar resu...

Journal: :Crítica (México D. F. En línea) 2006

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

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