求线性规划初始可行基的新方法

本文提出一个求线性规划初始可行基的新算法，该算法不仅避免了人工变量，而且理论分析及初步的数值实验结果表明其效率更高。     

线性规划联合算法的理论与应用

本在[1]的基础上．较系统的叙述了线性规划联合算法的步骤、相关理论及其应用，指出该算法具有避免人工变量、减少迭代次数、使用灵活、应用方便等特点。     

线性规划问题的规范型算法

提出了线性规划问题的两种规范标准形式；证明了任意一个线性规划问题都可化为这两种形式之一；给出了不需引入人工变量的线性规划问题的求解算法。     

一种改进的进化规划算法

本对于全局优化问题提出一个改进的进化规划算法，该算法以概率p接收基于电磁理论求出合力方向作为随机搜索方向，以概率1-p接收按正态分布产生的随机搜索方向。改进算法不仅克服了传统进化规划算法随机搜索的盲目性，而且保留了传统进化规划算法全局搜索性。本算法应用于几个典型例题，数值结果表明本算法是可行的，有效的。     

Probability Inequalities and Limit Theorems for Generalized L-Statistics

We obtain exponential upper bounds for tails of distributions of generalized L-statistics based on a sample from an exponential distribution. We prove the asymptotic normality of generalized L-statistics based on a sample from the uniform distribution on [0,1] and of L-statistics with decomposed kernels (without any restrictions on the sample distribution type).     

Stationary entanglement between macroscopic mechanical oscillators

We show that the optomechanical coupling between an optical cavity mode and two movable cavity mirrors is able to entangle two different macroscopic oscillation modes of the mirrors. This continuous variable entanglement is maintained by the light bouncing between the mirrors and is robust against thermal noise. In fact, it could be experimentally demonstrated using present technology. Received 2 September 2002 / Received in final form 10 October 2002 Published online 7 January 2003     

Poincaré-Hopf inequalities

In this article the main theorem establishes the necessity and sufficiency of the Poincaré-Hopf inequalities in order for the Morse inequalities to hold. The convex hull of the collection of all Betti number vectors which satisfy the Morse inequalities for a pre-assigned index data determines a Morse polytope defined on the nonnegative orthant. Using results from network flow theory, a scheme is provided for constructing all possible Betti number vectors which satisfy the Morse inequalities for a pre-assigned index data. Geometrical properties of this polytope are described.

     

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 2¹⁶⁹⁴ scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time.     

Influence of surfactant and lipid chain length on the solubilisation of phosphatidylcholine vesicles by micelles comprised of polyoxyethylene sorbitan monoesters

Photon correlation spectroscopy and freeze-fracture electron microscopy have been used to determine the ability of a range of micelle-forming, polyoxyethylene (20) sorbitan monoesters (Tweens) to solubilise vesicles prepared from phosphatidylcholines of different acyl chain lengths and degrees of saturation with a view to rationalising (in terms of their membrane toxicity) which of the micelle-forming surfactants to use as drug delivery vehicles. The phosphatidylcholines used were dimyristoyl-, dipalmitoyl-, distearoyl- and dioleoylphosphatidylcholine (DMPC, DPPC, DSPC and DOPC, respectively) while the nonionic polyoxyethylene sorbitan monoesters studied were polyoxyethylene (20) sorbitan monolaurate (Tween 20), a 9:1 weight ratio mixture of polyoxyethylene (20) sorbitan monopalmitate and monostearate (Tween 40), a 1:1 weight ratio mixture of polyoxyethylene (20) sorbitan monopalmitate and monostearate (Tween 60), and polyoxyethylene (20) sorbitan monooleate (Tween 80). The ability of the Tween micelles to solubilise phospholipid vesicles was found to depend both upon the length of the surfactant acyl chain and the length of the acyl chains of the phospholipid comprising the vesicle. Vesicles composed of long saturated diacyl chain phospholipids, namely DSPC and DPPC, were the most resistant to solubilisation, while those prepared from the shorter acyl chained DMPC were more readily solubilised. In terms of their solubilisation behaviour, vesicles made from phospholipids containing long, unsaturated acyl chains, namely DOPC behaved more akin to those vesicles prepared from DMPC. None of the Tween surfactants were effective at solubilising vesicles prepared from DPPC or DSPC. In contrast, there were clear differences in the ability of the various surfactants to solubilise vesicles prepared from DMPC and DOPC, in that micelles formed from Tween 20 were the most effective solubilising agent while those formed by Tween 60 were the least effective. As a consequence of these observations it was considered that Tween 60 was the surfactant least likely to cause membrane damage in vivo and, therefore, is the most suitable surfactant for use as a micellar drug delivery vehicle.     

NMR investigation of concentrated alumina and silica slurries

The longitudinal relaxation times (T₁) of water in concentrated silica and alumina slurries were measured as a function of solids content. It was shown that the results could be fit very well with a two-phase fast-exchange model between free and surface-bound water. As expected, values of T₁ for bound water were in the order of 20–2000 times lower than that for free water, indicating a higher effective viscosity of the surface-bound water. The strength of the interaction depended on the particular surface, and all of the aluminas examined interacted more strongly with water than the two silicas studied, which themselves differed considerably. The chemical mechanical polishing (CMP) removal rate of tantalum by silica slurries was shown to be directly correlated with the interaction parameters, derived from the NMR relation times rather than with total surface hydroxyl group concentration.