Stochastic framework for partially degradation systems with continuous component degradation‐rate‐interactions

Many conventional models that characterize the reliability of multicomponent systems are developed on the premise that for a given system, the failures of its components are independent. Although this facilitates mathematical tractability, it may constitute a significant departure from what really takes place. In many real‐world applications, system components exhibit various degrees of interdependencies, which present significant challenges in predicting degradation performance and the remaining lifetimes of the individual components as well as the system at large. We focus on modeling the performance of interdependent components of networked systems that exhibit interactive degradation processes. Specifically, we focus on how the performance level of one component affects the degradation rates of other dependent components. This is achieved by using stochastic models to characterize how degradation‐based sensor signals associated with the components evolve over time. We consider “Continuous‐Type” component interactions that occur continuously over time. This type of degradation interaction exists in many applications, in which interdependencies occur on a continuum. We use a system of stochastic differential equations to capture such “Continuous‐Type” interaction. In addition, we utilize a Bayesian approach to update the proposed model using real‐time sensor signals observed in the field and provide more accurate estimation of component residual lifetimes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 286–303, 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     

Poachers turned gamekeepers: A study of the guerrilla phenomenon in Spain, 1808–1840

This article modifies the associations made by historians and political scientists of Spanish guerrilla warfare with revolutionary insurgency. First, it explains how the guerrilla phenomenon moved from a Leftist to a reactionary symbol. Second, it compares the insurgency and counter-insurgency features of the Carlist War (1833–1840) with those of the better-known Peninsular War (1808–1814). Third, it shows how erstwhile guerrilla leaders during the Carlist War made their expertise available to the counter-insurgency, in a socio-economic as well as military setting. This article revises the social banditry paradigm in nineteenth-century Spain in the under-researched context of Europe bloodiest nineteenth-century civil war.     

A branch‐and‐price approach for the stochastic generalized assignment problem

In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014     

多态的大功率可控硅开关功率放大器的仿真

为了满足远距离海底探测对发射信号大功率的需求,选用了一种大功率可控硅开关功率放大器。在临界换流、自然换流和强迫换流3种工作状态下,分析了该功率放大器的工作原理,并建立了等效电路模型。运用Or CAD仿真了临界换流状态时的等效电路模型;在自然换流状态和强迫换流状态下,为获得功放电流值和负载电流值,对其等效电路模型分别建立了非线性数学模型,并通过Matlab和VC++采用四阶Runge-Kutta法对非线性数学模型进行求解。以上方法能够求得该功率放大器电路在任意时刻、任意点处的电流电压值,能较客观、真实地反映电路的工作状况,对工程应用具有一定的参考价值。     

航空时敏制导炸弹增程弹道组合优化设计

为增强航空时敏制导炸弹在中制导段的滑翔能力,将极小值原理与自适应进化粒子群算法相结合,提出了一种适用于航空时敏制导炸弹增程弹道的组合优化设计方法。基于纵向平面内质心运动模型,推导了性能指标泛函及各不等式约束函数。引入Lagrange乘子矢量并建立相应的Hamilton函数实现无约束泛函极值问题的转换,推导出兼顾各优化目标函数的满意优化模型。利用自适应进化粒子群算法对该段增程弹道进行了攻角与弹翼张合档位双设计变量的组合优化。数值仿真算例表明,在满足状态方程约束的条件下,双变量的增程效果比常规单变量控制时显著提高,其优化结果可为制导炸弹弹道规划设计的研究提供一定的理论参考。     

小子样条件下导弹靶场试验综合评定方法

针对导弹靶场试验中的小子样问题,分析了自助法和随机加权法,并对自助法中再生子样较为集中的不足进行了改进。通过仿真比较得出,改进后的自助法具有更好的评定特性。     

单站单圈卫星初轨确定方法研究

为实现低轨卫星轨道的快速确定和预报,基于单站单圈雷达站测量数据采用遗传算法和最小二乘法对卫星初轨确定及轨道预测问题进行了研究。通过比较分析不同观测误差下两种方法的仿真结果,验证了初轨确定过程中两种方法的可行性,同时指出了各自的优缺点和适用条件,为不同观测条件下卫星最优初轨确定的方法提供了参考。     

放大转发双向中继网络的移动级联信道统计特征分析

针对放大转发协议下双向中继网络移动级联信道,为了分析其统计特征,结合用户完成信息交互的过程,将移动级联信道分解为传输部分和干扰部分两个时间过程。依据它们的双高斯乘积特点,分别给出了对应的一阶概率密度分布、二阶自相关函数和多普勒功率谱的表达式。与此同时,通过采用Gamma分布对级联信道进行了概率近似,得到了描述移动级联信道时变特性的电平通过率和平均衰落时间等指标的近似计算式。借助数值仿真验证了上述表达式的正确性。