GreenPhylDB v2.0: An improved database for plant functional genomics

Poster presented at 2009 Annual Research Meeting of the Generation Challenge Programme. Bamako (Mali), 20-23 September 200

Electroweak Phase Transition and LHC Signatures in the Singlet Majoron Model

We reconsider the strength of the electroweak phase transition in the singlet Majoron extension of the Standard Model, with a low (~TeV) scale of the singlet VEV. A strongly first order phase transition, of interest for electroweak baryogenesis, is found in sizeable regions of the parameter space, especially when the cross-coupling lambda_{hs}|S|^2|H|^2 between the singlet and the doublet Higgs is significant. Large Majorana Yukawa couplings of the singlet neutrinos, y_i S nu_i^c nu_i, are also important for strengthening the transition. We incorporate the LEP and Tevatron constraints on the Higgs masses, and electroweak precision constraints, in our search for allowed parameters; successful examples include singlet masses ranging from 5 GeV to several TeV. Models with a strong phase transition typically predict a nonstandard Higgs with mass in the range 113 GeV < m_H < 200 GeV and production cross sections reduced by mixing with the singlet, with cos^2(theta) significantly less than 1. We also find examples where the singlet is light and the decay H -> SS can modify the Higgs branching ratios relative to Standard Model expectations.Comment: 36 pages, 18 figure

Inverse Inclusion: Transforming Dispositions of Disability and Inclusion

Inverse inclusion, a novel pedagogy, transforms preservice teachers’ dispositions about disability and inclusion during an action research study of two university intercession service learning course collaborations with a community-based art program for disabled adults (clients). In this approach, university students (preservice teachers) rotate and reflect on roles as student, teacher, teacher’s assistant, and observer within an inclusive art class. Among these rotations, the student position relinquishes their hierarchical perspective as teacher, assistant, and observer, and situates them as a collaborative learner, conducive to building egalitarian relationships with clients. Based on qualitative data from university student participants in the form of pre- and post-questionnaires, reflections, and focus group interviews, most students transformed their perceptions about disability, increased their own confidence and advocacy for teaching in an inclusion setting, and were most influenced during their role as student working alongside clients

The Growth in Size and Mass of Cluster Galaxies since z=2

We study the formation and evolution of Brightest Cluster Galaxies starting from a $z=2$ population of quiescent ellipticals and following them to $z=0$. To this end, we use a suite of nine high-resolution dark matter-only simulations of galaxy clusters in a $\Lambda$CDM universe. We develop a scheme in which simulation particles are weighted to generate realistic and dynamically stable stellar density profiles at $z=2$. Our initial conditions assign a stellar mass to every identified dark halo as expected from abundance matching; assuming there exists a one-to-one relation between the visible properties of galaxies and their host haloes. We set the sizes of the luminous components according to the observed relations for $z\sim2$ massive quiescent galaxies. We study the evolution of the mass-size relation, the fate of satellite galaxies and the mass aggregation of the cluster central. From $z=2$, these galaxies grow on average in size by a factor 5 to 10 of and in mass by 2 to 3. The stellar mass growth rate of the simulated BCGs in our sample is of 1.9 in the range $0.3<z<1.0$ consistent with observations, and of 1.5 in the range $0.0<z<0.3$. Furthermore the satellite galaxies evolve to the present day mass-size relation by $z=0$. Assuming passively evolving stellar populations, we present surface brightness profiles for our cluster centrals which resemble those observed for the cDs in similar mass clusters both at $z=0$ and at $z=1$. This demonstrates that the $\Lambda$CDM cosmology does indeed predict minor and major mergers to occur in galaxy clusters with the frequency and mass ratio distribution required to explain the observed growth in size of passive galaxies since $z=2$. Our experiment shows that Brightest Cluster Galaxies can form through dissipationless mergers of quiescent massive $z=2$ galaxies, without substantial additional star formation.Comment: submitted to MNRAS, 10 pages, 8 figures, 2 table

Locating Depots for Capacitated Vehicle Routing

We study a location-routing problem in the context of capacitated vehicle routing. The input is a set of demand locations in a metric space and a fleet of k vehicles each of capacity Q. The objective is to locate k depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for this problem. To achieve this result, we reduce to the k-median-forest problem, which generalizes both k-median and minimum spanning tree, and which might be of independent interest. We give a (3+c)-approximation algorithm for k-median-forest, which leads to a (12+c)-approximation algorithm for the above location-routing problem, for any constant c>0. The algorithm for k-median-forest is just t-swap local search, and we prove that it has locality gap 3+2/t; this generalizes the corresponding result known for k-median. Finally we consider the "non-uniform" k-median-forest problem which has different cost functions for the MST and k-median parts. We show that the locality gap for this problem is unbounded even under multi-swaps, which contrasts with the uniform case. Nevertheless, we obtain a constant-factor approximation algorithm, using an LP based approach.Comment: 12 pages, 1 figur

