使用双水压传感器抗风浪干扰原理

提出了在水雷上使用双水压传感器的设想.传统水雷只使用一个水压传感器,提供的信号信息稍嫌不足,给水压引信抗风浪干扰带来了限制.通过使用两个传感器,利用海浪水压场传播时在两个传感器上的时延信息,使用抵消方法压制海浪水压信号.初步分析表明,使用双传感器可以使水压引信抵抗一定的海浪水压信号的干扰.     

北斗系统新民用导航电文历书参数算法与性能分析

研究新公布的北斗民用导航电文中的两类历书与北斗二号导航电文历书的差异,对比分析各类历书对接收机首次定位时间的影响。利用实际的历书数据,比较不同历书类型的用户算法,分析不同龄期数据对接收机首次定位性能的影响。结果表明,高精度历书在1周的数据龄期内性能较为稳定,中等精度历书精度稍逊于高精度历书,但由于简化了电文空间,能接近高精度历书性能。简约历书进一步简化了参数数目和电文空间,尽管位置误差达到了数百千米,但却能在数月之后保持相应精度,有利于缩短接收机首次定位时间。     

基于改进协同遗传算法的有效载荷系统功能序列规划方法

针对传统回溯算法在求解基于知识模型的有效载荷系统功能序列规划问题中搜索效率低的问题,提出一种基于"择劣变异"(Worst Individual Mutation,WIM)策略的协同遗传算法(Co-evolutionary Genetic Algorithm,CGA)的改进算法WIM-CGA。该算法在遗传过程中采用双路线进化方案,即"择优实施标准遗传过程,择劣实施变异操作",达到提高求解精确度及搜索效率的目的。仿真结果表明,同等测试条件下,当功能规模为50,约束密度为1.0时,WIM-CGA算法在限定时间内最优解的平均精确度比优化的回溯算法提高了54.15%,比CGA算法提高了6.18%,且当所得解的精确度大于90%时,WIM-CGA算法比CGA算法的迭代次数减少了65.79%,耗时降低了48.97%,显著提高了功能序列规划的效率。     

Coercive diplomacy and the Donbas: Explaining Russian strategy in Eastern Ukraine

What were Russia’s objectives in Eastern Ukraine, and why was it seemingly unable to achieve a successful or decisive outcome? In contrast to Russia’s seizure of Crimea, the uprising in Eastern Ukraine was marked by disorganization and chaos. Using proxy and surrogate actors, along with military exercises and the injection of Russian troops, Russia sought to institutionalize a political entity inside Ukraine to influence its domestic politics. In this article, I analyze the mechanisms by which Russia attempted to implement, and later salvage, its strategy. The article contributes to clearer theoretical and practical understanding of limited force in coercive diplomacy, signaling, and a more rigorous treatment of the role and uses of proxy actors.     

内置频率对Duffing振子微弱二进制相移键控信号盲检测影响

采用Duffing振子实现对微弱二进制相移键控（Binary Phase Shift Keying, BPSK）信号的盲检测时,Duffing系统输出的周期态和混沌态转换之间存在过渡带。针对这一问题,推导出过渡带时长和Duffing系统内置频率之间的关系表达式;指出内置频率越高,过渡带时间越短;仿真实验给出时间频率响应曲线。内置频率的提高,会降低系统检测微弱信号的灵敏度。针对这一问题,推导出周期态下Duffing系统输出幅度作为因变量、内置频率作为自变量的表达式;仿真实验给出幅频响应曲线。针对微弱BPSK信号盲检测,建立变尺度方法和检测阵列相结合的基于S变换提取Duffing系统输出幅度包络的微弱BPSK信号盲检测模型,仿真实验验证了模型方法的有效性。     

Resequencing with parallel queues to minimize the maximum number of items in the overflow area

This article treats an elementary optimization problem, where an inbound stream of successive items is to be resequenced with the help of multiple parallel queues in order to restore an intended target sequence. Whenever early items block the one item to be currently released into the target sequence, they are withdrawn from their queue and intermediately stored in an overflow area until their actual release is reached. We aim to minimize the maximum number of items simultaneously stored in the overflow area during the complete resequencing process. We met this problem in industry practice at a large German automobile producer, who has to resequence containers with car seats prior to the assembly process. We formalize the resulting resequencing problem and provide suited exact and heuristic solution algorithms. In our computational study, we also address managerial aspects such as how to properly avoid the negative effects of sequence alterations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 401–415, 2016     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

一种连续修正速度方向的导引方法

考虑制导炮弹由身管武器发射,其飞行控制能力和导引信息量有限,基于预测落点位置偏差量来修正速度方向并在控制时间内连续分配导引指令的思想,提出了一种新的三维末制导方法。根据非线性弹道方程组的级数解预测弹丸落点位置,得到落点与目标的偏差,并提出了两种通过此偏差解算当前速度方向修正量的方法。取剩余飞行时间为修正时间,通过将速度方向修正量分配到整个剩余导引段建立了加速度修正公式,以减小导引指令饱和的可能性。通过连续地预测落点和分配加速度指令来实时地导引飞行。仿真结果表明：该导引方法简单可行,精度高,对控制能力要求较低,且具备较好的制导效果和毁伤效果,为该体制制导炮弹的应用提供参考依据。     

基于RCS序列的助推段弹道导弹识别

在弹道导弹的助推段,通过低分辨率雷达得到RCS序列作为识别的重要信息。由于运动特性和电磁散射特性的差异,弹道导弹在助推段的RCS序列与其他目标相比具有可识别性,但需要对其RCS序列进行处理。基于目标识别技术,详细阐述能从RCS序列中提取出的特征参数,并通过直方图、N点截图等方法给出了直观的反映。最后,将弹道导弹助推段特征与飞机、燃料舱等典型目标进行对比,得到可以作为识别参量的特征参数,并通过类内类间距离验证了有效性。     

一种高速实时数据采集处理系统设计

针对目前高速数据采集中的实时性和同步性问题,提出了一种高速实时数据采集处理设计方案。根据上述方案进行了系统的硬件和软件设计,该系统以FPGA器件作为下位机控制核心,设计了时钟同步、数据采集、数据处理、数据缓存、数据通讯等功能模块;整个系统采用ARM微处理器作为上位机控制核心,基于嵌入式Linux 2.6内核进行软件编程,负责向FPGA发送设置参数和控制指令,同时对数据前端采样和处理数据进行存储、显示、统计等。经测试验证,该方案具有高速率、高精度、同步测量、实时处理、体积小、功耗低等优点。