Y. Cheng

ORCID: 0000-0002-2602-935X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Particle physics theoretical and experimental studies
  • High-Energy Particle Collisions Research
  • Quantum Chromodynamics and Particle Interactions
  • Particle Detector Development and Performance
  • Dark Matter and Cosmic Phenomena
  • Computational Physics and Python Applications
  • Cosmology and Gravitation Theories
  • Neutrino Physics Research
  • Black Holes and Theoretical Physics
  • X-ray Diffraction in Crystallography
  • Advanced Graph Theory Research
  • Medical Imaging Techniques and Applications
  • Radiation Detection and Scintillator Technologies
  • Distributed and Parallel Computing Systems
  • Advanced Differential Equations and Dynamical Systems
  • Limits and Structures in Graph Theory
  • Crystallization and Solubility Studies
  • Genetic Mapping and Diversity in Plants and Animals
  • Genetic Associations and Epidemiology
  • Big Data Technologies and Applications
  • graph theory and CDMA systems
  • E-commerce and Technology Innovations
  • Crystallography and molecular interactions
  • Organophosphorus compounds synthesis
  • Complexity and Algorithms in Graphs

Cornell University
2016-2024

Bocconi University
2024

Fermi National Accelerator Laboratory
2013-2023

Institute of High Energy Physics
2023

A. Alikhanyan National Laboratory
2019-2023

National Taiwan University
2022-2023

University of Chicago
2013-2019

National Central University
2018-2019

Rutherford Appleton Laboratory
2017

The University of Adelaide
2015-2016

This document is the final report of ATLAS-CMS Dark Matter Forum, a forum organized by ATLAS and CMS collaborations with participation experts on theories Matter, to select minimal basis set dark matter simplified models that should support design early LHC Run-2 searches. A prioritized, compact benchmark proposed, accompanied studies parameter space these repository generator implementations. also addresses how apply Effective Field Theory formalism for collider searches present results...

10.1016/j.dark.2019.100371 article EN cc-by Physics of the Dark Universe 2019-09-13

Particles beyond the Standard Model (SM) can generically have lifetimes that are long compared to SM particles at weak scale. When produced experiments such as Large Hadron Collider (LHC) CERN, these long-lived (LLPs) decay far from interaction vertex of primary proton-proton collision. Such LLP signatures distinct those promptly decaying targeted by majority searches for new physics LHC, often requiring customized techniques identify, example, significantly displaced vertices, tracks with...

10.1088/1361-6471/ab4574 article EN cc-by Journal of Physics G Nuclear and Particle Physics 2020-09-01

More and more rare genetic variants are being detected in the human genome, it is believed that besides common variants, some also explain part of phenotypic variance for diseases. Due to importance many statistical methods have been proposed test associations between traits. However, existing studies, most only multiple loci one trait; therefore, joint information traits has not considered simultaneously sufficiently. In this article, we present a study testing traits, where trait value can...

10.1017/s0016672315000269 article EN Genetics Research 2016-01-01

Given graphs $G_1,\ldots,G_s$ all on a common vertex set and graph $H$ with $e(H) = s$, copy of is \emph{transversal} or \emph{rainbow} if it contains one edge from each $G_i$. We establish stability result for transversal Hamilton cycles: the minimum degree required to guarantee cycle can be lowered as long collection $G_1,\ldots,G_n$ far in edit distance several extremal cases. obtain an analogous paths. The proof combination our newly developed regularity-blow-up method transversals,...

10.48550/arxiv.2403.09913 preprint EN arXiv (Cornell University) 2024-03-14

Given a collection $\mathcal{G} =\{G_1,G_2,\dots,G_m\}$ of graphs on the common vertex set $V$ size $n$, an $m$-edge graph $H$ same is transversal in $\mathcal{G}$ if there exists bijection $\varphi :E(H)\rightarrow [m]$ such that $e \in E(G_{\varphi(e)})$ for all $e\in E(H)$. Denote $\delta(\mathcal{G}):=\operatorname*{min}\left\{\delta(G_i): i\in [m]\right\}$. In this paper, we first establish minimum degree condition existence Hamilton paths $\mathcal{G}$: $n=m+1$ and...

10.48550/arxiv.2406.13998 preprint EN arXiv (Cornell University) 2024-06-20

The extended use of tracking information at the trigger level in LHC is crucial for and data acquisition (TDAQ) system to fulfill its task.Precise fast important identify specific decay products Higgs boson or new phenomena, as well distinguish contributions coming from many collisions that occur every bunch crossing.However, track reconstruction among most demanding tasks performed by TDAQ computing farm; fact, complete full Level-1 accept rate (100 kHz) not possible.In order overcome this...

10.22323/1.254.0040 article EN cc-by-nc-nd 2015-12-30

The presence of spores in milk can cause numerous quality and shelf life issues for dairy products. Microfiltration (MF) using a 1.4 µm pore size effectively remove vegetative bacterial cells from is used commercial applications. However, this may not be equally effective spore removal. objective study was to determine the effectiveness MF 1.2 removing Bacillus licheniformis (BL) Geobacillus spp. (GEO) skim milk. Cell sizes both were evaluated by scanning electron microscopy (SEM), surface...

10.2527/jam2016-0551 article EN Journal of Animal Science 2016-10-01

Given graphs $G_1,\ldots,G_s$ all on the same vertex set and a graph $H$ with $e(H) \leq s$, copy of is transversal or rainbow if it contains at most one edge from each $G_c$. When $s=e(H)$, such exactly $G_i$. We study case when spanning explore how regularity blow-up method, that has been so successful in uncoloured setting, can be used to find transversals. provide analogues tools required apply this method setting. Our main result lemma for transversals applies separable bounded degree...

10.48550/arxiv.2306.03595 preprint EN other-oa arXiv (Cornell University) 2023-01-01
Coming Soon ...