基于虚拟时间延迟线阵列的联合频率—到达角二维谱估计

提出基于虚拟时间延时线阵列的联合频率-到达角二维谱估计方法,把经典的子空间方法推广到空时二维域并进行了改进.基本思路是估计空时噪声子空间和空时信号子空间,然后,利用两个空时子空间特征进行频率-到达角联合二维搜索.正常情况下可分辨的信源数远远超出阵元数目;在信号源宽带较大或信号源波长偏离阵列尺寸较远时,不会像经典方法一样出现大的偏差或估计信源角度范围受限;同时给出信号源的频率和到达角估计,更全面地反映了信号特征.     

Allocation of two redundancies in two‐component series systems

The allocation of redundancies in a system to optimize the reliability of system performance is an interesting problem in reliability engineering and system security. In this article, we focus on the optimal allocation of two exponentially distributed active (standby) redundancies in a two‐component series system using the tool of stochastic ordering. For the case of active redundancy, stochastic comparisons are carried out in terms of the likelihood ratio and reversed hazard rate orders. For the case of standby redundancy, a likelihood ratio ordering result is developed. The results established here generalize and strengthen corresponding results in the recent literature. In addition, several numerical examples are used to explicate the results. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

重构X射线脉冲星信号的纯数值模拟新算法

基于X射线脉冲星的导航技术,无论技术研究还是实验验证,都是以X射线脉冲星信号为基础。但是实际的观测数据无法确定其精确值,不便于进行导航算法的分析验证。因此,通过模拟算法重构X射线脉冲星信号十分必要。基于泊松分布建立X射线脉冲星信号模型,介绍脉冲轮廓的构建方法;介绍了两种纯数值的脉冲星信号模拟算法。针对这两种算法因近似导致信号模拟不精确的问题,提出一种基于精确光子流量函数的纯数值X射线脉冲星信号的模拟算法,该算法采用分段线性函数拟合的脉冲轮廓函数,基于分布函数及其反函数导出。模拟算法重构PSR B0531+21脉冲星的信号,并利用χ2拟合优度检验验证模拟算法生成的光子到达时间服从泊松分布。将提出的算法与两种已有的算法进行比较,仿真结果表明从光子数目和脉冲轮廓误差来看,提出的算法都优于其他两种算法,更接近实际信号。由新算法重构的脉冲星信号进行历元折叠得到观测脉冲轮廓,并将其与标准脉冲轮廓比较,发现随着观测时间的增长,观测脉冲轮廓趋近于标准脉冲轮廓,验证了模拟算法是有效可行的。     

Using a birth‐and‐death process to estimate the steady‐state distribution of a periodic queue

If the number of customers in a queueing system as a function of time has a proper limiting steady‐state distribution, then that steady‐state distribution can be estimated from system data by fitting a general stationary birth‐and‐death (BD) process model to the data and solving for its steady‐state distribution using the familiar local‐balance steady‐state equation for BD processes, even if the actual process is not a BD process. We show that this indirect way to estimate the steady‐state distribution can be effective for periodic queues, because the fitted birth and death rates often have special structure allowing them to be estimated efficiently by fitting parametric functions with only a few parameters, for example, 2. We focus on the multiserver M_t/GI/s queue with a nonhomogeneous Poisson arrival process having a periodic time‐varying rate function. We establish properties of its steady‐state distribution and fitted BD rates. We also show that the fitted BD rates can be a useful diagnostic tool to see if an M_t/GI/s model is appropriate for a complex queueing system. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 664–685, 2015     

Inventory models with nonlinear shortage costs and stochastic lead times; applications of shape properties of randomly stopped counting processes

In this article, we study generalizations of some of the inventory models with nonlinear costs considered by Rosling in (Oper. Res. 50 (2002) 797–809). In particular, we extend the study of both the periodic review and the compound renewal demand processes from a constant lead time to a random lead time. We find that the quasiconvexity properties of the cost function (and therefore the existence of optimal (s, S) policies), holds true when the lead time has suitable log‐concavity properties. The results are derived by structural properties of renewal delayed processes stopped at an independent random time and by the study of log‐concavity properties of compound distributions. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 345–356, 2015     

地球静止轨道粗定位的北斗系统接收机快速定位方法

