Medicaid Expansions and Fertility in the United States

Beginning in the mid 1980s and extending through the early to mid 1990s, a substantial number of women and children gained eligibility for Medicaid through a series of income-based expansions. Using natality data from the National Center for Health Statistics, we estimate fertility responses to these eligibility expansions. We measure changes in state Medicaid eligibility policy by simulating the fraction of a standard population that would qualify for benefits. From 1985 to 1996, the fraction of women aged 15 to 44 who were eligible for Medicaid coverage for a pregnancy increased on average by 24 percentage points. However, contrary to findings in the extant literature, our results do not indicate that this expansion in coverage had a statistically discernible effect on fertility.

In-situ Resource Utilization (ISRU) to Support the Lunar Outpost and the Rationale for Precursor Missions

One of the ways that the Constellation Program can differ from Apollo is to employ a live-off-the-land or In-Situ Resource Utilization (ISRU) supported architecture. The options considered over the past decades for using indigenous materials have varied considerably in terms of what resources to attempt to acquire, how much to acquire, and what the motivations are to acquiring these resources. The latest NASA concepts for supporting the lunar outpost have considered many of these plans and compared these options to customers requirements and desires. Depending on the architecture employed, ISRU technologies can make a significant contribution towards a sustainable and affordable lunar outpost. While extensive ground testing will reduce some mission risk, one or more flight demonstrations prior to the first crew's arrival will build confidence and increase the chance that outpost architects will include ISRU as part of the early outpost architecture. This presentation includes some of the options for using ISRU that are under consideration for the lunar outpost, the precursor missions that would support these applications, and a notional timeline to allow the lessons learned from the precursor missions to support outpost hardware designs

On the existence of impurity bound excitons in one-dimensional systems with zero range interactions

We consider a three-body one-dimensional Schr\"odinger operator with zero range potentials, which models a positive impurity with charge $\kappa > 0$ interacting with an exciton. We study the existence of discrete eigenvalues as $\kappa$ is varied. On one hand, we show that for sufficiently small $\kappa$ there exists a unique bound state whose binding energy behaves like $\kappa^4$, and we explicitly compute its leading coefficient. On the other hand, if $\kappa$ is larger than some critical value then the system has no bound states

Fully fault tolerant quantum computation with non-deterministic gates

In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components; operations between components should assumed to be failure prone. In the logical limit of this architecture each component contains only one qubit. Here we derive thresholds for fault tolerant quantum computation under such extreme paradigms. We find that computation is supported for remarkably high failure rates (exceeding 90%) providing that failures are heralded, meanwhile the rate of unknown errors should not exceed 2 in 10^4 operations.Comment: 5 pages, 3 fig

Hamilton's Turns for the Lorentz Group

Hamilton in the course of his studies on quaternions came up with an elegant geometric picture for the group SU(2). In this picture the group elements are represented by ``turns'', which are equivalence classes of directed great circle arcs on the unit sphere $S^2$, in such a manner that the rule for composition of group elements takes the form of the familiar parallelogram law for the Euclidean translation group. It is only recently that this construction has been generalized to the simplest noncompact group $SU(1,1) = Sp(2, R) = SL(2,R)$, the double cover of SO(2,1). The present work develops a theory of turns for $SL(2,C)$, the double and universal cover of SO(3,1) and $SO(3,C)$, rendering a geometric representation in the spirit of Hamilton available for all low dimensional semisimple Lie groups of interest in physics. The geometric construction is illustrated through application to polar decomposition, and to the composition of Lorentz boosts and the resulting Wigner or Thomas rotation.Comment: 13 pages, Late

Measurement-based approach to entanglement generation in coupled quantum dots

Measurements provide a novel mechanism for generating the entanglement resource necessary for performing scalable quantum computation. Recently, we proposed a method for performing parity measurements in a coupled quantum dot system. In this paper we generalise this scheme and perform a comprehensive analytic and numerical study of environmental factors. We calculate the effects of possible error sources including non-ideal photon detectors, ineffective spin-selective excitation and dot distinguishability (both spatial and spectral). Furthermore, we present an experimental approach for verifying the success of the parity measurement

From Markovian to pairwise epidemic models and the performance of moment closure approximations

