3,049 research outputs found
Incrementally Maintaining the Number of l-cliques
The main contribution of this paper is an incremental algorithm to update the number of -cliques, for , in which each node of a graph is contained, after the deletion of an arbitrary node. The initialization cost is , where is the number of nodes, , , and is the exponent of the multiplication of two matrices. The amortized updating cost is for any , where and is the exponent of the multiplication of an matrix by an matrix. The current best bounds on imply an initialization cost, an updating cost for , and an updating cost for . An interesting application to constraint programming is also considered
Strong consistencies for weighted constraint satisfaction problems
Cette thèse se focalise sur l'étude de cohérences locales fortes afin de résoudre des problèmes d'optimisation sur des réseaux de fonctions de coûts (ou réseaux de contraintes pondérées). Ces méthodes fournissent le minorant nécessaire pour des approches de type "Séparation-Evaluation". Nous étudions dans un premier temps la cohérence d'Arc virtuelle (VAC), une des plus fortes cohérences d'arcs du domaine, qui est établie via l'établissement de la cohérence d'arc dure dans une séquence de réseaux de contraintes classiques. L'algorithme itératif pour établir VAC est amélioré via l'introduction d'une incrémentalité accrue, exploitant la cohérence d'arc dynamique. La nouvelle méthode est aussi capable de maintenir VAC efficacement pendant la recherche lorsque les réseaux de contraintes pondérées sont dynamiquement modifiés par les opérations de branchement. Dans une seconde partie, nous nous intéressons à des cohérences de domaines plus fortes, inspirées de cohérences similaires dans les réseaux de contraintes classiques (cohérence de chemin inverse, réduite ou Max-réduite). Pour chaque cohérence dure, plusieurs cohérences souples ont été proposées pour les réseaux de contraintes pondérées. Les nouvelles cohérences fournissent un minorant plus fort que celui des cohérences d'arc souples en traitant les triplets de variables connectées deux à deux par des fonctions de coûts binaires. Dans cette thèse, nous étudions les propriétés des nouvelles cohérences, les implémentons et les testons sur une variété de problèmes.This thesis focuses on strong local consistencies for solving optimization problems in cost function networks (or weighted constraint networks). These methods provide the lower bound necessary for Branch-and-Bound search. We first study the Virtual arc consistency, one of the strongest soft arc consistencies, which is enforced by iteratively establishing hard arc consistency in a sequence
of classical Constraint Networks. The algorithm enforcing VAC is improved by integrating the dynamic arc consistency to exploit its incremental behavior. The dynamic arc consistency also allows to improve VAC when maintained VAC during search by efficiently exploiting the changes caused by branching operations. Operations. Secondly, we are interested in stronger domain-based soft consistencies, inspired from similar consistencies in hard constraint networks (path inverse consistency, restricted or Max-restricted path consistencies). From each of these hard consistencies, many soft variants have been proposed for weighted constraint networks. The new consistencies provide lower bounds stronger than soft arc consistencies by processing triplets of variables connected two-by-two by binary cost functions. We have studied the properties of these new consistencies, implemented and tested them on a variety of problems
Statistical Estimation of the Poincaré constant and Application to Sampling Multimodal Distributions
Poincaré inequalities are ubiquitous in probability and analysis and have various applications in statistics (concentration of measure, rate of convergence of Markov chains). The Poincaré constant, for which the inequality is tight, is related to the typical convergence rate of diffusions to their equilibrium measure. In this paper, we show both theoretically and experimentally that, given sufficiently many samples of a measure, we can estimate its Poincaré constant. As a by-product of the estimation of the Poincaré constant, we derive an algorithm that captures a low dimensional representation of the data by finding directions which are difficult to sample. These directions are of crucial importance for sampling or in fields like molecular dynamics, where they are called reaction coordinates. Their knowledge can leverage, with a simple conditioning step, computational bottlenecks by using importance sampling techniques
Moment-Based Accelerators for Kinetic Problems with Application to Inertial Confinement Fusion
In inertial confinement fusion (ICF), the kinetic ion and charge separation field effects may play a significant role in the difference between the measured neutron yield in experiments and the predicted yield from fluid codes. Two distinct of approaches exists in modeling plasma physics phenomena: fluid and kinetic approaches. While the fluid approach is computationally less expensive, robust closures are difficult to obtain for a wide separation in temperature and density. While the kinetic approach is a closed system, it resolves the full 6D phase space and classic explicit numerical schemes restrict both the spatial and time-step size to a point where the method becomes intractable. Classic implicit system require the storage and inversion of a very large linear system which also becomes intractable. This dissertation will develop a new implicit method based on an emerging moment-based accelerator which allows one to step over stiff kinetic time-scales. The new method converges the solution per time-step stably and efficiently compared to a standard Picard iteration. This new algorithm will be used to investigate mixing in Omega ICF fuel-pusher interface at early time of the implosion process, fully kinetically
Internal Consistency of Fault-Tolerant Quantum Error Correction in Light of Rigorous Derivations of the Quantum Markovian Limit
We critically examine the internal consistency of a set of minimal
assumptions entering the theory of fault-tolerant quantum error correction for
Markovian noise. These assumptions are: fast gates, a constant supply of fresh
and cold ancillas, and a Markovian bath. We point out that these assumptions
may not be mutually consistent in light of rigorous formulations of the
Markovian approximation. Namely, Markovian dynamics requires either the
singular coupling limit (high temperature), or the weak coupling limit (weak
system-bath interaction). The former is incompatible with the assumption of a
constant and fresh supply of cold ancillas, while the latter is inconsistent
with fast gates. We discuss ways to resolve these inconsistencies. As part of
our discussion we derive, in the weak coupling limit, a new master equation for
a system subject to periodic driving.Comment: 19 pages. v2: Significantly expanded version. New title. Includes a
debate section in response to comments on the previous version, many of which
appeared here http://dabacon.org/pontiff/?p=959 and here
http://dabacon.org/pontiff/?p=1028. Contains a new derivation of the
Markovian master equation with periodic drivin
Quantitative Susceptibility Mapping: Contrast Mechanisms and Clinical Applications.
Quantitative susceptibility mapping (QSM) is a recently developed MRI technique for quantifying the spatial distribution of magnetic susceptibility within biological tissues. It first uses the frequency shift in the MRI signal to map the magnetic field profile within the tissue. The resulting field map is then used to determine the spatial distribution of the underlying magnetic susceptibility by solving an inverse problem. The solution is achieved by deconvolving the field map with a dipole field, under the assumption that the magnetic field is a result of the superposition of the dipole fields generated by all voxels and that each voxel has its unique magnetic susceptibility. QSM provides improved contrast to noise ratio for certain tissues and structures compared to its magnitude counterpart. More importantly, magnetic susceptibility is a direct reflection of the molecular composition and cellular architecture of the tissue. Consequently, by quantifying magnetic susceptibility, QSM is becoming a quantitative imaging approach for characterizing normal and pathological tissue properties. This article reviews the mechanism generating susceptibility contrast within tissues and some associated applications
- …