体系的任务满足度评估方法研究

关于体系的能力评估,现有方法大多是着眼于本征能力、体系融合度或能力需求满足度等方向,从能力的角度出发,提出系统或体系的能力指标体系,然后计算需求满足度。然而,由于体系使命任务的多样性和体系能力目标的抽象性,通过分析固有的静态能力难以回答体系是否能够完成使命任务的问题。文中从使命任务的角度出发,提出了一种以客观为主、主观为辅的任务满足度定量评估方法。以体系所承担的使命任务为背景,通过使命任务分解、能力需求分析、体系能力分析、基础满足度分析以及满足度聚合等步骤,最终得到体系的任务满足度水平,并通过一个陆上区域防空的案例对所提方法进行了验证。     

DoDAF模拟在通用作战任务分解与效能指标分析中的应用

阐述将通用作战任务基于一定规则分解,并在此基础上构建效能描述指标体系,是作战任务需求分析及描述标准化、规范化的基础和前提。提出了基于体系结构建模的通用作战任务分解方法和战役战术任务度量指标描述方法,为典型战役战术任务分解和效能分析提供了理论基础。     

向量相似度在指挥自动化系统效能评估中的应用

在给出向量相似度的定义的基础上,提出了一种评估指挥自动化系统效能的新方法--向量相似度法,从向量相似的角度评估系统的效能.详细地给出了其评估流程图和实现步骤,并引入了模板的概念,可有效地将人的因素和信息化条件下各种附加因素引入到系统的评估中,并确定其对系统效能的影响.该方法简单易行、可操作性强且充分利用了系统性能指标抽样数据,具有很高的精度.最后结合算例验证了此方法的有效性和实用性,为评估指挥自动化系统的效能提供了一种有效的方法,对其他系统的效能评估也有指导意义.     

D-S证据理论在作战效能评估中的应用

针对如何利用多数据源来评估武器装备作战效能的问题进行研究,分别对专家评估和仿真试验这两种信息源的m ass函数建立模型。在此基础上,利用D-S合成公式对不同指标进行综合,最终得到评估装备的作战效能。利用这种评估方法,分别对4种方案下的雷达系统进行评估,结果表明该方法符合评估实际,对多数据源的评估有一定的借鉴意义。     

ν-SVC分类算法在飞机作战效能评估中的应用

ν-SVC算法是一种新的支持向量机分类算法,该算法根据给定的参数ν自动调整ε,来控制支持向量数目和算法误差.本文应用ν-SVC算法建立了飞机作战效能分类评估模型,并对几种飞机的作战效能进行了分类评估.评估结果与实际相符,表明ν-SVC算法的飞机作战效能分类评估有较高的分类精度.     

v—SVC分类算法在飞机作战效能评估中的应用

v—SVC算法是一种新的支持向量机分类算法，该算法根据给定的参数v自动调整ε，来控制支持向量数目和算法误差。本文应用v—SVC算法建立了飞机作战效能分类评估模型，并对几种飞机的作战效能进行了分类评估。评估结果与实际相符，表明v—SVC算法的飞机作战效能分类评估有较高的分类精度。     

无人作战飞机任务系统技术研究

先进的任务系统是UCAV执行作战任务的核心。本文从功能层、物理层和技术实现层三个层面论述了UCAV任务系统方案：在功能层上,该方案采用操控／自主攻击方式,既可由地面控制站操作员操纵,执行作战任务,也可由UCAV任务系统对目标进行自动识别、威胁判断、攻击排序及火力分配,自主完成攻击及对威胁的规避任务;或者由操作员指定攻击目标后,任务系统自动规划飞行轨迹和飞行操作指令,由飞控系统控制UCAV自主飞行到最佳攻击区域完成对目标的攻击。在物理层上,任务系统由机载任务系统、地面控制站两大部分组成。在技术实现层上,涉及的关键技术主要有任务规划技术、传感器数据处理与信息融合技术、传感器管理技术、态势评估与战术决策技术、自主攻击技术等。     

云计算中任务分解算法的改进

云计算中任务分解是提高任务执行并行度的重要手段。针对云计算中任务分解算法在解决复杂任务分解问题时容易陷入分解粒度过大及局部最优的缺陷,提出了一种树形分解问题思想与启发式策略相结合的任务分解算法（Improve Heuristic Algorithm,IHA）。该算法首先对任务进行分解,然后将问题用形式化方法转化成可行操作集,最后使用推理机调度任务给解空间进行处理,此算法在Cloudsim中进行了仿真验证。     

