任意多阶梯度场强毛细管凝胶电泳中谱带的迁移和展宽

在自行制备的毛细管凝胶电泳柱上，通过实验考察毛细管凝胶电泳（ＣＧＥ）中场强（Ｅ）和组分迁移率（μ）的关系，发现在一般ＣＧＥ使用的场强范围内，μ随Ｅ增大而成近似线性的增加。并讨论了产生这种现象的原因。以此为基础提供了任意多阶梯度场强毛细管凝胶电泳中组分的迁移时间和距离的计算公式，用于编制计算机程序。     

“能源化学”本科专业建设建议

"Energy chemistry" was approved as one of the chemistry majors for undergraduate by the Ministry of Education in 2015. Based on the ideas and ways of emerging engineering education, this paper hereby proposed some of constructive suggestions on the training objectives, graduation requirements, curriculum system, teaching contents, teaching staff and conditions for development of "energy chemistry" major.     

Complexation of Ni (II) and Zn(II) ions by 3-(1-naphthyI)-2-mercaptopropenoic acid

The complexation equilibria between Ni(II) and Zn(II) metal ions with 3-(1-naphthyl)-2-mercaptopropenoic acid (H₂NMP) were studied by glass electrode potentiometry, at 25 °C and 1.0 mol·dm^–3 in NaClO₄ as constant ionic medium in 50% (v/v) water-ethanol solutions. Formation constants for the complexes Ni(NMP), Ni(NMP) ₂ ^2– , Zn(NMP) and Zn(NMP) ₂ ^2– , refined by the MINIGLASS program, are reported.     

A Space-Time Polynomial Collocation Method for Solving 3D Burgers Equations北大核心CSCD

Burgers方程是一类应用广泛的非线性偏微分方程,方程中的非线性项难以处理。该文提出一种新的时空多项式配点法——多项式特解法求解三维Burgers方程。求解过程分为两步:第一步,对三维Burgers方程中的线性导数项(包括时间导数项),求出相应的多项式特解。第二步,将求出的多项式特解作为基函数,对三维Burgers方程中剩余的非线性项进行迭代求解。与时空多项式函数作为基函数对三维Burgers方程进行直接求解相比,该算法简单易行,得到的近似解精度非常高,算法极其稳定,对于教学过程中提高学生的编程能力,加深对高维Burgers方程的理解能力以及Burgers方程的实际应用具有重要意义。     

Two-point AG codes from the Beelen-Montanucci maximal curve

In this paper we investigate two-point algebraic-geometry codes (AG codes) coming from the Beelen-Montanucci (BM) maximal curve. We study properties of certain two-point Weierstrass semigroups of the curve and use them for determining a lower bound on the minimum distance of such codes. AG codes with better parameters with respect to comparable two-point codes from the Garcia-Güneri-Stichtenoth (GGS) curve are discovered.     

Stability of multistage stochastic programming

In this paper, we study the stability of multistage stochastic programming with recourse in a way that is different from that used in studying stability of two-stage stochastic programs. Here, we transform the multistage programs into mathematical programs in the space ⁿ ×L _p with a simple objective function and multistage stochastic constraints. By investigating the continuity of the multistage multifunction defined by the multistage stochastic constraints and applying epi-convergence theory we obtain stability results for linear and linear-quadratic multistage stochastic programs.Project supported by the National Natural Science Foundation of China.     

Two new bounds on the size of binary codes with a minimum distance of three

We prove two new upper bounds on the size of binary codes with a minimum distance of three, namelyA(10, 3)76 andA(11, 3)152.     

On the classification of geometric codes by polynomial functions

It is shown how to represent algebraically all functions that have a zero sum on all -dimensional subspaces ofPG(n,q) or ofAG(n,q). In this way one can calculate the dimensions of related codes, or one can represent interesting sets of points by functions.     

Misclassification minimization

The problem of minimizing the number of misclassified points by a plane, attempting to separate two point sets with intersecting convex hulls inn-dimensional real space, is formulated as a linear program with equilibrium constraints (LPEC). This general LPEC can be converted to an exact penalty problem with a quadratic objective and linear constraints. A Frank-Wolfe-type algorithm is proposed for the penalty problem that terminates at a stationary point or a global solution. Novel aspects of the approach include: (i) A linear complementarity formulation of the step function that counts misclassifications, (ii) Exact penalty formulation without boundedness, nondegeneracy or constraint qualification assumptions, (iii) An exact solution extraction from the sequence of minimizers of the penalty function for a finite value of the penalty parameter for the general LPEC and an explicitly exact solution for the LPEC with uncoupled constraints, and (iv) A parametric quadratic programming formulation of the LPEC associated with the misclassification minimization problem.This material is based on research supported by Air Force Office of Scientific Research Grant F49620-94-1-0036 and National Science Foundation Grants CCR-9101801 and CDA-9024618.     

一种利用小波降噪的卫星导航信号并行捕获算法

针对全球定位系统（Global Positioning System,GPS）接收机传统捕获算法计算复杂度高、捕获灵敏度低等缺点,提出了一种可降噪的简化并行码相位捕获（Noise Reduction for Simplified Parallel Code Phase Acquisition,NR-SPCA）算法。该算法通过对信号降采样,利用小波变换对二次采样信号作降噪处理,提高了捕获灵敏度;利用GPS信号和C/A码互相关的稀疏性,并行计算降噪后的信号的相关值,提高了运算效率。仿真结果表明,在90%概率捕获成功的前提下,NR-SPCA算法比传统的PCA算法信噪比低1 dB,运算效率提升了100%。该算法还可应用于航天探测、自动驾驶等领域。