skip to main content


Search for: All records

Creators/Authors contains: "Pandey, P."

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 May 1, 2024
  2. Given an input stream of size N , a -heavy hiter is an item that occurs at least N times in S. The problem of finding heavy-hitters is extensively studied in the database literature. We study a real-time heavy-hitters variant in which an element must be reported shortly after we see its T = N - th occurrence (and hence becomes a heavy hitter). We call this the Timely Event Detection (TED) Problem. The TED problem models the needs of many real-world monitoring systems, which demand accurate (i.e., no false negatives) and timely reporting of all events from large, high-speed streams, and with a low reporting threshold (high sensitivity). Like the classic heavy-hitters problem, solving the TED problem without false-positives requires large space ((N ) words). Thus in-RAM heavy-hitters algorithms typically sacrfice accuracy (i.e., allow false positives), sensitivity, or timeliness (i.e., use multiple passes). We show how to adapt heavy-hitters algorithms to exter- nal memory to solve the TED problem on large high-speed streams while guaranteeing accuracy, sensitivity, and timeli- ness. Our data structures are limited only by I/O-bandwidth (not latency) and support a tunable trade-off between report- ing delay and I/O overhead. With a small bounded reporting delay, our algorithms incur only a logarithmic I/O overhead. We implement and validate our data structures empirically using the Firehose streaming benchmark. Multi-threaded ver- sions of our structures can scale to process 11M observations per second before becoming CPU bound. In comparison, a naive adaptation of the standard heavy-hitters algorithm to external memory would be limited by the storage device’s random I/O throughput, i.e., approx 100K observations per second. 
    more » « less
  3. The double-spin-polarization observable E for γ p → pπ0 has been measured with the CEBAF Large Acceptance Spectrometer (CLAS) at photon beam energies Eγ from 0.367 to 2.173 GeV (corresponding to center-ofmass energies from 1.240 to 2.200 GeV) for pion center-ofmass angles, cos θc.m. π0 , between − 0.86 and 0.82. These new CLAS measurements cover a broader energy range and have smaller uncertainties compared to previous CBELSA data and provide an important independent check on systematics. These measurements are compared to predictions as well as new global fits from The George Washington University, Mainz, and Bonn-Gatchina groups. Their inclusion in multipole analyses will allow us to refine our understanding of the single-pion production contribution to the Gerasimov-Drell- Hearn sum rule and improve the determination of resonance properties, which will be presented in a future publication. 
    more » « less
    Free, publicly-accessible full text available September 1, 2024
  4. Free, publicly-accessible full text available July 1, 2024
  5. Free, publicly-accessible full text available June 1, 2024
  6. Free, publicly-accessible full text available April 1, 2024
  7. Free, publicly-accessible full text available April 1, 2024
  8. Free, publicly-accessible full text available May 1, 2024