Ohio State University

About: Ohio State University is a education organization based out in Columbus, Ohio, United States. It is known for research contribution in the topics: Population & Cancer. The organization has 102421 authors who have published 222715 publications receiving 8373403 citations. The organization is also known as: Ohio State & The Ohio State University.

Searching for dark matter annihilation from Milky Way dwarf spheroidal galaxies with six years of Fermi Large Area Telescope data

Abstract: The dwarf spheroidal satellite galaxies (dSphs) of the Milky Way are some of the most dark matter (DM) dominated objects known. We report on γ-ray observations of Milky Way dSphs based on six years of Fermi Large Area Telescope data processed with the new Pass8 event-level analysis. None of the dSphs are significantly detected in γ rays, and we present upper limits on the DM annihilation cross section from a combined analysis of 15 dSphs. These constraints are among the strongest and most robust to date and lie below the canonical thermal relic cross section for DM of mass ≲100 GeV annihilating via quark and τ-lepton channels.

Apoptosis and delayed degeneration after spinal cord injury in rats and monkeys.

Abstract: Apoptosis is a morphologically defined form of programmed cell death seen in a variety of circumstances, including immune cell selection, carcinogenesis and development. Apoptosis has very recently been seen after ischemic or traumatic injury to the central nervous system (CNS), suggesting that active cell death as well as passive necrosis may mediate damage after CNS injury. After spinal cord injury (SCI) in the rat, typical post-traumatic necrosis occurred, but in addition, apoptotic cells were found from 6 hours to 3 weeks after injury, especially in the spinal white matter. Apoptotic cells were positive for oligodendrocyte markers. After SCI in monkeys, apoptotic cells were found within remote degenerating fiber tracts. Both secondary degeneration at the site of SCI and the chronic demyelination of tracts away from the injury appear to be due in part to apoptosis. As cytokines have been shown to mediate oligodendrocyte death in vitro, it seems likely that chronic demyelination after CNS injury shares features with chronic degenerative disorders like multiple sclerosis.

Assessing the effects of gamification in the classroom

Abstract: Gamification, the application of game elements to non-game settings, continues to grow in popularity as a method to increase student engagement in the classroom. We tested students across two courses, measuring their motivation, social comparison, effort, satisfaction, learner empowerment, and academic performance at four points during a 16-week semester. One course received a gamified curriculum, featuring a leaderboard and badges, whereas the other course received the same curriculum without the gamified elements. Our results found that students in the gamified course showed less motivation, satisfaction, and empowerment over time than those in the non-gamified class. The effect of course type on students' final exam scores was mediated by students' levels of intrinsic motivation, with students in the gamified course showing less motivation and lower final exam scores than the non-gamified class. This suggests that some care should be taken when applying certain gamification mechanics to educational settings. Longitudinal study on effects of gamification in the classroom.71 students surveyed at four time points in gamified or non-gamified course.Over time, gamified students were less motivated, empowered, and satisfied.Gamified course negatively affected final exam grades through intrinsic motivation.Gamified systems strongly featuring rewards may have negative effects.

The Strong Perfect Graph Theorem

Abstract: A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. The ?strong perfect graph conjecture? (Berge, 1961) asserts that a graph is perfect if and only if it is Berge. A stronger conjecture was made recently by Conforti, Cornu?ejols and Vuiskovi?c ? that every Berge graph either falls into one of a few basic classes, or admits one of a few kinds of separation (designed so that a minimum counterexample to Berge?s conjecture cannot have either of these properties). In this paper we prove both of these conjectures.