一种重复二分CSP4类运动想象脑电信号特征提取算法

针对脑机接口（BCI）系统中4类运动想象的脑电信号ERD/ERS现象进行研究,提出了一种重复二分共同空间模式（RB-CSP）算法用于4类运动想象脑电信号的特征提取,并运用SVM进行分类研究. 实验结果表明,该方法与传统的4分类CSP扩展算法OVR-CSP相比,减小了算法复杂程度,缩短了信号处理时间,提高了准确率,为在线脑机应用提供了一种新的解决方法.      

基于复杂网络技术的异步脑-机接口分类系统

脑-机接口(brain-computer interface,BCI)是一种不依赖周围神经和肌肉组织,通过诱发人脑无节律信号(event-related de-synchronization,ERD)/有节律信号(event-related synchronization,ERS)等特征信号实现对外部装置自主控制的系统。针对人群中15%～30%的人存在"BCI盲"问题,即难以诱发出较强的ERD/ERS等特征信号,提出将脑电图(electroencephalogram,EEG)时间序列转换成一个复杂网络,复杂网络的网络测度与大脑意识有关联。结果表明,基于复杂网络构建的相位锁相值(phase locking value, PLV)二值网络可实现异步BCI系统分类,分类正确率最高可达88.60%。可见,基于复杂网络技术的异步BCI系统具有可行性,可作为一种新途径。     

基于集合经验模式分解和公共空间模式的脑电信号特征提取

公共空间模式(common spatial pattern,CSP)能够较好地提取运动想象任务时脑电信号的判别特性,但是其性能与大脑进行想象任务的频带相关。为了确定这样一组频带实现精确的分类,基于集合经验模式分解、FIR滤波器组以及公共空间模式算法提出了一种脑电特征提取方法。预处理去除伪迹后的信号首先经过集合经验模式算法获得多个模函数,然后选择出包含μ节律和β节律范围的分量实现信号重构,重构后的脑电信号作为带通滤波器组的输入得到若干子带信号集合,从每个子带信号中提取CSP特征,最后将提取的特征经过支持向量机(support vector machine,SVM)进行分类。运用该方法对脑-计算机接口(brain-computer interface,BCI)竞赛数据集进行分类,实验表明该方法能够自适应地提取、筛选和判别每个受试者的空间CSP特征,分类准确率达96. 53%。     

基于小波方差的运动想象脑电信号特征提取

针对区分两种不同运动想象(想象左手运动和想象右手运动)的脑-机接口任务,提出了以小波方差作为分类特征的方法.首先深入研究了小波变换以及小波方差的计算方法,结合验证脑电图(EEG)存在的ERD/ERS现象,然后利用小波分解系数方差对C3,C4导联脑电信号进行特征提取,最后采用最简线性分类器进行分类,采用分类正确率作为主要评价标准.结果表明,最大分类正确率为85%,最佳分类时间段为4~6.5 s.与BCI竞赛和其他方法相比,在保证分类正确率的前提下,所使用的特征提取和分类方法更加简单,具有较高的参考价值.     

基于ICA与PSD的ERD／ERS信号检测

介绍一种基于独立分量分析（ICA）空间滤波结合功率谱密度（PSD）曲线分析法用于提取大脑在想象动作时产生事件相关去同步／同步（ERD／ERS）信号的方法．其检测流程为：先对想象动作诱发的脑电（EEG）信号进行ICA分解得到独立分量与相应的解混矩阵,再按特征频段取其主要分量得到滤波后数据,然后采用短时傅里叶变换计算相关导联EEG信号在特征时段与频段的PSD曲线,引入ERD／ERS系数作为量化指标以进行想象动作的识别．计算结果表明,上述方法能够显著增强运动想象脑电信号的ERD／ERS特征信息,且通过实际分类验证,采用该方法可以获得更高的识别正确率,较传统信息检测方法平均提高8％以上．     

自适应单次运动想像最优特征提取研究

