This dissertation consists of five articles about economics of sports. The first three articles investigate various types of outcome uncertainty and how they relate to match attendance demand, while the remaining two articles test the efficiency of sports betting markets. The first article presents a new method of calculating match importance. Unlike the previous approaches in the literature, it does not require ex-post information and can be used for any type of season outcome. The second article shows that the additional playoff stage in the Czech ice hockey "Extraliga" lowers the probability of the strongest team becoming a champion and thus increases seasonal uncertainty. The third article demonstrates that the inconsistent findings in the literature about the link between match uncertainty and attendance could be explained by wrongly specified regressions, proposes a new approach to analyzing the effect of match uncertainty and shows that attendance demand is maximized if teams of the same quality play against each other. The fourth article examines the favorite-longshot bias in the context of betting on tennis matches. It shows that the favorite-longshot bias pattern is consistent with bookmakers protecting themselves against both better informed insiders and the general public exploiting new information. The fifth article investigates the supposedly profitable strategy of betting on soccer draws using the Fibonacci sequence. The strategy is tested both in a simulated market and on a real data set and found to lose money.

3D environment reconstruction has received great interest in recent years in areas such as city planning, virtual tourism and flood hazard warning. With the rapid development of computer technologies, it has become possible and necessary to develop new methodologies and techniques for real time simulation for virtual environments applications. This thesis proposes a novel dynamic simulation scheme for flood hazard warning. The work consists of three main parts: digital terrain modelling; 3D environmental reconstruction and system development; flood simulation models. The digital terrain model is constructed using real world measurement data of GIS, in terms of digital elevation data and satellite image data. An NTSP algorithm is proposed for very large data assessing, terrain modelling and visualisation. A pyramidal data arrangement structure is used for dealing with the requirements of terrain details with different resolutions. The 3D environmental reconstruction system is made up of environmental image segmentation for object identification, a new shape match method and an intelligent reconstruction system. The active contours-based multi-resolution vector-valued framework and the multi-seed region growing method are both used for extracting necessary objects from images. The shape match method is used with a template in the spatial domain for a 3D detailed small scale urban environment reconstruction. The intelligent reconstruction system is designed to recreate the whole model based on specific features of objects for large scale environment reconstruction. This study then proposes a new flood simulation scheme which is an important application of the 3D environmental reconstruction system. Two new flooding models have been developed. The first one is flood spreading model which is useful for large scale flood simulation. It consists of flooding image spatial segmentation, a water level calculation process, a standard gradient descent method for energy minimization, a flood region search and a merge process. The finite volume hydrodynamic model is built from shallow water equations which is useful for urban area flood simulation. The proposed 3D urban environment reconstruction system was tested on our simulation platform. The experiment results indicate that this method is capable of dealing with complicated and high resolution region reconstruction which is useful for many applications. When testing the 3D flood simulation system, the simulation results are very close to the real flood situation, and this method has faster speed and greater accuracy of simulating the inundation area in comparison to the conventional flood simulation models

The performance of commercial Radio Frequency Identification (RFID) tags is primarily limited by present techniques used for tag antenna design. Currently, industry techniques rely on identifying the RFID tag application (books, clothing, etc.) and then building antenna prototypes of different configurations in order to satisfy minimum read range requirements. However, these techniques inherently lack an electromagnetic basis and are unable to provide a low cost solution to the tag antenna design process. RFID tag performance characteristics (read-range, chip-antenna impedance matching, surrounding environment) can be very complex, and a thorough understanding of the RFID tag antenna design may be gained through an electromagnetic approach in order to reduce the tag antenna size and the overall cost of the RFID system. The research presented in this thesis addresses RFID tag antenna design process for passive RFID tags. With the growing number of applications (inventory, supply-chain, pharmaceuticals, etc), the proposed RFID antenna design process demonstrates procedures to design tag antennas for such applications. Electrical/geometrical properties of the antennas designed were investigated with the help of computer electromagnetic simulations in order to achieve optimal tag performance criteria such as read range, chip-impedance matching, antenna efficiency, etc. Experimental results were performed on the proposed antenna designs to compliment computer simulations and analytical modelling.

