层次分析法用于战术互联网路由协议选择

选择合适的路由协议是战术互联网建设的一个关键问题,目前的选择方法大多缺乏定量、系统的分析,无法对路由协议的整体性能进行很好的评价.建立了战术互联网路由协议性能评价层次模型,给出实例说明了利用层次分析法对战术互联网路由协议进行选择的方法.对结果的分析表明方法直观、有效,可以实现合理的决策,具有实用价值.     

基于紧迫度的空中目标火分排序模型

分析将基于目标到达时问的威胁排序直接作为防空武器火力分配顺序的不足,提出基于紧迫度的空中目标火分排序思路.给出了来袭目标抗击紧迫度的相关定义,提出了抗击紧迫度的计算方法和步骤,确定了用抗击紧迫度进行火分排序的规则,从而建立起基于目标抗击紧迫度的火分排序模型.解决了传统对空威胁判断结果与防空武器火力分配结合不紧密的问题,可提高水面舰艇对空防御作战的整体效果.     

坦克嵌入式车场射击训练观瞄系统仿真设计

介绍了一种坦克嵌入式射击训练观瞄系统仿真的设计方法及其工程实现。采用高亮度自发光屏微型面发光显示器作为光电信息源,综合运用光学与精密机械技术,实现了坦克嵌入式车场射击训练车/炮长观瞄系统仿真。     

嵌入式训练技术的应用与发展

介绍了嵌入式训练的概念、特点,阐述了嵌入式训练技术的产生、发展和应用,对嵌入式训练技术的基本框架、关键技术进行了较详尽的总结与评述,并对发展趋势进行了展望。     

坦克嵌入式训练系统信息采集与处理技术

以坦克嵌入式训练为对象,分析了训练中信息采集与处理任务的功能及特点,并结合某新型坦克的技术特点,提出了信息采集与处理任务的需求,建立了分布式附加结构的信息采集处理模型。模型采用模块化和总线互联结构,由功能独立的主控单元和采集单元构成,保证了实车信息采集与处理的实时性和可靠性。     

亚波长谐振腔实现方法研究

谐振腔作为微波器件与天线的基本组成部分,其小型化对于微波系统的尺寸缩减具有重要意义。文章理论分析了实现亚波长谐振的条件,并结合最新的人工电磁介质(MTMs),分析了单负介质(SNG)、双负介质(DNG)部分填充结构的亚波长谐振特性。     

例析新疆民俗数学与课程资源开发

新疆民俗数学是新疆各少数民族在长期的发展过程中,通过其独特的生产和生活方式创造、积累和传承下来的,具有鲜明民族特色和宗教内涵的数学文化以及独特的数学思想和思维方式.对于民俗数学的研究,一方面是通过对这些集数学知识与传统文化于一体的“文化载体”的搜集、整理和分析,以实现保护和传承之目的;另一方面则关注民俗数学研究成果的教育学转化,在充分考虑新疆少数民族儿童数学认知思维特征以及数学双语教学原则、方法等的基础上,通过实现民俗数学的“课程化”,以弥补当前新疆少数民地区以“主流文化”为主导的数学课程对少数民族传统文化的“缺失”,进而推进本地区基础教育课程改革和数学教育质量的提升.文章以新疆清真寺砖饰中的几何纹饰为例,就上述两方面的问题进行了论证.     

基于改进 Gerstner 波的岛礁近岸波浪实时仿真?

为了实现岛礁附近波浪实时仿真,结合 Gerstner 波和水波动力学知识,提出了一种能够模拟波浪卷曲和折射绕射现象的波浪建模与绘制方法。首先,建立 Gerstner 波参数随水深变化关系,构建模拟波浪卷曲过程的几何模型;然后,定义岛礁地形对波浪传播的阻障和遮挡系数,并据此修正波浪传播的波向和波高,实现折射和绕射现象的仿真;最后,应用着色器缓存技术完成计算的硬件加速,并构建了基于视点的波浪传播多分辨率绘制策略。实验结果表明,该方法对波浪的卷曲和折射绕射现象取得了较好的仿真效果,绘制效率能够满足实时性要求。     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 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