Guillermo Fernández-Anaya

Learn More
This paper deals with the master–slave synchronization scheme for partially known non-linear fractional order systems, where the unknown dynamics is considered as the master system and we propose the slave system structure which estimates the unknown state variables. For solving this problem we introduce a Fractional Algebraic Observability (FAO) property(More)
In this work, the dynamical behavior of the US stock markets is characterized on the basis of the temporal variations of the Hurst exponent estimated with detrended fluctuation analysis (DFA) over moving windows for the historical Dow Jones (1928–2007) and the S&P-500 (1950–2007) daily indices. According to the results drawn: (i) the Hurst exponent displays(More)
— In this work an observer structure for a certain class of nonlinear fractional order systems is proposed. For solving this task we introduce a Fractional Algebraic Observability (FAO) property which is used as a main tool in the design of the observer system. We apply our proposals in the master-slave synchronization problem, where the coupling signal is(More)
This paper concerns the experimental evaluation of a PID mixed H 2 /H ∞ control methodology based on the application of genetic algorithms. The considered plant is an experimental DC servosystem affected by disturbances acting on its output, and the performance objective corresponds to the control of the load angular position.
In this paper a procedure is used to tuner two degrees of freedom controllers (PID-ISA) raised as a multiobjective optimization problem (MOP), applying the multiobjective genetic algorithm NSGA-II (MOGA NSGA-II). The objective functions are deployed considering, setpoint response, load disturbances, measurement noises and robustness to model uncertainty
DNA fragment assembly represents an important challenge to the development of efficient and practical algorithms due to the large number of elements to be assembled. In this study, we present some graph theoretical linear time algorithms to solve the problem. To achieve linear time complexity, a heap with constant time operations was developed, for the(More)