Zobrazeno 1 - 10
of 1 805
pro vyhledávání: '"Kierstead A"'
Autor:
Matakias, D., Carini, G., Chen, H., Dabrowski, M., Deptuch, G., Duflot, L., Kierstead, J., Liu, T., Ma, H., Morange, N., Rescia, S., Tang, S., Xu, H.
ALFE2 is an ATLAS Liquid Argon Calorimeter (LAr) Front-End ASIC designed for the HL-LHC upgrade. ALFE2 comprises four channels of pre-amplifiers and CR-(RC)2 shapers with adjustable input impedance. ALFE2 features two separate gain outputs to provide
Externí odkaz:
http://arxiv.org/abs/2402.08901
Autor:
Deng, Binwei, Chen, Hucheng, Chen, Kai, Chen, Jinghong, Gong, Datao, Guo, Di, Hu, Xueye, Huang, Deping, Kierstead, James, Li, Xiaoting, Liu, Chonghan, Liu, Tiankuan, Xiang, Annie C., Xu, Hao, Xu, Tongye, You, Yang, Ye, Jingbo
A prototype Liquid-argon Trigger Digitizer Board (LTDB), called the LTDB Demonstrator, has been developed to demonstrate the functions of the ATLAS Liquid Argon Calorimeter Phase-I trigger electronics upgrade. Forty Analog-to-Digital converters and f
Externí odkaz:
http://arxiv.org/abs/2401.15750
If $L$ is a list assignment of $r$ colors to each vertex of an $n$-vertex graph $G$, then an equitable $L$-coloring of $G$ is a proper coloring of vertices of $G$ from their lists such that no color is used more than $\lceil n/r\rceil$ times. A graph
Externí odkaz:
http://arxiv.org/abs/2309.00989
Autor:
Kierstead, Henry, Ren, Eric
Let $G$ be a connected graph on $n$ vertices. The Gallai number $Gal(G)$ of $G$ is the size of the smallest set of vertices that meets every maximum path in $G$. Gr\"unbaum constructed a graph $G$ with $Gal(G)=3$. Very recently, Long, Milans, and Mun
Externí odkaz:
http://arxiv.org/abs/2305.05045
Publikováno v:
Journal of Medical Internet Research, Vol 26, p e52129 (2024)
BackgroundDespite the prevalence of vaping nicotine, most nicotine cessation research remains focused on smoking cigarettes. However, the lived experience of quitting smoking is different from quitting vaping. As a result, research examining the uniq
Externí odkaz:
https://doaj.org/article/ebc686b46aae47c28dce3089275d4d57
Publikováno v:
Frontiers in Education, Vol 9 (2024)
Mixed methods research teams have garnered increased attention for their leveraging of diverse disciplinary and methodological expertise in pursuit of complex problems. We advance our theoretical viewpoint of integrative mixed methods research teamwo
Externí odkaz:
https://doaj.org/article/6b8daab94ccb4bd7a69c260948713aa4
Autor:
Poley, Luise, Brooks, Jammel, Duden, Emily, Fadeyev, Vitaliy, Farook, Hijas, Fernandez-Tejero, Javier, Fournier, Andrew, Hoeferkamp, Martin, Kierstead, Jim, Lynn, David, Mandić, Igor, Moshe, Meny Raviv, Osieja, Jack, Sorenson, Josef, Stelzer, Bernd, Stucci, Stefania, Seidel, Sally
Publikováno v:
In Nuclear Inst. and Methods in Physics Research, A July 2024 1064
Autor:
Patel, Minal, Kierstead, Elexis C., Liu, Michael (Shiyang), Schillo, Barbara, Rose, Shyanika W.
Publikováno v:
In Preventive Medicine May 2024 182
Autor:
Biró, Csaba, Hamburger, Peter, Kierstead, H. A., Pór, Attila, Trotter, William T., Wang, Ruidong
Previously, Erd\H{o}s, Kierstead and Trotter investigated the dimension of random height~$2$ partially ordered sets. Their research was motivated primarily by two goals: (1)~analyzing the relative tightness of the F\"{u}redi-Kahn upper bounds on dime
Externí odkaz:
http://arxiv.org/abs/2003.07935
Publikováno v:
J. Graph Theory, 99(2):251-277, February 2022
A graph $G$ is $d$-degenerate if every non-null subgraph of $G$ has a vertex of degree at most $d$. We prove that every $n$-vertex planar graph has a $3$-degenerate induced subgraph of order at least $3n/4$.
Comment: 28 pages, 12 figures
Comment: 28 pages, 12 figures
Externí odkaz:
http://arxiv.org/abs/2002.07984