空间飞行器非共面机动策略研究

非共面机动问题是航天领域的经典问题,寻找轨道面变换的最优机动策略是研究的重点.对低轨道冲量变轨、高轨道冲量变轨和低轨/高轨冲量变轨的轨道面变换策略进行研究,建立了具体的轨道变换模型,运用遗传算法寻找到了最省燃料的轨道面变换策略.通过仿真,该机动策略相对其他2种能明显降低燃料消耗,实现轨道面的变换.     

二相编码雷达前沿复制干扰的能量效率分析

针对提高干扰的能量利用效率提供一些理论和技术问题,介绍了前沿复制干扰的产生背景。对二相编码雷达、灵巧噪声干扰和前沿复制干扰的基本成分通过匹配滤波器后的输出信号脉冲峰值进行了分析。以在匹配滤波器输出端产生相同数量和相同幅度大小的脉冲为能量利用效率比较基准,给出了这两种干扰方式各自所需的干扰信号能量的计算公式,并进行了典型条件下,这两种干扰方式所需干扰信号能量的数值计算;在一般情况下,对这两种干扰方式的能量利用效率进行了比较。指出若前沿波形宽度为雷达发射信号宽度的1/n,则前沿复制干扰所需能量为灵巧噪声干扰所需能量的n倍,前沿复制干扰的能量利用效率仅为灵巧噪声干扰的能量利用效率的1/n。     

基于关联分析法的指挥引导方式优化研究

指挥引导是作战指挥的重要组成部分,指挥引导效率的高低直接关系到作战效能的发挥。现代战争条件下,为完成某一作战任务,所需出动的兵力较多,空中态势复杂,如何合理分配指挥引导机构的指挥引导任务,选择有利的引导方式,对完成任务影响很大。因此,结合指挥引导的特点和要求,对指挥引导能力进行分析,设定相关参数的具体示例,运用动态规划理论、关联分析方法,通过建模和解算,确定各项指标的关联度,尝试解决影响指挥引导能力分配诸多复杂因素的关联问题,对指挥引导方式进行优化。     

基于统计能量分析法的船艇机舱舱室噪声仿真

以某一船艇机舱为例,从机舱发动机表面振动声辐射着手,建立了机舱的统计能量分析(SEA)模型,对船艇机舱的进行了仿真计算。结果表明,统计能量分析法与实际测量值吻合,SEA模型的计算值与舱内声压水平实测值误差在主要频带达到3dB以内。     

On‐line parameter estimation for a partially observable system subject to random failure

In this paper, we study the on‐line parameter estimation problem for a partially observable system subject to deterioration and random failure. The state of the system evolves according to a continuous time homogeneous Markov process with a finite state space. The system state is not observable, except for the failure state. The information related to the system state is available at discrete times through inspections. A recursive maximum likelihood (RML) algorithm is proposed for the on‐line parameter estimation of the model. The RML algorithm proposed in the paper is considerably faster and easier to apply than other RML algorithms in the literature, because it does not require projection into the constraint domain and calculation of the gradient on the surface of the constraint manifolds. The algorithm is illustrated by an example using real vibration data. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

舰用主锅炉低负荷时升压运行对蒸汽净化的影响

分析了蒸汽压力变化对饱和蒸汽湿度和汽水分离的影响,并在模拟器上进行了定量计算,得出的结论为某型舰用主锅炉低负荷时升压运行提供了理论依据.     

On‐line algorithms for minimizing makespan on batch processing machines

We consider problem of scheduling jobs on‐line on batch processing machines with dynamic job arrivals to minimize makespan. A batch machine can handle up to B jobs simultaneously. The jobs that are processed together from a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. Each job becomes available at its arrival time, which is unknown in advance, and its processing time becomes known upon its arrival. In the first part of this paper, we address the single batch processing machine scheduling problem. First we deal with two variants: the unbounded model where B is sufficiently large and the bounded model where jobs have two distinct arrival times. For both variants, we provide on‐line algorithms with worst‐case ratio (the inverse of the Golden ratio) and prove that these results are the best possible. Furthermore, we generalize our algorithms to the general case and show a worst‐case ratio of 2. We then consider the unbounded case for parallel batch processing machine scheduling. Lower bound are given, and two on‐line algorithms are presented. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 241–258, 2001     

Brinkmanship,not COIN,in Pakistan’s post-9/11 Internal War

Politics is critical to making sense of Pakistani successes and failures in dealing with non-state armed groups. This includes domestic political currents; regional political currents; and the global impetus of the post-9/11 era. How these currents overlap renders to any reading of insurgency in Pakistan real complexity. This article engages with this complexity rather than shirking from it. Its hypothesis is that while the insurgency bordering Afghanistan has been an epicentre of Pakistani military efforts to fight the Taliban, this theatre is in of itself insufficiently inclusive to grasp the nature of Pakistan’s security challenges and its consequent responses.     

基于节点综合效能的DTN路由算法

针对容忍延迟网络(DTN)高延迟、数据传输成功率低等问题,提出了一种基于节点综合效能的DTN路由算法SERA。该算法综合考虑移动节点的活跃度和剩余能量,使消息副本向综合效能高的节点扩散。SERA节点活跃度描述了节点的社会和动态特性,SERA尽量将消息副本传递给活跃度高的节点,以提高消息传输的成功率;在选择中继节点时,充分考虑节点的能量状态,以避免能量不足的节点承担更多的信息传输任务,从而提高网络节点的存活率。仿真结果表明,与典型的DTN路由算法相比,SERA能够更好地平衡节点的能耗,获得更高的消息递交成功率和更长的网络生存期。     

高能离子在材料中输运的蒙特卡罗模拟

利用蒙特卡罗方法对高能离子在材料中的输运进行了计算机模拟研究 ,入射高能离子与靶材料的作用近似为核散射和电子作用两个独立的部分 ,核散射能量损失采用经典两体碰撞近似 ,通过对碰撞参数的随机抽样得到散射角 ,电子能量损失高能时采用Bethe-Bloch公式 ,低能时采用Lindhard -Scharff公式 ,中能时采用插值公式。最后对高能铁离子入射于铝、硅材料的输运进行了模拟计算 ,给出了模拟结果并进行了分析。