نتایج جستجو برای: 2005 by using two well

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

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

the present study was an attempt to determine the types of motivation and levels of foreign language learning anxiety among efl students studying at azad and state universities in kermanshah and to determine the relationship between these two factors and language proficiency and gender. to this end, the foreign language learning motivation scale, by deci and ryan )1985(, were administered to 12...

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

abstract the current study examined the role of emotional intelligence and motivation on language learning of efl learners in iranian context. the participants of this study were 162 female and 100 male junior high school students. these participants were selected by convenient sampling method. to carry out the study two questionnaires were administered to the participants. first, the adap...

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

a novel and ultra low cost isfet electrode and measurement system was designed for isfet application and detection of hydronium, hydrazinium and potassium ions. also, a measuring setup containing appropriate circuits, suitable analyzer (advantech board), de noise reduction elements, cooling system and pc was used for controlling the isfet electrode and various characteristic measurements. the t...

2011
Jean-Sylvain Liénard Claude Barras François Signol

When two speech signals are mixed in a single channel the voiced parts of any of them remain mostly unaltered during the voicing interruptions of the other, i.e. pauses and voiceless consonants. The mixture is made of 3 types of multivoiced segments noted 0V (unvoiced), 1V (one voicing) and 2V (two voicings). A statistical study of readaloud texts reveals that total time spent in the 1V state i...

2012
Antoine Thomas Aïda Ouangraoua Jean-Stéphane Varré

We address the problem of reconstructing a non-duplicated ancestor to a partially duplicated genome in a model where duplicated content is caused by several tandem duplications throughout its evolution and the only allowed rearrangement operations are DCJ. As a starting point, we consider a variant of the Genome Halving Problem, aiming at reconstructing a tandem duplicated genome instead of the...

Journal: :J. Informetrics 2008
Leo Egghe

General results on transformations on information production processes (IPPs), involving transformations of the h-index and related indices, are applied in concrete, simple cases: doubling the production per source, doubling the number of sources, doubling the number of sources but halving their production, halving the number of sources but doubling their production (fusion of sources) and, fin...

Journal: :Finite Fields and Their Applications 2009
Josep M. Miret Ramiro Moreno Jordi Pujolàs Anna Rio

Article history: Received 12 December 2007 Available online 16 June 2009 Communicated by James W. P. Hirschfeld

Journal: :CoRR 2012
Tanya Khovanova Dai Yang

In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.

Journal: :CoRR 2008
Heidi Gebauer

We study the following Maker/Breaker game. Maker and Breaker take turns in choosing vertices from a given n-uniform hypergraph F , with Maker going first. Maker’s goal is to completely occupy a hyperedge and Breaker tries to avoid this. Beck conjectures that if the maximum neighborhood size of F is at most 2 then Breaker has a winning strategy. We disprove this conjecture by establishing an n-u...

Journal: :Arch. Math. Log. 2012
Jakob Kellner Saharon Shelah

A. For f , g ∈ ω let c∀f ,g be the minimal number of uniform g-splitting trees needed to cover the uniform f -splitting tree, i.e., for every branch ν of the f -tree, one of the g-trees contains ν. Let c∃f ,g be the dual notion: For every branch ν, one of the g-trees guesses ν(m) infinitely often. We show that it is consistent that c∃fǫ ,gǫ = c ∀ fǫ ,gǫ = κǫ for continuum many pairwise d...

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

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