Zobrazeno 1 - 10
of 1 377
pro vyhledávání: '"Guo Shanshan"'
Autor:
Liu Minqiang, Ma Mingfei, Hong Fengzhu, Li Yang, Guo Shanshan, Shi Qinlang, He Renliang, Li Zepeng, Wu Qiang
Publikováno v:
BMC Anesthesiology, Vol 24, Iss 1, Pp 1-10 (2024)
Abstract Background Opioid-reduced multimodal analgesia has been used clinically for many years to decrease the perioperative complications associated with opioid drugs. We aimed to assess the clinical effects of opioid-reduced anesthesia during thor
Externí odkaz:
https://doaj.org/article/9066b3991cc244589ba9ca5219cd6e0b
Autor:
Wang Zhaojian, Jiang Meizhu, Hong Jun, Guo Shanshan, Huo Jiping, Zhao Zhigang, Gong Ying, Li Cao
Publikováno v:
Child and Adolescent Psychiatry and Mental Health, Vol 18, Iss 1, Pp 1-11 (2024)
Abstract Background Global antipsychotic usage, including off-label prescriptions, has increased in recent decades. However, trends in China, particularly for children and adolescents, remain unclear. This study explored these trends from 2016 to 202
Externí odkaz:
https://doaj.org/article/b56f15ca488f4898894fd98b25c45d4e
Autor:
Guo Shanshan, Yi Chun-Xia
Publikováno v:
Nanotechnology Reviews, Vol 12, Iss 1, Pp 53-89 (2023)
Effective and safe pharmacotherapies for central nervous system (CNS) disorders remain a major obstacle to human health worldwide. Nanotechnology offers promise in addressing this challenge by enabling the transport of large molecules across the bloo
Externí odkaz:
https://doaj.org/article/9fba1909847d47968ad0202428f84070
A graph $G$ is conflict-free $k$-edge-colorable if there exists an assignment of $k$ colors to $E(G)$ such that for every edge $e\in E(G)$, there is a color that is assigned to exactly one edge among the closed neighborhood of $e$. The smallest $k$ s
Externí odkaz:
http://arxiv.org/abs/2409.10899
Autor:
Liu, Gang, Wang, Zhenxiang, Xi, Chuanmei, He, Ziyang, Guo, Shanshan, Zhang, Rui, Yao, Dezhong
Regression-based sEMG prosthetic hands are widely used for their ability to provide continuous kinetic and kinematic parameters. However, establishing these models requires complex sensors systems to collect corresponding kinetic and kinematic data i
Externí odkaz:
http://arxiv.org/abs/2407.00014
A famous conjecture of Caccetta and H\"{a}ggkvist (CHC) states that a directed graph $D$ with $n$ vertices and minimum outdegree at least $r$ has a directed cycle of length at most $\lceil \frac{n}{r}\rceil$. In 2017, Aharoni proposed the following g
Externí odkaz:
http://arxiv.org/abs/2311.12302
Autor:
Guo Shanshan, Yulong Wang, Kun Wang, Jianjun Long, Xing Lv, Zhiyong Huang, Yi Yang, Saeed Miramini, Lihai Zhang
Publikováno v:
Journal of Low Frequency Noise, Vibration and Active Control, Vol 38 (2019)
Weight-bearing exercise is a well-accepted physiotherapy to prevent osteoporosis for stroke patients. But the immobility of stroke patients limits the types and intensity of conventional interventions. Recent advances in robot-assisted therapeutic de
Externí odkaz:
https://doaj.org/article/774f4ee2eaf541d6a02873d0cc647f82
Consider a complete balanced bipartite graph $K_{n,n}$ and let $K^c_{n,n}$ be an edge-colored version of $K_{n,n}$ that is obtained from $K_{n,n}$ by having each edge assigned a certain color. A subgraph $H$ of $K^c_{n,n}$ is called properly colored
Externí odkaz:
http://arxiv.org/abs/2310.04962
Understanding and following natural language instructions while navigating through complex, real-world environments poses a significant challenge for general-purpose robots. These environments often include obstacles and pedestrians, making it essent
Externí odkaz:
http://arxiv.org/abs/2306.10322
Publikováno v:
Information Technology & People, 2023, Vol. 37, Issue 2, pp. 605-634.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/ITP-11-2021-0901