نتایج جستجو برای: اسپینوساد gf 120

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

Journal: :Tissue engineering. Part A 2010
Jody E Nuininga Martin J W Koens Dorien M Tiemessen Egbert Oosterwijk Willeke F Daamen Paul J Geutjes Toin H van Kuppevelt Wout F J Feitz

Tubular type I collagen biomatrices with and without growth factors (GFs) were constructed and evaluated in a rabbit model for critical urethral defects. Porous tubular biomatrices with an inner diameter of 3  mm were prepared using highly purified collagen fibrils and were crosslinked with or without heparin. Heparinized biomatrices were supplemented with the heparin-binding GFs vascular endot...

Journal: :Family medicine 2013
Kevin Foley Marolee Neuberger Mary Noel Deborah Sleight John vanSchagen William Wadland

BACKGROUND AND OBJECTIVES Our nation faces unprecedented challenges in caring for older adults. Geriatricians who provide care and teach geriatrics are underrepresented in the workforce, especially in non-metropolitan communities. In Michigan, geriatricians and geriatrics fellowship (GF) programs are clustered in the Southeast, suggesting that training site demographics may influence fellows' c...

1984
Andrew M. Odlyzko

Given a primitive element g of a finite field GF(q), the discrete logarithm of a nonzero element u ∈ GF(q) is that integer k, 1 ≤ k ≤ q − 1, for which u = g k . The well-known problem of computing discrete logarithms in finite fields has acquired additional importance in recent years due to its applicability in cryptography. Several cryptographic systems would become insecure if an efficient di...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علم و صنعت ایران - دانشکده مهندسی برق 1383

مهمترین عملیات در سیستم رمزنگاری بر مبنای منحنی بیضوی عمل ضرب اسکالر می باشد. به علت پیچیدگی عملیات ضرب اسکالر از لحاظ محاسباتی، در بسیاری از کاربردها، یک سخت افزار جدا برای انجام آن در نظر گرفته می شود. عمل ضرب اسکالر به صورت مجموعه ای از اعمال جمع، ضرب، مجذور و تقسیم در یک میدان محدود تعریف می گردد. در این پایان نامه ابتدا یک ضرب کننده موازی در میدان gf(2) که چند جمله ای غیر قابل تقسیم در آن...

2002
HÉCTOR PAVÉS GERMÁN PEQUEÑO CARLOS BERTRÁN LUIS VARGAS

Héctor Pavés. Marine Biologist and Doctoral Student, Universidad Austral de Chile (UACh). Germán Pequeño. Ph.D., Oregon State University, USA. Professor, Instituto de Zoología “Ernst F. Kilian”, Universidad Austral de Chile. Address: Casilla 567, Valdivia, Chile. e-mail: [email protected] Carlos Bertrán. M.Sc., UACh. Doctor, Universidad de Concepción, Chile. Professor, UACh. Luis Vargas. Marine ...

2007
Gen Takahashi Fumitaka Hoshino Tetsutaro Kobayashi

The computation speed of pairing based cryptosystems is slow compared with the other public key cryptosystems even though several efficient computation algorithms have been proposed. Thus more efficient computation of the Tate pairing is an important research goal. GF (3) multiplication in GF (3) in the pairing algorithm is the greatest consumer of time. Past research concentrated on reducing t...

2017
M. Mohamed Asan Basiri Sandeep K. Shukla

Composite Galois Field GF ((2)) multiplications denote the multiplication with extension field over the ground field GF (2), that are used in cryptography and error correcting codes. In this paper, composite versatile and vector GF ((2)) multipliers are proposed. The proposed versatile GF ((2)) multiplier design is used to perform the GF ((2)) multiplication, where 2 ≤ x ≤ m. The proposed vecto...

2018
Stephanie A. Bora Mary J. Kennett Philip B. Smith Andrew D. Patterson Margherita T. Cantorna

To determine the effect of the microbiota on vitamin D metabolism, serum 25-hydroxyvitamin D(25D), 24,25-dihydroxyvitamin D (24,25D), and 1,25-dihydroxyvitamin D (1,25D) were measured in germ-free (GF) mice before and after conventionalization (CN). GF mice had low levels of 25D, 24,25D, and 1,25D and were hypocalcemic. CN of the GF mice with microbiota, for 2 weeks recovered 25D, 24,25D, and 1...

2002
Jorge Guajardo Thomas Wollinger Christof Paar

This contribution describes new GF (p) multipliers, for p > 2, specially suited for GF (p) multiplication. We construct truth tables whose inputs are the bits of the multiplicand and multiplier and whose output are the bits that represent the modular product. However, contrary to previous approaches, we don’t represent the elements of GF (p) in the normal binary positional system. Rather, we ch...

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

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