基于反导作战环的装备作战网络能力评估

考虑到以往装备体系的研究方法忽略了装备之间的配合关系,基于网络科学思想,建立反导作战网络模型。阐明了反导作战能力生成机制,并基于此提出了反导装备体系作战网络能力评估方法,最后通过示例对所提出的建模和评估方法进行展示,证明了该方法的可行性和有效性。     

协同空战中基于任务分解的任务协调机制研究

协同空战任务决策的一个关键是编队内部的协调。基于复杂系统的一般求解方法,结合人工智能领域的MAS技术,提出了一种任务协调的分步实现方法。首先,就复杂的协同作战任务提出了一种分级分解思想,通过6级分解,将一项复杂作战任务分解为单个作战Agent的阶段性战术级任务,实现了协同作战任务的细化和量化,为各Agent协同完成复杂任务奠定了基础。在任务分解的基础上,建立了多Agent任务协调的数学模型,在合同网协议的基础上,提出了一种基于市场行为的编队内部的任务的动态协调机制。各作战Agent通过市场协议动态地选择适合自己的作战任务(包括协作性的和非协作性的),以编队总体效用最大化为目标,高效地实现了任务的动态、分布式的分配。仿真结果表明,提出的基于任务分解的协同任务协调机制效果较好,对作战任务决策起到了基础性的作用。     

S380在中原油田应用后的电路业务优化

对中原油田传输网络现状进行了详细调查,分析了传输网电路分配情况,以及目前传输网络存在的瓶颈问题。详细介绍了新增的中原油田宽带城域网ZXMP S380光端机的汇聚环优化调整情况,以及光端机新增后对传输业务割接的过程并详细说明了新增ZXMP S380光端机后,传输电路业务的调整情况。通过业务的割接调整,电路业务得到了优化,中原油田的传输网的承载能力得到了扩容,缓解了时分分配的紧张。     

The Design and Evaluation of Task Assignment Algorithms for GWAP-based Geospatial Tagging Systems

Geospatial tagging (geotagging) is an emerging and very promising application that can help users find a wide variety of location-specific information, and thereby facilitate the development of advanced location-based services. Conventional geotagging systems share some limitations, such as the use of a two-phase operating model and the tendency to tag popular objects with simple contexts. To address these problems, a number of geotagging systems based on the concept of ??Games with a Purpose?? (GWAP) have been developed recently. In this study, we use analysis to investigate these new systems. Based on our analysis results, we design three metrics to evaluate the system performance, and develop five task assignment algorithms for GWAP-based systems. Using a comprehensive set of simulations under both synthetic and realistic mobility scenarios, we find that the Least-Throughput-First Assignment algorithm (LTFA) is the most effective approach because it can achieve competitive system utility, while its computational complexity remains moderate. We also find that, to improve the system utility, it is better to assign as many tasks as possible in each round. However, because players may feel annoyed if too many tasks are assigned at the same time, it is recommended that multiple tasks be assigned one by one in each round in order to achieve higher system utility.     

An Analytical Evaluation Approach for Control Plane Operations of a Multi-RAT Mobility Procedures in a User Equipment

It is evident that the present and future deployment of multiple radio access technology (RAT), e.g., WLAN, LTE, WiMAX, etc., will advent multi-RAT user equipment (UE). There will be four major challenges due to multi-RATs existence, i.e., fast-reliable signaling, fast-reliable mobility with Quality of Service (QoS), security and reasonable cost. In this paper we deal with performance modeling signaling plane. Most of the reported works present signaling performance between two RATs e.g., EUTRAN to CDMA2000 etc., and vice versa (or single RAT scenarios e.g., UMTS to UMTS). To the best of our knowledge, there has been no analytical modeling approach available for performance analysis of entire control plane operations in a multi-RAT UE, right from cell search to completion of mobility procedures in case of more than two RATs, i.e., a generic model for N-number of RATs. This paper proposes a generic Discrete Time Markov Chain (DTMC) based analytical method for evaluation of control plane operations for multi-RAT mobility procedures. Using the case of UE initiated multi-RAT mobility procedures, for presenting our analytical model we propose an algorithm, integrating and extending some of the known approaches which were mostly limited to single RAT. For this algorithm a generic analytical relationship is derived between time taken by each signaling process in each layer involved in the multi-RAT mobility procedure and the probability of success of the same. Finally, using the above analytical model a case study is presented where the performance of UE initiated mobility procedure for WLAN interworking with LTE supported by Proxy Mobile IP (PMIP) and Media Independent Handover (MIH). With our analytical model, results show that, for a target LTE cell, the increase in probability of successful completion of mobility procedure is 11 % from existing procedures. For target WLAN cell, the same is around 9 %. Notably, the results show how our analytical approach helps in modeling most of the control plane operations in multi-RAT mobility procedures, in a holistic manner.     

