氢化丁苯共聚物结构的核磁共振波谱表征Ⅱ.微观结构的定量计算

在氢化丁苯共聚物¹³C-NMR谱脂肪碳部分谱带归属的基础上,根据各谱带的主要来源,推导出六个二单元浓度的计算公式。计算出二单元、一单元的相对含量,各结构单元的数均序列长度、嵌段含量和其它结构参数。加氢前后的¹H-和¹³C-NMR谱的组成计算结果基本一致。初步探讨了作为粘度指数改进剂的氢化丁苯共聚物微观结构与性能的关系,为合成提供了依据。     

金属β-二酮化合物用于MOCVD法生长铁电氧化物薄膜

对用于MOCVD法生长铁电氧化物薄膜的金属β－二酮化合物的制备、结构及性质进行了评述，对它们在生长铁电薄膜中的应用现状进行了介绍，并对它们的应用前景作了展望。     

Bounds for the Least Laplacian Eigenvalue of a Signed Graph

A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated.     

基于ZBLANⅩⅣPr,Yb频率上转换发光的三维立体显示

本文对利用ZBLANⅩⅣPr,Yb频率上转换发光的三维立体显示做了研究,探讨了其中的一些物理问题.在实验中,我们利用Yb³⁺离子敏化的方法提高Pr³⁺的上转换发光效率;通过降低能引起单频上转换发光的激光强度来提高寻址点和非寻址点在显示过程中的对比度.     

一类几乎最优循环图{C_p(m,m+1,p/a)}

本文比较了循环图类{c_p(n_1,…,n_p)}和{c-p(n_1…,n_p,p/α)}的直径下界。对于p和α满足一定条件的循环图类{c_p(n_1,n_2,p/α)},本文给出了达到或几乎达到此图类直径下界的一类几乎最优循环图{c_p(m,m+1,p/α)}。     

利用排列熵检测近40年华北地区气温突变的研究

运用一种新的动力学突变检测方法——排列熵(permutation entropy，PE)算法，计算并分析了中国华北地区52个站点1960年—2000年逐日平均气温资料的排列熵演化情况，发现中国华北地区气温在20世纪70年代中期、80年代初均发生了较大突变；进一步用经验模态分解(empirical mode decomposition，EMD)方法对排列熵序列进行逐级平稳化处理，结果发现这一地区的气温突变与准10年这一年代际时间尺度的周期变率密切相关，其原因与太阳黑子活动有着密切联系. 关键词： 华北 突变 排列熵算法 经验模态分解     

An interior trust region algorithm for solving linearly constrained nonlinear optimization

In this paper, an interior point algorithm based on trust region techniques is proposed for solving nonlinear optimization problems with linear equality constraints and nonnegative variables. Unlike those existing interior-point trust region methods, this proposed method does not require that a general quadratic subproblem with a trust region bound be solved at each iteration. Instead, a system of linear equations is solved to get a search direction, and then a linesearch of Armijo type is performed in this direction to obtain a new iteration point. From a computational point of view, this approach may in general reduce a computational effort, and thus improve the computational efficiency. Under suitable conditions, it is proven that any accumulation of the sequence generated by the algorithm satisfies the first-order optimality condition.