Zobrazeno 1 - 10
of 141
pro vyhledávání: '"Yaojun Chen"'
Publikováno v:
IET Electric Power Applications, Vol 18, Iss 7, Pp 739-755 (2024)
Abstract Current transformers (CTs) are widely used for energy metering, relay protection, condition monitoring and control circuits. However, CT saturation may lead to non‐negligible measurement errors and relay malfunctions, posing a threat to th
Externí odkaz:
https://doaj.org/article/18e6bcaa978a4ba793c6a9ef1d29aeac
Publikováno v:
High Voltage, Vol 8, Iss 1, Pp 171-182 (2023)
Abstract High‐voltage withstand tests are essential for electric equipment like power transformers, electric cable lines, gas insulated switchgears etc. The partial discharge (PD) measurement for such equipment under applied high voltage is also re
Externí odkaz:
https://doaj.org/article/f3c8a7c49d12455aad9de67b0d6a87df
Autor:
Wei Gao, Yaojun Chen
Publikováno v:
Journal of Cloud Computing: Advances, Systems and Applications, Vol 9, Iss 1, Pp 1-10 (2020)
Abstract In the past ten years, researchers have always attached great importance to the application of ontology to its relevant specific fields. At the same time, applying learning algorithms to many ontology algorithms is also a hot topic. For exam
Externí odkaz:
https://doaj.org/article/4177622194ed4ca7a1b093fcc37d79b4
Publikováno v:
IEEE Access, Vol 8, Pp 58357-58368 (2020)
Solenoid valves are important electromagnetic devices which are used widely in various fields. Considering the uncertainty of failure mechanisms in practical operation, a thermal-structure coupled model of a direct action solenoid valve is constructe
Externí odkaz:
https://doaj.org/article/030a193cbc2f473b8f2e5fdef41689a0
Publikováno v:
Journal of Chemistry, Vol 2017 (2017)
As an efficient theoretical tool, graph theory is widely used in computing chemistry. In terms of index computation on molecular graphs, the researchers can learn the potential properties of chemical compounds, including drugs, materials, and organic
Externí odkaz:
https://doaj.org/article/9fdd769b1d55419bb6659f8f51e0f546
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 2, Iss 2, Pp 110-114 (2014)
Given two graphs G1 and G2, the Ramsey number R(G1;G2)is the smallest integer N such that, for any graph G of order N, either G1 is a subgraph of G, or G2 is a subgraph of the complement of G. Let Cn denote a cycle of order n, Wn a wheel of order n+1
Externí odkaz:
https://doaj.org/article/33ddfd065ccf49318711b91e36c800d3
Autor:
Bin Zhao, Hui Li, Mingyu Wang, Yaojun Chen, Shengquan Liu, Dong Yang, Chao Yang, Yaogang Hu, Zhe Chen
Publikováno v:
Energies, Vol 7, Iss 5, Pp 3086-3103 (2014)
This study presents the auxiliary damping control with the reactive power loop on the rotor-side converter of doubly-fed induction generator (DFIG)-based wind farms to depress the sub-synchronous resonance oscillations in nearby turbogenerators. Thes
Externí odkaz:
https://doaj.org/article/5d72a92af4c54b87a8fccb85ff23e16a
Autor:
Yanbo Zhang, Yaojun Chen
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 2, Iss 1, Pp 66-69 (2014)
For two given graphs $F$ and $H$, the Ramsey number $R(F,H)$ is the smallest integer $N$ such that for any graph $G$ of order $N$, either $G$ contains $F$ or the complement of $G$ contains $H$. Let $F_l$ denote a fan of order $2l+1$, which is $l$ tri
Externí odkaz:
https://doaj.org/article/2660315e33594d9e8875c3a19d887587
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 14 no. 2, Iss Graph Theory (2012)
Graph Theory
Externí odkaz:
https://doaj.org/article/2dd563a7789b45b5b51eea3213ada250
For two given graphs $G$ and $H$ the planar Ramsey number $PR(G,H)$ is the smallest integer $n$ such that every planar graph $F$ on $n$ vertices either contains a copy of $G$, or its complement contains a copy of $H$. In this paper, we first characte
Externí odkaz:
http://arxiv.org/abs/1304.6466
