中程空空导弹可攻击区解算的新方法

建立空空导弹初始发射距离三维预估模型,提出一种空空导弹可攻击区解算的新算法。该算法将空空导弹初始发射距离预估模型与黄金分割法相结合,用导弹初始发射距离预估值构成黄金分割法的初始搜索区间,进行攻击区边界搜索。仿真结果表明,该算法提高了空空导弹可攻击区的精度,降低了边界搜索循环次数,具有有效性。     

E级超级计算机故障预测的数据采集方法

面向未来E级超级计算机,提出用于故障预测的数据采集框架,能够全面采集与计算结点故障相关的状态数据。采用自适应多层分组数据汇集方法,有效解决随着系统规模增长数据汇集过程开销过大的问题。在TH-1A超级计算机上的实现和测试表明,该数据采集框架具有开销小、扩展性好的优点,能够满足未来大规模系统故障预测数据采集的需求。     

一类线性规划模型的求解方法

应用矩阵理论知识得到了一类特殊的线性规划模型的相关定理,给出了一种简便求解方法,讨论了求解方法的推广问题.     

A generic model of motor‐carrier fuel optimization

Fuel optimizers are decision models (software products) that are increasingly recognized as effective fuel management tools by U.S. truckload carriers. Using the latest price data of every truck stop, these models calculate the optimal fueling schedule for each route that indicates: (i) which truck stop(s) to use, and (ii) how much fuel to buy at the chosen truck stop(s) to minimize the refueling cost. In the current form, however, these models minimize only the fuel cost, and ignore or underestimate other costs that are affected by the models' decision variables. On the basis of the interviews with carrier managers, truck drivers, and fuel‐optimizer vendors, this article proposes a comprehensive model of motor‐carrier fuel optimization that considers all of the costs that are affected by the model's decision variables. Simulation results imply that the proposed model not only attains lower vehicle operating costs than the commercial fuel optimizers, but also gives solutions that are more desirable from the drivers' viewpoint. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于垂直线列阵的深海被动目标定深误差

首先研究了在深海环境下,采用三阵元垂直线列阵水声探测系统进行被动目标定深的基本原理。然后分别从随机误差、阵元配置偏差和相干多途水声信道干扰的角度,对被动目标定深的误差源进行了理论分析,并推导了相关公式。通过仿真实验,总结出各误差源对被动目标定深精度影响的规律,为进一步开展被动目标定深研究、提高被动目标定深精度奠定了基础。     

一种连续修正速度方向的导引方法

考虑制导炮弹由身管武器发射，其飞行控制能力和导引信息量有限，基于预测落点位置偏差量来修正速度方向并在控制时间内连续分配导引指令的思想，提出了一种新的三维末制导方法。根据非线性弹道方程组的级数解预测弹丸落点位置，得到落点与目标的偏差，并提出了两种通过此偏差解算当前速度方向修正量的方法。取剩余飞行时间为修正时间，通过将速度方向修正量分配到整个剩余导引段建立了加速度修正公式，以减小导引指令饱和的可能性。通过连续地预测落点和分配加速度指令来实时地导引飞行。仿真结果表明：该导引方法简单可行，精度高，对控制能力要求较低，且具备较好的制导效果和毁伤效果，为该体制制导炮弹的应用提供参考依据。     

Analytic solution for the nucleolus of a three‐player cooperative game

The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

射线追踪法应用于传播预测的研究

近年来,随着射线追踪法的发展,利用精确的3维数字地图,使精确的电波传播预测成为现实。但是这种方法有很大的缺陷,文中从现阶段城市3维地图建立现状和控制成本的角度考虑,探索了结合射线追踪技术和传统电波传播预测方法,借助计算机辅助设计分析,实现传播覆盖预测的一种新方法,并尝试实现了一个工程案例,进行了相关分析。     

基于并行模拟的多核集群系统性能预测和分析

针对多核集群系统所表现出的新的性能特征,提出了面向多核集群系统消息传递应用程序的并行模拟模型并设计、实现了一个并行模拟器MCPSim(Multi-core Cluster Parallel Simulator),MCPSim在功能模型和性能模型上体现了片内核间、结点内片间以及结点间等三个层次上消息通信的特点,同时支持对应用的消息数量、通信量等的百分比分布的profiling功能,采用PRIMEJ、acobi3D、NPB IS以及HPL等Benchmark程序对MCPSim进行了测试,结果表明MCPSim性能预测的精度优于BigSim,同时能够广泛应用于针对多核集群系统消息传递应用程序的性能分析中。     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.