盐酸伊达比星杂质A的合成工艺优化及其高效液相分析

通过对盐酸伊达比星脱羟基杂质A的合成研究，为盐酸伊达比星的质控标准提供参考。以盐酸伊达比星为起始原料，经过4步反应得到脱羟基杂质A。本文提供了盐酸伊达比星杂质A的制备方法以及高效液相色谱分析方法，为杂质含量控制提供了依据。该工艺可以稳定、快速制备高纯度脱羟基杂质A，制备总收率为57.20%，纯度为57.20%，其结构经¹H NMR， ¹³C NMR和MS(ESI)表征。     

Sobolev Stability of Plane Wave Solutions to the Nonlinear Schrödinger Equation

This article explores the questions of long time orbital stability in high order Sobolev norms of plane wave solutions to the NLSE in the defocusing case.     

Comparative studies on the mechanism of uridine phosphorolysis

We have used quantum mechanical method to study the transition states(TSs) of uridine phosphorolysis reaction. Comparing the four different reaction pathways and the five transition states obtained, we conclude that enzymatic uridine phosphorolysis takes place mainly according to acid-catalyzed SN2 mechanism. The proposed reaction pathway is consistent with many experimental results.     

金属与金刚石薄膜接触的电学特性研究

用热丝辅助化学汽相沉积技术在Si衬底上合成了含少量受主型杂质的近于本征的金刚石薄膜，并研究了三种金属（Cu，Ag和Al）与它接触的电学特性，以及退火对接触特性的影响．结果表明Cu，Ag与金刚石薄膜接触的电学特性比较类似，而Al则明显不同；而且退火对它们的接触特性影响很大 关键词：     

机载稳瞄控制系统模型及仿真分析

瞄准线高精度稳定是机载光电稳瞄系统的主要指标和关键技术。根据四框架稳瞄系统的工作原理，以手动跟踪模式为主要研究对象，建立了稳瞄伺服控制系统模型。考虑到直升机扰动特点，对线扰动、角速率扰动、摩擦力矩、弹性力矩等各种扰动因素也建立相应的数学模型，同时在各种扰动因素作用下利用Matlab对机载高精度稳瞄系统的手动跟踪控制模式进行了仿真设计分析和理论研究，设计出适合的控制器。此模型在实际系统中获得验证，对稳瞄伺服控制系统的设计具有参考意义。     

Conditional Symmetries and Solutions to a Class of Nonlinear Diffusion-Convection Equations

The present paper discusses a class of nonlinear diffusion-convection equations with source. The method that we use is the conditional symmetry method. It is shown that the equation admits certain conditional symmetries for coefficient functions of the equations. As a consequence, solutions to the resulting equations are obtained.     

Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.     

1+1/2对转涡轮叶排轴向间距对性能影响的研究

木文对1+1/2对转涡轮中轴向间距影响进行了初步研究。对不同轴向间距叶栅流场进行了大量时间精确模拟。研究表明,1+1/2对转涡轮高低压转叶间轴向间距成为追求高效率的制约因素,轴向间距为高压转叶喉部宽度是关键点。因此有关小轴向间距下强激波/叶排干扰的研究应该加强。     

On the critical exponents of random k‐SAT

There has been much recent interest in the satisfiability of random Boolean formulas. A random k‐SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known that when the number of variables n is large, there is a sharp transition from satisfiability to unsatisfiability; in the case of 2‐SAT this happens when m/n → 1, for 3‐SAT the critical ratio is thought to be m/n ≈ 4.2. The sharpness of this transition is characterized by a critical exponent, sometimes called ν = ν_k (the smaller the value of ν the sharper the transition). Experiments have suggested that ν₃ = 1.5 ± 0.1. ν₄ = 1.25 ± 0.05, ν₅ = 1.1 ± 0.05, ν₆ = 1.05 ± 0.05, and heuristics have suggested that ν_k → 1 as k → ∞. We give here a simple proof that each of these exponents is at least 2 (provided the exponent is well defined). This result holds for each of the three standard ensembles of random k‐SAT formulas: m clauses selected uniformly at random without replacement, m clauses selected uniformly at random with replacement, and each clause selected with probability p independent of the other clauses. We also obtain similar results for q‐colorability and the appearance of a q‐core in a random graph. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 182–195, 2002