In the online labeling problem with parameters n and m we are presented with a sequence of n items from a totally ordered universe U and must assign each arriving item a label from the label set {1, . . . ,m} so that the order of labels respects the order on U . As new items arrive it may be necessary to change the labels of some items; such changes may be done at any time at unit cost for each...

This paper proposes a method to accelerate character recognition of a large character set by employing pivots into the search space. We divide the feature space of character categories into smaller clusters and derive the centroid of each cluster as a pivot. Given an input pattern, it is compared with all the pivots and only a limited number of clusters whose pivots have higher similarities (or...

Article history: Received 5 December 2006 Revised 21 April 2008 Available online 11 April 2009 A new axiomatic system OST of operational set theory is introduced in which the usual language of set theory is expanded to allow us to talk about (possibly partial) operations applicable both to sets and to operations. OST is equivalent in strength to admissible set theory, and a natural extension of...

We study the equivalence between the MB-set and the core in the general context of games with a measurable space of players. In the first part of the paper, we study the problem without imposing any restriction on the class of games we consider. In the second part, we apply our findings to specific classes of games for which we provide new equivalence results. These include non-continuous conve...

lthough fuzzy set theory and  sheaf theory have been developed and studied independently,  Ulrich Hohle shows that a large part of fuzzy set  theory  is in fact a subfield of sheaf theory. Many authors have studied mathematical structures, in particular, algebraic structures, in both  categories of these generalized (multi)sets. Using Hohle's idea, we show that for a (universal) algebra $A$, th...

We prove that in almost all large tournaments, the minimal covering set is the entire set of alternatives. That is, as the number of alternatives gets large, the probability that the minimal covering set of a uniformly chosen random tournament is the entire set of alternatives goes to one. By contrast, it follows from a result of Fisher and Reeves (1995) that the bipartisan set contains about h...