Syntheses and characterization of 16‐arm star and star diblock copolymer and AB8 9‐miktoarm star copolymer via NMRP and ROP from dendritic multifunctional macroinitiators

A dendritic macroinitiator having 16 TEMPO‐based alkoxyamines, Star‐16 , was prepared by the reaction of a dendritic macroinitiator having eight TEMPO‐based alkoxyamines, [G‐3]‐OH , with 4,4′‐bis(chlorocarbonyl)biphenyl. The nitroxide‐mediated radical polymerization (NMRP) of styrene (St) from Star‐16 gave 16‐arm star polymers with PDI of 1.19–1.47, and NMPR of 4‐vinylpyridine from the 16‐arm star polymer gave 16‐arm star diblock copolymers with PDI of 1.30–1.43. The ring‐opening polymerization of ε‐caprolactone from [G‐3]‐OH and the subsequent NMRP of St gave AB₈ 9‐miktoarm star copolymers with PDI of 1.30–1.38. The benzyl ether linkages of the 16‐arm star polymers and the AB₈ 9‐miktoarm star copolymers were cleaved by treating with Me₃SiI, and the resultant poly(St) arms were investigated by size exclusion chromatography (SEC). The SEC results showed PDIs of 1.23–1.28 and 1.18–1.22 for the star polymers and miktoarm stars copolymers, respectively, showing that they have well‐controlled poly(St) arms. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 1159–1169, 2007.     

Parallelization of population-based multi-objective meta-heuristics: An empirical study

In single-objective optimization it is possible to find a global optimum, while in the multi-objective case no optimal solution is clearly defined, but several that simultaneously optimize all the objectives. However, the majority of this kind of problems cannot be solved exactly as they have very large and highly complex search spaces. Recently, meta-heuristic approaches have become important tools for solving multi-objective problems encountered in industry as well as in the theoretical field. Most of these meta-heuristics use a population of solutions, and hence the runtime increases when the population size grows. An interesting way to overcome this problem is to apply parallel processing. This paper analyzes the performance of several parallel paradigms in the context of population-based multi-objective meta-heuristics. In particular, we evaluate four alternative parallelizations of the Pareto simulated annealing algorithm, in terms of quality of the solutions, and speedup.     

Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem

In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size.     

Analysis of Static Simulated Annealing Algorithms

Generalized hill climbing (GHC) algorithms provide a framework for modeling local search algorithms to address intractable discrete optimization problems. This paper introduces a measure for determining the expected number of iterations to visit a predetermined objective function level, given that an inferior objective function level has been reached in a finite number of iterations. A variation of simulated annealing (SA), termed static simulated annealing (S²A), is analyzed using this measure. S²A uses a fixed cooling schedule during the algorithm execution. Though S²A is probably nonconvergent, its finite-time performance can be assessed using the finite-time performance measure defined in this paper.     

Azine bridged silver coordination polymers: Powder X-ray diffraction route to crystal structure determination of silver benzotriazole

In continuation of our interest in solid-state structures of silver complexes of photographic importance, the structure for silver benzotriazole (AgBZT), has now been obtained. The preferred method for solving crystal structures is via single-crystal X-ray diffraction (XRD). However, for some materials, growing single crystals of appropriate size and quality is often difficult or even impossible. AgBZT is an example of such a silver complex with poor solubility. The usual routes to preparing single crystals using recrystallization from a cooperating solvent resulted in polycrystalline powder samples. We propose a crystal structure for AgBZT, solved from synchrotron X-ray powder diffraction data, using a direct-space Monte Carlo simulated annealing approach. AgBZT crystals are monoclinic, (P2₁/c), with unit cell dimensions, a=14.8052(3) Å, b=3.7498(4) Å, c=12.3495(12) Å, and β=114.200(6)°. The AgBZT complex is constructed from all three of the Benzotriazole (BZT) nitrogens bonding to a separate silver atom. As a consequence of this bonding mode, the structure is a highly cross-linked, coordination polymer.     

On the Spectral Radius of Trees with the Given Diameter d

Let T denote a tree with the diameter d(d≥2) and order n. Let P^*d,r,n-d-1denote the tree obtained by identifying the rth vertex of path Pd l and the center of starKl,K1,n-d-1, where r = r(d) is the integer part about d 2/2. Then p(T)≤ p(P^*d,r,n-d-1), andequality holds if and only if T≌P^*d,r,n-d-1     

Complex polymer architectures through dimethoxymethyl 1,1‐diphenylethylene derivatives

The reactions of polystyryllithium and potassium on dimethoxymethyl 1,1‐diphenylethylene derivatives were studied in different solvents. In a polar medium, A₃ and A₆ star types were formed according to the stoichiometry, whereas in a nonpolar medium, hyperbranched structures were synthesized. Extensions of an already proposed mechanism in polar and nonpolar media were examined. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 3329–3335, 2003     

数量级在物理实验中的应用

介绍了数量级在物理实验设计、实验失败原因分析、误差分析及实验结果判断方面的应用．     

Synthesis and characterization of 6‐ and 12‐arm star polymers by nitroxide‐mediated radical polymerization of St and MA from dendritic TIPNO‐based hexafunctional and dodecafunctional macroinitiators

Dendritic multifunctional macroinitiators having six and 12 TIPNO‐based alkoxyamines, TIPNO‐6 and TIPNO‐12 , were synthesized and used in the living radical polymerization of styrene (St), methyl acrylate (MA), N,N‐dimethylacrylamide (DMAAm), and isoprene (IP). The polymerizations of St initiated with TIPNO‐6 gave 6‐arm star polymers with narrow polydispersities of 1.14–1.18. In the polymerizations of MA initiated with TIPNO‐6 and TIPNO‐12 , the influences of added TIPNO on the polydispersity indexes (PDIs) of the resulting star polymers were first investigated, and this led to the successful formation of poly(MA) star polymers with narrow polydispersities (1.10–1.18). Moreover, the polymerizations of DMAAm and IP from TIPNO‐6 in the presence or absence of TIPNO were briefly investigated. The benzyl ether bonds of the poly(St) and poly(MA) star polymers were cleaved by treating with Me₃SiI or Pd/C, and the resulting arm's parts were analyzed with SEC. The PDIs of the resulting arm parts were low (1.19–1.23), and the M_ns agreed with the M_n,theor, indicating that the poly(St) and poly(MA) star polymers had well‐controlled arms. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 4364–4376, 2007     

A Generalized Markov Sampler

A recent development of the Markov chain Monte Carlo (MCMC) technique is the emergence of MCMC samplers that allow transitions between different models. Such samplers make possible a range of computational tasks involving models, including model selection, model evaluation, model averaging and hypothesis testing. An example of this type of sampler is the reversible jump MCMC sampler, which is a generalization of the Metropolis–Hastings algorithm. Here, we present a new MCMC sampler of this type. The new sampler is a generalization of the Gibbs sampler, but somewhat surprisingly, it also turns out to encompass as particular cases all of the well-known MCMC samplers, including those of Metropolis, Barker, and Hastings. Moreover, the new sampler generalizes the reversible jump MCMC. It therefore appears to be a very general framework for MCMC sampling. This paper describes the new sampler and illustrates its use in three applications in Computational Biology, specifically determination of consensus sequences, phylogenetic inference and delineation of isochores via multiple change-point analysis.