Recent research on multilingual statistical machine translation focuses on the usage of pivot languages in order to overcome resource limitations for certain language pairs. Due to the richness of available language resources, English is in general the pivot language of choice. In this paper, we investigate the appropriateness of languages other than English as pivot languages. Experimental res...

The aims of the current study were to examine polyethylene particles in synovial fluid at an early stage, and to compare a newly introduced medial pivot total knee prosthesis with an established posterior-stabilized total knee prosthesis. Synovial fluid was obtained 1 year after knee arthroplasty from 17 patients with well-functioning prostheses (22 knees, 11 posterior-stabilized prostheses and...

No part of this Journal may be reproduced in any form, by print, photoprint, mi-croolm or any other means without written permission from Faculty of Technical : Abstract We devise a new simplex pivot rule which has interesting theoretical properties. Beginning with a basic feasible solution, and any nonbasic variable having a negative reduced cost, the pivot rule produces a sequence of pivots s...

We present a multi-task learning approach that jointly trains three word alignment models over disjoint bitexts of three languages: source, target and pivot. Our approach builds upon model triangulation, following Wang et al., which approximates a source-target model by combining source-pivot and pivot-target models. We develop a MAP-EM algorithm that uses triangulation as a prior, and show how...

Word alignment of parallel texts is typically carried out using many kinds of knowledge, or information sources, in concert, i.e., it is profitably viewed as a kind of cooperative process, where e.g. distribution, string similarity, cooccurrence statistics, and other in­ formation sources are used together. We investigate a novel such information source in this paper, namely the use of a third ...

Example: Sorting algorithms. The Merge-Sort algorithm is asymptotically best deterministic algorithm. It is not too hard to describe. However, the same asymptotic running time can be achieved by the simple randomized Quick-sort algorithm. The algorithm picks a random element as a pivot and partitions the rest of the elements: those smaller than the pivot and those bigger than the pivot. Recurse...

The coordinates of the center of measured spots are nonlinearly transformed to get an optimal match between the transformed coordinates and the given coordinates of a reference pattern. The parameters of the transformation are determined by the minimum of a function of squared distances between all spots of the sample and of the reference pattern. The algorithm requires a priori defined corresp...