Minimizing sums and products of linear fractional functions over a polytope

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999     

Note: Two rendezvous search problems on the line

A new upper bound is obtained for the two‐person symmetric rendezvous value on the real line when the distribution function of their initial distance apart is bounded. A second result shows that if three players are placed randomly on adjacent integers on the real line facing in random directions and able to move at a speed of at most 1, then they can ensure a three‐way meeting time of at most 7/2; the fact that 7/2 is a best possible result follows from work already in the literature. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 335–340, 1999     

Single machine sequencing with linear models of release dates

The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998     

Attrition models of the Ardennes campaign

This paper revisits the modeling by Bracken [3] of the Ardennes campaign of World War II using the Lanchester equations. It revises and extends that analysis in a number of ways: (1) It more accurately fits the model parameters using linear regression; (2) it considers the data from the entire campaign; and (3) it adds in air sortie data. In contrast to previous results, it concludes by showing that neither the Lanchester linear or Lanchester square laws fit the data. A new form of the Lanchester equations emerges with a physical interpretation. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 1–22, 1998     

基于线特征的多时相遥感图像变化检测

多时相遥感图像中利用线特征可以感知道路等线形地物的变化。论文提出一种新的基于边缘特征描述的线特征变化检测算法,首先根据边缘的梯度信息得到变化边缘,并对变化边缘进行编组,形成变化边缘的直线支撑区域,然后通过最小二乘拟合方法从直线支撑区域中提取出变化直线。提出的线特征变化检测算法把边缘的相位和幅度信息作为变化检测的判定依据,从而避免了线的匹配与比较工作,降低了变化检测的算法复杂度,具有很强的实用性。将提出的方法用于多时相遥感图像变化检测,实验结果显示该方法的有效性。     

基于位置预测的靶场图像实时判读方法

在靶场经纬仪对目标实时跟踪测量时,会发生相机随机抖动的情况,引起目标在图像中大幅度运动。应对大幅度运动时,基于搜索窗口的跟踪方法容易丢失目标,而基于全图搜索的跟踪方法时效性差。针对以上问题,提出一种结合核相关滤波算法(Kernelized Correlation Filter, KCF)和目标位置预测的改进的跟踪学习检测算法(Tracking-Learning-Detection, TLD)跟踪框架。利用正交多项式最优线性滤波器及相机角度信息预测目标下一帧位置,在此区域利用KCF进行快速跟踪,可以提高跟踪的成功率和时效性,跟踪失败时再进行检测。仿真实验表明,最优线性滤波器能较准确预测目标位置,给KCF提供较准确的搜索位置,算法每帧耗时仅为1.1 ms,且定位精度优于TLD和KCF,能有效应对相机抖动的问题。靶场实际试验证明该方法可提高靶场自动判读水平,减少人工干预。     

磁偶极子信号检测和参数估计

在分析了经典磁偶极子模型的基础上 ,指出该模型是两个函数的组合 ,目标参数包含在这两个函数的参数里 .提出了二次函数组合法 ,能够在绝大多数情况下将这两个函数分离 ,逐步求出目标参数 .最后对实例进行了仿真计算 ,给出了较满意的结果     

一种慢波自由电子激光的动力学理论分析

本文用动力学耦合模理论,研究在矩形波导中单侧填充介质而形成的慢波线极化自由电子激光的特性。结果表明,在这一系统中,可用低能电子束产生高频率高增益的自由电子激光,并具有极宽的调谐域。     

分段供电六相圆筒式直线感应电动机数学模型

为研究新型分段供电六相圆筒式直线感应电动机的运行规律,针对其不对称运行的特点,采用磁动势理论推导了气隙中与空间位置无关的脉振磁场的电感矩阵表达式,通过将其引入abc坐标系下对称的电机数学模型,从而构建描述六相圆筒式直线感应电机不对称的数学模型。在Simulink环境下,采用隐式梯形法构建该不对称模型的系统仿真模型。对样机进行仿真分析和实验验证,仿真结果与实验数据吻合良好,验证了模型的正确性。     

引入区域量化的相控阵天线维修优化模型

针对大型相控阵天线维修成本高、多部件维修时机难以确定、模型仿真计算困难等问题,提出一种引入区域量化的维修优化模型。建立天线阵列的区域量化模型,将天线阵列维修问题转化成一个由不同区域阵元组成的k/n系统维修优化问题。以使用可用度为约束条件,以单位时间维修费用最小为优化目标,建立引入区域量化的大型相控阵天线多部件视情维修决策优化模型,并通过算例仿真与分析进行了模型验证。结果表明:提出的维修优化模型真实有效,能够很好地解决分布不均匀的相控阵天线维修优化问题。