The one‐warehouse multiretailer problem with an order‐up‐to level inventory policy

We consider a two‐level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order‐up‐to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot‐sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state‐of‐the art solver reveal that our formulations are very effective in solving large‐size instances to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于饱和信息维的信息资源聚焦的数学模型

运用饱和信息维的增减技术对信息获取子空间进行结构上的剖分,将饱和信息维的"值"的获取分解为"白"与"灰"两部分,用饱和信息维列作为因子列来构造灰色关联空间,用关联序来描述信息之间的相关联程度,得到信息资源聚焦的一种新的数学模型。     

Consecutive k‐within‐m‐out‐of‐n:F system with exchangeable components

As a generalization of k‐out‐of‐n:F and consecutive k‐out‐of‐n:F systems, the consecutive k‐within‐m‐out‐of‐n:F system consists of n linearly ordered components such that the system fails iff there are m consecutive components which include among them at least k failed components. In this article, the reliability properties of consecutive k‐within‐m‐out‐of‐n:F systems with exchangeable components are studied. The bounds and approximations for the survival function are provided. A Monte Carlo estimator of system signature is obtained and used to approximate survival function. The results are illustrated and numerics are provided for an exchangeable multivariate Pareto distribution. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Dynamic signatures and their use in comparing the reliability of new and used systems

The signature of a system with independent and identically distributed (i.i.d.) component lifetimes is a vector whose ith element is the probability that the ith component failure is fatal to the system. System signatures have been found to be quite useful tools in the study and comparison of engineered systems. In this article, the theory of system signatures is extended to versions of signatures applicable in dynamic reliability settings. It is shown that, when a working used system is inspected at time t and it is noted that precisely k failures have occurred, the vector s [0,1]^n‐k whose jth element is the probability that the (k + j)th component failure is fatal to the system, for j = 1,2,2026;,n ‐ k, is a distribution‐free measure of the design of the residual system. Next, known representation and preservation theorems for system signatures are generalized to dynamic versions. Two additional applications of dynamic signatures are studied in detail. The well‐known “new better than used” (NBU) property of aging systems is extended to a uniform (UNBU) version, which compares systems when new and when used, conditional on the known number of failures. Sufficient conditions are given for a system to have the UNBU property. The application of dynamic signatures to the engineering practice of “burn‐in” is also treated. Specifically, we consider the comparison of new systems with working used systems burned‐in to a given ordered component failure time. In a reliability economics framework, we illustrate how one might compare a new system to one successfully burned‐in to the kth component failure, and we identify circumstances in which burn‐in is inferior (or is superior) to the fielding of a new system. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

作战体系有序性判别模型*

未来作战已经逐步演变为体系之间的对抗,为确保我军作战体系有序进行发挥其作战力量,探讨了作战体系有序性问题;应用了耗散结构理论和灰色系统理论,把灰关联度与熵结合起来,以序参量为基础,建立了基于灰关联熵的作战体系有序性判别模型.研究结果为对作战体系实施调控提供了依据,使作战体系符合现代战场态势发展的需要.     

一类二阶微分方程Poincaré分岔极限环的不存在性

讨论一类二阶微分方程x¨+εf(x,x.)x.+g(x)=0的Poincar分岔极限环的不存在性,利用一阶Mel’nikov函数直接从整体上进行分析讨论,得出了若干充分条件和判别准则。     

军事欺骗战法分析的数学方法-应用

针对军事欺骗战法定量分析困难的问题,采用基于贝叶斯统计推断和博弈均衡分析的数学方法,在理论上为解决此难题提供了一种可行的方法。该方法首先定义基本概率矩阵,然后根据贝叶斯原理为交战双方构造用于统计推断的主观概率矩阵,并在由两个主观概率矩阵元素构成的偏序链与实施军事欺骗机会之间建立对应关系,再将此关系推广到基本概率矩阵,即是否存在实施军事欺骗的机会将由基本概率矩阵元素构成的偏序链决定。对理论成果的初步应用表明：通过分析由战场情报信息构成的基本概率矩阵的偏序链,可以科学地运用军事欺骗和反军事欺骗战法。     

基于语言评价信息的多方案选优研究

通过LWD和LOWA算子,给出了一种算法。该算法在预先定义语言短语排序的情况下,可将专家群给出的多个指标下多个方案的语言评价信息集结为对方案的语言短语排序,从而可选出最优方案,并通过仿真算例,证明了该方法的有效性。     

信号相位匹配法检测正弦信号的高阶统计量方法

为了能对提高高斯色噪声中正弦信号的检测能力,提出了二阶自相关和四阶累积量预处理的信号相位匹配检测法.仿真结果表明,高斯色噪声中四阶累积量预处理的信号相位匹配检测法的检测性能接近于高斯白噪声下匹配滤波器,优于二阶自相关的信号相位匹配检测法的检测性能,更优于的信号相位匹配的最小二乘检测器.     

长码直扩信号的符号速率盲估计方法

针对长码直接序列扩频(DSSS)信号的符号速率估计的难题,提出了基于相关处理的方法。该方法首先估计长码直扩信号的相关函数二阶矩,然后将相关函数二阶矩的估计作为输入信号进行预处理,以去除扩频码周期处的峰值。对预处理后的信号再次进行自相关处理,则所得的信号的频谱中含有符号速率谱线。理论分析和计算机仿真证明了所提出的算法的有效性。