Adding external knowledge improves the results for ill-posed problems. In this paper we present a new multi-level optimization framework for image registration when adding landmark constraints on the transformation. Previous approaches are based on a fixed discretization and lack of allowing for continuous landmark positions that are not on grid points. Our novel approach overcomes these proble...

Supporting observation activity in a digital workspace environment is an idea that holds promise for improving groupware activity. In this paper, we focus on non-constraint equipped collective learning situations, that is to say without a given structure to the working process. We present a meta-model and an architecture of an observation station, to collect activity traces and to analyse them ...

We obtain the solutions and explicitly calculate the energy for a class of two-spin semiclassical string states in the Lunin-Maldacena background. These configurations are the β-deformed versions of the folded string solutions in AdS5 × S background. They correspond to certain single trace operators in the N = 1 superconformal β deformation of N = 4 Yang-Mills. We calculate the one loop anomalo...

We prove that every semidefinite moment relaxation of a polynomial optimization problem (POP) with ball constraint can be reformulated as program involving matrix constant trace property (CTP). As result such relaxations solved efficiently by first-order methods exploit CTP, e.g., the conditional gradient-based augmented Lagrangian method. also extend this CTP-exploiting framework to large-scal...

A distributed presentation of a regular language L is a system of communicating automata accepting L, where the constraint on distribution is given in the form of a distributed alphabet. We study such presentations in the assumption-commitment framework , where each process makes assumptions about other processes in the system. Symmetrically, each process makes commitments which the other proce...

We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted matrix. The regularization problem is solved via a constraint generation method that explicitly maintains a sparse dual and the corresponding low rank primal solution. We provide a new dual block coordinate descent algor...

This paper addresses the problem of designing a submodule of a given system of communicating timed I/O automata. The problem may be formulated mathematically by the equation (C||X)rA under the constraint IX=In, where C represents the specification of the known part of the system, called the context, A represents the specification of the whole system, X represents the specification of the submod...

The typical debugging experience is an iterative process of setting breakpoints, running the program and inspecting the state until the source of the bug is identified. When re-executing the program is not guaranteed to reproduce the faulty execution path, the final state and the system logs can be used to mentally construct a model of the execution. By contrast, debugging by going backward in ...

pollution deriving from trace elements (cd, cu, ni, pb, zn, hg, as and cr) in sediment samples(collected in 2009), belonging to rivers located in catalonia and the basque country (spain), was assessedaccording to sediment quality guidelines. sediment samples were ranked in terms of a pollution index thattakes into account the presence of multiple pollutants such as trace elements. while only ab...