Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1

A queueing system characterized by the discrete batch Markovian arrival process (D-BMAP) and a probability of phase type distribution for the service time is one that arises frequently in the area of telecommunications. Under this arrival process and service time distribution we derive the waiting time distribution for three queue disciplines: first in first out (FIFO), last in first out (LIFO), and service in random order (SIRO). We also outline efficient algorithmic procedures for computing the waiting time distributions under each discipline. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 559–576, 1997     

超高斯随机振动环境的疲劳强化机理

针对可靠性强化试验的全轴随机振动环境的超高斯幅值分布特性开展其疲劳强化机理研究。首先通过理论分析表明RS机振动激励下试件应力仍保持超高斯分布,然后证明了同等量级下的超高斯分布比高斯分布随机应力具有更高的疲劳强化效能,从而揭示RS机全轴随机振动环境超高斯幅值分布特性的疲劳强化机理。     

Stage life testing

In progressive censoring, items are removed at certain times during the life test. Commonly, it is assumed that the removed items are used for further testing. In order to take into account information about these additional testing in inferential procedures, we propose a two‐step model of stage life testing with one fixed stage‐change time which incorporates information about both the removed items (further tested under different conditions) and those remaining in the current life test. We show that some marginal distributions in our model correspond either to progressive censoring with a fixed censoring time or to a simple‐step stress model. Furthermore, assuming a cumulative exposure model, we establish exact inferential results for the distribution parameters when the lifetimes are exponentially distributed. An extension to Weibull distributed lifetimes is also discussed.     

Insurgent courts in civil wars: the three pathways of (trans)formation in today’s Syria (2012–2017)

As part of research on the meso-foundations of conflict, the field of ‘rebel governance’ examines political institutions that regulate the affairs of civilians in wartime as well as their relations with armed actors. Judicial institutions play an important role in this and research has shown that they are widespread among both historical and current insurgencies. However, usually these bodies have been analysed in the context of one hegemonic faction like the Tamil Tigers in Sri Lanka and the Afghan Taliban. What is missing so far is an analysis of different pathways of (trans)formation of rebel courts. As exemplified by the three case studies of judicial institutions in Eastern Ghouta, Idlib and Aleppo, these are shaped by the distribution of power between ‘same-side’ groups, yielding unipolar, bipolar, or multipolar constellations. The analysis is located on the meso or movement level of insurgent social structures, complementing research on the micro and macro levels.     

Classical geopolitics,realism and the balance of power theory

Since the end of World War II, classical geopolitics as a particular form of realism has been disengaged from the development of mainstream realist theories. This disengagement has not only concealed the value of classical geopolitics as a framework of analysis for policy and strategy, but also created an increasing rift between theory and policy in contemporary realist theories. This paper seeks to reengage classical geopolitics with mainstream realist theories by clarifying its realist traits and analytical characteristics, (re)stating its core propositions and probing into its potential contribution to the development of mainstream realist theories. This paper contends that classical geopolitics, while having a distinctive pedigree, can arguably be considered an integral part of the family of realist theories in view of its basic theoretical assumptions concerning international anarchy, the unit of analysis and power politics. As a framework of analysis, classical geopolitics incorporates three interrelated strategic propositions. Those three propositions not only constitute the theoretical core of classical geopolitics, but also manifest a peculiar balance-of-power conception that is essentially distinct from those proposed by mainstream realist theories. This paper argues that those three propositions combined promise to fill in prominent lacuna in the balance-of-power research programme, and also have significant implications for contemporary world politics.     

相似分布特性准则下的高斯混合项聚类-合并算法

针对高斯混合模型估计非高斯系统时高斯混合项呈指数级增长问题,提出一种基于相似分布特性准则的聚类-合并方法。通过分析高斯混合项的分布特性,基于扩展积分均方误差代价函数搜索最优置信范围,并对混合项进行高斯聚类,进而获得具有不同分布特性的高斯簇。为防止高斯簇间对高斯子项的重复利用,引入局部最近邻思想对交叉高斯项进行重新分配。采用并行多元素合并方法对高斯簇中的混合项进行合并,在保证无偏性基础上减少下一时刻混合项数量。仿真结果表明,改进算法在保证跟踪精度的同时还可有效提高算法效率。     

指数寿命产品可靠性增长试验的Bayes分析

针对指数寿命产品的定时、定数截尾试验方案,推广了Mazzuchi-Soyer模型的应用范围。首先引入模型假设,以狄氏分布作为先验分布,综合利用产品研制的历史信息和专家信息,结合产品研制各阶段试验数据,给出了各阶段可靠性的联合后验分布。然后利用Gibbs抽样算法解决后验推断计算问题,得到各阶段产品可靠性的Bayes点估计和区间估计。最后给出产品可靠性增长分析实例,表明了模型的优越性。     

通道失配对GNSS阵列抗干扰性能的影响分析

卫星导航接收机极易受到电磁干扰的影响,基于阵列接收机的空时(频)抗干扰技术被证明是目前最有效的抗干扰手段。在工程实现时,阵列通道存在通道失配,本文以统计性能的评估方法评估了通道失配对阵列抗干扰性能的影响。研究结果表明,通道间群时延偏差和幅度失配是导致阵列抗干扰性能下降的主要因素,前者可通过增加空时滤波器阶数来消除影响,而后者对空时滤波器阶数不敏感,需要进行必要的校正。     

基于矢量分配的组合导航容错联邦滤波算法

针对高动态环境下飞行器组合导航系统因不确定故障导致导航精度下降的问题,提出了一种基于矢量信息分配的容错联邦滤波算法。设计矢量形式的故障检测函数,对各观测量进行单独的故障程度划分,克服了将故障子系统所有观测量同时隔离的缺陷;根据观测量是否异常,重构时变量测噪声矩阵和信息分配矢量系数,对子滤波器的状态变量进行信息分配,在隔离故障子系统异常观测量的同时,最大限度地利用正确观测信息。仿真结果表明,采用该算法能够充分发挥各导航子系统的优势,极大提高了导航子系统信息利用率,具有较高的精确性和容错性。     

Scheduling of depalletizing and truck loading operations in a food distribution system

This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003