Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data

Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017     

Many‐server loss models with non‐poisson time‐varying arrivals

This article proposes an approximation for the blocking probability in a many‐server loss model with a non‐Poisson time‐varying arrival process and flexible staffing (number of servers) and shows that it can be used to set staffing levels to stabilize the time‐varying blocking probability at a target level. Because the blocking probabilities necessarily change dramatically after each staffing change, we randomize the time of each staffing change about the planned time. We apply simulation to show that (i) the blocking probabilities cannot be stabilized without some form of randomization, (ii) the new staffing algorithm with randomiation can stabilize blocking probabilities at target levels and (iii) the required staffing can be quite different when the Poisson assumption is dropped. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 177–202, 2017     

调度感知同步数据流建模

对流应用系统进行吞吐量分析需要将周期静态顺序调度建模到数据流图中,吞吐量分析效率依赖于数据流图的规模及建模时间。为了提高吞吐量分析效率,提出基于同构同步数据流图的调度感知同步数据流模型及相应建模方法。通过利用应用模型结构特征及周期静态顺序调度,可减少模型中的任务、边和初始符号数目;可以使用已有分析方法对模型进行吞吐量分析。实验结果表明,所提建模方法优于已有方法,可有效提高吞吐量分析效率。     

滑模控制的新型双幂次组合函数趋近律

提出一种基于双幂次组合函数趋近律的新型滑模控制方案。与现有的快速幂次或双幂次趋近律相比,具有更快的收敛速度,同时还保持了全局固定时间收敛特性,收敛时间上界与滑模初值无关。当系统存在有界扰动时,能够使滑模变量在有限时间内收敛到稳态误差界内,同时其稳态误差要小于现有方法的。仿真实验验证了该方法的有效性及理论分析的正确性。     

改进IAHP-CIM模型的雷达组网探测能力评估方法

针对雷达组网探测能力的评估问题,采用鱼骨图法对影响雷达组网探测能力的多种因素进行梳理,得到结构层次清晰的指标评价体系。采用改进的区间层次分析—控制区间和记忆模型对该指标体系进行评估,具体方法是:运用区间层次分析法构造区间判断矩阵;利用蛙跳算法求解区间判断矩阵中满足最小一致性的确定性矩阵;利用控制区间和记忆模型来确定各指标的风险概率,实现指标体系的评估。以具体的案例为对象进行仿真实验,结果表明,所提评估方法有效,评估结论相对客观、可信,对雷达组网探测能力评估具有一定参考价值,从而为雷达组网的优化部署奠定良好基础。     

基于复杂排队系统的三值光学计算机服务模型与性能分析

三值光学计算机的运算请求处理过程缺乏合理、系统的性能评价标准与体系。基于M/M/1、M/M/n、M~X/M/1和M/M~B/1构成的复杂排队系统,构建三值光学计算机的四阶段服务模型,同时建立立即调度和结束时调度两种策略和算法。基于不同排队系统讨论运算请求的接收时间、预处理时间、运算时间和发送时间的计算方法,进而得到最终响应时间。通过仿真实验对两种策略的模型进行验证,结果表明,结束时调度策略明显优于立即调度策略。     

方差全局灵敏度求解的空间分割结合无迹变换方法

为有效计算基于方差的全局灵敏度指标尤其是非线性程度较高的响应函数的,将积分空间的可加性以及无迹变换结合起来,利用函数在子空间内非线性程度会降低以及无迹变换方法在概率空间内对低非线性函数性质具有强捕捉能力的特点,提出计算基于方差的全局灵敏度指标的高效方法。该方法只需产生一组无迹变换样本就可以近似求得各阶灵敏度指标,并且该近似解随空间分割个数的增加而收敛于真值。通过非线性程度较高的验证算例及工程算例验证了所提方法在处理非线性功能函数上的高效性和准确性。     

Counter-Insurgency in Pakistan: The Role of Legitimacy

The Pakistani security forces have won their fight against the insurgency of the Pakistani Taliban, though terrorism will remain a serious problem for the foreseeable future. Victory was won not chiefly on the basis of new tactics, but of the recovery of legitimacy for the campaign among the population and the armed forces. This occurred when the war came to be seen as one waged not in the interests of the USA, but for the defence of Pakistan. In Balochistan, the nationalist insurgency has been different from and weaker than that of the Taliban—but may prove longer lasting. Military tactics in Balochistan have closely resembled those of the British Raj, and have been based with some success on fomenting tribal divisions and co-opting tribal elites.     

Insurgency and Violent Extremism in Pakistan

Pakistan has an uneven history of dealing with insurgencies and extremism. This article identifies the various campaigns and policies employed to defeat militants and deal with violent extremism. It describes the major anti-state groups and how Pakistan’s military and civilian leaders, relying on the related strategies of selectivity, gradualism and containment, have allowed militancy and terrorism to thrive. This article finds that while the elites and the public may have belatedly come to appreciate the existential internal threats these groups pose to the country, there are strong reasons to doubt the state’s full commitment to its promises to take meaningful action.     

无人机规避或跟踪空中目标的自适应运动导引方法

无人机规避或跟踪空中目标可以看作是一个非线性运动导引控制问题。针对这类任务中无人机和目标存在高机动性、高时敏性等特点,提出了一种基于Lyapunov稳定性理论的无人机规避或跟踪目标运动导引方法。构建了基于精细时间运动导引方法的无人机规避或跟踪空中目标问题求解框架,并将无人机碰撞规避和机动目标跟踪问题分别转化为到达虚拟目标点和与虚拟目标点交会的问题。针对碰撞规避问题,将其转化为实现平行导引的控制问题,基于Lyapunov稳定性理论设计了无人机碰撞规避导引律。针对机动目标跟踪问题,在碰撞规避基础上,根据目标点交会的要求设计了相应的目标跟踪导引律。在Gazebo平台上开展了仿真验证实验,实验结果表明:所提方法能够有效避免大过载情况的出现,并具有较强的时变和参数适应性。