Threshold optimization for weighted voting classifiers

Weighted voting classifiers considered in this paper consist of N units each providing individual classification decisions. The entire system output is based on tallying the weighted votes for each decision and choosing the one which has total support weight exceeding a certain threshold. Each individual unit may abstain from voting. The entire system may also abstain from voting if no decision support weight exceeds the threshold. Existing methods of evaluating the reliability of weighted voting systems can be applied to limited special cases of these systems and impose some restrictions on their parameters. In this paper a universal generating function method is suggested which allows the reliability of weighted voting classifiers to be exactly evaluated without imposing constraints on unit weights. Based on this method, the classifier reliability is determined as a function of a threshold factor, and a procedure is suggested for finding the threshold which minimizes the cost of damage caused by classifier failures (misclassification and abstention may have different price.) Dynamic and static threshold voting rules are considered and compared. A method of analyzing the influence of units' availability on the entire classifier reliability is suggested, and illustrative examples are presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 322–344, 2003.     

Scheduling jobs with piecewise linear decreasing processing times

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003     

舰炮火控系统反应时间与精度关系的仿真

对舰炮火控系统中反应时间和系统精度之间的关系做了简要的介绍,并论述了舰炮火控系统中时间和精度之间复杂的关系,通过分析采样点数和误差之间的关系,结合采样点数和系统反应时间之间的联系以及误差与系统精度之间的联系,引出反应时间与精度之间的某种关系,最后对从接收目标指示到给出射击诸元这个过程的各个时间段与其相对应的精度之间的关系进行计算机仿真。     

数字化部队指挥网络系统效能评价模型

以结构熵理论为基础,分析数字化部队作战指挥信息网络系统组织结构对系统内信息流的影响,从信息的角度对系统组织结构的有序度进行评价,引入信息流的时效和质量的概念,建立定量评价系统结构有序度计算的时效质量模型,结合系统数据传输业务效能的评价方法,形成作战指挥信息网络系统整体综合效能的评价模型。最后辅以实例。     

基于分布式信息融合的多舰纯方位跟踪

提出一种基于信息融合的分布式多舰纯方位跟踪算法 ,该算法采用时变采样间隔的修正增益推广卡尔曼滤波器 ,用多条舰艇的舰载电子侦察设备对海上多个运动辐射源目标进行分布式纯方位跟踪融合。计算机模拟结果表明 ,该算法能满足工程应用的要求     

导弹制导控制与目标杀伤

采用协方差分析描述函数技术 (CADFT)对寻的导弹的制导精度进行了研究 ,提出了空气动力控制、直接侧向力控制的寻的导弹飞行末端的制导精度的一种新的解析模型 ,并研究了导弹直接碰撞杀伤目标的必要条件 ,该理论研究成果具有简单、实用、精度高的特点 ,为寻的导弹制导控制特性研究和揭示寻的理论普遍规律提供了一种新途径     

燃气轮机的实时仿真及数据预处理

讨论了燃气轮机实时仿真及相应的数据预处理方法 ,利用容积惯性法建立了某型燃气轮机的实时仿真模型 ,在 5 86PC实现了超实时仿真 ,仿真结果和试验数据相符     

《老子》单音动词分析

<老子>五千言,使用动词较多,其中单音动词占大多数,复音动词较少.单音动词大多数使用本义,其中单义词多,多义词少.词义发展途径主要是引申.单音动词主要作谓语,此外还可以作主语、定语、状语等.     

药库管理系数据库的设计与实现

从信息管理系统的模式出发,分析了系统的结构模式,并对由此产生的并发控制问题,应用时间戳法进行了分析处理,用触发器存储过程解决了对数据的随时更新问题。本系统以Sybase作为数据库,设计并实现了药库管理系统。     

利用简并V型原子与光场的非共振作用隐形传送未知原子态

根据简并V型三能级原子与光场的远离共振相互作用系统的改进型有效哈密顿量 ,通过矩阵方法 ,推导出系统随时间演化的波函数 ,提出一种未知原子态的隐形传态方案。