Yingli Kang

ORCID: 0000-0002-9855-9296
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Graph Theory Research
  • Computational Geometry and Mesh Generation
  • Graph Labeling and Dimension Problems
  • Limits and Structures in Graph Theory
  • Graph theory and applications
  • graph theory and CDMA systems
  • Parasitic infections in humans and animals
  • Congenital Anomalies and Fetal Surgery
  • Nonlinear Waves and Solitons
  • Amoebic Infections and Treatments
  • Algebraic structures and combinatorial models
  • Optimization and Search Problems
  • Sirtuins and Resveratrol in Medicine
  • Advanced Mathematical Physics Problems
  • Hydrology and Watershed Management Studies
  • Nonlinear Photonic Systems
  • Adipose Tissue and Metabolism
  • Hops Chemistry and Applications
  • Renal Diseases and Glomerulopathies
  • Recommender Systems and Techniques
  • Eicosanoids and Hypertension Pharmacology
  • Soil and Unsaturated Flow
  • Parasitic Infections and Diagnostics
  • Renal and Vascular Pathologies
  • Advanced Topology and Set Theory

Jinhua Polytechnic
2019-2025

Qinghai University Affiliated Hospital
2019-2022

Third Hospital of Hebei Medical University
2015-2019

Hebei Medical University
2015-2019

Beijing Forestry University
2019

Paderborn University
2015-2017

Czech Academy of Sciences, Institute of Mathematics
2016

Zhejiang Normal University
2012-2014

Abstract Excessive generation of mitochondrial reactive oxygen species (ROS) is considered to be initiating event in the development diabetic nephropathy (DN). Mitochondrial biosynthesis mediated by coactivator PGC‐1α and its downstream transcription factors NRF1 TFAM may a key target maintaining function. Resveratrol (RESV), natural polyphenolic antioxidant, potent SIRT1 agonist. In this study we established diabetes mouse podocyte exposed high glucose as vivo vitro models investigate...

10.1002/jcp.27306 article EN Journal of Cellular Physiology 2018-09-06

With the rapid growth of video resources on online education platforms, accurately recommending that meet learners’ needs has become crucial. This paper proposes a personalized resource recommendation model based social tags, aiming to address challenges cold start and data sparsity, thereby enhancing prediction accuracy platforms. The generates tags by analyzing descriptive information, user annotations, comments associated with videos, constructs dynamic learner profiles. similarity...

10.1177/14727978251321841 article EN other-oa Journal of Computational Methods in Sciences and Engineering 2025-03-03

