基于灰度关联和神经网络的装备价格第三方服务机构评价模型

为了科学合理选择装备价格第三方服务机构,研究以灰度关联分析和神经网络方法构建评价模型。研究数据采用问卷调研形式获取,针对样本数据采用灰度关联法分析评价指标与综合评分之间的关联性,发现服务态度和制度建设情况两个评价指标与综合评分关联度达0.74以上,较为重要。采用有效二级指标和综合评分作为输入和输出数据,构建基于神经网络的装备价格第三方服务机构评价模型。通过实际数据验证分析,发现神经网络模型预测精准的概率为75%,预测满足要求的概率为25%,满足实际应用需求,能够为主管部门遴选机构建言献策。     

Chance‐constrained multi‐terminal network design problems

We consider a reliable network design problem under uncertain edge failures. Our goal is to select a minimum‐cost subset of edges in the network to connect multiple terminals together with high probability. This problem can be seen as a stochastic variant of the Steiner tree problem. We propose two scenario‐based Steiner cut formulations, study the strength of the proposed valid inequalities, and develop a branch‐and‐cut solution method. We also propose an LP‐based separation for the scenario‐based directed Steiner cut inequalities using Benders feasibility cuts, leveraging the success of the directed Steiner cuts for the deterministic Steiner tree problem. In our computational study, we test our branch‐and‐cut method on instances adapted from graphs in SteinLib Testdata Library with up to 100 nodes, 200 edges, and 17 terminals. The performance of our branch‐and‐cut method demonstrates the strength of the scenario‐based formulations and the benefit from adding the additional valid inequalities that we propose. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 321–334, 2015     

火力打击条件下Ad hoc网络节点毁伤程度评估

Ad Hoc网络在信息化战场的广泛应用,需要快速有效地评估火力打击对网络的毁伤程度。从Ad hoc网络自身属性出发,结合网络的内部测度和外部测度,给出了节点有效度、节点修复度以及节点连通度等指标计算模型。构建了节点毁伤程度加权邻接矩阵,提出了一种基于复杂网络团簇结构划分的节点毁伤程度评估方法,根据权值的相似程度对节点的毁伤程度进行归类,并给出了示例分析。最后将本算法与模糊聚类算法进行对比分析,结果证明了方法的正确性。     

基于辐射能量分析的网络拓扑结构探测

在战场环境中,探测出敌方网络拓扑结构,为寻找网络最佳攻击点奠定了基础,具有重要意义。在研究数据链组网原理的基础上,研究了多址接入方式的探测方法,并提出了基于辐射能量分析的网络拓扑结构探测新方法。该方法通过对信号进行时频分析并结合互联关系矩阵来进行网络拓扑结构判断,仿真结果表明该方法可以有效地判断出敌方的网络拓扑结构和多址接入方式。     

敏捷成像卫星自主规划模型与算法

针对敏捷成像卫星自主规划问题,将规划、决策、执行和信息反馈相结合,提出星上自主规划框架,并介绍框架结构和模块功能。在分析主要约束条件的基础上,建立基于时间线约束网络的问题模型。通过将各种卫星动作前后衔接,组合成能够完成不同任务的动作序列,提出一种面向卫星动作序列的启发式算法。该算法分为规划和决策两个部分,并在卫星执行每一个动作序列的同时基于多种启发式规则进行规划,在动作序列执行结束时进行决策。实验结果表明了自主规划框架和模型的合理性以及算法的有效性。     

基于贝叶斯网络的装甲目标战术企图推理模型构建

以贝叶斯网络理论为基础,分析基于贝叶斯网络的目标企图推理框架,从目标状态、目标性质、战场环境和战术特性4个方面提取节点,在分析这4个节点拓扑结构的基础上,构建了装甲目标战术企图推理的贝叶斯网络拓扑结构。     

有源滤波器比例谐振重复控制策略

为了改善补偿电流跟踪控制性能,在分析比例谐振控制策略原理与特性的基础上,结合指令电流的特性,合理地融入重复控制,提出了一种基于多重化坐标系的比例谐振重复控制策略。仿真和实验结果表明:该控制策略具有优良的动静态性能,可有效抑制电流的谐波。     

KL散度多模块滑动窗口慢特征分析的故障诊断方法

针对传统分块方法根据经验划分子块导致变量特征信息无法充分利用,其单一的建模方式忽略局部信息以及离线模型无法适应时变特性的问题,提出了一种KL (Kullback-Leibler)散度多模块滑动窗口慢特征分析方法。在正常工况数据集中,利用KL散度来度量变量间的距离,同时引入最小误差平方和准则进行聚类,分成两个距离最小的子模块;在此基础上利用慢特征分析方法对每个子模块进行建模,结合滑动窗口对每次采样的数据进行更新,得到最优模型,分别计算监测统计信息,利用支持向量数据描述对故障监测结果进行融合,实现故障诊断。并将该方法应用于田纳西伊斯曼过程的监控中,得到了较高的故障检测率和较低的虚警率,验证了该方法的可行性和有效性。     

高性能计算和数据中心融合网络研究综述

随着高性能计算、大数据处理、云计算和人工智能计算呈融合发展趋势,高性能计算网络和数据中心网络的融合网络成为互连网络发展的重要趋势。分析当前融合网络研究现状;针对当前最具代表性的融合网络进行详细阐述,全面展示该领域的最新技术和动态;提出融合网络面临的技术挑战;基于技术挑战对融合网络的发展趋势进行展望,包括融合网络协议栈设计中融合与分化并存、基于在网计算实现融合网络性能加速、面向新兴应用需求优化融合网络性能。     

Balancing stability and efficiency in team formation as a generalized roommate problem

The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.