Zobrazeno 1 - 10
of 32 732
pro vyhledávání: '"Yang HONG"'
Publikováno v:
Materials horizons [Mater Horiz] 2024 Apr 22; Vol. 11 (8), pp. 1830-1831. Date of Electronic Publication: 2024 Apr 22.
In semiconductor manufacturing, wafer defect maps (WDMs) play a crucial role in diagnosing issues and enhancing process yields by revealing critical defect patterns. However, accurately categorizing WDM defects presents significant challenges due to
Externí odkaz:
http://arxiv.org/abs/2411.11029
In the regime of Rydberg electromagnetically induced transparency, we study the correlated behaviors between the transmission spectra of a pair of probe fields passing through respective parallel one-dimensional cold Rydberg ensembles. Due to the van
Externí odkaz:
http://arxiv.org/abs/2411.07726
This study employed over 100 hours of high-altitude drone video data from eight intersections in Hohhot to generate a unique and extensive dataset encompassing high-density urban road intersections in China. This research has enhanced the YOLOUAV mod
Externí odkaz:
http://arxiv.org/abs/2411.02349
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
A $k$-hypertournament $H$ on $n$ vertices is a pair $(V(H),A(H))$, where $V(H)$ is a set of vertices and $A(H)$ is a set of $k$-tuples of vertices, called arcs, such that for any $k$-subset $S$ of $V(H)$, $A(H)$ contains exactly one of the $k!$ $k$-t
Externí odkaz:
http://arxiv.org/abs/2406.15851
A digraph $D$ with a subset $S$ of $V(D)$ is called $\boldsymbol{S}${\bf -strong} if for every pair of distinct vertices $u$ and $v$ of $S$, there is a $(u, v)$-dipath and a $(v, u)$-dipath in $D$. We define a digraph $D$ with a subset $S$ of $V(D)$
Externí odkaz:
http://arxiv.org/abs/2406.14332
We address the design and optimization of real-world-suitable hybrid precoders for multi-user wideband sub-terahertz (sub-THz) communications. We note that the conventional fully connected true-time delay (TTD)-based architecture is impractical becau
Externí odkaz:
http://arxiv.org/abs/2406.11220
We develop a graph neural network (GNN) to compute, within a time budget of 1 to 2 milliseconds required by practical systems, the optimal linear precoder (OLP) maximizing the minimal downlink user data rate for a Cell-Free Massive MIMO system - a ke
Externí odkaz:
http://arxiv.org/abs/2406.04456
Autor:
Jang, Youngjoon, Kim, Ji-Hoon, Ahn, Junseok, Kwak, Doyeop, Yang, Hong-Sun, Ju, Yoon-Cheol, Kim, Il-Hwan, Kim, Byeong-Yeol, Chung, Joon Son
The goal of this work is to simultaneously generate natural talking faces and speech outputs from text. We achieve this by integrating Talking Face Generation (TFG) and Text-to-Speech (TTS) systems into a unified framework. We address the main challe
Externí odkaz:
http://arxiv.org/abs/2405.10272