skip to main content
Explore Scholarly Publications and Datasets in the NSF-PAR

  • Home
  • Search Results
  • Page 1 of 34

Search for: All records

Creators/Authors contains: "Ma, H."

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. ; ; ; ; ; ; ; ; ; ; et al ( , Few-Body Systems)
    Free, publicly-accessible full text available June 1, 2023
  2. ; ; ; ( , Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS))
    Accepted Manuscript Full Text Available
  3. ; ; ; ; ( , 18th International Conference on Autonomous Agents and Multi-Agent Systems)
    In this paper, we adopt a new perspective on the Multi-Agent Path Finding (MAPF) problem and view it as a Constraint Satisfaction Problem (CSP). A variable corresponds to an agent, its domain is the set of all paths from the start vertex to the goal vertex of the agent, and the constraints allow only conflict-free paths for each pair of agents. Although the domains and constraints are only implicitly defined, this new CSP perspective allows us to use successful techniques from CSP search. With the concomitant idea of using matrix computations for calculating the size of the reduced domain ofmore »an uninstantiated variable, we apply Dynamic Variable Ordering and Rapid Random Restarts to the MAPF problem. In our experiments, the resulting simple polynomial-time MAPF solver, called Matrix MAPF solver, either outperforms or matches the performance of many state-of-the-art solvers for the MAPF problem and its variants.« less
    Accepted Manuscript Full Text Available
  4. ; ; ; ; ; ; ; ; ; ; et al ( , Journal of Instrumentation)
    Abstract The Phase-I trigger readout electronics upgrade of the ATLAS Liquid Argon calorimeters enhances thephysics reach of the experiment during the upcoming operation atincreasing Large Hadron Collider luminosities.The new system, installed during the second Large Hadron Collider Long Shutdown,increases the trigger readout granularity by up to a factor of tenas well as its precision and range.Consequently, the background rejection at trigger level is improvedthrough enhanced filtering algorithms utilizing the additional informationfor topological discrimination of electromagnetic and hadronic shower shapes.This paper presents the final designs of the new electronic elements,their custom electronic devices, the proceduresused to validate their proper functioning, andmore »the performance achievedduring the commissioning of this system.« less
    Free, publicly-accessible full text available May 1, 2023
  5. ; ; ; ; ; ( , Proceedings of the AAAI Conference on Artificial Intelligence (AAAI))
    Accepted Manuscript Full Text Available
  6. ; ; ; ; ; ; ; ; ; ; et al ( , Computing and Software for Big Science)
    Abstract The accurate simulation of additional interactions at the ATLAS experiment for the analysis of proton–proton collisions delivered by the Large Hadron Collider presents a significant challenge to the computing resources. During the LHC Run 2 (2015–2018), there were up to 70 inelastic interactions per bunch crossing, which need to be accounted for in Monte Carlo (MC) production. In this document, a new method to account for these additional interactions in the simulation chain is described. Instead of sampling the inelastic interactions and adding their energy deposits to a hard-scatter interaction one-by-one, the inelastic interactions are presampled, independent of the hardmore »scatter, and stored as combined events. Consequently, for each hard-scatter interaction, only one such presampled event needs to be added as part of the simulation chain. For the Run 2 simulation chain, with an average of 35 interactions per bunch crossing, this new method provides a substantial reduction in MC production CPU needs of around 20%, while reproducing the properties of the reconstructed quantities relevant for physics analyses with good accuracy.« less
    Free, publicly-accessible full text available December 1, 2023
  7. ; ; ; ; ; ; ; ; ; ; et al ( , Computing and Software for Big Science)
    Abstract The ATLAS experiment at the Large Hadron Collider has a broad physics programme ranging from precision measurements to direct searches for new particles and new interactions, requiring ever larger and ever more accurate datasets of simulated Monte Carlo events. Detector simulation with Geant4 is accurate but requires significant CPU resources. Over the past decade, ATLAS has developed and utilized tools that replace the most CPU-intensive component of the simulation—the calorimeter shower simulation—with faster simulation methods. Here, AtlFast3, the next generation of high-accuracy fast simulation in ATLAS, is introduced. AtlFast3 combines parameterized approaches with machine-learning techniques and is deployed tomore »meet current and future computing challenges, and simulation needs of the ATLAS experiment. With highly accurate performance and significantly improved modelling of substructure within jets, AtlFast3 can simulate large numbers of events for a wide range of physics processes.« less
    Free, publicly-accessible full text available December 1, 2023
  8. ; ; ; ; ; ; ; ; ; ; et al ( , Proceedings of the Symposium on Combinatorial Search (SoCS))
    The MAPF problem is the fundamental problem of planning paths for multiple agents, where the key constraint is that the agents will be able to follow these paths concurrently without colliding with each other. Applications of MAPF include automated warehouses and autonomous vehicles. Research on MAPF has been flourishing in the past couple of years. Different MAPF research papers make different assumptions, e.g., whether agents can traverse the same road at the same time, and have different objective functions, e.g., minimize makespan or sum of agents' actions costs. These assumptions and objectives are sometimes implicitly assumed or described informally. Thismore »makes it difficult to establish appropriate baselines for comparison in research papers, as well as making it difficult for practitioners to find the papers relevant to their concrete application. This paper aims to fill this gap and support researchers and practitioners by providing a unifying terminology for describing common MAPF assumptions and objectives. In addition, we also provide pointers to two MAPF benchmarks. In particular, we introduce a new grid-based benchmark for MAPF, and demonstrate experimentally that it poses a challenge to contemporary MAPF algorithms.« less
    Accepted Manuscript Full Text Available
  9. ; ; ; ; ; ; ; ; ; ; et al ( , Physical Review D)
    Free, publicly-accessible full text available May 1, 2023
  10. ; ; ; ; ; ; ; ; ; ; et al ( , Physical Review D)
    Free, publicly-accessible full text available May 1, 2023