Assignment of conformation-sensitive near-infrared bands in high-spin ferrous haemoproteins. Low-temperature magnetic circular dichroism data

An assignment of the near-infrared bands in the 600–800 nm spectral region observed in magnetic circular dichroism (MCD) spectra of high-spin ferrous haemoproteins is presented. The assignment is based on a relative energy level scheme for iron d-electrons, a comparison of predicted and measured temperature dependences of MCD intensity, a sign of MCD bands and a group theoretical analysis of allowed transitions. The proposed assignment is consistent with the ∼15-nm red shift of the ∼760 nm band on breakage of the Fe-His bond in deoxy-myoglobin at low pH, with low-temperature photolysis experiments available for CO complexes of several haemoproteins. In accordance with the observations, the intensity of the MCD bands for proteins with a sulphur anion of cysteine as proximal haemligand (cytochrome P450 and chloroperoxidase) is predicted to be diminished by at least one order of magnitude compared to that for proteins with an imidazole of a histidine as a protein-derived haemligand (i.e. myoglobin, haemoglobin and horseradish peroxidase). Received: 4 February 1997 / Accepted: 1 May 1997     

一类经典”秘书问题”的推广

”秘书问题”在最优停时理论的发展中曾起过重要作用 ,实际中的一类问题与”秘书问题”有类似之处 ,但比”秘书问题”更复杂 .本文将经典”秘书问题”进行推广 ,建立了一类比经典”秘书问题”更有实际意义的模型 ,并给出了该类模型的解 .     

A globally convergent Newton method for solving strongly monotone variational inequalities

Variational inequality problems have been used to formulate and study equilibrium problems, which arise in many fields including economics, operations research and regional sciences. For solving variational inequality problems, various iterative methods such as projection methods and the nonlinear Jacobi method have been developed. These methods are convergent to a solution under certain conditions, but their rates of convergence are typically linear. In this paper we propose to modify the Newton method for variational inequality problems by using a certain differentiable merit function to determine a suitable step length. The purpose of introducing this merit function is to provide some measure of the discrepancy between the solution and the current iterate. It is then shown that, under the strong monotonicity assumption, the method is globally convergent and, under some additional assumptions, the rate of convergence is quadratic. Limited computational experience indicates the high efficiency of the proposed method.     

无偏的岭回归迭代算法

本文探讨线性模型的无偏的岭回归迭代算法,这种算法保持最小二乘法的性质,当存在较为严重的共线性时,它能给出较为精确的参数及其协差阵的估计值;当存在严格的共线性时,给出参数及其协差阵的无穷多解中的一个,这个解由初值决定。文章还给出了算法的收敛性及一些其它性质的证明。     

叶栅全三维粘性反问题的数值解

本文发展了一种解叶栅全三维粘性反问题的新的数值方法.基于非正交曲线坐标与相应的非正交速度分量下完全守恒型的Navier－Stokes方程,全三维反问题规定叶片表面的无量纲压力分布反求叶型。计算中叶片表面的边界条件采用一种特殊的方式来处理，即一方面强加给定的压力分布条件,另方面叶面的几何位置在迭代过程中又是可移动的，其移动速度将与Navier—Stokes方程在当地的解联系起来，从而形成一种解定常问题的新的不定常过程.试算证明了本文方法的可行性。     

The Existence of Solutions to Sturm-Liouville Boundary Value Problems with Laplacian-like Operator

Abstract The existence of infinitely many solutions to Sturm-Liouville boundary value problem with aLaplacian-like operator is studied by applying generalized polar coordinates.     

Hessian Measures III

In this paper, we continue previous investigations into the theory of Hessian measures. We extend our weak continuity result to the case of mixed k-Hessian measures associated with k-tuples of k-convex functions, on domains in Euclidean n-space, k=1,2,…,n. Applications are given to capacity, quasicontinuity, and the Dirichlet problem, with inhomogeneous terms, continuous with respect to capacity or combinations of Dirac measures.     

一类求解线性约束非线性规划问题的可行方向法

Wilson,Han和Powell提出的序列二次规划方法(简称SQP方法)是求解非线性规划问题的一个著名方法,这种方法每次迭代的搜索方向是通过求解一个二次规划子问题得到的,本文受[1]启发,得到二次规划子问题的一个近似解,进而给出了一类求解线性约束非线性规划问题的可行方向法,在约束集合满足正则性的条件下,证明了该算法对五种常用线性搜索方法具有全局收敛性。     

Halin-图的点强全染色

图G(V,E)的一个k-正常全染色f叫做一个k-点强全染色当且仅当对任意v∈V(G), N[v]中的元素被染不同色,其中N[v]={u|uv∈V(G)}∪{v}．χTvs(G)=min{k|存在图G的k- 点强全染色}叫做图G的点强全色数．对3-连通平面图G(V,E),如果删去面fo边界上的所有点后的图为一个树图,则G(V,E)叫做一个Halin-图．本文确定了最大度不小于6的Halin- 图和一些特殊图的的点强全色数XTvs(G),并提出了如下猜想:设G(V,E)为每一连通分支的阶不小于6的图,则χTvs(G)≤△(G) 2,其中△(G)为图G(V,E)的最大度．     

RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.