On allocating one active redundancy to coherent systems with dependent and heterogeneous components' lifetimes

This article studies coherent systems of heterogenous and statistically dependent components' lifetimes. We present a sufficient and necessary condition for a stochastically longer system lifetime resulted by allocating a single active redundancy. For exchangeable components' lifetimes, allocating the redundancy to the component with more minimal path sets is proved to produce a more reliable system, and for systems with stochastic arrangement increasing components' lifetimes and symmetric structure with respect to two components, allocating the redundancy to the weaker one brings forth a larger reliability. Several numerical examples are presented to illustrate the theoretical results as well. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 335–345, 2016     

连续波强激光武器的动态毁伤概率数学模型

在强激光武器的跟踪误差为均方可导、各态历经、零均值的正态过程的条件下,通过明晰的物理概念与严谨的数理演绎,导出了它的动态毁伤概率的级数表达式。通过算例探讨了动态毁伤概率的性质:它存在两个极大值所对应的随机穿越的自然频率,当跟踪系统工作在其中的非零频率上时,更具有快速反应能力;展现了跟踪误差的传递函数与动态毁伤概率间的定量关系。为论证、设计、检验强激光武器系统的动态毁伤概率提供了理论依据与技术支持。     

超短波信道建模方法

针对超短波信道传播条件复杂,缺乏相关成熟方法和模型的现状,对当前国内外现有超短波信道模型和建模方法进行了梳理、总结和归纳。简单介绍了超短波传播特性、信道参数以及现有模型,重点梳理了在不同应用场景下,可用于超短波信道建模的方法。然后,针对基于随机传播图理论的方法进行了重点介绍,总结了基于信道参数的模型验证方法。最后,针对不同的超短波应用条件,对相关的方法进行了展望。     

超声速二元机翼随机混沌运动分析

以考虑随机扰动的超声速二元机翼为研究对象,采用Kapitaniak方法对超声速二元机翼的随机混沌特性进行研究.采用三阶活塞理论推导超声速二元机翼的非线性气动力和气动力矩,建立考虑随机扰动、具有俯仰立方非线性的机翼2自由度运动微分方程,并将其写成4维状态方程的形式;采用中心流形方法对系统进行降维,将系统状态方程从4维降为...     

基于Neumann谱和PM谱的海浪感应磁场能量分布计算

结合前人在海浪功率谱以及海浪产生磁场两方面的研究 ,求出了海浪 磁场系统的传递函数 ,分析了该系统的性质 ,并利用该传递函数和Neumann谱、PM谱计算了磁场功率谱 ;在此基础上 ,根据实际观测我国海区的海浪高度 周期分布 ,求解海浪分布参数 ,模拟实际的海浪过程 ,求出了实际情况下的海浪感应磁场功率谱 ,并分析了其特性 .     

Selecting review periods for a coordinated multi‐item inventory model with staggered deliveries

Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T_j periods, one reviews the current stock level of item j and decides on deliveries for each of the next T_j periods, thus incurring an item‐by‐item fixed cost k_j. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T₁, T₂, …, T_N and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001     

基于Petri网的C2S性能分析方法研究

给出了用时间连续随机Petri网和时间离散随机Petri网计算系统稳态概率的方法,并将其应用于指挥控制系统(C2S)的性能分析中,分析结果表明这种计算方法是可行的。     

Response surface analysis of two‐stage stochastic linear programming with recourse

We apply the techniques of response surface methodology (RSM) to approximate the objective function of a two‐stage stochastic linear program with recourse. In particular, the objective function is estimated, in the region of optimality, by a quadratic function of the first‐stage decision variables. The resulting response surface can provide valuable modeling insight, such as directions of minimum and maximum sensitivity to changes in the first‐stage variables. Latin hypercube (LH) sampling is applied to reduce the variance of the recourse function point estimates that are used to construct the response surface. Empirical results show the value of the LH method by comparing it with strategies based on independent random numbers, common random numbers, and the Schruben‐Margolin assignment rule. In addition, variance reduction with LH sampling can be guaranteed for an important class of two‐stage problems which includes the classical capacity expansion model. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 753–776, 1999     

A guarantee rate optimization model for wastewater treatment system design under uncertainty

We consider a design problem for wastewater treatment systems that considers uncertainty in pollutant concentration levels at water sources. The goal is to optimize the selection of treatment technologies and pipeline connections, so that treated wastewater can achieve specified effluents discharge limits as well as possible. We propose a new two-stage model to optimize a set of guarantee levels, that is, the maximum concentration level of source pollutants for which treated wastewater can be compliant with discharge limits. In the first stage, treatment technologies and pipeline connections are selected. In the second stage, when pollutant concentration levels are revealed, wastewater distribution and mixing are determined. A key attractiveness of the proposed guarantee rate optimization model is that it can be simplified into a single-stage mixed-integer linear program. In our numerical experiments based on real-world pollutants data, the guarantee rate model demonstrates its advantages in terms of computational efficiency, scalability and solution quality, compared with the standard probability maximization model. Finally, the methodology proposed in this paper can also be applied to other two-stage problems under uncertainty with similar uncertainty characteristics.     

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