目的应用同步脑电-功能磁共振成像技术(electroencephalography-functional magnetic resonance imaging,EEG-fMRI),探讨1型发作性睡病(narcolepsy type 1,NT1)患者非快速眼动(non-rapid eye movement,NREM)睡眠状态下脑功能网络的连通...目的应用同步脑电-功能磁共振成像技术(electroencephalography-functional magnetic resonance imaging,EEG-fMRI),探讨1型发作性睡病(narcolepsy type 1,NT1)患者非快速眼动(non-rapid eye movement,NREM)睡眠状态下脑功能网络的连通性和拓扑特性,探讨其与认知行为的关系。材料与方法对25例NT1患者和25例年龄匹配的健康对照组进行北京版蒙特利尔认知评估(The Beijing version of the Montreal Cognitive Assessment,MoCA-BJ)和EEG-fMRI扫描。所有受试者首先进行夜间多导睡眠图(nocturnal polysomnogram,nPSG)研究,计算总睡眠时间(total sleep time,TST)、各睡眠阶段占总睡眠时间百分比(TST%)和觉醒指数。采用Epworth嗜睡量表(Epworth Sleepiness Score,ESS)衡量白天的嗜睡程度。并在睡眠状态下对所有被试进行同步EEG-fMRI扫描。应用MoCA-BJ量表评估所有被试认知功能。利用EEG数据进行睡眠分期,基于fMRI数据建立被试睡眠状态下的全脑功能连接网络,使用图论方法分析网络的拓扑特征。比较各组之间拓扑参数的差异,并用相关分析方法分析脑网络拓扑特性与MoCA-BJ量表的关系。结果与对照组比较,NT1组的MOCA-BJ评分降低;而且NT1 NREM 2期睡眠期(N2)全脑全局效率以及小世界性均明显降低。NT1组的全脑功能网络的整体效率与MoCA-BJ评分显著相关(r=-0.589,P=0.002)。结论NT1患者在N2期睡眠状态下脑功能网络的网络拓扑属性异常与其认知障碍相关。展开更多
A k-tree is a tree with maximum degree at most k. In this paper, we give a sharp degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than t, where 1≤t≤k.We denote ...A k-tree is a tree with maximum degree at most k. In this paper, we give a sharp degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than t, where 1≤t≤k.We denote by σ_k(G) the minimum value of the degree sum of k independent vertices in a graph G. Let k≥2,s≥0 and 1≤t≤k be integers, and suppose G is an(s + 1)-connected graph with σ_k(G)≥|G|+(k-t)s-1.Then for any s specified vertices, G contains a spanning k-tree in which every specified vertex has degree at most t. This improves a result obtained by Matsuda and Matsumura.展开更多
文摘目的应用同步脑电-功能磁共振成像技术(electroencephalography-functional magnetic resonance imaging,EEG-fMRI),探讨1型发作性睡病(narcolepsy type 1,NT1)患者非快速眼动(non-rapid eye movement,NREM)睡眠状态下脑功能网络的连通性和拓扑特性,探讨其与认知行为的关系。材料与方法对25例NT1患者和25例年龄匹配的健康对照组进行北京版蒙特利尔认知评估(The Beijing version of the Montreal Cognitive Assessment,MoCA-BJ)和EEG-fMRI扫描。所有受试者首先进行夜间多导睡眠图(nocturnal polysomnogram,nPSG)研究,计算总睡眠时间(total sleep time,TST)、各睡眠阶段占总睡眠时间百分比(TST%)和觉醒指数。采用Epworth嗜睡量表(Epworth Sleepiness Score,ESS)衡量白天的嗜睡程度。并在睡眠状态下对所有被试进行同步EEG-fMRI扫描。应用MoCA-BJ量表评估所有被试认知功能。利用EEG数据进行睡眠分期,基于fMRI数据建立被试睡眠状态下的全脑功能连接网络,使用图论方法分析网络的拓扑特征。比较各组之间拓扑参数的差异,并用相关分析方法分析脑网络拓扑特性与MoCA-BJ量表的关系。结果与对照组比较,NT1组的MOCA-BJ评分降低;而且NT1 NREM 2期睡眠期(N2)全脑全局效率以及小世界性均明显降低。NT1组的全脑功能网络的整体效率与MoCA-BJ评分显著相关(r=-0.589,P=0.002)。结论NT1患者在N2期睡眠状态下脑功能网络的网络拓扑属性异常与其认知障碍相关。
基金Partially supported by National Natural Science Foundation of China(No.11771172)key scientific and technological project of higher education of Henan Province(No.19A110019)+1 种基金Science and technology innovation fund of Henan Agricultural University(No.KJCX2019A15)Partially supported by the Ph D Research Foundation of Henan Agricultural University(No.30500614)
文摘A k-tree is a tree with maximum degree at most k. In this paper, we give a sharp degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than t, where 1≤t≤k.We denote by σ_k(G) the minimum value of the degree sum of k independent vertices in a graph G. Let k≥2,s≥0 and 1≤t≤k be integers, and suppose G is an(s + 1)-connected graph with σ_k(G)≥|G|+(k-t)s-1.Then for any s specified vertices, G contains a spanning k-tree in which every specified vertex has degree at most t. This improves a result obtained by Matsuda and Matsumura.
