This work presents a grapheme-based approach of English-to-Chinese (E2C) transliteration, which consists of many-to-many (M2M) alignment and conditional random fields (CRF) using accessor variety (AV) as an additional feature to approximate local context of source graphemes. Experiment results show that the AV of a given English named entity generally improves effectiveness of E2C transliteration.

The functioning of a multimodal integration system requires metadata, such as ontologies, that describe media resources and media components. Such metadata are generally application and domain dependent, which causes difficulties when media need to be shared across domains. Thus, there is a need for a mechanism that can relate the key terms and/or media components in data from different sources...

Learning Decompositional Shape Models from Examples Alex Levinshtein Master of Science Graduate Department of Computer Science University of Toronto 2005 We present an algorithm for automatically constructing a decompositional shape model from examples. Unlike current approaches to structural model acquisition, in which one-to-one correspondences among appearance-based features are used to cons...

Аннотация: Статья о новой форме торговли в сети Интернет. Преимущества дропшиппинга открывают для российских производителей и предпринимателей новые горизонты в международной торговле и маркетинге. Автор рассматривает особенности развития и роль дропшиппинга в электронной коммерции нового тысячелетия. Ключевые слова: дропшиппинг, электронная коммерция, интернет-маркетинг, электронная торговля. ...

We show that the full version of the so-called ‘rural hospital theorem’ (Roth, 1986) generalizes to many-to-many matching where agents on both sides of the market have separable and substitutable preferences.

We count the number of alignments of N ≥ 1 sequences when match-up types are from a specified set S ⊆ N . Equivalently, we count the number of nonnegative integer matrices whose rows sum to a given fixed vector and each of whose columns lie in S. We provide a new asymptotic formula for the case S = {(s1, . . . , sN ) | 1 ≤ si ≤ 2}.

A simple procedure to tighten the Lagrangian bounds is proposed. The approach is interpreted in two ways. First, it can be seen as a reformulation of the original problem aimed to split the resulting Lagrangian problem into two subproblems. Second, it can be considered as a search for a tighter estimation of the penalty term arising in the Lagrangian problem. The new bounds are illustrated by a...

Given two point sets S and T , we study the many-to-many matching with demands problem (MMD problem) which is a generalization of the many-to-many matching problem (MM problem). In an MMD, each point of one set must be matched to a given number of the points of the other set (each point has a demand). In this paper we consider a special case of MMD problem, the one-dimensional MMD (OMMD), where...

This paper describes ThreadMon, a monitoring tool for improving the performance of multithreaded programs, and how we have used it to examine various aspects of the many-to-many (or two-level) threads implementation model. We run unmodified binary subject code, insert software probes to collect data, and analyze and present the results in real time on another machine. We show that the behavior ...