CRF与规则相结合的军事命名实体识别研究

作战命令的分词是作战指令自动化生成、文图转换等各种指挥自动化技术的重要基础。在作战指令进行分词处理的过程中,军事命名实体的识别是技术难点之一。命名实体是信息的主要载体,它的识别是军事信息抽取的关键。提出了一种基于CRF模型与规则相结合的命名实体识别方法,结合基本特征与外部词典特征,提高了实体识别效率;在后期进行规则优化,最终实现高效的命名实体识别。实验证明,该方法是行之有效的。能够成功解决命名实体的自动识别问题。     

Variable sampling plans for normal distribution indexed by Taguchi's loss function

Taguchi has presented an approach to quality improvement in which reduction of deviation from the target value is the guiding principle. In this approach any measured value x of a product characteristic X brings a loss to consumer in general, where the loss is expressed as a quadratic form with respect to the difference between the measured value x and the target value T of a product characteristic. Then, it is natural to reject the lot which may bring a large loss to consumer. This concept induces us to construct new variable sampling plans based on the Taguchi's loss criterion. In this article, a design procedure of the sampling plans for assuring the loss in the Taguchi's method is proposed. Some numerical results based on the proposed design procedures are illustrated. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 591–603 (1997)     

激光陀螺数字抖动控制方法与特性

针对传统的模拟抖动控制系统体积大、灵活性差的缺点,设计了一种基于单片机的新的激光陀螺数字抖动控制方法,建立了陀螺抖动的数学模型,比较研究了传统的模拟正弦波驱动和新的数字方波驱动的抖动特性,指出了后者不同于前者的抖幅变化律及非线性的随机噪声注入方式。仿真和实验证明,该方法能很好满足激光陀螺抖动控制要求,保证陀螺性能。     

部队作战效能综合评估法

高技术条件下局部战争的显著特点是参战单位多、对抗关系复杂、战争不确定因素增加,如何在此情况下客观评估部队的作战效能是作战研究领域一个重点和难点。通过综合运用定性分析法、网络分析法、战斗效能指数法、作战模拟及系统动力学等多种方法和理论,建立了一种可对部队作战效能进行评估的综合评估法。并以高技术条件下岛上进攻作战中装甲团的作战效能评估为例,详细介绍了该方法的实施过程,认为该综合评估法是行之有效的。     

两个有关矩阵问题的回答

讨论了两个与矩阵有关的问题。对问题 1 ,给出了其阶数从 1到 5时的回答 ;对问题 2 ,给出了其彻底的否定回答。所获的结果许多情形下还可推到更广泛的情形。     

一种基于模糊可靠度确定雷达故障检测间隔期的方法

将雷达装备参数漂移的动态范围模糊化 ,并基于数理统计中参数估计的理论 ,建立了雷达装备的参数模糊可靠度预计模型。把该模型应用于确定雷达电参数的故障检测周期 ,并通过实例论证此方法的优越性和实用性。     

B介子的稀有非轻子衰变和CP破坏

在BS理论框架下,求解了ρ和K*的波函数,计算了B→ρ和B→K*跃迁的形状因子,进而计算出B介子衰变到2个轻介子稀有过程的分支比和CP破坏量.     

信任函数理论在仿真评估中的应用

将信任函数理论应用到了仿真结果评估问题中,给出了总体仿真结果的信任函数和信念区间的计算方法。对仿真结果的真实性评估具有一定意义。这种思想和算法可推广应用到其它各种不确定性推理决策问题中去。     

Workload distribution of discrete‐time parallel queues with two servers

We study discrete‐time, parallel queues with two identical servers. Customers arrive randomly at the system and join the queue with the shortest workload that is defined as the total service time required for the server to complete all the customers in the queue. The arrivals are assumed to follow a geometric distribution and the service times are assumed to have a general distribution. It is a no‐jockeying queue. The two‐dimensional state space is truncated into a banded array. The resulting modified queue is studied using the method of probability generating function (pgf) The workload distribution in steady state is obtained in form of pgf. A special case where the service time is a deterministic constant is further investigated. Numerical examples are illustrated. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 440–454, 2000     

干扰及机动条件下的比例导引智能调控策略

由于红外诱饵干扰样式复杂、目标机动形式多变导致传统比例导引律极易被干扰。为提高采用比例导引方法的导弹性能,提出一种利用径向基函数网络调控比例系数及导弹发射时机的智能导引律。以飞行时间及脱靶量为参考,通过构建加权型指标函数将求解最优比例系数及发射时机问题转化为单目标优化问题;引入量子粒子群算法求解最优决策参量,并以其作为网络输出,干扰样式作为网络输入,离线训练径向基函数网络;为提高训练效率,结合K-means及K最近邻算法初始化径向基函数网络。仿真结果表明,当存在红外诱饵干扰时,智能导引律性能优于扩展比例导引律及自适应滑模导引律。