运载火箭摄动制导导引系数实时计算方法

对于新型运载火箭,没有相近型号导引系数数据供参考,采用传统试探法计算量大,在制导方案初期论证中不能满足多方案快速计算的需求。在引入理想弹道剩余飞行速度概念的基础上,提出导引系数实时计算方法。本方法对当前实时状态参数和后续飞行段弹道进行了综合考虑,通过数字仿真表明导引精度高于传统常系数导引方法。由于本方法对导引能力进行了预估,因而制导指令不会剧烈变化,易于姿态控制系统的设计实现。同时,由于采用完全解析法,对箭载计算机计算能力要求几乎没有增加,易于工程实现。     

An FPTAS for scheduling a two‐machine flowshop with one unavailability interval

We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n⁵/ε⁴) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Proactive release procedures for just‐in‐time job shop environments,subject to machine failures

In this paper, we consider just‐in‐time job shop environments (job shop problems with an objective of minimizing the sum of tardiness and inventory costs), subject to uncertainty due to machine failures. We present techniques for proactive uncertainty management that exploit prior knowledge of uncertainty to build competitive release dates, whose execution improves performance. These techniques determine the release dates of different jobs based on measures of shop load, statistical data of machine failures, and repairs with a tradeoff between inventory and tardiness costs. Empirical results show that our methodology is very promising in comparison with simulated annealing and the best of 39 combinations of dispatch rules & release policies, under different frequencies of breakdowns. We observe that the performance of the proactive technique compared to the other two approaches improves in schedule quality (maximizing delivery performance while minimizing costs) with increase in frequency of breakdowns. The proactive technique presented here is also computationally less expensive than the other two approaches. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

分布虚拟战场环境CGF行为调度

提出了一种分布虚拟战场环境中计算机生成兵力(CGF)实体行为调度方法,该方法由仿真结点对结点中运行的所有本地CGF实体及异地实体的远程模型所产生的行为进行集中式调度。通过本地CGF实体的兴趣域动态决定需要执行的异地实体远程模型行为的优先级及执行最后时限,通过将本地所有CGF实体的兴趣域合并,减少仿真结点需要调度的异地实体远程模型数量,进一步降低仿真结点的计算开销。该方法可以有效地确保分布虚拟战场环境对仿真实时性及真实性的要求。     

多级安全实时数据库系统安全性与实时性需求的冲突分析

一个多级安全实时数据库系统不仅需要有安全限制,同时也要有时间约束.由于安全性与实时性需求之间冲突的存在而不可避免地产生隐蔽通道和优先倒置问题,文中首先分析多级安全实时数据库系统中实时性与安全性需求之间的冲突,而后基于HP 2PL协议,结合安全因素给出了一种解决冲突的算法.     

高保真语音数字信号获取系统设计与实现

给出了高保真数字信号获取系统的结构,分析了为生成高保真语音数字信号文件应注意的器件选择、电路设计和编程实现方法,总结了高保真数字信号获取系统四个主要环节,提出了相应的设计原则。     

战场态势生理信息感知系统

针对战场态势感知对人员信息采集的要求,设计了一种战场态势生理信息感知系统。该系统结合无线传感器网络,可穿戴技术,以CC2430芯片为核心,利用多生理传感器采集士兵生理信息,实现了心电、呼吸、体温和肢体运动的实时监测,并通过RS-232接口与微机连接,显示实时分析结果。经实验测试,结果与设计相符,数据误差不大于0．5％,系统功耗为240mW,通信距离为150m。该系统较好地满足了实时、准确、长时间监测的要求。     

某特种车辆TTCAN网络的静态调度设计

针对某特种车辆计算机控制系统对实时性的高要求,采用了TTCAN总线系统,为实现TTCAN系统的静态调度问题,提出了基于AL算法的改进算法——谐波周期算法,并通过MATLAB建立了系统的调度表。针对谐波周期算法的不足,结合该计算机控制系统的工作原理、信息传输的重要程度对静态调度表进行了适当的修改。通过与AL算法的对比分析,证实了改进的谐波周期算法在保证系统中周期型消息实时性能前提下,为非周期型信息获得了更大的传输带宽,又使系统信息传输的时间分配更加合理。     

基于北斗短报文的远海实时精密单点定位

针对远海精密导航与定位费用高昂的问题,提出利用北斗短报文传输多模全球导航卫星系统的实时服务数据,实现远海实时精密单点定位。为了降低通信成本和硬件成本,本研究对实时服务数据进行简化,弥补了北斗短报文带宽的不足;为了克服北斗短报文频率低的缺点,采取了实时精密星历预报的方法,来获取分钟间隔以外时刻的卫星轨道位置和钟差改正。对基于北斗短报文的远海实时精密单点定位的数据处理过程进行了仿真模拟。后期处理实测海洋观测数据,对定位性能进行测试,可实现水平方向厘米级定位,竖直方向精度为10~20 cm。该方法为低成本的远海实时定位提供了技术参考。     

Manpower allocation with time windows and job‐teaming constraints

In this work, we study manpower allocation with time windows and job‐teaming constraints. A set of jobs at dispersed locations requires teams of different types of workers where each job must be carried out in a preestablished time window and requires a specific length of time for completion. A job is satisfied if the required composite team can be brought together at the job's location for the required duration within the job's time window. The objective is to minimize a weighted sum of the total number of workers and the total traveling time. We show that construction heuristics used with simulated annealing is a good approach to solving this NP‐hard problem. In experiments, this approach is compared with solutions found using CPLEX and with lower bounds obtained from a network flow model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.