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     

Photoinitiated curing of mono‐ and bifunctional epoxides by combination of active chain end and activated monomer cationic polymerization methods

Photoinitiated cationic polymerization of mono‐ and bifunctional epoxy monomers, namely cyclohexeneoxide (CHO), 4‐epoxycyclohexylmethyl‐3′,4′‐epoxycyclohexanecarboxylate (EEC), respectively by using sulphonium salts in the presence of hydroxylbutyl vinyl ether (HBVE) was studied. The real‐time FTIR spectroscopic, gel content determination, and thermal characterization studies revealed that both hydroxyl and vinyl ether functionalities of HBVE take part in the polymerization. During the polymerization, HBVE has the ability to react via both active chain end (ACE) and activated monomer mechanisms through its hydroxyl and vinyl ether functionalities, respectively. Thus, more efficient curing was observed with the addition of HBVE into EEC‐containing formulations. It was also demonstrated that HBVE is effective in facilitating the photoinduced crosslinking of monofunctional epoxy monomer, CHO in the absence of a conventional crosslinker. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 4914–4920, 2007     

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.     

Maximin share and minimax envy in fair-division problems

For fair-division or cake-cutting problems with value functions which are normalized positive measures (i.e., the values are probability measures) maximin-share and minimax-envy inequalities are derived for both continuous and discrete measures. The tools used include classical and recent basic convexity results, as well as ad hoc constructions. Examples are given to show that the envy-minimizing criterion is not Pareto optimal, even if the values are mutually absolutely continuous. In the discrete measure case, sufficient conditions are obtained to guarantee the existence of envy-free partitions.     

A Note on Cactus Trees: Variational vs. Recursive Approach

In this article we deal with the variational approach to cactus trees (Husimi trees) and the more common recursive approach, that are in principle equivalent for finite systems. We discuss in detail the conditions under which the two methods are equivalent also in the analysis of infinite (self-similar) cactus trees, usually investigated to the purpose of approximating ordinary lattice systems. Such issue is hardly ever considered in the literature. We show (on significant test models) that the phase diagram and the thermodynamic quantities computed by the variational method, when they deviates from the exact bulk properties of the cactus system, generally provide a better approximation to the behavior of a corresponding ordinary system. Generalizing a property proved by Kikuchi, we also show that the numerical algorithm usually employed to perform the free energy minimization in the variational approach is always convergent.