Passive Microstrip Transmitarray Lens for Ku Band

The aim of this paper is to introduce a novel 12 GHz radiating design based on the idea of transmitarray lens device. In this document, an overview of the functioning of this kind of devices is given and the proposed transmitarray lens is studied, with architecture discussion and selection, as well as some ideas about the design, and manufacturing. In the document, some design, manufacturing and validation of the constituting elements of the lens (radiating elements, transmission circuits and transitions) are presented, together with a complete prototype of assembled transmitarray lens. Radiation pattern measurements in anechoic chamber, as well as gain and directivity values are offered

An Efficient Maximization Algorithm With Implications in Min-Max Predictive Control

n this technical note, an algorithm for binary quadratic programs defined by matrices with band structure is proposed. It was shown in the article by T. Alamo, D. M. de la Pentildea, D. Limon, and E. F. Camacho, ldquoConstrained min-max predictive control: modifications of the objective function leading to polynomial complexity,rdquo IEEE Tran. Autom. Control , vol. 50, pp. 710-714, May 2005, that this class of problems arise in robust model predictive control when min-max techniques are applied. Although binary quadratic problems belongs to a class of NP-complete problems, the computational burden of the proposed maximization algorithm for band matrices is polynomial with the dimension of the optimization variable and exponential with the band size. Computational results and comparisons on several hundred test problems demonstrate the efficiency of the algorithm

Min–max MPC using a tractable QP problem

Min–max model predictive controllers (MMMPC) suffer from a great computational burden that is often circumvented by using approximate solutions or upper bounds of the worst possible case of a performance index. This paper proposes a computationally efficient MMMPC control strategy in which a close approximation of the solution of the min–max problem is computed using a quadratic programming problem. The overall computational burden is much lower than that of the min–max problem and the resulting control is shown to have a guaranteed stability. A simulation example is given in the paper

Semantic variation operators for multidimensional genetic programming

Multidimensional genetic programming represents candidate solutions as sets of programs, and thereby provides an interesting framework for exploiting building block identification. Towards this goal, we investigate the use of machine learning as a way to bias which components of programs are promoted, and propose two semantic operators to choose where useful building blocks are placed during crossover. A forward stagewise crossover operator we propose leads to significant improvements on a set of regression problems, and produces state-of-the-art results in a large benchmark study. We discuss this architecture and others in terms of their propensity for allowing heuristic search to utilize information during the evolutionary process. Finally, we look at the collinearity and complexity of the data representations that result from these architectures, with a view towards disentangling factors of variation in application.Comment: 9 pages, 8 figures, GECCO 201

Min-Max MPC based on a computationally efficient upper bound of the worst case cost

Min-Max MPC (MMMPC) controllers [P.J. Campo, M. Morari, Robust model predictive control, in: Proc. American Control Conference, June 10–12, 1987, pp. 1021–1026] suffer from a great computational burden which limits their applicability in the industry. Sometimes upper bounds of the worst possible case of a performance index have been used to reduce the computational burden. This paper proposes a computationally efficient MMMPC control strategy in which the worst case cost is approximated by an upper bound based on a diagonalization scheme. The upper bound can be computed with O(n3) operations and using only simple matrix operations. This implies that the algorithm can be coded easily even in non-mathematical oriented programming languages such as those found in industrial embedded control hardware. A simulation example is given in the paper

Proyecto de investigación: Evaluación de una intervención enfermera dirigida a pacientes frágiles candidatos a cirugía cardíaca

Las enfermedades cardiovasculares suponen más de la mitad de los fallecimientos en mayores de 65 años en nuestro país. Teniendo en cuenta que la mayor parte de los ancianos presentan características de fragilidad, cabría pensar que actuando sobre ésta conseguiríamos reducir las patologías cardíacas. Debido a la gran repercusión de este problema, se están llevando a cabo intervenciones en Atención Primaria dirigidas a la detección del anciano frágil, aunque sin consenso sobre cómo actuar. Del mismo modo, se ha propuesto incidir en los preoperatorios en la detección de la fragilidad, pero sin llegar a una aplicabilidad clara. En consecuencia, proponemos una evaluación de la eficacia de un programa multidisciplinar con el fin de detectar ya en el preoperatorio la fragilidad y actuar en consecuencia en el postoperatorio. El Programa, liderado por una enfermera experta en cuidados del paciente cardiópata, se dirige a pacientes frágiles candidatos a Cirugía Cardíaca y a sus familiares, reforzando la educación para la salud con sesiones de enfermería y haciendo hincapié en la nutrición, el ejercicio físico y en los aspectos psicológicos del paciente. El método de evaluación escogido se trata de un estudio experimental con asignación aleatoria de los pacientes a los grupos de control e intervención.Grado en Enfermerí

