桉树杂交种与其亲本的近红外光谱判别

研究桉树控制授粉后目标性状的基因作用方式是探索其基因重组规律的重要内容。常规的数量统计分析精度往往不高,而DNA分析的专业要求高,且费时费力。该研究利用近红外光谱(NIRs)研究不同基因型桉树杂交种、亲本及杂交种与亲本间近红外光谱信息的关系,探索NIRs用于桉树杂交种与其亲本判别的可行性和准确性。以控制授粉的桉树亲本及其杂交F1代材料为对象,每种基因型从各自田间试验分别选取10个单株,采集树冠中上部新鲜健康叶片。用手持式近红外仪Phazir Rx(1624)采集桉树杂交种与其亲本叶片的NIRs信息。每单株选10片完全生理成熟的健康叶片,避开叶脉扫描其正面光谱5次,以50条NIRs信息的均值代表单个叶片的NIRs信息,最终每个基因型获得10条NIRs信息。对原始NIRs采用二阶多项式S.G一阶导数预处理。预处理后的NIRs用于多元统计分析,首先对桉树杂交亲本和子代样本进行主成分分析(PCA),直观展示不同基因型的分类情况。然后运用簇类独立软模式(SIMCA)和偏最小二乘判别分析(PLS-DA)两种有监督的判别模式验证NIRs用于桉树杂交种与其亲本树种的分类判别效果。PCA结果显示,不同的亲本间、杂交种间及杂交种与亲本间样本的主因子得分可以清晰地将各基因型分开。SIMCA模式判别分析中,桉树杂交种样本到亲本PCA模型的样本距离显示,待判别样本能够形成单独的聚类,且能直观反映两者的遗传相似。PLS-DA判别结果显示,桉树杂交亲本的PLS模型能通过预测其杂交子代的响应变量将其与亲本准确分开。结果表明,桉树叶片的NIRs信息可以准确地反映桉树杂交子代遗传信息的传递规律,NIRs判别模型可以准确地将各种基因型予以区分。因此,NIRs信息不仅可用于桉树杂交种和纯种的定性判别,还可以分析桉树基因重组过程中加性遗传效应的大小,从而为桉树遗传基础分析及其育种改良研究提供理论支撑。     

Fluid‐structure coupling of linear elastic model with compressible flow models

Cavitation erosion is caused in solids exposed to strong pressure waves developing in an adjacent fluid field. The knowledge of the transient distribution of stresses in the solid is important to understand the cause of damaging by comparisons with breaking points of the material. The modeling of this problem requires the coupling of the models for the fluid and the solid. For this purpose, we use a strategy based on the solution of coupled Riemann problems that has been originally developed for the coupling of 2 fluids. This concept is exemplified for the coupling of a linear elastic structure with an ideal gas. The coupling procedure relies on the solution of a nonlinear equation. Existence and uniqueness of the solution is proven. The coupling conditions are validated by means of quasi‐1D problems for which an explicit solution can be determined. For a more realistic scenario, a 2D application is considered where in a compressible single fluid, a hot gas bubble at low pressure collapses in a cold gas at high pressure near an adjacent structure.     

Modification of Polylactide Nonwovens with Carbon Nanotubes and Ladder Poly(silsesquioxane)

Electrospun nonwovens of poly(L-lactide) (PLLA) modified with multiwall carbon nanotubes (MWCNT) and linear ladder-like poly(silsesquioxane) with methoxycarbonyl side groups (LPSQ-COOMe) were obtained. MWCNT and LPSQ-COOMe were added to the polymer solution before the electrospinning. In addition, nonwovens of PLLA grafted to modified MWCNT were electrospun. All modified nonwovens exhibited higher tensile strength than the neat PLA nonwoven. The addition of 10 wt.% of LPSQ-COOMe and 0.1 wt.% of MWCNT to PLLA increased the tensile strength of the nonwovens 2.4 times, improving also the elongation at the maximum stress.     

Local linear convergence analysis of Primal–Dual splitting methods

In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice.     

Synthesis of self‐healing polyurethane urea‐based supramolecular materials

Supramolecular polyurethane ureas are expected to have superior mechanical properties primarily due to the reversible, noncovalent interactions such as hydrogen bonding interactions. We synthesized polyurethane prepolymers from small molecular weight of poly(tetramethylene ether)glycol and isophorone diisocyanates, which were end capped with propylamine to synthesize polyurethane ureas with high contents of urea and urethane groups for hydrogen‐bonding formations to facilitate self‐healing. The effects of polyurethane urea molecular weight (3000 ≤ M_n ≤ 9000), crosslinking, and cutting direction were studied in terms of thermal, mechanical, and morphological properties with an emphasis on the self‐healing efficiency. It was found that the thermal self‐healability was more pronounced as the molecular weight of polyurethane urea decreased, showing a maximum of more than 96% with 3000 M_n when the sample was cut along the stretch direction. © 2014 Wiley Periodicals, Inc. J. Polym. Sci., Part B: Polym. Phys. 2015 , 53, 468–474     

Spectral estimates for saddle point matrices arising in weak constraint four‐dimensional variational data assimilation

We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds.     

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.     

SPECTRUM-PRESERVING ELEMENTARY OPERATORS ON B（X）

1.IntroductionLetXbeaninfinitedimensionalcomplexBanachspaceandB(X)theBanachalgebraofallboundedlinearoperatorsonX.ForTEB(X),a(T),asusual,willdenotethespectrumofT.Let4bealinearmapfromB(X)intoitself.4isspectrum-preservingifa(di(T))=a(T)forallTEB(X);4isspectrum-compressingifa(4(T))ga(T)forallTEB(X).Itisclearthatif4isunital(i.e.,ac(I)=I),thenacisspectrum-preserving(spectrum-compressing)ifandonlyif4preservesinvertibilityinbothdirections(preservesinvertibility),i.e.,4(T)isinvertibleifando…     

Recursive partition and amalgamation with the exponential family: Theory and applications

The theory of tree-growing (RECPAM approach) is developed for outcome variables which are distributed as the canonical exponential family. The general RECPAM approach (consisting of three steps: recursive partition, pruning and amalgamation), is reviewed. This is seen as constructing a partition with maximal information content about a parameter to be predicted, followed by simplification by the elimination of ‘negligible’ information. The measure of information is defined for an exponential family outcome as a deviance difference, and appropriate modifications of pruning and amalgamation rules are discussed. It is further shown how the proposed approach makes it possible to develop tree-growing for situations usually treated by generalized linear models (GLIM). In particular, Poisson and logistic regression can be tree-structured. Moreover, censored survival data can be treated, as in GLIM, by observing a formal equivalence of the likelihood under random censoring and an appropriate Poisson model. Three examples are given of application to Poisson, binary and censored survival data.