نتایج جستجو برای: b lock e xogeneity

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

1999
Wenbo Mao

Rivest et al proposed a time-lock puzzle scheme for encrypting messages which can only be decrypted in the future. Such a puzzle speci es an algorithm for decrypting the message locked in and the speci ed algorithm has a well understood time complexity. However, that time-lock puzzle scheme does not provide a means for one to examine whether a puzzle has been formed in good order. Consequently,...

Journal: :CoRR 2017
Joachim Breitner Chris Smith

Implementing multi-player networked games by broadcasting the player’s input and leŠing each client calculate the game state – a scheme known as lock-step simulation – is an established technique. However, ensuring that every client in this scheme obtains a consistent state is infamously hard and in general requires great discipline from the game programmer. Œe thesis of this report is that in ...

2009
Edmund A. Rossi David M. Goldenberg Thomas M. Cardillo Rhona Stein Chien-Hsing Chang

The dock and lock (DNL) method is a new technology for generating multivalent antibodies. Here, we report in vitro and in vivo characterizations of 20-22 and 22-20, a pair of humanized hexavalent antiCD20/22 bispecific antibodies (bsAbs) derived from veltuzumab (v-mab) and epratuzumab (e-mab). The 22-20 was made by site-specific conjugation of e-mab to 4 Fabs of v-mab; 20-22 is of the opposite ...

2013
Megan E. Probyn Emma-Kate Lock Stephen T. Anderson Sarah Walton John F. Bertram Mary E. Wlodek Karen M. Moritz

Megan E. Probyn, Emma-Kate Lock, Stephen T. Anderson, Sarah Walton, John F. Bertram, Mary E. Wlodek, and Karen M. Moritz School of Biomedical Sciences, The University of Queensland, St. Lucia, Queensland, Australia; Department of Anatomy and Developmental Biology, Monash University, Clayton, Victoria, Australia; and Department of Physiology, The University of Melbourne, Parkville, Victoria, Aus...

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

هدف این پایان نامه بررسی فشردگی ضعیف عملگرهای به طور ضعیف b-فشرده است. ابتدا عملگرهای به طور ضعیف b-فشرده را تعریف کرده و نشان می دهیم که فضای عملگر های به طور ضعیف فشرده از e به x یک زیرفضای عملگرهای به طور ضعیف b-فشرده از e به x است. در ادامه فشردگی ضعیف عملگرهای به طور ضعیف b-فشرده را بررسی خواهیم کرد و با یک مثال نقض نشان خواهیم داد که یک عملگر به طور ضعیف b-فشرده، لزوماً یک عملگر به طور ضعی...

2015
Goetz Graefe Hideaki Kimura

B-trees have been ubiquitous for decades; and over the past 20 years, record-level locking has been ubiquitous in b-tree indexes. There are multiple designs, each a different tradeoff between (i) high concurrency and a fine granularity of locking for updates, (ii) efficient coarse locks for equality and range queries, (iii) run time efficiency with the fewest possible invocations of the lock ma...

Journal: :Jurnal Elektro dan Telekomunikasi Terapan 2017

1997
MERRILEE A. HURN NUALA A. SHEEHAN

Markov chain Monte Carlo methods are widely used to study highly structured stochastic systems. However when the system is subject to constraints, it is difficult to find irreducible proposal distributions. We suggest a “block-wise” approach for constrained sampling and optimisation.

Journal: :The Journal of biological chemistry 2013
Rabia U Malik Michael Ritt Brian T DeVree Richard R Neubig Roger K Sunahara Sivaraj Sivaramakrishnan

Although several recent studies have reported that GPCRs adopt multiple conformations, it remains unclear how subtle conformational changes are translated into divergent downstream responses. In this study, we report on a novel class of FRET-based sensors that can detect the ligand/mutagenic stabilization of GPCR conformations that promote interactions with G proteins in live cells. These senso...

Journal: :IBM Journal of Research and Development 2010
Rahul Agarwal Saddek Bensalem Eitan Farchi Klaus Havelund Yarden Nir-Buchbinder Scott D. Stoller Shmuel Ur Liqiang Wang

potentials in multithreaded programs R. Agarwal S. Bensalem E. Farchi K. Havelund Y. Nir-Buchbinder S. D. Stoller S. Ur L. Wang Concurrent programs are well known for containing errors that are difficult to detect, reproduce, and diagnose. Deadlock is a common concurrency error, which occurs when a set of threads are blocked, due to each attempting to acquire a lock held by another. This paper ...

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

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