改进的DAGSVM手势识别方法

在现有支持向量机多分类方法基础上,提出了一种改进的有向无环图支持向量机(DAGSVM)手势识别方法.分析了传统有向无环图支持向量机分类器生成顺序随机化的不足,引入类间距离和类的标准差作为生成分类器的测度.利用Kinect获取场景深度信息得到手势图像,提取手势特征并训练SVM分类器,并采用改进后的方法得到DAGSVM分类器.实验证明:与其他支持向量机多分类器相比,改进后的DAGSVM分类器能够达到更高的识别率,将这个手势识别方法用于智能轮椅的控制上,取得了良好的效果.     

基于AP算法支持向量机的设计与应用

设计一种基于AP聚类算法和SVM分类器相融合的新的混合分类器, 使用AP聚类算法优化数据集, 得到了高质量、 小样本的SVM分类器训练集. 实验结果表明: 与传统的SVM分类器相比, 混合分类器具有更高的分类精度; 在心脏病预测上, 该分类器的效果较好.     

支持向量机在地层识别中的应用

以径向基函数RBF为核函数,根据测井数据建立支持向量机的地层识别模型(SVMM).通过对SVMM分类器中惩罚参数C的优选,结合生产工程需要引入判断函数,提高了SVMM分类器的分类正确率.试验表明:SVM分类器应用在地层识别中效果良好,而且具有广阔的应用前景.     

利用表面肌电进行手势自动识别

针对手势自动识别研究中提高正确率和降低训练时间两者需要同时兼顾的问题,提出了一种基于Fisher Score(FS)特征降维方法与机器学习相结合的新的手势识别模型。提取4通道表面肌电信号的时域、频域、时-频域和非线性特征,构成特征集;采用FS方法和主成分分析(PCA)方法分别进行特征降维,采用线性判别分析(LDA)和支持向量机(SVM)分别作为分类器;通过两种特征降维方法与两种分类器的不同组合构建不同的手势识别模型,并对分类模型的性能进行对比研究。实验结果表明,特征降维方法与分类器的组合能显著提高分类器的正确率、降低训练时间。与PCA方法相比,FS方法是一种实现简便、效果理想的特征降维方法:与SVM组合的分类模型获得最高分类正确率99.92%;与LDA组合的分类模型不仅获得99.24%的分类正确率,而且花费最短的训练时间1.44ms,该模型可为手势的实时自动识别提供理想的方法和途径。     

基于一类SVM的贝叶斯分类算法

提出一种基于一类支持向量机(one-class SVM)的贝叶斯分类算法,该算法用一类SVM对类条件概率密度进行估计以构造贝叶斯分类器. 证明采用高斯核的一类SVM,其解可以归一化为密度函数,并把该密度函数看作类条件概率密度的平滑估计,构造贝叶斯分类器. 实际数据集上的实验结果表明,提出的分类算法测试准确率高于简单贝叶斯分类器与贝叶斯网络分类器,不低于传统二类SVM;比传统二类SVM需要计算的核矩阵规模更小,训练时间更短.     

基于SVM多类分类算法的模拟电路软故障诊断

给出了基于支持向量机(SVM)1-v-1和决策导向无环图(decision directed acyclic graph,DDAG)多类分类算法的模拟电路软故障诊断新方法.DDAG是在1-v-1算法基础上构建的新的学习架构,在对多个SVM子分类器进行组合的过程中,引入了图论中有向无环图的思想.比较了采用不同核函数时支持向量机的分类结果.实验结果表明采用DDAG支持向量机(DAGSVM))多类分类算法时,诊断准确率为99%.因此,DAGSVM算法具有较高的诊断准确率.     

改进的SVM决策树分类算法

为解决多类分类问题,在分析SVM决策树分类器及存在问题的基础上,通过引入类间可分离性测度,并将其扩展到核空间,提出一种改进的SVM决策树分类器。实验表明了该分类算法对提高分类正确率的有效性。     

使用增量SVM进行文本分类

针对传统SVM无法适应文本数据库随着时间不断更新的问题,通过对新增文本集的KKT条件的分析,研究了加入新增文本集后支持向量集的变化,提出了使用增量SVM进行文本分类的算法,并通过实验验证了通过该算法得到的分类器和传统分类器有着相似的分类能力和泛化能力.     

云计算环境的并行支持向量机

针对基于GPU和MPI并行的支持向量机（SVM）算法不适合于云计算环境,设计了一种基于多级SVM的并行支持向量机模型,实现了云计算环境下的序列最小优化（SMO）的并行算法。该算法通过MapReduce系统将大规模训练数据集划分为若干小训练集,再由这些小训练集开发多级的SVM,最后收集每一个SVM最优超平面附近的样本数据来训练另一个新的SVM。实验结果表明,该算法在时间消耗与分类正确率等综合方面比单机算法和传统并行算法获得更好的效果。     

基于支持向量机的脑电信号分类方法研究

针对传统支持向量机分类方法在脑电信号处理中存在分类正确率低的问题,将聚类思想与二叉树支持向量机(SVM)结合,构造多类SVM分类器。实验以"BCI Competition 2005"中的Dataset IIIa为例,先对C3/C4导采集的四类运动想象脑电信号应用小波变换进行去噪。再在分析小波包频带划分特点的基础上,利用小波包进行分解与重构,获取相应的能量特征。最后应用改进后的SVM分类方法对特征信号进行分类。结果表明该方法分类正确率,可以达到91.12%;并且有效地减少了分类器的个数,最终达到较好的识别效果。     

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.