A search game on a cyclic graph

There is a finite cyclic graph. The hider chooses one of all nodes except the specified one, and he hides an (immobile) object there. At the beginning the seeker is at the specified node. After the seeker chooses an ordering of the nodes except the specified one, he examines each nodes in that order until he finds the object, traveling along edges. It costs an amount when he moves from a node to an adjacent one and also when he checks a node. While the hider wishes to maximize the sum of the traveling costs and the examination costs which are required to find the object, the seeker wishes to minimize it. The problem is modeled as a two‐person zero‐sum game. We solve the game when unit costs (traveling cost + examination cost) have geometrical relations depending on nodes. Then we give properties of optimal strategies of both players. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

An adaptive forecasting algorithm and inventory policy for products with short life cycles

Products with short life cycles are becoming increasingly common in many industries, such as the personal computer (PC) and mobile phone industries. Traditional forecasting methods and inventory policies can be inappropriate for forecasting demand and managing inventory for a product with a short life cycle because they usually do not take into account the characteristics of the product life cycle. This can result in inaccurate forecasts, high inventory cost, and low service levels. Besides, many forecasting methods require a significant demand history, which is available only after the product has been sold for some time. In this paper, we present an adaptive forecasting algorithm with two characteristics. First, it uses structural knowledge on the product life cycle to model the demand. Second, it combines knowledge on the demand that is available prior to the launch of the product with actual demand data that become available after the introduction of the product to generate and update demand forecasts. Based on the forecasting algorithm, we develop an optimal inventory policy. Since the optimal inventory policy is computationally expensive, we propose three heuristics and show in a numerical study that one of the heuristics generates near‐optimal solutions. The evaluation of our approach is based on demand data from a leading PC manufacturer in the United States, where the forecasting algorithm has been implemented. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

一种用于机电产品测试性设计的传感器优选MINLP模型

在单故障假设条件下,考虑了传感器的失效概率和设备的故障率,提出一种以故障检测率和故障隔离率为约束条件的降低传感器费用和失效概率的混合整数非线性规划(MINLP)模型,从而为机电产品测试性设计中传感器选择问题提供了一种可行和有效的解决方法,并进行了案例验证,说明了该方法的有效性。     

Optimal pricing for a short life‐cycle product when customer price‐sensitivity varies over time

Technology products often experience a life‐cycle demand pattern that resembles a diffusion process, with weak demand in the beginning and the end of the life cycle and high demand intensity in between. The customer price‐sensitivity also changes over the life cycle of the product. We study the prespecified pricing decision for a product that exhibits such demand characteristics. In particular, we determine the optimal set of discrete prices and the times to switch from one price to another, when a limited number of price changes are allowed. Our study shows that the optimal prices and switching times show interesting patterns that depend on the product's demand pattern and the change in the customers' price sensitivity over the life cycle of the product. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

基于模糊商空间理论的产品粒化过程分析

模块形成与划分是展开模块化设计及大规模定制生产的关键环节。为了进一步扩展产品模块化的定量分析手段,提出了一种基于模糊商空间理论的产品粒化方法。通过引入粒度计算,将基于相关性分析的产品模块化过程转化为基于粒度计算的产品粒化过程,并应用模糊商空间理论对其进行了分析,给出了基于归一化距离和综合模糊相似关系的产品粒度空间构建方法,建立了基于两阶段优化算法的最佳产品粒层确定流程,进而得到了最优模块划分方案,最后以某堆垛机货叉机构为例对该方法进行了有效性验证。此方法为产品模块聚类与优化提供了一种新的数值分析和评价手段,应用结果表明该方法具有一定的可行性和合理性,能够有效指导产品模块化过程的实施。     

考虑CCD噪声条件下的编码曝光最优码字搜索方法

编码曝光技术将病态的运动模糊图像复原问题转化为良态问题,寻找最优码字是编码曝光技术的关键。面向实用化目的,提出了一种考虑CCD传感器噪声的编码曝光相机最优码字搜索方法。基于仿射噪声模型对图像成像过程中的噪声成分进行了系统分析,首次从理论上分析了Raskar码字选取依据并基于复原图像信噪比增益提出了光子噪声对最优码字构造影响的解析表达式。在对实际编码曝光相机进行噪声标定的基础上,提出了最优码字搜索的准则并构造出适应度函数,采用遗传算法进行优化搜索得到最优码字。仿真图像和真实图像的复原结果证实了该方法的有效性,复原图像信噪比得到有效的提高。     

基于分段连续推力的中途修正方法(英文)

基于小偏差理论,对无摄三体动力学方程沿标称轨道线性化,推导了三体动力模型的误差线性模型。在此基础上,进一步利用该最优控制方法推导了转移轨道周期内的连续小推力控制方案,验证了控制加速度及状态量的收敛。同时针对整周期控制方式在超调后状态量收敛速度慢的问题,通过分段连续推力控制模式(Segm en ta l Con tinuous T hrust Con tro l,SCTC)来近似瞬时脉冲推力控制模式,并给出了最短分段控制时间的计算方法。实验表明,SCTC模式加快了轨道状态的收敛速度。对于km级入轨偏差,通过1次控制即可使实际轨道收敛至标称轨道。     

并行工程关键使能技术及其发展趋势

介绍了并行工程(ConcurrentEngineering,简称CE)的定义、基本原则、组成、驱动力和要素等,概要介绍了CE的部分关键使能技术。基于CE的理论研究与应用实践,给出实施CE的基本模式并进一步设想了CE的发展趋势。     

Optimal control of an M/G/1 queue with impatient priority customers

An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001     

火力运用对策空间模型

根据空 -地作战的特点 ,提出了软、硬火力单位的概念 ,根据模型提出了作战指数、生存指数 ,为双方的实力与“保卫目标”的安全度分析提供了数量依据 ;根据微分对策和战术原则提出了规范作战模式等概念 ,为构造火力运用、兵力数量需求等算法搭起一个框架。