无源时差定位算法研究

给出了新的定位算法以提高对目标的定位精度,解决了模糊和无解的问题。对传统的四站三时差定位算法与单站升高体制下五站四时差定位算法进行了理论分析,并给出了仿真结果。比较了采用单站升高条件下新定位算法与最小二乘定位算法以及传统四站三时差定位算法的定位性能。     

遗传算法在阵列天线误差校正及优化中的应用

针对阵元位置误差影响DOA估计算法性能的问题,采用遗传算法寻找阵元的最佳位置进行校正。然后研究了在阵元数一定、放置范围可变和阵元放置范围一定、阵元个数可变的情况下,如何利用遗传算法对阵列进行优化。最后给出了计算机仿真结果。结果表明这种方法可以有效地对天线阵列进行误差校正及优化。     

一种含最优变异的多微粒群优化算法

针对微粒群优化算法中的固有缺点,提出了带有最优变异算子的多微粒群优化算法,采用多个微粒群对目标函数进行寻优,并在寻优过程中对子群中最优微粒引入了最优变异算子。通过这样的处理,算法可以预防早熟收敛并具有更快的收敛速度和更好的局部开发能力。对一组测试函数的模拟实验结果表明,带最优变异的多微粒群优化算法可以摆脱局部最优解对微粒的吸引,在较少的代数内就能够获得好的优化结果。     

基于单DSP实现并行扩维离散Hartley变换算法的研究

提出了一种将N点的一维离散Hartley变换(简称DHT)分解成N0×N1点的二维DHT(其中N=N0×N1)和一些运算量很小的附加运算的并行扩维DHT算法,此算法通过减少数据相关性的方法突破了DSP高效求解快速离散Hartley变换(简称FHT)时问题规模受片内内存容量限制问题,降低了编程复杂性,并在TMS320C80的单处理单元上进行了该算法实现方法的研究.结果表明,理论分析和试验结果吻合,该算法适合在单DSP上实现.     

基于赋时Petri网的自动测试系统建模

提出了利用赋时Petri网(Tim ed Petri Net)对自动测试系统建模和性能分析的方法。采用启发式算法,对系统的可达树进行搜索,实现测试序列的优化,不仅降低了计算的复杂度,而且获得了满意的并行度,提高了自动测试系统的测试效率。     

纯方位系统TMA非线性最小二乘法——理论数学模型与常规算法

对非线性最小二乘法应用于纯方位系统目标运动分析进行了综合评述,介绍了经典的非线性最小二乘法及几种常规算法:高斯—牛顿迭代法,麦夸脱迭代法,自适应非线性最小二乘法,给出了非线性最小二乘法对纯方位目标运动分析的四个数学模型:高度非线性模型,减弱非线性模型,再减弱非线性模型,再进一步减弱非线性模型。     

动能拦截器姿控固体小火箭点火算法设计

使用固体姿控小火箭是实现动能拦截器快响应和高精度姿态控制的最佳方案之一。针对一种新型动能拦截器姿控小火箭布局,提出了点火组合混合搜索算法。描述了动能拦截器姿控小火箭的配置方案,分析了弹体自旋需求。设计了一种结合目标排序法和区间搜索法的点火组合混合搜索算法:当可用小火箭个数较少时,采用目标排序法;当可用小火箭个数较多时,采用区间搜索法。指令力矩近似仿真结果及姿态控制数值仿真结果表明:该算法能够有效地近似指令力矩,实现快速高精度的姿态跟踪。     

Progressive Type‐II censoring and coherent systems

A new connection between the distribution of component failure times of a coherent system and (adaptive) progressively Type‐II censored order statistics is established. Utilizing this property, we develop inferential procedures when the data is given by all component failures until system failure in two scenarios: In the case of complete information, we assume that the failed component is also observed whereas in the case of incomplete information, we have only information about the failure times but not about the components which have failed. In the first setting, we show that inferential methods for adaptive progressively Type‐II censored data can directly be applied to the problem. For incomplete information, we face the problem that the corresponding censoring plan is not observed and that the available inferential procedures depend on the knowledge of the used censoring plan. To get estimates for distributional parameters, we propose maximum likelihood estimators which can be obtained by solving the likelihood equations directly or via an Expectation‐Maximization‐algorithm type procedure. For an exponential distribution, we discuss also a linear estimator to estimate the mean. Moreover, we establish exact distributions for some estimators in the exponential case which can be used, for example, to construct exact confidence intervals. The results are illustrated by a five component bridge system. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 512–530, 2015     

Dynamic pricing in a dual‐market environment

This article is concerned with the determination of pricing strategies for a firm that in each period of a finite horizon receives replenishment quantities of a single product which it sells in two markets, for example, a long‐distance market and an on‐site market. The key difference between the two markets is that the long‐distance market provides for a one period delay in demand fulfillment. In contrast, on‐site orders must be filled immediately as the customer is at the physical on‐site location. We model the demands in consecutive periods as independent random variables and their distributions depend on the item's price in accordance with two general stochastic demand functions: additive or multiplicative. The firm uses a single pool of inventory to fulfill demands from both markets. We investigate properties of the structure of the dynamic pricing strategy that maximizes the total expected discounted profit over the finite time horizon, under fixed or controlled replenishment conditions. Further, we provide conditions under which one market may be the preferred outlet to sale over the other. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 531–549, 2015     

武器装备体系复杂网络模型构建算法

针对武器装备体系的复杂性和网络化趋势,在现有研究基础上构建了以目标为中心的武器装备体系对抗网,基于OODA模型分析了协同式武器装备体系和受控式武器装备体系的异同,提出了以目标为中心的受控式武器装备体系连接结构的构建算法。最后实例验证了算法的可行性,为构建武器装备体系网络提供了新思路。