skip to main content


Search for: All records

Creators/Authors contains: "Watkins, J."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. null (Ed.)
    Following rapid decompression in the conduit of a volcano, magma breaks into ash- to block-sized fragments, powering explosive sub-Plinian and Plinian eruptions that may generate destructive pyroclastic falls and flows. It is thus crucial to assess how magma breaks up into fragments. This task is difficult, however, because of the subterranean nature of the entire process and because the original size of pristine fragments is modified by secondary fragmentation and expansion. New textural observations of sub-Plinian and Plinian pumice lapilli reveal that some primary products of magma fragmentation survive by sintering together within seconds of magma break-up. Their size distributions reflect the energetics of fragmentation, consistent with products of rapid decompression experiments. Pumice aggregates thus offer a unique window into the previously inaccessible primary fragmentation process and could be used to determine the potential energy of fragmentation. 
    more » « less
  2. Abstract Generative Adversarial Networks trained on samples of simulated or actual events have been proposed as a way of generating large simulated datasets at a reduced computational cost. In this work, a novel approach to perform the simulation of photodetector signals from the time projection chamber of the EXO-200 experiment is demonstrated. The method is based on a Wasserstein Generative Adversarial Network — a deep learning technique allowing for implicit non-parametric estimation of the population distribution for a given set of objects. Our network is trained on real calibration data using raw scintillation waveforms as input. We find that it is able to produce high-quality simulated waveforms an order of magnitude faster than the traditional simulation approach and, importantly, generalize from the training sample and discern salient high-level features of the data. In particular, the network correctly deduces position dependency of scintillation light response in the detector and correctly recognizes dead photodetector channels. The network output is then integrated into the EXO-200 analysis framework to show that the standard EXO-200 reconstruction routine processes the simulated waveforms to produce energy distributions comparable to that of real waveforms. Finally, the remaining discrepancies and potential ways to improve the approach further are highlighted. 
    more » « less
    Free, publicly-accessible full text available June 1, 2024
  3. In the classical Steiner tree problem, given an undirected, connected graph G=(V,E) with non-negative edge costs and a set of terminals T⊆V, the objective is to find a minimum-cost tree E′⊆E that spans the terminals. The problem is APX-hard; the best known approximation algorithm has a ratio of ρ=ln(4)+ε<1.39. In this paper, we study a natural generalization, the multi-level Steiner tree (MLST) problem: given a nested sequence of terminals Tℓ⊂⋯⊂T1⊆V, compute nested trees Eℓ⊆⋯⊆E1⊆E that span the corresponding terminal sets with minimum total cost. The MLST problem and variants thereof have been studied under various names including Multi-level Network Design, Quality-of-Service Multicast tree, Grade-of-Service Steiner tree, and Multi-Tier tree. Several approximation results are known. We first present two simple O(ℓ)-approximation heuristics. Based on these, we introduce a rudimentary composite algorithm that generalizes the above heuristics, and determine its approximation ratio by solving a linear program. We then present a method that guarantees the same approximation ratio using at most 2ℓ Steiner tree computations. We compare these heuristics experimentally on various instances of up to 500 vertices using three different network generation models. We also present various integer linear programming (ILP) formulations for the MLST problem, and compare their running times on these instances. To our knowledge, the composite algorithm achieves the best approximation ratio for up to ℓ=100 levels, which is sufficient for most applications such as network visualization or designing multi-level infrastructure. 
    more » « less
  4. Abstract The EXO-200 experiment searched for neutrinoless double-beta decay of 136 Xe with a single-phase liquid xenon detector. It used an active mass of 110 kg of 80.6%-enriched liquid xenon in an ultra-low background time projection chamber with ionization and scintillation detection and readout. This paper describes the design and performance of the various support systems necessary for detector operation, including cryogenics, xenon handling, and controls. Novel features of the system were driven by the need to protect the thin-walled detector chamber containing the liquid xenon, to achieve high chemical purity of the Xe, and to maintain thermal uniformity across the detector. 
    more » « less