Comparison of PBO solvers in a dependency solving domain

Linux package managers have to deal with dependencies and conflicts of packages required to be installed by the user. As an NP-complete problem, this is a hard task to solve. In this context, several approaches have been pursued. Apt-pbo is a package manager based on the apt project that encodes the dependency solving problem as a pseudo-Boolean optimization (PBO) problem. This paper compares different PBO solvers and their effectiveness on solving the dependency solving problem.Comment: In Proceedings LoCoCo 2010, arXiv:1007.083

On the Floquet Theory of Delay Differential Equations

We present an analytical approach to deal with nonlinear delay differential equations close to instabilities of time periodic reference states. To this end we start with approximately determining such reference states by extending the Poincar'e Lindstedt and the Shohat expansions which were originally developed for ordinary differential equations. Then we systematically elaborate a linear stability analysis around a time periodic reference state. This allows to approximately calculate the Floquet eigenvalues and their corresponding eigensolutions by using matrix valued continued fractions

Generalized Totalizer Encoding for Pseudo-Boolean Constraints

Pseudo-Boolean constraints, also known as 0-1 Integer Linear Constraints, are used to model many real-world problems. A common approach to solve these constraints is to encode them into a SAT formula. The runtime of the SAT solver on such formula is sensitive to the manner in which the given pseudo-Boolean constraints are encoded. In this paper, we propose generalized Totalizer encoding (GTE), which is an arc-consistency preserving extension of the Totalizer encoding to pseudo-Boolean constraints. Unlike some other encodings, the number of auxiliary variables required for GTE does not depend on the magnitudes of the coefficients. Instead, it depends on the number of distinct combinations of these coefficients. We show the superiority of GTE with respect to other encodings when large pseudo-Boolean constraints have low number of distinct coefficients. Our experimental results also show that GTE remains competitive even when the pseudo-Boolean constraints do not have this characteristic.Comment: 10 pages, 2 figures, 2 tables. To be published in 21st International Conference on Principles and Practice of Constraint Programming 201

Ensemble prediction for nowcasting with a convection-permitting model - II: forecast error statistics

A 24-member ensemble of 1-h high-resolution forecasts over the Southern United Kingdom is used to study short-range forecast error statistics. The initial conditions are found from perturbations from an ensemble transform Kalman filter. Forecasts from this system are assumed to lie within the bounds of forecast error of an operational forecast system. Although noisy, this system is capable of producing physically reasonable statistics which are analysed and compared to statistics implied from a variational assimilation system. The variances for temperature errors for instance show structures that reflect convective activity. Some variables, notably potential temperature and specific humidity perturbations, have autocorrelation functions that deviate from 3-D isotropy at the convective-scale (horizontal scales less than 10 km). Other variables, notably the velocity potential for horizontal divergence perturbations, maintain 3-D isotropy at all scales. Geostrophic and hydrostatic balances are studied by examining correlations between terms in the divergence and vertical momentum equations respectively. Both balances are found to decay as the horizontal scale decreases. It is estimated that geostrophic balance becomes less important at scales smaller than 75 km, and hydrostatic balance becomes less important at scales smaller than 35 km, although more work is required to validate these findings. The implications of these results for high-resolution data assimilation are discussed

Generation of spatial antibunching with free propagating twin beams

We propose and implement a novel method to produce a spatial anti-bunched field with free propagating twin beams from spontaneous parametric down-conversion. The method consists in changing the spatial propagation by manipulating the transverse degrees of freedom through reflections of one of the twin beams. Our method use reflective elements eliminating losses from absorption by the objects inserted in the beams.Comment: Submitted for publication in Phys. Rev.

Experimental observation of spatial antibunching of photons

We report an interference experiment that shows transverse spatial antibunching of photons. Using collinear parametric down-conversion in a Young-type fourth-order interference setup we show interference patterns that violate the classical Schwarz inequality and should not exist at all in a classical description.Comment: 4 pages, 7 figure

Exploiting the Power of mip Solvers in maxsat

Abstract. maxsat is an optimization version of satisfiability. Since many practical problems involve optimization, there are a wide range of potential applications for effective maxsat solvers. In this paper we present an extensive empirical evaluation of a number of maxsat solvers. In addition to traditional maxsat solvers, we also evaluate the use of a state-of-the-art Mixed Integer Program (mip) solver, cplex, for solving maxsat. mip solvers are the most popular technology for solving opti-mization problems and are also theoretically more powerful than sat solvers. In fact, we show that cplex is quite effective on a range of maxsat instances. Based on these observations we extend a previously developed hybrid approach for solving maxsat, that utilizes both a sat solver and a mip solver. Our extensions aim to take better advantage of the power of the mip solver. The resulting improved hybrid solver is shown to be quite effective.

On Tackling the Limits of Resolution in SAT Solving

The practical success of Boolean Satisfiability (SAT) solvers stems from the CDCL (Conflict-Driven Clause Learning) approach to SAT solving. However, from a propositional proof complexity perspective, CDCL is no more powerful than the resolution proof system, for which many hard examples exist. This paper proposes a new problem transformation, which enables reducing the decision problem for formulas in conjunctive normal form (CNF) to the problem of solving maximum satisfiability over Horn formulas. Given the new transformation, the paper proves a polynomial bound on the number of MaxSAT resolution steps for pigeonhole formulas. This result is in clear contrast with earlier results on the length of proofs of MaxSAT resolution for pigeonhole formulas. The paper also establishes the same polynomial bound in the case of modern core-guided MaxSAT solvers. Experimental results, obtained on CNF formulas known to be hard for CDCL SAT solvers, show that these can be efficiently solved with modern MaxSAT solvers

Phase-Locked Spatial Domains and Bloch Domain Walls in Type-II Optical Parametric Oscillators

We study the role of transverse spatial degrees of freedom in the dynamics of signal-idler phase locked states in type-II Optical Parametric Oscillators. Phase locking stems from signal-idler polarization coupling which arises if the cavity birefringence and/or dichroism is not matched to the nonlinear crystal birefringence. Spontaneous Bloch domain wall formation is theoretically predicted and numerically studied. Bloch walls connect, by means of a polarization transformation, homogeneous regions of self-phase locked solutions. The parameter range for their existence is analytically found. The polarization properties and the dynamics of walls in one- and two transverse spatial dimensions is explained. Transition from Bloch to Ising walls is characterized, the control parameter being the linear coupling strength. Wall dynamics governs spatiotemporal dynamical states of the system, which include transient curvature driven domain growth, persistent dynamics dominated by spiraling defects for Bloch walls, and labyrinthine pattern formation for Ising walls.Comment: 27 pages, 16 figure

Frequency selection by soliton excitation in nondegenerate intracavity downconversion

We show that soliton excitation in intracavity downconversion naturally selects a strictly defined frequency difference between the signal and idler fields. In particular, this phenomenon implies that if the signal has smaller losses than the idler then its frequency is pulled away from the cavity resonance and the idler frequency is pulled towards the resonance and {\em vice versa}. The frequency selection is shown to be closely linked with the relative energy balance between the idler and signal fields.Comment: 5 pages, 3 figures. To appear in Phys Rev Let