El arte del azabache en Santiago de Compostela

En número dedicado a: La Coruña, el mar y la tierr

Min-max model predictive control as a quadratic program

This paper deals with the implementation of min-max model predictive control for constrained linear systems with bounded additive uncertainties and quadratic cost functions. This type of controller has been shown to be a continuous piecewise affine function of the state vector by geometrical methods. However, no algorithm for computing the explicit solution has been given. In this paper, we show that the min-max optimization problem can be expressed as a multi-parametric quadratic program, and so, the explicit form of the controller may be determined by standard multi-parametric techniques

El aprendizaje de las normas en Educación Infantil

Los niños y niñas no vienen con las normas aprendidas de nacimiento. Aprenden a comportarse poco a poco. Por eso los maestros y las maestras en la escuela y la familia en la casa, tienen que poner límites en el espacio y en el momento en que se da la situación de conflicto. Las normas deben ser propuestas, elaboradas y compartidas por todos para que tengan sentido educativo. Por ello, a través de este trabajo fin de grado pretendo profundizar en el aprendizaje de las normas en educación infantil haciendo un recorrido por la fundamentación teórica centrándome en el concepto de norma y terminando por las teorías de Bandura y Piaget. Además se presenta una propuesta didáctica como guía para el aprendizaje de las normas en educación infantil a través de cuentos, juegos y canciones.Grado en Educación Infanti

Tropical linear maps on the plane

In this paper we fully describe all tropical linear maps in the tropical projective plane, that is, maps from the tropical plane to itself given by tropical multiplication by a real 3×3 matrix A. The map fA is continuous and piecewise-linear in the classical sense. In some particular cases, the map fA is a parallel projection onto the set spanned by the columns of A. In the general case, after a change of coordinates, the map collapses at most three regions of the plane onto certain segments, called antennas, and is a parallel projection elsewhere (Theorem 3). In order to study fA, we may assume that A is normal, i.e., I A 0, up to changes of coordinates. A given matrix A admits infinitely many normalizations. Our approach is to define and compute a unique normalization for A (which we call lower canonical normalization) (Theorem 1) and then always work with it, due both to its algebraic simplicity and its geometrical meaning. On , any , some aspects of tropical linear maps have been studied in [6]. We work in , adding a geometric view and doing everything explicitly. We give precise pictures. Inspiration for this paper comes from [3,5,6,8,12,26]. We have tried to make it self-contained. Our preparatory results present noticeable relationships between the algebraic properties of a given matrix A (idempotent normal matrix, permutation matrix, etc.) and classical geometric properties of the points spanned by the columns of A (classical convexity and others); see Theorem 2 and Corollary 1. As a by-product, we compute all the tropical square roots of normal matrices of a certain type; see Corollary 4. This is, perhaps, a curious result in tropical algebra. Our final aim is, however, to give a precise description of the map . This is particularly easy when two tropical triangles arising from A (denoted and ) fit as much as possible. Then the action of fA is easily described on (the closure of) each cell of the cell decomposition ; see Theorem 3. Normal matrices play a crucial role in this paper. The tropical powers of normal matrices of size satisfy A n-1=A n=A n+1= . This statement can be traced back, at least, to [26], and appears later many times, such as [1,2,6,9,10]. In lemma 1, we give a direct proof of this fact, for n=3. But now the equality A 2=A 3 means that the columns of A 2 are three fixed points of fA and, in fact, any point spanned by the columns of A 2 is fixed by fA. Among 3×3 normal matrices, the idempotent ones (i.e., those satisfyingA=A 2) are particularly nice: we prove that the columns of such a matrix tropically span a set which is classically compact, connected and convex (Lemma 2 and Corollary 1). In our terminology, it is a good tropical triangl