虹膜内边缘定位的齿形变换方法

提出了一种新颖简单的虹膜内边缘(瞳孔)定位算法.此算法分别对虹膜图像的每一行进行处理.首先,采用一种简单的齿形变换对虹膜图像每一行的灰度曲线进行变换,变换后的灰度曲线为齿形并且虹膜内边缘点出现在齿形曲线的转折点处.然后,根据在虹膜内边缘点处齿形灰度曲线的斜率由负值变为正值的特点,检测虹膜内边缘点并定位虹膜内边缘的位置.此算法具有新颖、简单、准确和速度快等特点.     

基于仿真实验的弹道导弹阵地优选

合理部署弹道导弹位置对于提高作战效能具有至关重要的作用。基于解析计算的优化方法难以反映环境因素、武器装备的技术和动力特性等不确定性因素对部署位置的影响,求得的结果存在置信度低的问题。故将解析法与仿真实验相结合,以体系对抗条件下弹道导弹作战效能评估的数学模型为基础,建立了由各种作战实体和行动的模型聚合而成的弹道导弹攻防对抗仿真模型,然后通过仿真实验找出最优部署位置,最后给出了应用示例。实验表明该方法具有速度快、效率高、结果清晰直观的特点,可为指挥员提供科学、快速的决策支持。     

基于移动目标的DOA估计偏差校正

针对移动目标的波达方向估计容易出现偏差的问题,提出一种利用频移信息修正方位估计偏差的算法,解决了传统方位估计算法不能适用于高速移动目标或平台的问题。该方法利用基阵平台与目标的径向移动速度,估计中心频率偏移,然后利用频移信息修正传统的方位估计结果。仿真结果表明,该算法可以极大地提高移动目标的方位估计精度。此外,该算法对阵列的阵型和方位估计算法没有任何限制,因此具有广泛的适用性和较强的工程实用价值。     

地球静止轨道卫星系统兼容性多维度分析方法

针对地球静止轨道(Geostationary Satellite Orbit, GSO)卫星系统间的兼容性分析,设计了单波束和多波束GSO卫星系统间的上行及下行干扰场景,并在卫星的轨位、系统链路可用度及干扰系统地球站选址等多维度对GSO卫星系统间的干扰进行了评估,提出了不同轨位间隔条件下满足国际电信联盟干扰协调限值的干扰系统地球站最近选址的建议,细化了各维度研究上的颗粒度,在不同维度间进行横向对比,分析了GSO卫星系统在不同维度下的干扰变化特性曲线和各维度对干扰分析结果的影响程度。在系统链路可用度一定的条件下,两个卫星系统的轨位间隔>2°时,干扰数值变化缓慢;轨位间隔≤2°时,干扰数值变化较快;轨位间隔≤0.1°时,干扰数值急剧上升。以国际电信联盟实际登记的CHNSAT-81.5和INSAT-KA82.5E卫星的网络资料为例,将计算得到的GSO系统波束间的干扰噪声比、载波干扰比与Visualyse软件结果进行验证对比,结果误差保持在0.7 dB范围内,证明该方法具有有效的评估性能。     

舰炮射击海上弹着点声学测量方法及精度仿真

本文提出了利用声传感器测量舰炮射击海上弹着点的方法,并建立了基本方程。对测量系统的原理和测量信息的传输方式进行了分析,在此基础上,对声传感器位置误差、测时误差及二者综合作用对测量精度的影响分别进行了仿真计算,证明测量原理可行,测量精度满足要求。     

信息中心网络缓存节点位置选择算法

信息中心网络（Information-Centric Networking, ICN）“泛在缓存”的特性,引发数据副本率过高、缓存空间不能充分利用等问题。为了解决上述问题,分别从用户、服务提供商和网络运营商的角度出发,以最小化网络流量与网络费用开销为优化目标建立两个单目标优化模型,并将二者结合为帕累托模型;基于帕累托求解方法中数学规划法的思想,详细描述缓存节点位置选择算法。仿真结果表明：在流量性价比方面,所提缓存节点选择算法优于ICN的默认缓存机制;在网络费用开销方面,所提算法更适用于只有少数内容较为流行的网络中,而在所有内容都流行的情况下,ICN中默认的“遍地缓存”机制更为适宜。     

An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

A facility reliability problem: Formulation,properties, and algorithm

Having a robustly designed supply chain network is one of the most effective ways to hedge against network disruptions because contingency plans in the event of a disruption are often significantly limited. In this article, we study the facility reliability problem: how to design a reliable supply chain network in the presence of random facility disruptions with the option of hardening selected facilities. We consider a facility location problem incorporating two types of facilities, one that is unreliable and another that is reliable (which is not subject to disruption, but is more expensive). We formulate this as a mixed integer programming model and develop a Lagrangian Relaxation‐based solution algorithm. We derive structural properties of the problem and show that for some values of the disruption probability, the problem reduces to the classical uncapacitated fixed charge location problem. In addition, we show that the proposed solution algorithm is not only capable of solving large‐scale problems, but is also computationally effective. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

一种基于几何特征的虹膜定位算法

虹膜定位是虹膜识别中基础性环节,其精度和速度决定了虹膜识别系统的性能。为提高虹膜定位的速度,提出一种基于圆几何特征的虹膜内边缘定位算法,利用内外边缘中心的耦合特性缩小微积分方法搜索外边缘的范围。实验结果表明,与经典虹膜定位算法相比,提出的算法快速、精确、鲁棒。     

空基平台无源定位精度分析

针对三维空间内的空基平台对海面目标的无源定位问题,在考虑了多种测量误差因素的条件下,建立了定位模型,分析了各种测量误差对最终定位精度的影响.仿真实验表明,所采用的定位精度分析方法能够有效的分析空基平台的定位精度.从仿真实验结果中得到了各种测量误差对定位精度影响的一些指导性结论,为提高空基平台无源定位的测量精度提供了依据.