基于改进证据网络的空战动态态势估计方法

针对无人机空战态势估计既需要综合考虑多类型因素影响,又需要具有不确定性推理能力的特点,建立了一种基于改进证据网络的动态态势估计模型并设计了威胁等级评估推理方法。首先,考虑空战决策时间较短的特点,提出变量框架等级缩减方法以提高网络运行效率;然后,针对空战态势信息具有大不确定性的特点增加冲突数据自适应融合算法以及网络证据的时间序列预测,提高证据的合理性;最后,引入时空融合思想和变权机制将前一时刻的威胁信息作为评判后一时刻威胁的重要标准,应用威胁在时间维度上的递归合成增加信息在时间方向的传递,改善了由于证据失真引起的评估结果的不合理性问题,并通过仿真验证了该方法的有效性。     

面向空中目标威胁评估的多传感器管理方法

为了降低在空中目标威胁评估任务中由于威胁评估结果的不准确性和传感器辐射所带来的潜在损失，提出了一种基于风险的多传感器管理方法。首先，基于部分可观马尔可夫决策过程建立了传感器管理模型；然后，给出了基于信息状态的威胁评估风险和传感器辐射风险的预测方法以量化潜在损失；接着，为获得更优的作战收益，以多步风险预测值为决策依据，以两种风险的加权和最小为优化目标建立了长期目标函数；最后，在求解目标函数时，将传感器管理问题转化为决策树搜索，设计了一种基于分支定界的标准代价搜索算法以快速获得高质量的管理方案。仿真实验表明，所提算法能够在搜索到高质量解的同时大幅减少计算时间和内存消耗；所提方法能够对风险进行准确预测，且相比于经典的传感器管理方法，所提方法具有更好的风险控制效果。     

基于TMSDG的民用飞机故障诊断隔离策略

 针对民用飞机排故时交互式故障诊断与隔离需求,在符号有向图(SDG)中补充状态节点的故障概率信息和未测状态表达,引入对测试节点的描述,提出了一种附带测试维修信息的SDG(TMSDG),给出了基于此模型的交互诊断流程。首先根据初始征兆获取可疑集,然后综合可靠性和测试代价等因素生成一种基于最小测试代价的诊断二叉树对初始可疑集进一步隔离。该模型能描述复杂系统中存在的状态关联和故障测试依赖关系,对其中故障进行交互式诊断和隔离指导。利用该方法建立了某飞机发动机高压引气的诊断模型,实验结果表明提出的方法有效。该方法适用于飞机的外场故障诊断与隔离。     

基于PCA-MPSO-ELM的空战目标威胁评估

目标威胁评估是空战对抗过程中的关键环节。由于影响空战目标威胁评估的因素复杂多样，且指标之间存在相关性，导致传统的评估算法无法得到准确客观的评估结果。由此，提出了一种基于主成分分析法和改进粒子群算法优化的极限学习机（PCA-MPSO-ELM）的目标威胁评估算法。首先，综合分析了影响目标威胁程度的指标，利用主成分分析法对原始评估指标进行线性变化处理得到综合变量，消除了评估指标之间的相关性，实现了对评估数据的降维；在此基础上，构建ELM神经网络并利用改进的粒子群算法优化极限学习机的输入权值和阈值，提高了目标威胁评估模型的精度。最后，在空战训练测量仪中选取空战对抗数据，利用威胁指数法构造了目标威胁评估样本数据，通过仿真实验分析了PCA-MPSO-ELM算法的精度和实时性，结果表明所提算法可以快速准确地进行空战目标威胁评估。     

Efficient exhaustive search for optimal-peak-sidelobe binary codes

The work presented here describes an exhaustive search for minimum peak sidelobe level (PSL) binary codes, combining several devices for efficiency. These include combinatoric tree search techniques, the use of PSL-preserving symmetries to reduce search space, data representations and operations for fast sidelobe computation, and a partitioning scheme for parallelism. All balanced 64-bit minimum PSL codes are presented, and the upper limit on known consecutive lengths to have PSL = 4 codes is extended to 70. In addition, a technique for determining balance properties of a code for given PSL-preserving transformations is developed.     

Cross-layer design of LT codes and LDPC codes for satellite multimedia broadcast/multicast services

According to large coverage of satellites, there are various channel states in a satellite broadcasting network. In order to introduce an efficient rateless transmission method to satellite multimedia broadcasting/multicast services with finite-length packets, a cross-layer packet transmission method is proposed with Luby transform （LT） codes for efficiency in the network layer and low density parity check （LDPC） codes for reliability in the physical layer jointly. The codewords generated from an LT encoder are divided into finite-length packets, which are encoded by an LDPC encoder subsequently. Based on noise and fading effects of satellite channels, the LT packets received from an LDPC decoder either have no error or are marked as erased, which can be mod- eled as a binary erasure channels （BECs）. By theoretical analysis on LT parameters and LDPC parameters, the relationships between LDPC code rates in the physical layer and LT codes word lengths in the network layer are investigated. With tradeoffs between the LT codes word lengths and the LDPC code rates, optimized cross-layer solutions are achieved with a binary search algorithm. Verified by simulations, the proposed solution for cross-layer parameters design can provide the best transmission mode according to satellite states, so as to improve throughput performance for satellite multimedia transmission.     

