105 research outputs found

    Licensing of primordial germ cells for gametogenesis depends on genital ridge signaling

    Get PDF
    In mouse embryos at mid-gestation, primordial germ cells (PGCs) undergo licensing to become gametogenesis-competent cells (GCCs), gaining the capacity for meiotic initiation and sexual differentiation. GCCs then initiate either oogenesis or spermatogenesis in response to gonadal cues. Germ cell licensing has been considered to be a cell-autonomous and gonad-independent event, based on observations that some PGCs, having migrated not to the gonad but to the adrenal gland, nonetheless enter meiosis in a time frame parallel to ovarian germ cells -- and do so regardless of the sex of the embryo. Here we test the hypothesis that germ cell licensing is cell-autonomous by examining the fate of PGCs in Gata4 conditional mutant (Gata4 cKO) mouse embryos. Gata4, which is expressed only in somatic cells, is known to be required for genital ridge initiation. PGCs in Gata4 cKO mutants migrated to the area where the genital ridge, the precursor of the gonad, would ordinarily be formed. However, these germ cells did not undergo licensing and instead retained characteristics of PGCs. Our results indicate that licensing is not purely cell-autonomous but is induced by the somatic genital ridge

    Gallavotti-Cohen-Type symmetry related to cycle decompositions for Markov chains and biochemical applications

    Full text link
    We slightly extend the fluctuation theorem obtained in \cite{LS} for sums of generators, considering continuous-time Markov chains on a finite state space whose underlying graph has multiple edges and no loop. This extended frame is suited when analyzing chemical systems. As simple corollary we derive in a different method the fluctuation theorem of D. Andrieux and P. Gaspard for the fluxes along the chords associated to a fundamental set of oriented cycles \cite{AG2}. We associate to each random trajectory an oriented cycle on the graph and we decompose it in terms of a basis of oriented cycles. We prove a fluctuation theorem for the coefficients in this decomposition. The resulting fluctuation theorem involves the cycle affinities, which in many real systems correspond to the macroscopic forces. In addition, the above decomposition is useful when analyzing the large deviations of additive functionals of the Markov chain. As example of application, in a very general context we derive a fluctuation relation for the mechanical and chemical currents of a molecular motor moving along a periodic filament.Comment: 23 pages, 5 figures. Correction

    Intercalibration of the barrel electromagnetic calorimeter of the CMS experiment at start-up

    Get PDF
    Calibration of the relative response of the individual channels of the barrel electromagnetic calorimeter of the CMS detector was accomplished, before installation, with cosmic ray muons and test beams. One fourth of the calorimeter was exposed to a beam of high energy electrons and the relative calibration of the channels, the intercalibration, was found to be reproducible to a precision of about 0.3%. Additionally, data were collected with cosmic rays for the entire ECAL barrel during the commissioning phase. By comparing the intercalibration constants obtained with the electron beam data with those from the cosmic ray data, it is demonstrated that the latter provide an intercalibration precision of 1.5% over most of the barrel ECAL. The best intercalibration precision is expected to come from the analysis of events collected in situ during the LHC operation. Using data collected with both electrons and pion beams, several aspects of the intercalibration procedures based on electrons or neutral pions were investigated

    Anisotropy and chemical composition of ultra-high energy cosmic rays using arrival directions measured by the Pierre Auger Observatory

    Get PDF
    The Pierre Auger Collaboration has reported evidence for anisotropy in the distribution of arrival directions of the cosmic rays with energies E>Eth=5.5×1019E>E_{th}=5.5\times 10^{19} eV. These show a correlation with the distribution of nearby extragalactic objects, including an apparent excess around the direction of Centaurus A. If the particles responsible for these excesses at E>EthE>E_{th} are heavy nuclei with charge ZZ, the proton component of the sources should lead to excesses in the same regions at energies E/ZE/Z. We here report the lack of anisotropies in these directions at energies above Eth/ZE_{th}/Z (for illustrative values of Z=6, 13, 26Z=6,\ 13,\ 26). If the anisotropies above EthE_{th} are due to nuclei with charge ZZ, and under reasonable assumptions about the acceleration process, these observations imply stringent constraints on the allowed proton fraction at the lower energies

    Search for non-Gaussianity in pixel, harmonic and wavelet space: compared and combined

    Full text link
    We present a comparison between three approaches to test non-Gaussianity of cosmic microwave background data. The Minkowski functionals, the empirical process method and the skewness of wavelet coefficients are applied to maps generated from non-standard inflationary models and to Gaussian maps with point sources included. We discuss the different power of the pixel, harmonic and wavelet space methods on these simulated almost full-sky data (with Planck like noise). We also suggest a new procedure consisting of a combination of statistics in pixel, harmonic and wavelet space.Comment: Accepted for publication in PR

    Network-Formation Games with Regular Objectives

    Full text link
    Abstract. Classical network-formation games are played on a directed graph. Players have reachability objectives, and each player has to select a path satisfy-ing his objective. Edges are associated with costs, and when several players use the same edge, they evenly share its cost. The theoretical and practical aspects of network-formation games have been extensively studied and are well understood. We introduce and study network-formation games with regular objectives. In our setting, the edges are labeled by alphabet letters and the objective of each player is a regular language over the alphabet of labels, given by means of an automaton or a temporal-logic formula. Thus, beyond reachability properties, a player may restrict attention to paths that satisfy certain properties, referring, for example, to the providers of the traversed edges, the actions associated with them, their quality of service, security, etc. Unlike the case of network-formation games with reachability objectives, here the paths selected by the players need not be simple, thus a player may traverse some transitions several times. Edge costs are shared by the players with the share being proportional to the number of times the transition is traversed. We study the exis-tence of a pure Nash equilibrium (NE), convergence of best-response-dynamics, the complexity of finding the social optimum, and the inefficiency of a NE com-pared to a social-optimum solution. We examine several classes of networks (for example, networks with uniform edge costs, or alphabet of size 1) and several classes of regular objectives. We show that many properties of classical network-formation games are no longer valid in our game. In particular, a pure NE might not exist and the Price of Stability equals the number of players (as opposed to logarithmic in the number of players in the classic setting, where a pure NE al-ways exists). In light of these results, we also present special cases for which the resulting game is more stable.

    CMS physics technical design report : Addendum on high density QCD with heavy ions

    Get PDF
    Peer reviewe

    Description and performance of track and primary-vertex reconstruction with the CMS tracker

    Get PDF
    A description is provided of the software algorithms developed for the CMS tracker both for reconstructing charged-particle trajectories in proton-proton interactions and for using the resulting tracks to estimate the positions of the LHC luminous region and individual primary-interaction vertices. Despite the very hostile environment at the LHC, the performance obtained with these algorithms is found to be excellent. For tbar t events under typical 2011 pileup conditions, the average track-reconstruction efficiency for promptly-produced charged particles with transverse momenta of pT > 0.9GeV is 94% for pseudorapidities of |η| < 0.9 and 85% for 0.9 < |η| < 2.5. The inefficiency is caused mainly by hadrons that undergo nuclear interactions in the tracker material. For isolated muons, the corresponding efficiencies are essentially 100%. For isolated muons of pT = 100GeV emitted at |η| < 1.4, the resolutions are approximately 2.8% in pT, and respectively, 10μm and 30μm in the transverse and longitudinal impact parameters. The position resolution achieved for reconstructed primary vertices that correspond to interesting pp collisions is 10–12μm in each of the three spatial dimensions. The tracking and vertexing software is fast and flexible, and easily adaptable to other functions, such as fast tracking for the trigger, or dedicated tracking for electrons that takes into account bremsstrahlung
    corecore