The Dark matter Experiment using Argon Pulse-shape discrimination (DEAP) has been designed for a direct detection search for particle dark matter using a single-phase liquid argon target. The projected cross section sensitivity for DEAP-3600 to the spin-independent scattering of Weakly Interacting Massive Particles (WIMPs) on nucleons is 10 −46 cm 2 for a 100 GeV/c 2 WIMP mass with a fiducial exposure of 3 tonne-years. This paper describes the physical properties and construction of the DEAP-3600 detector.
This Letter reports the first results of a direct dark matter search with the DEAP-3600 single-phase liquid argon (LAr) detector. The experiment was performed 2 km underground at SNOLAB (Sudbury, Canada) utilizing a large target mass, with the LAr target contained in a spherical acrylic vessel of 3600 kg capacity. The LAr is viewed by an array of PMTs, which would register scintillation light produced by rare nuclear recoil signals induced by dark matter particle scattering. An analysis of 4.44 live days (fiducial exposure of 9.87 ton day) of data taken during the initial filling phase demonstrates the best electronic recoil rejection using pulse-shape discrimination in argon, with leakage <1.2×10^{-7} (90% C.L.) between 15 and 31 keV_{ee}. No candidate signal events are observed, which results in the leading limit on weakly interacting massive particle (WIMP)-nucleon spin-independent cross section on argon, <1.2×10^{-44} cm^{2} for a 100 GeV/c^{2} WIMP mass (90% C.L.).
We present two on-line algorithms for maintaining a topological order of a directed n-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm handles m arc additions in O(m 3/2 ) time. For sparse graphs (m/n = O(1)), this bound improves the best previous bound by a logarithmic factor, and is tight to within a constant factor among algorithms satisfying a natural locality property. Our second algorithm handles an arbitrary sequence of arc additions in O(n 5/2 ) time. For sufficiently dense graphs, this bound improves the best previous bound by a polynomial factor. Our bound may be far from tight: we show that the algorithm can take Ω(n 2 2 √ 2 lg n ) time by relating its performance to a generalization of the k-levels problem of combinatorial geometry. A completely different algorithm running in Θ(n 2 log n) time was given recently by Bender, Fineman, and Gilbert. We extend both of our algorithms to the maintenance of strong components, without affecting the asymptotic time bounds.
We demonstrate adiabatic rapid passage on a subpicosecond time scale in a single semiconductor quantum dot, enabling the exploration of a regime of strong (and rapidly varying) Rabi energies for optical control of excitons. An observed dependence of the exciton inversion efficiency on the sign of the pulse chirp demonstrates the dominance of phonon-mediated dephasing, which is suppressed for positive chirp at low temperature. Our findings will support the realization of dynamical decoupling strategies and suggest that multiphonon emission and/or non-Markovian effects should be taken into account.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.