PDA在应急事故指挥中的应用研究

在分析当前部队应急事故指挥现状与PDA(Personal Digital Assistant)应用现状的基础上,提出集成EGIS,GPS,GPRS的PDA系统在应急事故指挥中的应用原型,用于解决应急事故指挥中移动困难的问题,加快应急事故指挥系统的响应速度,降低事故造成的损失.介绍了Windows CE与嵌入式开发、系统组成、工作原理及系统功能,为PDA在应急事故指挥中的应用提出一个可行性方案.     

基于多线程的CABAC并行编码方法

CABAC(Context based Adaptive Binary Arithmetic Coding)是H.264/AVC主要档次以上配置中推荐采用的熵编码方法.相比其他的熵编码方法,CABAC能够节省编码码率,但其计算串行性强,不能较好适应片上多核环境.针对这一问题提出了基于多线程的CABAC并行编码方法.大量实验统计表明,该方法负载划分较为均衡,对序列熵编码的单独加速比最高可达1.78.     

GPS欺骗干扰原理研究与建模仿真

针对GPS欺骗干扰,分析了自主式与转发式干扰相关技术特点,重点研究了GPS转发式欺骗干扰的原理及实现方法,建立了GPS欺骗干扰对抗系统的主要数学模型,利用SYSTEMVIEW平台设计开发了GPS欺骗干扰仿真系统,通过仿真,验证了转发式欺骗干扰原理,给出了在一定干扰功率条件下转发误码率与干性比的关系,得到了各个转发信号的延迟量.所阐述的原理及仿真技术对于GPS欺骗干扰的分析与实现具有重要的参考作用.     

基于卡尔曼滤波器的GPS动态滤波方法

提出了一种解决随机误差影响GPS动态定位精度问题的方法.首先将GPS定位中的各种误差源在各方向造成的总误差等效为一个当前均值与一个符合一阶马尔可夫过程的有色噪声之和;其次对于GPS机动载体的加速度采用当前统计模型,然后通过扩展状态变量的思想和采用自适应算法建立相应的卡尔曼滤波器模型.该模型直接从GPS接收机输出的定位结果入手,实时性好,滤波后定位精度得到提高.     

小波神经网络在装备研制费预测与控制中的应用

通过小波及小波变换的原理和方法,建立了适用于武器装备研制费用的小波神经网络预测与控制模型.结合某型装备研制费用,进行了预测与控制的数据仿真.     

镍对重力分离SHS陶瓷内衬复合管的影响

采用SHS重力分离技术制备陶瓷内衬复合管,通过改变主燃烧配系组元Ni的含量,研究分析了金属Ni对陶瓷内衬复合管制备的燃烧特性及机械性能的影响。研究发现,适量的Ni粉能促进SHS燃烧进行,提高燃烧体系的绝热燃烧温度和陶瓷层的致密度,并且有助于形成金属/陶瓷界面过渡层,这极大提高了复合管的显微硬度和抗压剪强度。当Ni粉含量为19wt％时,陶瓷层的显微硬度和抗压剪强度分别最高达1764N/mm2和36.1MPa。     

基于无线双工通信系统分组数据传输的探讨

分析了军用无线双工通信系统数据传输资源,指出了存在的问题及改进办法;利用话音、报文、传真、数据电路交换信令的工作模式标示,提出了基于无线双工通信系统的数据传输TCP/IP结构体系及协议栈,并探讨了网络适配和实现与军用公共数据网、地域通信网（电路交换网、分组交换网）、数字化部队单工无线电数据网互联的关键技术。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

脉冲等离子体推力器羽流的粒子模拟

目前微小卫星正在积极地发展中,脉冲等离子体推力器是其推进系统的一个重要发展方向,为了能够将PPT成功地运用于空间,需对其羽流进行研究.将DSMC(Direct Simulation Monte-Carlo)/PIC(Particle in Cell)流体混合算法与一维MHD放电模型相结合,一体化模拟NASA Glenn PPT羽流,对不同出口偏转角的羽流场进行模拟,并与实验结果进行了比较.计算结果显示引入出口速度的偏转角提高了模型的羽流扩散能力,羽流的扩散角是影响羽流的一个主要因素.     

Value management of diagnostic equipment with cancelation,no‐show,and emergency patients

Magnetic resonance imaging and other multifunctional diagnostic facilities, which are considered as scarce resources of hospitals, typically provide services to patients with different medical needs. This article examines the admission policies during the appointment management of such facilities. We consider two categories of patients: regular patients who are scheduled in advance through an appointment system and emergency patients with randomly generated demands during the workday that must be served as soon as possible. According to the actual medical needs of patients, regular patients are segmented into multiple classes with different cancelation rates, no‐show probabilities, unit value contributions, and average service times. Management makes admission decisions on whether or not to accept a service request from a regular patient during the booking horizon to improve the overall value that could be generated during the workday. The decisions should be made by considering the cancelation and no‐show behavior of booked patients as well as the emergency patients that would have to be served because any overtime service would lead to higher costs. We studied the optimal admission decision using a continuous‐time discrete‐state dynamic programming model. Identifying an optimal policy for this discrete model is analytically intractable and numerically inefficient because the state is multidimensional and infinite. We propose to study a deterministic counterpart of the problem (i.e., the fluid control problem) and to develop a time‐based fluid policy that is shown to be asymptotically optimal for large‐scale problems. Furthermore, we propose to adopt a mixed fluid policy that is developed based on the information obtained from the fluid control problem. Numerical experiments demonstrate that this improved policy works effectively for small‐scale problems. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 287–304, 2016