<p>The aim of the dissertation entitled Topicalization and<br />Left Dislocation in English and Serbian is to describe<br />and offer a generative account of the syntactic and<br />information-structural properties of topicalization and<br />left dislocation in the languages in question, two<br />superficially similar preposing structures which<br />express the same propositions, but are not felicitous in<br />the same context. The analysis is not contrastive in the<br />sense that we are looking for English-Serbian<br />counterparts or vice versa, but the tertium<br />comparationis are the phenomena of topicalization<br />and left dislocation. The fundamental diagnostics of<br />differentiating between the two variants of left<br />dislocation identified in Serbian is laid out, viz.<br />Hanging Topic Left Dislocation and Contrastive Left<br />Dislocation. The dissertation also explores how<br />informational structuring of an utterance determines<br />contextual choices. The lexicon provides the input to<br />the computational system which by means of features<br />builds structure via phases and also gives rise to<br />displacement. The data related to information structure<br />come from the numeration. The results of the research<br />indicate that the notion of a topic should be<br />deconstructed in a combination of the features [+/-<br />a(nchored), +/-c(ontrastive)], similarly to L&oacute;pez<br />(2009), anchored in the sense of Birner &amp; Ward<br />(1998), and contrastive in the pragmatic sense of Titov<br />(2013), whereby [+/-c] is parasitic on [+a].<br />Topicalization in both English and Serbian, and<br />Contrastive Left Dislocation in Serbian mark topics<br />vii<br />[+a, +c], whereas Hanging Topic Left Dislocation<br />HTLD in both English and Serbian marks topic [+a, -<br />c]. It is argued that adding pragmatic features in<br />addition to formal ones relevant to the derivation by<br />the operation which forms the numeration does not<br />offend the Inclusiveness Condition either. The<br />interpretation of an element marked as a topic is the<br />result of its featural content and its syntactic position,<br />reflecting the interaction of syntax, prosody and<br />pragmatics. Pragmatic features are valued but<br />uninterpretable in the numeration rendering the<br />syntactic object containing it active for syntactic<br />operations. Probe (pragmatic) features trigger<br />Agree(ment), but not displacement. It is an edge<br />feature that drives movement or Internal Merge. It is<br />argued that topicalization in both English and Serbian<br />is generated by movement. The edge feature on C<br />(Force) licenses the TopP if it is required for the<br />interpretation and if it is structurally possible, as<br />observed by Jim&eacute;nez-Fern&aacute;ndez &amp; Miyagawa (2014).<br />Unlike in English, the non-phase head T in Serbian<br />can inherit an edge feature from C and license the<br />TopP in the Spec,TP in those structures which are said<br />to be incompatible with topicalization in English. The<br />head licensing the left-dislocated element is realized<br />as comma intonation, as argued by Emonds (2004). It<br />is argued that Hanging Topic Left Dislocation in both<br />English and Serbian is derived by base-generation of<br />the left-dislocated constituent in its surface position<br />(adjoined to a CP), whereas Contrastive Left<br />Dislocation in Serbian by movement (also to a<br />position attached to a CP). What moves is the<br />resumptive pronoun, and then co-reference is<br />established upon adjoining of the left-dislocated<br />element via the operation Match or Match+Agree of<br />Boeckx (2003), which is the only way not to violate<br />the Inclusiveness Condition. Although both<br />Topicalization and Contrastive Left Dislocation mark<br />contrastive topics, they have different discourse<br />distributions, as confirmed by our corpus, thus this<br />adjoining of a left-dislocated element is justified. In<br />the case of Hanging Topic Left Dislocation, coreference<br />between the left-dislocated element and the<br />resumptive pronoun is established via the operation<br />Match of Boeckx (2003). If the resumptive pronoun is<br />a clitic, it moves to the second position in its intonational phrase triggered by the phonological requirement. Hanging Topic Left Dislocation in both English and Serbian marks referential topics and it is</p><p>also a topic-promoting device in Serbian, as argued on<br />relying on our corpus.</p> / <p>Cilj doktorske disertacije pod nazivom Tematizacija i<br />leva dislokacija u engleskom i srpskom jeziku je da<br />opi&scaron;e i ponudi generativni prikaz sintaksiĉkih i<br />informacijsko strukturnih osobina tematizacije i leve<br />dislokacije u pomenutim jezicima, dveju naizgled<br />sliĉnih struktura za pomeranje reĉeniĉnog elementa u<br />prednje polje koje izraţavaju iste propozicije, ali ne<br />odgovaraju istom kontekstu. Analiza nije kontrastivna<br />u smislu da traţimo englesko srpske ekvivalente ili<br />obratno, već je tertium comparationis pojava<br />tematizacije i leve dislokacije. PonuĊeni su i osnovni<br />dijagnostiĉki testovi za razlikovanje dva oblika leve<br />dislokacije identifikovana u srpskom, naime leve<br />dislokacije odvojene teme i kontrastne leve<br />dislokacije. Disertacija takoĊe istraţuje kako<br />informacijsko strukturiranje iskaza odreĊuje<br />kontekstualne izbore. Leksikon obezbeĊuje ulaznu<br />informaciju sistemu sintaksiĉkih operacija koji putem<br />obeleţja gradi strukturu u fazama i takoĊe dovodi do<br />pomeranja. Podaci vezani za informacijsku strukturu<br />su dati u numeraciji. Rezultati istraţivanja ukazuju na<br />potrebu da se pojam teme ra&scaron;ĉlani na kombinaciju<br />obeleţja [+/-a, +/-c], sliĉno L&oacute;pezu (2009), anaforiĉno<br />u smislu Birnera &amp; Warda (1998), i kontrastno u<br />pragmatiĉkom smislu Titove (2013) pri ĉemu je [+/-c]<br />zavisno od [+a]. Tematizacija i u engleskom i u<br />srpskom jeziku i kontrastna leva dislokacija u srpskom<br />obeleţavaju teme kao [+a, +c], dok leva dislokacija<br />odvojene teme i u engleskom i u srpskom jeziku<br />obeleţava teme kao [+a, -c]. U radu se dokazuje da ni&nbsp;dodeljivanje pragmatiĉkih obeleţja pored formalnih obeleţja relevantnih za derivaciju putem operacije koja formira numeraciju ne naru&scaron;ava uslov ukljuĉenosti. Interpretacija elementa obeleţenog kao tema je rezultat njegove kombinacije obeleţja i njegove sintaksiĉke pozicije, &scaron;to odraţava interakciju sintakse, prozodije i pragmatike. Pragmatiĉka obeleţja su vrednovana, ali netumaĉiva u numeraciji ĉineći sintaksiĉki objekat koji ih sadrţi aktivnim za sintaksiĉke operacije. Upravna (pragmatiĉka) obeleţja uzrokuju slaganje, ali ne i pomeranje. Obeleţje ivice je ono &scaron;to pokreće pomeranje ili interno spajanje. Argumentujemo da je tematizacija i u engleskom i u srpskom jeziku generisana pomeranjem. Obeleţje ivice na upravnom elementu C (Force) dozvoljava TopP ako je to neophodno za interpretaciju i ako je strukturno moguće, kao &scaron;to su formulisali Jim&eacute;nez-Fern&aacute;ndez &amp; Miyagawa (2014). Za razliku od engleskog, nefazni upravni element T (upravni element obeleţja vremena) u srpskom jeziku moţe da preuzme obeleţje ivice od C i dozvoli TopP u Spec,TP u onim strukturama za koje se smatra da nisu kompatibilne sa tematizacijom u engleskom jeziku. Upravni element koji dozvoljava levu dislokaciju se realizuje kao intonacijska pauza, kao &scaron;to predlaţe Emonds (2004). Argumetujemo da je leva dislokacija odvojene teme i u engleskom i u srpskom jeziku nastala generisanjem levo dislociranog konstituenta u mestu realizacije (pridruţenom CP projekciji), dok je kontrastna leva dislokacija u srpskom nastala pomeranjem (takoĊe u poziciju pridruţenu CP projekciji). Ono &scaron;to se zapravo pomera je rezumptivna zamenica i onda se po pridruţivanju levo dislociranog elementa uspostavlja koreferentnost putem operacije uskladi ili uskladi+sloţi Boeckxa (2003), &scaron;to predstavlja jedini naĉin da se ne naru&scaron;i uslov ukljuĉenosti. Iako i tematizacija i kontrastna leva dislokacija obeleţavaju kontrastne teme, one imaju razliĉite diskursne distribucije, &scaron;to je potvrdio na&scaron; korpus, stoga je ovo pridruţivanje levo dislociranog elementa opravdano. U sluĉaju leve dislokacije odvojene teme, koreferentnost izmeĊu levo dislociranog elementa i rezumptivne zamenice se uspostavlja putem operacije uskladi (Boeckx 2003). Ako je rezumptivna zamenica klitika, ona se pomera u drugu poziciju u svojoj intonacijskoj frazi, &scaron;to je&nbsp;uzrokovano fonolo&scaron;kim zahtevom. Leva dislokacija odvojene teme i u englesko i u srpskom jeziku obeleţava referencijske teme i takoĊe je sredstvo unapreĊivanja teme u srpskom, kao &scaron;to se argumentuje na osnovu na&scaron;eg korpusa.</p>

Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal.

