Adaptive random search for continuous simulation optimization

We present, analyze, and compare three random search methods for solving stochastic optimization problems with uncountable feasible regions. Our adaptive search with resampling (ASR) approach is a framework for designing provably convergent algorithms that are adaptive and may consequently involve local search. The deterministic and stochastic shrinking ball (DSB and SSB) approaches are also convergent, but they are based on pure random search with the only difference being the estimator of the optimal solution [the DSB method was originally proposed and analyzed by Baumert and Smith]. The three methods use different techniques to reduce the effects of noise in the estimated objective function values. Our ASR method achieves this goal through resampling of already sampled points, whereas the DSB and SSB approaches address it by averaging observations in balls that shrink with time. We present conditions under which the three methods are convergent, both in probability and almost surely, and provide a limited computational study aimed at comparing the methods. Although further investigation is needed, our numerical results suggest that the ASR approach is promising, especially for difficult problems where the probability of identifying good solutions using pure random search is small. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Averaging frameworks for simulation optimization with applications to simulated annealing

We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

模糊识别和随机森林算法在柴油机振动信号状态识别中的应用

针对模糊识别算法中,样本特征向量中各参量(分量)对状态分类的贡献权重难以确定的问题,提出了利用随机森林算法对特征参量的重要度评估结果作为特征权重的方法。通过对柴油机台架试验振动信号的跟踪分析,获得了柴油机在磨合期、100摩托小时、200摩托小时、300摩托小时及400摩托小时5种不同使用期(典型状态)的75个振动信号样本,然后计算出各类样本在幅域、时域和频域的特征参量,利用随机森林算法进行特征选择,确定4个重要特征参量及其权重,用统计方法得出其隶属度函数,最后根据评价向量对样本进行识别,识别准确率达到94%以上。     

一种基于MMMA的双模式变步长盲均衡算法

针对传统修正恒模算法(MCMA)收敛速度慢、剩余码间干扰大的缺点,在双模式修正恒模算法(MCMA+DD-LMS)的基础上引入局部信息量和变步长的思想,提出了一种基于修正多模算法(MMMA)的双模式变步长修正多模算法(VS-MMMA+DD-LMS)。经过理论分析和实验仿真,证明改进后的算法较传统算法具有更好的均衡效果。     

模糊离散变结构控制系统研究

系统研究了模糊离散变结构控制的设计方法,提出了几种具体设计方案.对于变结构控制而言,模糊逻辑的引入可以使滑模(变结构)控制具备推理和学习能力,控制信号得以柔化,能够减轻或避免一般滑模控制的抖振现象;对于模糊控制而言,滑模控制思想的引入可以大大简化控制结构,保证控制系统的鲁棒稳定性,对模糊控制系统的设计和性能分析提供了一种工具.     

基于参数辨识的电动舵机系统健康仿真和评估

针对目前电动舵机系统故障诊断方法不能有效预测缓变故障,提出基于舵机系统模型的状态变量检测法对飞行器常用的执行机构电动舵机系统进行健康分析与仿真评估。分析电动舵机系统子系统电机本体、控制器、传动机构的常见故障,对其中反映系统性能的关键参数进行数学建模;通过对系统注入不同的健康参数得到相关故障状态下的状态变量特征,进而作为定位故障源的知识库,引入健康因子评估故障参数的变化趋势;仿真算例选择电机本体的主要物理参数电机绕组阻值和反映永磁体性能的电机力矩常数作为健康因子,通过定位知识库建立的健康因子评估算法验证了方法的可行性。     

再入飞行器落点准确度的统计分析

本文研究再入飞行器的落点准确度(系统性偏差)的检验和估计方法。首先,文中引入了准确度的容许限的概念,在此基础上给出了Bayes验后加权概率比检验方法。关于落点系统偏差的估计,讨论了Bayes估计方法及带有约束的Bayes估计方法。文中注意了充分运用试验前的信息,以便使落点系统偏差的评估能在小子样场合下进行。     

随机-区间混合不确定性单输出模型确认指标

针对既有随机变量又有区间变量的模型预测结果与实验数据之间的一致性度量问题,对随机-区间混合不确定性模型确认指标进行研究。根据工程数学模型和实验过程中的不确定性来源,分析随机-区间混合不确定性模型确认的特点;运用概率方法和区间理论,提出新的随机-区间混合不确定性模型确认指标,讨论所提指标的性质,给出指标的计算方法和步骤。通过数字算例和工程算例,验证了所提指标的可行性和有效性。     

混沌随机频率步进信号分析与处理

混沌具有类随机性、对初值敏感、易于产生和控制,频率步进信号易于工程实现和处理,结合二者的优势,提出一种基于混沌序列的随机频率步进雷达信号。介绍了信号产生模型,从理论上推导、分析了该信号的模糊函数和互相关函数性能,给出了信号直接相关和先排序存储、后匹配滤波两种回波处理方法。应用四种典型混沌进行数值仿真,并和已有的线性频率步进信号、高斯和均匀随机频率步进信号进行对比分析。结果表明,混沌随机频率步进信号具有较优良的性能,是一种有潜力的雷达信号。     

GSVM:一种支持Gather/Scatter的向量存储器

宽单指令多数据流(Single Instruction Multiple Data, SIMD)架构数字信号处理器一般都能高效支持地址连续或等距跨步等规则应用的向量访存,但对于科学与工程计算中广泛存在的不规则应用的数据访存则带宽利用率往往较低,从而大幅降低了其整体运算能效。为了提高不规则应用的向量访存性能,基于某SIMD数字信号处理器的体系结构,设计了一种支持Gather/Scatter访存的向量存储器GSVM。通过设计与SIMD宽度相匹配的向量地址计算单元和合适深度的冲突缓冲器阵列,实现了Gather/Scatter指令向量地址计算、仲裁与缓存的全流水访存操作。实验结果表明,相比以前不支持Gather/Scatter访存的存储器,GSVM在增加22%的硬件代价基础上,基于稀疏矩阵向量乘的测试程序集获得了2～8的性能加速比。