关键词： BCI   支持向量机   一阶μ波   二阶μ波   离散度   CSP分类法  

摘要： 脑-机接口(Brain-computer interface,BCI)是在大脑和外部设备之间建立的一种信息通道,传递人的需求信息.它可以把人的需求直接转换成外部指令,从而代替人的肢体或语言并实现与外界的交流.BCI这一技术将为更多的瘫痪、聋哑患者提供便捷的沟通工具.本文主要研究基于运动想象的BCI数学模型与算法研究,主要目的是寻找和定义最能区分不同类型运动想象脑电信号的数量特征,并构建恰当的分类算法,得到较高的识别分辨率.全文共分为七章.第一章主要介绍BCI的背景及前景,并介绍了本文的主要工作.第二章介绍与本文研究相关的基础知识,包括EEG的频域分析法等.第三章介绍基于一阶μ波水平的电极筛选和特征分类,然后进行任务相关分析,进而根据第一平均值上下界定法和第二平均值上下界定法的出相应的准确率.第四章主要讨论二阶μ波水平的概念,以及用二阶μ波分析实验数据.第五章主要介绍l1-距离的概念及算法实现.第六章主要介绍l2-距离的概念及算法实现.第七章分为三个部分,包括CSP分类算法的简介,实验数据分析及结果分析及总结

关键词： Data mining  

摘要： With relative theory about technology of data mining and recommender model of user’s interest, this paper presents the method of MWFP-TREE based on the combination between recommender model idea of user’s weight and the minimum weighted FP-TREE method. Compared to traditional method, this method does not only carry out dimension reduction of raw data to improve the efficiency of a constructing tree but it also performs association rule mining and improves mining effect. This method is applied to mathematics teaching evaluation in one university and it finds out different evaluations from different students respectively considering students’ information and teachers’ information while it is not similar to traditional thought which is only to perform mining direction based on teachers’ information. Towards mining regulations and results, it provides significant referential values for objectivity of teaching evaluation and teaching directions. © 2014, Journal of Chemical and Pharmaceutical Research. All rights received.

关键词： 数学算法   基础课   程序框图   执行过程   运行结果   学生   自然语言   执行步骤   循环结构   描述   教学重点   教学实践   计算算法   高中数学   程序语言   人教版   积木式   题目   课堂   考察  

摘要： 高中数学人教版教材必修3第一章为算法基础,主要介绍一些简单的算法案例,以及用自然语言、程序框图和程序语句来描述算法.高考对这一章内容的考察要求比较低,只要求学生能够分析题目中给出的算法程序框图的执行过程,得出算法运行结果.从备考的角度备课,我们把教学重点放在程序框图,要求学生能够读懂程序框图所描述的算法,列出算法的具体执行步骤,根据步骤计算算法运行结果.在教学实践中,学生碰到的主要问题是:不会分析循环结构的执行过程,不能清楚判断在算法执行的每个步骤中变量的值是何时被修改的以及怎样被修改的.为了加深学生对算法的理解,我将类似程序框的积木式的程序语言Scratch引入算法课堂中,效果良好.

关键词： Fuzzy measures   the Choquet integral   genetic algorithms   least square method  

摘要： There are different nonlinear integrals that could be used as an aggregation tool in information fusion and data mining. The Choquet integral with respect to fuzzy measures is one of them. We present some methods to identify fuzzy measures based on the Choquet integral in this paper. An iterative method introduced by Grabisch is discussed with some counterexamples. Furthermore, after removing some restrictions which are used in Grabisch's model, we introduce an algebraic method and a genetic algorithm to identify fuzzy measures and present some experimental results on both artificial and real-world data sets to show their effectiveness.

关键词： clustering   optimization   discrete k-median   mixed-integer programming   uncoupled bilinear program algorithm   sequential optimization   time series  