Many if not all models of disease transmission on networks can be linked to the exact state-based Markovian formulation. However the large number of equations for any system of realistic size limits their applicability to small populations. As a result, most modelling work relies on simulation and pairwise models. In this paper, for a simple SIS dynamics on an arbitrary network, we formalise the link between a well known pairwise model and the exact Markovian formulation. This involves the rigorous derivation of the exact ODE model at the level of pairs in terms of the expected number of pairs and triples. The exact system is then closed using two different closures, one well established and one that has been recently proposed. A new interpretation of both closures is presented, which explains several of their previously observed properties. The closed dynamical systems are solved numerically and the results are compared to output from individual-based stochastic simulations. This is done for a range of networks with the same average degree and clustering coefficient but generated using different algorithms. It is shown that the ability of the pairwise system to accurately model an epidemic is fundamentally dependent on the underlying large-scale network structure. We show that the existing pairwise models are a good fit for certain types of network but have to be used with caution as higher-order network structures may compromise their effectiveness

Preference Learning for Move Prediction and Evaluation Function Approximation in Othello

This paper investigates the use of preference learning as an approach to move prediction and evaluation function approximation, using the game of Othello as a test domain. Using the same sets of features, we compare our approach with least squares temporal difference learning, direct classification, and with the Bradley-Terry model, fitted using minorization-maximization (MM). The results show that the exact way in which preference learning is applied is critical to achieving high performance. Best results were obtained using a combination of board inversion and pair-wise preference learning. This combination significantly outperformed the others under test, both in terms of move prediction accuracy, and in the level of play achieved when using the learned evaluation function as a move selector during game play

Distinguishability of infinite groups and graphs

The distinguishing number of a group G acting faithfully on a set V is the least number of colors needed to color the elements of V so that no non-identity element of the group preserves the coloring. The distinguishing number of a graph is the distinguishing number of its automorphism group acting on its vertex set. A connected graph Gamma is said to have connectivity 1 if there exists a vertex alpha \in V\Gamma such that Gamma \setminus \{\alpha\} is not connected. For alpha \in V, an orbit of the point stabilizer G_\alpha is called a suborbit of G. We prove that every nonnull, primitive graph with infinite diameter and countably many vertices has distinguishing number 2. Consequently, any nonnull, infinite, primitive, locally finite graph is 2-distinguishable; so, too, is any infinite primitive permutation group with finite suborbits. We also show that all denumerable vertex-transitive graphs of connectivity 1 and all Cartesian products of connected denumerable graphs of infinite diameter have distinguishing number 2. All of our results follow directly from a versatile lemma which we call The Distinct Spheres Lemma

Estudio técnico-económico de una planta desaladora de agua de mar por ósmosis inversa

En el següent escrit: Estudi técnic-económic d’una planta desaladora d’aigua de mar per osmosis inversa, es pretén donar al lector una idea del procés d’Osmosis Inversa; el qual, ja el podríem ubicar dins dels processos de separació per membranes. Es pretén que aquesta idea sigui el més pràctica possible, sense deixar de banda els aspectes teòrics corresponents, però descartant aquells que, encara tenir relativa importància, l’únic que se aconseguiria amb el seu estudi, seria ampliar el contingut de l’anomenat projecte sense aportarnos això cap benefici relacionat amb l’essència del tema, com es la desalació d’aigua de mar per osmosis inversa. Es per aquest motiu que l’estudi que segueix, es divideix en cinc volums. El primer recull tots els aspectes teórico-práctics, on el lector pot trobar els diferents processos de separació per membranes, les consideracions sobre l’aigua i tot el relacionat amb el fonament fisico-químic que ens pertoca, o sia, la ósmosis inversa: definicions, conceptes bàsics, procés, membranes, etc. L’aspecte pràctic al que ens referim ve reflexat en petits sub-apartats, tals com: neteja eficaç de les membranes, o en seccions posteriors, en petits apartats on es donen recomanacions pràctiques, de instal•lació i inclòs de fabricació d’aparells per postratament. El volum segon és una descripció detalla de l’instal•lació, on s’estudia des de la presa d’aigua de mar fins l’obtenció d’aigua producte, nomenant-se tots els equips, vàlvules, bombes, filtres, etc., que l’aigua travessa en el seu procés. Els tres volums restants corresponen al aspecte més tècnic, on es mostren, por ordre: càlculs, plànols i pressupost o memòria econòmica