本論文將勞動市場的狀態過程說明非常完整，即是勞動者的搜尋過程、工作配合過程都是詳細介紹其理論背景，以及實証的結果。由於，在勞動市場上，由於勞動者與廠商之間的訊息不完全，造成勞動者與廠商兩者之間往往無法一拍即合，而導致勞動者可能離職他就，廠商亦可能另聘高明，於是工資變動與工作異動就成為經常看到的現象。 在本文研究勞動者工作異動的情形，在理論模型上是以工作契合理論為基礎，而要討論工作契合理論的基礎則必須先知道Lippmam與MaCall(1976)所提出的工作搜尋理論。因為工作契合理論又是以工作搜尋理論為基礎，因此在理論模型上必先討論工作搜尋理論，進而討論工作契合理論。 文中研究主要藉由民國八十五年九月高希均教授與林祖嘉教授於八十四年四月至八十五年六月期間針對民國八十一年六月專上畢業生的資料，分析全体專上畢業生、女性專畢業生與男性畢業生在工資、工作契合期間與勞工離職率決定以及動態行為決定。並且我們把這些資料分為四大類基本資料：個人背景資料、工作配合資料、人力資本資料與工作特徵及其基本資料。在工資的模型方面則利用一般的最小平方法來估計，因為假設市場上的工資分配為一常態分配，是一般實証文獻常用的。就勞工的契合期間，我們運用林祖嘉(1991)的模型，本文則用在勞動者的離職率與工作契合期間的決定。我們分為四個模型，分別是：Weibull、exponential、lognormal與logistic四種分配。在勞工離職方面我們運用了Cox(1972)的比例危險率模型，Lynch(1991)首次將之運用在勞動者工作異動的決定，除此之外，我們也進一步的討論工資、工作契合期間與離職率的進一步的動態的分析。

