Analysis of a tripartite entanglement distribution switch

Queueing Systems - We study a quantum switch that distributes tripartite entangled states to sets of users. The entanglement switching process requires two steps: First, each user attempts to...     

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.     

Algorithm for Optimal Triangulations in Scattered Data Representation and Implementation

Scattered data collected at sample points may be used to determine simple functions to best fit the data. An ideal choice for these simple functions is bivariate splines. Triangulation of the sample points creates partitions over which the bivariate splines may be defined. But the optimality of the approximation is dependent on the choice of triangulation. An algorithm, referred to as an Edge Swapping Algorithm, has been developed to transform an arbitrary triangulation of the sample points into an optimal triangulation for representation of the scattered data. A Matlab package has been completed that implements this algorithm for any triangulation on a given set of sample points.     

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