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,能有效应对相机抖动的问题。靶场实际试验证明该方法可提高靶场自动判读水平,减少人工干预。     

近地卫星Ka频段数传链路抗雨衰自适应模式设计

针对近地卫星数传时的信道时变性和严重的Ka频段雨衰现象,采用自适应编码调制(Adaptive Coding and Modulation, ACM)技术能够充分利用链路资源,相对于传统的固定编码调制方式,进一步提高链路的数据吞吐量。提出近地卫星Ka频段数传链路ACM模式设计方法,在降雨环境下建立Ka频段数传链路模型,根据链路预算的信道状况确定ACM选用模式;采用基于导频符号的最大似然信噪比估计算法结合移动平均的平滑方法实现信道估计,有效地减小了估计值的波动。仿真结果表明,无论晴天还是雨天,采用提出的卫星数传链路ACM模式设计方法,能够在保证系统可靠性的同时获取较高的数据吞吐量。     

并行时域自适应算法在电大目标瞬态散射中的应用

基于电磁场时域积分方程(TDIE)数值技术计算复杂目标的瞬态散射特性,其计算量和内存需求大,采用时域自适应算法(TDAIM)降低了TDIE的计算规模。在研究TDAIM并行算法的基础上,开发了基于.NET Remoting的电磁场分布式数值计算方案。数值结果表明,该方案显著提高了TDAIM的计算效率,为解决电大目标瞬态电磁散射问题提供了一条有效途径。     

基于步进频率正交信号的星载MIMO-GMTI雷达空时频处理研究

多发多收(MIMO)体制雷达综合采用多通道、多频技术,为解决星载GMTI面临的探测慢速运动目标和消除盲速估计等问题提供了有效途径。MIMO雷达工作的基础是有效的波形设计。因此,在分析正交波形性能的基础上,结合GMTI应用需求,建立了星载MIMO雷达步进频率正交信号的基本参数确定准则,研究了步进频率MIMO雷达空时频联合自适应处理的基本原理,通过仿真验证了MIMO雷达在杂波抑制和GMTI性能上的优势。     

相关系数及其应用

在相关分析中,通常利用相关系数来分析或测定变量之间的线性相关程度。相关系数是描述两个变量或随机变量之间的线性相关程度的指标。相关系数的计算与分析是科学研究中常用的一种简单分析方法,根据相关系数可以对不同事物进行简单的聚类分析等。从相关系数的概念入手,给出相关系数的计算公式,列举了相关系数的应用。