基于近似策略的联合优化方法

针对优化中收敛速度和优化解全局性的问题,提出了一种联合优化方法:构造原问题的近似模型,使用全局优化方法对近似函数进行优化,得到优化点作为初值,再使用局部优化方法对原问题进行优化.为了获得对原问题更好的近似,改进了径向基插值方法,以优化误差的方法来选择参数.利用临近空间机翼模型的优化对算法进行了测试,结果表明,优化参数的...     

Reliability inference for field conditions from accelerated degradation testing

Accelerated degradation testing (ADT) is usually conducted under deterministic stresses such as constant‐stress, step‐stress, and cyclic‐stress. Based on ADT data, an ADT model is developed to predict reliability under normal (field) operating conditions. In engineering applications, the “standard” approach for reliability prediction assumes that the normal operating conditions are deterministic or simply uses the mean values of the stresses while ignoring their variability. Such an approach may lead to significant prediction errors. In this paper, we extend an ADT model obtained from constant‐stress ADT experiments to predict field reliability by considering the stress variations. A case study is provided to demonstrate the proposed statistical inference procedure. The accuracy of the procedure is verified by simulation using various distributions of field stresses. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

矩不变量在目标形状识别中的应用研究

本文提出了图像分割的一种新的算法，简单实用。实验表明，它优于经典的最大方差准则门限法和最大熵分割法。本文利用中心矩构成仿射不变量，作为目标的特征。本文提出了利用上述各特征的一种数据融合算法。实验表明，利用该算法进行识别时正确率高，且所用时间短，效果好。本文所提供的方法在对１８类目标１３８幅图像进行识别时总识别正确率高于８５％。     

使用细致谱项模型研究高温等离子体的辐射不透明度

对计算等离子体的光辐射不透明度所涉及到的一些物理问题进行了介绍与讨论 ,重点放在束缚 -束缚谱线跃迁与束缚 -自由吸收及自电离共振引起的谱线展宽等物理过程。由于束缚 -束缚谱线吸收中涉及到谱线的各种增宽机制 ,我们对此也进行了讨论。在此基础上系统介绍了使用细致谱项模型计算等离子体的不透明度的理论研究现状 ,并结合涉及到的实验研究结果 ,对理论结果进行了检验。特别是结合我们最近的研究进展 ,着重讨论了得到的一系列结果     

数据处理的实用方法和算法

通过对正交多项式的构造和逼近准则的研究,得到了一类数据处理问题的一种较理想的逼近准则和算法。理论分析和模拟计算表明,用本文方法处理这类问题有较高的拟合精度并容易计算。     

Polynomial‐time approximation schemes for two‐machine open shop scheduling with nonavailability constraints

This paper addresses a two‐machine open shop scheduling problem, in which the machines are not continuously available for processing. The processing of an operation affected by a non‐availability interval can be interrupted and resumed later. The objective is to minimize the makespan. We present two polynomial‐time approximation schemes, one of which handles the problem with one non‐availability interval on each machine and the other for the problem with several non‐availability intervals on one of the machines. Problems with a more general structure of the non‐availability intervals are not approximable in polynomial time within a constant factor, unless . © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Appointment scheduling at a multidisciplinary outpatient clinic using stochastic programming

The purpose of this paper is to investigate the problem of constructing an appointment template for scheduling patients at a specific type of multidisciplinary outpatient clinic called an integrated practice unit (IPU). The focus is on developing and solving a stochastic optimization model for a back pain IPU in the face of random arrivals, an uncertain patient mix, and variable service times. The deterministic version of the problem is modeled as a mixed integer program with the objective of minimizing a weighted combination of clinic closing time (duration) and total patient waiting time (length of stay). A two‐stage stochastic program is then derived to account for the randomness and the sequential nature of the decisions. Although it was not possible to solve the two‐stage problem for even a limited number of scenarios, the wait‐and‐see (WS) problem was sufficiently tractable to provide a lower bound on the stochastic solution. The introduction of valid inequalities, limiting indices, and the use of special ordered sets helped to speed up the computations. A greedy heuristic was also developed to obtain solutions much more quickly. Out of practical considerations, it was necessary to develop appointment templates with time slots at fixed intervals, which are not available from the WS solution. The first to be derived was the expected value (EV) template that is used to find the expected value of the EV solution (EEV). This solution provides an upper bound on the objective function value of the two‐stage stochastic program. The average gap between the EEV and WS solutions was 18%. Results from extensive computational testing are presented for the EV template and for our adaptation of three other templates found in the literature. Depending on the relative importance of the two objective function metrics, the results demonstrate the trade‐off that exists between them. For the templates investigated, the “closing time” ranged from an average of 235 to 275 minutes for a 300‐minute session, while the corresponding “total patient time in clinic” ranged from 80 to 71 minutes.     

图像配准参数的自适应求取方法

提出了一种可见光和红外图像的自动配准方法 .针对多数配准过程需人工干预的问题 ,建立二维仿射变换模型 ,以图像边界为特征 ,以目标边界互相关函数最大为原则 ,对二维仿射变换模型自适应搜索求取最佳配准参数 .给出了实际可见光和红外图像配准的实验结果     

双绝热近似下磁流体力学线性稳定性原理

本文得出了双绝热近似的磁流体力学能量积分关系式。分析表明这种磁流体力学系统是保守的,可以采用运动方程或能量原理方法分析系统的稳定性特性。本文从控制方程组出发讨论了线性稳定性的基本原理,指出纵向压力增值有助于系统的稳定性。     

The open shop scheduling problem with a given sequence of jobs on one machine

The paper considers the open shop scheduling problem to minimize the make-span, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not allowed, the problem is NP-hard in the strong sense if the number of machines is variable, and is NP-hard in the ordinary sense in the case of two machines. For the latter case we give a heuristic algorithm that runs in linear time and produces a schedule with the makespan that is at most 5/4 times the optimal value. We also show that the two-machine problem in the nonpreemptive case is solvable in pseudopolynomial time by a dynamic programming algorithm, and that the algorithm can be converted into a fully polynomial approximation scheme. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 705–731, 1998