数据分发系统的研究与设计

介绍了数据分发服务的研究和应用现状,分析了数据分发系统的体系结构和特点。详细地介绍了一个数据分发中间件的设计与实现,给出了基于该分发中间件开发应用的基本步骤,并提供一个应用示例。应用示例以及中间件的应用实践都表明：该中间件能为多进程提供消息的发布、订购以及按需分发等功能,基于该分发服务中间件可以方便地开发分布式应用系统。     

装备需求论证工具化研究

以体系工程思想和DoDAF2．0为指导,在系统分析国内外装备需求论证工具软件研制现状和存在的问题基础上,提出了装备需求论证工具化概念及其软件功能需求,优化设计了工具软件体系结构框架,并着重探讨了软件集成和数据模型等关键支撑技术,为装备需求论证工具化实践奠定了理论基础。     

基于变结构神经网络的L1自适应控制

针对传统模型参考自适应控制存在的鲁棒性问题和神经网络结构庞大因而计算量膨胀的问题,提出了一种变结构神经网络L1自适应控制方法,其中变结构神经网络用于在线辨识系统存在的未知非线性函数,该网络通过对节点进行唤醒与催眠以动态调节结构,以最少的节点数进行有效的逼近,降低计算复杂度;L1自适应控制用于网络权值学习与系统非线性补偿,反馈回路中设有一个低通滤波器,只要满足L1增益条件,就能确保系统的输入输出信号的瞬态响应和稳态跟踪性能与一个期望的线性时不变系统的响应保持一致。通过对四旋翼飞行器进行仿真,验证了该方法的有效性。     

基于数据仓库的装备维修经费综合预算管理信息系统设计

针对我军装备维修经费综合预算管理的内容和特点,提出了以综合预算数据库为基础、以预算分析数据仓库为中心、以操作数据存储为支撑、以联机分析处理和数据挖掘为手段的装备维修经费综合预算管理信息系统的结构模型,阐述了综合预算数据库和预算分析数据仓库设计、预算数据分析与数据挖掘模型构建的基本内容,为装备维修经费综合预算管理信息系统开发提供了新的体系框架。     

基于工业以太网的油库控制网络设计

控制网络是数字化油库的重要组成部分。为了解决油库控制网络缺乏统一的、成体系的建设模式和技术标准问题,提出将数字化油库的设计观念转为"先控制网络、后现场设备",进行了油库控制网络的总体设计;提出了油库控制网络的基本结构,将其分成主干控制网和区域控制网两部分,并分析了网络选型、防爆和带宽的有关问题;根据油库地域特点,建议主干控制网采用环型工业以太网拓扑结构,区域控制网采用环型或星型工业以太网。该解决方案已在数字化油库实验室中运行,传输性能良好。     

基于ROR框架的军事信息系统安全管理技术

为支持军事信息系统中网络安全管理层次化、模块化、可扩展性强的特点,本文首先分析了军事信息系统中网络安全管理的业务流程,提出了基于ROR框架开发网络安全管理软件的构想,并对ROR、REST的工作原理做了简单介绍,讨论了构建基于ROR框架的网络安全管理的实现方法和技术。通过实现基于ROR开发的网络安全管理系统,验证了该方法的可行性,并对该系统做了简单介绍。     

舰载作战系统网络冗余切换时间高精度测量研究及实现

舰载作战系统网络采用高抗毁性的双冗余网络,网络冗余切换时间直接关系到舰艇的作战能力,是衡量舰载作战系统网络的核心指标。为了更准确地测量冗余切换时间,提高测量精度,本文针对典型的舰载双冗余网络结构,利用WindowsXP操作系统,提出一种基于RTX构建的高精度的舰载作战系统网络冗余切换时间测量系统实现,与专业测量仪器的测量结果相比,该测量系统同样能精确测量网络冗余切换时间,并具备部署方便、应用灵活的特点,对于检测、评估舰载网络性能具有重要意义。     

Group testing procedures with quantitative features and incomplete identification

We present a group testing model for items characterized by marker random variables. An item is defined to be good (defective) if its marker is below (above) a given threshold. The items can be tested in groups; the goal is to obtain a prespecified number of good items by testing them in optimally sized groups. Besides this group size, the controller has to select a threshold value for the group marker sums, and the target number of groups which by the tests are classified to consist only of good items. These decision variables have to be chosen so as to minimize a cost function, which is a linear combination of the expected number of group tests and an expected penalty for missing the desired number of good items, subject to constraints on the probabilities of misclassifications. We treat two models of this kind: the first one is based on an infinite population size, whereas the second one deals with the case of a finite number of available items. All performance measures are derived in closed form; approximations are also given. Furthermore, we prove monotonicity properties of the components of the objective function and of the constraints. In several examples, we study (i) the dependence of the cost function on the decision variables and (ii) the dependence of the optimal values of the decision variables (group size, group marker threshold, and stopping rule for groups classified as clean) and of the target functionals (optimal expected number of tests, optimal expected penalty, and minimal expected cost) on the system parameters.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Evaluating cost and reliability integrated performance of stochastic logistics systems

The significance of integrating reliability into logistics performance has been established [The Logistics Performance Index and Its Indicators, World Bank International Trade and Transport Departments, (2010)]. Hence, as a response to the work by the World Bank, the present article aims to evaluate the performance index R_b,d of logistics systems as the probability that a specified demand d can be distributed successfully through multistate arc capacities from the source to the destination under the constraint that the total distribution cost should not exceed the cost limitation b. This article provides a pioneering approach for a straightforward computation of the performance index R_b,d. The proposed algorithm is a hybrid between the polynomial time capacity‐scaling algorithm, which was presented by Edmonds and Karp [JACM 19 (1972)], and the decomposition algorithm, which was presented by Jane and Laih [IEEE (2008)]. Currently, the proposed approach is the only algorithm that can directly compute R_b,d. An illustration of the proposed algorithm is presented. The results of the computational experiments indicate that the presented algorithm outperforms existing algorithms. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

基于运动学模型的灵巧成像卫星观测摆角算法

针对灵巧成像卫星对地面目标观测摆角的计算问题,考虑地球自转和卫星在轨运动等约束,利用空间坐标变换建立了基于椭球体的空间运动学模型.在此模型的基础上,给出了任意时刻卫星对目标观测摆角的计算方法.仿真结果验证了方法的正确性.任意时刻观测摆角的获取为灵巧成像卫星任务调度提供支持.