Search results for " Formal"
showing 10 items of 273 documents
La depresión infantojuvenil: prevención en un Instituto de Enseñanza Secundaria
2017
La infancia se acorta por la actividad a que los adultos someten a los niños/as, y la adolescencia se prolonga artificialmente, porque el período de dependencia económica y psicosocial no coincide con el de autonomía física que se consolida en la pubertad. La sociedad, las familias, la escolaridad, las circunstancias... en muchas ocasiones hacen que los niños/as y adolescentes tengan dificultades de adaptación que se manifiestan en conductas de depresión, que se prolongan o surgen en la adultez. Se proponen las bases de un Programa de (Intervención desde la) Prevención, en un Instituto de Enseñanza Secundaria, desde el Departamento de Orientación, con la colaboración de los tutores del cent…
Robust Predictive Control of a variable speed wind turbine using the LMI formalism
2014
This paper proposes a Robust Fuzzy Multivariable Model Predictive Controller (RFMMPC) using Linear Matrix Inequalities (LMIs) formulation. The main idea is to solve at each time instant, an LMI optimization problem that incorporates input, output and Constrained Receding Horizon Predictive Control (CRHPC) constraints, and plant uncertainties, and guarantees certain robustness properties. The RFMMPC is easily designed by solving a convex optimization problem subject to LMI conditions. Then, the derived RFMMPC applied to a variable wind turbine with blade pitch and generator torque as two control inputs. The effectiveness of the proposed design is shown by simulation results.
Educación artística : revista de investigación
2011
Bajo el título “¿Qué hay del Arte Contemporáneo? ¿Cómo voy a enseñar algo a mis alumnos que ni yo mismo/a entiendo?” se aglutinan dos experiencias educativas ideadas y puestas en práctica en el Museo de Bellas Artes de Granada por un grupo de profesionales provenientes de la Pedagogía y las Bellas Artes, con profesorado y alumnado de Educación Infantil, Primaria, Educación Secundaria Obligatoria y Bachillerato. Éstas fueron confeccionadas tomando como referente dos exposiciones que de materia contemporánea se sucedieron de forma temporal en dicha institución museística entre los años 2009 y 2010, en un intento pedagógico de acompasar los tiempos existentes entre la educación formal, no form…
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
2021
The Burrows-Wheeler-Transform (BWT), a reversible string transformation, is one of the fundamental components of many current data structures in string processing. It is central in data compression, as well as in efficient query algorithms for sequence data, such as webpages, genomic and other biological sequences, or indeed any textual data. The BWT lends itself well to compression because its number of equal-letter-runs (usually referred to as $r$) is often considerably lower than that of the original string; in particular, it is well suited for strings with many repeated factors. In fact, much attention has been paid to the $r$ parameter as measure of repetitiveness, especially to evalua…
On the Number of Closed Factors in a Word
2015
A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We investigate the structure of closed factors of words. We show that a word of length $n$ contains at least $n+1$ distinct closed factors, and characterize those words having exactly $n+1$ closed factors. Furthermore, we show that a word of length $n$ can contain $\Theta(n^{2})$ many distinct closed factors.
Alternating, private alternating, and quantum alternating realtime automata
2014
We present new results on realtime alternating, private alternating, and quantum alternating automaton models. Firstly, we show that the emptiness problem for alternating one-counter automata on unary alphabets is undecidable. Then, we present two equivalent definitions of realtime private alternating finite automata (PAFAs). We show that the emptiness problem is undecidable for PAFAs. Furthermore, PAFAs can recognize some nonregular unary languages, including the unary squares language, which seems to be difficult even for some classical counter automata with two-way input. Regarding quantum finite automata (QFAs), we show that the emptiness problem is undecidable both for universal QFAs o…
Probabilistic verification of all languages
2018
We present three protocols for verifying all languages: (i) For any unary (binary) language, there is a log-space (linear-space) interactive proof system (IPS); (ii) for any language, there is a constant-space weak-IPS (the non-members may not be rejected with high probability); and, (iii) for any language, there is a constant-space IPS with two provers where the verifier reads the input once. Additionally, we show that uncountably many binary (unary) languages can be verified in constant space and in linear (quadratic) expected time.
Inkdots as advice for finite automata
2015
We examine inkdots placed on the input string as a way of providing advice to finite automata, and establish the relations between this model and the previously studied models of advised finite automata. The existence of an infinite hierarchy of classes of languages that can be recognized with the help of increasing numbers of inkdots as advice is shown. The effects of different forms of advice on the succinctness of the advised machines are examined. We also study randomly placed inkdots as advice to probabilistic finite automata, and demonstrate the superiority of this model over its deterministic version. Even very slowly growing amounts of space can become a resource of meaningful use i…
Uncountable realtime probabilistic classes
2017
We investigate the minimum cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for realtime PTMs on unary languages. On binary case, we follow the same result for double logarithmic space, which is tight. When replacing the worktape with some limited memories, we can follow uncountable results on unary languages for two counters.
Zero-Error Affine, Unitary, and Probabilistic OBDDs
2017
We introduce the affine OBDD model and show that zero-error affine OBDDs can be exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain problems. Moreover, we show that Las Vegas unitary and probabilistic OBDDs can be quadratically narrower than deterministic OBDDs. We also obtain the same results by considering the automata versions of these models.