Anion effects on the phase transition of N‐isopropylacrylamide hydrogels

NMR spectra were collected for poly(N‐isopropylacrylamide) (PNIPAAm) hydrogel using high‐resolution magic angle spinning (HRMAS) after gel pieces were hydrated in the presence of D₂O, NaF, NaCl, and NaI aqueous solutions. Changes in the peak height intensity of the spectra provide quantitative insight into the phase transition process. The thermodynamic values of the phase transition were calculated using a van't Hoff analysis of the NMR data. Unlike the trend observed for decreases in the (LCST), changes in the enthalpy and entropy did not clearly display a linear dependence with respect to salt concentration. Rather, it was observed that increases in salt concentration did not affect the enthalpy and entropy to the extent as the initial change observed between no salt and 100 mM solutions. Finally, the effect of salts on the hysteresis of the rehydrating process was observed. Hysteresis occurs due to the need for hydrophobic interactions to break down before water is able to infiltrate the polymer matrix. NaF stabilizes hydrophobic interactions while NaI destabilize hydrophobic interactions, causing them to break down at higher temperatures. © 2012 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem, 2012     

Domain imbedding methods for the Stokes equations

Summary We study direct and iterative domain imbedding methods for the Stokes equations on certain non-rectangular domains in two space dimensions. We analyze a continuous analog of numerical domain imbedding for bounded, smooth domains, and give an example of a simple numerical algorithm suggested by the continuous analysis. This algorithms is applicable for simply connected domains which can be covered by rectangular grids, with uniformly spaced grid lines in at least one coordinate direction. We also discuss a related FFT-based fast solver for Stokes problems with physical boundary conditions on rectangles, and present some numerical results.     

Fully discrete Galerkin approximations of parabolic boundary-value problems with nonsmooth boundary data

Summary In this paper we study the convergence properties of a fully discrete Galerkin approximation with a backwark Euler time discretization scheme. An approach based on semigroup theory is used to deal with the nonsmooth Dirichlet boundary data which cannot be handled by standard techniques. This approach gives rise to optimal rates of convergence inL _p[O,T;L ₂()] norms for boundary conditions inL _p[O,T;L ₂()], 1p.     

A posteriori error estimates for optimal control problems governed by parabolic equations

Summary. In this paper, we derive a posteriori error estimates for the finite element approximation of quadratic optimal control problem governed by linear parabolic equation. We obtain a posteriori error estimates for both the state and the control approximation. Such estimates, which are apparently not available in the literature, are an important step towards developing reliable adaptive finite element approximation schemes for the control problem. Received July 7, 2000 / Revised version received January 22, 2001 / Published online January 30, 2002 RID="*" ID="*" Supported by EPSRC research grant GR/R31980     

Vanishing line for the descent spectral sequence

We prove that if $f:X \to Y$ is a surjective, cohomologically (k - 1)-connected and proper map between locally compact spaces, then for the cohomological descent spectral sequence one has $E^{pq}_{2} = 0$ provided $q < pk$.     

Effects of uncertainties in the domain on the solution of Dirichlet boundary value problems

Summary. A domain with possibly non-Lipschitz boundary is defined as a limit of monotonically expanding or shrinking domains with Lipschitz boundary. A uniquely solvable Dirichlet boundary value problem (DBVP) is defined on each of the Lipschitz domains and the limit of these solutions is investigated. The limit function also solves a DBVP on the limit domain but the problem can depend on the sequences of domains if the limit domain is unstable with respect to the DBVP. The core of the paper consists in estimates of the difference between the respective solutions of the DBVP on two close domains, one of which is Lipschitz and the other can be unstable. Estimates for starshaped as well as rather general domains are derived. Their numerical evaluation is possible and can be done in different ways. Received October 16, 2001 / Revised version received January 16, 2002 / Published online: April 17, 2002 RID="*" ID="*" The research was funded partially by the National Science Foundation under the grants NSF–Czech Rep. INT-9724783 and NSF DMS-9802367 RID="**" ID="**" Support for Jan Chleboun coming from the Grant Agency of the Czech Republic through grant 201/98/0528 is appreciated     

À propos de l’indice de composition des nombres

 We define the index of composition λ(n) of an integer n ⩾ 2 as λ(n) = log n/log γ(n), where γ(n) stands for the product of the primes dividing n, and first establish that λ and 1/λ both have asymptotic mean value 1. We then establish that, given any ɛ > 0 and any integer k ⩾ 2, there exist infinitely many positive integers n such that . Considering the distribution function F(z,x) := #{n < x : λ(n) > z}, we prove that, given 1 < z < 2 and ɛ > 0, then, if x is sufficiently large,

The distribution of patterns of inverses modulo a prime

We investigate the distribution of the numbers x∈[1,p] for which all lie in a subset of the set of multiplicative inverses modulo a prime p. Here the a_i are integers coprime to p and the numbers are distinct .     

Symmetric incidence groupoids

In [7] point-reflection geometries were studied which can be derived from commutative kinematic spaces without involutory elements. But the class of point-reflection geometries is larger. For example, elliptic planes with their reflections cannot be derived from commutative kinematic spaces. Here we investigate a larger class of reflection geometries.This paper was sponsored by Vigoni Program 1999.     

A preconditioned domain decomposition algorithm for the solution of the elliptic Neumann problem

A new preconditioned conjugate gradient (PCG)-based domain decomposition method is given for the solution of linear equations arising in the finite element method applied to the elliptic Neumann problem. The novelty of the proposed method is in the recommended preconditioner which is constructed by using cyclic matrix. The resulting preconditioned algorithms are well suited to parallel computation.