Regular population monotonic allocation schemes

The paper introduces a refinement of the notion of population monotonic allocation scheme, called regular population monotonic allocation scheme (regularpmas). This refinement is based on economic situations in which players may have to select new partners from a set of potential players and in which there exist certain capacity constraints. A sufficient condition for the existence of a regularpmas is given. For the class of games with regularpmas, we prove that the core coincides with the Davis and Maschler and the Mas-Colell bargaining sets.     

Monitoring the packet gap of real-time packet traffic

Real-time packet traffic is characterized by a strict deadline on the end-to-end time delay and an upper bound on the information loss. Due to the high correlation among consecutive packets, the individual packet loss does not well characterize the performance of real-time packet sessions. An additional measure of packet loss is necessary to adequately assess the quality of each real-time connection. The additional measure considered here is the average number of consecutively lost packets, also called the average packet gap. We derive a closed form for the average packet gap for the multiclassG/G/m/B queueing system in equilibrium and show that it only depends on the loss behavior of two consecutive packets. This result considerably simplifies the monitoring process of real-time packet traffic sessions. If the packet loss process is markovian, the consecutive packet loss has a geometric distribution.     

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     

On the Rees algebra of certain codimension two perfect ideals

 Suppose ? is a set of arbitrary number of smooth points in ℙ² its defining ideal. In this paper, we study the Rees algebras of the ideals generated by I _t , t ≥α. When the points of ? are general, we give a set of defining equations for the Rees algebra . When the points of ? are arbitrary, we show that for all t≫ 0, the Rees algebra is Cohen-Macaulay and its defining ideal is generated by quadratics. A cohomological characterization for arithmetic Cohen-Macaulayness of subvarieties of a product space is also given. Received 4 April 2001