LEO卫星网络路径选择策略

路由算法在选择路径时,主要考虑传输延迟和跳数这两个因素,分别选取最短延迟路径(Least Delay Path,LDP)或最少跳数路径(Least Hops Path,LHP)。在卫星网络中,基于LHP选径策略实现更加简单,但其应用在LEO卫星网络中合理性的研究成果不多。对极轨道LEO卫星网络中,LDP和LHP之间关系进行详细地理论分析,验证了LHP选径策略的合理性。并在此基础上,提出一种基于横向传输优先级(Horizontal Transmitting Priority,HTP)的LHP最短路径选择策略,利用横向链路长短特性简化路径决策流程。通过仿真,该方法能够快速寻找到最短LHP路径,为LEO卫星网络路由算法提供一定的研究基础。     

Counterinsurgency American style: Considering David Petraeus and twenty-first century irregular war

This article examines the complex legacy of David Petraeus who was a key figure in the emergence of the US military shift towards counterinsurgency doctrine in the years after 2006. Although Petraeus has been perceived by critics as a publicity seeker, he can be credited with laying the foundations for a more serious commitment to COIN involving in particular in integrating conventional and Special Forces in arenas like village stability operations. The article looks a Petraeus's role in both Iraq and Afghanistan: it concludes that, in the case of Afghanistan, it is too early to assess whether counterinsurgency has had a decisive impact of the outcome of the war against the Taliban.     

基于OMAPl510单兵通信系统中头盔子系统的实现

OMAPl510是德州仪器TI公司的双核架构处理器,整合了一个控制性能强的ARM925处理器、一个低功率消耗的高效能TMS320C55X数位信号处理器DSP。文中首先描述单兵通信系统的组成,并给出以头盔子系统为核心的基本工作原理图。然后介绍了0MAPl510的硬件架构和软件架构,并较为详尽地给出实现头盔子系统的蓝牙主控程序的主要代码。最后针对此头盔子系统蓝牙无线通信距离的局限性,提出与头盔共形的微带阵列天线的改进方案。     

一类分段线性费用网络流问题

本文通过把一类分段线性费用网络流问题化成线性费用网络流问题,给出了求解这类分段线性费用网络流问题的算法。     

卫星导航系统的体系安全性分析方法

为了应对卫星导航系统内部复杂关系等体系特征为其安全分析带来的挑战、全面识别和分析卫星导航系统面临的体系安全威胁、提高系统的安全性和服务能力,基于功能依赖网络分析理论提出了从体系角度研究卫星导航系统安全性的建模方法,重点对导航系统内组件系统之间交互关系导致的危险传播、任意失效组合进行了后果分析和原因调查。仿真结果表明该方法能清晰地描述危险传播和失效组合的过程以及进行正逆向的推理分析,也证明了该方法在卫星导航系统安全分析问题上的潜力和适用性。     

基于旋量方法的高超声速飞行器三维非线性伪最优制导律设计

针对高超声速飞行器制导过程中的通道耦合问题,设计一种基于旋量方法的三维非线性伪最优制导律。引入角度矢量、视线旋量、视线旋量速度等概念,通过等价性证明,得出视线旋量、视线旋量速度控制分别与视线方位、视线角速度控制具有一致性的结论,从而将制导问题转化为视线旋量和旋量速度的控制问题;基于旋量方法构建弹目视线旋量、视线旋量速度模型,构建得到飞行器制导的三维非线性模型;为避免直接求解Riccati微分方程过程的复杂性,引入伪控制变量,将三维非线性制导模型转化为线性制导模型;分别针对无终端约束和有终端约束情况,基于二次型最优方法得到三维非线性伪最优制导律。该制导律避免了通道解耦,其制导参数又满足一定物理意义下的最优性。仿真结果验证了所设计制导律的有效性。     

Optimal service‐capacity allocation in a loss system

We consider a loss system with a fixed budget for servers. The system owner's problem is choosing the price, and selecting the number and quality of the servers, in order to maximize profits, subject to a budget constraint. We solve the problem with identical and different service rates as well as with preemptive and nonpreemptive policies. In addition, when the policy is preemptive, we prove the following conservation law: the distribution of the total service time for a customer entering the slowest server is hyperexponential with expectation equal to the average service rate independent of the allocation of the capacity. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 81–97, 2015     

空军网络化指挥信息系统作战效能评估指标体系构建?

针对目前网络化指挥信息系统作战效能评估指标体系不完善、且缺乏分项指标计算方法模型等问题,从网络化作战对指挥信息系统的作战需求出发,研究构建了空军网络化指挥信息系统的作战效能评估指标体系,并提出了分项指标概念内涵和计算模型与方法,可为指挥信息系统研制提供参考和支撑,为其作战效能的客观评估提供指标体系和模型方法。     

一种三自由度模型姿态调整机构的正反解分析

提出了一种三自由度模型姿态调整机构。采用回转矩阵方法分析了模型姿态与输入角度的关系,给出了机构的正解,结果表明模型姿态的三个自由度之间存在耦合关系,且表现出非线性。利用机构的运动特点,采用几何方法给出了反解,避免了数值解法的缺陷。     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004