Zobrazeno 1 - 10
of 3 180
pro vyhledávání: '"Xiaopan An"'
Autor:
Hua Zhou, Kunqi Ma, Yu Liu, Jingyuan Li, Hanzhengnan Yu, Xiaopan An, Yongkai Liang, Hang Xu, Xi Hu, Hao Zhang
Publikováno v:
Energy Reports, Vol 9, Iss , Pp 656-661 (2023)
The discharge mode has a great influence on the energy consumption of electric vehicles, especially at cold environment, soak in cold environment will lead to the decrease of the temperature of the vehicle/battery, resulting in the increase of energy
Externí odkaz:
https://doaj.org/article/01398a58897c4b60b1eff86fdc0e6823
Autor:
Hang Xu, Yu Liu, Jingyuan Li, Hanzhengnan Yu, Xiaopan An, Kunqi Ma, Yongkai Liang, Xi Hu, Hao Zhang
Publikováno v:
Energy Reports, Vol 9, Iss , Pp 835-842 (2023)
In order to study the influence of high and low temperature environments on the energy consumption of battery electric vehicles, this paper takes Tianjin as an example to collect the actual road data of 8 battery electric passenger cars for eight mon
Externí odkaz:
https://doaj.org/article/d17f51303ef34927b0a4e5181486e899
Language models (LMs) possess a strong capability to comprehend natural language, making them effective in translating human instructions into detailed plans for simple robot tasks. Nevertheless, it remains a significant challenge to handle long-hori
Externí odkaz:
http://arxiv.org/abs/2409.20560
Reinforcement Learning (RL) has enabled social robots to generate trajectories without human-designed rules or interventions, which makes it more effective than hard-coded systems for generalizing to complex real-world scenarios. However, social navi
Externí odkaz:
http://arxiv.org/abs/2407.17460
Autor:
Kim, Seog-Jin, Lian, Xiaopan
The {\em square} of a graph $G$, denoted $G^2$, has the same vertex set as $G$ and has an edge between two vertices if the distance between them in $G$ is at most $2$. In general, $\Delta(G) + 1 \leq \chi(G^2) \leq \Delta(G)^2 +1$ for every graph $G$
Externí odkaz:
http://arxiv.org/abs/2311.02914
Autor:
Kwon, O-joung, Lian, Xiaopan
In this paper, we consider a variant of dichromatic number on digraphs with prescribed sets of arcs. Let $D$ be a digraph and let $Z_1, Z_2$ be two sets of arcs in $D$. For a subdigraph $H$ of $D$, let $A(H)$ denote the set of all arcs of $H$. Let $\
Externí odkaz:
http://arxiv.org/abs/2307.05897
Autor:
Song, Xiefei, Wang, Guangzhao, Zhou, Li, Yang, Haiyan, Li, Xiaopan, Yang, Haitao, Shen, Yuncheng, Xu, Guangyang, Luo, Yuhui, Wang, Ning
The new technology of energy conversion must be developed to ensure energy sustainability. Thermoelectric (TE) materials provide an effective means to solve the energy crisis. As a potential TE candidate, the TE properties of perovskite have received
Externí odkaz:
http://arxiv.org/abs/2306.00320
Autor:
Kim, Seog-Jin, Lian, Xiaopan
The square of a graph $G$, denoted $G^2$, has the same vertex set as $G$ and has an edge between two vertices if the distance between them in $G$ is at most $2$. Thomassen (2018) and Hartke, Jahanbekam and Thomas (2016) proved that $\chi(G^2) \leq 7$
Externí odkaz:
http://arxiv.org/abs/2305.05194
Autor:
Kwon, O-joung, Lian, Xiaopan
We introduce the vertex-arboricity of group-labelled graphs. For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose edges are labelled by elements of $\Gamma$. For an abelian group $\Gamma$ and $A\subseteq \Gamma$, the $(\Gamma, A)
Externí odkaz:
http://arxiv.org/abs/2305.01472
The dichromatic number of $D$, denoted by $\overrightarrow{\chi}(D)$, is the smallest integer $k$ such that $D$ admits an acyclic $k$-coloring. We use $mader_{\overrightarrow{\chi}}(F)$ to denote the smallest integer $k$ such that if $\overrightarrow
Externí odkaz:
http://arxiv.org/abs/2210.06247