Novel UV‐induced photografting process for preparing poly(tetrafluoroethylene)‐based proton‐conducting membranes

A novel process comprising the UV‐induced photografting of styrene into poly(tetrafluoroethylene) (PTFE) films and subsequent sulfonation has been developed for preparing proton‐conducting membranes. Although under UV irradiation the initial radicals were mainly generated on the surface of the PTFE films by the action of photosensitizers such as xanthone and benzoyl peroxide, the graft chains were readily propagated into the PTFE films. The sulfonation of the grafted films was performed in a chlorosulfonic acid solution. Fourier transform infrared and scanning electron microscopy were used to characterize the grafted and sulfonated membranes. With a view to use in fuel cells, the proton conductivity, water uptake, and mechanical properties of the prepared membranes were measured. Even through the degree of grafting was lower than 10%, the proton conductivity in the thickness direction of the newly prepared membranes could reach a value similar to that of a Nafion membrane. In comparison with γ‐ray radiation grafting, UV‐induced photografting is very simple and safe and is less damaging to the membranes because significant degradation of the PTFE main chains can be avoided. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 2624–2637, 2007     

A Lower Bound for the Differences of Powers of Linear Operators

Let T be a bounded linear operator in a Banach space, with σ（T）={1}. In 1983, Esterle-Berkani＇ s conjecture was proposed for the decay of differences （I - T） T^n as follows： Eitheror lim inf （n→∞（n＋1）｜｜（I-T）T^n｜｜≥1/e or T = I. We prove this claim and discuss some of its consequences.     

Estimates for Elements of Inverse Matrices for a Class of Operators with Matrices of Special Structure

In this paper, we consider questions related to the structure of inverse matrices of linear bounded operators acting in infinite-dimensional complex Banach spaces. We obtain specific estimates of elements of inverse matrices for bounded operators whose matrices have a special structure. Matrices are introduced as special operator-valued functions on an index set. The matrix structure is described by the behavior of the given function on elements of a special partition of the index set. The method used for deriving the estimates is based on an analysis of Fourier series of strongly continuous periodic functions.     

Orders of Indescribable Sets

We extract some properties of Mahlo’s operation and show that some other very natural operations share these properties. The weakly compact sets form a similar hierarchy as the stationary sets. The height of this hierarchy is a large cardinal property connected to saturation properties of the weakly compact ideal.     

Mackey Theory for p-adic Lie Groups

This paper gives a p-adic analogue of the Mackey theory, which relates representations of a group of type G - H × t A to systems of imprimitivity.     

牛顿弦截法预估校正迭代格式的收敛阶

研究如下形式的牛顿弦截法的预估校正(P.C.)格式:P(预估):~xk+1=xk-(xk-xk-1)f(xk)f(xk)-f(xk-1)C(校正):xk+1=xk-(~xk+1-xk)f(xk)f~(xk+1)-f(xk)证明了它的收敛阶为2.618.     

Ergodic theory and the Strong Law of Large Numbers on Riesz spaces

In [W.-C. Kuo, C.C.A. Labuschagne, B.A. Watson, Discrete-time stochastic processes on Riesz spaces, Indag. Math. (N.S.) 15 (3) (2004) 435-451], we introduced the concepts of conditional expectations, martingales and stopping times on Riesz spaces. Here we formulate and prove order theoretic analogues of the Birkhoff, Hopf and Wiener ergodic theorems and the Strong Law of Large Numbers on Riesz spaces (vector lattices).     

Fourth-order problems with fully nonlinear boundary conditions

Differential inequality method, bounding function method and topological degree are applied to obtain the existence criterions of at least one solution for the general fourth-order differential equations under nonlinear boundary conditions, and many existing results are complemented.     

Scheduling orders for multiple product types to minimize total weighted completion time

We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product type is produced by one and only one of the m dedicated machines; that is, each machine is dedicated to a specific product type. Each order has a weight and may also have a release date. Each order asks for certain amounts of various different product types. The different products for an order can be produced concurrently. Preemptions are not allowed. Even when all orders are available at time 0, the problem has been shown to be strongly NP-hard for any fixed number (?2) of machines. This paper focuses on the design and analysis of efficient heuristics for the case without release dates. Occasionally, however, we extend our results to the case with release dates. The heuristics considered include some that have already been proposed in the literature as well as several new ones. They include various static and dynamic priority rules as well as two more sophisticated LP-based algorithms. We analyze the performance bounds of the priority rules and of the algorithms and present also an in-depth comparative analysis of the various rules and algorithms. The conclusions from this empirical analysis provide insights into the trade-offs with regard to solution quality, speed, and memory space.