Precise Synthesis and Thin Film Self-Assembly of PLLA-b-PS Bottlebrush Block Copolymers

The ability of bottlebrush block copolymers (BBCPs) to self-assemble into ordered large periodic structures could greatly expand the scope of photonic and membrane technologies. In this paper, we describe a two-step synthesis of poly(l-lactide)-b-polystyrene (PLLA-b-PS) BBCPs and their rapid thin-film self-assembly. PLLA chains were grown from exo-5-norbornene-2-methanol via ring-opening polymerization (ROP) of l-lactide to produce norbornene-terminated PLLA. Norbonene-terminated PS was prepared using anionic polymerization followed by a termination reaction with exo-5-norbornene-2-carbonyl chloride. PLLA-b-PS BBCPs were prepared from these two norbornenyl macromonomers by a one-pot sequential ring opening metathesis polymerization (ROMP). PLLA-b-PS BBCPs thin-films exhibited cylindrical and lamellar morphologies depending on the relative block volume fractions, with domain sizes of 46–58 nm and periodicities of 70–102 nm. Additionally, nanoporous templates were produced by the selective etching of PLLA blocks from ordered structures. The findings described in this work provide further insight into the controlled synthesis of BBCPs leading to various possible morphologies for applications requiring large periodicities. Moreover, the rapid thin film patterning strategy demonstrated (>5 min) highlights the advantages of using PLLA-b-PS BBCP materials beyond their linear BCP analogues in terms of both dimensions achievable and reduced processing time.     

Conceptual continuity as a mode of understanding complex systems: Applications to the dynamics sociopolitical systems

In complex biological systems, entities that are conceptually distinct but empirically related—such as sunlight and plant growth or antigene and immune response—are being explicitly linked through the identification of highly specific uninterrupted interaction sequences that take place between their macromolecular system components. These uninterrupted sequences of causation include common elements that are shared by the empirically related but conceptually distinct entities. Through the identification of specific shared elements, “conceptual continuity” is established between these entities. Examples are introduced to suggest that in sociopolitical systems, an analogous conceptual continuity can be established between distinct sociopolitical entities. The identification of specific shared elements, essential for the well being of each of the entities, can play a significant role in resolving conflicts between those separated by seemingly insurmountable obstacles such as race or religion or ideology. © 2006 Wiley Periodicals, Inc. Complexity 11:20–24, 2006     

Preservation of Lipschitz constants by Bernstein type operators

Summary We obtain preservation inequalities for Lipschitz constants of higher order in simultaneous approximation processes by Bernstein type operators. From such inequalities we derive the preservation of the corresponding Lipschitz spaces.     

一类图的特征多项式与匹配多项式

本文对一类具有对称轴的图A_n(n≥0),得到了它的特征多项式及匹配多项式的精确表达式;同时还得到A_(?)的完美匹配数。     

On the Behaviors of Hyperspace Topologies for Subspaces

For a topological space X we denote by CL(X) the collection of all nonempty closed subsets of X. Suppose we have a map T which assigns in some coherent way to every topological space X some topology T(X) on CL(X). In this paper we study continuity and inverse continuity of the map iA,X :(CL(A),T{A)) → (CL(X),T(X)) defined by iA,x(F) = F whenever F ∈CL(A), for various assignment T; in particular, for locally finite topology, upper Kuratowski topology, and Attouch-Wets topology, etc.     

Multilevel a posteriori error analysis for reaction–convection–diffusion problems

We present a new approach to the a posteriori error analysis of stable Galerkin approximations of reaction–convection–diffusion problems. It relies upon a non-standard variational formulation of the exact problem, based on the anisotropic wavelet decomposition of the equation residual into convection-dominated scales and diffusion-dominated scales. The associated norm, which is stronger than the standard energy norm, provides a robust (i.e., uniform in the convection limit) control over the streamline derivative of the solution. We propose an upper estimator and a lower estimator of the error, in this norm, between the exact solution and any finite dimensional approximation of it. We investigate the behaviour of such estimators, both theoretically and through numerical experiments. As an output of our analysis, we find that the lower estimator is quantitatively accurate and robust.     

Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets

This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms.     

Efficient Sequential Quadratic Programming Implementations for Equality-Constrained Discrete-Time Optimal Control

Efficient sequential quadratic programming (SQP) implementations are presented for equality-constrained, discrete-time, optimal control problems. The algorithm developed calculates the search direction for the equality-based variant of SQP and is applicable to problems with either fixed or free final time. Problem solutions are obtained by solving iteratively a series of constrained quadratic programs. The number of mathematical operations required for each iteration is proportional to the number of discrete times N. This is contrasted by conventional methods in which this number is proportional to N ³. The algorithm results in quadratic convergence of the iterates under the same conditions as those for SQP and simplifies to an existing dynamic programming approach when there are no constraints and the final time is fixed. A simple test problem and two application problems are presented. The application examples include a satellite dynamics problem and a set of brachistochrone problems involving viscous friction.     

GIRSANOV'S THEOREM ON ABSTRACT WIENER SPACES

ＧＩＲＳＡＮＯＶ’ＳＴＨＥＯＲＥＭＯＮＡＢＳＴＲＡＣＴＷＩＥＮＥＲＳＰＡＣＥＳＺＨＡＮＧＹＩＮＮＡＮＡｂｓｔｒａｃｔＬｅｔ（Ｅ，Ｈ，μ）ｂｅａｎａｂｓｔｒａｃｔＷｉｅｎｅｒｓｐａｃｅｉｎｔｈｅｓｅｎｓｅｏｆＬ．Ｇｒｏｓ．Ｉｔｉｓｐｒｏｖｅｄｔｈ...