基于蓝黄磷光二元互补色的高效聚合物白光器件

研究了基于互补色的高效聚合物白光器件,双色材料包括蓝绿光材料双(4,6-二氟苯基吡啶-N,C2)吡啶甲酰合铱(Firpic)和黄光材料三[3-(2,6-二甲基苯氧基)-6-(2-噻吩基)-哒嗪]铱(Fs-1),器件结构为ITO/PEDOT(40 nm)/PVK:OXD-7:Firpic:Fs-1(80 nm)/Ba(4 nm)/Al(120 nm).当发光层材料PVK∶OXD-7∶Firpic∶Fs-1质量比为63∶27∶10∶0.25时,用溶液加工方法得到高效白光器件,此时CIE色坐标为(0.30,0.39),最大电流效率为10.8 cd.A-1,亮度可达到4200 cd.m-2.在此基础上,引入水溶性电子注入材料聚[9,9-二(3′-N,N-二甲基胺基丙基-2,7-芴-2,7-交-(9,9-二辛基芴)](PFN)修饰阴极界面,使载流子注入和传输更平衡,当阴极为PFN(20 nm)/Al(120 nm)时,电流效率获得显著改善,达到13.1 cd.A-1,此时电流密度为4.9 mA.cm-2,亮度可达到6096 cd.m-2,白光器件的色坐标为(0.33,0.39),同时发光光谱稳定.另外通过电致发光(EL)、光致发光(PL)光谱及能级结构图分析了载流子俘获和能量转移在发光中的作用.     

The use of trehalose in the preparation of specimens for molecular electron microscopy

Biological specimens have to be prepared for imaging in the electron microscope in a way that preserves their native structure. Two-dimensional (2D) protein crystals to be analyzed by electron crystallography are best preserved by sugar embedding. One of the sugars often used to embed 2D crystals is trehalose, a disaccharide used by many organisms for protection against stress conditions. Sugars such as trehalose can also be added to negative staining solutions used to prepare proteins and macromolecular complexes for structural studies by single-particle electron microscopy (EM). In this review, we describe trehalose and its characteristics that make it so well suited for preparation of EM specimens and we review specimen preparation methods with a focus on the use of trehalose.     

基于径向基神经网络预测的混沌时间序列嵌入维数估计方法

根据Takens定理,研究了混沌时间序列相空间重构嵌入维数的选取问题.提出了基于径向基函数神经网络预测模型性能的嵌入维数估计方法,即根据嵌入维数与混沌时间序列预测模型性能的变化关系来确定嵌入维数.通过对几种典型混沌动力学系统的数值验证,结果表明该方法能够确定出合适的相空间重构嵌入维数. 关键词： 混沌 相空间重构 嵌入维数 预测     

Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications

In an earlier article the authors constructed a hamilton cycle embedding of in a nonorientable surface for all and then used these embeddings to determine the genus of some large families of graphs. In this two‐part series, we extend those results to orientable surfaces for all . In part II, a voltage graph construction is presented for building embeddings of the complete tripartite graph on an orientable surface such that the boundary of every face is a hamilton cycle. This construction works for all such that p is prime, completing the proof started by part I (which covers the case ) that there exists an orientable hamilton cycle embedding of for all , . These embeddings are then used to determine the genus of several families of graphs, notably for and, in some cases, for .     

A new Brézis‐Gallouët‐Wainger inequality from the viewpoint of the real interpolation functors

The Brézis‐Gallouët‐Wainger inequality describes a subtle embedding property into . The relation between the Brézis‐Gallouët‐Wainger inequality and the real interpolation functor together with the sharpness of the results is discussed in the present paper. As our first main results shows, it turns out that there are two intermediate terms between and the logarithmic boundedness, which is supposed to be the right‐hand side of the Brézis‐Gallouët‐Wainger inequality. As the second result, the first result is extended to inequalities which reflect the meaning of the second index of Besov spaces and the interpolation theorem.     

Small Embeddings of Partial Steiner Triple Systems

It was proved in 2009 that any partial Steiner triple system of order u has an embedding of order v for each admissible . This result is best possible in the sense that, for each , there exists a partial Steiner triple system of order u that does not have an embedding of order v for any . Many partial Steiner triple systems do have embeddings of orders smaller than , but much less is known about when these embeddings exist. In this paper, we detail a method for constructing such embeddings. We use this method to show that each member of a wide class of partial Steiner triple systems has an embedding of order v for at least half (or nearly half) of the orders for which an embedding could exist. For some members of this class we are able to completely determine the set of all orders for which the member has an embedding.     

Fast and exact synthesis of stationary multivariate Gaussian time series using circulant embedding

A fast and exact procedure for the numerical synthesis of stationary multivariate Gaussian time series with a priori prescribed and well controlled auto- and cross-covariance functions is proposed. It is based on extending the circulant embedding technique to the multivariate case and can be viewed as a modification and variation around the Chan and Wood algorithm proposed earlier to solve the same problem. The procedure is shown to yield time series possessing exactly the desired covariance structure, when sufficient conditions are satisfied. Such conditions are discussed theoretically and examined on several examples of multivariate time series models. Issues related to prescribing a priori the spectral structure rather than the covariance one are also discussed. Matlab routines implementing this procedure are publicly available at http://www.hermir.org.     

Cycle embedding in star graphs with more conditional faulty edges

The star graph is one of the most attractive interconnection networks. The cycle embedding problem is widely discussed in many networks, and edge fault tolerance is an important issue for networks since edge failures may occur when a network is put into use. In this paper, we investigate the cycle embedding problem in star graphs with conditional faulty edges. We show that there exist fault-free cycles of all even lengths from 6 to n! in any n-dimensional star graph S_n (n ? 4) with ?3n − 10 faulty edges in which each node is incident with at least two fault-free edges. Our result not only improves the previously best known result where the number of tolerable faulty edges is up to 2n − 7, but also extends the result that there exists a fault-free Hamiltonian cycle under the same condition.     

On Principal Eigenvalues for Indefinite Problems in Euclidean Space

For the eigenvalue problem—λΔu = q(x)u in IR^d, with the weight function q changing sign, conditions are discussed for existence of eigenvalues with positive decaying eigenfunctions.