Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Minglei Fang"'
Role of intergenerational connections in cognitive aging: Evidence from a Chinese longitudinal study
Publikováno v:
Frontiers in Public Health, Vol 12 (2024)
ObjectiveTo explore the impact of intergenerational connections on cognitive function in middle-aged and older adults (45–60 years and over 60 years, respectively) and analyze the urban–rural and sex differences in the effects of intergenerationa
Externí odkaz:
https://doaj.org/article/6e2add6de77e472c93d051131ac79944
Publikováno v:
Electronic Research Archive, Vol 31, Iss 7, Pp 4088-4101 (2023)
In this paper, the problem on finite-/fixed-time synchronization (FFTS) is investigated for a class of diffusive Hopfield neural networks with leakage and discrete delays. Some new and useful criteria independent on time delays but dependent on the d
Externí odkaz:
https://doaj.org/article/f44270e7e97e4588bdfb7cbe06237d85
Publikováno v:
Mathematical Biosciences and Engineering, Vol 19, Iss 11, Pp 10826-10845 (2022)
The Gutman index and Schultz index of a connected graph are degree-distance-based topological indices. In this paper, we devoted to establish the explicit analytical expressions for the simple formulae of the expected values of the Gutman and Schultz
Externí odkaz:
https://doaj.org/article/98ec1e2013b740299f4d0230e24c6b5e
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
In this study, we propose a new modified hybrid conjugate gradient projection method with a new scale parameter φk for solving large-scale nonlinear monotone equations. The proposed method includes two major features: projection techniques and suffi
Externí odkaz:
https://doaj.org/article/8c40a29abba24f1fb74074b3e2a4dcc3
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
The nonlinear conjugate gradient algorithms are a very effective way in solving large-scale unconstrained optimization problems. Based on some famous previous conjugate gradient methods, a modified hybrid conjugate gradient method was proposed. The p
Externí odkaz:
https://doaj.org/article/8afe1ba54e164a6e80e1bc5cc173c582
Autor:
Defeng Ding1 2021201353@aust.edu.cn, Minglei Fang2 fmlmath@aust.edu.cn, Min Wang1 2175841571@qq.com, Yuting Sheng1 805015354@qq.com
Publikováno v:
IAENG International Journal of Applied Mathematics. Mar2024, Vol. 54 Issue 3, p411-416. 6p.
Autor:
Minglei Fang1 fmlmath@aust.edu.cn, Min Wang2 2020201146@edu.aust.cn, Defeng Ding2 2021201353@edu.aust.cn, Yuting Sheng2 805015354@qq.com
Publikováno v:
Engineering Letters. Sep2023, Vol. 31 Issue 3, p1036-1044. 9p.
Publikováno v:
Polycyclic Aromatic Compounds. 43:1788-1798
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd7734579742cce33a737bf1c08312fd
https://doi.org/10.1080/10406638.2022.2038218
https://doi.org/10.1080/10406638.2022.2038218
Publikováno v:
International Journal of Fuzzy Systems. 24:676-685
This paper presents the theoretical results on the finite-time synchronization of two delayed inertial fuzzy neural networks. Different from the existing study about dynamics analysis for inertial neural networks, more adjustable parameters are intro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c8828b3a7f1f95e4d92925d53a2c04a
https://doi.org/10.1007/s40815-021-01171-1
https://doi.org/10.1007/s40815-021-01171-1
Publikováno v:
Journal of Interdisciplinary Mathematics. 18:593-598
Let G be a connected simple graph on n vertices. The Gallai's conjecture asserts that the edges of G can be decomposed into paths. In this paper, we show that the conjecture is true if G is a maximal outerplanar graph or G ia a 2-connected outerplana
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0276ec76d23c52705386449db531aed6
https://doi.org/10.1080/09720502.2014.1001570
https://doi.org/10.1080/09720502.2014.1001570