摘要： Discrete k-median (DKM) clustering problems arise in many real-life applications that involve time-series data sets, in which nondiscrete clustering methods may not represent the problem domain adequately. In this study, we propose mathematical programming formulations and solution methods to efficiently solve the DKM clustering problem. We develop approximation algorithms from a bilinear formulation of the discrete k-median problem using an uncoupled bilinear program algorithm. This approximation algorithm, which we refer to as DKM-L, is composed of two alternating linear programs, where one can be solved in linear time and the other is a minimum cost assignment problem. We then modify this algorithm by replacing the assignment problem with an efficient sequential algorithm for a faster approximation, which we call DKM-S. We also propose a compact exact integer formulation, DKM-I, and a more efficient network design-based exact mixed-integer formulation, DKM-M. All of our methods use arbitrary pairwise distance matrices as input. We apply our methods to simulated single-variate and multivariate random walk time-series data. We report comparative clustering performances using normalized mutual information (NMI) and solution speeds among the DKM methods we propose. We also compare our methods to other clustering algorithms that can operate with distance matrices, such as hierarchical cluster trees (HCT) and partition around medoids (PAM). We present NMI scores and classification accuracies of our DKM algorithms compared to HCT and PAM using five different distance measures on simluated data, as well as public benchmark and real-life neural time-series data sets. We show that DKM-S is much faster than HCT, PAM, and all other DKM methods and produces consistently good clustering results on all data sets.

关键词： 算法   算法考核   算法试题   试题编制  

摘要： 高中数学作为我国中等教育的一门基础学科,顺应时代发展的需要,陆续进行了一系列改革,我国于2003年,颁布了《普通高中数学课程标准(实验)》,将“算法初步”引入高中数学课程体系,揭开了高中算法研究的新篇章.本文针对“算法初步”的教学与考核进行了研究,主要研究内容有以下几方面:1.为了了解学生对高中算法的理解以及对河南省2013年高考算法试题的认识,首先做了问卷调查,调查对象是洛阳师范学院部分大一新生和洛阳理工学院附中高三应届毕业生,对问卷结果进行了分析,得到如下结论:(1)学生对算法知识的掌握不全面;(2)学生学习算法的兴趣不高,主动性不够;(3)学生缺乏算法的应用意识,应用算法的能力不强;(4)学生对2013年高考算法试题的总体评价是简单.2.在《普通高中数学课程标准》的基本理念和具体要求下,结合问卷调查得到的结果,对高中“算法初步”的教学进行了研究,教学内容分析的切入点是数学史与数学文化,以提高学生学习算法的兴趣;结合自己的学习实践,尝试探究教学策略,以帮助学生更好地理解算法知识,增强其应用算法的意识.3.结合前人的研究,总结了高考算法试题的考查策略;纵向分析了2011—2013年河南省高考数学试卷中有关算法知识的试题,包括试题类型、涉及的“算法初步”知识以及算法与高中数学其他知识的结合等;横向比较分析了2013年全国各省市高考理科数学算法试题;为编制算法试题提供依据和参考.4.根据《数学教育测量与评价》中试题的选择与编制理论,结合问卷调查统计的学生对2013年高考算法试题认识的结果,尝试编制试题,为“算法初步”的考核提供参考与借鉴.本研究最后提出了关于算法的教学与学习建议,希望对算法的教学与考核提供帮助,也为高中算法知识的相关研究提供一些素材.

关键词： Extraction  

摘要： The sifting process is influenced by a number of factors that can decrease the separation efficiency, and interactions between these factors are so complex that there is no precise method for evaluating and predicting the degree of separation of the sifted material from the initial mass. This led to the low efficiency of industrial equipments for sifting. Therefore, it is important to better understand this process and to define the optimal conditions of sifting. Expression of sifting process through mathematical relationships is, generally, empirical, worldwide the researchers proposing different models approaching more or less to reality. These models were verified experimentally and the coefficients of mathematical relationships and the degree of correlation with experimental data were determined. In industrial milling units, grinding of seed or crushed seed fraction, are always followed by a sifting stage in a plansifter compartment for dividing grist on fractions. In this paper is presented an algorithm for calculating the coefficients of extraction on frames, on frames packages and on the entire plansifter compartment using experimental data obtained from the first plansifter compartment of a wheat milling plant with a capacity of 100 t/24 h. Coefficients of extraction shows the degree of separation of the sifted particles from the initial material feeding the sieve or sieve package at a time. Through this the sifting efficiency for a frame or a packet is actually estimated. Their knowledge is essential for assessing the technological passages yields of grain milling unit. Based on this algorithm the coefficients of extraction of frames and packages of frames are then calculated.

