This paper introduces six ways for handling a chain of lexicographic ordering constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-rectangles) subject to the fact that they should not pairwise overlap. While the first two ways deal with the integration of a chain of lexicographic ordering constraint within a generic geometric constraint kernel, the four latter ...

Symmetry is an important feature of many constraint programs. We show that any problem symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each symmetry class. This simple but powerful idea can be used in a number of different ways. We describe one application within model restarts, a search technique desi...

Microblog retrieval enables users to access relevant information from the huge number of tweets posted on social media. Since tweets are different from traditional documents, existing IR models might not be the optimal choice for this problem. Tie-breaking has been recently proposed as a new way of combining multiple retrieval signals. In this paper, we focus on studying the potential of this a...

The jaw plays a significant role in speech production. This work introduces a muscle activated dynamic jaw model that will be connected in the future to the 3D tongue model already developed by our group. The bone structure of the jaw, extracted from CT Images, is represented as a biomechanical model using quadrilateral shell elements. Opener and closer muscles are represented as line-segmented...

We consider a problem of managing a system of spatially distributed markets under capacity and balance constraints and show that solutions of a variational inequality enjoy auction principle properties implicitly. This enables us to develop efficient tools both for derivation of existence and uniqueness results and for creation of solution methods.

We introduce a new global constraint which combines together the lexicographic ordering constraint with some sum constraints. Lexicographic ordering constraints are frequently used to break symmetry, whilst sum constraints occur in many problems involving capacity or partitioning. Our results show that this global constraint is useful when there is a very large space to explore, such as when th...

We show that in theories with radiatively induced electro-weak symmetry breaking the EDMs obey a simple approximate scaling under the transformation m0 → λm0, m 1 2 → λm 1 2 in the large μ region. In the scaling region the knowledge of a single point in the MSSM parameter space where the cancellation in the EDMs occur allows one to generate a trajectory in the m0 −m 1 2 plane where the cancella...

The behaviour of firms on an oligopolistic market is usually modeled via the CournotNash equilibrium concept ([13, 18]). In fact, it is the classical Nash equilibrium, where each player (firm) maximizes its profit subject to production constraints. Assuming that one from the firms has a temporal advantage over the others, this firm can increase its profit by replacing a Cournot-Nash strategy by...

Symmetry is an important problem in many combinatorial problems. One way of dealing with symmetry is to add constraints that eliminate symmetric solutions. We survey recent results in this area, focusing especially on two common and useful cases: symmetry breaking constraints for row and column symmetry, and symmetry breaking constraints for eliminating value symmetry.

This paper presents the first experimental evaluation of the length-lex domain for set variables. The implementation is based on bound-consistency algorithms proposed in earlier work and two novel technical contributions: a generic filtering algorithm which automatically pushes ordering constraints into symmetric binary constraints with only a logarithmic overhead and an adaptation of symmetry-...