“装甲车辆驾驶“课程教学改革与实践

根据新型军事工程复合型人才的培养目标和新教学大纲的特点,阐述了“装甲车辆驾驶”课程教学改革的必要性,研究制定了该课程的试行教学大纲的实施方案,与以往“装甲车辆驾驶”课程的实施方案、考核方式等进行了对比分析,结合教学改革工作的实践,系统总结了所取得的成果。实践证明,这项教学改革是必须的、科学的、合理的、可行的,教学改革具有极大的推广和应用前景。     

双正交重叠变换系数基于上下文的算术编码算法

提出了一种双正交重叠变换(LBT)系数基于上下文的算术编码算法.针对二进整数LBT在DSP实现过程中出现的精度和计算复杂度问题,提出了一种适于DSP并行处理的LBT定点实现方法.编码算法包含60种上下文概率模型,熵编码采用MQ编码,并根据并行处理的需要,将MQ编码从位平面扫描过程中分离,根据分离后的结构特点,设计了改进的MQ编码器.并对算法的DSP实现进行了研究.实验结果表明,本压缩算法压缩性能和SPIHT相当,稍逊于JPEG2000,算法容易并行,硬件计算复杂度很低.     

基于散射机理分类与方位对称性判决的极化SAR人造目标提取

由于极化SAR人造目标电磁散射的复杂性,已有极化SAR人造目标提取方法难以完整地提取出感兴趣区域内不同类型的目标.针对这一不足,提出一种基于散射机理分类与方位对称性判决的提取新方法,充分利用目标与杂波在散射机理类型及方位对称性上的差异进行提取.与已有方法相比,该方法对极化SAR图像中不同极化特征的人造目标都有较好的提取性能,提取结果更为完整和准确.利用全极化SAR实测数据验证了本方法的有效性和优良性能.     

建立维和警察心理调控机制之我见

联合国维和警察是一个特殊的职业群体,所处的工作和生活环境艰苦、恶劣、危险。维和警察面对这种超出常规的精神压力,出现各种各样的心理问题是必然的。维和警察的心理问题仅仅依靠维和警察个人自我调节是远远不够的,必须建立一套有效的调控机制来预防和治疗其心理问题,维护好他们的心理健康。     

迫击炮防重装装置研究

追击炮射击时可能会发生弹药重复装填,常常导致膛炸等严重事故,迫击炮防重装装置可有效防止该类事故发生。分析对比了光电式、电磁式、机械式3种技术方案的工作原理、技术特点,设计了一种安全可靠、能够适应各种复杂恶劣环境的机械式迫击炮防重装装置,详细介绍了其结构设计、工作原理和技术性能。     

On allocating one active redundancy to coherent systems with dependent and heterogeneous components' lifetimes

This article studies coherent systems of heterogenous and statistically dependent components' lifetimes. We present a sufficient and necessary condition for a stochastically longer system lifetime resulted by allocating a single active redundancy. For exchangeable components' lifetimes, allocating the redundancy to the component with more minimal path sets is proved to produce a more reliable system, and for systems with stochastic arrangement increasing components' lifetimes and symmetric structure with respect to two components, allocating the redundancy to the weaker one brings forth a larger reliability. Several numerical examples are presented to illustrate the theoretical results as well. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 335–345, 2016     

栅格地理数据并行格式转换引擎

如今大规模地理数据正在社会各个部门和组织中迅速积累,但是由于部门利益和历史沿袭等原因,大规模地理数据共享仍然极具挑战,相应共享技术需求仍然极其旺盛。作为地理数据共享的基础方式之一,传统单机地理数据格式转换技术,一方面受限于磁盘读写及带宽瓶颈,另一方面面对日趋庞大的数据规模,已很难满足实际应用需求。因此提出一种针对栅格地理数据的并行格式转换引擎,采用高性能计算集群环境支持大规模栅格地理数据转换共享,大幅降低了大规模栅格地理数据转换过程的时间成本。栅格地理数据并行格式转换引擎采用基于公共接口的设计理念,框架灵活、具有良好的扩展性,支持地理数据格式的读写自定义以及新数据格式添加,能够实现接入数据格式间的任意两两转换。为验证引擎框架及其处理效率,在Lustre并行集群环境下以格网数据交换格式(国家地理空间数据交换格式)向常见栅格地理格式的转换为示例进行了测试实验。结果表明,栅格地理数据并行格式转换引擎能够在8个节点Lustre集群中达到7.54的良好并行加速比。     

Analysis of a production system in a general configuration

We consider a production system comprising multiple stations (or workshops) such as an entry station, a set of work stations, a central station, and an exit station, which are arranged in a general configuration. A worker (or a vehicle tool) is assigned to each station, who sends a part from the station to the destination station according to the required process path of the part. Any part is allowed to visit a work station more than once if its process path requires. We propose a new control strategy with the push policy for instructing each worker to send a part and the kanban mechanism for controlling the work‐in‐process (WIP) in each work station. As all work stations have limited local buffers, the central station is used for storing blocked parts temporarily. Such a production system is modeled as an open queueing network in a general configuration with a Markovian part sending policy and a machine no blocking mechanism. The queueing network is analytically characterized. Some important performance measures are compared with other control strategies. A semi‐open decomposition approach is applied to the queueing network for computing the blocking probabilities when parts arrive at the work stations. An algorithm is developed based on the semi‐open decomposition approach. Numerical experiments show the quality of the solutions obtained by the algorithm as well as a property of a performance measure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 128–143, 2001     

Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues

T identical exponential lifetime components out of which G are initially functioning (and B are not) are to be allocated to N subsystems, which are connected either in parallel or in series. Subsystem i, i = 1,…, N, functions when at least K_i of its components function and the whole system is maintained by a single repairman. Component repair times are identical independent exponentials and repaired components are as good as new. The problem of the determination of the assembly plan that will maximize the system reliability at any (arbitrary) time instant t is solved when the component failure rate is sufficiently small. For the parallel configuration, the optimal assembly plan allocates as many components as possible to the subsystem with the smallest K_i and allocates functioning components to subsystems in increasing order of the K_i's. For the series configuration, the optimal assembly plan allocates both the surplus and the functioning components equally to all subsystems whenever possible, and when not possible it favors subsystems in decreasing order of the K_i's. The solution is interpreted in the context of the optimal allocation of processors and an initial number of jobs in a problem of routing time consuming jobs to parallel multiprocessor queues. © John Wiley & Sons, Inc. Naval Research Logistics 48: 732–746, 2001     

基于SHARC流水集束型多处理器板研制

结合某重点工程课题 ,设计和实现了基于 SHARC流水集束型多处理器板即研制出了具有 5个 SHARC的高速并行数字信号处理机。板上处理器数量可实现重配置以获得高的性价比。当板上前端 4个 SHARC用于 FFT时 ,研究和分析了板上前端 4个 SHARC用于 FFT时的三种不同缓冲数据模式下 FFT节点处理性能