Distributed sensor data fusion with binary decision trees

A distributed sensor object recognition scheme that uses object features collected by several sensors is presented. Recognition is performed by a binary decision tree generated from a training set. The scheme does not assume the availability of any probability density functions, thus it is practical for nonparametric object recognition. Simulations have been performed for Gaussian feature objects, and some of the results are presented     

KUPS: Knowledge-Based Ubiquitous and Persistent Sensor Networks for Threat Assessment

We propose a knowledge-based ubiquitous and persistent sensor network (KUPS) for threat assessment, in which "sensor" is a broad characterization. It refers to diverse data or information from ubiquitous and persistent sensor sources such as organic sensors and human intelligence sensors. Our KUPS for threat assessment consists of two major steps: situation awareness using fuzzy logic systems (FLSs) and threat parameter estimation using radar sensor networks (RSNs). Our FLSs combine the linguistic knowledge from different intelligent sensors, and our proposed maximum-likelihood (ML) estimation algorithm performs target radar cross section (RCS) parameter estimation. We also show that our ML estimator is unbiased and the variance of parameter estimation matches the Cramer-Rao lower bound (CRLB) if the radar pulses follow the Swerling II model. Simulations further validate our theoretical results.     

基于动态变结构BP神经网络的目标威胁评估

针对传统目标威胁估计方法和BP神经网络的不足,在BP神经网络的基础上,建立了基于动态变结构BP神经网络的目标威胁估计模型.该模型通过在权值向量更新公式中引入冲量函数,加快了网络的搜索速度和精度,保证了网络获得全局最优值;通过实时调整隐含层节点数目,可以将网络结构优化,极大地提升了网络的灵活性.仿真结果表明,与传统目标威胁估计方法和BP神经网络相比,动态变结构BP神经网络具有更好的预测能力和收敛速度,可以快速、准确地完成目标威胁估计.     

适于低轨卫星IP网络的单核共享树组播算法(英文)

为了解决低轨卫星IP网络中现有典型源组播算法的信道资源浪费问题,本文提出了一套单核共享树组播算法,即核心群合并共享树(CCST)和加权核心群合并共享树(w-CCST)算法。CCST 算法包括动态近似中心(DAC)选核方法和核心群合并组播路径构建方法。DAC方法专为周期、规律运动的低轨卫星网络提出,不需要复杂的星上计算。在核心群合并方法中,以核节点作为初始核心群,通过核心群和剩余组成员的最短路径方法逐步扩展直至整棵组播树构建完成,从而使得组播树的树代价最小,大大提高了网络的带宽利用率和组播传输效率。w-CCST 算法中所提出的加权因子可以调整树代价和端到端传播时延之间的折衷程度,因此,可以通过调整加权因子来适度增大树代价、降低端到端传播时延以支持某些端到端时延要求苛刻的实时组播业务。最后,与低轨卫星 IP 网络中典型算法进行了性能比较,仿真结果说明,CCST 算法的平均树代价比其它算法显著降低,w-CCST 算法的平均端到端传播时延小于 CCST 算法。     

Core-based Shared Tree Multicast Routing Algorithms for LEO Satellite IP Networks

A new core-based shared tree algorithm, viz core-cluster combination-based shared tree （CCST） algorithm and the weighted version （i.e. w-CCST algorithm） are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit （LEO） satellite IP networks. The CCST algorithm includes the dynamic approximate center （DAC） core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay ofw-CCST algorithm is lower than that of the CCST algorithm.     

Adaptive boosting for SAR automatic target recognition

The paper proposed a novel automatic target recognition (ATR) system for classification of three types of ground vehicles in the moving and stationary target acquisition and recognition (MSTAR) public release database. First MSTAR image chips are represented as fine and raw feature vectors, where raw features compensate for the target pose estimation error that corrupts fine image features. Then, the chips are classified by using the adaptive boosting (AdaBoost) algorithm with the radial basis function (RBF) network as the base learner. Since the RBF network is a binary classifier, the multiclass problem was decomposed into a set of binary ones through the error-correcting output codes (ECOC) method, specifying a dictionary of code words for the set of three possible classes. AdaBoost combines the classification results of the RBF network for each binary problem into a code word, which is then "decoded" as one of the code words (i.e., ground-vehicle classes) in the specified dictionary. Along with classification, within the AdaBoost framework, we also conduct efficient fusion of the fine and raw image-feature vectors. The results of large-scale experiments demonstrate that our ATR scheme outperforms the state-of-the-art systems reported in the literature     