为得到区分左右手运动想像脑电信号的最优特征,提出了一种自适应单次脑电特征提取方法.该算法先按运动想像电位生理学原理对不同被试寻找事件相关去同步/同步(ERD/ERS)现象最明显的频段与时间段,再按照这些参数提取C3,C4导脑电信号的能量,最后取其能量比值作为左右手想像分类的特征.采用公共标准数据集做测试,运用支持向量机(SVM)进行分类,并与AR特征提取法对照.结果表明,该法可有效提高分类正确率(平均90.7%,最佳98.7%),优于使用固定频段与时间段的AR特征提取法(平均77.4%,最佳92.8%),且算法复杂度低于AR特征提取法,适应性稍强于AR特征提取法,适合在线应用.     

单次运动想象脑电的特征提取和分类

为了实现脑-计算机接口(BCI)系统,对运动想象脑电信号的特征进行了提取和分类.将大脑C3,C4处采集的二路运动想象脑电信号分成4段,分别建立六阶AR参数模型进行功率谱估计,再对每段数据的功率谱求和构造特征矢量,提供给误差反向传播算法进行左右手运动想象脑电模式分类.结果表明,该方法提取的特征向量较好地反应了运动想象脑电信号的事件相关去同步(ERD)和事件相关同步(ERS)的变化时程.另外,该方法识别率高,复杂性低,适合在线脑-计算机接口的应用.     

基于CSP与SVM算法的运动想象脑电信号分类

针对基于两种不同意识任务(想象左手运动和想象右手运动)的脑机接口,使用共空间模式(common spatial pattern,CSP)算法对BCI 2003竞赛数据进行特征提取;基于滑动时间窗,利用CSP方法对C3,Cz和C4位置的脑电信号进行处理.利用支持向量机对特征进行分类,获得最大分类正确率82.86%,最佳时间点4.09 s,最大互信息0.47 bit,最大互信息陡度0.431 bit/s.与BCI 2003竞赛结果相比,最大互信息陡度有了显著提高,证明该方法更适合BCI实时系统的要求.     

基于粒子群优化支持向量机康复下肢外骨骼的脑电控制研究

为解决失能人群自主移动的问题,脑机接口(brain computer interface, BCI)已广泛应用于外骨骼领域,但脑电(electroencephalogram, EEG)信号因信噪比低等原因导致识别率一直难以提高。为提高基于脑机接口下肢外骨骼的信号识别率,采用粒子群优化支持向量机(particle swarm optimization-support vector machine, PSO-SVM)算法提高脑电信号识别率,取得了86.52%的脑电信号识别率。首先建立共空间模式(common spatial pattern, CSP)数学模型对脑电信号进行特征提取,随后建立基于粒子群优化的支持向量机分类模型,优化脑电信号分类关键参数,将最终的实验数据与传统的支持向量机分类方法比较,最后进行算法的验证及下肢外骨骼实验。实验结果表明：经过粒子群优化的支持向量机分类准确明显高于传统支持向量机分类。所提出粒子群优化支持向量机对脑电信号的特征识别方法可实现运动想象(motor imagery, MI)的精确识别,为脑机接口技术在康复外骨骼领域的应用提供理论基础和技术支持。     

独立分量分析和遗传算法相结合的运动想象频带优化

对结合独立分量分析(independent component analysis,简称ICA)和遗传算法(genetic algorithm,简称GA)的运动想象脑电(motor imagery electroencephalogram,简称MI-EEG)特征检测及其优化方法开展研究.设计了基于ICA的MI-EEG分类算法.在此基础上,针对不同受试个体,用GA算法对运动想象诱发的事件相关去同步(event-related desynchronization,简称ERD)频段进行优化选择,用以改善运动想象脑-机接口(brain-computer interface,简称BCI)系统的识别率.实验结果表明,基于ICA的GA算法特征优化方法具有较好的可靠性和实用性,可用于在线BCI的设计与实现.     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.