基于干涉仪测向的电子侦察卫星单星定位精度分析

针对信息化战场面临的复杂电磁环境,研究基于二维干涉仪测向方法的电子侦察卫星单星定位体制。分析了电子侦察卫星单星定位原理及定位算法,提出了电子侦察卫星单星测向定位精度GDOP算法,通过仿真定量计算卫星测角误差、卫星姿态误差和卫星位置误差对卫星定位精度的影响程度。结果表明电子侦察卫星测角精度、姿态控制精度和位置测量精度越高,单星定位精度越高。     

基于多目标的雷达组网传感器资源管理算法

在雷达组网系统的多目标跟踪过程中,当目标数量过多时,由于传感器资源不足,无法使用传统传感器的管理方法进行资源分配,且运算时间过长,不满足工程实际需求。针对以上问题,提出了一种新的多传感器多目标跟踪任务快速分配算法,该算法将跟踪目标个数和跟踪目标精度作为优化目标,首先按照设定的分配准则对传感器进行一次分配,最大化跟踪目标个数;然后利用一种基于传感器排序的启发式传感器分配方法进行二次分配,通过控制跟踪目标的协方差水平,使目标的跟踪精度尽量接近期望值。仿真结果表明,该算法能够在较短的时间内对多传感器进行有效快速地分配,既跟踪了更多的目标,又达到了期望目标的跟踪精度,并且在一定程度上控制资源消耗,减少系统的总耗能。     

L波段掺铒光纤放大器增益钳制及提高特性研究

报道了一种新型980 nm激光二极管(LD)泵浦高增益的掺铒光纤放大器(EDFA).通过加入中心波长为1 550 nm光纤光栅(FBG)可以明显提高增益,并分析了增益钳制的原理.实验得到其增益比无FBG结构EDFA提高8 dB,并得到了小信号输入时增益25 dB的有效钳制.     

高等数学与后续相关课程的成绩统计及数理分析

高等数学是大学教育中的主要基础课,与后续课程有密切联系。通过成绩统计和相关性分析,说明高等数学与其后续相关课程之间的关系和影响,提出数学教学的想法。     

Demand forecasting by temporal aggregation

Demand forecasting performance is subject to the uncertainty underlying the time series an organization is dealing with. There are many approaches that may be used to reduce uncertainty and thus to improve forecasting performance. One intuitively appealing such approach is to aggregate demand in lower‐frequency “time buckets.” The approach under concern is termed to as temporal aggregation, and in this article, we investigate its impact on forecasting performance. We assume that the nonaggregated demand follows either a moving average process of order one or a first‐order autoregressive process and a single exponential smoothing (SES) procedure is used to forecast demand. These demand processes are often encountered in practice and SES is one of the standard estimators used in industry. Theoretical mean‐squared error expressions are derived for the aggregated and nonaggregated demand to contrast the relevant forecasting performances. The theoretical analysis is supported by an extensive numerical investigation and experimentation with an empirical dataset. The results indicate that performance improvements achieved through the aggregation approach are a function of the aggregation level, the smoothing constant, and the process parameters. Valuable insights are offered to practitioners and the article closes with an agenda for further research in this area. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 479–498, 2013     

对雷达的全极化欺骗干扰技术研究

分析了3种针对单极化假目标的鉴别算法,针对单极化干扰的缺陷,提出并分析了一种干扰极化测量雷达的新技术——全极化干扰,介绍了全极化干扰技术的工作原理,并详细分析了全极化干扰机关键部件的设计。     

设计参数对一包TI蜗杆传动啮合性能的影响

从齿面接触分析的角度,分析了设计参数中心距、模数和蜗轮齿宽对一包TI蜗杆传动啮合性能的影响。结果表明：相对于理想啮合情况,在蜗轮分度圆直径一定的情况下,较大的中心距及较小的模数可以获得较理想的接触线的形状及分布;蜗轮齿宽的变化对接触线和啮合界限线的分布规律没有影响,但会影响接触线的长度。这些结论为合理选择设计参数提供了理论指导。     

线性相依风险下的超额赔款再保险

本文从保险人的角度研究对两类相依风险的超额赔款再保险的最优自留额问题。考虑指数效用函数的货币期望效用原则和自留累积损失的调节系数原则,得到关于这两个问题的最优解的方程。     

含黏砂土渗透系数的3种试验方法浅析

对含黏砂土进行3种试验方法的渗透试验,即变水头渗透试验、常水头渗透试验和一维垂直土柱积水入渗试验,探讨了含黏砂土的渗透系数与干密度之间的函数关系,试验结果表明渗透系数随干密度的增大而呈现指数函数形式的衰减。3种试验方法所得函数形式是一致的,说明3种方法测试含黏砂土的渗透特性都是可靠的。     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000