1,102 research outputs found

    Paraneoplastic thrombocytosis in ovarian cancer

    Get PDF
    <p>Background: The mechanisms of paraneoplastic thrombocytosis in ovarian cancer and the role that platelets play in abetting cancer growth are unclear.</p> <p>Methods: We analyzed clinical data on 619 patients with epithelial ovarian cancer to test associations between platelet counts and disease outcome. Human samples and mouse models of epithelial ovarian cancer were used to explore the underlying mechanisms of paraneoplastic thrombocytosis. The effects of platelets on tumor growth and angiogenesis were ascertained.</p> <p>Results: Thrombocytosis was significantly associated with advanced disease and shortened survival. Plasma levels of thrombopoietin and interleukin-6 were significantly elevated in patients who had thrombocytosis as compared with those who did not. In mouse models, increased hepatic thrombopoietin synthesis in response to tumor-derived interleukin-6 was an underlying mechanism of paraneoplastic thrombocytosis. Tumorderived interleukin-6 and hepatic thrombopoietin were also linked to thrombocytosis in patients. Silencing thrombopoietin and interleukin-6 abrogated thrombocytosis in tumor-bearing mice. Anti–interleukin-6 antibody treatment significantly reduced platelet counts in tumor-bearing mice and in patients with epithelial ovarian cancer. In addition, neutralizing interleukin-6 significantly enhanced the therapeutic efficacy of paclitaxel in mouse models of epithelial ovarian cancer. The use of an antiplatelet antibody to halve platelet counts in tumor-bearing mice significantly reduced tumor growth and angiogenesis.</p> <p>Conclusions: These findings support the existence of a paracrine circuit wherein increased production of thrombopoietic cytokines in tumor and host tissue leads to paraneoplastic thrombocytosis, which fuels tumor growth. We speculate that countering paraneoplastic thrombocytosis either directly or indirectly by targeting these cytokines may have therapeutic potential. </p&gt

    The quest for the solar g modes

    Full text link
    Solar gravity modes (or g modes) -- oscillations of the solar interior for which buoyancy acts as the restoring force -- have the potential to provide unprecedented inference on the structure and dynamics of the solar core, inference that is not possible with the well observed acoustic modes (or p modes). The high amplitude of the g-mode eigenfunctions in the core and the evanesence of the modes in the convection zone make the modes particularly sensitive to the physical and dynamical conditions in the core. Owing to the existence of the convection zone, the g modes have very low amplitudes at photospheric levels, which makes the modes extremely hard to detect. In this paper, we review the current state of play regarding attempts to detect g modes. We review the theory of g modes, including theoretical estimation of the g-mode frequencies, amplitudes and damping rates. Then we go on to discuss the techniques that have been used to try to detect g modes. We review results in the literature, and finish by looking to the future, and the potential advances that can be made -- from both data and data-analysis perspectives -- to give unambiguous detections of individual g modes. The review ends by concluding that, at the time of writing, there is indeed a consensus amongst the authors that there is currently no undisputed detection of solar g modes.Comment: 71 pages, 18 figures, accepted by Astronomy and Astrophysics Revie

    Combining ability of summer-squash lines with different degrees of parthenocarpy and PRSV-W resistance

    Get PDF
    The aim was to assess heterosis in a set of 16 summer-squash hybrids, and evaluate the combining capacity of the respective parental lines, which differed as to the degree of parthenocarpy and resistance to PRSV-W (Papaya Ringspot Virus-Watermelon strain). The hybrids were obtained using a partial diallel cross design (4 × 4). The lines of parental group I were 1 = ABX-037G-77-03-05-01-01-bulk, 2 = ABX-037G-77-03-05-03-10-bulk, 3 = ABX-037G-77-03-05-01-04-bulk and 4 = ABX-037G-77-03-05-05-01-bulk, and of group II, 1′ = ABX-037G-77-03-05-04-08-bulk, 2′ = ABX-037G-77-03-05-02-11-bulk, 3′ = Clarice and 4′ = Caserta. The 16 hybrids and eight parental lines were evaluated for PRSV-W resistance, parthenocarpic expression and yield in randomized complete-block designs, with three replications. Parthenocarpy and the resistance to PRSV-W were rated by means of a scale from 1 to 5, where 1 = non-parthenocarpic or high resistance to PRSV-W, and 5 = parthenocarpic or high susceptibility to PRSV-W. Both additive and non-additive gene effects were important in the expression of parthenocarpy and resistance to PRSV-W. Whereas estimates of heterosis in parthenocarpy usually tended towards a higher degree, resistance to PRSV-W was towards higher susceptibility. At least one F1 hybrid was identified with a satisfactory degree of parthenocarpy, resistance to PRSV-W and high fruit-yield

    Interaction Between Convection and Pulsation

    Get PDF
    This article reviews our current understanding of modelling convection dynamics in stars. Several semi-analytical time-dependent convection models have been proposed for pulsating one-dimensional stellar structures with different formulations for how the convective turbulent velocity field couples with the global stellar oscillations. In this review we put emphasis on two, widely used, time-dependent convection formulations for estimating pulsation properties in one-dimensional stellar models. Applications to pulsating stars are presented with results for oscillation properties, such as the effects of convection dynamics on the oscillation frequencies, or the stability of pulsation modes, in classical pulsators and in stars supporting solar-type oscillations.Comment: Invited review article for Living Reviews in Solar Physics. 88 pages, 14 figure

    Association of MC1R Variants and host phenotypes with melanoma risk in CDKN2A mutation carriers: a GenoMEL study

    Get PDF
    <p><b>Background</b> Carrying the cyclin-dependent kinase inhibitor 2A (CDKN2A) germline mutations is associated with a high risk for melanoma. Penetrance of CDKN2A mutations is modified by pigmentation characteristics, nevus phenotypes, and some variants of the melanocortin-1 receptor gene (MC1R), which is known to have a role in the pigmentation process. However, investigation of the associations of both MC1R variants and host phenotypes with melanoma risk has been limited.</p> <p><b>Methods</b> We included 815 CDKN2A mutation carriers (473 affected, and 342 unaffected, with melanoma) from 186 families from 15 centers in Europe, North America, and Australia who participated in the Melanoma Genetics Consortium. In this family-based study, we assessed the associations of the four most frequent MC1R variants (V60L, V92M, R151C, and R160W) and the number of variants (1, ≥2 variants), alone or jointly with the host phenotypes (hair color, propensity to sunburn, and number of nevi), with melanoma risk in CDKN2A mutation carriers. These associations were estimated and tested using generalized estimating equations. All statistical tests were two-sided.</p> <p><b>Results</b> Carrying any one of the four most frequent MC1R variants (V60L, V92M, R151C, R160W) in CDKN2A mutation carriers was associated with a statistically significantly increased risk for melanoma across all continents (1.24 × 10−6 ≤ P ≤ .0007). A consistent pattern of increase in melanoma risk was also associated with increase in number of MC1R variants. The risk of melanoma associated with at least two MC1R variants was 2.6-fold higher than the risk associated with only one variant (odds ratio = 5.83 [95% confidence interval = 3.60 to 9.46] vs 2.25 [95% confidence interval = 1.44 to 3.52]; Ptrend = 1.86 × 10−8). The joint analysis of MC1R variants and host phenotypes showed statistically significant associations of melanoma risk, together with MC1R variants (.0001 ≤ P ≤ .04), hair color (.006 ≤ P ≤ .06), and number of nevi (6.9 × 10−6 ≤ P ≤ .02).</p> <p><b>Conclusion</b> Results show that MC1R variants, hair color, and number of nevi were jointly associated with melanoma risk in CDKN2A mutation carriers. This joint association may have important consequences for risk assessments in familial settings.</p&gt

    Of Mice and ‘Convicts’: Origin of the Australian House Mouse, Mus musculus

    Get PDF
    The house mouse, Mus musculus, is one of the most ubiquitous invasive species worldwide and in Australia is particularly common and widespread, but where it originally came from is still unknown. Here we investigated this origin through a phylogeographic analysis of mitochondrial DNA sequences (D-loop) comparing mouse populations from Australia with those from the likely regional source area in Western Europe. Our results agree with human historical associations, showing a strong link between Australia and the British Isles. This outcome is of intrinsic and applied interest and helps to validate the colonization history of mice as a proxy for human settlement history

    Physics and Applications of Laser Diode Chaos

    Full text link
    An overview of chaos in laser diodes is provided which surveys experimental achievements in the area and explains the theory behind the phenomenon. The fundamental physics underpinning this behaviour and also the opportunities for harnessing laser diode chaos for potential applications are discussed. The availability and ease of operation of laser diodes, in a wide range of configurations, make them a convenient test-bed for exploring basic aspects of nonlinear and chaotic dynamics. It also makes them attractive for practical tasks, such as chaos-based secure communications and random number generation. Avenues for future research and development of chaotic laser diodes are also identified.Comment: Published in Nature Photonic

    New prioritized value iteration for Markov decision processes

    Full text link
    The problem of solving large Markov decision processes accurately and quickly is challenging. Since the computational effort incurred is considerable, current research focuses on finding superior acceleration techniques. For instance, the convergence properties of current solution methods depend, to a great extent, on the order of backup operations. On one hand, algorithms such as topological sorting are able to find good orderings but their overhead is usually high. On the other hand, shortest path methods, such as Dijkstra's algorithm which is based on priority queues, have been applied successfully to the solution of deterministic shortest-path Markov decision processes. Here, we propose an improved value iteration algorithm based on Dijkstra's algorithm for solving shortest path Markov decision processes. The experimental results on a stochastic shortest-path problem show the feasibility of our approach. © Springer Science+Business Media B.V. 2011.García Hernández, MDG.; Ruiz Pinales, J.; Onaindia De La Rivaherrera, E.; Aviña Cervantes, JG.; Ledesma Orozco, S.; Alvarado Mendez, E.; Reyes Ballesteros, A. (2012). New prioritized value iteration for Markov decision processes. Artificial Intelligence Review. 37(2):157-167. doi:10.1007/s10462-011-9224-zS157167372Agrawal S, Roth D (2002) Learning a sparse representation for object detection. In: Proceedings of the 7th European conference on computer vision. Copenhagen, Denmark, pp 1–15Bellman RE (1954) The theory of dynamic programming. Bull Amer Math Soc 60: 503–516Bellman RE (1957) Dynamic programming. Princeton University Press, New JerseyBertsekas DP (1995) Dynamic programming and optimal control. Athena Scientific, MassachusettsBhuma K, Goldsmith J (2003) Bidirectional LAO* algorithm. In: Proceedings of indian international conferences on artificial intelligence. p 980–992Blackwell D (1965) Discounted dynamic programming. Ann Math Stat 36: 226–235Bonet B, Geffner H (2003a) Faster heuristic search algorithms for planning with uncertainty and full feedback. In: Proceedings of the 18th international joint conference on artificial intelligence. Morgan Kaufmann, Acapulco, México, pp 1233–1238Bonet B, Geffner H (2003b) Labeled RTDP: improving the convergence of real-time dynamic programming. In: Proceedings of the international conference on automated planning and scheduling. Trento, Italy, pp 12–21Bonet B, Geffner H (2006) Learning depth-first search: a unified approach to heuristic search in deterministic and non-deterministic settings and its application to MDP. In: Proceedings of the 16th international conference on automated planning and scheduling. Cumbria, UKBoutilier C, Dean T, Hanks S (1999) Decision-theoretic planning: structural assumptions and computational leverage. J Artif Intell Res 11: 1–94Chang I, Soo H (2007) Simulation-based algorithms for Markov decision processes Communications and control engineering. Springer, LondonDai P, Goldsmith J (2007a) Faster dynamic programming for Markov decision processes. Technical report. Doctoral consortium, department of computer science and engineering. University of WashingtonDai P, Goldsmith J (2007b) Topological value iteration algorithm for Markov decision processes. In: Proceedings of the 20th international joint conference on artificial intelligence. Hyderabad, India, pp 1860–1865Dai P, Hansen EA (2007c) Prioritizing bellman backups without a priority queue. In: Proceedings of the 17th international conference on automated planning and scheduling, association for the advancement of artificial intelligence. Rhode Island, USA, pp 113–119Dibangoye JS, Chaib-draa B, Mouaddib A (2008) A Novel prioritization technique for solving Markov decision processes. In: Proceedings of the 21st international FLAIRS (The Florida Artificial Intelligence Research Society) conference, association for the advancement of artificial intelligence. Florida, USAFerguson D, Stentz A (2004) Focused propagation of MDPs for path planning. In: Proceedings of the 16th IEEE international conference on tools with artificial intelligence. pp 310–317Hansen EA, Zilberstein S (2001) LAO: a heuristic search algorithm that finds solutions with loops. Artif Intell 129: 35–62Hinderer K, Waldmann KH (2003) The critical discount factor for finite Markovian decision processes with an absorbing set. Math Methods Oper Res 57: 1–19Li L (2009) A unifying framework for computational reinforcement learning theory. PhD Thesis. The state university of New Jersey, New Brunswick. NJLittman ML, Dean TL, Kaelbling LP (1995) On the complexity of solving Markov decision problems.In: Proceedings of the 11th international conference on uncertainty in artificial intelligence. Montreal, Quebec pp 394–402McMahan HB, Gordon G (2005a) Fast exact planning in Markov decision processes. In: Proceedings of the 15th international conference on automated planning and scheduling. Monterey, CA, USAMcMahan HB, Gordon G (2005b) Generalizing Dijkstra’s algorithm and gaussian elimination for solving MDPs. Technical report, Carnegie Mellon University, PittsburghMeuleau N, Brafman R, Benazera E (2006) Stochastic over-subscription planning using hierarchies of MDPs. In: Proceedings of the 16th international conference on automated planning and scheduling. Cumbria, UK, pp 121–130Moore A, Atkeson C (1993) Prioritized sweeping: reinforcement learning with less data and less real time. Mach Learn 13: 103–130Puterman ML (1994) Markov decision processes. Wiley Editors, New YorkPuterman ML (2005) Markov decision processes. Wiley Inter Science Editors, New YorkRussell S (2005) Artificial intelligence: a modern approach. Making complex decisions (Ch-17), 2nd edn. Pearson Prentice Hill Ed., USAShani G, Brafman R, Shimony S (2008) Prioritizing point-based POMDP solvers. IEEE Trans Syst Man Cybern 38(6): 1592–1605Sniedovich M (2006) Dijkstra’s algorithm revisited: the dynamic programming connexion. Control Cybern 35: 599–620Sniedovich M (2010) Dynamic programming: foundations and principles, 2nd edn. Pure and Applied Mathematics Series, UKTijms HC (2003) A first course in stochastic models. Discrete-time Markov decision processes (Ch-6). Wiley Editors, UKVanderbei RJ (1996) Optimal sailing strategies. Statistics and operations research program, University of Princeton, USA ( http://www.orfe.princeton.edu/~rvdb/sail/sail.html )Vanderbei RJ (2008) Linear programming: foundations and extensions, 3rd edn. Springer, New YorkWingate D, Seppi KD (2005) Prioritization methods for accelerating MDP solvers. J Mach Learn Res 6: 851–88
    • …
    corecore