幅相调制信号的星座图恢复与调制方式识别

针对幅相调制信号的调制方式识别问题,提出一种基于星座图恢复的算法。该算法估计信号载频及信噪比等参数,并依据波特率和符号定时完成对接收信号的波特率采样;采用一种非数据辅助载频偏差估计方法,以消除载频偏差及相位偏移对星座图恢复的影响;利用平均似然比检测的方法,完成幅相调制信号调制方式的识别。仿真结果表明,与仅考虑信号幅值分布的极大似然算法相比,该算法具有识别性能更优。     

高阶BOC信号多区域鉴别器的无模糊多径抑制算法

传统的高阶BOC信号多径抑制算法的有效收敛区间较小,不利于信号的稳定跟踪,因此提出一种多区域鉴别器的高阶BOC多径抑制算法。在伪码误差为零的附近区域,采用优化的QStrobe多径抑制鉴别器,而在其他区域采用收敛区间较大的正交BOC鉴别器。利用卡尔曼滤波器对跟踪误差进行开环估计,判断误差所处区域并进行鉴别器的实时切换。对BOC(15,2.5)和BOC(14,2)信号的仿真结果表明,该算法能够实现无模糊跟踪,且6 d B衰减多径误差包络面积比传统QStrobe算法分别改善了57%和51%。     

GNSS自适应天线相位中心评估方法

自适应天线在波束形成过程中会引起天线相位中心变化,针对这一问题,提出一种基于可用波束的自适应天线相位中心评估方法。该方法分为三步:设置天线的可用波束门限;在干扰来向均匀分布下,得到天线可用波束门限内相位方向图集合;利用最小二乘法对相位方向图集合进行拟合得到自适应天线的平均相位中心变化量。运用该方法对四种典型的四元阵相位中心进行对比仿真,结果表明,算法可以快速有效地对自适应天线相位中心性能进行评估。另外,通过设置适当的可用波束门限,可以提高自适应天线的相位中心性能。算法的评估结果可以作为GNSS高精度自适应天线阵型选择依据。     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

Validation of a strategy for harbor defense based on the use of a min‐max algorithm receding horizon control law

We present a validation of a centralized feedback control law for robotic or partially robotic water craft whose task is to defend a harbor from an intruding fleet of water craft. Our work was motivated by the need to provide harbor defenses against hostile, possibly suicidal intruders, preferably using unmanned craft to limit potential casualties. Our feedback control law is a sample‐data receding horizon control law, which requires the solution of a complex max‐min problem at the start of each sample time. In developing this control law, we had to deal with three challenges. The first was to develop a max‐min problem that captures realistically the nature of the defense‐intrusion game. The second was to ensure the solution of this max‐min problem can be accomplished in a small fraction of the sample time that would be needed to control a possibly fast moving craft. The third, to which this article is dedicated, was to validate the effectiveness of our control law first through computer simulations pitting a computer against a computer or a computer against a human, then through the use of model hovercraft in a laboratory, and finally on the Chesapeake Bay, using Yard Patrol boats. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 247–259, 2016     

Approximations for heavily loaded G/GI/n + GI queues

Motivated by applications to service systems, we develop simple engineering approximation formulas for the steady‐state performance of heavily loaded G/GI/n+GI multiserver queues, which can have non‐Poisson and nonrenewal arrivals and non‐exponential service‐time and patience‐time distributions. The formulas are based on recently established Gaussian many‐server heavy‐traffic limits in the efficiency‐driven (ED) regime, where the traffic intensity is fixed at ρ > 1, but the approximations also apply to systems in the quality‐and‐ED regime, where ρ > 1 but ρ is close to 1. Good performance across a wide range of parameters is obtained by making heuristic refinements, the main one being truncation of the queue length and waiting time approximations to nonnegative values. Simulation experiments show that the proposed approximations are effective for large‐scale queuing systems for a significant range of the traffic intensity ρ and the abandonment rate θ, roughly for ρ > 1.02 and θ > 2.0. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 187–217, 2016     

On allocating one active redundancy to coherent systems with dependent and heterogeneous components' lifetimes

This article studies coherent systems of heterogenous and statistically dependent components' lifetimes. We present a sufficient and necessary condition for a stochastically longer system lifetime resulted by allocating a single active redundancy. For exchangeable components' lifetimes, allocating the redundancy to the component with more minimal path sets is proved to produce a more reliable system, and for systems with stochastic arrangement increasing components' lifetimes and symmetric structure with respect to two components, allocating the redundancy to the weaker one brings forth a larger reliability. Several numerical examples are presented to illustrate the theoretical results as well. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 335–345, 2016     

Stochastic regret minimization for revenue management problems with nonstationary demands

We study an admission control model in revenue management with nonstationary and correlated demands over a finite discrete time horizon. The arrival probabilities are updated by current available information, that is, past customer arrivals and some other exogenous information. We develop a regret‐based framework, which measures the difference in revenue between a clairvoyant optimal policy that has access to all realizations of randomness a priori and a given feasible policy which does not have access to this future information. This regret minimization framework better spells out the trade‐offs of each accept/reject decision. We proceed using the lens of approximation algorithms to devise a conceptually simple regret‐parity policy. We show the proposed policy achieves 2‐approximation of the optimal policy in terms of total regret for a two‐class problem, and then extend our results to a multiclass problem with a fairness constraint. Our goal in this article is to make progress toward understanding the marriage between stochastic regret minimization and approximation algorithms in the realm of revenue management and dynamic resource allocation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 433–448, 2016     

基于星座图恢复的MQAM信号调制方式识别算法*

针对MQAM信号调制方式的识别问题,提出了一种基于星座图恢复的算法。该算法首先估计信号载频及信噪比等参数,并依据波特率和符号定时完成对接收信号的波特率采样。随后采用一种非判决辅助载频偏差估计方法,以消除载频偏差及相位偏移对星座图恢复的影响。最后利用平均似然比检测的方法,完成MQAM信号调制方式的识别。仿真结果表明,与仅考虑信号幅值分布的极大似然算法相比,该算法具有更优的识别性能。     

Selecting review periods for a coordinated multi‐item inventory model with staggered deliveries

Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T_j periods, one reviews the current stock level of item j and decides on deliveries for each of the next T_j periods, thus incurring an item‐by‐item fixed cost k_j. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T₁, T₂, …, T_N and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001