skip to main content


Search for: All records

Creators/Authors contains: "Zhao, Z."

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. Free, publicly-accessible full text available September 1, 2024
  2. Chen, X. ; Todorov, V. (Ed.)
  3. Abstract

    FeSe1−xSxremains one of the most enigmatic systems of Fe-based superconductors. While much is known about the orthorhombic parent compound, FeSe, the tetragonal samples, FeSe1−xSxwithx > 0.17, remain relatively unexplored. Here, we provide an in-depth investigation of the electronic states of tetragonal FeSe0.81S0.19, using scanning tunneling microscopy and spectroscopy (STM/S) measurements, supported by angle-resolved photoemission spectroscopy (ARPES) and theoretical modeling. We analyze modulations of the local density of states (LDOS) near and away from Fe vacancy defects separately and identify quasiparticle interference (QPI) signals originating from multiple regions of the Brillouin zone, including the bands at the zone corners. We also observe that QPI signals coexist with a much stronger LDOS modulation for states near the Fermi level whose period is independent of energy. Our measurements further reveal that this strong pattern appears in the STS measurements as short range stripe patterns that are locally two-fold symmetric. Since these stripe patterns coexist with four-fold symmetric QPI around Fe-vacancies, the origin of their local two-fold symmetry must be distinct from that of nematic states in orthorhombic samples. We explore several aspects related to the stripes, such as the role of S and Fe-vacancy defects, and whether they can be explained by QPI. We consider the possibility that the observed stripe patterns may represent incipient charge order correlations, similar to those observed in the cuprates.

     
    more » « less
  4. ABSTRACT Efficient contact tracing and isolation is an effective strategy to control epidemics, as seen in the Ebola epidemic and COVID-19 pandemic. An important consideration in contact tracing is the budget on the number of individuals asked to quarantine—the budget is limited for socioeconomic reasons (e.g., having a limited number of contact tracers). Here, we present a Markov Decision Process (MDP) framework to formulate the problem of using contact tracing to reduce the size of an outbreak while limiting the number of people quarantined. We formulate each step of the MDP as a combinatorial problem, MinExposed, which we demonstrate is NP-Hard. Next, we develop two approximation algorithms, one based on rounding the solutions of a linear program and another (greedy algorithm) based on choosing nodes with a high (weighted) degree. A key feature of the greedy algorithm is that it does not need complete information of the underlying social contact network, making it implementable in practice. Using simulations over realistic networks, we show how the algorithms can help in bending the epidemic curve with a limited number of isolated individuals. 
    more » « less
  5. Efficient contact tracing and isolation is an effective strategy to control epidemics, as seen in the Ebola epidemic and COVID-19 pandemic. An important consideration in contact tracing is the budget on the number of individuals asked to quarantine—the budget is limited for socioeconomic reasons (e.g., having a limited number of contact tracers). Here, we present a Markov Decision Process (MDP) framework to formulate the problem of using contact tracing to reduce the size of an outbreak while limiting the number of people quarantined. We formulate each step of the MDP as a combinatorial problem, MinExposed, which we demonstrate is NP-Hard. Next, we develop two approximation algorithms, one based on rounding the solutions of a linear program and another (greedy algorithm) based on choosing nodes with a high (weighted) degree. A key feature of the greedy algorithm is that it does not need complete information of the underlying social contact network, making it implementable in practice. Using simulations over realistic networks, we show how the algorithms can help in bending the epidemic curve with a limited number of isolated individuals. 
    more » « less
  6. Delaigle, A. ; Lauritzen, S. ; Yao, Q. (Ed.)
  7. Delaigle, A ; Lauritzen, S. ; Yao, Q. (Ed.)
  8. null (Ed.)
    Traditional full-waveform inversion (FWI) methods only render a “best-fit” model that cannot account for uncertainties of the ill-posed inverse problem. Additionally, local optimization-based FWI methods cannot always converge to a geologically meaningful solution unless the inversion starts with an accurate background model. We seek the solution for FWI in the Bayesian inference framework to address those two issues. In Bayesian inference, the model space is directly probed by sampling methods such that we obtain a reliable uncertainty appraisal, determine optimal models, and avoid entrapment in a small local region of the model space. The solution of such a statistical inverse method is completely described by the posterior distribution, which quantifies the distributions for parameters and inversion uncertainties. 
    more » « less