Benson真有效意义下集值优化的广义最优性条件

本文引入了关于集值映射的α-阶Clarke切导数、α-阶邻接切导数及α-阶 伴随切导数的概念,借此建立了约束向量集值优化Benson真有效解导数型的Kuhn- Tucker条件.     

酸糖蛋白手性柱分离6种手性化合物

通过考察缓冲液种类、浓度及其pH值对对映体在手性柱上的保留和分离行为的影响,以及流动相中加入不同种类、不同浓度的不带电荷的有机溶剂乙腈、甲醇、正丙醇、异丙醇、流动相流速和柱温对对映体分离能力的影响,优化了含碳手性中心的碱性药物苯丙哌林、酸性化合物MT-A5及MT-酸和含硫手性中心的质子泵抑制剂奥美拉唑、泮托拉唑、雷贝拉唑对映体分离条件,最佳手性分离条件为:苯丙哌林,0.05 mol/L磷酸二氢铵缓冲液(pH 3.0)-乙腈(95∶5,V/V)为流动相,流速为0.7 mL/m in,柱温为20℃;MT-A5及MT-酸,流动相为0.01 mol/L醋酸铵缓冲液(pH 5.0)-乙腈(74∶26,V/V),流速为0.9 mL/m in,柱温为20℃;泮托拉唑,流动相为10 mmol/L醋酸铵缓冲液(pH 5.5)-乙腈(93∶7,V/V),流速为0.9 mL/m in;柱温为20℃;奥美拉唑和雷贝拉唑,流动相为0.01 mol/L醋酸铵缓冲液(pH 3.0)-乙腈(95∶5,V/V),流速为0.7 mL/m in,柱温为20℃。实现了应用高效液相色谱法在α1-酸糖蛋白手性柱上对上述化合物的对映体分离,并成功用于手性药物合成中的对映体过量百分率的测定。     

A microspectroscopic study of the electronic homogeneity of ordered and disordered Sr2FeMoO6

Disordered Sr₂FeMoO₆ shows a drastic reduction in saturation magnetization compared to highly ordered samples, moreover magnetization as a function of the temperature for different disordered samples shows qualitatively different behaviours. We investigate the origin of such diversity by performing spatially resolved photoemission spectroscopy on various disordered samples. Our results establish that e_xtensive electronic inhomogeneity, arising most probably from an underlying chemical inhomogeneity in disordered samples, is responsible for the observed magnetic inhomogeneity. It is further pointed out that these inhomogeneities are connected with composition fluctuations of the type Sr₂Fe_1+x Mo_1-x O₆ with Fe-rich (x > 0) and Mo-rich (x < 0) regions. Dedicated to Prof J Gopalakrishnan on his 62nd birthday.     

Conditional expectation of integrands and random sets

The conditional expectation of integrands and random sets is the main tool of stochastic optimization. This work wishes to make up for the lack of real synthesis about this subject. We improve the existing hypothesis and simplify the corresponding proofs. In the convex case we especially study the problem of the exchange of conditional expectation and subdifferential operators.     

Characteristics and structures of weak efficient surfaces of production possibility sets

This paper studies the characteristics and structure of the weak surface of the production possibility set. We apply techniques and methods of transferring a polyhedral cone from its intersection form to its sum form, identify an intersection representation of the production possibility set. We give the structure theorem of weak surface of the production possibility set, which includes three complementary slackness conditions. We define the input weak efficiency and output weak efficiency for different DEA models according to the representation of the intersection form. It investigates the characteristics of the weak surfaces, and proves the structure theorems of input weak DEA efficiency and output weak DEA efficiency. The structure theorems establish weighted combination of inputs and outputs that are weak DEA efficient. Numerical examples are provided for illustration.     

Hele-Shaw type problems with dynamical boundary conditions

In this paper, we study the nonlinear evolution equation of Hele-Shaw type with dynamical boundary conditions. That is, the equation ut=Δw+f where u∈H(w) and H is the Heaviside function, with boundary condition μ(x,w)t_∂w+k∇w⋅ν=g, where ν denotes the outward normal vector of the fixed boundary of the domain. We prove existence, uniqueness and some qualitative properties of the solution.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Rn上的非初等变换群及其极限集

该文对高维非初等Mò'bius变换群进行了研究,得到了一些重要性质,给出了几个关于离散准则和代数收敛性的定理.     

一类递归集的Hausdorff维数及Bouligand维数

本文给出递归集的Ｈａｕｓｄｏｒｆｆ维数的下界估计，并由此确定了一类递归集的维数，所获结果包含并推广了Ｂｅｄｆｏｒｄ，Ｄｅｋｋｉｎｇ及文志英、钟红柳等人的有关结果。     

Complex projections of completely positive quaternionic maps

We show that the complex projection of a completely positive quaternionic map of quaternionic density matrices is a positive map in the space of complex density matrices, and we briefly outline some of its properties. To illustrate this result, we study the complex projection of a one-parameter quaternionic unitary dynamics of a spin-1/2 quantum system. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 151, No. 3, pp. 360–370, June, 2007.