5篇
您的检索式：作者名="Danjun Huang"
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Develop a 3D neurological disease model of human cortical glutamatergic neurons using micropillar-based scaffolds显示文摘Establishing an effective three-dimensional(3D) in vitro culture system to better model human neurological diseases is desirable, since the human brain is a 3D structure. Here, we demonstrated the development of a polydimethylsiloxane(PDMS) pillar-based 3D scaffold that mimicked the 3D microenvironment of the brain. We utilized this scaffold for the growth of human cortical glutamatergic neurons that were differentiated from human pluripotent stem cells. In comparison with the 2D culture, we demonstrated that the developed 3D culture promoted the maturation of human cortical glutamatergic neurons by showing significantly more MAP2 and less Ki67 expression. Based on this 3D culture system,we further developed an in vitro disease-like model of traumatic brain injury(TBI), which showed a robust increase of glutamate-release from the neurons, in response to mechanical impacts, recapitulating the critical pathology of TBI. The increased glutamate-release from our 3D culture model was attenuated by the treatment of neural protective drugs, memantine or nimodipine. The established 3D in vitro human neural culture system and TBI-like model may be used to facilitate mechanistic studies and drug screening for neurotrauma or other neurological diseases. | Cheng Chen Xin Dong Kai-Heng Fang Fang Yuan Yao Hu Min Xu Yu Huang Xixiang Zhang Danjun Fang Yan Liu | 2019 | Acta Pharmaceutica Sinica B2019，9，3： | 3 |
| 2 | On the vertex-arboricity of planar graphs without 7-cycles 显示文摘 | HUANG Danjun SHIU Wai Chee WANG Weifan | 2012 | Discrete Mathematics2012，312，： | 1 |
| 3 | Vertex-arboricity of planar graphs without chordal 6-cycles 显示文摘 | HUANG Danjun WANG Weifan | 2013 | International Journal of Computer Mathematics2013，90，2： | 1 |
| 4 | Planar graphs of Maximum degree six without 7-cycles are class one 显示文摘 | Huang Danjun Wang Weifan | 2012 | Electr J Comb2012，19，3： | 1 |
| 5 | Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree显示文摘For a given simple graph G=(V(G),E(G)),a proper total-k-coloring c:V(G)∪E(G)→{1,2,...,k}is neighbor sum distinguishing if f(u)≠f(v)for each edge uv∈E(G),where f(v)=Σwv∈E(G)c(wv)+c(v).The smallest integer k in such a coloring of G is the neighbor sum distinguishing total chromatic number,denoted byχ′′Σ(G).It has been conjectured thatχ″Σ(G)≤Δ(G)+3 for any simple graph G.Let mad(G)=max{2|E(H)|/|V(H)|:H⊆G}be the maximum average degree of G.In this paper,by using the famous Combinatorial Nullstellensatz,we proveχ″Σ(G)≤max{9,Δ(G)+2}for any graph G with mad(G)<4.Furthermore,we characterize the neighbor sum distinguishing total chromatic number for every graph G with mad(G)<4 andΔ(G)≥8. | Danjun Huang Dan Bao | 2023 | Journal of Mathematical Study2023，56，2： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员