Abstract Let ( be two positive integers. We generalize the well‐studied notions of ‐colorings and circular chromatic number to signed graphs. This implies a new notion colorings graphs, corresponding χ. Some basic facts on graphs are proved, differences results unsigned analyzed. In particular, we show that difference between graph is at most 1. Indeed, there where On other hand, for n vertices, if smaller than 1, then exists , such . also equivalent r (see [12] (X. Zhu, Recent developments...

10.1002/jgt.22147 article EN Journal of Graph Theory 2017-03-30

10.1016/j.ejc.2015.10.001 article EN publisher-specific-oa European Journal of Combinatorics 2015-11-03

Water conservation is an important function of forest ecosystems, but it still unclear which types best in this regard. We investigated the water indicators including water-holding rate branches and leaves (BLwr), capacity litter (Lwc), absorption (Lwr), soil infiltration (Ir), content (SWC), storage (SWS), organic matter (SOM) accumulation five (Larix gmelinii forests, Pinus koraiensis Robinia pseudoacacia tabulaeformis mixed forests) evaluated them using gray correlation method (GCM). The...

10.3390/su11154075 article EN Sustainability 2019-07-28

10.1016/j.disc.2016.05.013 article EN publisher-specific-oa Discrete Mathematics 2016-06-06

The aim of the present study was to investigate effects transcription factor EB (TFEB) overexpression on oxidative stress, mitochondrial function and apoptosis in podocytes induced with high glucose. High glucose‑induced time‑dependent changes TFEB expression were identified nuclear translocation observed podocytes. Overexpression markedly reduced stress podocytes, increased superoxide dismutase 2 heme oxygenase 1 antioxidant enzymes. It further that could partially restore peroxisome...

10.3892/ijmm.2019.4209 article EN cc-by-nc-nd International Journal of Molecular Medicine 2019-05-24

10.1016/j.amc.2013.08.085 article EN Applied Mathematics and Computation 2013-09-21

The objective of the present study was to provide a basis for personalized treatment intermediate and advanced hepatic alveolar echinococcosis (HAE) by elucidating characteristics vascular invasion lesion growth. A total 160 patients with HAE who were subjected plain as well contrast‑enhanced 3.0‑T magnetic resonance imaging prior surgery analyzed. Pathological intra‑operative observations subjects also considered. size location lesions, growth patterns assessed. 78 (48.75%) had lesions...

10.3892/etm.2019.7460 article EN Experimental and Therapeutic Medicine 2019-04-01

10.1016/j.disc.2015.08.023 article EN publisher-specific-oa Discrete Mathematics 2015-09-09

10.1360/012013-158 article ZH-CN Scientia Sinica Mathematica 2013-11-01

Steinberg's conjecture states that planar graphs without 4- and 5-cycles are 3-colorable. This conjecture, though disproved recently, has motivated a lot of work in the literature. A plane graph is $G$ together with an embedding into Euclidean plane. 7-cycle $C$ ext-triangular if it adjacent to triangle $T$ such areas inside have no intersection. In this paper, we prove 3-colorable they contain 7-cycles, which improves number known results. particular, our result implies (1) 4-, 5-, 7-cycles...

10.1137/16m1086418 article EN SIAM Journal on Discrete Mathematics 2017-01-01

Abstract This paper proves that every planar graph having no cycle of length 4, 7, or 9 is DP‐3‐colorable.

10.1002/jgt.23123 article EN Journal of Graph Theory 2024-05-22

The concept of DP-coloring graphs was introduced by Dvo\v{r}\'{a}k and Postle, used to prove that planar without cycles length from $4$ $8$ are $3$-choosable. In the same paper, they proposed a more natural stronger claim such DP-$3$-colorable. This paper confirms proving result having no cycle $4$, $6$ or DP-3-colorable.

10.48550/arxiv.2412.19059 preprint EN arXiv (Cornell University) 2024-12-26

A graph $G$ is $(d_1,d_2,d_3)$-colorable if the vertex set $V(G)$ can be partitioned into three subsets $V_1,V_2$ and $V_3$ such that for $i\in\{1,2,3\}$, induced $G[V_i]$ has maximum vertex-degree at most $d_i$. So, $(0,0,0)$-colorability exactly 3-colorability. The well-known Steinberg's conjecture states every planar without cycles of length 4 or 5 3-colorable. As this being disproved by Cohen-Addad etc. in 2017, a similar question, whether $i$ 3-colorable given $i\in \{6,\ldots,9\}$,...

10.48550/arxiv.2001.00166 preprint EN other-oa arXiv (Cornell University) 2020-01-01

Let $k, d$ ($2d \leq k)$ be two positive integers. We generalize the well studied notions of $(k,d)$-colorings and circular chromatic number $\chi_c$ to signed graphs. This implies a new notion colorings graphs, corresponding $\chi$. Some basic facts on graphs are proved, differences results unsigned analyzed. In particular, we show that difference between graph is at most 1. Indeed, there where On other hand, for $n$ vertices, if smaller than 1, then exists $\epsilon_n>0$, such $1 -...

10.48550/arxiv.1509.04488 preprint EN other-oa arXiv (Cornell University) 2015-01-01

This paper studies the choosability of signed planar graphs. We prove that every graph is 5-choosable and there a which not 4-choosable while unsigned 4-choosable. For each $k \in \{3,4,5,6\}$, without circuits length $k$ Furthermore, 3 4 3-choosable. construct with girth 3-choosable but

10.48550/arxiv.1502.04561 preprint EN other-oa arXiv (Cornell University) 2015-01-01

10.1016/j.ejc.2017.08.003 article EN European Journal of Combinatorics 2017-09-19

The only remaining case of a well known conjecture Vizing states that there is no planar graph with maximum degree 6 and edge chromatic number 7. We introduce parameters for graphs, based on the degrees faces, study question whether are upper bounds these edge-chromatic critical graphs. Our results provide smallest counterexamples to Vizing's conjecture, thus providing partial characterization such if they exist.For $k \leq 5$ give insights into structure

10.37236/5895 article EN cc-by The Electronic Journal of Combinatorics 2016-08-05

10.1016/j.dam.2015.07.007 article EN Discrete Applied Mathematics 2015-07-26

10.1016/j.ejc.2021.103327 article EN European Journal of Combinatorics 2021-03-11

To assess the value of MRI combined with serum ferritin analysis in measurement hepatic iron deposition among patients alveolar echinococcosis.A total 96 definitive diagnosis echinococcosis and 30 healthy volunteers were enrolled underwent routine 1.5T MR scanning, all laboratory examination data captured. The liver-to-muscle signal intensity ratio, level liver functions analyzed.The ratio was (1.95 ± 0.57) (2.22 0.28) (t = 2.022, P < 0.05), negatively associated (rs -0.446, 0.01).Abnormal...

10.16250/j.32.1374.2019108 article EN PubMed 2019-11-22
Coming Soon ...