战术互联网模拟训练系统军事总体问题研究

军事总体设计是技术总体设计的基础,是模拟训练系统设计的首要任务.对于战术互联网模拟训练系统军事总体设计中的有关问题,采用对比和比较法,对系统军事总体需求和框架进行了研究,明确了战术互联网模拟训练系统的训练方式、使用流程、功能体系等内容,为下一步系统的技术总体方案设计以及实现奠定了良好基础.     

Reformulating zero-sum games with multiple goals

This paper investigates the two-person zero-sum multiple payoff game in which the objective is to minimize a player's total underachievement from a fixed set of goals. It is demonstrated that a previous formulation of this problem can be substantially simplified.     

Equivalence relations in the theory of repetitive consumption

Preference for food in the function of the time since last consumption and total preference in the function of eating frequency are equivalent mathematical representations of attitudes governing food consumption. The observed and postulated properties of these functions imply a formal correspondence between preference maximizing and variety seeking behavior.     

影响图建模算法的改进

影响图建模方法是一种规范化的复杂系统建模方法,其实质是将表征复杂系统的参量及参量间的耦合关系进行分类,并以此为基础建立系统的数学模型.影响图建模算法就是将系统的参量及参量间的耦合关系进行分类的算法.目前使用的算法是James R.Burns于1979年提出的.该算法仅考虑了最小的反馈回路,而没有考虑影响图中存在的一般反馈回路,且一些操作造成了不必要的循环.在分析该算法的基础上,考虑了一般的反馈回路,并对原算法的操作步骤进行了优化重组.     

The orienteering problem

Orienteering is a sport in which start and end points are specified along with other locations. These other locations have associated scores. Competitors seek to visit, in a fixed amount of time, a subset of these locations on the way from the start point to the end point in order to maximize the total score. An effective center-of-gravity heuristic is presented that outperforms heuristics from the literature.     

空投设备气囊缓冲系统的缓冲特性分析与匹配方法

采用解析分析法,根据排气口流量方程和载荷运动方程建立了无量纲的空投设备气囊缓冲过程数学模型,并根据此模型构造了气囊的匹配设计图。讨论了排气口面积、气囊高度、着陆初速度、载荷质量、气囊底面积及排气口开启压力等参数对气囊缓冲性能的影响,提出了空投设备气囊缓冲系统的参数匹配设计方法,为空投设备气囊缓冲系统的匹配设计提供了技术支持。     

Optimal set partitioning,matchings and lagrangian duality

We formulate the set partitioning problem as a matching problem with simple side constraints. As a result we obtain a Lagrangian relaxation of the set partitioning problem in which the primal problem is a matching problem. To solve the Lagrangian dual we must solve a sequence of matching problems each with different edge-weights. We use the cyclic coordinate method to iterate the multipliers, which implies that successive matching problems differ in only two edge-weights. This enables us to use sensitivity analysis to modify one optimal matching to obtain the next one. We give theoretical and empirical comparisons of these dual bounds with the conventional linear programming ones.     

Many‐player rendezvous search: Stick together or split and meet?

Rendezvous search finds the strategies that players should use in order to find one another when they are separated in a region. Previous papers have concentrated on the case where there are two players searching for one another. This paper looks at the problem when there are more than two players and concentrates on what they should do if some but not all of them meet together. It looks at two strategies—the stick together one and the split up and meet again one. This paper shows that the former is optimal among the class of strategies which require no memory and are stationary, and it gives a method of calculating the expected rendezvous time under it. However, simulation results comparing both strategies suggest that in most situations the split up and meet again strategy which requires some memory leads to faster expected rendezvous times. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:710–721, 2001