系统延迟对脱靶量的影响研究

Paul Zarchan在研究一类由二项式传递函数描述的制导律的脱靶量时,提出了一个命题,即这一类制导律的脱靶量随制导时间的变化曲线可由时间常数为1时的那条脱靶量曲线经过时间轴的比例变换得到。证明了这一命题,并将它扩展到系统中存在纯延迟的情况,得到的结果可以很方便地用于研究系统延迟对脱靶量的影响。     

谈自给式呼吸器的选用

论述了自给式呼吸器在灾害事故抢险救援中的重要性,分析了三种自给式呼吸器的使用特点和使用注意事项,介绍了三种常用的自给式呼吸器防护时间的确定方法,以及在实际救援作业中合理选用呼吸器应考虑的事项。     

演化硬件中变异概率对进化算法首次命中时间的影响

在(1+1)EAs中,采用马尔可夫链推移时间分析法,推导出了平均首次命中时间的表达式。从理论上分析了变异概率对平均首次命中时间的影响。结果表明适当的变异概率会缩短平均首次命中时间,加快进化算法的寻优时间。     

Alleviating time inconsistent behaviors via a competition scheme

Under quasi‐hyperbolic discounting, the valuation of a payoff falls relatively rapidly for earlier delay periods, but then falls more slowly for longer delay periods. When the salespersons with quasi‐hyperbolic discounting consider the product sale problem, they would exert less effort than their early plan, thus resulting in losses of future profit. We propose a winner‐takes‐all competition to alleviate the above time inconsistent behaviors of the salespersons, and allow the company to maximize its revenue by choosing an optimal bonus. To evaluate the effects of the competition scheme, we define the group time inconsistency degree of the salespersons, which measures the consequence of time inconsistent behaviors, and two welfare measures, the group welfare of the salespersons and the company revenue. We show that the competition always improves the group welfare and the company revenue as long as the company chooses to run the competition in the first place. However, the effect on group time inconsistency degree is mixed. When the optimal bonus is moderate (extreme high), the competition motivates (over‐motivates) the salesperson to work hard, thus alleviates (worsens) the time inconsistent behaviors. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 357–372, 2017     

一种稳健的循环平稳信号时延估计算法

基于信号循环平稳特性的时延估计算法具有较强的抗干扰和抗噪声能力,但循环频率误差时性能下降严重。针对这一问题,首先分析了循环频率误差对循环时延估计算法中,循环互相关函数相关法估计性能的影响,进而提出了一种对循环频率误差稳健的改进循环时延估计算法。改进算法通过两次搜索确定循环频率的真实值。仿真实验结果表明,改进算法可以有效地校正循环频率误差,最终使时延估计误差与无循环频率误差时基本相同。     

战术通信网组网方案评估优选方法

在当前信息化的战场环境下,战场环境瞬息万变,战术通信网作为信息化战争的神经中枢,起到了至关重要的作用,然而组网方案的好坏直接决定着通信网性能的优劣,因此,如何在战场环境下快速、自动、客观地评估战术通信网组网方案是一个亟待解决的问题。通过分析战术通信网的特性和要求,提出了战术通信网组网方案评估指标体系,并采用熵权灰关联的方法对组网方案进行评估优选,该方法方便快捷并且可以编程实现,不仅能够在战场环境下实时、自动地对组网方案进行评估优选,而且评估结果也符合实际情况,为指挥员提供了决策依据。     

固定节点3D网格部署的水下传感器网络分簇路由算法

水下传感器网络是应用于水下通信的重要传感器网络技术。提出了基于固定节点3D网格部署的水下无线传感器网络分簇算法,设计了3D网格的编址和分簇方法,实现了基于地址分配的节点定位,构建了算法的能耗分析模型。采用MATLAB完成了算法的性能仿真,对比了DS-VBF、IAR和GEDAR 3个算法的平均数据传输延迟和网络生存时间(TTL)。实验结果表明,此算法的平均数据传输延迟较短,可明显提高UWSNS的生存时间。     

可靠UDP协议栈的FPGA实现

基于Xilinx公司的Virtex-5系列FPGA开发板,采用VHDL硬件描述语言,并运用模块化的设计理念,参考TCP_IP协议栈的工作机制,设计并实现了一个具有接收确认及漏发重发功能的可靠的UDP_IP网络通信协议栈。同时,设计并实现了一个以太网控制器,该控制器与UDP_IP协议一起构成一个完整的网络通信链路协议。经过上板测试验证,该通信协议栈能正确高效地完成网络数据的发送和接收等工作,且稳定性良好。     

飞行器试验多测控目标发射零点应急处理方法

飞行器飞行试验任务中,发射零点T0是整个测控系统启动运行的基准点,是保证测控系统有条不紊正常工作的关键因素。特别是执行多个测控目标连射飞行试验任务,多个发射零点的正确处理更是关乎试验任务的成败。在分析发射零点形成机制基础上,对发射零点在指控系统实时测控软件中的处理方法进行了研究,提出了一种实时测控软件重启后重新获得多测控目标正确发射零点的应急处理方法,解决了试验过程中一旦实时测控软件因重大软件故障导致初始发射零点丢失的问题,保障了试验任务的顺利进行。     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015