On Necessary Optimality Conditions with Higher-Order Complementarity Slackness for Set-Valued Optimization Problems

Set-Valued and Variational Analysis - We aim to establish Karush-Kuhn-Tucker multiplier rules involving higher-order complementarity slackness under Hölder metric subregularity. These rules...     

Finite‐size corrections at the hard edge for the Laguerre β ensemble

A fundamental question in random matrix theory is to quantify the optimal rate of convergence to universal laws. We take up this problem for the Laguerre β ensemble, characterized by the Dyson parameter β, and the Laguerre weight , in the hard edge limit. The latter relates to the eigenvalues in the vicinity of the origin in the scaled variable . Previous work has established the corresponding functional form of various statistical quantities—for example, the distribution of the smallest eigenvalue, provided that . We show, using the theory of multidimensional hypergeometric functions based on Jack polynomials, that with the modified hard edge scaling , the rate of convergence to the limiting distribution is , which is optimal. In the case , general the explicit functional form of the distribution of the smallest eigenvalue at this order can be computed, as it can for and general . An iterative scheme is presented to numerically approximate the functional form for general .     

A Hydroperoxide-Mediated Decarboxylation of α-Ketoacids Enables the Chemoselective Acylation of Amines

Strategies for the formation of amide bonds, that is, one of the most basic and important transformations in organic synthesis, have so far focused predominantly on dehydration reactions. Herein, we report and demonstrate the practical utility of a novel decarboxylative amidation of α-ketoacids by using inexpensive tert-butyl hydroperoxide (TBHP), which is characterized by high yields, a broad substrate scope, mild reaction conditions, and a unique chemoselectivity. These features enable the synthesis of peptides from amino acid derived α-ketoacids under preservation of the stereochemical information.     

一类函数方程的稳定性及微商配置解

本文对一类重要的函数方程建立解稳定性定理,提出微商配置解,证明了收敛性.     

Calibrating software reliability models when the test environment does not match the user environment

Software failures have become the major factor that brings the system down or causes a degradation in the quality of service. For many applications, estimating the software failure rate from a user's perspective helps the development team evaluate the reliability of the software and determine the release time properly. Traditionally, software reliability growth models are applied to system test data with the hope of estimating the software failure rate in the field. Given the aggressive nature by which the software is exercised during system test, as well as unavoidable differences between the test environment and the field environment, the resulting estimate of the failure rate will not typically reflect the user‐perceived failure rate in the field. The goal of this work is to quantify the mismatch between the system test environment and the field environment. A calibration factor is proposed to map the failure rate estimated from the system test data to the failure rate that will be observed in the field. Non‐homogeneous Poisson process models are utilized to estimate the software failure rate in both the system test phase and the field. For projects that have only system test data, use of the calibration factor provides an estimate of the field failure rate that would otherwise be unavailable. For projects that have both system test data and previous field data, the calibration factor can be explicitly evaluated and used to estimate the field failure rate of future releases as their system test data becomes available. Copyright © 2002 John Wiley & Sons, Ltd.     

非均匀加宽单模激光器的最佳透射率

给出四能级系统非均匀加宽单模激光器最佳透射率的表达式和分布曲线,并与均匀加宽单模激光器最佳透射率进行了比较.叙述了非均匀加宽单模激光器的特点.     

线性常微分方程的保线性变换及其应用

研究了线性常微分方程的保线性变换，得到任意两个二阶线性常微分方程等价的条件，并用于求解一类二阶线性变系数齐次常微分方程．对数学物理方法教学中怎样通过适当的变换把给定的二阶线性变系数齐次常微分方程化为可解的方程给出了合理解释。     

Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms

We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exhaustive processes. This result provides the basis for constructing flexible subdivision strategies that can be adapted to take advantage of various problem conditions.