The application of equality constraints on the categories of a variable is a simple but useful extension of multiple correspondence analysis. Equality can be used to incorporate prior knowledge about the relations between categories. Categories may belong to the same variable, to different variables, or both. The simplest form of equality specifies that all variables receive identical data tran...

We examine the problem of planning a path through a low dimensional continuous state space subject to upper bounds on several additive cost metrics. For the single cost case, previously published research has proposed constructing the paths by gradient descent on a local minima free value function. This value function is the solution of the Eikonal partial differential equation, and efficient a...

Several approaches to optical flow estimation use differential methods to model changes in image brightness over time. In computer vision it is often desirable to over constrain the problem to more precisely determine the solution and enforce robustness. In this paper, two new solutions for optical flow computation are proposed which are based on combining brightness and gradient constraints us...

This paper addresses the dose-finding problem in cancer trials in which we are concerned with the gradation of severe toxicities that are considered dose limiting. In order to differentiate the tolerance for different toxicity types and grades, we propose a novel extension of the continual reassessment method that explicitly accounts for multiple toxicity constraints. We apply the proposed meth...

In this paper we investigate the maximal size of chains of equations on three or four words such that every time we add a new equation the set of solutions strictly decreases. We also investigate how large systems of pairwise independent or pairwise non-equivalent equations exist accepting purely non-periodic solutions.

We consider a budgeting problem where a speciied number of projects from some disjoint classes has to be selected such that the overall gain is largest possible, and such that the costs of the chosen projects do not exceed a xed upper limit. The problem has several application in government budgeting, planning, and as relaxation from other combinatorial problems. It is demonstrated that the pro...

Nowadays, the efficient integration of preference querying into standard database technology is an important issue. In some instances, preference queries challenge traditional query processing and optimization. In this paper we study preference database queries involving hard constraints over multiple attributes belonging to several relations. The main bottleneck for such queries is the computa...

In many situations, automated multi-alignment programs are not able to correctly align families of nucleic acid or protein sequences. Difficult cases comprise not only distantly related sequences but also tandem duplications independent of their evolutionary age. Frequently, additional biological information is available that establishes homologies at least in parts of the sequences based on st...