基于AAR模型和累积频带能量的特征提取方法

提出了一种自适应自回归（AAR）模型参数和累积频带能量相结合的特征提取方法,该特征应用于基于运动想象脑．机接口（BCI）之中,实现左右手运动想象分类,改善BCI系统的性能．首先,对头皮EEG数据进行小波分解和重构,去除EEG中的噪声,得到不同频带的EEG数据．然后,提取EEG数据的AAR模型参数特征和不同频带的频带能量特征,提出了累积频带能量特征和AAR与累积频带能量相结合的特征提取方法,分别以AAR模型参数、频带能量、累积频带能量和AAR＋累积频带能量为特征,利用线性判别分析（LDA）分类器对左右手运动想象任务进行特征分类．最后,对不同特征的分类结果进行比较,得出以AAR＋累积频带能量作为特征在BCI系统中的优越性能．     

血管性痴呆患者脑电信号的多通道线性描述符特征研究

为提取能有效区分血管性痴呆(VaD)患者与正常老年人的神经电生理特征标识,采用多通道线性描述符对两组受试者在执行oddball视觉探测任务过程中的脑电(EEG)信号进行特征提取研究.通过对任务状态和平静状态下多通道EEG的3个多通道线性描述符分析表明,在执行探测任务过程中,VaD患者的场强变化率Φ和空间复杂度Ω明显高于正常老年人,而在平静状态下却无显著差异,两组受试人群的有效场强均没有显著差异.分别对比不同受试人群在任务状态和平静状态下的3个描述符,结果表明,两组受试者在任务状态下的有效场强Σ比平静状态明显增高,Φ和Ω明显降低,而且VaD患者3个描述符任务状态相对于平静状态的变化率要明显低于正常老年人.因此,多通道线性描述符可以有效地反映人脑认知功能的衰退,为VaD患者的脑电特征提取提供了一种新的方法.     

基于相位同步的运动想象分类

针对多通道脑电信号特征提取过程中存在的特征向量稳定性低及区分度差的问题,提出相位同步与空间位置相结合的特征提取算法.首先,利用相位锁定值(PLV)衡量不同模式下不同脑区的相关程度,通过相关性分析发现感觉运动的作用机制,并按相关程度选取特征电极;然后,采用共空间模式算法(CSP)对所选电极间的PLV进行特征提取;最后,使用支持向量机(SVM)完成运动想象分类.本方法在持续4 s和1 s的左右手运动想象分类中分别获得平均91.3%和82.7%的准确率,相较于传统CSP算法具有更高的分类准确率,需要的电极更少,能快速响应短时不连续性运动想象.     

基于信息积累技术的大脑运动意识任务分类

提出了将信息积累技术结合Fisher判别式分析的方法,实现大脑想象左右手运动意识任务的连续分类,获得了满意的结果.利用Morlet小波滤波方法提取优化的运动相关脑电特征,对两组实验数据4个受试者的运动相关脑电模式进行分类,平均最大分类正确率达到87.95%.通过最大分类正确率、最大互信息等评价指标的比较,验证了信息积累技术对改善大脑运动意识任务分类性能的有效性,从而为脑机接口系统应用中大脑运动意识任务分类提供了新的思路.     

基于降维Householder变换的多任务运动想象脑电信号特征提取研究

近年来,针对传统的左右手运动想象BCI系统信息传输速率低这一现状,众多脑-机接口(BCI)研究团队开始着眼于对多任务运动想象脑电信号的研究,相比于两类模式识别,多类模式识别能够有效提高BCI系统的信息传输速率。如何准确提取出多任务脑电信号的特征,是实现多任务BCI系统的关键。采用了基于初等反射变换(又称Householder变换)的矩阵近似联合对角化算法,将CSP算法应用于多任务运动想象脑电信号的特征提取,对EEG信号采集效果较好的受试者,四任务运动想象脑电信号的分类准确率提升至80%以上,为在线BCI系统的实现奠定了坚实的基础。     

基于AR和SVM的运动想象脑电信号识别

针对不同思维运动中EEG信号识别,提出了一种基于自回归模型参数和支持向量机的识别方法.针对2008年BCI Competition Ⅳ Data sets 2a数据集中想象左右手运动的两类思维运动脑电信号,运用自回归模型进行特征提取,支持向量机进行特征分类.采用不同的核函数进行分类对比实验,该识别方法的正确识别率达到7...     

基于邻域空间模式的运动相关电位特征提取新方法

模式分类是基于脑电图（EEG）的脑-机接口(BCI)研究的重要环节之一.针对不同的BCI任务,所采用的分类特征和分类算法也不同.其中,运动相关电位（MRPs）现象是BCI想象肢体运动分类算法中的所用到的重要分类特征.针对BCI研究中的采集EEG数据分布复杂,和训练样本不足重要问题,本文提出一种新的MRPs特征提取方法—邻域空间模式 (NSP),利用邻域关系和类别信息,有效提取了分类性能更强的MRPs特征.最后的实验结果证明了NSP算法能更有效提取分类特征.     

基于时空特征学习Transformer的运动想象脑电解码方法

脑电图（Electroencephalography,EEG）可记录来自大脑皮层的电信息，反映了脑活动中神经细胞放电产生的电场变化情况. EEG的空间信息和时间信息对于运动想象脑电（Motor Imagery Electroencephalogram,MI-EEG）解码分类模型学习判别特征至关重要，但过度依赖预处理和手工特征提取，导致对EEG数据进行信号分类较为困难.尽管深度学习已经在很多领域实现了自动特征提取，但脑电图的深度学习尚未完成.提出基于FBCSP (Filter Bank Common Spatial Patterns)和Transformer模型的时空特征学习的运动想象脑电解码方法 .针对FBCSP滤波的脑电信号，依次通过空间维度和时间维度上的注意力转换来获取空间和时间特征，然后通过Softmax函数对不同类别的EEG数据进行分类.实验结果表明，在BCI竞赛数据集IV-2a上，该方法的分类准确率可达84.16%，为MI脑电信号分类提供了新思路.     

基于最小二乘支持向量机的脑电信号分类

研究了基于运动想象脑电信号对大脑的想象运动状态进行分类识别的问题.根据事件相关同步和事件相关去同步现象识别出被试的想象运动状态,通过频带能量特征提取方法获得了想象左右手运动时的脑电信号特征,使用最小二乘支持向量机对提取到的频带能量特征进行分类.结果表明,使用最小二乘支持向量机可以对运动想象脑电信号的频带能量特征进行有效分类,分类正确率达到92%,其分类效果与使用标准支持向量机相当,但在计算速度上更有优势.     

基于傅里叶变换的脑机接口系统实现方法

脑机接口系统要求实时的处理速度和较高的准确识别率.在对脑电信号进行幅频分析和相同步分析的基础上,提出一种意识任务识别在线脑机接口系统实现方法.提取谱峰和相同步相干性指数作为反映大脑运动意识任务状态的特征参量,设计基于信息积累的时变线性分类器,对左右手想象意识任务进行识别,获得了满意的结果,最大分类正确率达到90.72%.研究结果表明,谱峰特征是事件相关去同步/同步的一个敏感的量化参数,结合相同步相干性指数能够提供更多反映大脑意识任务状态的信息.该方法采用快速傅里叶变换和线性判别式分析,特征提取和分类算法简单,计算速度快.为在线脑机接口系统的实现提供了新的思路和途径.     

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…     

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.     

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

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

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).     

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.