Alleviating time inconsistent behaviors via a competition scheme

Under quasi‐hyperbolic discounting, the valuation of a payoff falls relatively rapidly for earlier delay periods, but then falls more slowly for longer delay periods. When the salespersons with quasi‐hyperbolic discounting consider the product sale problem, they would exert less effort than their early plan, thus resulting in losses of future profit. We propose a winner‐takes‐all competition to alleviate the above time inconsistent behaviors of the salespersons, and allow the company to maximize its revenue by choosing an optimal bonus. To evaluate the effects of the competition scheme, we define the group time inconsistency degree of the salespersons, which measures the consequence of time inconsistent behaviors, and two welfare measures, the group welfare of the salespersons and the company revenue. We show that the competition always improves the group welfare and the company revenue as long as the company chooses to run the competition in the first place. However, the effect on group time inconsistency degree is mixed. When the optimal bonus is moderate (extreme high), the competition motivates (over‐motivates) the salesperson to work hard, thus alleviates (worsens) the time inconsistent behaviors. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 357–372, 2017     

Probabilistic resource pooling games

We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation.     

OQAM/OFDM系统中基于压缩感知的离散导频信道估计方法

针对多径信道条件下,偏移正交幅度调制的正交频分复用(OQAM/OFDM)系统中采用导频序列方式进行信道估计时导频开销较大的问题,提出一种基于压缩感知的离散导频信道估计方法。该方法利用无线信道的稀疏特性,建立基于压缩感知的OQAM/OFDM系统信道估计模型,对离散导频结构进行了优化设计,使较少的导频符号随机分布在子载波上,在接收端利用信号恢复算法实现信道估计。该方法能够显著减少导频数量,并实现高精度信道估计性能,通过实验仿真对比验证了所提方法在慢时变和快时变的无线信道条件下的有效性。     

基于LBP-PCA的多传感器目标识别算法

为了更加有效地提高多传感器图像融合后的识别率,提出一种基于LBP-PCA的多传感器目标识别算法。首先分别对红外和可见光图像进行预处理用以突显出要识别的目标,采用LBP算法提取目标的特征点向量,利用PCA算法进行特征融合,得到降维后的融合特征,最后利用SVM(支持向量机)进行分类和识别。实验仿真结果表明多传感器目标经过LBP-PCA融合后在保持足够数量的有效信息基础上降低了特征的维数,有效地提高了目标识别率。     

坦克直瞄/间瞄射击一体化火控技术

直瞄射击方式是目前坦克采用的主要射击方式。直瞄射击方式受战场通视度及瞄准装置视距的影响,最大射击距离一般在5 km左右。间瞄射击方式不需要直接瞄准目标,不受战场通视度的影响,最大射击距离主要取决于火炮及弹药的性能,一般在10 km以上。未来坦克应具备直瞄射击与间瞄射击一体化能力。通过直瞄/间瞄射击火控技术的对比与分析,提出坦克直瞄/间瞄射击一体化火控方案。一体化火控具有新的技术特色,具有更强的综合作战能力,是未来坦克火控技术发展的一种趋势。     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

Model parameter estimation and residual life prediction for a partially observable failing system

We consider a partially observable degrading system subject to condition monitoring and random failure. The system's condition is categorized into one of three states: a healthy state, a warning state, and a failure state. Only the failure state is observable. While the system is operational, vector data that is stochastically related to the system state is obtained through condition monitoring at regular sampling epochs. The state process evolution follows a hidden semi‐Markov model (HSMM) and Erlang distribution is used for modeling the system's sojourn time in each of its operational states. The Expectation‐maximization (EM) algorithm is applied to estimate the state and observation parameters of the HSMM. Explicit formulas for several important quantities for the system residual life estimation such as the conditional reliability function and the mean residual life are derived in terms of the posterior probability that the system is in the warning state. Numerical examples are presented to demonstrate the applicability of the estimation procedure and failure prediction method. A comparison results with hidden Markov modeling are provided to illustrate the effectiveness of the proposed model. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 190–205, 2015     

面向任务的有人机/无人机协同对地攻击概率模型

有人机/无人机协同对地攻击是未来空对地打击的主要作战样式,如何评估其协同作战的效能是军地双方共同面对的重要课题。首先根据完成对地攻击任务的4个环节建立了对地攻击的总概率模型;然后基于桥联模型建立了各个环节的概率模型;最后给出了一架有人机协同两架无人机对地攻击的算例,并对模型反算、协同与非协同对比以及多波次攻击等问题进行了讨论和分析,验证了模型良好可用性和广泛适用性。     

基于STK/X的航天器悬停应用仿真技术

针对基于STK/Connect典型模式航天仿真时需要同时启动STK软件的局限,在对STK/X组件技术进行深入研究的基础上,采用基于STK/X的仿真模式,通过STK/X组件提供的接口函数和相关交互命令,将STK引擎集成至航天器悬停应用仿真中,从而实现应用程序对仿真场景的控制与调用,并通过分析处理单元对通过交互所获取的STK场景中仿真数据的处理,对航天器悬停应用仿真效能进行了分析。该集成不仅充分利用了STK强大的轨道仿真能力,还有效提高了仿真程序整体效率。     

星载AIS检测概率建模与仿真分析

针对现有星载AIS检测概率低的问题,对星载AIS接收信号冲突和检测概率进行了研究和论证,并对影响检测概率的诸多因素进行了分析。分析了星载AIS与地面AIS的差异性,指出了星载AIS面临的新挑战。重点对星载AIS信号多网冲突问题进行了研究,建立了一种基于船舶分布密度函数的星载AIS检测概率模型。通过分析时隙冲突、船舶动态、轨道高度、天线类型和B类AIS船舶等因素对系统检测概率的影响,为工程设计和性能评估提供了一定参考依据。