阵列雷达自适应多零点单脉冲群目标测角算法

针对阵列体制雷达,由极大似然估计导出自适应多零点单脉冲测角原理。分析发现迭代步长过大导致双零点单脉冲技术在多目标条件下失效,因此提出加权步长改进角度估计的迭代过程,只需要较少计算量就能实现群内多个目标的精确测角。仿真结果表明：该算法在较高信噪比条件下可以精确测量群内三个目标角度,测角误差约为0.15倍波束宽度;当群目标数较多或者目标相位差接近于0时,算法性能下降明显。     

Value management of diagnostic equipment with cancelation,no‐show,and emergency patients

Magnetic resonance imaging and other multifunctional diagnostic facilities, which are considered as scarce resources of hospitals, typically provide services to patients with different medical needs. This article examines the admission policies during the appointment management of such facilities. We consider two categories of patients: regular patients who are scheduled in advance through an appointment system and emergency patients with randomly generated demands during the workday that must be served as soon as possible. According to the actual medical needs of patients, regular patients are segmented into multiple classes with different cancelation rates, no‐show probabilities, unit value contributions, and average service times. Management makes admission decisions on whether or not to accept a service request from a regular patient during the booking horizon to improve the overall value that could be generated during the workday. The decisions should be made by considering the cancelation and no‐show behavior of booked patients as well as the emergency patients that would have to be served because any overtime service would lead to higher costs. We studied the optimal admission decision using a continuous‐time discrete‐state dynamic programming model. Identifying an optimal policy for this discrete model is analytically intractable and numerically inefficient because the state is multidimensional and infinite. We propose to study a deterministic counterpart of the problem (i.e., the fluid control problem) and to develop a time‐based fluid policy that is shown to be asymptotically optimal for large‐scale problems. Furthermore, we propose to adopt a mixed fluid policy that is developed based on the information obtained from the fluid control problem. Numerical experiments demonstrate that this improved policy works effectively for small‐scale problems. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 287–304, 2016     

面向多核网络分组处理系统的线程亲和缓冲区管理机制

基于通用多核架构的网络分组处理系统性能受到诸如分组IO开销高、多核共享内存及进程调度竞争大、页表缓冲表项失效率高等问题的困扰。为此提出一种基于通用多核网络分组处理系统、面向高速分组转发应用的线程亲和缓冲区硬件管理机制,并在网络专用协处理引擎上实现。该机制采用无中断的线程亲和调度策略,将包含控制信息与缓冲区地址信息的描述符和分组数据按照分组处理的线程号链式地对应加载在多个地址连续的共享缓冲区中。基于通用多核和现场可编程门阵列平台进行报文转发测试,实验结果表明,采用线程亲和缓冲区管理机制能使平均报文转发处理性能提升12.4%,有效地降低IO开销和TLB表项失效率。     

球形光电成像系统空间目标跟踪的转台控制

针对光电成像跟踪系统需要超大视场及高机械集成度以满足航空设备对重量和体积的特殊需求,采用球形步进电机作为光电成像跟踪转台的执行机构,提出一种空间目标跟踪的转台控制方法。首先将空间目标的位置转换为三维转动群的群元,群元采用四元数作为三维旋转的数据结构,然后构建转台在空间步进旋转的路径图,并设计在不同空间位置下的目标跟踪方法,仿真结果表明球形转台控制方法进行目标跟踪的有效性,转台可以较快地搜索到通往目标位置的最佳路径,从而实现目标跟踪,跟踪误差取决于目标的具体位置,同时光电传感器在系统存在扰动时进行重新定位有着重要的意义。     

目标网络分层描述与自修复机制研究?

针对目标网络分层建模与自修复机制问题展开研究。首先建立了分层次的作战目标网络模型,在此基础上提出六种维度的指标以评价作战目标网络在攻击前后能力的变化情况;其次,从预警网络层、火力网络层、指控网络层分析探索作战目标体系在遭受攻击后的最优自修复策略;最后,通过模拟攻击实验仿真分析上述自修复机制的可行性。实验结果表明该目标网络的自修复机制相比传统方法,能够更好地发挥剩余节点的作战效能。     

大延时网络中的主动队列管理机制

研究了网络延时对路由器主动队列管理机制的影响,分析了几种典型主动队列管理算法在大延时网络中的性能。在介绍了基于内模补偿的DC-AQM算法的优缺点之后,根据PID控制器延时补偿的Ziegler-Nichols设定方法,提出了ZNDC(Ziegler-Nichols delay compensation)AQM算法并进行了仿真实验验证,实验结果表明算法达到了预期的目标。     

新型冠状病毒肺炎疫情全球爆发期间民众群体心理研究【专题】

本文从认知过程、情绪过程和意志过程这三种心理过程的角度对2020年初席卷全球的新冠肺炎疫情期间的民众群体心理进行数据收集与初步分析,并在此基础上提出疫情期间民众群体心理的管理建议与对策,具体包括：引导对于新冠肺炎疫情的正确群体认知、调节新冠肺炎疫情引起的消极群体情绪和控制可能引发次生危机的社会意志与行为倾向三个方面。     

智能化电子对抗装备发展

当前,智能化武器装备成为世界各国发展的重点,而电子对抗作为新型作战力量将直接影响战争的胜负。文章分析当前电子对抗装备存在的显著不足,论证发展智能化电子对抗装备的迫切性和必要性,明确提出发展智能化电子对抗装备的若干关键技术,阐述智能化电子对抗装备对未来信息化战争的直接影响,以及智能化电子对抗装备未来的发展方向。     

美国空军研究实验室组织管理与科研规划分析

美国空军研究实验室是一个在空中、太空和网络空间领域处于全球领先地位的科研机构,承担着美国空军国防高技术项目的规划、管理和实施工作,是美国空军保持技术优势的重要研究力量。本文剖析了美国空军实验室的使命任务、组织管理和科研规划,总结了实验室在人才培养和科研任务制定方面的经验和方法。     

An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression

Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA.