马科维兹资产组合选择模型的旋转算法

提出线性不等式组的一种旋转算法，并用其求解马科维兹资产组合选择模型，此算法每次迭代约需n^2次乘法和加法，其中n是模型中变量的数目，在微机上运行Delphi程序的实验结果表明，从上海和深圳股市1072支股票70期周末收盘价计算出20个最优投资组合仅需314次迭代和45s。     

New Exact Solutions to the Combined KdV and mKdV Equation

The modified mapping method is developed to obtain new exact solutions to the combined KdV and mKdV equation. The method is applicable to a large variety of nonlinear evolution equations, as long as odd- and even-order derivative terms do not coexist in the equation under consideration.     

高气压反射式高能电子衍射仪监控脉冲激光外延氧化物薄膜

在超高真空分子束外延（MBE）生长技术中，反射式高能电子衍射仪（RHEED）能实时显示半导体和金属外延生长过程，给出薄膜表面结构和平整度的信息，成为MBE必备的原位表面分 析仪.为了研究氧化物薄膜如高温超导（YBa₂Cu₃O₇） 、铁电薄膜（Sr_1-xBa_x TiO₃）及它们的同质和异质外延结构的生长机理，获得高质量的符合各种应用 需要的氧化 物多层薄膜结构，在常规的制备氧化 关键词： 高温超导薄膜 RHEED     

Correction: Phytol-based novel adjuvants in vaccine formulation: 1. assessment of safety and efficacy during stimulation of humoral and cell-mediated immune responses

This is a correction article.     

Preparation of enantiomerically pure (R)-2-butyryloxymethylglycidol by lipase-catalyzed asymmetric hydrolysis

Optically active epoxy alcohol, (R)-2-butyryloxymethylglycidol3 which is the precursor of a tert-alcohol chiral building block was obtained in high enantiomeric purity, 98.7% e.e., by lipase-catalyzed asymmetric hydrolysis using a phosphate buffer and organic co-solvent system in 95% of chemical yield.     

Dirichlet型空间上的乘子

本文主要根据τ与μ的不同取值分三种情况刻划了Cn中单位球上Dirichlet 型空间上的点乘子空间M(Dτ,Dμ),并通过两个函数的构造表明:当τ≤n时,包含 关系M(Dτ)(?)Dτ和当τ>μ,τ>n-1时,包含关系M(Dτ)(?) M(Dμ)是严格的.     

Survivable network design under optimal and heuristic interdiction scenarios

We examine the problem of building or fortifying a network to defend against enemy attacks in various scenarios. In particular, we examine the case in which an enemy can destroy any portion of any arc that a designer constructs on the network, subject to some interdiction budget. This problem takes the form of a three-level, two-player game, in which the designer acts first to construct a network and transmit an initial set of flows through the network. The enemy acts next to destroy a set of constructed arcs in the designer’s network, and the designer acts last to transmit a final set of flows in the network. Most studies of this nature assume that the enemy will act optimally; however, in real-world scenarios one cannot necessarily assume rationality on the part of the enemy. Hence, we prescribe optimal network design algorithms for three different profiles of enemy action: an enemy destroying arcs based on capacities, based on initial flows, or acting optimally to minimize our maximum profits obtained from transmitting flows.     

On the blow-up rate of large solutions for a porous media logistic equation on radial domain

In this paper we establish the exact blow-up rate of the large solutions of a porous media logistic equation. We consider the carrying capacity function with a general decay rate at the boundary instead of the usual cases when it can be approximated by a distant function. Obtaining the accurate blow-up rate allows us to establish the uniqueness result. Our result covers all previous results on the ball domain and can be further adapted in a more general domain.