组网雷达中微多普勒效应分析与仿真

微动产生的微多普勒特征是弹道目标微动参数提取与识别的重要依据。首先基于组网雷达,分析弹道目标中3种典型的微动模型,得到微距离关于雷达观测视角的参数化表示,然后分别针对窄带雷达和宽带雷达作回波分析,最终得到雷达观测到的弹道目标微多普勒效应与雷达观测视角以及信号参数的关系,后面的仿真验证了理论分析的正确性。     

当代大学生消费行为调查与分析研究

大学生是社会消费群体中的重要组成部分,随着社会发展,大学生的消费行为呈现多元化和复杂性特征,其消费意识、消费观念、消费方式已经发生明显的变化。通过对现代大学生消费行为的调查分析,了解大学生消费行为的现状、特点及其原因,并提出了大学生合理消费行为的建议与对策。     

《兵团教育学院学报》2009-2013年载文计量分析

《兵团教育学院学报》作为主要反映本校教学、科研及兵团中小学教育教学成果为内容的综合性学术理论刊物,在推动学校的学科建设、学术研究、培养人才及促进兵团各级各类教育发展等方面发挥着重大作用。本文对学报2009-2013刊登的学术论文进行了计量分析,厘清学报的发展脉络,同时也发现了学报中存在的一些问题如:特色栏目不突出,高质量稿源匮乏,学报宣传力度不大等并提出相应解决措施。     

基于特征相似度的同步发电机绝缘故障诊断

以同步发电机为分析对象,利用粗糙集可有效地处理和分析不精确的信息和知识的优点,从历史信息和决策中进行了特征量选取以及属性约简.对于无法处理的属性约简,采用条件限制得到能够有效反映属性的重要程度特征量,并以此计算特征量权重系数,消除主观因素的影响.在此基础上,针对励磁绕组绝缘故障,选择与设备健康状态直接相关特征作为判断对象,与同机组历史数据进行相似度分析,计算得到了其故障因子.设计出快速判断相关状态的算法,给出了判定准则并进行了编程实现.实验验证表明:该诊断算法能够对设备故障进行有效判定.     

超效率DEA模型在武器装备方案选择中的应用

针对武器装备方案选择过程中的常见问题,利用超效率DEA方法构建武器装备方案选择问题的综合评价模型.以雷达装备方案选择为例,从相对有效性和有效决策单元的排序两个方面,验证方法的正确性和可行性,从而为选择最适合我军作战需求的武器装备方案提供科学依据.     

基于奇异谱分析的盲源分离单通道语音增强算法研究

针对盲源分离算法无法直接对单路含噪语音信号进行分离的问题,提出一种基于奇异谱分析的盲源分离单通道语音增强算法.通过对单路含噪语音信号进行奇异谱分析,将其低频分量作为第二路观测信号,利用改进的最大信噪比盲源分离算法进行处理,从而实现语音信号和噪声的分离.实验结果表明,该算法能够有效抑制噪声,提高信噪比,起到良好的语音增强效果.     

装备分布式虚拟维修训练仿真负载平衡研究

基于HLA的装备分布式虚拟维修训练过程极易产生仿真节点负载失衡,以往的负载平衡研究多关注资源利用率,仿真运行过程中可能会因节点负载的不均衡进行频繁的负载调度,影响仿真运行效率.针对此问题,以保证仿真节点的高效运行为首要目的,将负载平衡定义为不存在超载节点即为平衡,提出了一种动静结合的复合式负载平衡调度方法.研究了复合式负载平衡系统的体系结构,采用最小连接调度法实现了节点静态负载的粗粒度平衡,引入仿真运行比率分量参数表征负载量值,进而设计了动态负载平衡算法对仿真运行过程进行实时监控和调度.实验结果表明,改进后仿真平衡调度频率明显下降,实现了资源利用率和仿真效率的平衡兼顾,取得了良好的效果.     

装甲装备器材库存超(欠)储状态分析与程度评价

定义了装甲装备器材库存超(欠)储的概念,提出了维修保障资源点器材储存状态的定性判别和量化方法;考虑数量、时间、空间等影响因素,提出了资源点维修器材超(欠)储程度的评价指标和评价方法,并结合某军区实际数据进行了验证。结果表明:资源点的平均超(欠)储程度反映了保障体系内所有资源点库存偏离正常水平的平均程度,可为确定调剂资源点的优先次序和供应数量提供依据。     

Optimal control of noncollaborative servers in two‐stage tandem queueing systems

We consider two‐stage tandem queueing systems with dedicated servers in each station and a flexible server that is trained to serve both stations. We assume no arrivals, exponential service times, and linear holding costs for jobs present in the system. We study the optimal dynamic assignment of servers to jobs assuming a noncollaborative work discipline with idling and preemptions allowed. For larger holding costs in the first station, we show that (i) nonidling policies are optimal and (ii) if the flexible server is not faster than the dedicated servers, the optimal server allocation strategy has a threshold‐type structure. For all other cases, we provide numerical results that support the optimality of threshold‐type policies. Our numerical experiments also indicate that when the flexible server is faster than the dedicated server of the second station, the optimal policy may have counterintuitive properties, which is not the case when a collaborative service discipline is assumed. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 435–446, 2014     

Optimal patrol to uncover threats in time when detection is imperfect

Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014