Lagrangian 3-torus fibrations

We prove that Mark Gross' topological Calabi-Yau compactifications can be made into symplectic compactifications. To prove this we develop a method to construct singular Lagrangian 3-torus fibrations over certain a priori given integral affine manifolds with singularities, which we call simple. This produces pairs of compact symplectic 6-manifolds homeomorphic to mirror pairs of Calabi-Yau 3-folds together with Lagrangian fibrations whose underlying integral affine structures are dual

Enfermedades del frijol

Diseases are one of the limiting factors to bean production in L.A. The prevalency and severity of the disease depends on the quantity of inoculum existing in the region, environmental conditions and the quality of the seed used. Data are given on geographic distribution, favorable climatic conditions for development, symptomatology, vectors, type of damage caused and control measures, including var. resistant to (1) fungal diseases, the most numerous and causing the most damage: rust, anthracnose, angular leaf spot, root rot, web blight, gray spot, powdery mildew; (2) virus diseases, some of economic importance transmitted by aphids (BCMV, BYMV); transmitted by whiteflies (BGMV, bean chlorotic mottle, euphorbia mosaic); transmitted by chrysomelids (BRMV, pod mottle, BSMV, yellow mottle); (3) bacterial diseases are few but can be a serious limitation to the crop: common and fuscous blights, halo blight; and (4) nematodes: Meloidogyne sp., Trichodorus spp., Pratylenchus spp., Heterodera spp. (CIAT

Conicoid Mirrors

The first order equation relating object and image location for a mirror of arbitrary conic-sectional shape is derived. It is also shown that the parabolic reflecting surface is the only one free of aberration and only in the limiting case of distant sources.Comment: 9 page

SYZ mirror symmetry for hypertoric varieties

We construct a Lagrangian torus fibration on a smooth hypertoric variety and a corresponding SYZ mirror variety using $T$-duality and generating functions of open Gromov-Witten invariants. The variety is singular in general. We construct a resolution using the wall and chamber structure of the SYZ base.Comment: v_2: 31 pages, 5 figures, minor revision. To appear in Communications in Mathematical Physic

Health and Psychoanalysis: Concepts Linked to Create Strong Public Policies

Objectives: To review concepts from both the fields of public health and psychoanalysis in order to confront the dilemmas of new health practices at the periphery of large cities in contemporary society

Effects of the lack of selective pressure on the expected run-time distribution in genetic programming

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. D. F. Barrero, M. D. R-Moreno, B. Castano, and D. Camacho, "Effects of the lack of selective pressure on the expected run-time distribution in genetic programming", in IEEE Congress on Evolutionary Computation, CEC 2013, pp. 1748 - 1755Run-time analysis is a powerful tool to analyze algorithms. It is focused on studying the time required by an algorithm to find a solution, the expected run-time, which is one of the most relevant algorithm attributes. Previous research has associated the expected run-time in GP with the lognormal distribution. In this paper we provide additional evidence in that regard and show how the algorithm parametrization may change the resulting run-time distribution. In particular, we explore the influence of the selective pressure on the run-time distribution in tree-based GP, finding that, at least in two problem instances, the lack of selective pressure generates an expected run-time distribution well described by the Weibull probability distribution.This work has been partly supported by Spanish Ministry of Science and Education under project ABANT (TIN2010- 19872)

An empirical study on the accuracy of computational effort in Genetic Programming

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. D. F. Barrero, M. D. R-Moreno, B. Castaño, and D. Camacho, "An empirical study on the accuracy of computational effort in Genetic Programming", in IEEE Congress on Evolutionary Computation (CEC), 2011, pp. 1164 - 1171Some commonly used performance measures in Genetic Programming are those defined by John Koza in his first book. These measures, mainly computational effort and number of individuals to be processed, estimate the performance of the algorithm as well as the difficulty of a problem. Although Koza's performance measures have been widely used in the literature, their behaviour is not well known. In this paper we study the accuracy of these measures and advance in the understanding of the factors that influence them. In order to achieve this goal, we report an empirical study that attempts to systematically measure the effects of two variability sources in the estimation of the number of individuals to be processed and the computational effort. The results obtained in those experiments suggests that these measures, in common experimental setups, and under certain circumstances, might have a high relative error.This work was partially supported by the MICYT project ABANT (TIN2010-19872) and Castilla-La Mancha project PEII09- 0266-664

Early treatment of a class III malocclusion with the myobrace system: clinical case

Poster presented at the 2nd International Congress of CiiEM - Translational Research and Innovation in Human and Health Science. 11-13 June, 2017, Monte de Caparica, PortugalN/