联合火力毁伤下炮兵连阵地配置与被毁伤概率

现代战场威胁炮兵的火力与弹药种类更加丰富,如何根据它们的特点选择恰当的阵地配置队形与火炮间隔,以最大限度地降低被毁伤概率就显得尤为重要.以自行炮兵连为研究对象,依据射击效率评定理论.结合几种典型的配置队形和红蓝双方的主要装备,对不同攻击方式下的被毁伤概率进行了模拟分析,得到了在阵地地形允许的情况下,应采用半圆形配置;普通榴弹射击时火炮配置间隔以200 m为宜,子母弹射击时如果要避免一半以上的火炮被毁伤,配置间隔也应至少达到200 m的结论.     

Exact analysis of (R,s, S) inventory control systems with lost sales and zero lead time

We study an (R, s, S) inventory control policy with stochastic demand, lost sales, zero lead‐time and a target service level to be satisfied. The system is modeled as a discrete time Markov chain for which we present a novel approach to derive exact closed‐form solutions for the limiting distribution of the on‐hand inventory level at the end of a review period, given the reorder level (s) and order‐up‐to level (S). We then establish a relationship between the limiting distributions for adjacent values of the reorder point that is used in an efficient recursive algorithm to determine the optimal parameter values of the (R, s, S) replenishment policy. The algorithm is easy to implement and entails less effort than solving the steady‐state equations for the corresponding Markov model. Point‐of‐use hospital inventory systems share the essential characteristics of the inventory system we model, and a case study using real data from such a system shows that with our approach, optimal policies with significant savings in inventory management effort are easily obtained for a large family of items.     

Revenue management under randomly evolving economic conditions

We consider a dynamic pricing model in which the instantaneous rate of the demand arrival process is dependent on not only the current price charged by the concerned firm, but also the present state of the world. While reflecting the current economic condition, the state evolves in a Markovian fashion. This model represents the real‐life situation in which the sales season is relatively long compared to the fast pace at which the outside environment changes. We establish the value of being better informed on the state of the world. When reasonable monotonicity conditions are met, we show that better present economic conditions will lead to higher prices. Our computational study is partially calibrated with real data. It demonstrates that the benefit of heeding varying economic conditions is on par with the value of embracing randomness in the demand process. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 66:73–89,2019     

基于贝叶斯网络的态势估计时间推理方法

基于贝叶斯网络的态势估计方法是目前态势估计领域中的主要方法之一,然而,传统的贝叶斯网络不具备时间语义,因此无法解决态势估计中的时间推理问题.基于此,对贝叶斯网络进行改造,研究了时间贝叶斯网络的构建方法.通过一个战场想定,说明了时间贝叶斯网络构建、推理的过程与方法,证明了提出方法的有效性.     

基于区间直觉模糊集的目标优先级求解方法

针对复杂防空作战环境下多目标优先级难以准确评估的问题,提出了基于区间直觉模糊集理论的目标优先级求解算法。首先系统分析了影响目标优先级的因素以及各影响因素与目标优先级之间的非线性关系。其次,对区间直觉模糊集的得分函数和精确函数进行了改进,考虑了犹豫度信息对决策结果的影响,并且提出了基于得分函数和精确函数的目标优先级求解算法。最后通过仿真算例验证了算法的有效性。     

Convolutions and generalization of logconcavity: Implications and applications

Additive convolution of unimodal and α‐unimodal random variables are known as an old classic problem which has attracted the attention of many authors in theory and applied fields. Another type of convolution, called multiplicative convolution, is rather younger. In this article, we first focus on this newer concept and obtain several useful results in which the most important ones is that if is logconcave then so are and for some suitable increasing functions ?. This result contains and as two more important special cases. Furthermore, one table including more applied distributions comparing logconcavity of f(x) and and two comprehensive implications charts are provided. Then, these fundamental results are applied to aging properties, existence of moments and several kinds of ordered random variables. Multiplicative strong unimodality in the discrete case is also introduced and its properties are investigated. In the second part of the article, some refinements are made for additive convolutions. A remaining open problem is completed and a conjecture concerning convolution of discrete α‐unimodal distributions is settled. Then, we shall show that an existing result regarding convolution of symmetric discrete unimodal distributions is not correct and an easy alternative proof is presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 109–123, 2016     

离散条件下数字图像矩不变量不变性的分析与研究

对离散条件下数字图像矩不变量的旋转和尺度不变性进行分析,证实了图像识别中采用的矩不变量存在较大变化范围.针对矩不变量变化的主要原因,给出了改进方法,并用实验加以验证.     

Discrete‐time analysis of MAP/PH/1 multiclass general preemptive priority queue

We use the matrix‐geometric method to study the MAP/PH/1 general preemptive priority queue with a multiple class of jobs. A procedure for obtaining the block matrices representing the transition matrix P is presented. We show that the special upper triangular structure of the matrix R obtained by Miller [Computation of steady‐state probabilities for M/M/1 priority queues, Oper Res 29(5) (1981), 945–958] can be extended to an upper triangular block structure. Moreover, the subblock matrices of matrix R also have such a structure. With this special structure, we develop a procedure to compute the matrix R. After obtaining the stationary distribution of the system, we study two primary performance indices, namely, the distributions of the number of jobs of each type in the system and their waiting times. Although most of our analysis is carried out for the case of K = 3, the developed approach is general enough to study the other cases (K ≥ 4). © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 662–682, 2003.     

基于Chirp变换的快速离散时间尺度变换

提出了一种新的快速离散时间尺度变换算法。给出了离散时间信号尺度变换的构造表达式及其Chirp变换快速实现流程。讨论了Chirp变换实现中的参数选取准则,分析了Chirp变换的信号带宽问题。讨论了算法的运算效率并与其它算法进行了比较。仿真试验证明了本文算法的有效性。     

Optimal empty vehicle redistribution for hub‐and‐spoke transportation systems

This article considers the empty vehicle redistribution problem in a hub‐and‐spoke transportation system, with random demands and stochastic transportation times. An event‐driven model is formulated, which yields the implicit optimal control policy. Based on the analytical results for two‐depot systems, a dynamic decomposition procedure is presented which produces a near‐optimal policy with linear computational complexity in terms of the number of spokes. The resulting policy has the same asymptotic behavior as that of the optimal policy. It is found that the threshold‐type control policy is not usually optimal in such systems. The results are illustrated through small‐scale numerical examples. Through simulation the robustness of the dynamic decomposition policy is tested using a variety of scenarios: more spokes, more vehicles, different combinations of distribution types for the empty vehicle travel times and loaded vehicle arrivals. This shows that the dynamic decomposition policy is significantly better than a heuristics policy in all scenarios and appears to be robust to the assumptions of the distribution types. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008