نتایج جستجو برای: tp for scrambled wh

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

Journal: :ENGLISH LINGUISTICS 2010

Journal: :Language and speech 1996
S A Jun M Oh

Wh-phrases in Korean are ambiguous due to the lexical ambiguity of "wh" words: wh-pronouns as in a wh-question, or indefinite pronouns as in a yes/no-question. Furthermore, since a wh-word in Korean is in-situ (i.e. not moved to the front of a sentence as in English), wh-questions are not distinguished from echo questions in their surface forms. In this paper, we investigated prosodic character...

2010
Odalric-Ambrym Maillard Rémi Munos

We consider least-squares regression using a randomly generated subspace GP ⊂ F of finite dimension P , where F is a function space of infinite dimension, e.g. L2([0, 1]). GP is defined as the span of P random features that are linear combinations of the basis functions of F weighted by random Gaussian i.i.d. coefficients. In particular, we consider multi-resolution random combinations at all s...

Journal: :International Journal of Computer Applications 2015

2009
JUHA HEINONEN JANG-MEI WU Juha Heinonen Jang-Mei Wu

The decomposition space R3/Wh associated with the Whitehead continuum Wh is not a manifold, but the product (R3/Wh) × Rm is homeomorphic to R3+m for any m ≥ 1 (known since the 1960’s). We study the quasisymmetric structure on (R3/Wh) × Rm and show that the space (R3/Wh) × Rm may be equipped with a metric resembling R3+m geometrically and measure theoretically—it is linearly locally contractible...

2000
George K. Mikros George Carayannis

$EVWUDFW 7KH DLP RI WKLV SDSHU LV WR H[SORUH WKH ZD\ LQ ZKLFK GLIIHUHQW NLQG RI OLQJXLVWLF YDULDEOHV FDQ EH XVHG LQ RUGHU WR GLVFULPLQDWH WH[W W\SH LQ SUHFODVVLILHG SUHVV WH[WV 0RGHUQ *UHHN 0* ODQJXDJH GXH WR LWV SDVW GLJORVVLF VWDWXV H[KLELWV H[WHQGHG YDULDWLRQ LQ ZULWWHQ WH[WV DFURVV DOO OLQJXLVWLF OHYHOV DQG FDQ EH H[SORLWHG LQ WH[W FDWHJRUL]DWLRQ WDVNV 7KH UHVHDUFK SUHVHQWHG XVHG 'LVFULPLQD...

2007
Szabolcs Nagy Zoltán Petres Péter Baranyi

The Tensor Product model transformation is a numerical method that is capable of uniformly transforming LPV (linear parameter-varying) dynamic models into polytopic forms, both in a theoretical and algorithmic context. Using the TP model transformation, different optimization and convexity constraints can be considered, and transformations can be executed without any analytical interactions, wi...

2003
Sandra Stjepanović

Given this state of affairs, two question immediately arise: what exactly are the positions to which Wh-phrases are moving and what the driving force behind this movement is. Rudin (1988) argues that the Wh-phrase which is the first in the linear order moves to SpecCP, while others are adjoined to IP. The movement of the first Wh-phrase can be taken to be an instance of familiar Wh-movement to ...

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

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