舰炮武器对驱逐舰目标射击毁伤定律研究

在综合评判驱逐舰目标毁伤等级并建立目标毁伤树的基础上,构造了舰炮武器系统对驱逐舰目标射击命中毁伤区域的简化模型图,建立了舰炮对驱逐舰目标射击的条件命中概率模型,通过分析弹丸对装甲目标的终点效应,建立了舰炮对驱逐舰目标射击的条件毁伤概率模型.计算结果表明,运用该方法研究舰炮武器系统对驱逐舰目标射击毁伤定律可信性高.     

Retailer's rationale to refuse consumer returns in supply chains

While accepting consumer returns has long been proposed as a solution to resolve the consumer valuation uncertainty problem, there are still a sizable portion of retailers who insist on a “no return” policy. In this article, we offer an economic rationale for these seemingly unreasonable strategies in a supply chain context. We demonstrate when and why the retailer may benefit from refusing consumer returns, even though offering consumer returns allows the supply chain to implement the expostmarket segmentation. Granting the retailer the right to refuse consumer returns may sometimes improve supply chain efficiency: it eliminates the manufacturer's attempt to induce inefficient consumer returns and bring the equilibrium back to that in the vertically integrated benchmark. We also find that the refund and the retail price can move in the opposite directions when product reliability varies, and consumer returns have a nontrivial impact on the quality choice. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 686–701, 2015     

基于作战环的单目标毁伤概率分析

针对现代化战争的特点,基于作战环的思想,将整个作战环分成几个不同的环节进行分析,并提出了一种求解武器装备对于单目标毁伤概率的计算方法。该方法考虑了不同环节对于目标毁伤的影响,定量计算了武器装备对敌方目标的毁伤概率,既从宏观层面上考虑了武器装备的涌现性,又从底层分析了影响目标毁伤的参数。最后通过示例分析验证了方法的可行性和有效性。     

A novel gradient approach for optimal design and sensitivity analysis of EWMA control charts

Conventional control charts are often designed to optimize out‐of‐control average run length (ARL), while constraining in‐control ARL to a desired value. The widely employed grid search approach in statistical process control (SPC) is time‐consuming with unsatisfactory accuracy. Although the simulation‐based ARL gradient estimators proposed by Fu and Hu [Manag Sci 45 (1999), 395–413] can alleviate this issue, it still requires a large number of simulation runs to significantly reduce the variance of gradient estimators. This article proposes a novel ARL gradient estimation approach based on integral equation for efficient analysis and design of control charts. Although this article compares with the results of Fu and Hu [Manag Sci 45 (1999), 395–413] based on the exponentially weighted moving average (EWMA) control chart, the proposed approach has wide applicability as it can generally fit into any control chart with Markovian property under any distributions. It is shown that the proposed method is able to provide a fast, accurate, and easy‐to‐implement algorithm for the design and analysis of EWMA charts, as compared to the simulation‐based gradient estimation method. Moreover, the proposed gradient estimation method facilitates the computation of high‐order derivatives that are valuable in sensitivity analysis. The code is written in Matlab, which is available on request. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 223–237, 2014     

Strategic outsourcing under technology spillovers

We study a supply chain in which an original equipment manufacturer (OEM) and a contract manufacturer (CM) compete in the finished goods market. The OEM can decide whether to outsource the intermediate good, a critical component for producing the finished good, from the CM or make in‐house production. Technology transition improves the CM's production efficiency, and it can take two different forms: a direct technology transfer from the OEM to the CM or technology spillovers through outsourcing from the OEM to the CM. We document the possibility of strategic outsourcing, that is, the CM supplies the intermediate good to the OEM when she is less efficient than the OEM's in‐house production. We find that technology spillovers can strengthen the incentive for strategic outsourcing. Furthermore, compared with direct technology transfers, outsourcing coupled with technology spillovers may generate more technology transition. Outsourcing is a particularly appropriate channel for implicit collusion when the OEM is not very efficient with the production of the intermediate good. Our results suggest that ex post competition on the finished goods can create room for ex ante collaboration and provide some implications on the OEM's outsourcing strategies when facing a competitive CM.© 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 501–514, 2014     

Assessing the value of demand sharing in supply chains

