Zobrazeno 1 - 10
of 13 730
pro vyhledávání: '"Liu, Juan"'
Autor:
Liu, Juan
Publikováno v:
Вестник Московского Университета. Серия 20: Педагогическое образование, Vol 22, Iss 1, Pp 244-269 (2024)
Background. In 2018, China published the State Standard for the subject “Russian Language” for senior high school, developed by the Ministry of Education of the People’s Republic of China. Consideration of the concept underlying the new standar
Externí odkaz:
https://doaj.org/article/99034bba34b846f286e363d6ea0c8250
In contrast to human speech, machine-generated sounds of the same type often exhibit consistent frequency characteristics and discernible temporal periodicity. However, leveraging these dual attributes in anomaly detection remains relatively under-ex
Externí odkaz:
http://arxiv.org/abs/2409.03610
Future wireless networks are envisioned to support both sensing and artificial intelligence (AI) services. However, conventional integrated sensing and communication (ISAC) networks may not be suitable due to the ignorance of diverse task-specific da
Externí odkaz:
http://arxiv.org/abs/2409.00405
Simultaneous Localization and Mapping (SLAM) technology enables the construction of environmental maps and localization, serving as a key technique for indoor autonomous navigation of mobile robots. Traditional SLAM methods typically require exhausti
Externí odkaz:
http://arxiv.org/abs/2407.11299
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$ is supereulerian if $D$ contains a spanning eulerian subdigraph. For any two vertices $u,v$ in a digraph $D$, if $(u,w),(v,w)\in A(D)$ for some $w\in V(D)$, then we call the pair $\{u, v\}$ dominating; if $(w,u),(w,v)\in A(D)$ for some
Externí odkaz:
http://arxiv.org/abs/2406.15841
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
Autor:
Jiang, Yicong, Wang, Tianzi, Xie, Xurong, Liu, Juan, Sun, Wei, Yan, Nan, Chen, Hui, Wang, Lan, Liu, Xunying, Tian, Feng
Disordered speech recognition profound implications for improving the quality of life for individuals afflicted with, for example, dysarthria. Dysarthric speech recognition encounters challenges including limited data, substantial dissimilarities bet
Externí odkaz:
http://arxiv.org/abs/2406.09873
Autor:
Pan, Chunyu, Zhang, Quan, Zhu, Yue, Kong, Shengzhou, Liu, Juan, Zhang, Changsheng, Wang, Fei, Zhang, Xizhe
The network approach to characterizing psychopathology departs from traditional latent categorical and dimensional approaches. Causal interplay among symptoms contributed to dynamic psychopathology system. Therefore, analyzing the symptom clusters is
Externí odkaz:
http://arxiv.org/abs/2407.00042
Autor:
Liu, Xiaokang, Du, Xiaoxia, Liu, Juan, Su, Rongfeng, Ng, Manwa Lawrence, Zhang, Yumei, Yang, Yudong, Zhao, Shaofeng, Wang, Lan, Yan, Nan
Automatic assessment of dysarthria remains a highly challenging task due to high variability in acoustic signals and the limited data. Currently, research on the automatic assessment of dysarthria primarily focuses on two approaches: one that utilize
Externí odkaz:
http://arxiv.org/abs/2405.03254