Robust linear parameter‐varying control of induction motors

The paper deals with the motion control of an induction motor. Because the nonlinear state equations describing the dynamics of such a machine can be embedded into a linear model with the rotor speed ω as a varying parameter, advantage is taken of some recent results on the control of linear parameter‐varying systems, thus ensuring stability independently of how the varying parameter changes in time within a compact set. The adopted control structure consists of a fast inner electric loop that controls the stator currents and an outer mechanical loop that generates the torque acting on the motor shaft. Of crucial importance is the design of the internal model controller for the current loop. In particular, it is proved that an algebraically equivalent electric motor model admits a Lyapunov function that, together with its Lyapunov derivative, is independent of ω and of all motor parameters. This result allows us to find an upper bound on the norm of the Youla–Kucera parameter that ensures robust stability against speed measurement errors. Simulations carried out on a benchmark motor model show that the adopted control strategy performs well. Copyright © 2014 John Wiley & Sons, Ltd.     

Groundwater use in Spain: an overview in light of the EU Water Framework Directive

In semi-arid regions, aquifers provide a series of practical advantages that make them preferential sources of water supply. In Spain, groundwater meets about one-fifth of the total water demand and is used to irrigate over one-third of the total irrigated land. This article examines groundwater use in Spain from the perspective of the EU Water Framework Directive. Analysis of different sector uses suggests that core problems (and solutions) related to groundwater lie in agricultural uses and that the Directive's environmental requirements remain distant from reality on the ground, where economic, political and social reasons prevail on legal obligations set by national and supranational authorities.     

A flexible FPGA implementation for illuminance–reflectance video enhancement

Digital cameras, new generation phones, commercial TV sets and, in general, all modern devices for image acquisition and visualization can benefit from algorithms for image enhancement suitable to work in real time and preferably with limited power consumption. Among the various methods described in the scientific literature, Retinex-based approaches are able to provide very good performances, but unfortunately they typically require a high computational effort. In this article, we propose a flexible and effective architecture for the real-time enhancement of video frames, suitable to be implemented in a single FPGA device. The video enhancement algorithm is based on a modified version of the Retinex approach. This method, developed to control the dynamic range of poorly illuminated images while preserving the visual details, has been improved by the adoption of a new model to perform illuminance estimation. The video enhancement parameters are controlled in real time through an embedded microprocessor which makes the system able to modify its behavior according to the characteristics of the input images, and using information about the surrounding light conditions.     

Experiences with large-scale operational trials of ALTO-enhanced P2P filesharing in an intra-ISP scenario

Application Layer Traffic Optimization (ALTO) has recently gained attention in the research and standardisation community as a way for a network operator to guide the peer selection process of distributed applications by providing network layer topology information. In particular P2P applications are expected to gain from ALTO, due to the many connections peers form among each other, often without taking network layer topology information into account. In this paper, we present results of an extensive intra-ISP trial with an ALTO-enhanced P2P filesharing software. In summary, our results show that—depending on the concrete setting and on the distribution of upload capacity in the network—ALTO enables an ISP to save operational costs significantly while not degrading application layer performance noticeably. In addition, based on our experience we are able to give advice to operators on how to save costs with ALTO while not sacrificing application layer performance at all.     

Proportional and double imitation rules for spectrum access in cognitive radio networks

In this paper, we tackle the problem of opportunistic spectrum access in large-scale cognitive radio networks, where the unlicensed Secondary Users (SUs) access the frequency channels partially occupied by the licensed Primary Users (PUs). Each channel is characterized by an availability probability unknown to the SUs. We apply population game theory to model the spectrum access problem and develop distributed spectrum access policies based on imitation, a behavior rule widely applied in human societies consisting of imitating successful behaviors. We develop two imitation-based spectrum access policies based on the basic Proportional Imitation (PI) rule and the more advanced Double Imitation (DI) rule given that a SU can only imitate the other SUs operating on the same channel. A systematic theoretical analysis is presented for both policies on the induced imitation dynamics and the convergence properties of the proposed policies to the Nash equilibrium. Simple and natural, the proposed imitation-based spectrum access policies can be implemented distributedly based on solely local interactions and thus is especially suited in decentralized adaptive learning environments as cognitive radio networks.     

Shape from defocus via diffusion

Defocus can be modeled as a diffusion process and represented mathematically using the heat equation, where image blur corresponds to the diffusion of heat. This analogy can be extended to non-planar scenes by allowing a space-varying diffusion coefficient. The inverse problem of reconstructing 3-D structure from blurred images corresponds to an "inverse diffusion" that is notoriously ill-posed. We show how to bypass this problem by using the notion of relative blur. Given two images, within each neighborhood, the amount of diffusion necessary to transform the sharper image into the blurrier one depends on the depth of the scene. This can be used to devise a global algorithm to estimate the depth profile of the scene without recovering the deblurred image, using only forward diffusion.