二维Root-MUSIC

将一维Ｒｏｏｔ－ＭＵＳＩＣ推广到二维，从而得到了一种新的二维方向估计方法，它具有计算量小的优点。     

武警院校干部体能评价研究

通过对4所武警院校共计800名教员和机关干部体能状况进行调查，研究了不同体型干部的体能现状，进行了相应的体能评定，并制订了体能综合评价模型。本研究建议：加强武警院校干部的耐力素质训练，以提高干部体能水平，增强体能，改进生活方式，提高武警院校干部的教研能力。     

TEDS技术在加速度传感器数据校正中的应用

提出一种利用传感器电子数据表格技术改善加速度传感器动态性能的办法。传感器标定时，其相关的特征参数被储存在传感器电子数据表格中；测试初始化时，每个传感器的特征参数被读入测试系统，指导系统自动完成其数学模型的建立，并在测试时进行实时数据校正。实验证明传感器电子数据表格技术的引入提高了加速度传感器的工作频带带宽和动态响应速度等动态性能指标。     

移动式铁路油罐车清洗装置水循环使用与节能分析

装备节能研究对建设绿色节能型社会具有重要意义。对移动式铁路油罐车清洗装置中清洗管路和吸污管路的热损进行分析计算,提出了水掺混循环使用的节能清洗方案,对清洗工艺中的传热过程、水循环使用中水掺混比例进行了详尽的分析计算,并对节能效果进行了分析。结果表明,清洗管路系统热损较低,水掺混循环使用的节能效果明显。     

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     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

适合于电路集成的PBG结构微带线

研究了光子带隙结构支撑的微带线。采用在接地板上光刻出光子带隙结构形成新型的微带线 ,利用FDTD数值仿真和实验的方法进行了研究。分析了方孔的情况 ,并对三级级联光子带隙结构构成滤波器的情况进行了研究。给出了频率传输特性曲线 ,验证了此种结构频率禁带的存在。     

小子样下命中概率的估计

研究了当试验次数较少时 ,命中圆域的概率估计。给出了自助估计法和融合估计方法 ,对于估计的精度进行了分析。方法易于实现 ,适用于工程应用     

一种多方位一距离目标定位的最小二乘伴随估计器

对纯方位最小二乘估计器,在已知某时刻一个观测距离的情况下,导出了一种伴随型的目标速度估计器．该算法嵌入原最小二乘估计器之中,计算简单且便于工程应用．     

具有规范化的四元数递推计算的公式误差估计

对捷联式制导系统中目前常用的四元数递推公式进行误差估计,给出利用观测数据计算四元数的误差界的公式,还介绍了保持四元数范数不变的一类递推公式。