BackBrowsing Artículos, Comunicaciones, Libros by Subject "THEORETICAL COMPUTER SCIENCE"
Now showing items 1-4 of 4
-
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
(Logical Methods in Computer Science c/o Institut f. Theoretische Informatik, Technische Universität Braunschweig, 2013-03-29)We prove an algebraic preservation theorem for positive Horn definability in aleph-zero categorical structures. In particular, we define and study a construction which we call the periodic power of a structure, and define ... -
Beyond Q-Resolution and Prenex Form: a Proof System for Quantified Constraint Satisfaction
(Technische Universität Braunschweig, Institute of Theoretical Computer Science, 2014)We consider the quanti fied constraint satisfaction problem (QCSP) which is to decide, given a structure and a first-order sentence (not assumed here to be in prenex form) built from conjunction and quanti fication, whether ... -
Robust speed control for a variable speed wind turbine
Barambones Caramazana, Oscar
; González de Durana García, José María; De la Sen Parte, Manuel (ICIC International, 2012-11)
Modern wind turbines are designed in order to work in variable speed opera-tions. To perform this task, these turbines are provided with adjustable speed generators, like the double feed induction generator (DFIG). One of ... -
Sliding mode position control for real-time control of induction motors
Barambones Caramazana, Oscar; ; González de Durana García, José María (ICIC International, 2013-07)
A sliding mode position control for high-performance real-time applications of induction motors in developed in this work. The design also incorporates a simple flux estimator in order to avoid the flux sensors. Then, the ...