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.     

Selective double Suzuki cross-coupling reactions. Synthesis of unsymmetrical diaryl (or heteroaryl) methanes

Using a double Suzuki cross-coupling reaction ortho- or para-bromobenzyl bromides are easily transformed into unsymmetrical diaryl (or heteroaryl) methanes     

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.     

Sequential nonlinear estimation with nonaugmented priors

How can the basic compatibility of theory and observations be investigated for nonlinear processes without requiring stochastic characterizations for residual error terms? The present paper proposes a flexible least-cost approach. For each possible estimatex for the sequence of process states, letc _D (x) andx _M(x) denote the costs incurred for deviations away from the prior dynamic specifications and prior measurement specifications, respectively. Define the cost-efficiency frontier to be the greatest lower bound for the set of all possible cost pairs [c _D (x),c _M(x)], conditional on the given observations. State sequence estimatesx that attain the cost-efficiency frontier indicate the possible ways that the actual process could have developed over time in a manner minimally incompatible with the prior dynamic and measurement specifications. An algorithm is developed for the exact sequential updating of the cost-efficient state sequence estimates as the duration of the process increases and additional observations are obtained.     

Microwave-promoted Suzuki-Miyaura coupling reactions in a cycloalkane-based thermomorphic biphasic system

Microwave-promoted Suzuki-Miyaura coupling reaction of aryl halides attached to a cycloalkane-soluble platform was accomplished in a cycloalkane-based thermomorphic biphasic system. Following irradiation and subsequent cooling, the monophasic reaction mixture immediately formed a biphasic solution to allow facile workup and separation of the product.     

A theorem on sequentiality and compactness, with its fuzzy extension

An amended proof of a theorem of Franklin's on sequentiality and sequential compactness is presented, and a corresponding fuzzy version formulated using the theory of quasi-coincidence.     

On a new stochastic global optimization algorithm based on censored observations

In this paper a new algorithm is proposed for global optimization problems. The main idea is that of modifying a standard clustering approach by sequentially sampling the objective function while adaptively deciding an appropriate sample size. Theoretical as well as computational results are presented.