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

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

Journal: :Theor. Comput. Sci. 2003
Artur Czumaj Leszek Gasieniec Daya Ram Gaur Ramesh Krishnamurti Wojciech Rytter Michele Zito

This paper may be viewed as a corrigendum as well as an extension of the paper by (Czumaj et al., Theoret. Comput. Sci. 262 (1–2), (2001) 569–582) where they deal with the variable length scheduling problem (VLSP) with parameters k1; k2, denoted VLSP(k1; k2). In the current paper, we >rst discuss an error in the analysis of one of the approximation algorithms described in (Czumaj et al., Theore...

Journal: :IEEE Trans. Information Theory 2000
Akiko Kato Kenneth Zeger

A binary sequence satisfies a one-dimensional (d; k) run length constraint if every run of zeros has length at least d and at most k. A two-dimensional binary pattern is (d1; k1; d2; k2)-constrained if it satisfies the one-dimensional (d1; k1) run length constraint horizontally and the one-dimensional (d2; k2) run length constraint vertically. For given d1; k1; d2, and k2, the asymmetric two-di...

Journal: :The American journal of physiology 1999
Momono Yoshikawa Shinichi Uchida Atsushi Yamauchi Akiko Miyai Yujiro Tanaka Sei Sasaki Fumiaki Marumo

To gain insight into the physiological role of a kidney-specific chloride channel, CLC-K2, the exact intrarenal localization was determined by in situ hybridization. In contrast to the inner medullary localization of CLC-K1, the signal of CLC-K2 in our in situ hybridization study was highly evident in the superficial cortex, moderate in the outer medulla, and absent in the inner medulla. To ide...

Journal: :Statistics & Probability Letters 2022

We prove the inequality E[(X/μ)k]≤(k/μlog(1+k/μ))k≤exp(k2/(2μ)) for sub-Poissonian random variables X, such as Binomially or Poisson distributed variables, with mean μ. The asymptotic behaviour E[(X/μ)k]=1+O(k2/μ) matches a lower bound of 1+Ω(k2/μ) small k2/μ. This improves over previous uniform raw moment bounds by factor exponential in k.

ژورنال: :مجله دانشگاه علوم پزشکی ایلام 0
مسعود فریدونی masoud fereidoni department of biology, faculty of sciences, ferdowsi university of mashhad, mashhad, iran.گروه زیست شناسی، دانشکده علوم، دانشگاه فردوسی مشهد، مشهد، ایران. فاطمه حجی پور fatemeh hajipoor department of biology, faculty of sciences, ferdowsi university of mashhad, mashhad, iran.گروه زیست شناسی، دانشکده علوم، دانشگاه فردوسی مشهد، مشهد، ایران.

ویتامین k2 (menaquinone-4) یکی از مشتقات ویتامین k است که در نتیجه فعالیت باکتری های روده ای سنتز می شود. حضور این ویتامین در مغز با غلظت بیشتری نسبت به سایر بافت های بدن و توانایی تبدیل سایر مشتقات ویتامین k به نوع k2 در بدن که فرم اصلی آن در سیستم عصبی است، نشان دهنده عملکردهای مهم این ویتامین در سیستم عصبی مرکزی منجمله اهمیت آن در فرآیند میلین سازی و تکوین سیستم عصبی است. ویتامین k2 همچنین ب...

2003
Xuejun Guo Hourong Qin Eva Bayer-Fluckiger

For a number field F , it is proved that the K2-semigroup K2(F,F++) defined in [R.V. Moody, J. Morita, J. Algebra 229 (2000) 1] has similar properties to the positive K2 group K + 2 (F) introduced by Gras in [J. Number Theory 23 (1986) 322].  2003 Elsevier Inc. All rights reserved.

2011
David Kohel

Let E be an elliptic curve, K1 its Kummer curve E/{±1}, E its square product, and K2 the split Kummer surface E /{±1}. The addition law on E gives a large endomorphism ring, which induce endomorphisms of K2. With a view to the practical applications to scalar multiplication on K1, we study the explicit arithmetic of K2.

2012
Yafei Zhang Bicheng Zhang Anran Zhang Yong Zhao Jie Zhao Jian Liu Jianfei Gao Dianchun Fang Zhiguo Rao

OBJECTIVE Sorafenib is an oral multikinase inhibitor that has been proven effective as a single-agent therapy in hepatocellular carcinoma, and there is a strong rationale for investigating its use in combination with other agents. Vitamin K2 is nearly non-toxic to humans and has been shown to inhibit the growth of hepatocellular carcinoma. In this study, we evaluated the effects of a combinatio...

Journal: :BIT 1990
David Eppstein

We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log β(m,n) + k2); for planar graphs this bound can be improved to O(n+ k2). We also show that the k best spanning trees for a set of points in the plane can be computed in time O(min(k2n + n log n, k2 + kn log(n/k))). The k best orth...

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

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