A cooperative game in search theory

Search theory originates from the military research efforts of WWII. Most researchers of that period modeled their search games in noncooperative games, where players are enemies or compete against each other. In this article, we deal with a cooperative search game, where multiple searchers behave cooperatively. First we describe several search problems and discuss the possibility of a coalition or cooperation among searchers. For the cooperative search game, we define a function named quasi‐characteristic function, which gives us a criterion similar to the so‐called characteristic function in the general coalition game with transferable utility. The search operation includes a kind of randomness with respect to whether the searchers can detect a target and get the value of the target. We also propose a methodology to divide the obtained target value among members of the coalition taking account of the randomness. As a concrete problem of the cooperative search game, we take the so‐called search allocation game, where searchers distribute their searching resources to detect a target in a cooperative way and the target moves in a search space to evade the searchers. Lastly, we discuss the core of the cooperative search allocation game. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

A branch‐and‐cut algorithm for the nonpreemptive swapping problem

In the Swapping Problem (SP), we are given a complete graph, a set of object types, and a vehicle of unit capacity. An initial state specifies the object type currently located at each vertex (at most one type per vertex). A final state describes where these object types must be repositioned. In general, there exist several identical objects for a given object type, yielding multiple possible destinations for each object. The SP consists of finding a shortest vehicle route starting and ending at an arbitrary vertex, in such a way that each object is repositioned in its final state. This article exhibits some structural properties of optimal solutions and proposes a branch‐and‐cut algorithm based on a 0‐1 formulation of the problem. Computational results on random instances containing up to 200 vertices and eight object types are reported. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

完全非线性函数的原像分布特征

完全非线性函数在密码设计与分析中具有十分重要的作用.利用代数数论的方法,研究一般有限Abel群上完全非线性函数的原像分布特征,给出了一般有限Abel群上完全非线性函数存在的一个必要条件,证明了某些群上不存在完全非线性函数,得到了素数域上完全非线性函数的原像分布.     

多基纯方位目标交叉定位中的非线性最小二乘方法

纯方位目标定位方法广泛应用于被动探测系统中,通常采用最小二乘方法对多基平台交叉定位结果进行估计定位.在纯方位定位估计中的最小二乘方法主要采用线性近似法,但难以满足实用中的非线性特性,因此导致定位精度难以提高.从非线性估计出发,利用牛顿迭代的非线性最小二乘估计算法对交叉定位结果进行估计,保留了二阶以上的观测误差,迭代趋于收敛.仿真结果表明与线性近似法相比,牛顿迭代法提高了定位精度,增强了定位稳定性,有效地改善了多基纯方位目标定位系统的定位性能.     

多因素协调设计提高超视距反舰导弹抗干扰能力

依据超视距反舰导弹的特点和对捕捉概率影响因素的分析,提出一种基于捕捉概率的多因素协调设计的方法,用于提高导弹抗干扰能力.并运用均匀试验设计法统计计算捕捉概率,对仿真结果进行回归分析.最后通过非线性规划对导弹抗干扰能力进行优化计算,论证了该方法的可行性.     

日-地(月)系拉格朗日L1点及晕(Halo)轨道应用

日-地(月)系统拉格朗日L1点及L1点附近的晕(Halo)轨道在"夸父"工程中有重要的应用价值,可用于对太阳实施持续观测.利用数值分析方法,找到了日-地(月)-探测器三者构成的圆限制性三体问题中L1点附近的周期晕(Halo)轨道,分析了轨道的特性.研究结果对"夸父"工程中的目标轨道设计有一定的参考价值.     

一类半线性抛物型方程组解的爆破速率估计

研究了一类具有不同类型反应项的半非线性抛物型方程组初边值问题,这类模型主要描述两种物质燃烧过程中的热传递规律。通过运用古典计算技巧和偏微分方程的定性分析手法,得到了这类半非线性抛物型方程组初边值问题解的爆破速率估计。     

Capacitated warehouse location model with risk pooling

In this article, we introduce the capacitated warehouse location model with risk pooling (CLMRP), which captures the interdependence between capacity issues and the inventory management at the warehouses. The CLMRP models a logistics system in which a single plant ships one type of product to a set of retailers, each with an uncertain demand. Warehouses serve as the direct intermediary between the plant and the retailers for the shipment of the product and also retain safety stock to provide appropriate service levels to the retailers. The CLMRP minimizes the sum of the fixed facility location, transportation, and inventory carrying costs. The model simultaneously determines warehouse locations, shipment sizes from the plant to the warehouses, the working inventory, and safety stock levels at the warehouses and the assignment of retailers to the warehouses. The costs at each warehouse exhibit initially economies of scale and then an exponential increase due to the capacity limitations. We show that this problem can be formulated as a nonlinear integer program in which the objective function is neither concave nor convex. A Lagrangian relaxation solution algorithm is proposed. The Lagrangian subproblem is also a nonlinear integer program. An efficient algorithm is developed for the linear relaxation of this subproblem. The Lagrangian relaxation algorithm provides near‐optimal solutions with reasonable computational requirements for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Clifford分析中K超正则函数的Riemann边值问题

Clifford分析中的函数理论被广泛研究,得到的许多结果推广了经典复分析中解析函数的理论。文中研究了Clifford分析中K超正则函数的Riemann边值问题,得到它的一种表示式和Cauchy积分公式等一些性质,利用转化法和积分方程及不动点原理证明了它的一类Riemann边值问题O解的存在唯一性。     

分物问题的分法数计算

r个物品分配到n个盒子中,在不同的条件下会有不同的分法数。本文讨论了不同条件下,分法数的计算方法。