Multilevel Surface Decomposition Algorithm for Rapid Evaluation of Transient Near-Field to Far-Field Transforms

A fast multilevel algorithm with reduced memory requirements for the evaluation of transient near-field to far-field transforms is presented. The computational scheme is based on a hierarchical decomposition of an arbitrary shaped enclosing surface over which the near-fields of an antenna or a scatterer are given. For surface subdomains at the highest decomposition level, the angular-temporal far-field patterns are calculated directly from the known near fields over a sparse angular grid of directions and a short temporal duration. The multilevel computation comprises angular and temporal interpolations thus increasing angular resolution and temporal duration of radiation patterns while aggregating the subdomain contributions between successive decomposition levels. These steps are repeated until obtaining the transient far-field response of the whole enclosing surface. The computational complexity of the proposed algorithm is substantially lower than that of the direct evaluation. Reduction in memory requirements is obtained by formulating the algorithm as a marching-on-in-time windowed scheme. This approach allows for embedding of the accelerated transforms within existing near-field modeling tools.      

一种局部放电信号去噪的新方法

小波变换是在局部放电信号去噪过程中常用的方法,由于实际信号中噪声频带较宽,仅用小波变换去噪有可能带来波形畸变。文中将经验模态分解（Empircial Mode Decomposition,EMD）引入小波阈值去噪算法中,提出了一种基于EMD的小波阈值去噪算法,信号经EMD变换后被分解成若干个频率的本征模态函数（Intrinsic Mode Function,IMF）,再对各个频率的IMF分量进行小波阈值去噪。相比于普通的小波阈值去噪算法,该方法能取得更好的去噪效果。对仿真信号和实测信号的处理结果验证了该方法的有效性。     

运行维护服务能力成熟度模型概述

介绍运行维护服务能力成熟度模型的研发背景及主要内容,该模型自低向高分别为基本级、拓展级、改进(协同)级和提升(量化)级,分析了运行维护能力成熟度模型的应用场景,可用于运维服务供方的自我评估、第三方评估机构的外部评估以及咨询机构的诊断评估.     

Reconstruction and Decomposition Algorithms for Biorthogonal Multiwavelets

We construct biorthogonal multiwavelets (abbreviated to wavelets) in a weighted Hilbert space L ²(E,) where E is a compact subset in . A recursive formula for biorthogonal wavelet construction is presented. The construction of the initial wavelets is reformulated as the solution of a certain matrix completion problem. A general solution of the matrix completion problem is identified and expressed conveniently in terms of any given particular solution. Several particular solutions are proposed. Reconstruction and decomposition algorithms are developed for the biorthogonal wavelets. Special results for the univariate case E=[0,1] are obtained.     

一种支持更新操作的数据空间访问控制方法

数据空间是一种新型的数据管理方式,能够以pay-as-you-go模式管理海量、动态、异构的数据。然而,由于数据空间环境下数据的动态演化、数据描述的细粒度和极松散性等原因,难于构建有效的访问控制机制。该文提出一个针对数据空间环境下极松散结构模型,重点支持更新操作的细粒度和动态的访问控制框架。首先定义更新操作集用于数据空间的数据更新,提出支持更新操作的映射方法,可将动态数据映射到关系数据库中;给出支持更新操作权限的数据空间访问控制规则的定义,并分析与关系数据库的访问控制规则二者转换的一致性;然后提出具有可靠性和完备性的访问请求动态重写算法,该算法根据用户的读/写访问请求检索相关访问控制规则,使用相关权限信息重写访问请求,从而实现支持动态更新的细粒度数据空间访问控制。理论和实验证明该框架是可行和有效的。