Analysis and optimal design of discrete order picking technologies along a line

Order picking accounts for most of the operating expense of a typical distribution center, and thus is often considered the most critical function of a supply chain. In discrete order picking a single worker walks to pick all the items necessary to fulfill a single customer order. Discrete order picking is common not only because of its simplicity and reliability, but also because of its ability to pick orders quickly upon receipt, and thus is commonly used by e‐commerce operations. There are two primary ways to reduce the cost (walking distance required) of the order picking system. First is through the use of technology—conveyor systems and/or the ability to transmit order information to pickers via mobile units. Second is through the design—where best to locate depots (where workers receive pick lists and deposit completed orders) and how best to lay out the product. We build a stochastic model to compare three configurations of different technology requirements: single‐depot, dual‐depot, and no‐depot. For each configuration we explore the optimal design. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

数字化部队指挥网络系统效能评价模型

以结构熵理论为基础,分析数字化部队作战指挥信息网络系统组织结构对系统内信息流的影响,从信息的角度对系统组织结构的有序度进行评价,引入信息流的时效和质量的概念,建立定量评价系统结构有序度计算的时效质量模型,结合系统数据传输业务效能的评价方法,形成作战指挥信息网络系统整体综合效能的评价模型。最后辅以实例。     

运动舰船上任意分布的磁偶极子的感应电场计算

基于电磁场的坐标变换和线性叠加原理 ,导出了舰船上任意分布的磁偶极子感应电场的计算方法 .与积分方法相比 ,该方法具有普遍性 ,对任意磁化的舰船感应的磁场都适用 .     

基于高阶累积量与神经网络的干扰识别算法

研究了一种基于高阶累积量和神经网络的干扰识别算法。该方法把卫星通信中常见的各种干扰信号的归一化高阶累积量作为分类特征参数,应用神经网络对特征参数进行分类训练,将接收干扰信号的归一化高阶累积量输入已训练的神经网络进行干扰类型的识别。试验结果表明:该算法在低干信比的情况下具有较高的识别准确率。     

Systems composed of two types of nonidentical and dependent components

A coherent system of order n that consists two different types of dependent components is considered. The lifetimes of the components in each group are assumed to follow an exchangeable joint distribution, and the two random vectors, which represent the lifetimes of the components in each group are also assumed to be dependent. Under this particular form of dependence, all components are assumed to be dependent but they are categorized with respect to their reliability functions. Mixture representation is obtained for the survival function of the system's lifetime. Mixture representations are also obtained for the series and parallel systems consisting of disjoint modules such that all components of Type I are involved in one module (subsystem) and all components of Type II are placed in the other module. The theoretical results are illustrated with examples. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 388–394, 2015     

Sharp bounds for the reliability of systems and mixtures with ordered components

In this article, we study how to derive bounds for the reliability and the expected lifetime of a coherent system with heterogeneous ordered components. These bounds can be used to compare the performance of the systems obtained by permuting the components at a given system structure, that is, to study where we should place the different components at a system structure to get the most reliable system. Moreover, a similar procedure is applied to get bounds for mixtures and for the generalized proportional hazard rate model when the baseline populations are ordered. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 108–116, 2017     

On matched active redundancy allocation for coherent systems with statistically dependent component lifetimes

This study addresses the allocation of matched active redundancy components to coherent systems with base components having statistically dependent lifetimes. We consider base component lifetimes and redundancy component lifetimes which are both stochastic arrangement monotone with respect to a pair of components given the lifetimes of the other components. In this context, allocating a more reliable redundancy component to the weaker base component is shown to incur a stochastically larger system lifetime. Numerical examples are presented as an illustration of the theoretical results.     

Civilian Cooperation and Non-Cooperation with Non-State Armed Groups: The Centrality of Obedience and Resistance

Abstract

Terms like ‘support’ and ‘collaboration’ are often used interchangeably to denote a loose set of acts or attitudes that benefit non-state armed groups (NSAGs). However, these terms are seldom defined, and the alternatives available to civilians are rarely identified. Moreover, existing approaches overlook that the interaction between civilians and NSAGs is often one between ruler and ruled, which makes obedience and resistance central. This paper proposes to conceptualize the choices available to civilians as forms of cooperation and non-cooperation, offers a typology, and discusses the implications for theory building on civilian and NSAG behavior, and on the functioning of armed social orders.     

布拉格衍射型冷原子干涉重力仪关键实验条件研究

文章介绍了一种基于n阶布拉格衍射的新型冷原子干涉重力仪,可以进一步提高现有拉曼跃迁型原子干涉重力仪的测量灵敏度和稳定度。在介绍布拉格衍射型原子干涉重力仪基本原理的基础上,建立了原子平行驻波入射的时间型布拉格衍射冷原子干涉重力仪理论模型,分析了实验所需的关键条件,包括原子团纵向温度,布拉格激光直径、曲率半径、频率、强度以及时序等。与已有实验数据的对比结果表明,本文所建模型合理,所得结论能够为实际构造一台布拉格衍射型冷原子干涉重力仪提供有意义的指导。     

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