基于小波Radon变换检测线性调频信号

对信号小波分析的结果进行Radon变换,简称小波Radon变换。通常情况下,线性调频信号小波变换的结果在时间尺度图上呈现曲线的形式,而在时频图上呈现直线的形式。通过Radon变换检测时频平面上的直线,可以精确地得到调频信号的参数。仿真结果表明,小波Radon变换是一种较好的线性调频信号检测方法。     

用多重网格TVD方法求解三维高超音速粘性流场

本文采用时间相关法求解了三维Ｎ－Ｓ方程。在计算中，对于压力和对流项采用Ｒｏｅ的通量差分分裂技术和Ｏｓｈｅｒ－Ｃｈａｋｒａｖａｒｔｈｙ的ＴＶＤ格式，对于粘性项，采用了中心差分格式。通过数值模拟得到了钝头双锥体高超音速层流流场在不同攻角下的数值解。计算的重点放在壁面热流率的预测。在攻角为４°和１２°的状态下，Ｓｔａｎｔｏｎ数的计算值与实验值进行了比较，二者吻合较好。为了加快收敛速率，计算时采用了多重网格方法。     

高超音速流场的隐式TVD格式并行计算

本文采用区域分割技术和拼接网格的并行策略，发展了一个适合于分布式存贮多机系统的ＴＶＤ隐式有限体积并行算法；并在ＰＶＭ并行环境下，对三维高超音速绕流流场实现了多机并行计算，通过负载平衡等方法得到了较高的加速比（在二处理机系统上加速比为１∶８４，在四处理机系统上为３∶４４）。     

基于IGAHP-IEW-GT-MCGC的装备体系方案质量评价模型

针对装备体系方案质量评价指标体系不够全面,通过运用鱼骨图分析法对各类影响因素进行综合分析,并从稳定度和有效度角度优化分析指标,以确定合理适用的装备体系方案质量评价指标体系;针对赋权过程中存在的不确定性,采用IGAHP(Improved Group Analytic Hierarchy Process,IGAHP)-IEW(Improved Entropy Weight,IEW)-GT(Game Theory,GT)相结合的方法,对评价指标体系各指标进行了赋权;针对原始数据处理和评价过程中的不确定性性,运用云重心评判法(Membership Cloud Gravity Center,MCGC)对装备体系方案质量的进行综合评价,以得出定性与定量评价结果。最后,以某装备体系方案为对象进行示例评价,验证了模型的合理性和适用性。     

基于参数优化的SVM联合作战战场建设方案优选

联合作战战场建设方案优选可最大可能降低建设工程的损耗、提高整体建设效益。针对联合作战战场建设方案优选问题进行研究,首先梳理联合作战战场建设方案优选流程,然后构建包括作战保障工程、后勤保障工程、装备保障工程和战场基础信息数据库的指标体系,并提出基于网格搜索和交叉验证优化的改进SVM方法实施方案优选,仿真结果表明优化后参数的性能明显优于默认参数,更加适用于联合作战战场建设方案优选问题。     

物元理论在优选对地打击目标中的应用

优选对地打击目标是现代信息化战争条件下联合作战对地火力协调中心在计划火力时的首要任务。旨在从目标的重要性、可靠性、射击紧迫性及对其射击时自身被发现的机会四个因素入手,举例证明如何构造物元模型,做到定性与定量相结合,对于编制炮兵C4I系统计划火力软件具有一定的参考价值。     

A worst‐case formulation for constrained ranking and selection with input uncertainty

In this research, we consider robust simulation optimization with stochastic constraints. In particular, we focus on the ranking and selection problem in which the computing time is sufficient to evaluate all the designs (solutions) under consideration. Given a fixed simulation budget, we aim at maximizing the probability of correct selection (PCS) for the best feasible design, where the objective and constraint measures are assessed by their worst‐case performances. To simplify the complexity of PCS, we develop an approximated probability measure and derive the asymptotic optimality condition (optimality condition as the simulation budget goes to infinity) of the resulting problem. A sequential selection procedure is then designed within the optimal computing budget allocation framework. The high efficiency of the proposed procedure is tested via a number of numerical examples. In addition, we provide some useful insights into the efficiency of a budget allocation procedure.     

Information theory for ranking and selection

We study the classical ranking and selection problem, where the ultimate goal is to find the unknown best alternative in terms of the probability of correct selection or expected opportunity cost. However, this paper adopts an alternative sampling approach to achieve this goal, where sampling decisions are made with the objective of maximizing information about the unknown best alternative, or equivalently, minimizing its Shannon entropy. This adaptive learning is formulated via a Bayesian stochastic dynamic programming problem, by which several properties of the learning problem are presented, including the monotonicity of the optimal value function in an information-seeking setting. Since the state space of the stochastic dynamic program is unbounded in the Gaussian setting, a one-step look-ahead approach is used to develop a policy. The proposed policy seeks to maximize the one-step information gain about the unknown best alternative, and therefore, it is called information gradient (IG). It is also proved that the IG policy is consistent, that is, as the sampling budget grows to infinity, the IG policy finds the true best alternative almost surely. Later, a computationally efficient estimate of the proposed policy, called approximated information gradient (AIG), is introduced and in the numerical experiments its performance is tested against recent benchmarks alongside several sensitivity analyses. Results show that AIG performs competitively against other algorithms from the literature.     

基于深度森林的网络流量分类方法

随着网络应用的迅猛发展,流量分类在网络资源分配、流量调度和网络安全等诸多研究领域受到广泛关注。现有的机器学习流量分类方法对流量数据特征的选取和分布要求苛刻,导致在实际应用中的复杂流量场景下分类精确度和稳定度难以提高。为了解决样本特征属性的复杂性给分类性能带来的不利影响,引入了基于深度森林的流量分类方法。该算法通过级联森林和多粒度扫描机制,能够在样本数量规模和特征属性选取规模有限的情况下,有效地提高流量整体分类性能。通过网络流量公开数据集Moore对支持向量机、随机森林和深度森林机器学习算法进行训练和测试,结果表明基于深度森林的网络流量分类器的分类准确率能够达到96. 36%,性能优于其他机器学习模型。     

军事物流服务商准入标准设置和甄选研究综述

军事物流服务商甄选研究是新军事变革下供应商管理发展的重要方向,是有效完成后勤保障任务、顺利实施作战行动的重要保证。基于此,本文从供应商关系理论和发展、物流服务商指标体系选择以及结合其他方法对物流服务商甄选三个方面对国内外研究现状进行总结概述,对整个军事物流服务商的选择过程加以研究,将其科学客观地运用于军事物流服务商选择的实际操作中,对于加强军事物流服务商需求管理、提高选择质效以及优化工作流程具有重大意义。同时,分析现有研究成果的不足,并对其未来发展前景提出展望,针对性地提出了军事物流服务商初步准入标准以及后续复选的方法,为军事物流服务商选择体系的完善提供参考。