关键词： s-transitive graphs   symmetric graphs   Cayley graphs   magma   combinatorial algorithms  

摘要： A finite graph is one-regular if its automorphism group acts regularly on the set of its arcs. In the present paper, tetravalent one-regular graphs of order 7p(2), where p is a prime, are classified using computer algebra tools.

关键词： LATEX (Computer software)   INFORMATION retrieval   MATHEMATICAL formulas   DATABASES   COMPUTER algorithms   MATHEMATICAL analysis  

摘要： A method is proposed to retrieve mathematical formula in LaTeX documents. Firstly, we represent the retrieved mathematical formula by binary tree according to its LaTeX description, normalize the structure of the binary tree, and obtain the structure code and then search the mathematical formula table that is named by the structure code and the formula elements of the first two levels of the binary tree in the mathematical formula database. If the table exists, then we search the normalizing variable name preorder traversing sequence of the binary tree in the table and display the document information that contain the mathematical formula. The experimental results show that the algorithm realizes the retrieval of mathematical formula in LaTeX documents and has higher retrieval precision and faster retrieval speed.

关键词： 区间数学   删除策略   粒子群策略   负载均衡   并行化  

摘要： 区间数学是计算数学的重要分支，它采用区间变量代替点变量进行运算，目的是控制计算结果的误差估计，保证计算结果的可靠性。然而其固有缺点：超宽度问题却严重限制了它的发展。 区间数学的超宽度问题，也称依赖问题，是结果区间的表示范围大于函数的真实值域范围。当结果区间范围远大于实际值域范围时，区间计算的结果区间将变得毫无意义。因此，本文将对区间数学超宽度的产生进行分析，采用分裂法降低结果区间的超宽度，同时引用启发式选择策略，降低区间全局寻优算法的计算量，减少内存消耗。 区间全局寻优算法由于存在计算量大，计算时间长等问题，其在工程领域的应用也受到了限制。粒子群算法是利用群体智能规律的一种全局寻优算法，该算法在给定范围内进行全局寻优，能够快速收敛于全局最优值。因此，本文将对粒子群算法进行分析，提出一种新的混合全局寻优算法。该算法在继承了粒子群特性的基础上，在初始区间内进行全局寻优，加快算法收敛速度，找到全局最优区间。 传统的区间全局寻优算法具有计算时间长，长期占有宝贵计算资源的缺点。因此，本文研究全局寻优算法负载均衡的运行在集群计算机中。并行计算是指将计算任务划分成多个并行部分，分配到多个处理器上运行，其目的是缩短问题的解决时间。因此，针对混合全局寻优算法，本文首先将对混合全局寻优算法进行并行化，然后采用负载均衡策略动态的将并行混合全局寻优算法调度到轻负载节点中，避免集群出现忙等现象，提高系统的执行效率。 本文的主要研究内容如下： 1.研究区间数学的删除策略。通过对分裂法的分析，提出一种减少计算量，降低内存消耗的启发式选择策略； 2.对粒子群全局寻优算法进行研究。利用其参数少，收敛速度快的特性，为解决分裂法后期，算法效果不佳的缺点，本文提出了一种新的混合全局寻优算法。 3.针对传统的全局寻优算法常常消耗大量集群资源，本文开发出了一种基于负载均衡策略的WEB系统，首先本文将对新的混合全局寻优算法并行化，缩短算法的计算时间，然后通过负载均衡策略动态将并行混合全局寻优算法调度到轻载服务器上运行，缩短集群的响应时间，提高资源利用率。