SR-simulation

利用ARIMA处理分析时间序列，计算数列相关性和数字特征并通过计算所得值进行一定范围的预测(ARIMA processing analysis time sequence, to calculate a number of columns and digital characterized by the calculated value for a certain range of the prediction)

《计算理论导引》(作者)[美] Michael Sipser(译者)张立昂 王捍贫 黄雄 机械工业2000年2月第1版.pdf(Computational Theory，(Author) [America] Michael Sipser (translator) Zhang Li Ang Wang Hanpin Wong Hung Machinery Industry in February 2000 1st edition. Pdf)

用MATLAB实现单因素/两因素重复测量方差分析，自带工具包中只有非重复测量的方差分析函数ANOVA。anova_rm实现单因素；rm_anova2实现两因素( function stats = rm_anova2(Y,S,F1,F2,FACTNAMES) Two-factor, within-subject repeated measures ANOVA.For designs with two within-subject factors. function [p, table] = anova_rm(X, displayopt)Single factor, repeated measures ANOVA.)

说明：  通过模型决定系数完成支持向量机参数优化，并建立基于大数据的支持向量机模型实现回归拟合(The parameters of SVM are optimized by the coefficient determined by the model, and the regression fitting is realized by the support vector machine model based on big data)

对格朗日、分段线性、三次样条插值方法的运用。(Grange, piecewise linear, cubic spline interpolation method to use.)

Description 设a[0…n-1]是一个包含n个数的数组，若在i<j的情况下，有a[i]>a[j]，则称(i, j)为a数组的一个逆序对（inversion）。 比如 <2,3,8,6,1> 有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, <2,3,8,6,1> 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.)

近似熵和互近似熵的matlab代码，用于脑波分析很有用(Approximate entropy and cross approximate entropy matlab code for brain wave analysis useful)

這個程式可以顯示 3~100 的 prime number，很適合新手練習的範例程式，附上源碼可以修改內部細節，多做驗證。()

矩阵运算实矩阵相乘复矩阵相乘实矩阵求逆的全选主元高斯约当法(matrix calculation real matrix multiplication complex matrix multiplication matrix inversion is a wholly-elected PCA Gaussian about when France, etc.)

标准节流件的计算中，利用软件MATLAB进行迭代计算(Standard Throttle pieces of the calculation, using MATLAB software iterative calculation)