Design of neural network-based estimator for tool wear modeling in hard turning

Hard turning with cubic boron nitride (CBN) tools has been proven to be more effective and efficient than traditional grinding operations in machining hardened steels. However, rapid tool wear is still one of the major hurdles affecting the wide implementation of hard turning in industry. Better prediction of the CBN tool wear progression helps to optimize cutting conditions and/or tool geometry to reduce tool wear, which further helps to make hard turning a viable technology. The objective of this study is to design a novel but simple neural network-based generalized optimal estimator for CBN tool wear prediction in hard turning. The proposed estimator is based on a fully forward connected neural network with cutting conditions and machining time as the inputs and tool flank wear as the output. Extended Kalman filter algorithm is utilized as the network training algorithm to speed up the learning convergence. Network neuron connection is optimized using a destructive optimization algorithm. Besides performance comparisons with the CBN tool wear measurements in hard turning, the proposed tool wear estimator is also evaluated against a multilayer perceptron neural network modeling approach and/or an analytical modeling approach, and it has been proven to be faster, more accurate, and more robust. Although this neural network-based estimator is designed for CBN tool wear modeling in this study, it is expected to be applicable to other tool wear modeling applications.     

基于眨眼持续时间的司机疲劳检测方法

利用红外敏感的摄像机获得司机脸部图像,通过可变性模板匹配的方法对眼睛进行定位,然后利用卡尔曼滤波的方法跟踪眼睛,得到司机的眨眼持续时间参数,以此为依据判断司机是否疲劳.主要研究了其中的图像处理方法--特征提取算法和眼睛定位、跟踪算法.实验结果证明,眨眼持续时间判断是否疲劳的有效指标.     

基于卡尔曼滤波的木材含水率在线估计

为解决木材干燥过程木材含水率检测精度低的问题,提高木材干燥的自动控制水平,针对以含水率为基准的干燥过程,提出了应用卡尔曼滤波进行木材含水率在线估计方法。为验证该方法的有效性：首先建立了基于含水率基准加入高斯噪声数据集的卡尔曼估计模型,并在此模型基础上对实验测得的数值进行了在线估计和比较,结果表明卡尔曼滤波方法具有较好的估计精度。     

强脉冲噪声环境下的多径衰信道估计

提出一种在强干扰脉冲噪声存在下对无线多径信道进行估计的算法.在无线通信系统中,衰落信道可以采用自回归(AR)模型建模,通过RLS算法和自适应Kalman滤波器分别对AR模型的参数进行估计,但是,这两种算法对噪声干扰非常敏感.为了加快RLS算法的收敛性,并有效抑制大脉冲干扰的影响,在算法的改进中引入了抑制因子,用于对脉冲干扰幅度的抑制.仿真结果显示:相比于传统的算法,改进后的算法在联合估计信道时,提高了抵抗大脉冲干扰的能力,加快了待估参数的收敛速度.     

基于带无偏输入的加权融合算法

给出了带输入估计的卡尔曼滤波算法,比较了带输入估计的卡尔曼滤波算法和标准卡尔曼滤波算法的差别,在此基础上提出了一种最优加权的数据融合方法,分析了最优权值的分配原则,给出了最优加权下的多传感器融合算法.该算法首先计算出各个传感器当前的滤波精度,依据各传感器当前时刻的滤波精度分配权值,同时测量方差的时变特性使得每次测量信息得到充分的利用,通过仿真比较了该方法与平均分配权值方法效果的差别,实验结果表明了该算法的有效性.     

一种基于流媒体的实时调度控制算法QFEC

Internet视频业务的普及和用户越来越高的服务需求推动了实时流媒体业务的迅速发展,流媒体业务的服务质量(QoS)成为业界研究的热点.由于网络的复杂性,流媒体的实时调度控制算法是解决流媒体QoS的关键.结合FEC编码技术和Kalman数字滤波技术,提出一种基于QoS的改进FEC调度传输控制算法——QFEC.该算法根据接收方的状态合理调度流媒体业务,并结合Kalman滤波器原理完成传输速率控制.通过算法状态分析,以及实验数据和性能分析表明,该调度算法能够维持视频数据良好的连续传输,降低视频流的丢包率,显著改善流媒体业务的QoS.     

基于SVM和Kalman预测的非线性系统故障预报

针对Kalman预测在非线性系统故障预报中预测误差较大的问题.提出一种基于支持向量机预测新息的Kalman预测方法.根据未知非线性系统的典型变量分析子空间模型进行Kalman预测.采用支持向量机时间序列预测算法预测未来时刻的新息,利用新息进行Kalman单步和多步预报.在连续搅拌反应器上的仿真研究表明:所提出方法能准确地预测较长时间段内故障过程的劣化趋势,预知可能发生的故障,使操作人员有时间采取必要措施消除故障隐患.     

梯度均值预测滤波算法及其应用

测量误差不可避免的存在于各种测量系统之中.针对缓慢变化的测量数据中存在的随机误差,结合传统滤波方法的优点,提出了梯度均值预测滤波算法,阐述了算法的基本思想和流程,并结合桥梁挠度连续测量系统的测量数据进行了滤波实验,结果表明,该算法能够有效去除缓慢变化的测量数据中的干扰信号,滤波效果明显.     

基于加权最小二乘的卡尔曼滤波算法

为了将卡尔曼滤波(KF)应用于非线性系统中,利用了离散采样点将非线性模型线性化.通过加权最小二乘原理.得到近似的线性化模型,再将KF算法应用于这个线性模型中.结果表明,加权最小二乘与KF结合的方法在非线性模型中的计算结果同扩展卡尔曼滤波(EKF)算法接近,且不需要EKF那样求偏导就能很容易地应用到非线性系统中.这种方法实现容易,预测可靠,具有实际应用的价值.     

Processing intrusion detection alert aggregates with time series modeling

The main use of intrusion detection systems (IDS) is to detect attacks against information systems and networks. Normal use of the network and its functioning can also be monitored with an IDS. It can be used to control, for example, the use of management and signaling protocols, or the network traffic related to some less critical aspects of system policies. These complementary usages can generate large numbers of alerts, but still, in operational environment, the collection of such data may be mandated by the security policy. Processing this type of alerts presents a different problem than correlating alerts directly related to attacks or filtering incorrectly issued alerts.We aggregate individual alerts to alert flows, and then process the flows instead of individual alerts for two reasons. First, this is necessary to cope with the large quantity of alerts – a common problem among all alert correlation approaches. Second, individual alert’s relevancy is often indeterminable, but irrelevant alerts and interesting phenomena can be identified at the flow level. This is the particularity of the alerts created by the complementary uses of IDSes.Flows consisting of alerts related to normal system behavior can contain strong regularities. We propose to model these regularities using non-stationary autoregressive models. Once modeled, the regularities can be filtered out to relieve the security operator from manual analysis of true, but low impact alerts. We present experimental results using these models to process voluminous alert flows from an operational network.