Well-posedness of two pseudo-parabolic problems for electrical conduction in heterogeneous media

We prove a well-posedness result for two pseudo-parabolic problems, which can be seen as two models for the same electrical conduction phenomenon in heterogeneous media, neglecting the magnetic field. One of the problems is the concentration limit of the other one, when the thickness of the dielectric inclusions goes to zero. The concentrated problem involves a transmission condition through interfaces, which is mediated by a suitable Laplace-Beltrami type equation.     

Quantum curves and q-deformed Painlevé equations

Letters in Mathematical Physics - We propose that the grand canonical topological string partition functions satisfy finite-difference equations in the closed string moduli. In the case of genus...     

Convergence of solutions for the fractional Cahn–Hilliard system

This paper deals with the Cauchy–Dirichlet problem for the fractional Cahn–Hilliard equation. The main results consist of global (in time) existence of weak solutions, characterization of parabolic smoothing effects (implying under proper condition eventual boundedness of trajectories), and convergence of each solution to a (single) equilibrium. In particular, to prove the convergence result, a variant of the so-called ?ojasiewicz–Simon inequality is provided for the fractional Dirichlet Laplacian and (possibly) non-analytic (but $C^1$) nonlinearities.     

UV‐ignited frontal polymerization of an epoxy resin

By combining frontal polymerization and radical‐induced cationic polymerization, it was possible to cure thick samples of an epoxy monomer bleached by UV light. The effect of the relative amounts of cationic photoinitiator and radical initiator was thoroughly investigated and was related to the front's velocity and its maximum temperature. The materials obtained were characterized by quantitative conversion also in the deeper layers, not reached by UV light. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 2066–2072, 2004     

Exact Max-SAT solvers for over-constrained problems

We present a new generic problem solving approach for over-constrained problems based on Max-SAT. We first define a Boolean clausal form formalism, called soft CNF formulas, that deals with blocks of clauses instead of individual clauses, and that allows one to declare each block either as hard (i.e., must be satisfied by any solution) or soft (i.e., can be violated by some solution). We then present two Max-SAT solvers that find a truth assignment that satisfies all the hard blocks of clauses and the maximum number of soft blocks of clauses. Our solvers are branch and bound algorithms equipped with original lazy data structures, powerful inference techniques, good quality lower bounds, and original variable selection heuristics. Finally, we report an experimental investigation on a representative sample of instances (random 2-SAT, Max-CSP, graph coloring, pigeon hole and quasigroup completion) which provides experimental evidence that our approach is very competitive compared with the state-of-the-art approaches developed in the CSP and SAT communities. Research partially supported by projects TIN2004-07933-C03-03 and TIC2003-00950 funded by the Ministerio de Educación y Ciencia. The second author is supported by a grant Ramón y Cajal.