基于DMD的通用安全信息系统开发研究

提出了一种基于DMD的信息系统开发模型,描述了基于该模型的信息系统设计原则、开发流程和体系结构,并通过实例说明了DMD的功能和应用,最后介绍了系统的安全策略和特点。应用该模型开发的系统后期维护灵活方便,可扩展性强,具有较强的实用性。     

关联规则在消防接处警数据分析中的应用

阐述了关联规则及Apriori算法的基本概念、基本方法;运用关联规则Apriori算法,对某市2002年至2006年的消防接处警数据进行了初步关联规则挖掘,并给出了挖掘结果的简要说明,为数据挖掘在消防接处警数据分析方面作出了初步的探索。     

基于数据包络分析的公安消防部门绩效评价

利用数据包络理论,建立了以消防经费、出动人员、出动车辆为输入指标,扑救起数、抢救财产、抢救人员为输出指标的公安消防部门绩效评价指标体系。研究表明,数据包络分析方法运用于公安消防部门绩效评价中是切实可行的,丰富了绩效评价方法中采用定量方法分析的种类,将绩效评价上升到了可获得反馈信息的层面,具有推广应用的价值。     

高校信息化建设中教务与教学管理数据的质量问题与对策

随着高校信息化建设的逐步深入,在教务与教学管理中存在大量的信息流与数据流,因数据错误或人为因素造成的数据质量问题对教务与教学管理的负面影响日益凸显,直接关系到高校教学质量的提高。如何提高当前高校信息化建设中教务与教学管理数据质量成为亟待重视与解决的问题。本文从教务与教学的信息化管理实践入手,分析探讨在教务与教学管理中存在的数据质量问题和对策,以提升教务与教学管理水平,促进教学质量提高。     

利用声光衍射测定甘草稀溶液中超声波的波长与浓度的关系

利用声光衍射测量甘草稀溶液中超声波的波速与浓度的关系,通过对实验原理和数据的分析,挖掘出了较多的数据关联,对干草稀溶液物理特性的声光衍射实验测量,是本文的一个新的尝试。     

无源跟踪中的一种新数据关联算法

在无源多目标跟踪过程中,数据关联是核心。提出了无源跟踪中的一种新数据关联算法,先对支持向量聚类理论进行了讨论,用该理论对采样到的观测点进行分类,后定义了多特征的关联度计算问题,并用综合数据关联的方法对目标进行状态估计。计算机仿真结果表明:该算法对目标的正确关联度要优于传统的数据关联算法。     

装备维修管理系统的设计与实现

装备维修管理系统是一种新型维修管理模式,为解决现代装备协同维修过程中资源优化调度和分配的各类问题,从装备维修保障系统的需求分析入手,讨论了基于改进遗传算法的维修资源配置算法,并采用建模与仿真技术,设计实现了装备维修管理系统。     

坦克火控系统射击诸元解算仿真模型

火控系统射击模型仿真是坦克分布式交互仿真的重要内容,直接影响着仿真结果的可信度。通过分析实车火控系统数学模型,在简化了外弹道模型的基础上,结合仿真实现,建立了射击诸元解算的仿真模型。     

Scheduling multiple products on parallel machines with setup costs

We consider a class of production scheduling models with m identical machines in parallel and k different product types. It takes a time p_i to produce one unit of product type i on any one of the machines. There is a demand stream for product type i consisting of n_i units with each unit having a given due date. Before a machine starts with the production of a batch of products of type i a setup cost c is incurred. We consider several different objective functions. Each one of the objective functions has three components, namely a total setup cost, a total earliness cost, and a total tardiness cost. In our class of problems we find a relatively large number of problems that can be solved either in polynomial time or in pseudo‐polynomial time. The polynomiality or pseudo‐polynomiality is achieved under certain special conditions that may be of practical interest; for example, a regularity pattern in the string of due dates combined with earliness and tardiness costs that are similar for different types of products. The class of models we consider includes as special cases discrete counterparts of a number of inventory models that have been considered in the literature before, e.g., Wagner and Whitin (Manage Sci 5 (1958), 89–96) and Zangwill (Oper Res 14 (1966), 486–507; Manage Sci 15 (1969), 506–527). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008