An inspection game: Taking account of fulfillment probabilities of players' aims

This paper deals with an inspection game of customs and a smuggler. The customs can take two options of assigning a patrol or not. The smuggler has two strategies of shipping its cargo of contraband or not. Two players have several opportunities to take actions during a limited number of days. When both players do, there are some possibilities that the customs captures the smuggler and, simultaneously, the smuggler possibly makes a success of the smuggling. If the smuggler is captured or there remain no days for playing the game, the game ends. In this paper, we formulate the problem into a multi‐stage two‐person zero‐sum stochastic game and investigate some characteristics of the equilibrium solution, some of which are given in a closed form in a special case. There have been some studies so far on the inspection game. However, some consider the case that the smuggler has only one opportunity of smuggling or the perfect‐capture case that the customs can certainly arrest the smuggler on patrol, and others think of a recursive game without the probabilities of fulfilling the players' purposes. In this paper, we consider the inspection game taking account of the fulfillment probabilities of the players' aims. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

某地地导弹控制回路参数测试系统设计

针对导弹的定型试验,介绍了一种通用的地地导弹系统数据采集方案,并对其中所遇到的关键问题加以阐述,对各种火控系统的定型设备研制具有一定的参考价值     

Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017     

固体零温零压密度的估算

固体在零温零压下的密度是一个重要的物态参数。本文利用Ｄｅｂｙｅ理论给出了零温零压密度的一种估算方法,并对８２种物质的零温零压密度进行了计算。     

高炮瞄准具性能综合测试系统的实现

前置角的准确度是表征高炮瞄准具综合性能的重要指标,而在现有条件下无法对其进行精确测试。为此设计一性能综合测试系统,根据在最佳零位和空回条件下高炮前置角测试结果与理论值间的偏差值,实现对瞄准具性能的准确评估。     

超低空目标侦察与数字化火控技术的发展前景

低空、超低空目标的日益增多,促进了超低空目标侦察技术和防空兵火控观念的改变.对雷达超低空侦察技术、被动声纳超低空预警技术、地面防空兵器数字化火控技术3个方面的发展前景进行了详细论述.     

利用验前信息的一种序贯检验方法——序贯验后加权检验方法

序贯验后加权检验方法是Bayes 统计观点在假设检验中的运用。本文提出了该方法的一般理论,给出了当总体的分布参数具有验前信息时的序贯检验方法。文中确定了决策区的划分,同时讨论了序贯截尾方案,给出了检验中可能犯两类错误的概率的上界,并将一般理论应用于产品的可靠性检验和再入飞行器随机落点的精度鉴定。由于运用了验前信息,因此能有效地在少量试验之下进行统计假设检验。本文所提供的方法对于昂贵产品试验结果的统计评定具有普遍意义。     

一类二阶Hamilton系统周期解的存在性

Hamilton系统是非线性科学中的一个重要领域,很多人在超二次或次二次条件及其他一些条件下对Hamilton系统的周期解进行了研究。此文则研究了非自制二阶Hamilton系统在零点局部环绕及“非二次”条件下周期解的存在性,并利用局部紧性条件(C)条件以及极大极小方法证明了其周期解的存在性。     

Revenue maximization in two-station tandem queueing systems

We study optimal pricing for tandem queueing systems with finite buffers. The service provider dynamically quotes prices to incoming price sensitive customers to maximize the long-run average revenue. We present a Markov decision process model for the optimization problem. For systems with two stations, general-sized buffers, and two or more prices, we describe the structure of the optimal dynamic pricing policy and develop tailored policy iteration algorithms to find an optimal pricing policy. For systems with two stations but no intermediate buffer, we characterize conditions under which quoting either a high or a low price to all customers is optimal and provide an easy-to-implement algorithm to solve the problem. Numerical experiments are conducted to compare the developed algorithms with the regular policy iteration algorithm. The work also discusses possible extensions of the obtained results to both three-station systems and two-station systems with price and congestion sensitive customers using numerical analysis.     

OFDM系统中基于补零DFT信道插值算法的研究

针对OFDM系统中基于补零DFT实现信道插值的算法,对传统的时域方法和变换域方法进行了分析,并提出了一种新的补零方法。首先通过理论分析指出传统的基于补零DFT实现信道插值算法中,时域方法和变换域方法是等效的;通过对信道插值算法中冲激响应估计序列进行补零的分析,指出补零操作是为了重构出冲激响应的N点采样序列(N表示总子载波数),并针对传统补零方法在一定条件下产生的重构误差,提出了一种新的补零方法。仿真结果表明以上理论分析是正确的,新补零方法可以减小一定条件下的重构误差,增强信道插值算法对信道延迟分布的鲁棒性,有效提高系统的性能。