subject to A X = b and that,X is an extreme point of DX=d, X>O, is developed. The procedure will avoid the investigation of many of the extreme points of DX = d, X > 0 and also alternative optimas of different best extreme points of DX = d, X >_ 0 will not be needed. The algorithm is expected to work very efficiently. Zusammenfassung: In dieser Arbeit "Strong-Cut Enumerative Procedure for Extre...

In this paper, we present a new background estimation algorithm which effectively represents both background and foreground. The problem is formulated with a labeling problem over a patch-based Markov random field (MRF) and solved with a graph-cuts algorithm. Our method is applied to the problem of mosaic blending considering the moving objects and exposure variations of rotating and zooming ca...

We deene a variant LKsp of the Gentzen sequent calculus LK. In LKsp weakenings or contractions can be done in parallel. This modiication allows us to interpret a symmetrical system of mix elimination rules ELKsp by a nite rewriting system; the termination of this rewriting system can be checked by machines. We give also a self-contained strong normalisation proof by structural induction. We giv...

This paper is concerned with strong normalisation of cutelimination for a standard intuitionistic sequent calculus. The cutelimination procedure is based on a rewrite system for proof-terms with cut-permutation rules allowing the simulation of β-reduction. Strong normalisation of the typed terms is inferred from that of the simply-typed λ-calculus, using the notions of safe and minimal reductio...

In this paper we show that TNF-alpha enhances platelet activation. Experiments were performed on a human polymorphonuclear neutrophil (PMN)-platelet cooperation system in which PMN, stimulated by FMLP, release cathepsin G (Cat.G), a serine proteinase responsible for the activation of nearby platelets. Pretreatment of the mixed cell suspension with 5 ng/ml TNF-alpha resulted in a strong platelet...

An instance of the max k−cut game is an edge weighted graph. Every vertex is controlled by an autonomous agent with strategy space [1..k]. Given a player i, his payoff is defined as the total weight of the edges [i, j] such that player j’s strategy is different from player i’s strategy. The social welfare is defined as the weight of the cut, i.e. half the sum of the players payoff. It is known ...

In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimination procedures, including the one by Gentzen, are formulated so that they only rewrite neighbouring inference rules; that is they use local proof transformations. Unfortunately, such local proof transformation, if d...

This paper deals with two games defined upon well known generalizations of max cut. We study the existence of a strong equilibrium which is a refinement of the Nash equilibrium. Bounds on the price of anarchy for Nash equilibria and strong equilibria are also given. In particular, we show that the max cut game always admits a strong equilibrium and the strong price of anarchy is 2/3.

An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of Gentzen-type systems which in addition to the standard axioms and structural rules have only logical rules in which exactly one occurrence of a quantifier is introduced. The semantics for these systems is provided usin...

We consider a labelled tableau presentation of constant domain rst-order S5 and prove a strong cut-elimination theorem.