Crosslinked poly(ethylene oxide) containing siloxanes fabricated through thiol‐ene photochemistry

Homogenous amphiphilic crosslinked polymer films comprising of poly(ethylene oxide) and polysiloxane were synthesized utilizing thiol‐ene “ click ” photochemistry. A systematic variation in polymer composition was Carried out to obtain high quality films with varied amount of siloxane and poly(ethylene oxide). These films showed improved gas separation performance with high gas permeabilities with good CO₂/N₂ selectivity. Furthermore, the resulting films were also tested for its biocompatibility, as a carrier media which allow human adult mesenchymal stem cells to retain their capacity for osteoblastic differentiation after transplantation. The obtained crosslinked films were characterized using differential scanning calorimetry, dynamic mechanical analysis, thermogravimetric analysis, FTIR, Raman‐IR , and small angle X‐ray scattering. The synthesis ease and commercial availability of the starting materials suggests that these new crosslinked polymer networks could find applications in wide range of applications. © 2015 Wiley Periodicals, Inc. J. Polym. Sci., Part A: Polym. Chem. 2015 , 53, 1548–1557     

Randomized greedy matching

We consider a randomized version of the greedy algorithm for finding a large matching in a graph. We assume that the next edge is always randomly chosen from those remaining. We analyze the performance of this algorithm when the input graph is fixed. We show that there are graphs for which this Randomized Greedy Algorithm (RGA) usually only obtains a matching close in size to that guaranteed by worst-case analysis (i.e., half the size of the maximum). For some classes of sparse graphs (e.g., planar graphs and forests) we show that the RGA performs significantly better than the worst-case. Our main theorem concerns forests. We prove that the ratio to maximum here is at least 0.7690…, and that this bound is tight.     

Stationary turbulent closure via the Hopf functional equation

Exact closed-form solutions are exhibited for the Hopf equation for stationary incompressible 3D Navier-Stokes flow, for the cases of homogeneous forced flow (including a solution with depleted nonlinearity) and inhomogeneous flow with arbitrary boundary conditions. This provides an exact method for computing two- and higher-point moments, given the mean flow.     

Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.     

The push-out region of an immersed manifold

We consider immersions: and construct a subspace of which corresponds to a set of embedded manifolds which are either parallel to f, tubes around f or, in general, partial tubes around f. This space is invariant under the action of the normal holonomy group, We investigate the case where is non-trivial and obtain some results on the number of connected components of . Received 24 March 2000.