基于系统动力学的网络空间作战指挥效能评估?

针对网络空间作战指挥效能评估问题,运用系统动力学方法进行了研究。通过层次熵分法对网络空间作战指挥效能评估指标体系进行了指标权重赋值,依托系统动力学方法建立了指挥效能评估模型并进行了仿真实验,分析了不同条件下指标对指挥效能的影响情况,为研究如何提高网络空间作战指挥效能提供决策依据。     

堆焊再制造层表面质量的分形表征方法

应用分形几何学方法,研究了不同路径间距条件下的堆焊再制造层表面形貌,用表面分形维数对堆焊再制造层表面质量进行了表征。结果表明:堆焊再制造层表面在一定尺度范围内具有分形特性,分形维数很好地表征了材料表界面的粗糙和复杂、不规则程度,是一个能够反映出表面内禀特性的特征参数,可以用分形维数来表征堆焊再制造层的表面质量;不同路径间距条件下的堆焊再制造层表面分形维数不同,路径间距越接近理论最佳值,堆焊再制造层表面分形维数越大,表面质量也越高。该方法可为进一步研究堆焊再制造层表面质量,以及优化堆焊熔敷成形再制造工艺参数提供定量依据。     

二维凹槽过渡流的DSMC方法模拟

采用DSMC (DirectSimulationMonte -Carlo)方法模拟二维凹槽过渡流动 ,给出了在不同Knudsen数、不同展弦比、不同壁温条件下凹槽流的速度和温度分布 ,并对DSMC方法在模拟全速度域流场时存在的局限性进行了讨论。     

远程干扰战术环境下机载预警雷达的作战使用

描绘了一架以被动跟踪和烧穿方式工作的机载预警雷达对抗一架远程干扰机和两枚空对空导弹的情景,详细分析了该远程干扰战术环境下机载预警雷达的几种作战使用方法,仿真验证了不同条件下烧穿距离的有效性,分析了不同脉冲宽度和脉冲积累数对烧穿距离的影响,并对该战术环境下操纵人员对雷达的作战使用做出了总结建议。     

一种改进的高动态SINS姿态更新算法

为了提高捷联惯导姿态解算的精度,介绍了捷联惯导姿态更新的流程及常用方法,并提出了一种改进的等效旋转矢量姿态解算算法。对改进算法的姿态解算算法在低动态条件和高动态条件下分别进行了仿真实验,结果表明改进算法在低动态条件下的姿态解算精度和毕卡四元数法相当,在高动态条件下的姿态解算精度远高于传统毕卡四元数法。     

采用遗传算法对Jaumann吸波结构材料优化设计

以频率带宽为优化目标函数,采用遗传算法针对3层Jaumann吸波结构材料进行优化设计。分析了不同介电常数,不同隔离层层数,不同隔离层厚度以及不同电阻参数对吸波材料反射率的影响;在吸波结构材料反射率T-15 d B条件下,获得了较宽的频率带宽,并得到了该频率带宽内相应介电常数,隔离层厚度和电阻的优化参数。     

略论高技术条件下的人的因素

人的因素是什么?在不同的历史条件下有着不同的内涵。 过去战争中,一个士兵一枪打不准,对整个战局无关紧要。现代战争一个操作人员的失误,就可能对整个战场带来极其严重的后果,从这个意义上说,现代高技术条件下,     

等概率抽样群体演化算法的隐含并行性

在等概率抽样群体的条件下,讨论了演化算法的隐合并行性,得到了算法每代隐含处理的模式长度不超过ls（0≤ls≤l）的不同模式期望数的精确表达,并估计了其上下界．     

采用遗传算法对Jaumann吸波结构材料优化设计北大核心

以频率带宽为优化目标函数,采用遗传算法针对3层Jaumann吸波结构材料进行优化设计。分析了不同介电常数,不同隔离层层数,不同隔离层厚度以及不同电阻参数对吸波材料反射率的影响;在吸波结构材料反射率T<-15 d B条件下,获得了较宽的频率带宽,并得到了该频率带宽内相应介电常数,隔离层厚度和电阻的优化参数。     

再入体过渡区气动特性预测

采用DSMC(DirectSimulationMonte Carlo)方法模拟球双锥复杂外形过渡区流动。给出了近连续区的温度与压强分布图,以及在不同Knudsen数、不同马赫数条件下球双锥表面压强系数和阻力系数的分布,并将阻力系数模拟结果与桥函数一体化估算结果进行了比较分析。     

基于满意决策的多UAV协同目标分配方法

目标分配是UAV自主控制的重要问题。提出了基于满意决策的多UAV协同的目标分配技术,为解决多UAV协同的目标分配问题和多机场起飞的UAV编队配置问题提供了一种新颖而有效的方法。重点对其中的满意集计算、联合满意度、拒绝度和选择度的建立和计算等关键问题进行了讨论。以压制敌防空火力任务为背景对该方法进行了仿真,并将本文提出的方法和其他方法做了比较,仿真结果表明基于满意决策的多UAV协同的目标分配方法在效率上有明显优势。     

过航点舰载弹炮结合武器系统发射判定模型

针对基于过航点对弹炮结合武器系统进行火力分配中未求解过航点坐标和未考虑毁伤概率等因素,以及基于勾径点模型对弹炮结合武器进行火力分配方法过于简化、未充分考虑武器系统火力防区对弹炮发射判定的影响等问题,建立基于过航点的弹炮发射判定模型,提出了基于过航点的弹炮结合武器发射判定问题的解决方案,经仿真分析,与上两种算法对比,具有一定的改进。     

