协同反潜指控决策建模及优化研究

介绍了多目标优化模型.建立了协同反潜作战中目标威胁度和射击有利度模型,将遗传算法引入到指控决策优化过程中.设计了基于遗传算法的指控决策优化算法,并对算法作了适应度值乘幂变换和保存最优个体策略方面的改进.以编队协同防御为例,得到了未改进的遗传算法和改进的遗传算法的优化结果,并对两种方法的优化效果进行了比较,比较结果表明:无论是从算法的收敛速度还是寻优率方面,做过改进的算法都较未改进的算法优越.通过选择不同的初始种群进行多次试验的方法,验证了优化结果的正确性.     

联合作战目标协同模型构建与求解方法?

在对联合作战目标协同研究内容分析的基础上，提出了多任务部队与多作战目标的协同目标分配模型，其融合了目标综合价值、目标打击有效性、目标威胁适配度、目标类型匹配、目标距离匹配等因素。通过对各因素量化并将协同目标分配模型转换为指派问题进行求解，验证了分析方法的可行性。     

Insurgent courts in civil wars: the three pathways of (trans)formation in today’s Syria (2012–2017)

As part of research on the meso-foundations of conflict, the field of ‘rebel governance’ examines political institutions that regulate the affairs of civilians in wartime as well as their relations with armed actors. Judicial institutions play an important role in this and research has shown that they are widespread among both historical and current insurgencies. However, usually these bodies have been analysed in the context of one hegemonic faction like the Tamil Tigers in Sri Lanka and the Afghan Taliban. What is missing so far is an analysis of different pathways of (trans)formation of rebel courts. As exemplified by the three case studies of judicial institutions in Eastern Ghouta, Idlib and Aleppo, these are shaped by the distribution of power between ‘same-side’ groups, yielding unipolar, bipolar, or multipolar constellations. The analysis is located on the meso or movement level of insurgent social structures, complementing research on the micro and macro levels.     

Server scheduling on parallel dedicated machines with fixed job sequences

We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance.     

理想气体绝热过程的微观实质

从分子动理论出发,建立理想气体绝热过程的微观模型,用麦克斯韦速度分布函数导出其过程方程.     

一种面向复杂系统的模糊可靠性分配方法

针对系统研制初期的不确定的约束条件与设计目标 ,进行了复杂系统模糊可靠性分配建模 ;结合遗传算法理论 ,考虑了一般系统的求解 ;实例分析验证了所提出方法的性能和可行性 .     

基于云遗传算法的防空导弹目标分配问题

针对传统遗传算法在防空导弹目标优化分配中存在的缺陷，提出了一种更为有效的云遗传算法。通过该算法对防空导弹目标分配模型进行仿真求解，得出防空导弹射击目标的最优目标分配方案。通过算例分析，云遗传算法相比传统遗传算法收敛速度快，搜索效率高出一倍左右，对产生局部最优解情况进行了合理有效的控制，可操作性、优越性更强。     

雷达网实际探测概率分布模型与仿真算法

基于综合考虑各种外界因素影响的雷达实际平面探测区域,建立雷达网实际探测概率分布模型,是一个有待深入探讨的问题.考虑地物遮蔽、顶空和波瓣间盲区的具体影响,首先讨论了雷达单元实际平面探测威力模型,进而提出了一种雷达网实际探测概率分布模型与仿真算法.实例仿真结果表明该模型和算法实用高效.     

自适应变异遗传算法在通信网络时延和路由选择优化中的应用分析

在遗传算法中采用自适应的方法来控制变异操作,可以提高算法的全局搜索能力,加快收敛速度,从而可以迅速地求解组合优化问题,并在进一步求解计算机通信网优化问题中得到成功应用.     

基于动态罚函数遗传算法的电磁探测卫星多星规划方法

针对电磁探测卫星的特点,考虑其主要约束条件,建立了多星联合规划数学模型,提出了基于遗传算法的电磁探测卫星多星规划算法.为处理遗传算法迭代过程中产生的不可行解,引入了基于罚函数法的约束处理方法.针对罚函数法中惩罚系数难以确定的特点,设计了惩罚系数自适应调整的动态罚函数机制.根据模拟的数据进行实验及分析,表明该方法能有效解决电磁探测卫星多星规划问题.