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     

Bargaining over the division of a shrinking pie: An axiomatic approach

The Bargaining Problem paradigm is extended to time-consuming conflict situations. Such a situation can be represented by a chain of bargaining domains, each representing the conflict at a different point in time. The solution function selects a point in the union of all these domains. We characterize a solution function which satisfies several requirements and explore its properties. One of the results is that an extension of the Adding requirement (Thomson-Myerson 1980) is enough, under some conditions, to yield a solution point, so there is no need to extend the stronger requirements of Independence of Irrelevant Alternatives (Nash 1950) or Monotonicity (Kalai-Smorodinsky 1975).     

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.     

An experimental analysis of a population based approach for global optimization

In this paper we perform a computational analysis of a population based approach for global optimization, Population Basin Hopping (PBH), which was proven to be very efficient on very challenging global optimization problems by the authors (see ). The experimental analysis aims at understanding more deeply how the approach works and why it is successful on challenging problems.     

Mathematical and numerical analysis of a simplified time-dependent viscoelastic flow

A time-dependent model corresponding to an Oldroyd-B viscoelastic fluid is considered, the convective terms being disregarded. Global existence in time is proved in Banach spaces provided the data are small enough, using the implicit function theorem and a maximum regularity property for a three fields Stokes problem. A finite element discretization in space is then proposed. Existence of the numerical solution is proved for small data, so as a priori error estimates, using again an implicit function theorem. Supported by the Swiss National Science Foundation. Fellowship PBEL2–114311.     

How to assess and report the performance of a stochastic algorithm on a benchmark problem: mean or best result on a number of runs?

Some authors claim that reporting the best result obtained by a stochastic algorithm in a number of runs is more meaningful than reporting some central statistic. In this short note, we analyze and refute the main argument brought in favor of this statement.