We consider the problem of assessing the value of demand sharing in a multistage supply chain in which the retailer observes stationary autoregressive moving average demand with Gaussian white noise (shocks). Similar to previous research, we assume each supply chain player constructs its best linear forecast of the leadtime demand and uses it to determine the order quantity via a periodic review myopic order‐up‐to policy. We demonstrate how a typical supply chain player can determine the extent of its available information in the presence of demand sharing by studying the properties of the moving average polynomials of adjacent supply chain players. The retailer's demand is driven by the random shocks appearing in the autoregressive moving average representation for its demand. Under the assumptions we will make in this article, to the retailer, knowing the shock information is equivalent to knowing the demand process (assuming that the model parameters are also known). Thus (in the event of sharing) the retailer's demand sequence and shock sequence would contain the same information to the retailer's supplier. We will show that, once we consider the dynamics of demand propagation further up the chain, it may be that a player's demand and shock sequences will contain different levels of information for an upstream player. Hence, we study how a player can determine its available information under demand sharing, and use this information to forecast leadtime demand. We characterize the value of demand sharing for a typical supply chain player. Furthermore, we show conditions under which (i) it is equivalent to no sharing, (ii) it is equivalent to full information shock sharing, and (iii) it is intermediate in value to the two previously described arrangements. Although it follows from existing literature that demand sharing is equivalent to full information shock sharing between a retailer and supplier, we demonstrate and characterize when this result does not generalize to upstream supply chain players. We then show that demand propagates through a supply chain where any player may share nothing, its demand, or its full information shocks (FIS) with an adjacent upstream player as quasi‐ARMA in—quasi‐ARMA out. We also provide a convenient form for the propagation of demand in a supply chain that will lend itself to future research applications. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 515–531, 2014     

马尔科夫对称离散信道级联信道容量研究

基于有限维的级联马尔科夫对称信道矩阵,其转移概率的极限一定存在,推导出当n足够大时,输出符号的概率分布不依赖于输入的概率分布,使得信道容量为零,信道阻塞。n为信道级联的上限。针对主对角元素概率值不同将信道矩阵划分为惰性信道和灵敏信道,并通过仿真分析得出信道的级联上限n与矩阵维数无关,与信道矩阵主对角元素呈正相关。     

信息化条件下装备器材供应链设计与重构研究

现行装备器材供应存在着供应渠道过长、不能快速响应等问题,为此通过对装备器材供应链进行集成化体系结构模型设计与构建,探讨了装备器材供应链的重构策略,分别从信息流模式重构、业务流程重构和物流体系重构等3个主要方面对装备器材供应链重构策略进行了分析与探讨,以实现装备器材供应链的快速响应.     

THE MORAL PERMISSIBILITY OF AUTOMATED RESPONSES DURING CYBERWARFARE

Automated responses are an inevitable aspect of cyberwarfare, but there has not been a systematic treatment of the conditions in which they are morally permissible. We argue that there are three substantial barriers to the moral permissibility of an automated response: the attribution, chain reaction, and projection bias problems. Moreover, these three challenges together provide a set of operational tests that can be used to assess the moral permissibility of a particular automated response in a specific situation. Defensive automated responses will almost always pass all three challenges, while offensive automated responses typically face a substantial positive burden in order to overcome the chain reaction and projection bias challenges. Perhaps the most interesting cases arise in the middle ground between cyber-offense and cyber-defense, such as automated cyber-exploitation responses. In those situations, much depends on the finer details of the response, the context, and the adversary. Importantly, however, the operationalizations of the three challenges provide a clear guide for decision-makers to assess the moral permissibility of automated responses that could potentially be implemented.     

Limiting behavior of the stochastic sequential assignment problem

The stochastic sequential assignment problem (SSAP) considers how to allocate available distinct workers to sequentially arriving tasks with stochastic parameters such that the expected total reward obtained from the sequential assignments is maximized. Implementing the optimal assignment policy for the SSAP involves calculating a new set of breakpoints upon the arrival of each task (i.e., for every time period), which is impractical for large‐scale problems. This article studies two problems that are concerned with obtaining stationary policies, which achieve the optimal expected reward per task as the number of tasks approaches infinity. The first problem considers independent and identically distributed (IID) tasks with a known distribution function, whereas in the second problem tasks are derived from r different unobservable distributions governed by an ergodic Markov chain. The convergence rate of the expected reward per task to the optimal value is also obtained for both problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013