subfunction

说明：  详细描述了通过卡尔曼滤波算法对GSP和imu数据进行融合(merge the gps and imu with the kalman)

快速计算相关系数的c代码,比较适用于统计学(Very efficient implementations for calculating correlation efficients )

说明：  分形理论计算，粗糙面结合面的法向载荷和法向接触刚度计算(fractal thoetry simulation)

用来作为数学建的参考资料学习，希望对爱好则用所帮助(math model study study .Used as a reference material for Mathematical Studies)

hybrid particle swarm optimization

正交实验中的极差分析代码，确定因素的优水平和最优水平组合，给出指标趋势图。(Orthogonal experiment range analysis code to determine the factors that the optimal level of excellent level and combination of indicators of trends is given.)

说明：  Description 设a[0…n-1]是一个包含n个数的数组，若在ia[j]，则称(i, j)为a数组的一个逆序对（inversion）。 比如 有5个逆序对。请采用类似“合并排序算法”的分治思路以O(nlogn)的效率来实现逆序对的统计。 一个n个元素序列的逆序对个数由三部分构成： （1）它的左半部分逆序对的个数，（2）加上右半部分逆序对的个数，（3）再加上左半部分元素大于右半部分元素的数量。 其中前两部分（1）和（2）由递归来实现。要保证算法最后效率O(nlogn)，第三部分（3）应该如何实现？ 此题请勿采用O(n^2)的简单枚举算法来实现。 并思考如下问题： （1）怎样的数组含有最多的逆序对？最多的又是多少个呢？ （2）插入排序的运行时间和数组中逆序对的个数有关系吗？什么关系？ 输入格式 第一行：n，表示接下来要输入n个元素，n不超过10000。 第二行：n个元素序列。 输出格式 逆序对的个数。 输入样例 5 2 3 8 6 1 输出样例 5(Set a[0... N-1] is a n array containing n numbers. If there is a [i] > a [j] i n the case of I < j, then (i, j) is a n inversion pair of a array. For example, has five reverse pairs. Please use the idea of "merge sorting algorithm" to achieve the statistics of inverse pairs with O (nlogn) efficiency. The number of inverse pairs of a sequence of n elements consists of three parts: (1) The number of reverse pairs in the left half, (2) the number of reverse pairs in the right half, (3) the number of elements in the left half is greater than that in the right half. The first two parts (1) and (2) are implemented by recursion. To ensure the final efficiency of the algorithm O (nlogn), how should the third part (3) be implemented? Do not use O (n ^ 2) simple enumeration algorithm to solve this problem.)

maple学习资料，以后学习maple就不用担心了(maple learning materials)

惩罚函数法C语言相关程序 它将有约束最优化问题转化为求解无约束最优化问题：其中M为足够大的正数， 起"惩罚"作用， 称之为罚因子，F(x, M )称为罚函数。(Penalty Function Method C language-related program it would have constrained optimization problem is transformed into solving unconstrained optimization problem: where M is a sufficiently large positive number, from the " punishment" effect, called the penalty factor, F (x, M) called the penalty function.)

概念格的构造问题是形式概念分析应用的前提。由于概念格的时空复杂度随着形式背景的增大而可能指数性的增大，有关概念格的生成问题一直是形式概念分析应用研究的一个重点。国内外的学者和研究人员对此进行了深入的研究，提出了一些有效的算法来生成概念格，这些算法一般可分为两类：批生成算法(Batch Algorithm)和渐进式生成算法(Incremental Algorithm )。。 (Concept lattice structure problem is the premise formal concept analysis applications. Since the concept of space-time lattice with the increasing complexity of the form and context may increase exponentially, generating questions about the concept lattice has been a focus of formal concept analysis applied research. Domestic and foreign scholars and researchers conducted a thorough study made a number of efficient algorithms to generate the concept lattice, these algorithms can be divided into two categories: batch generation algorithm (Batch Algorithm) and progressive generation algorithm (Incremental Algorithm ). .)