传统全球导航卫星系统信号发射时间的整毫秒恢复算法,在接收机概略位置未知时存在计算量剧增而无法应用的问题。利用北斗系统混合星座中GEO卫星电文速率高的这一特点,提出一种基于GEO粗定位的北斗接收机快速定位的方法。在接收机概略位置完全未知的情况下,使用已获取完整信号发射时刻的纯GEO星座进行粗定位,根据解算获得的概略位置对非GEO卫星发射时刻毫秒整数时间进行恢复,利用所有可见卫星进行精确定位。使用国际全球连续监测评估系统测站观测伪距对算法进行验证,国内测站可100%实现伪距恢复,完成快速定位。仿真遍历中国区域用户,在仿真伪距增加均值为0,标准差为6m噪声,截止仰角为0°时,中国附近区域实现快速定位概率均大于98.68%,其中约80%的中国附近区域可以100%实现卫星信号传输时间恢复并完成快速定位。     

基于改进MUSIC算法的宽带频谱快速感知方法

针对宽带频谱感知中采样率大、感知时间长的问题,在调制宽带转换器采样的基础上提出了一种改进多重信号分类算法的宽带频谱快速感知方法。调制宽带转换器对宽带频谱进行欠奈奎斯特采样,以最小描述长度准则估计信号个数,用改进多重信号分类谱估计信号位置。算法引入调整因子,使得多重信号分类谱中信号位置更为明显,降低了噪声的干扰。整个感知过程无需重构原始波形,无需计算频谱,大大降低了计算量,而且感知算法计算复杂度低,提高了感知效率。仿真结果表明,在低信噪比的情况下,该算法仍具有很好的检测性能。     

Optimal FCFS allocation rules for periodic‐review assemble‐to‐order systems

In Assemble‐To‐Order (ATO) systems, situations may arise in which customer demand must be backlogged due to a shortage of some components, leaving available stock of other components unused. Such unused component stock is called remnant stock. Remnant stock is a consequence of both component ordering decisions and decisions regarding allocation of components to end‐product demand. In this article, we examine periodic‐review ATO systems under linear holding and backlogging costs with a component installation stock policy and a First‐Come‐First‐Served (FCFS) allocation policy. We show that the FCFS allocation policy decouples the problem of optimal component allocation over time into deterministic period‐by‐period optimal component allocation problems. We denote the optimal allocation of components to end‐product demand as multimatching. We solve the multi‐matching problem by an iterative algorithm. In addition, an approximation scheme for the joint replenishment and allocation optimization problem with both upper and lower bounds is proposed. Numerical experiments for base‐stock component replenishment policies show that under optimal base‐stock policies and optimal allocation, remnant stock holding costs must be taken into account. Finally, joint optimization incorporating optimal FCFS component allocation is valuable because it provides a benchmark against which heuristic methods can be compared. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 158–169, 2015     

The dynamic and stochastic knapsack Problem with homogeneous‐sized items and postponement options

This article generalizes the dynamic and stochastic knapsack problem by allowing the decision‐maker to postpone the accept/reject decision for an item and maintain a queue of waiting items to be considered later. Postponed decisions are penalized with delay costs, while idle capacity incurs a holding cost. This generalization addresses applications where requests of scarce resources can be delayed, for example, dispatching in logistics and allocation of funding to investments. We model the problem as a Markov decision process and analyze it through dynamic programming. We show that the optimal policy with homogeneous‐sized items possesses a bithreshold structure, despite the high dimensionality of the decision space. Finally, the value (or price) of postponement is illustrated through numerical examples. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 267–292, 2015     

低信噪比条件下改进ESPRIT方法

在低信噪比时,针对估计信源DOA实时性的问题,提出了一种新的适合于ESPRIT算法的多级维纳滤波器(MSWF)结构,找到了一种能判别信号子空间的方法。首先将多级维纳滤波器(MSWF)与ESPRIT算法相结合,采用多级维纳滤波器(MSWF)的前向递推,得到子空间,不需要通过特征值分解。低信噪比时,针对噪声子空间泄漏到信号子空间的现象,提出一种判别方法,找到了更精确的信号子空间,结合ESPRIT方法实现信号的DOA估计。由于该算法实现了真实的信号子空间的判断,因此,比传统基于MSWF算法具有更高地估计精度。特别是在低信噪比时,增强了算法的实用性,仿真结果证明了算法的有效性。