主客观组合赋权在舰载通信系统评估中的应用

为提高舰载通信系统效能评估的科学性,将主观和客观赋权法相结合,提出将基于标度扩展的AHP法和离差最大化法通过基于目标规划的组合方法进行结合,用于舰载通信系统效能评估中各指标权重的确定,从而融合了主客观方法的优点。评估结果表明了该方法的合理性。     

改进博弈论的舰载无人机编队协同对海突击目标分配

目标分配问题是UAV自主控制的重要问题。针对舰载无人机编队协同对海突击目标分配问题,首先建立了基于离散动态贝叶斯网络的目标价值评估模型,在此基础上构建了舰载无人机编队的益损值矩阵,设计了舰载无人机编队协同对海突击目标分配的决策函数,提出了一种基于改进博弈论的目标分配方法,为4种不同约束条件下的目标分配问题分别设计了算法。最后对所建立的目标价值评估模型和改进博弈论的目标分配算法进行了实例仿真,仿真结果表明了模型和算法的可行性和有效性。     

加权模糊C均值聚类算法实现BDS三频组合观测值优选

在对BDS三频载波相位组合观测值进行误差分析的基础上,确定了优选载波相位线性组合系数的筛选标准。针对传统聚类算法在高维多频混合数据集分类中存在的不足,采用一种基于加权的模糊C均值聚类算法,通过对同一维度在不同簇上赋予不同的权重值,对传统遍历搜索法所获得的部分BDS三频载波相位组合观测值进行了优化分类选取,有效解决了传统全球导航卫星系统载波相位观测值选取方法效率低的问题,同时为多系统多频数据组合观测值系数的优化选取提供了一种新的思路。对分类结果进行分析,确定了各类组合观测量的适用范围,并结合实测数据,利用无几何层叠模糊度解算方法对优选组合进行了整周模糊度的解算,结果验证了该方法的可行性。     

Solving the multiperiod assignment problem with start-up costs using dual ascent

In this article we consider a multiperiod assignment problem where the assignment cost of assigning job i to machine j varies from one time period to the next. A start-up cost is incurred whenever the job processed by a machine in the current time period is different from the one processed in the previous time period. This problem is modeled as an integer programming problem for which a dual ascent approximate procedure is developed. Our computational results show that our procedure outperforms the more common Lagrangian-relaxation-based subgradient procedure by a significant margin. It is also found to be faster than MPSX/370 by many orders of magnitude. © 1993 John Wiley & Sons, Inc.     

Robust tower location for code division multiple access networks

Designing Code Division Multiple Access networks includes determining optimal locations of radio towers and assigning customer markets to the towers. In this paper, we describe a deterministic model for tower location and a stochastic model to optimize revenue given a set of constructed towers. We integrate these models in a stochastic integer programming problem with simple recourse that optimizes the location of towers under demand uncertainty. We develop algorithms using Benders' reformulation, and we provide computational results. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Tree-search algorithms for quadratic assignment problems

Problems having the mathematical structure of a quadratic assignment problem are found in a diversity of contexts: by the economist in assigning a number of plants or indivisible operations to a number of different geographical locations; by the architect or indusatrial engineer in laying out activities, offices, or departments in a building; by the human engineer in arranging the indicators and controls in an operators control room; by the electronics engineer in laying out components on a backboard; by the computer systems engineer in arranging information in drum and disc storage; by the production scheduler in sequencing work through a production facility; and so on. In this paper we discuss several types of algorithms for solving such problems, presenting a unifying framework for some of the existing algorithms, and dcscribing some new algorithms. All of the algorithms discussed proceed first to a feasible solution and then to better and better feasible solutions, until ultimately one is discovered which is shown to be optimal.     

对潜搜索的灰色整数规划模型

在对潜搜索中,针对搜索兵力武器装备战技性能的优劣、指挥人员的军政素质的高低、水文气象条件的好坏等因素均会随着时间的推移而发生变化的特点,为了取得最佳的搜潜效果,需要根据时间变化给不同的作战单元分派不同的作战任务.将整数规划与灰色模型相结合,建立了对潜搜索的灰色整数规划模型,给出了检验方法和求解步骤,并举例分析说明.经验证,该模型精度等级较高,且能使各作战单元的搜索效率达到最佳,因此,可资对潜搜索兵力分配时借鉴.     

An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network

Scheduling IT projects and assigning the project work to human resources are an important and common tasks in almost any IT service company. It is particularly complex because human resources usually have multiple skills. Up to now only little work has considered IT‐specific properties of the project structure and human resources. In this article, we present an optimization model that simultaneously schedules the activities of multiple IT projects with serial network structures and assigns the project work to multiskilled internal and external human resources with different efficiencies. The goal is to minimize costs. We introduce a metaheuristic that decomposes the problem into a binary scheduling problem and a continuous staffing problem where the latter is solved efficiently by exploiting its underlying network structure. For comparison, we solve the mixed–binary linear program with a state–of–the–art commercial solver. The impacts of problem parameters on computation time and solution gaps between the metaheuristic and the solver are assessed in an experimental study. Our results show that the metaheuristic provides very favorable results in considerable less time than the solver for midsize problems. For larger problems, it shows a similar performance while the solver fails to return feasible solutions. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 111–127, 2012