The performance of commercial Radio Frequency Identification (RFID) tags is primarily limited by present techniques used for tag antenna design. Currently, industry techniques rely on identifying the RFID tag application (books, clothing, etc.) and then building antenna prototypes of different configurations in order to satisfy minimum read range requirements. However, these techniques inherently lack an electromagnetic basis and are unable to provide a low cost solution to the tag antenna design process. RFID tag performance characteristics (read-range, chip-antenna impedance matching, surrounding environment) can be very complex, and a thorough understanding of the RFID tag antenna design may be gained through an electromagnetic approach in order to reduce the tag antenna size and the overall cost of the RFID system. The research presented in this thesis addresses RFID tag antenna design process for passive RFID tags. With the growing number of applications (inventory, supply-chain, pharmaceuticals, etc), the proposed RFID antenna design process demonstrates procedures to design tag antennas for such applications. Electrical/geometrical properties of the antennas designed were investigated with the help of computer electromagnetic simulations in order to achieve optimal tag performance criteria such as read range, chip-impedance matching, antenna efficiency, etc. Experimental results were performed on the proposed antenna designs to compliment computer simulations and analytical modelling.

Aquesta tesi està dedicada al disseny i a l'anàlisi d'estructures de dades multidimensionals, és a dir, estructures de dades que serveixen per emmagatzemar registres $K$-dimensionals que solen representar-se com a punts en l'espai $[0,1]^K$. Aquestes estructures tenen aplicacions en diverses àrees de la informàtica com poden ser els sistemes d'informació geogràfica, la robòtica, el processament d'imatges, la world wide web, el data mining, entre d'altres. Les estructures de dades multidimensionals també es poden utilitzar com a indexos d'estructures de dades que emmagatzemen, possiblement en memòria externa, dades més complexes que els punts.Les estructures de dades multidimensionals han d'oferir la possibilitat de realitzar operacions d'inserció i esborrat de claus dinàmicament, a més de permetre realitzar cerques anomenades associatives. Exemples d'aquest tipus de cerques són les cerques per rangs ortogonals (quins punts cauen dintre d'un hiper-rectangle donat?) i les cerques del veí més proper (quin és el punt més proper a un punt donat?).Podem dividir les contribucions d'aquesta tesi en dues parts: La primera part està relacionada amb el disseny d'estructures de dades per a punts multidimensionals. Inclou el disseny d'arbres binaris $K$-dimensionals al·leatoritzats (Randomized $K$-d trees), el d'arbres quaternaris al·leatoritzats (Randomized quad trees) i el d'arbres multidimensionals amb punters de referència (Fingered multidimensional trees).La segona part analitza el comportament de les estructures de dades multidimensionals. En particular, s'analitza el cost mitjà de les cerques parcials en arbres $K$-dimensionals relaxats, i el de les cerques per rang en diverses estructures de dades multidimensionals. Respecte al disseny d'estructures de dades multidimensionals, proposem algorismes al·leatoritzats d'inserció i esborrat de registres per als arbres $K$-dimensionals i per als arbres quaternaris. Aquests algorismes produeixen arbres aleatoris, independentment de l'ordre d'inserció dels registres i desprès de qualsevol seqüència d'insercions i esborrats. De fet, el comportament esperat de les estructures produïdes mitjançant els algorismes al·leatoritzats és independent de la distribució de les dades d'entrada, tot i conservant la simplicitat i la flexibilitat dels arbres $K$-dimensionals i quaternaris estàndard. Introduïm també els arbres multidimensionals amb punters de referència. Això permet que les estructures multidimensionals puguin aprofitar l'anomenada localitat de referència en cerques associatives altament correlacionades.I respecte de l'anàlisi d'estructures de dades multidimensionals, primer analitzem el cost esperat de las cerques parcials en els arbres $K$-dimensionals relaxats. Seguidament utilitzem aquest resultat com a base per a l'anàlisi de les cerques per rangs ortogonals, juntament amb arguments combinatoris i geomètrics. D'aquesta manera obtenim un estimat asimptòtic precís del cost de les cerques per rangs ortogonals en els arbres $K$-dimensionals aleatoris. Finalment, mostrem que les tècniques utilitzades es poden estendre fàcilment a d'altres estructures de dades i per tant proporcionem una anàlisi exacta del cost mitjà de cerques per rang en estructures de dades com són els arbres $K$-dimensionals estàndard, els arbres quaternaris, els tries quaternaris i els tries $K$-dimensionals. / Esta tesis está dedicada al diseño y al análisis de estructuras de datos multidimensionales; es decir, estructuras de datos específicas para almacenar registros $K$-dimensionales que suelen representarse como puntos en el espacio $[0,1]^K$. Estas estructuras de datos tienen aplicaciones en diversas áreas de la informática como son: los sistemas de información geográfica, la robótica, el procesamiento de imágenes, la world wide web o data mining, entre otras.Las estructuras de datos multidimensionales suelen utilizarse también como índices de estructuras que almacenan, posiblemente en memoria externa, datos complejos.Las estructuras de datos multidimensionales deben ofrecer la posibilidad de realizar operaciones de inserción y borrado de llaves de manera dinámica, pero además deben permitir realizar búsquedas asociativas en los registros almacenados. Ejemplos de búsquedas asociativas son las búsquedas por rangos ortogonales (¿qué puntos de la estructura de datos están dentro de un hiper-rectángulo dado?) y las búsquedas del vecino más cercano (¿cuál es el punto de la estructura de datos más cercano a un punto dado?).Las contribuciones de esta tesis se dividen en dos partes:La primera parte está dedicada al diseño de estructuras de datos para puntos multidimensionales, que incluye el diseño de los árboles binarios $K$-dimensionales aleatorios (Randomized $K$-d trees), el de los árboles cuaternarios aleatorios (Randomized quad trees), y el de los árboles multidimensionales con punteros de referencia (Fingered multidimensional trees).La segunda parte contiene contribuciones al análisis del comportamiento de las estructuras de datos para puntos multidimensionales. En particular, damos el análisis del costo promedio de las búsquedas parciales en los árboles $K$-dimensionales relajados y el de las búsquedas por rango en varias estructuras de datos multidimensionales.Con respecto al diseño de estructuras de datos multidimensionales, proponemos algoritmos aleatorios de inserción y borrado de registros para los árboles $K$-dimensionales y los árboles cuaternarios que producen árboles aleatorios independientemente del orden de inserción de los registros y después de cualquier secuencia de inserciones y borrados intercalados. De hecho, con la aleatorización garantizamos un buen rendimiento esperado de las estructuras de datos resultantes, que es independiente de la distribución de los datos de entrada, conservando la flexibilidad y la simplicidad de los árboles $K$-dimensionales y de los árboles cuaternarios estándar. También proponemos los árboles multidimensionales con punteros de referencia, una técnica que permite que las estructuras de datos multidimensionales exploten la localidad de referencia en búsquedas asociativas que se presentan altamente correlacionadas.Con respecto al análisis de estructuras de datos multidimensionales, comenzamos dando un análisis preciso del costo esperado de las búsquedas parciales en los árboles $K$-dimensionales relajados. A continuación, utilizamos este resultado como base para el análisis de las búsquedas por rangos ortogonales, combinándolo con argumentos combinatorios y geométricos. Como resultado obtenemos un estimado asintótico preciso del costo de las búsquedas por rango en los árboles $K$-dimensionales relajados. Finalmente, mostramos que las técnicas utilizadas pueden extenderse fácilmente a otras estructuras de datos y por tanto proporcionamos un análisis preciso del costo promedio de búsquedas por rango en estructuras de datos como los árboles $K$-dimensionales estándar, los árboles cuaternarios, los tries cuaternarios y los tries $K$-dimensionales. / This thesis is about the design and analysis of point multidimensional data structures: data structures that store $K$-dimensional keys which we may abstract as points in $[0,1]^K$. These data structures are present in many applications of geographical information systems, image processing or robotics, among others. They are also frequently used as indexes of more complex data structures, possibly stored in external memory.Point multidimensional data structures must have capabilities such as insertion, deletion and (exact) search of items, but in addition they must support the so called {em associative queries}. Examples of these queries are orthogonal range queries (which are the items that fall inside a given hyper-rectangle?) and nearest neighbour queries (which is the closest item to some given point?).The contributions of this thesis are two-fold:Contributions to the design of point multidimensional data structures: the design of randomized $K$-d trees, the design of randomized quad trees and the design of fingered multidimensional search trees;Contributions to the analysis of the performance of point multidimensional data structures: the average-case analysis of partial match queries in relaxed $K$-d trees and the average-case analysis of orthogonal range queries in various multidimensional data structures.Concerning the design of randomized point multidimensional data structures, we propose randomized insertion and deletion algorithms for $K$-d trees and quad trees that produce random $K$-d trees and quad trees independently of the order in which items are inserted into them and after any sequence of interleaved insertions and deletions. The use of randomization provides expected performance guarantees, irrespective of any assumption on the data distribution, while retaining the simplicity and flexibility of standard $K$-d trees and quad trees.Also related to the design of point multidimensional data structures is the proposal of fingered multidimensional search trees, a new technique that enhances point multidimensional data structures to exploit locality of reference in associative queries.With regards to performance analysis, we start by giving a precise analysis of the cost of partial matches in randomized $K$-d trees. We use these results as a building block in our analysis of orthogonal range queries, together with combinatorial and geometric arguments and we provide a tight asymptotic estimate of the cost of orthogonal range search in randomized $K$-d trees. We finally show that the techniques used apply easily to other data structures, so we can provide an analysis of the average cost of orthogonal range search in other data structures such as standard $K$-d trees, quad trees, quad tries, and $K$-d tries.

Fundamental features of Radio Frequency Identification (RFID) systems used in different application areas will be reviewed. Techniques used in realizing RFID antenna systems will be studied and the procedure to realize a specific RFID antenna type possessing desired characteristics will be described. Electrical properties such as radiation pattern, impedance will be predicted using analytical and/or computer simulation techniques. Experimental investigations will be carried out to complement the theoretical work.

We performed a retrospective study in 185 patients with myelogenous leukemias who had received hematopoietic cells from unrelated donors. The aim of this study was to answer the question wether the benefit of KIR ligand incompatibility seen in haploidentical tranplantations can also be seen using unrelated donors. We could not detect a significant difference in survival between patients with a KIR ligand incompatibility and those with either fully matched or partially mismatched unrelated donors in this patient cohort. / In der Therapie von Leukämien ist die Knochenmark- bzw. Stammzelltransplantation eine tragende Säule. Für den Transplantationserfolg ist eine Übereinstimmung der Haupthistokompatibilitätsantige (HLA-Antigene der Klassen I und II) zwischen Spender und Empfänger von zentraler Bedeutung. Diese Notwendigkeit ergibt sich aus der sogenannten MHC-Restriktion in der T-Zellrezeptorerkennung. Ob auch NK-Zellrezeptoren und deren Liganden in der Spenderauswahl berücksichtigt werden sollten, ist bisher unzureichend untersucht. Insbesondere trifft das für die KIR-Rezeptoren zu, die wie die T-Zellrezeptoren ebenfalls HLA-Antigene als Liganden besitzen. Velardi et al. haben 2002 erstmalig gezeigt, daß in der Therapie myeloischer Leukämien die Transplantation von Blutstammzellen verwandter Spender mit KIR-Liganden-Inkompatibilität von klinischem Vorteil ist. Ob KIR-Liganden-Inkompatibilität auch bei Knochenmark-/ Stammzelltransplantationen Unverwandter Bedeutung erlangen könnte, war zu Studienbeginn offen und blieb auch infolge diskrepanter Untersuchungsergebnisse von verschiedenen Arbeitsgruppen im Verlauf der Studie widersprüchlich. Im Rahmen dieser Arbeit wurde diese Fragestellung, die auch Teil einer internationalen Studie war, an 185 Spender-Empfänger-Paaren retrospektiv untersucht. Dabei wurde bei den Paaren einerseits die KIR-Liganden-Kompatibilität auf der Grundlage der HLA-C-Supertypen erschlossen (nach Velardi et al.). Andererseits konnte sie im internationalen Studienprogramm direkt aus dem KIR-Genotyp des Spenders und dem HLA-C-Supertyp des Empfängers ermittelt werden. Die Untersuchungen ergaben folgende Resultate: bei Vorliegen von KIR-Liganden-Inkompatibilität hat die Verwendung von ATG als Bestandteil der GvHD-Prophylaxe keinen Einfluß auf das klinische Ergebnis. Die Vermutungen von Giebel et al. wurden damit nicht gestützt. Die Bestimmung des KIR-Liganden-Status mit Hilfe der Rückschlußmethode allein aus dem HLA-Typ ist unzuverlässig. Für eine exakte Differenzierung ist die gleichzeitige KIR-Genotypisierung erforderlich. KIR-Liganden-Inkompatibilität ist bei unverwandten Knochenmark-/ Stammzelltransplantationen nicht von klinischem Vorteil. Auch ein gezieltes Aussuchen HLA-C-inkompatibler Spender auf der Grundlage einer KIR-Genotypisierung stellt derzeit keine therapeutische Option dar.