Neural network-based fault diagnosis for spacecraft with single-gimbal control moment gyros

This paper proposes a neural network-based fault diagnosis scheme to address the problem of fault isolation and estimation for the Single-Gimbal Control Moment Gyroscopes(SGCMGs) of spacecraft in a periodic orbit. To this end, a disturbance observer based on neural network is developed for active anti-disturbance, so as to improve the accuracy of fault diagnosis.The periodic disturbance on orbit can be decoupled with fault by resorting to the fitting and memory ability of neural network. Subsequ...     

基于多层多级天际线选择方法的威胁评估

传统的威胁评估均采用加权求和方法，最终得到的单一威胁度序列缺少各目标特征，且权值设定过程复杂。在天际线选择理论的基础上，提出了多级天际线选择方法，结合多层次威胁评估建模思想，建立了基于多层多级天际线选择方法的威胁评估模型，有效消除了权值设定过程中个人喜好等因素的干扰，并将每个目标在各评价维度上的属性特征呈现出来。仿真实验结果表明，获得的威胁评估结果全面直观，为指挥员依据不同情况进行后续决策提供了重要依据。     

二进制乘法器的面—时平方复杂性研究

讨论了n位二进制整数乘法下界面－时平方复杂性问题，给出了一种树型布局的乘法器网络模型，并分析了它的AT~2复杂性     

转子非包容失效安全性的计算机辅助分析方法

 转子非包容失效是威胁飞机飞行安全的典型特殊风险之一,为了分析其对飞机安全性的影响,开发了转子非包容失效安全性分析系统(URFSAS)。将飞机功能危险分析(FHA)中的灾难性功能危险与故障树分析(FTA)中的底事件及飞机数字样机中的设备模型形成映射关系,建立了需求信息关系模型。在CATIA环境下基于Monte Carlo法以随机飞散角和平动角对转子碎片及其扫掠路径作空间几何变换,基于区域划分和层次包围盒法检测失效的飞机设备,通过故障树最小割集与仿真结果数据的对比分析,实现了对转子非包容失效所触发最小割集的识别和安全性的定量分析。最后,以某型飞机的应用实例分析,表明了该系统的有效性和实用性。     

一种基于事故树的安全风险定量评估方法

针对目前安全风险评估方法的不足,提出了基于事故树的飞机部件安全风险定量评估方法.首先采用布尔代数理论对事故树进行逻辑表述,通过概率重要度表示部件故障的后果严重度,在此基础上对飞机部件的危险度进行计算,解决了当前安全风险定量评估的难题.实例证明,该方法能够较为准确地检验飞机部件对飞行安全的影响.     

Performance limits for processor networks with divisible jobs

Ultimate performance limits to the aggregate processing speed of networks of processors that are processing a divisible job are described. These take the form of either closed-form expressions or numerical procedures to calculate the equivalent processing speed of an infinite number of processors. These processors are interconnected in either a linear daisy chain with load origination from the network interior or a tree topology. The tree topology is particularly general as a natural way to perform load distribution in a professor network topology with cycles (e.g., hypercube, toroidal network) is to use an embedded spanning tree. Such limits on performance are important as they provide an ideal baseline against which to compare the performance of finite configurations of processors.     

基于D-S证据理论的磨粒识别

基于D-S证据理论的信息融合方法应用于磨损颗粒的自动识别,编制了相应的计算机识别程序。在对磨粒图象的形态特征参数进行筛选和统计分析的基础上,确定了各参数的统计容许限和决策基元概率。通过对一组标准磨粒的模拟识别试验,显示该方法具有算法简单、运行可靠、识别正确率高以及识别速度快的优点。      

Asynchronous distributed detection

Binary parallel distributed-detection architectures employ a bank of local detectors to observe a common volume of surveillance, and form binary local decisions about the existence or nonexistence of a target in that volume. The local decisions are transmitted to a central detector, the data fusion center (DEC), which integrates them to a global target or no target decision. Most studies of distributed-detection systems assume that the local detectors are synchronized. In practice local decisions are made asynchronously and the DFC has to update its global decision continually. In this study the number of local decisions observed by the central detector within any observation period is Poisson distributed. An optimal fusion rule is developed and the sufficient statistic is shown to be a weighted sum of the local decisions collected by the DFC within the observation interval. The weights are functions of the individual local detector performance probabilities (i.e., probabilities of false alarm and detection). In this respect the decision rule is similar to the one developed by Chair and Varshney for the synchronized system. Unlike the Chair-Varshney rule, however, the DFC's decision threshold in the asynchronous system is time varying. Exact expressions and asymptotic approximations are developed for the detection performance with the optimal rule. These expressions allow performance prediction and assessment of tradeoffs in realistic decision fusion architectures which operate over modern communication networks