An interval branch and bound method for global Robust optimization

In this paper, we design a Branch and Bound algorithm based on interval arithmetic to address nonconvex robust optimization problems. This algorithm provides the exact global solution of such difficult problems arising in many real life applications. A code was developed in MatLab and was used to solve some robust nonconvex problems with few variables. This first numerical study shows the interest of this approach providing the global solution of such difficult robust nonconvex optimization problems.

     

Topology optimization of composite hyperelastic material using SPIMFO-method

Meccanica - Fiber reinforced materials are used in assorted engineering application and for this reason, new additive manufacturing technologies have been developed for this type of materials. With...     

Epoxy-silica/clay nanocomposite for silver-based antibacterial thin coatings: structure and ionic mobility

Journal of Solid State Electrochemistry - A novel material was developed using sol-gel chemistry and an environmental-friendly grafting process of clay nanoparticles. In a previous work of our...     

Modified gravity on the brane and dark energy

We analyze the dynamics of an AdS₅ braneworld with matter fields when gravity is allowed to deviate from the Einstein form on the brane. We consider exact five-dimensional warped solutions which are associated with conformal bulk fields of weight –4 and describe on the brane the following three dynamics: those of inhomogeneous dust, of generalized dark radiation, and of homogeneous polytropic dark energy. We show that, with modified gravity on the brane, the existence of such dynamical geometries requires the presence of non-conformal matter fields confined to the brane.     

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.     

Synthesis and thermal crosslinking of oxazolidine‐functionalized polyurethanes

A new oxazolidine derivative was obtained from phenol, 2‐amino‐2‐methylpropane‐1,3‐diol and paraformaldehyde. The reaction of this novel oxazolidine diol with phenylisocyanate lead to a urethane model compound which can be polymerized thermally by oxazolidine ring opening to give a Mannich bridge structure. Linear segmented polyurethanes were prepared by reaction of different ratios of oxazolidine diol and commercial polyethylenglycol (M_w ～ 400) with 4,4′‐methylenbis (cyclohexylisocyanate) (HMDI, 90% isomers mixture). The polyurethanes were thermally characterized and crosslinked by oxazolidine ring opening to obtain materials which showed improved thermal stability. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 4965–4973, 2007