印刷对数周期天线的FDTD分析与实验

采用非均匀网格时域有限差分(NU FDTD)方法,对单层印刷对数周期阵子天线(PLPDA)进行了电磁仿真,分析了单面和双面介质盖板对PLPDA性能的影响,得到了PLPDA的驻波和方向图特性,并进行了实验验证,分析结果与实验结果吻合得较好。     

基于交叉熵和新转移函数的模糊神经网络分类器

针对目前普遍采用的误差平方和准则及Sigmoid转移函数在BP算法应用中存在的缺陷和不足,提出了基于交叉熵准则和新的S型转移函数构建的模糊神经网络分类器,并将这种分类器应用于心肌梗死的定位诊断,结果表明其训练效率和识别性能都明显优于传统的模糊神经网络。     

我党关于武警部队建设指导理论的创新发展

中国人民武装警察部队是党和国家武装力量的重要组成部分.我党十分重视武警部队的建设和发展.在不同历史时期,党的领导人根据形势和任务变化需要,先后提出了一系列重要指导思想,指导武警部队不断发展壮大;武警部队有效履行了党和国家赋予的历史使命,出色完成了各项光荣而艰巨的任务.     

车用再制造发动机验收检验台架磨合规范试验研究

对未经磨合的再制造发动机新品进行动力性能试验,试验结果与原机标准相差较大,经分析后认为未进行充分磨合是性能不达标的主要原因。针对再制造发动机的出厂验收技术特点,制定了小负荷循环磨合规范,并对起初推断进行了试验验证。根据磨合过程中发动机动力性能的变化规律,通过试验对磨合规范进行了优化,总结出了快速有效的台架磨合规范。试验结果表明：快速磨合规范不仅能够提高磨合效率,而且保证了磨合效果。     

战场多级核生化态势生成方法研究

详细介绍和描述了核生化态势的分类问题,提出了战场多级核生化态势的概念,分别对作业级、作战指挥级、作战筹划级核生化态势的要素及生成方式进行了研究,并进行了对比分析.多级核生化态势可以为不同层级的用户提供专业、有效的态势信息,满足核生化作战的技术需求.     

Influences of different crossing types on dynamic response of underground cavern subjected to ground shock

An intersecting cavern is a common structural form used in underground engineering, and its safety and stability performance directly control the service performance of the whole project. The dynamic re-sponses of the three kinds of crossing type (+-shaped, T-shaped, L-shaped) caverns subjected to ground shock were studied by numerical simulation. The velocity plus force mode boundary setting method was proposed in the coupled static and dynamic analysis of a deep underground cavern. The results show that, among the three types of crossing caverns, the+-shaped cavern is the most significantly affected by the dynamic action, followed by T-shaped, and then L-shaped caverns. The vault settlement, straight wall deformation, vault peak particle velocity, effective plastic strain of surrounding rock, and maximum principal stress and strain at the bottom of the lining of the straight wall increase with the increase of cavern span. The vault settlement, straight wall deformation, effective plastic strain of surrounding rock, and the maximum principal stress and strain at the bottom of lining to the straight wall decrease with the increase of lateral pressure coefficient, and the peak particle velocity at the vault increases. The variation is small compared with the change of cavern span. The influence range of the underground cavern intersection is two cavern diameters from the intersection centre. The bottom of the straight wall at the intersection is the weak part. It is suggested to thicken the support locally to improve the stability of the cavern.     

基于FCM与粗糙集的连续数据知识挖掘方法

对连续数据知识挖掘可采用模糊C均值聚类将其离散化,再应用粗糙集进行约简.文中针对该过程中样本数据离散化后出现多个聚类中心隶属度值较接近的情况,提出了隶属度重叠度的方法来扩展对应离散类别的选取.离散类别确定后再应用粗糙集理论对其进行知识挖掘,可得到连续数据的本质特性.此方法应用于汽轮机轴系振动数据的知识挖掘.与采用最大隶属度确定对应类别的方法相比,该方法不影响对连续数据的知识挖掘,并能真实反映连续数据的特性.     

有色噪声下FIR模型相关辨识精度分析

本文针对离散控制系统的有限脉冲响应（ＦＩＲ）函数模型,研究了在伪随机ｍ序列输入的激励和有色噪声干扰下辨识的精度问题,纠正了参考文献中的错误,得到了有色噪声干扰下ＦＩＲ参数估计精度的显式表达式。同时,给出了辨识精度的下界和上界,分析并得到了达到上下界的条件。文中有实例分析。     

CEC条件下的舰艇编队防空问题

未来战争是"海、陆、空、电、天"五位一体的高技术战争,机动战、火力战和信息战将贯穿于作战的全过程.面对这样一种局面,传统的水面舰艇编队防空作战样式必将发生重大变革以适应未来海战的需要.美国海军针对上述情况研究了协同作战能力(CEC),并将其推广应用于各种指挥系统.CEC已经成为一种提高指挥系统协同作战能力的重要技术,通过使每个独立平台成为战斗群的延伸来弥补单个平台的弱点.借鉴了网络中心战的思想并结合美军提出的CEC,分析了CEC条件下的我水面舰艇编队的防空问题.     

Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints

In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016