Committee on Lifelong Learning 2022 Pearl and Murray Greenberg Awards Lectures

This article includes excerpts from the 2022 acceptance speeches by the recipients of the Pearl and Murray Greenberg Awards given during the Committee on Lifelong Learning Awards Ceremony at the New York City National Art Education Association Convention. The Murray Greenberg Award supports an emerging scholar who is zero to four years beyond the completion of their graduate degree program, thesis or dissertation, was given to Dr. Liz Langdon. The Pearl Greenberg Award for Teaching and Research was given to Dr. Angela LaPorter who was recognized as an artist/educator/researcher at the national level who has made distinguished contributions to lifelong learning through teaching and research

A re-interpretation of the Triangulum-Andromeda stellar clouds: a population of halo stars kicked out of the Galactic disk

The Triangulum-Andromeda stellar clouds (TriAnd1 and TriAnd2) are a pair of concentric ring- or shell-like over-densities at large $R$ ($\approx$ 30 kpc) and $Z$ ($\approx$ -10 kpc) in the Galactic halo that are thought to have been formed from the accretion and disruption of a satellite galaxy. This paper critically re-examines this formation scenario by comparing the number ratio of RR Lyrae to M giant stars associated with the TriAnd clouds with other structures in the Galaxy. The current data suggest a stellar population for these over-densities ($f_{\rm RR:MG} < 0.38$ at 95% confidence) quite unlike any of the known satellites of the Milky Way ($f_{\rm RR:MG} \approx 0.5$ for the very largest and $f_{\rm RR:MG} >>1$ for the smaller satellites) and more like the population of stars born in the much deeper potential well inhabited by the Galactic disk ($f_{\rm RR:MG} < 0.01$). N-body simulations of a Milky-Way-like galaxy perturbed by the impact of a dwarf galaxy demonstrate that, in the right circumstances, concentric rings propagating outwards from that Galactic disk can plausibly produce similar over-densities. These results provide dramatic support for the recent proposal by Xu et al. (2015) that, rather than stars accreted from other galaxies, the TriAnd clouds could represent stars kicked-out from our own disk. If so, these would be the first populations of disk stars to be found in the Galactic halo and a clear signature of the importance of this second formation mechanism for stellar halos more generally. Moreover, their existence at the very extremities of the disk places strong constraints on the nature of the interaction that formed them.Comment: 27 pages, 8 figures; published in MNRA

A real delivery problem dealt with Monte Carlo techniques

[EN] In this paper we use Monte Carlo Techniques to deal with a real world delivery problem of a food company in Valencia (Spain). The problem is modeled as a set of 11 instances of the well known Vehicle Routing Problem, VRP, with additional time constraints. Given that VRP is a NP-hard problem, a heuristic algorithm, based on Monte Carlo techniques, is implemented. The solution proposed by this heuristic algorithm reaches distance and money savings of about 20% and 5% respectively.This research was partially supported by MICINN, Project MTM2013-43540-P and by UPV, Project Programa de Apoyo a la Investigación y Desarrollo de la UPV PAID-06-12.S577181Fernández de Córdoba, P., L.M. García-Raffi and J.M. Sanchis Llopis (1998), A heuristic algorithm based on Monte Carlo methods for the Rural Postman Problem.Computers and Op. Research,25, No. 12, pp. 1097–1106, 1998.Fernández de Córdoba, P. and L.M. García-Raffi, E. Nieto and J.M. Sanchis Llopis (1999a), Aplicación de técnicas Monte Carlo a un problema real de Rutas de Vehículos.Anales de Ingeniería, Colombia. In press.Fernández de Córdoba, P., L.M. García-Raffi and J.M. Sanchis Llopis (1999b), A Constructive Parallel Algorithm based on Monte Carlo techniques for Routing Problems, Submitted toParallel Computers.Laporte, G. (1992), The Vehicle Routing Problem: an overview of exact and approximate algorithms,European Journal of Operations Research,59, 345.Laporte, G., M. Desrochers and Y. Nobert (1985), “Optimal Routing under Capacity and Distance Restrictions.Operations Research,33, pp. 1050–1073.Laporte G. and Y. Nobert (1987), Exact algorithms for The Vehicle Routing Problem,Surveys in Combinatorial Optimization (S. Martello, G. Laporte, M. Minoux and C. Ribeiro Eds.). North-HollandAmsterdamMayado, A. (1998), Organización de los itinerarios de la flota de camiones de reparto de una sociedad cooperativa. Optimización mediante técnicas de simulación Monte Carlo. Proyecto Fin de Carrera. E.T.S.I.I. Universidad Politécnica de Valencia