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

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

2007
Klaus Meffert Ilka Philippow

You have an application that reads in configuration data at start-up. Your program consists of multiple threads with similar functionality. Some of the configuration data applies to all threads; the other part of the data applies to individual threads only. The configuration data should be read-only after it has been provided at start-up. This paper introduces the pattern Configuration Provider...

2005
Donna H. Henderson-King Abigail J. Stewart

Social psychological research often relies on measures of group identification in assessing levels o f group consciousness. However, for women, the relationship between gender identification and group consciousness may not be a straightforward one. Questionnaire data were used to examine the relationships between measures of group identity and group evaluations with other attitudinal, phenomeno...

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

as polysemy is encountered frequently in english as foreign language. fl learners’ ability to disambiguate polysemous verbs becomes critical to their comprehension in the target language. this thesis, accordingly, investigated how iranian efl learners achieved comprehension of english polysemous verbs by using three different types of cues: (1) elaborated context, (2) semantic frames, and (...

1998
AttacksAlex Biryukov Eyal Kushilevitz

We present a method for eecient conversion of diierential (chosen-plaintext) attacks into the more practical known-plaintext and ciphertext-only attacks. Our observation may save up to a factor of 2 20 in data over the known methods, assuming that plaintext is ASCII encoded English (or some other types of highly redundant data). We demonstrate the eeectiveness of our method by practical attacks...

Journal: :CoRR 2010
A. C. Cem Say Abuzer Yakaryilmaz

We examine the power of quantum Turing machines (QTM’s) which compute string-valued functions of their inputs using small workspace. A (probabilistic or quantum) Turing machine has three tapes: A read-only input tape, a read/write work tape, and a “1.5-way" write-only output tape. Consider a partial function f : Σ 1 → Σ 2 , where Σ1 and Σ2 are the input and output tape alphabets, respectively. ...

Journal: :Journal of General Internal Medicine 2013

Journal: :Nature Reviews Genetics 2002

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

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