479 research outputs found
Quasirandom permutations are characterized by 4-point densities
For permutations Ï and Ï of lengths |Ï|â€|Ï| , let t(Ï,Ï) be the probability that the restriction of Ï to a random |Ï| -point set is (order) isomorphic to Ï . We show that every sequence {Ïj} of permutations such that |Ïj|ââ and t(Ï,Ïj)â1/4! for every 4-point permutation Ï is quasirandom (that is, t(Ï,Ïj)â1/|Ï|! for every Ï ). This answers a question posed by Graham
Structural Insights into Recognition of MDC1 by TopBP1 in DNA Replication Checkpoint Control
SummaryActivation of the DNA replication checkpoint by the ATR kinase requires protein interactions mediated by the ATR-activating protein, TopBP1. Accumulation of TopBP1 at stalled replication forks requires the interaction of TopBP1 BRCT5 with the phosphorylated SDT repeats of the adaptor protein MDC1. Here, we present the X-ray crystal structures of the tandem BRCT4/5 domains of TopBP1 free and in complex with a MDC1 consensus pSDpT phosphopeptide. TopBP1 BRCT4/5 adopts a variant BRCT-BRCT packing interface and recognizes its target peptide in a manner distinct from that observed in previous tandem BRCT- peptide structures. The phosphate-binding pocket and positively charged residues in a variant loop in BRCT5 present an extended binding surface for the negatively charged MDC1 phosphopeptide. Mutations in this surface reduce binding affinity and recruitment of TopBP1 to ÎłH2AX foci in cells. These studies reveal a different mode of phosphopeptide binding by BRCT domains in the DNA damage response
Spin-3/2 Nucleon and Delta Baryons in Lattice QCD
We present first results for masses of spin-3/2 N and Delta baryons in
lattice QCD using Fat-Link Irrelevant Clover (FLIC) fermions. Spin-3/2
interpolating fields providing overlap with both spin-3/2 and spin-1/2 states
are considered. In the isospin-1/2 sector, we observe, after appropriate spin
and parity projection, a strong signal for the J^P=3/2^- state together with a
weak but discernible signal for the 3/2^+ state with a mass splitting near that
observed experimentally. We also find good agreement between the 1/2^+/- masses
and earlier nucleon mass simulations with the standard spin-1/2 interpolating
field. For the isospin-3/2 Delta states, clear mass splittings are observed
between the various 1/2^+/- and 3/2^+/- channels, with the calculated level
orderings in good agreement with those observed empirically.Comment: 17 pages, 8 figures, 2 table
Modulation control and spectral shaping of optical fiber supercontinuum generation in the picosecond regime
Numerical simulations are used to study how fiber supercontinuum generation
seeded by picosecond pulses can be actively controlled through the use of input
pulse modulation. By carrying out multiple simulations in the presence of
noise, we show how tailored supercontinuum Spectra with increased bandwidth and
improved stability can be generated using an input envelope modulation of
appropriate frequency and depth. The results are discussed in terms of the
non-linear propagation dynamics and pump depletion.Comment: Aspects of this work were presented in Paper ThJ2 at OECC/ACOFT 2008,
Sydney Australia 7-10 July (2008). Journal paper submitted for publication 30
July 200
Recursive computation of limited lookahead supervisory controls for discrete event systems
We continue the study of limited lookahead policies in supervisory control of discrete event systems undertaken in a previous paper. On-line control of discrete event systems using limited lookahead policies requires, after the execution of each event, the calculation of the supremal controllable sublanguage of a given language with respect to another larger language. These two languages are finite and represented by their tree generators, where one tree is a subtree of the other. These trees change dynamically from step to step, where one step is the execution of one event by the system. We show in this paper how to perform this calculation in a recursive manner, in the sense that the calculation for a new pair of trees can make use of the calculation for the preceding pair, thus substantially reducing the amount of computation that has to be done on-line. In order to make such a recursive procedure possible from step to step, we show how the calculation for a single step (i.e., for a given pair of trees) can itself be performed recursively by means of a backward dynamic programming algorithm on the vertices of the larger tree. These two nested recursive procedures are also extended to the limited lookahead version of the âsupervisory control problem with tolerance.âPeer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/45118/1/10626_2005_Article_BF01439177.pd
Dalitz plot analysis of D_s+ and D+ decay to pi+pi-pi+ using the K-matrix formalism
FOCUS results from Dalitz plot analysis of D_s+ and D+ to pi+pi-pi+ are
presented. The K-matrix formalism is applied to charm decays for the first time
to fully exploit the already existing knowledge coming from the light-meson
spectroscopy experiments. In particular all the measured dynamics of the S-wave
pipi scattering, characterized by broad/overlapping resonances and large
non-resonant background, can be properly included. This paper studies the
extent to which the K-matrix approach is able to reproduce the observed Dalitz
plot and thus help us to understand the underlying dynamics. The results are
discussed, along with their possible implications on the controversial nature
of the sigma meson.Comment: To be submitted to Phys.Lett.B A misprint corrected in formula
Ultra-High Energy Neutrino Fluxes and Their Constraints
Applying our recently developed propagation code we review extragalactic
neutrino fluxes above 10^{14} eV in various scenarios and how they are
constrained by current data. We specifically identify scenarios in which the
cosmogenic neutrino flux, produced by pion production of ultra high energy
cosmic rays outside their sources, is considerably higher than the
"Waxman-Bahcall bound". This is easy to achieve for sources with hard injection
spectra and luminosities that were higher in the past. Such fluxes would
significantly increase the chances to detect ultra-high energy neutrinos with
experiments currently under construction or in the proposal stage.Comment: 11 pages, 15 figures, version published in Phys.Rev.
Search for and Using Genetic Programming Event Selection
We apply a genetic programming technique to search for the double Cabibbo
suppressed decays and .
We normalize these decays to their Cabibbo favored partners and find
\Lambda_c^+ \to p K^+ \pi^-\Lambda_c^+ \to p K^-
\pi^+ and D_s^+ \to K^+ K^+
\pi^-D_s^+ \to K^+ K^- \pi^+ where
the first errors are statistical and the second are systematic. Expressed as
90% confidence levels (CL), we find and respectively.
This is the first successful use of genetic programming in a high energy
physics data analysis.Comment: 10 page
Measurements of Branching Ratios
Using data collected by the fixed target Fermilab experiment FOCUS, we
measure the branching ratios of the Cabibbo favored decays , , and relative to to be
, , and ,
respectively. We report the first observation of the Cabibbo suppressed decay
and we measure the branching ratio relative to
to be . We also set 90%
confidence level upper limits for and relative to to
be 0.12 and 0.05, respectively. We find an indication of the decays and and set
90% confidence level upper limits for the branching ratios with respect to
to be 0.12 and 1.72, respectively. Finally, we
determine the 90% C.L. upper limit for the resonant contribution relative to to be 0.10.Comment: 14 pages, 8 figure
Measurement of the branching ratio of the decay D^0 -> \pi^-\mu^+\nu relative to D^0 -> K^-\mu^+\nu
We present a new measurement of the branching ratio of the Cabibbo suppressed
decay D^0\to \pi^-\mu^+\nu relative to the Cabibbo favored decay D^0\to
K^-\mu^+\nu and an improved measurement of the ratio
|\frac{f_+^{\pi}(0)}{f_+^{K}(0)}|. Our results are 0.074 \pm 0.008 \pm 0.007
for the branching ratio and 0.85 \pm 0.04 \pm 0.04 \pm 0.01 for the form factor
ratio, respectively.Comment: 13pages, 3 figure
- âŠ