集成平台空域辅助阵列共址干扰抑制技术

针对同时存在恶意干扰与非法窃听的通信环境,提出一种协作干扰(cooperative jamming, CJ)掩护的保密通信架构,收发信机之间采用跳频技术躲避恶意干扰,并采用协作干扰技术阻塞非法窃听。但该架构的通信带宽较大,会在收发频率振荡器中引起显著的同相和正交(in-phase and quadrature, IQ)通道失衡。鉴于此,对收发IQ通道失衡引起的信号失真进行数学建模,给出接收机处信干噪比的数学表达式,并给出干扰抑制比的闭合表达式。仿真结果表明,收发IQ通道失衡引起的信号失真的功率远大于热噪声功率。随着收发IQ通道失衡加剧,所提架构的信干噪比和干扰抑制比性能均会急剧下降,当幅度和相位失衡分别达到0.95和π/50时,信干噪比和干扰抑制比均损失了47 dB。     

基于改进空战威胁评估模型的权重计算方法比较

针对多无人机(UAV)任务网协同空战态势威胁评估问题,在现有基本模型基础上增加考虑气象环境对威胁评估要素的影响和无人机的自主可靠性系数两个实际因素,提出一种改进的超视距空战威胁评估模型;同时,应用串联电阻分压法、改进AHP法和熵权法分别计算融合模型中各威胁指标的权重系数;进而,在考虑己方战机对敌方战机综合威胁与优势的基础上,介绍了战机协同空战目标分配的基本方案。最后,应用上述3种权重计算方法进行空战威胁仿真计算,计算结果表明改进空战威胁评估模型可有效改善空战决策性能。     

基于多Agent无人机协同侦察任务规划模型

建立了多无人机协同侦察任务规划模型,在考虑侦察时间间隔约束和目标载荷需求基础上,给出了位于不同基地的无人机优化部署和调度策略,并提出了基于多Agent的优化搜索仿真算法,利用Matlab实现了无人机优化配置和任务规划模型,得出了无人机优化配置和任务规划方案,最后分析了模型算法存在的某些不足,提出了模型改进的方向。     

双机编队协同制导的火控机理

针对半主动雷达中制导的远距空空导弹在制导过程中对载机的强依赖性问题,提出了双机协同制导的概念;首次给出了双机协同制导的过程描述.分析了长、僚机制导过程中对导弹导引和目标跟踪过程中的各计算要素;提出了长机对目标预测并进行数据传递,僚机再通过预测值对目标实施机动和照射的协同制导思想.     

Analytic solution for the nucleolus of a three‐player cooperative game

The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于TMS320C6416芯片的多板卡声纳信号协同处理技术

针对单DSP系统不能满足多路声纳信号实时处理的要求,提出了基于TMS320C6416芯片的多板卡声纳信号协同处理技术,介绍了协同处理中DSP之间以及DSP与主控计算机之间的数据传输方法和软件实现流程,该技术可通过增加信号处理板卡扩展系统的处理能力,具有较好的灵活性。实验结果验证了系统协同处理的正确性。     

建构学习理论在教学中的应用

在教学中运用建构学习理论,针对“基于经验的知识建构活动”进行有益尝试。在此理论背景下,教师最重要的任务是利用三个层次的建构性经验源为学生提供知识建构的良好条件,并探讨这一理念在教学中的具体应用及其效果。     

基于CEC系统舰艇编队防空作战最小共享信息集研究

根据最小共享信息集的概念,提出了基于CEC系统舰艇编队协同防空作战的智能系统模型,分析了舰艇编队CEC系统的作战功能和作战信息,提出了确定舰艇编队协同防空作战的最小共享信息集的事件法,并应用信息论证明了事件法的确能够减少通信的信息量。在上述基础上,确定了舰艇编队协同防空作战的最小共享信息集。     

Cost allocation rules for elastic single‐attribute situations

Many cooperative games, especially ones stemming from resource pooling in queueing or inventory systems, are based on situations in which each player is associated with a single attribute (a real number representing, say, a demand) and in which the cost to optimally serve any sum of attributes is described by an elastic function (which means that the per‐demand cost is non‐increasing in the total demand served). For this class of situations, we introduce and analyze several cost allocation rules: the proportional rule, the serial cost sharing rule, the benefit‐proportional rule, and various Shapley‐esque rules. We study their appeal with regard to fairness criteria such as coalitional rationality, benefit ordering, and relaxations thereof. After showing the impossibility of combining coalitional rationality and benefit ordering, we show for each of the cost allocation rules which fairness criteria it satisfies. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 271–286, 2017     

Probabilistic resource pooling games

We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation.