磁刺激穴位复杂脑功能网络构建与分析

本文采用互信息方法对磁刺激内关穴过程中的脑电信 号进行了两两通道间非线性时域关联特性分析, 构建了不同频率刺激前、刺激中、刺激后的脑功能网络, 并基于复杂网络理论对脑功能网络的特征进行了深入研究. 结果表明, 磁刺激频率为3 Hz 时, 大脑功能网络的平均度、平均聚类系数和全局效率与刺激前相比均有显著升高, 平均路径长度显著降低, 并且相应脑功能网络的"小世界"属性有所增强, 信息在大脑各区域间的传递更加高效. 本研究首次开展了磁刺激穴位复杂脑功能网络的构建与分析, 为探索磁刺激穴位对大脑神经调节的作用和机理提供新思路和新方法. 关键词： 复杂网络 磁刺激 脑功能网络 互信息     

基于Kendall改进的同步算法癫痫脑网络分析

提出了一种基于Kendall等级相关改进的同步算法IRC(inverse rank correlation).Kendall等级相关是非线性动力学分析的一般化算法,可有效地度量变量间的非线性相关性.复杂网络的研究已逐渐深入到社会科学的各个领域,脑网络的研究已经成为当今脑功能研究的热点.利用改进的IRC算法,基于脑电EEG(electroencephalogram)数据来构建大脑功能性网络.对构建的脑功能网络的度指标进行了分析,以调查癫痫脑功能网络是否异于正常人.结果显示:使用该改进的算法能够对癫痫和正常脑功能网络显著区分,且只需要记录很短的脑电数据.实验结果数据表明,该方法适用于区分癫痫和正常脑组织网络度指标,它可有助于进一步地加深对大脑的神经动力学行为的研究,并为临床诊断提供有效工具.     

脑神经其实是网格结构

 很多人都认为脑神经之间的联系过于复杂,看起来非常混乱.然而,事实上它们是网格结构.利用弥散磁共振成像技术,马萨诸塞州总医院(Massachusetts GeneralHospital)的维丁(Van Wedeen)和同事发现神经纤维所在平面在大脑中被折叠成直角或是其他形状,使大脑神经成为一个3D 网络,如同一盘意大利面.     

复杂网络研究概述

近年来，真实网络中小世界效应和无标度特性的发现激起了物理学界对复杂网路的研究热潮．复杂网络区别于以前广泛研究的规则网络和随机网络最重要的统计特征是什么?物理学家研究复杂网络的终极问题是什么?物理过程以及相关的物理现象对拓扑结构是否敏感?物理学家进入这一研究领域的原因和意义何在?复杂网络研究领域将来可能会向着什么方向发展?文章围绕上述问题，从整体上概述了复杂网络的研究进展．     

两相流流型复杂网络社团结构及其统计特性

利用气液两相流电导波动信号构建了流型复杂网络. 基于K均值聚类的社团探寻算法对该网络的社团结构进行了分析,发现该网络存在分别对应于泡状流、段塞流及混状流的三个社团,并且两个社团间联系紧密的点分别对应于相应的过渡流型. 基于复杂网络理论从全新的角度探讨了两相流流型复杂网络社团结构及统计特性问题,并取得了满意的流型识别效果,与此同时,在对该网络特性进一步分析的基础上,发现了对两相流流动参数变化敏感的相关复杂网络统计量,为更好地理解两相流流型动力学特性提供了参考. 关键词： 两相流流型 复杂网络 社团探寻算法 网络统计特性     

时变动态贝叶斯网络模型及其在皮层脑电网络连接中的应用

大脑执行语言的发音需要顶叶、颞叶、额叶等多个脑区协同完成.皮层脑电具有高时间分辨率、较高空间分辨率和高信噪比等优势,为研究大脑的电生理特性提供了重要的技术手段.为了探索大脑对语言的动态处理过程,利用多尺度皮层脑电(标准电极与微电极)分析了被试在执行音节朗读任务时的皮层脑电信号的高频gamma段特征,提出采用时变动态贝叶斯网络构建单次实验任务的有向网络.结果显示该方法能够快速有效地构建语言任务过程中标准电极、微电极以及二者之间的有向网络连接,且反映了大规模网络(标准电极之间的连接)、局部网络(微电极之间的连接)以及大规模网络与局部网络之间的连接(标准电极与微电极之间的连接)随语言任务发生的动态改变.研究还发现,发音时刻之前与之后的网络连接存在显著性差异,且发音方式不同的音节网络间也存在明显差异.该研究将有助于癫痫等神经疾病的术前临床评估以及理解大脑对语言加工的实时处理过程.     

复杂网络可控性研究现状综述

控制复杂系统是人们对复杂系统模型结构及相关动力学进行研究的最终目标, 反映人们对复杂系统的认识能力. 近年来, 通过控制理论和复杂性科学相结合,复杂网络可控性的研究引起了人们的广泛关注. 在过去的几年内, 来自国内外不同领域的研究人员从不同的角度对复杂网络可控性进行了深入的分析研究, 取得了丰硕的成果. 本文重点讨论了复杂网络的结构可控性研究进展, 详细介绍了基于最大匹配方法的复杂网络结构可控性分析框架, 综述了自2011年以来复杂网络可控性的相关研究成果, 具体论述了不同类型的可控性、可控性与网络拓扑结构统计特征的关联、基于可控性的网络及节点度量、控制的鲁棒性和可控性的相关优化方法. 最后, 对网络可控性未来的研究动态进行了展望, 有助于国内同行开展网络可控性的相关研究.     

虚拟社区网络的演化过程研究

模拟了虚拟社区网络的演化过程并研究其拓扑结构.发现虚拟社区网络在演化过程中,节点的加入、边的加入、网络中度分布、节点的度与其加入网络时间的关系、平均度随时间的变化等方面与传统的无标度网络有所不符.根据国内某论坛的实际网络数据统计与分析,提出了虚拟社区网络的演化机理——虚拟社区网络构造算法.仿真结果表明,模拟以互联网论坛为代表的虚拟社区网络时,该模型能够得到与真实网络相符的特性. 关键词： 复杂网络 虚拟社区 无标度网络     

复杂网络上动力系统同步的研究进展

本文简要介绍复杂网络的基本概念并详细总结了近年来复杂网络上动力学系统的同步的研究进展，主要内容有复杂网络同步的稳定性分析，复杂网络上动力学系统同步的特点，网络的几何特征量对同步稳定性的影响，以及提高网络同步能力的方法等。最后文章提出了这一领域的几个有待解决的问题及可能的发展方向。     

白血病人血液的光声光谱

利用光声光谱对不同类型的白血病患者和正常人的全血进行检测，发现白血病患者与正常人全血光谱图特征峰有明显差异，结果提示患者全血的光声光谱图可能对早期白血病诊断及白血病分型具有较大的临床意义。     

基于通信序列熵的复杂网络传输容量

网络的传输性能在一定程度上依赖于网络的拓扑结构.本文从结构信息的角度分析复杂网络的传输动力学行为,寻找影响网络传输容量的信息结构测度指标.通信序列熵可以有效地量化网络的整体结构信息,为了表征网络整体传输能力,把通信序列熵引入到复杂网络传输动力学分析中,研究网络的通信序列熵与传输性能之间的关联特性,分析这种相关性存在的内在机理.分别在BA无标度和WS小世界网络模型上进行仿真,结果显示:网络的通信序列熵与其传输容量存在密切关联性,随着通信序列熵的增加,网络拓扑结构的均匀性随之增强,传输容量明显增加.网络的传输容量是通信序列熵的单调递增函数,与通信序列熵成正关联关系.通信序列熵可有效评估网络的传输容量,本结论可为设计高传输容量网络提供理论依据.     

Functional holography analysis: simplifying the complexity of dynamical networks

We present a novel functional holography (FH) analysis devised to study the dynamics of task-performing dynamical networks. The latter term refers to networks composed of dynamical systems or elements, like gene networks or neural networks. The new approach is based on the realization that task-performing networks follow some underlying principles that are reflected in their activity. Therefore, the analysis is designed to decipher the existence of simple causal motives that are expected to be embedded in the observed complex activity of the networks under study. First we evaluate the matrix of similarities (correlations) between the activities of the network's components. We then perform collective normalization of the similarities (or affinity transformation) to construct a matrix of functional correlations. Using dimension reduction algorithms on the affinity matrix, the matrix is projected onto a principal three-dimensional space of the leading eigenvectors computed by the algorithm. To retrieve back information that is lost in the dimension reduction, we connect the nodes by colored lines that represent the level of the similarities to construct a holographic network in the principal space. Next we calculate the activity propagation in the network (temporal ordering) using different methods like temporal center of mass and cross correlations. The causal information is superimposed on the holographic network by coloring the nodes locations according to the temporal ordering of their activities. First, we illustrate the analysis for simple, artificially constructed examples. Then we demonstrate that by applying the FH analysis to modeled and real neural networks as well as recorded brain activity, hidden causal manifolds with simple yet characteristic geometrical and topological features are deciphered in the complex activity. The term "functional holography" is used to indicate that the goal of the analysis is to extract the maximum amount of functional information about the dynamical network as a whole unit.     

The criteria for selecting a method for unfolding neutron spectra based on the information entropy theory

To further expand the application of an artificial neural network in the field of neutron spectrometry, the criteria for choosing between an artificial neural network and the maximum entropy method for the purpose of unfolding neutron spectra was presented. The counts of the Bonner spheres for IAEA neutron spectra were used as a database, and the artificial neural network and the maximum entropy method were used to unfold neutron spectra; the mean squares of the spectra were defined as the differences between the desired and unfolded spectra. After the information entropy of each spectrum was calculated using information entropy theory, the relationship between the mean squares of the spectra and the information entropy was acquired. Useful information from the information entropy guided the selection of unfolding methods. Due to the importance of the information entropy, the method for predicting the information entropy using the Bonner spheres' counts was established. The criteria based on the information entropy theory can be used to choose between the artificial neural network and the maximum entropy method unfolding methods. The application of an artificial neural network to unfold neutron spectra was expanded.     

EEG-Based Emotion Recognition by Exploiting Fused Network Entropy Measures of Complex Networks across Subjects

It is well known that there may be significant individual differences in physiological signal patterns for emotional responses. Emotion recognition based on electroencephalogram (EEG) signals is still a challenging task in the context of developing an individual-independent recognition method. In our paper, from the perspective of spatial topology and temporal information of brain emotional patterns in an EEG, we exploit complex networks to characterize EEG signals to effectively extract EEG information for emotion recognition. First, we exploit visibility graphs to construct complex networks from EEG signals. Then, two kinds of network entropy measures (nodal degree entropy and clustering coefficient entropy) are calculated. By applying the AUC method, the effective features are input into the SVM classifier to perform emotion recognition across subjects. The experiment results showed that, for the EEG signals of 62 channels, the features of 18 channels selected by AUC were significant (p < 0.005). For the classification of positive and negative emotions, the average recognition rate was 87.26%; for the classification of positive, negative, and neutral emotions, the average recognition rate was 68.44%. Our method improves mean accuracy by an average of 2.28% compared with other existing methods. Our results fully demonstrate that a more accurate recognition of emotional EEG signals can be achieved relative to the available relevant studies, indicating that our method can provide more generalizability in practical use.     

Multiscale Information Propagation in Emergent Functional Networks

Complex biological systems consist of large numbers of interconnected units, characterized by emergent properties such as collective computation. In spite of all the progress in the last decade, we still lack a deep understanding of how these properties arise from the coupling between the structure and dynamics. Here, we introduce the multiscale emergent functional state, which can be represented as a network where links encode the flow exchange between the nodes, calculated using diffusion processes on top of the network. We analyze the emergent functional state to study the distribution of the flow among components of 92 fungal networks, identifying their functional modules at different scales and, more importantly, demonstrating the importance of functional modules for the information content of networks, quantified in terms of network spectral entropy. Our results suggest that the topological complexity of fungal networks guarantees the existence of functional modules at different scales keeping the information entropy, and functional diversity, high.     

Robustness measurement of scale-free networks based on motif entropy

As a classical complex network model, scale-free network is widely used and studied. And motifs, as a high-order subgraph structure, frequently appear in scale-free networks, and have a great influence on the structural integrity, functional integrity and dynamics of the networks. In order to overcome the shortcomings in the existing work on the robustness of complex networks, only nodes or edges are considered, while the defects of high-order structure in the network are ignored. From the perspective of network motif, we propose an entropy of node degree distribution based on motif to measure the robustness of scale-free networks under random attacks. The effectiveness and superiority of our method are verified and analyzed in the BA scale-free networks.     

A Path-Based Distribution Measure for Network Comparison

As network data increases, it is more common than ever for researchers to analyze a set of networks rather than a single network and measure the difference between networks by developing a number of network comparison methods. Network comparison is able to quantify dissimilarity between networks by comparing the structural topological difference of networks. Here, we propose a kind of measures for network comparison based on the shortest path distribution combined with node centrality, capturing the global topological difference with local features. Based on the characterized path distributions, we define and compare network distance between networks to measure how dissimilar the two networks are, and the network entropy to characterize a typical network system. We find that the network distance is able to discriminate networks generated by different models. Combining more information on end nodes along a path can further amplify the dissimilarity of networks. The network entropy is able to detect tipping points in the evolution of synthetic networks. Extensive numerical simulations reveal the effectivity of the proposed measure in network reduction of multilayer networks, and identification of typical system states in temporal networks as well.     

基于K-阶结构熵的网络异构性研究

结构熵可以考察复杂网络的异构性.为了弥补传统结构熵在综合刻画网络全局以及局部特性能力上的不足,本文依据网络节点在K步内可达的节点总数定义了K-阶结构熵,可从结构熵随K值的变化规律、最大K值下的结构熵以及网络能够达到的最小结构熵三个方面来评价网络的异构性.利用K-阶结构熵对规则网络、随机网络、Watts-Strogatz小世界网络、Barabási_-Albert无标度网络以及星型网络进行了理论研究与仿真实验,结果表明上述网络的异构性依次增强.其中K-阶结构熵能够较好地依据小世界属性来刻画小世界网络的异构性,且对星型网络异构性随其规模演化规律的解释也更为合理.此外, K-阶结构熵认为在规则结构外新增孤立节点的网络的异构性弱于未添加孤立节点的规则结构,但强于同节点数的规则网络.本文利用美国西部电网进一步论证了K-阶结构熵的有效性.