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     

信息不完备群组决策问题的ANP方法

群组决策是一类重要的决策问题,信息不完备的群组决策问题,因为判断矩阵有缺损,传统的AHP不能求解.文中将评价图引入信息不完备的群组决策问题,在此基础上提出用二次规划问题解决在这种情况下的权重确定问题,最后通过ANP的超矩阵得到总排序结果.经过实例检验,证明了ANP方法的正确性与可行性.     

为有源头活水来——“两弹一星”科技英才早年成长的家庭因素

家庭是人才成长的重要因素。“两弹一星”科技英才早年的成长也得益于此,即：深厚的家学渊源——“两弹一星”科技英才早年成长的知识土壤;殷实的家庭经济——“两弹一星”科技英才早年成长的物质基础;优良的家族传统——“两弹一星”科技英才早年成长的文化基因。     

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

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

反导作战管理技术研究

反导作战管理技术是指对反导体系内的传感器和火力资源进行以任务规划为核心的指挥与控制技术,主要包括传感器资源作战管理和火力资源作战管理两大部分。首先对反导作战管理与指挥控制系统的发展情况进行了简要分析,然后针对反导作战管理技术的内涵、主要任务、层次结构进行了系统研究,最后初步探讨了反导作战管理的核心内容和涉及的关键技术。     

Production/distribution system design with inventory considerations

This study addresses the design of a three‐stage production/distribution system where the first stage includes the set of established retailers and the second and third stages include the sets of potential distribution centers (DCs) and potential capacitated suppliers, respectively. In this problem, in addition to the fixed location/operating costs associated with locating DCs and suppliers, we consider the coordinated inventory replenishment decisions at the located DCs and retailers along with the appropriate inventory costs explicitly. In particular, we account for the replenishment and holding costs at the retailers and selected DCs, and the fixed plus distance‐based transportation costs between the selected plants and their assigned DCs, and between the selected DCs and their respective retailers, explicitly. The resulting formulation is a challenging mixed‐integer nonlinear programming model for which we propose efficient heuristic solution approaches. Our computational results demonstrate the performance of the heuristic approaches as well as the value of integrated decision‐making by verifying that significant cost savings are realizable when the inventory decisions and costs are incorporated in the production distribution system design. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 172–195, 2012     

一种新的针对模型误差所致滤波发散的补偿方法

系统模型误差是导致卡尔曼滤波发散的一个很重要的原因,分析了衰减记忆法和限定记忆法两种对模型误差所致滤波发散的补偿方法,通过引入阈值可以将这两种方法进行有机结合,给出了一种新的衰减限定记忆算法。算例分析验证了衰减限定记忆算法在抑制滤波发散方面具有比衰减记忆和限定记忆法更好的性能,并能自适应调整算法所需观测数据数目。     

模糊优选动态规划在稀缺军事资源配置中的应用

在对稀缺军事资源配置问题进行数学描述的基础上,建立起评价指标相对优属度计算模型,实现了局部优选。在此基础上,通过分配目标综合评价模型实现了对局部优选数据的综合处理,最后建立资源分配的动态规划模型实现了对方案的优选。最后通过实例演示了解决该类问题的具体方法和步骤,对部队建设具有一定的参考和应用价值。     

Maximizing the ratio of two convex functions over a convex set

The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions f and g over a convex set X. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound search to guarantee that a global optimal solution is found. While it does not require the functions f and g to be differentiable, it does require that subgradients of g can be calculated efficiently. The main computational effort of the algorithm involves solving a sequence of subproblems that can be solved by convex programming methods. When X is polyhedral, these subproblems can be solved by linear programming procedures. Because of these properties, the algorithm offers a potentially attractive means for globally maximizing ratios of convex functions over convex sets. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Modeling the operation of multireservoir systems using decomposition and stochastic dynamic programming

Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006