skip to main content

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Friday, December 13 until 2:00 AM ET on Saturday, December 14 due to maintenance. We apologize for the inconvenience.


Search for: All records

Creators/Authors contains: "Kalinkin, D."

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. Abstract

    The successful realization of the EIC scientific program requires the design and construction of high-performance particle detectors. Recent developments in the field of scientific computing and increased availability of high performance computing resources have made it possible to perform optimization of multi-parameter designs, even when the latter require longer computational times (for example simulations of particle interactions with matter). Procedures involving machine-assisted techniques used to inform the design decision have seen a considerable growth in popularity among the EIC detector community. Having already been realized for tracking and RICH PID detectors, it has a potential application in calorimetry designs. A SciGlass barrel calorimeter originally designed for EIC Detector-1 has a semi-projective geometry that allows for non-trivial performance gains, but also poses special challenges in the way of effective exploration of the design space while satisfying the available space and the cell dimension constraints together with the full detector acceptance requirement. This talk will cover specific approaches taken to perform this detector design optimization.

     
    more » « less
    Free, publicly-accessible full text available May 1, 2025
  2. Free, publicly-accessible full text available August 29, 2025
  3. Free, publicly-accessible full text available August 1, 2025
  4. Free, publicly-accessible full text available July 1, 2025
  5. Free, publicly-accessible full text available May 1, 2025