We analyze the logical strength of theorems on marriage problems with a fixed finite number of solutions via the techniques of reverse mathematics. We show that if a marriage problem has k solutions, then there is a finite set of boys such that the marriage problem restricted to this set has exactly k solutions, each of which extend uniquely to a solution of the original marriage problem. The s...

In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like color, shape, and texture we focus on signatures that are generated from color histograms by using Graph Theoretical Clustering (GT-Clustering) in this paper. In contrast to Histogram Intersection [3] (HI) or similar ap...

Every day there is an abundance of information broadcasted by all the news networks of the world. An automatic news story tracking system could watch all broadcasted news and track the stories in which we are interested in. In this thesis, a novel approach to news story tracking is investigated. We have designed a system for adaptive video news story tracking based on the Earth Mover’s Distance...

We examine the reverse-mathematical strength of several theorems in classical and effective model theory concerning first-order theories and their number of models. We prove that, among these, most are equivalent to one of the familiar systems RCA0, WKL0, or ACA0. We are led to a purely model-theoretic statement that implies WKL0 but refutes ACA0 over RCA0.

This paper develops a multiobjective programming model for the optimal allocation of passenger train services on an intercity high-speed rail line without branches. Minimizing the operator's total operating cost and minimizing the passenger's total travel time loss are the two planning objectives of the model. For a given many-to-many travel demand and a speci®ed operating capacity, the model i...