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     

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

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

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

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

Optimal capacity in a coordinated supply chain

We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

等值电路法列写线性网络的状态方程

本文介绍一种手算时用等值电路编写线性网络状态方程的方法。优点是不必列任何方程式,尤其是可以省略消去非状态变量的复杂计算过程。提出一种用检查“量纲”的办法,核对计算是否有误,以便及时纠正。     

激光测距系统控制策略研究的一种新方法

首先运用更新理论研究了激光测距系统漏测点的分布规律,在该系统跟踪目标的角误差为平稳高斯过程的前提下,给出了易于计算的漏测点分布律的显式表示,为求取使不可补漏测点出现概率最小的控制策略提供了一条行之有效的新途径。     

整数线性规划问题的一个新算法

本文给出求解整数线性规划问题的一个算法。基本思想是通过求出其伴随线性规划问题的最优单纯形表,把整数线性规划化成正整数系数的不定方程,然后从不定方程的非负整数解集中选取一组满足整数线性规划的约束条件的解,作为整数线性规划的最优解。     

战场目标侦察识别系统设计

侦察系统是作战指挥系统的重要组成部分。现代侦察系统设计,必须根据任务需求,确定关键技术,采用有效的方法手段和安全可靠的工作方式,以便迅速、准确获取战场信息。本文介绍了一个战场目标声识别系统,并提出了解决关键技术与系统功能模块化设计的方案。