A design of a robust discrete-time controller

In this paper, we proposed a robust discrete-time controller. This control system, which is derived from the idea of the normalized plant, does not include plant parameters. Thus, we obtain a control system independent of plant parameters and that has the same structure as a conventional optimal servo control system. Simulation and experimental results show that the proposed method is fairly robust to plant parameter variations and external disturbances.     

Convergence analysis of the alternating RGLS algorithm for the identification of the reduced complexity Volterra model

In this paper we provide a convergence analysis of the alternating RGLS (Recursive Generalized Least Square) algorithm used for the identification of the reduced complexity Volterra model describing stochastic non-linear systems. The reduced Volterra model used is the 3rd order SVD-PARAFC-Volterra model provided using the Singular Value Decomposition (SVD) and the Parallel Factor (PARAFAC) tensor decomposition of the quadratic and the cubic kernels respectively of the classical Volterra model. The Alternating RGLS (ARGLS) algorithm consists on the execution of the classical RGLS algorithm in alternating way. The ARGLS convergence was proved using the Ordinary Differential Equation (ODE) method. It is noted that the algorithm convergence canno׳t be ensured when the disturbance acting on the system to be identified has specific features. The ARGLS algorithm is tested in simulations on a numerical example by satisfying the determined convergence conditions. To raise the elegies of the proposed algorithm, we proceed to its comparison with the classical Alternating Recursive Least Squares (ARLS) presented in the literature. The comparison has been built on a non-linear satellite channel and a benchmark system CSTR (Continuous Stirred Tank Reactor). Moreover the efficiency of the proposed identification approach is proved on an experimental Communicating Two Tank system (CTTS).     

Physics‐based spectral sharpening through filter‐chart calibration

The spectral overlap of color‐sampling filters increases errors when using a diagonal matrix transform, for color correction and reduces color distinction. Spectral sharpening is a transformation of colors that was introduced to reduce color‐constancy errors when the colors are collected through spectrally overlapping filters. The earlier color‐constancy methods improved color precision when the illuminant color is changed, but they overlooked the color distinction. In this article, we introduce a new spectral sharpening technique that has a good compromise of color precision and distinction, based on real physical constraints. The spectral overlap is measured through observing a gray reference chart with a set of real and spectrally disjoint filters selected by the user. The new sharpening method enables to sharpen colors obtained by a sensor without knowing the camera response functions. Experiments with real images showed that the colors sharpened by the new method have good levels of color precision and distinction as well. The color‐constancy performance is compared with the data‐based sharpening method in terms of both precision and distinction. © 2014 Wiley Periodicals, Inc. Col Res Appl, 40, 564–576, 2015     

浅析火力发电厂汽水系统中内径管与外径管的设计选择

按照管道加工工艺的不同,管道可分为内径控制管和外径控制管。通过热轧工艺生产的外径控制无缝钢管,可满足火力发电厂汽水系统中绝大部分管道的使用要求。对于超(超)临界机组的主蒸汽和高温再热蒸汽管道采用的P91/P92材质的大口径厚壁无缝钢管,由于对材料性能和加工工艺有特殊要求,因此宜采用内径控制管。     

煤矿工业场地道路照明接地系统问题探讨

文章简要介绍了煤矿工业场地的特点和低压配电系统接地方式分类,从安全性、经济性的角度分析了TN接地系统和TT接地系统在道路照明回路中的优缺点。通过对比TN-S系统与TT系统的接地故障电流差异、TN-S接地系统用于道路照明的等电位联结困难程度,总结出煤矿工业场地的道路照明配电系统适宜采用TT接地方式。并且详细阐述了TT接地系统剩余电流动作保护器保护整定方法和灵敏度校验方法,列举了煤矿工业场地道路照明选用TT系统时需要注意的中性线不可重复接地的问题。     

基于聚类的数据加权优化在犯罪预测中的应用

近年来，我国传统暴力犯罪与成年人犯罪呈下降态势，但是，犯罪案由层出不穷。为有效提升公安实践工作中犯罪预测能力，打击各类违法犯罪事件,本文针对犯罪数据，提出一种新型犯罪预测模型。利用密度聚类分析方法将犯罪数据分类，然后进行数据降维提取关键属性生成特征数据，继而对特征数据进行加权优化并采用机器学习的方式对特征数据进行学习，从而预测犯罪案由。实验结果表明，与传统方法相比，本文方法具有更好的预测效果，为公安实践工作中类似案件的侦破和预防，提供新的路径支撑。     

因素空间理论下基点分类算法研究

目前，基于因素空间理论的背景基提取算法计算过程复杂，初始化必须依赖各因素极值，基点数量提取冗余等原因，未能在应用中取得很好效果。为此，结合内点判别法和知识可继承、可扩展的思想，提出一种计算简单、初始化独立、基点数量小的改进的背景基提取算法。然后，利用改进的背景基提取算法构造出一种全新的数据分类算法-基点分类算法，基点分类算法以提取每一类样本的背景基为预测模型，再通过新定义的λ-背景基，优化预测模型。数值实验表明:基点分类算法原理简单、构造难度小、分类模型泛化能力强，预测能力准确率高，同时严格的模型限定区域又能为识别新类别提供新方法。     

Learning fuzzy controllers in mobile robotics with embedded preprocessing

The automatic design of controllers for mobile robots usually requires two stages. In the first stage, sensorial data are preprocessed or transformed into high level and meaningful values of variables which are usually defined from expert knowledge. In the second stage, a machine learning technique is applied to obtain a controller that maps these high level variables to the control commands that are actually sent to the robot. This paper describes an algorithm that is able to embed the preprocessing stage into the learning stage in order to get controllers directly starting from sensorial raw data with no expert knowledge involved. Due to the high dimensionality of the sensorial data, this approach uses Quantified Fuzzy Rules (QFRs), that are able to transform low-level input variables into high-level input variables, reducing the dimensionality through summarization. The proposed learning algorithm, called Iterative Quantified Fuzzy Rule Learning (IQFRL), is based on genetic programming. IQFRL is able to learn rules with different structures, and can manage linguistic variables with multiple granularities. The algorithm has been tested with the implementation of the wall-following behavior both in several realistic simulated environments with different complexity and on a Pioneer 3-AT robot in two real environments. Results have been compared with several well-known learning algorithms combined with different data preprocessing techniques, showing that IQFRL exhibits a better and statistically significant performance. Moreover, three real world applications for which IQFRL plays a central role are also presented: path and object tracking with static and moving obstacles avoidance.     

一种基于Spark的不确定数据集频繁模式挖掘算法

如何在海量不确定数据集中提高频繁模式挖掘性能是目前研究的热点.传统算法大多是以期望、概率或者权重等单一指标为数据项集支持度，在大数据背景下，同时考虑概率和权重支持度的算法难以兼顾其执行效率.为此，本文提出一种基于Spark的不确定数据集频繁模式挖掘算法（UWEFP），首先，为了同时兼顾数据项的概率和权重，计算一项集的最大概率权重值并进行剪枝；然后，为了减少对数据集的多次扫描，结合Spark框架的优点，设计了一种具有FP-tree特征的新颖的UWEFP-tree结构进行模式树的构建及挖掘；最后在Spark环境下，以UCI数据集进行实验验证.实验结果表明本文的方法在保证挖掘结果的同时，提高了效率.