GBAS中抑制电离层异常的改进自适应Hatch滤波算法

针对单频地基增强系统(Ground Based Augmentation System, GBAS)中电离层异常时Hatch滤波器平滑精度降低问题,系统分析了电离层延时对Hatch滤波器平滑精度的影响,提出一种改进自适应Hatch滤波算法。根据卫星信号计算码载偏离度,并利用二阶线性时不变低通滤波器抑制码载偏离度高频信号,以实现电离层异常实时检测;建立平滑后伪距误差均方根与电离层延时变化率、伪距测量噪声标准差以及平滑时间三者之间的函数模型,并由此确定出Hatch滤波器最优平滑时间。利用GBAS原理样机进行验证实验,结果表明:自适应Hatch滤波算法能够根据卫星信号电离层延时变化率确定滤波器最优平滑时间,且当电离层异常时,自适应Hatch滤波器机载位置误差最大由1.15 m减小为0.43 m,从而验证了所提算法的有效性。     

协方差压缩感知逆合成孔径雷达成像技术

为解决低信噪比条件下短观测时间雷达成像问题,提出一种基于回波协方差矩阵处理的压缩感知逆合成孔径雷达成像技术。该方法构建了回波协方差矩阵层面下的压缩感知问题模型,并通过特定的线性变换降低环境噪声对成像结果的影响。在仿真实验中,通过处理短观测时间和低信噪比条件下的模拟回波数据,该方法获得比传统压缩感知方法像质更好、对比度更强的目标成像结果。同时,其成像结果的目标背景比和背景噪声能量两个雷达图像评价指标都优于传统方法,进一步验证了该方法的有效性。     

圆周合成孔径雷达的快速时域成像算法

为实现圆周合成孔径雷达(Circular Synthetic Aperture Radar,CSAR)快速成像,提出一种用于CSAR的快速时域成像算法。该算法通过将CSAR的圆孔径分成若干子孔径,分别对子孔径采用快速因式分解后向投影算法处理,再将各子图像相干插值叠加至同一坐标系下得到成像结果。详细分析算法实现中的坐标转换、误差控制和运算效率等关键问题,并用点目标仿真和实测数据处理结果验证算法的有效性。所研究方法具有成像范围大、计算量小等优点。     

考虑弹体动态特性的非奇异有限时间制导律

为满足导弹拦截机动目标时交会角约束和有限时间收敛的需求,建立了考虑弹体一阶动态特性的制导模型。把目标加速度视为有界外界干扰,同时结合非线性反步设计法中的动态面法,设计一种考虑弹体动态延迟的非奇异滑模制导律,并且证明了基于Lyapunov稳定性理论制导系统状态可渐进收敛到零。在所设计的制导律下,对单侧机动的低空高速目标进行仿真。仿真结果表明所设计的非奇异制导律可以有效降低弹体动态延迟带来的影响,而且具有较低的脱靶量与交会角误差;与考虑弹体动态特性和交会角约束的最优导引律相比,其具有更高的制导精度。     

Does military spending stimulate growth? An empirical investigation in Italy

This paper investigates the effect of military burden on economic growth and extends previous works on the optimal size of government expenditure by exploring how external threat affects the preferences of the households and, in turn, economic growth. Post World War II Italian data are used to estimate nonlinear growth models using time-series semi-parametric methods. The estimates show that total government and civilian burdens are productive, whereas, military burden has significant effects on economic growth through the expenditure for peacekeeping missions, which reduces the insecurity in the home country. This may justify economically the current not negligible budget devoted to peacekeeping and humanitarian missions.     

并联TBCC动力对高超声速飞行器性能的影响

针对马赫数为6的一级高超声速巡航飞行器的动力需求,提出涡轮/亚燃冲压/双模态超燃冲压组合动力（T/RJ/DMSJ）和射流预冷涡轮/亚燃冲压/双模态超燃冲压组合动力(PCT/RJ/DMSJ)两种方案。在给定的飞行任务下,分析起飞推重比分别为0.8和1.0时,飞行器完成任务时的航程和飞行时间,并对比了PCT/RJ/DMSJ在两种工作模态下的性能。研究结果表明：在相同的起飞推重比下,两种组合动力方案的航程和飞行时间相差不大。当起飞推重比为0.8时,采用PCT/RJ/DMSJ组合动力方案比T/RJ/DMSJ组合动力方案的航程高出3.6%,飞行时间高出3.8%;当起飞推重比为1.0时,PCT/RJ/DMSJ的航程和飞行时间比T/RJ/DMSJ的分别高出4.6%和4.8%。在小推重比下,跨声速段的燃料消耗和飞行时间占整个加速爬升段的比例较大,随着推重比的增加,这个比例减小,巡航可用的燃料比例增大,巡航距离增加,提高起飞推重比可以提高超声速飞行器的航程并缩短飞行时间。     

Optimal control policies in service systems with limited information on the downstream stage

Existing models in multistage service systems assume full information on the state of downstream stages. In this paper, we investigate how much the lack of such information impacts jobs' waiting time in a two‐stage system with two types of jobs at the first stage. The goal is to find the optimal control policy for the server at the first stage to switch between type‐1 and type‐2 jobs, while minimizing the long‐run average number of jobs in the system. We identify control policies and corresponding conditions under which having no or partial information, the system can still capture the most benefit of having full information.     

Trade credit contract in the presence of retailer investment opportunity

This paper presents a model for designing a trade credit contract between a supplier and a retailer that would coordinate a supply chain in the presence of investment opportunity for the retailer. Specifically, we study a newsvendor model where the supplier offers a trade credit contract to the retailer who, by delaying the payment, can invest the accounts payable amount and earn returns. We find that when the channel partners have symmetric information about the retailer's investment return, a conditionally concessional trade credit (CTC) contract, which includes a wholesale price, an interest‐free period, and a minimum order requirement, can achieve channel coordination. We then extend the model to the information asymmetry setting in which the retailer's investment return is unobservable by the supplier. We show that, although the CTC contract cannot achieve the coordination in this setting, it can effectively improve channel efficiency as well as profitability for individual partners.     

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     

A note on efficient sequences with respect to total flow time and number of tardy jobs

For the single‐machine scheduling problem with the objective of simultaneously minimizing total flow time and number of tardy jobs, a lower bound on the number of efficient sequences is known. However, the proof thereof, which makes use of a modified version of Smith's algorithm, is unduly lengthy and sophisticated. Adopting a totally new point of view, we present in this short article a much simpler proof based on the naive idea of pairwise interchange. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 346–348, 2016