Discrete global descent method for discrete global optimization and nonlinear integer programming

A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function. The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer variables and up to 1.38 × 10¹⁰⁴ feasible points have demonstrated the applicability and efficiency of the proposed method.     

Testing for additivity with B-splines

Regression splines are often used for fitting nonparametric functions, and they work especially well for additivity models. In this paper, we consider two simple tests of additivity: an adaptation of Tukey's one degree of freedom test and a nonparametric version of Rao's score test. While the Tukey-type test can detect most forms of the local non-additivity at the parametric rate of O(n-1/2), the score test is consistent for all alternative at a nonparametric rate. The asymptotic distribution of these test statistics is derived under both the null and local alternative hypotheses. A simulation study is conducted to compare their finite-sample performances with some existing kernel-based tests. The score test is found to have a good overall performance.     

High performance 1689-nm quantum well diode lasers

1689-nm diode lasers used in medical apparatus have been fabricated and characterized. The lasers had pnpn InP current confinement structure, and the active region consisted of 5 pairs of InGaAs quantum wells and InGaAsP barriers.     

Global error bound for convex inclusion problems

The existence of global error bound for convex inclusion problems is discussed in this paper, including pointwise global error bound and uniform global error bound. The existence of uniform global error bound has been carefully studied in Burke and Tseng (SIAM J. Optim. 6(2), 265–282, 1996) which unifies and extends many existing results. Our results on the uniform global error bound (see Theorem 3.2) generalize Theorem 9 in Burke and Tseng (1996) by weakening the constraint qualification and by widening the varying range of the parameter. As an application, the existence of global error bound for convex multifunctions is also discussed.     

Fabrication of bamboo-shaped GaN nanorods

Bamboo-shaped GaN nanorods were formed through a simple sublimation method. They were characterized by means of X-ray powder diffraction (XRD), transmission electron microscopy (TEM), high-resolution transmission electron microscopy (HRTEM) and selected-area electron diffraction (SAED). The TEM image showed that the nanorods were bamboo-like. XRD, HRTEM and SAED patterns indicated that the nanorods were single-crystal wurtzite GaN. Received: 8 January 2001 / Accepted: 28 April 2001 / Published online: 20 December 2001     

聚能射流的断裂时间

从描述聚能射流失稳的一维近似方程出发，导出了聚能射流断裂时间的近似公式。这个近似公式定量显示了屈服应力、本构关系、粘度和径向收缩效应等对射流断裂时间的影响，在４个不同的特殊近似下，可以自然演化为近１０年来所发表的几个半经验解析公式，并且在合理的参数范围内，公式给出的断裂时间曲线覆盖了射流断裂时间的全部实验点。     

The moire topography based on optical logic operation

The optical logic-operated moire,which is proposed on the basis of optical logicoperation,is a new method to obtain specific moire beat pattern.Its advantages lie in the ca-pability to select carrier-free,sharpened fringes with high contrast.The experimental methodand results of the application of the optical logic-operared moire in moire topography are pre-sented in this paper.     

硫酰胺的快速分析（Ⅱ） 

硫酰胺生产过程中副产的大量氯化铵要干扰硫酰胺的测定，采用四苯硼钠将全部氯化铵呈沉淀析出，再用次溴酸钠把滤液中的硫酰胺分解成氮气，测其体积，计算出硫酰胺的含量。对样品进行测定的结果表明，该法重现性好、准确度高、分析周期在３５ｍｉｎ内，相对误差在±１％以内。     

带框形约束的线性规划问题的鞍点法

根据作者最近提出的求解线性规划问题的鞍点法[3],本文对带框形约束的问题 min c~Tx, s,t A_x=b, l≤x≤h,给出简单的迭代公式.该法的主要优点是它的强收敛性和它的迭代公式非常容易实现.