Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Zhen Kun Zhang"'
Autor:
ZHEN-KUN ZHANG1 zhzhkun-2006@163.com
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2023, Vol. 43 Issue 3, p635-657. 23p.
Autor:
Ting Shi, Chang-Lun Shao, Yang Liu, Dong-Lin Zhao, Fei Cao, Xiu-Mei Fu, Jia-Yin Yu, Jing-Shuai Wu, Zhen-Kun Zhang, Chang-Yun Wang
Publikováno v:
Frontiers in Microbiology, Vol 11 (2020)
The soft coral-derived fungus Trichoderma harzianum (XS-20090075) was found to be a potential strain to produce substantial new compounds in our previous study. In order to explore its potential to produce more metabolites, chemical epigenetic manipu
Externí odkaz:
https://doaj.org/article/614a6cd727ff4326b76fe1712cb2c3ab
Publikováno v:
Journal of Combinatorial Optimization. 43:384-401
The cutwidth minimization problem consists of finding an arrangement of the vertices of a graph G on a line $$P_n$$ with $$n=|V(G)|$$ vertices, in such a way that the maximum number of overlapping edges (i.e., the congestion) is minimized. A graph G
Autor:
Zhen-Kun Zhang
Publikováno v:
Discussiones Mathematicae Graph Theory.
Autor:
Jing-Shuai Wu, Qin-Yu Meng, Xiao-Hui Shi, Zhen-Kun Zhang, Hua-Shi Guan, Chang-Lun Shao, Chang-Yun Wang
Background: Neuroinflammatory processes are critical in the development and progression of Alzheimer's disease (AD). The potent anti-neuroinflammatory inhibitors are expected as the candidates to treat AD. Cryptotanshinone (1), a major bioactive cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e53fe5209909b6eb73a38d26e8f9841a
https://doi.org/10.21203/rs.3.rs-19324/v1
https://doi.org/10.21203/rs.3.rs-19324/v1
Autor:
Zhen-Kun Zhang
Publikováno v:
Computational and Applied Mathematics. 38
The cutwidth of a graph G is the minimum integer k such that the vertices of G are arranged in a linear layout $$[v_1,\ldots ,v_n]$$ in such a way that, for every $$j= 1,\ldots ,n-1$$ , there are at most k edges with one endpoint in $$\{v_1,\ldots ,v
Autor:
Zhen-Kun Zhang, Hong-Jian Lai
Publikováno v:
Journal of Combinatorial Optimization. 34:233-244
The cutwidth problem for a graph G is to embed G into a path such that the maximum number of overlap edges (i.e., the congestion) is minimized. The investigations of critical graphs and their structures are meaningful in the study of a graph-theoreti
Autor:
Zhen-Kun Zhang, Chang-Lun Shao, Lu-Xin Liu, Xiao-Hui Shi, Qin-Yu Meng, Chang-Yun Wang, Jing-Shuai Wu, Hua-Shi Guan
Publikováno v:
Bioorganic Chemistry. 104:104246
Cryptotanshinone (1), a major bioactive constituent in the traditional Chinese medicinal herb Dan-Shen Salvia miltiorrhiza Bunge, has been reported to possess remarkable pharmacological activities. To improve its bioactivities and physicochemical pro
Publikováno v:
Applied Mechanics and Materials. 576:33-37
The properties of in-situ (Si+Al2O3)/Al composites fabricated from Al-SiO2 reaction system are investigated by X-Ray Diffraction, Scanning Electron Microscope and Differential Scanning Calorimetry technologies. The results indicate that the Si phase
Publikováno v:
IEEE Antennas and Wireless Propagation Letters. 11:1330-1333
A miniascape-like triple-band monopole antenna designed for wireless body area network (WBAN) applications is presented in this letter. With a miniascape-like strip composed of an S-shaped strip, a U-shaped strip, and an I-shaped strip, three operati