基于语言评价与模糊数的群体意见共识方法

针对具有自然语言评价信息的群决策问题,给出了一种基于语言评价信息与梯形模糊数的群体意见共识方法.该方法先通过无量纲化处理、语言评价信息转换为梯形模糊数、对梯形模糊数进行集结等步骤,形成群体对方案的综合评价值(梯形模糊数);然后对群体意见进行共识分析和评价;最后对共识结果进行方案排序.通过对实例进行分析,表明该方法能得到切合实际的决策效果.     

基于声矢量传感器原理的目标被动定向算法

声测被动定向是声学监视技术的重要研究内容.为了实现对低空运动目标的声学监视,提出了一种基于声矢量传感器原理的被动定向方法,推导出了基于互谱法声强测量技术的定向算法,并对定向算法进行了分析和数值仿真.仿真表明:当传感器尺寸为0.28m、信号信噪比为5dB时,定向精度在2.5°以内.仿真结果说明,该定向算法是正确可行的,有较大的实用价值.该研究成果可直接用于空中运动目标,如飞机、导弹和无人机等目标的声测被动定向.     

高频地波雷达目标高度估计的AR模型方法

高度估计对于高频地波雷获取三维信息、提高预警能力很有意义。然而目标RCS的随机起伏对高度估计产生严重影响,通过对RCS随机起伏的AR模型建模和模型参数的自适应估计,提出了在RCS变化的条件下高度估计的扩展卡尔曼滤波算法。通过Monte Carlo仿真和外场试验数据的处理,验证了该方法对抑制RCS随机起伏、提高高度估计精度的有效性。     

基于Gabor谱方法的跳频信号参数盲估计

提出了一种基于Gabor谱的未知跳频信号参数盲估计方法。该方法利用Gabor谱能量集中、时频分辨率高、交叉项干扰小的特点,在未知任何先验参数的情况下,能够准确估计出跳频信号的跳频频率、跳变时刻和跳频信号驻留时间等参数。通过计算机仿真得到了较为准确的估计结果,验证了该算法的有效性。     

基于频率补偿的时延估计方法

由于2个测量站的通道幅相不一致而导致送给时延估计器的两路信号的频率有差异,继而影响时延估计和系统定位精度。首先理论推导了频率差异是如何影响广义相关时延估计的,接着应用频域相关函数对频率差异做准确估计和补偿,最后给出了频差补偿后的时延估计方法。以4种常用通信信号为例,仿真验证了不同信噪比下所提出方法的正确性和有效性。     

谈武警学院网络实验室建设

网络技术具有很强的实践性。只有亲自动手,才能产生感性认识。在计算机网络课程教学中,急需网络实验室这样的网络实验平台。通过论证、分析,对武警学院网络实验建设提出合理化建议。     

Benders decomposition with alternative multiple cuts for a multi‐product closed‐loop supply chain network design model

In this article, we consider a multi‐product closed‐loop supply chain network design problem where we locate collection centers and remanufacturing facilities while coordinating the forward and reverse flows in the network so as to minimize the processing, transportation, and fixed location costs. The problem of interest is motivated by the practice of an original equipment manufacturer in the automotive industry that provides service parts for vehicle maintenance and repair. We provide an effective problem formulation that is amenable to efficient Benders reformulation and an exact solution approach. More specifically, we develop an efficient dual solution approach to generate strong Benders cuts, and, in addition to the classical single Benders cut approach, we propose three different approaches for adding multiple Benders cuts. These cuts are obtained via dual problem disaggregation based either on the forward and reverse flows, or the products, or both. We present computational results which illustrate the superior performance of the proposed solution methodology with multiple Benders cuts in comparison to the branch‐and‐cut approach as well as the traditional Benders decomposition approach with a single cut. In particular, we observe that the use of multiple Benders cuts generates stronger lower bounds and promotes faster convergence to optimality. We also observe that if the model parameters are such that the different costs are not balanced, but, rather, are biased towards one of the major cost categories (processing, transportation or fixed location costs), the time required to obtain the optimal solution decreases considerably when using the proposed solution methodology as well as the branch‐and‐cut approach. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

调频脉冲信号辐射源多普勒信息提取方法研究

提出了一种基于单脉冲频率及频率变化率联合估计和多脉冲联合估计脉冲重复周期变化率的调频脉冲信号辐射源目标多普勒参数提取方法。该方法解决了无源定位系统数据采样频率与辐射源脉冲重复周期不匹配造成的频率偏差问题,在脉冲到达时间的提取上避免了对脉冲边沿的判断,使得利用中频采样信号计算脉冲重复周期成为可能。介绍对了该方法所采用的频率及频率变化率联合估计关键技术,并在此基础上讨论了该方法所能达到的理论估计精度及误差分析,最后通过仿真试验验证了该方法的可行性和有效性。     

论城市公共安全管理网络平台的建设

针对城市的快速发展,各种突发性自然灾害或人为破坏事件增多,在充分分析城市公共安全管理现状的基础上,提出了城市公共安全管理网络平台建设,并对其总体结构,各自功能,技术、政策支持及运行模式进行了深入论述。     

Generation and storage dispatch in electricity networks with generator disruptions

We present methods for optimizing generation and storage decisions in an electricity network with multiple unreliable generators, each colocated with one energy storage unit (e.g., battery), and multiple loads under power flow constraints. Our model chooses the amount of energy produced by each generator and the amount of energy stored in each battery in every time period in order to minimize power generation and storage costs when each generator faces stochastic Markovian supply disruptions. This problem cannot be optimized easily using stochastic programming and/or dynamic programming approaches. Therefore, in this study, we present several heuristic methods to find an approximate optimal solution for this system. Each heuristic involves decomposing the network into several single‐generator, single‐battery, multiload systems and solving them optimally using dynamic programming, then obtaining a solution for the original problem by recombining. We discuss the computational performance of the proposed heuristics as well as insights gained from the models. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 493–511, 2015