No description available.

Thesis (M. S. in Biomedical Engineering)--Vanderbilt University, May 2007. / Title from title screen. Includes bibliographical references.

Thesis (M.Phil.) - University of Queensland, 2005. / Includes bibliography.

No description available.

No description available.

No description available.

No description available.

<p>The topic of this thesis is the syntax of free relative<br />clauses and specificational pseudoclefts, with the focus on<br />English and Serbian. It offers a unifying analysis for the<br />range of phenomena related to the syntax of free relative<br />clauses in English and Serbian, within a structure sharing,<br />or multi-dominance approach. This approach assumes the<br />existence of a particular type of displacement in syntax,<br />which is referred to as grafting, and argues for its validity<br />on theoretical and empirical ground.<br />It is argued in this thesis that grafting enables a more<br />parsimonious account of a range of phenomena related to<br />the properties of free relatives in both languages.<br />As far as the Serbian data is concerned, it has been shown<br />that the common observation about a less constrained<br />8<br />distribution of FRs in langugages with null subjects is<br />wrong, and the analysis of the relevant data is provided.<br />This thesis also provides an account of specificational<br />pseudoclefts in Serbian &ndash; determining what counts as this<br />type of construction and to what degree it matches the<br />properties of English specificiational pseudoclefts. It has<br />been argued that their derivation involves predicate<br />raising and not the question-plus-deletion analysis.<br />Finally, this work provides an important insight into the<br />nature of clausal predicates inside copular constructions<br />in English and Serbian the key properties that connect<br />them.</p> / <p>Tema ove teze je sintaksa dopunskih nominalnih klauza i<br />neodređenih generalizirajućih zavisnih rečenica u<br />engleskom i srpskom jeziku. Ovaj rad nudi zajedničku<br />analizu niza fenomena koji su karakteristični za dopunske<br />relativne klauze u engleskom i srpskom, u duhu pristupa<br />zajedničkih struktura ili vi&scaron;estruke dominacije. Ovaj<br />pristup pretpostavlja postojanje posebne vrste<br />sintaksickog spajanja konstituenata, koje se naziva i<br />kalemljenjem, a ovaj rad dokazuje njegovu validnost i<br />emprijisku zasnovanost.<br />Glavna teza ovog rada je da kalemljenje omogućava<br />jednostavnije obja&scaron;njenje niza fenomena vezanih za<br />karakterstike dopunskih nominalnih klauza u oba jezika.<br />&Scaron;to se tiče podataka iz srpskog jezika, ova teza pokazuje<br />da je pogre&scaron;na uobičajena konstatacija o slobodnijoj<br />distribuciji dopunskih nominalnih klauza u jezicima sa<br />fonolo&scaron;ki nerealizovanim subjektom, i nudi analizu<br />činjenica koje su u tom pogledu relevantne.<br />Ova teza takođe nudi analizu neodređenih<br />generalizirajućih zavisnih klauza u srpskom jeziku tako<br />&scaron;to defini&scaron;e tip konstrukicje koji se može smatrati ovom<br />vrstom klauze, kao i meru u kojoj ona deli svojstva sa<br />ovim tipom klauza u engleskom jeziku. Ovaj rad<br />obrazlaže za&scaron;to je pomeranje predikata adekvatnija<br />analiza ovih konstrukcija od analize poznate kao pitanje<br />plus brisanje. Konačno, ovaj rad nudi zanimljivo<br />zapažanje u vezi sa prirodom klauza koje imaju funkciju<br />predikata u prostim rečenicama sa glagolom biti.</p>

In this thesis we consider two classes of binary matroids, even cycle matroids and even cut matroids. They are a generalization of graphic and cographic matroids respectively. We focus on two main problems for these classes of matroids. We first consider the Isomorphism Problem, that is the relation between two representations of the same matroid. A representation of an even cycle matroid is a pair formed by a graph together with a special set of edges of the graph. Such a pair is called a signed graph. A representation for an even cut matroid is a pair formed by a graph together with a special set of vertices of the graph. Such a pair is called a graft. We show that two signed graphs representing the same even cycle matroid relate to two grafts representing the same even cut matroid. We then present two classes of signed graphs and we solve the Isomorphism Problem for these two classes. We conjecture that any two representations of the same even cycle matroid are either in one of these two classes, or are related by a local modification of a known operation, or form a sporadic example. The second problem we consider is finding the excluded minors for these classes of matroids. A difficulty when looking for excluded minors for these classes arises from the fact that in general the matroids may have an arbitrarily large number of representations. We define degenerate even cycle and even cut matroids. We show that a 3-connected even cycle matroid containing a 3-connected non-degenerate minor has, up to a simple equivalence relation, at most twice as many representations as the minor. We strengthen this result for a particular class of non-degenerate even cycle matroids. We also prove analogous results for even cut matroids.

Thesis (M.S.)--Mechanical Engineering, Georgia Institute of Technology, 2004. / Dr. David Ku, Committee Chair ; Dr. Raymond Vito, Committee Member ; Dr. Alexander Rachev, Committee Member. Includes bibliographical references (leaves 103-106).