Studies on metabolism of total glucosides of paeony from Paeoniae Radix Alba in rats by UPLC‐Q‐TOF‐MS/MS

Total glucosides of paeony are the active constituents of Paeoniae Radix Alba. In this study, a novel strategy was proposed to find more metabolites and the differences between paeoniflorin, albiflorin and total glucosides of paeony (TGP). This strategy was characterized as follows: firstly, the animals were divided into three groups (paeoniflorin, albiflorin and TGP) to identify the source of TGP metabolites from paeoniflorin or albiflorin; secondly, a generic information‐dependent acquisition scan for the low‐level metabolites was triggered by the multiple mass defect filter and dynamic background subtraction; thirdly, the metabolites were identified with a combination of data‐processing methods including mass defect filtering, neutral loss filtering and product ion filtering; finally, a comparative study was used in the metabolism of paeoniflorin, albiflorin and TGP. Based on the strategy, 18 metabolites of TGP, 10 metabolites of paeoniflorin and 13 metabolites of albiflorin were identified respectively. The results indicated that the hydrolysis, conjugation reaction and oxidization were the major metabolic pathways, and the metabolic sites were the glycosidic linkage, the ester bond and the benzene ring. This study is first to explore the metabolism of TGP, and these findings enhance our understanding of the metabolism and the interactions of paeoniflrin and albiflorin in TGP. Copyright © 2015 John Wiley & Sons, Ltd.     

Facile non‐lithographic route to highly aligned silica nanopatterns using unidirectionally aligned polystyrene‐block‐polydimethylsiloxane films

Thin films (monolayer and bilayer) of cylinder forming polystyrene‐block‐polydimethylsiloxane (PS‐b‐PDMS) were shear aligned by the swelling and deswelling of a crosslinked PDMS pad that was physically adhered to the film during solvent vapor annealing. The nanostructures formed by self‐assembly were exposed to ultraviolet‐ozone to partially oxidize the PDMS, followed by calcination in air at 500 °C. In this process, the PS segments were fully decomposed, while the PDMS yielded silica nanostructures. The highly aligned PDMS cylinders were thus deposited as silica nanolines on the silicon substrate. Using a bilayer film, the center‐to‐center distance of these features were effectively halved from 38 to 19 nm. Similarly, by sequential shear‐alignment of two distinct layers, a rhombic array of silica nanolines was fabricated. This methodology provides a facile route to fabricating complex topographically patterned nanostructures. © 2015 Wiley Periodicals, Inc. J. Polym. Sci., Part B: Polym. Phys. 2015 , 53, 1058–1064     

Catalytic synthesis of single-crystalline gallium nitride nanobelts

Single-crystalline gallium nitride nanobelts have been synthesized through the reaction of gallium vapor with flowing ammonia using nickel as a catalyst. The as-synthesized products were characterized using X-ray powder diffraction (XRD), scanning electron microscopy, energy-dispersive X-ray spectroscopy, transmission electron microscopy, and selected-area electron diffraction (SAED). XRD and SAED results revealed that the products are pure, single-crystalline GaN with hexagonal structure. The widths and thickness of the nanobelts ranged from 80 to 200 nm, and 10 to 30 nm, respectively. The lengths were up to several tens of micrometers. The nanobelts had smooth surface with no amorphous sheath, and a sharp-tip end. The growth mechanism of nanobelts was discussed.     

Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.