Issues in nonlinear stochastic grey box identification

Grey box identification refers to the practice of identifying dynamical systems in model structures exploiting partial prior information. This contribution reviews a method for stochastic grey box identification and surveys experiences and lessons of applying it to a number of industrial processes. Issues to be addressed include advantages and costs of introducing stochastics into the model, the question of what contribution must be expected from the model designer as opposed to what can be formalized in computer algorithms, and an outlook on future plans to resolve present shortcomings.     

Sensorless control of synchronous reluctance motors using on‐line parameter identification method not affected by position estimation accuracy

This paper presents a novel on‐line parameter identification method for sensorless control of Synchronous Reluctance Motors (SynRMs). Although conventional sensorless control methods based on mathematical models usually need some complex measurements of motor parameters in advance, the proposed identification method does not require them and can be realized on‐line. The proposed method identifies motor parameters under sensorless control, so rotor position and velocity cannot be used to identify these parameters. However, the proposed method does not need rotor position and velocity, and identified parameters are not affected by these estimation errors. The sensorless control using identified motor parameters is realized, and the effectiveness of the proposed method is verified by experimental results. © 2006 Wiley Periodicals, Inc. Electr Eng Jpn, 155(3): 62–69, 2006; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.20258     

Performance analysis of the forgetting factor RLS algorithm

An analysis is given of the performance of the standard forgetting factor recursive least squares (RLS) algorithm when used for tracking time-varying linear regression models. Three basic results are obtained: (1) the ‘P-matrix’ in the algorithm remains bounded if and only if the (time-varying) covariance matrix of the regressors is uniformly non-singular; (2) if so, the parameter tracking error covariance matrix is of the order O(μ + γ²/μ), where μ = 1 - λ, λ is the forgetting factor and γ is a quantity reflecting the speed of the parameter variations; (3) this covariance matrix can be arbitrarily well approximated (for small enough μ) by an expression that is easy to compute.     

基于模块化模型的自适应预失真技术

系统地比较和分析了OFDM传输系统里高功率放大器（HPA）预失真方法的优缺点,提出一种基于模块化模型的有记忆高功率放大器自适应数字预失真方法,该方法分别基于Wiener、Hammerstein和Wiener-Hammerstein模型各自构成一个有记忆HPA的自适应预失真器。从而避免了因分别估计Wiener-Hammerstein模型各个环节特性参数所带来的复杂性。使得有记忆高功率放大器的预失真设计变得简单了。     

Tackling the Password Problem: Image- and Gesture-Based Alternatives to Alphanumeric Passwords

Abstract

Alphanumeric passwords remain a ubiquitous means of user authentication, yet they are plagued by a fundamental problem: Secure passwords are difficult to create and remember. This paper suggests that image- or gesture-based passwords might strike a better balance between security and usability. It examines two such systems that are currently in widespread commercial use and examines alternative approaches that may offer insights for future improvements. Finally, it considers the possibility that touch-screen gesture passwords may become a viable biometric measure, which may allow them to provide multi-factor gesture-based authentication.     

Precise identification of moving vehicular parameters based on improved glowworm swarm optimization algorithm

This paper proposes an indirect method for the identification of moving vehicular parameters using the dynamic responses of the vehicle. The moving vehicle is modelled as 2-DOF system with 5 parameters and 4-DOF system with 12 parameters, respectively. Finite element method is used to establish the equation of the coupled bridge–vehicle system. The dynamic responses of the system are calculated by Newmark direct integration method. The parameter identification problem is transformed into an optimization problem by minimizing errors between the calculated dynamic responses of the moving vehicle and those of the simulated measured responses. Glowworm swarm optimization algorithm (GSO) is used to solve the objective function of the optimization problem. A local search method is introduced into the movement phase of GSO to enhance the accuracy and convergence rate of the algorithm. Several test cases are carried out to verify the efficiency of the proposed method and the results show that the vehicular parameters can be identified precisely with the present method and it is not sensitive to artificial measurement noise.     

Numerical identification of a nonlinear diffusion coefficient by discrete mollification

The discrete mollification method is a convolution-based filtering procedure suitable for the regularization of ill-posed problems. Combined with explicit space-marching finite difference schemes, it provides stability and convergence for a variety of coefficient identification problems in linear parabolic equations. In this paper, we extend such a technique to identify some nonlinear diffusion coefficients depending on an unknown space dependent function in one dimensional parabolic models. For the coefficient recovery process, we present detailed error estimates and to illustrate the performance of the algorithms, several numerical examples are included.     

Dynamical systems identification using Gaussian process models with incorporated local models

Gaussian process (GP) models form an emerging methodology for modelling nonlinear dynamic systems which tries to overcome certain limitations inherent to traditional methods such as e.g. neural networks (ANN) or local model networks (LMN).The GP model seems promising for three reasons. First, less training parameters are needed to parameterize the model. Second, the variance of the model's output depending on data positioning is obtained. Third, prior knowledge, e.g. in the form of linear local models can be included into the model. In this paper the focus is on GP with incorporated local models as the approach which could replace local models network.Much of the effort up to now has been spent on the development of the methodology of the GP model with included local models, while no application and practical validation has yet been carried out. The aim of this paper is therefore twofold. The first aim is to present the methodology of the GP model identification with emphasis on the inclusion of the prior knowledge in the form of linear local models. The second aim is to demonstrate practically the use of the method on two higher order dynamical systems, one based on simulation and one based on measurement data.     

端到端冗余流量消除技术的指纹选择算法研究

为了兼顾服务器端的内存消耗和有效性,在分析了现有端到端冗余流量消除技术中的指纹选择算法后,提出了贪婪指纹选择算法。该算法认为两个数据包中相同片段的邻接片段很有可能也是相同的,基于这一原理,邻接片段的指纹也将被选为代表指纹,有效地避免了在服务器端缓存整个数据包,大大减少了服务器端的内存消耗。仿真实验结果表明,该算法与现有的指纹选择算法相比,能够大大减少服务器端和用户终端的内存消耗,同时冗余消除率在10%-50%之间,与现有算法相近,证明了该算法的有效性。     

An experimental study on the applicability of evolutionary algorithms to craniofacial superimposition in forensic identification

Photographic supra-projection is a forensic process that aims to identify a missing person from a photograph and a skull found. One of the crucial tasks throughout all this process is the craniofacial superimposition which tries to find a good fit between a 3D model of the skull and the 2D photo of the face. This photographic supra-projection stage is usually carried out manually by forensic anthropologists. It is thus very time consuming and presents several difficulties. In this paper, we aim to demonstrate that real-coded evolutionary algorithms are suitable approaches to tackle craniofacial superimposition. To do so, we first formulate this complex task in forensic identification as a numerical optimization problem. Then, we adapt three different evolutionary algorithms to solve it: two variants of a real-coded genetic algorithm and the state of the art evolution strategy CMA-ES. We also consider an existing binary-coded genetic algorithm as a baseline. Results on several superimposition problems of real-world identification cases solved by the Physical Anthropology lab at the University of Granada (Spain) are considered to test our proposals.