Commitment decisions with partial information updating

In this paper, we extend the results of Ferguson M. Naval Research Logistics 8 . on an end‐product manufacturer's choice of when to commit to an order quantity from its parts supplier. During the supplier's lead‐time, information arrives about end‐product demand. This information reduces some of the forecast uncertainty. While the supplier must choose its production quantity of parts based on the original forecast, the manufacturer can wait to place its order from the supplier after observing the information update. We find that a manufacturer is sometimes better off with a contract requiring an early commitment to its order quantity, before the supplier commits resources. On the other hand, the supplier sometimes prefers a delayed commitment. The preferences depend upon the amount of demand uncertainty resolved by the information as well as which member of the supply chain sets the exchange price. We also show conditions where demand information updating is detrimental to both the manufacturer and the supplier. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

A generalization of the weighted set covering problem

We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Optimal power control in a wireless network using a model with stochastic link coefficients

This paper addresses optimal power allocation in a wireless communication network under uncertainty. The paper introduces a framework for optimal transmit power allocation in a wireless network where both the useful and interference coefficients are random. The new approach to power control is based on a stochastic programming formulation with probabilistic SIR constraints. This allows to state the power allocation problem as a convex optimization problem assuming normally or log‐normally distributed communication link coefficients. Numerical examples illustrate the performance of the optimal stochastic power allocation. A distributed algorithm for the decentralized solution of the stochastic power allocation problem is discussed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

基于ML-Ⅱ的指数分布可靠性多层Bayes估计

Bayes估计法是可靠性评估中应用最为广泛的方法之一,指数分布的Bayes验前概率密度函数中的重要参数主要依靠Reformulation法和Box-Tiao法确定,具有较强的主观经验性。基于Beyes估计的基本思想,以试验数据为依据,利用第二类极大似然估计法(ML-Ⅱ估计法)确定Bayes方法中的相关参数,避免了参数确定的主观性。实例表明结果合理,方法客观、可行。     

基于二阶锥规划的MIMO雷达稳健自适应波束形成

针对MIMO雷达自适应波束形成中期望目标导向矢量的失配问题,提出了一种基于二阶锥规划(SOCP)的稳健自适应波束形成算法。该算法首先将1个MN维(M,N分别为发射和接收阵元数)的权矢量分解成2个低维(1个M维和1个N维)权矢量的Kronecker积,然后分别限制实际的目标发射导向矢量和目标接收导向矢量与假定的导向矢量之间的误差范数的边界,通过优化最差性能,利用SOCP求得分解后的2个权矢量,最后再合成原权矢量。通过降维处理,算法在保证波束形成器性能的基础上,有效地降低了运算复杂度。仿真结果验证了算法的有效性。     

舰艇自防御的威胁排序方法研究

威胁评估与排序是舰艇自防御系统必须具备的重要功能。在多指标决策理论的基础上,结合灰色系统理论和逼近理想解方法,提出了灰色逼近理想解的威胁排序算法。首先通过建立舰艇自防御的空中威胁排序指标体系,得到各个指标的隶属度函数,再通过主客观结合的有序二元比较法得到威胁评估指标的权重,最后通过逼近理想解的灰色关联度方法对空中目标进行威胁评估与排序,并研究了分辨系数对威胁排序的影响。通过舰艇自防御防空作战实例证明了算法的有效性和工程实用性。     

编队协同反导决策方案优选

为了充分地调度好编队全部的抗导资源,实现抗导弹群的成功概率最大,在利用随机服务系统理论对编队协同反导决策方案各指标值进行计算的基础上,将"模糊优选理论"与"协同学原理"有机地结合起来,求解了在反舰导弹到达强度与舰空导弹的单发杀伤概率在不同值的情况下,编队协同反导决策方案的隶属度,为编队指挥员进行反导决策方案的优选提供了科学依据。     

随机共振技术在微弱舰船轴频电场信号检测中的应用

针对在强背景噪声中检测微弱舰船轴频电场信号的问题,提出了基于随机共振技术的检测方法.首先,介绍了随机共振利用噪声增强信号能量从而提高信噪比的基本原理,并在此基础上给出了利用随机共振检测微弱周期信号的模型.然后,将低信噪比的船模轴频电场测量数据输入到检测模型并对输出信号作功率谱分析,结果表明:随机共振技术能十分有效地从复杂背景噪声中检测出微弱舰船轴频电场信号,在微弱信号处理领域相比传统方法具有很大的优势.最后,结合检测实例,初步分析了系统参数对随机共振系统输出信号频谱分布的影响,为随机共振技术的进一步工程应用打下了良好的基础.     

一种波束内目标与诱饵 DOA联合估计新方法

拖曳式诱饵干扰下目标和诱饵DOA参数的准确估计是导引头实现目标分选的前提条件。波束内目标和诱饵的存在引起雷达回波混叠和观测耦合,导致常规观测提取与参数测量方法失效。通过挖掘雷达接收回波和、差通道信号条件概率分布协方差所包含的未知参数信息,获得了目标和诱饵DOA估计的解析表达式,针对估计求解中所需相对功率比未知的情况,提出了基于干扰检测、雷达测量与目标跟踪信息辅助循环估计相对功率比的DOA二次联合估计方法。不同干扰条件的仿真实验验证了估计方法的有效性。     

基于实值离散Gabor变换的阶比跟踪滤波

提出了基于实值离散Gabor变换的阶比跟踪滤波方法．分析了阶比跟踪滤波为时频滤波的实质,给出了如何通过实值离散Gabor变换实现阶比跟踪滤波的步骤．通过对仿真信号阶比跟踪滤波前后的时频分布、阶比谱和时域信号对比,证实本方法能有效滤除阶比混叠成分．通过延长信号两端采样长度的方法可以消除阶比跟踪滤波后端点的误差．