The Transit Light Curve Project. XII. Six Transits of the Exoplanet XO-2b

We present photometry of six transits of the exoplanet XO-2b. By combining the light-curve analysis with theoretical isochrones to determine the stellar properties, we find the planetary radius to be 0.996 +0.031/-0.018 rjup and the planetary mass to be 0.565 +/- 0.054 mjup. These results are consistent with those reported previously, and are also consistent with theoretical models for gas giant planets. The mid-transit times are accurate to within 1 min and are consistent with a constant period. However, the period we derive differs by 2.5 sigma from the previously published period. More data are needed to tell whether the period is actually variable (as it would be in the presence of an additional body) or if the timing errors have been underestimated.Comment: Accepted for publication in AJ. 20 pages, 3 tables, 4 figure

BMPR2 expression is suppressed by signaling through the estrogen receptor

<p>Abstract</p> <p>Background</p> <p>Studies in multiple organ systems have shown cross-talk between signaling through the bone morphogenetic protein receptor type 2 (BMPR2) and estrogen pathways. In humans, pulmonary arterial hypertension (PAH) has a female predominance, and is associated with decreased BMPR2 expression. The goal of this study was to determine if estrogens suppress BMPR2 expression.</p> <p>Methods</p> <p>A variety of techniques were utilized across several model platforms to evaluate the relationship between estrogens and BMPR2 gene expression. We used quantitative RT-PCR, gel mobility shift, and luciferase activity assays in human samples, live mice, and cell culture.</p> <p>Results</p> <p>BMPR2 expression is reduced in lymphocytes from female patients compared with male patients, and in whole lungs from female mice compared with male mice. There is an evolutionarily conserved estrogen receptor binding site in the BMPR2 promoter, which binds estrogen receptor by gel-shift assay. Increased exogenous estrogen decreases BMPR2 expression in cell culture, particularly when induced to proliferate. Transfection of increasing quantities of estrogen receptor alpha correlates strongly with decreasing expression of BMPR2.</p> <p>Conclusions</p> <p>BMPR2 gene expression is reduced in females compared to males in live humans and in mice, likely through direct estrogen receptor alpha binding to the BMPR2 promoter. This reduced BMPR2 expression may contribute to the increased prevalence of PAH in females.</p

Stochastic Games with Lim Sup Payoff

Consider a two-person zero-sum stochastic game with countable state space S, finite action sets A and B for players 1 and 2, respectively, and law of motion p. Let u be a bounded real-valued function defined on the state space S and assume that the payoff from 2 to 1 along a play (or infinit

Advances in Zero-Sum Dynamic Games

International audienceThe survey presents recent results in the theory of two-person zero-sum repeated games and their connections with differential and continuous-time games. The emphasis is made on the following(1) A general model allows to deal simultaneously with stochastic and informational aspects.(2) All evaluations of the stage payoffs can be covered in the same framework (and not only the usual Cesàro and Abel means).(3) The model in discrete time can be seen and analyzed as a discretization of a continuous time game. Moreover, tools and ideas from repeated games are very fruitful for continuous time games and vice versa.(4) Numerous important conjectures have been answered (some in the negative).(5) New tools and original models have been proposed. As a consequence, the field (discrete versus continuous time, stochastic versus incomplete information models) has a much more unified structure, and research is extremely active

Finite-Step Algorithms for Single-Controller and Perfect Information Stochastic Games

Abstract. After a brief survey of iterative algorithms for general stochas-tic games, we concentrate on finite-step algorithms for two special classes of stochastic games. They are Single-Controller Stochastic Games and Per-fect Information Stochastic Games. In the case of single-controller games, the transition probabilities depend on the actions of the same player in all states. In perfect information stochastic games, one of the players has exactly one action in each state. Single-controller zero-sum games are effi-ciently solved by linear programming. Non-zero-sum single-controller stochastic games are reducible to linear complementary problems (LCP). In the discounted case they can be modified to fit into the so-called LCPs of Eave’s class L. In the undiscounted case the LCP’s are reducible to Lemke’s copositive plus class. In either case Lemke’s algorithm can be used to find a Nash equilibrium. In the case of discounted zero-sum perfect informa-tion stochastic games, a policy improvement algorithm is presented. Many other classes of stochastic games with orderfield property still await efficient finite-step algorithms. 1

Discovery of Therapeutic Approaches for Polyglutamine Diseases: A Summary of Recent Efforts

Polyglutamine (PolyQ) diseases are a group of neurodegenerative disorders caused by the expansion of cytosine-adenine-guanine (CAG) trinucleotide repeats in the coding region of specific genes. This leads to the production of pathogenic proteins containing critically expanded tracts of glutamines. Although polyQ diseases are individually rare, the fact that these nine diseases are irreversibly progressive over 10 to 30 years, severely impairing and ultimately fatal, usually implicating the full-time patient support by a caregiver for long time periods, makes their economic and social impact quite significant. This has led several researchers worldwide to investigate the pathogenic mechanism(s) and therapeutic strategies for polyQ diseases. Although research in the field has grown notably in the last decades, we are still far from having an effective treatment to offer patients, and the decision of which compounds should be translated to the clinics may be very challenging. In this review, we provide a comprehensive and critical overview of the most recent drug discovery efforts in the field of polyQ diseases, including the most relevant findings emerging from two different types of approaches-hypothesis-based candidate molecule testing and hypothesis-free unbiased drug screenings. We hereby summarize and reflect on the preclinical studies as well as all the clinical trials performed to date, aiming to provide a useful framework for increasingly successful future drug discovery and development efforts.Project ON.2 SR&TD Integrated Program (NORTE-07-0124-FEDER-000021), co-funded by North Portugal Regional Operational Program (ON.2-O Novo Norte), under the National Strategic Reference Framework, through the European Regional Development Fund (ERDF) and also supported by Fundação para a Ciência e Tecnologia through the project POCI-01-0145-FEDER-016818 (PTDC/NEU-NMC/3648/2014)info:eu-repo/semantics/publishedVersio

Qualitative analysis of concurrent mean-payoff games.

We consider concurrent games played by two players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study the most fundamental objective for concurrent games, namely, mean-payoff or limit-average objective, where a reward is associated to each transition, and the goal of player 1 is to maximize the long-run average of the rewards, and the objective of player 2 is strictly the opposite (i.e., the games are zero-sum). The path constraint for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward, or arbitrarily close to it; or quantitative, i.e., a given threshold between the minimal and maximal reward. We consider the computation of the almost-sure (resp. positive) winning sets, where player 1 can ensure that the path constraint is satisfied with probability 1 (resp. positive probability). Almost-sure winning with qualitative constraint exactly corresponds to the question of whether there exists a strategy to ensure that the payoff is the maximal reward of the game. Our main results for qualitative path constraints are as follows: (1) we establish qualitative determinacy results that show that for every state either player 1 has a strategy to ensure almost-sure (resp. positive) winning against all player-2 strategies, or player 2 has a spoiling strategy to falsify almost-sure (resp. positive) winning against all player-1 strategies; (2) we present optimal strategy complexity results that precisely characterize the classes of strategies required for almost-sure and positive winning for both players; and (3) we present quadratic time algorithms to compute the almost-sure and the positive winning sets, matching the best known bound of the algorithms for much simpler problems (such as reachability objectives). For quantitative constraints we show that a polynomial time solution for the almost-sure or the positive winning set would imply a solution to a long-standing open problem (of solving the value problem of turn-based deterministic mean-payoff games) that is not known to be solvable in polynomial time