Using a conic bundle method to accelerate both phases of a quadratic convex reformulation

We present algorithm MIQCR-CB that is an advancement of method MIQCR~(Billionnet, Elloumi and Lambert, 2012). MIQCR is a method for solving mixed-integer quadratic programs and works in two phases: the first phase determines an equivalent quadratic formulation with a convex objective function by solving a semidefinite problem $(SDP)$, and, in the second phase, the equivalent formulation is solved by a standard solver. As the reformulation relies on the solution of a large-scale semidefinite program, it is not tractable by existing semidefinite solvers, already for medium sized problems. To surmount this difficulty, we present in MIQCR-CB a subgradient algorithm within a Lagrangian duality framework for solving $(SDP)$ that substantially speeds up the first phase. Moreover, this algorithm leads to a reformulated problem of smaller size than the one obtained by the original MIQCR method which results in a shorter time for solving the second phase. We present extensive computational results to show the efficiency of our algorithm

La vidéo au service des apprentissages : impact sur la motivation et la réussite des étudiants

Bibliographie : p. 85-87

La vidéo au service des apprentissages : impact sur la motivation et la réussite des étudiants /

Bibliographie : p. 85-87

Solving a general mixed-integer quadratic problem through convex reformulation : a computational study

International audienceLet (QP) be a mixed integer quadratic program that consists of minimizing a qua-dratic function subject to linear constraints. In this paper, we present a convex reformulation of (QP), i.e. we reformulate (QP) into an equivalent program, with a convex objective function. Such a reformulation can be solved by a standard solver that uses a branch and bound algorithm. This reformulation, that we call MIQCR (Mixed Integer Quadratic Convex Reformulation), is the best one within a convex reformulation scheme, from the continuous relaxation point of view. It is based on the solution of an SDP relaxation of (QP). Computational experiences were carried out with instances of (QP) with one equality constraint. The results show that most of the considered instances, with up to 60 variables, can be solved within 1 hour of CPU time by a standard solver

Spatio-temporal block model for video indexation assistance

International audienceIn the video indexing framework, we have developed a user assistance system in order to define concept models (i.e semantic index) according to features automatically extracted from the video. Because the manual indexing is a long and tedious task, we propose to focus the user attention on pre-selected prototypes that a priori correspond to the searched concepts. The proposed system is decomposed in three steps. In the first one, some basic spatio-temporal blocks are extracted from the video, a particular block being associated to a particular property of one feature. In the second step, a Question/Answer system allows the user to define links between basic blocks in order to define concept block models. And finally, some concept blocks are extracted and proposed as prototypes of the concepts. In this paper, we present the two first steps, particularly the block structure, illustrated by an example of video indexing that corresponds to the concept running in athletic videos

Points d'intérêt spatio-temporels pour la détection de mouvements dans les vidéos

National audienceParmi toutes les caractéristiques qui peuvent être extraites de vidéos, les points d'intérêt spatiotemporels (STIP) sont particulièrement intéressants car ce sont des caractéristiques de bas niveau simples et robustes qui permettent une bonne caractérisation des objets en mouvement. Dans cet article, nous définissons les STIP et analysons leurs propriétés. Puis, les STIP sont utilisés pour détecter des objets en mouvement et pour caractériser les changements spécifiques dans les mouvements de ces objets. Les performances sont étudiées sur des types très différents de vidéos : des séquences d'athlétisme et des séquences de films d'animation

Scaling properties of work fluctuations after quenches at quantum transitions

We study the scaling properties of the statistics of the work done on a generic many-body system at a quantum phase transition of any order and type, arising from quenches of a driving control parameter. For this purpose we exploit a dynamic finite-size scaling framework. Namely, we put forward the existence of a nontrivial finite-size scaling limit for the work distribution, defined as the large-size limit when appropriate scaling variables are kept fixed. The corresponding scaling behaviors are thoroughly verified by means of analytical and numerical calculations in two paradigmatic many-body systems as the quantum Ising model and the Bose-Hubbard model.Comment: 30 pages, 6 figures. Revised versio