A numerical method for analysis of Korres2003

开发环境没有可选项，fortran90,Fortran_90_and_Computational_Science-_codes(Computational Science codes by fortran90 )

高斯拟合程序，采用高斯函数拟合数据，获得拟合高斯函数的平均值和方差。(Gaussian fitting procedure, using Gaussian function fitting the data, fitting Gaussian function to obtain the mean and variance.)

最小二乘支持向量机工具想的设计，及其使用工具箱的指导手册。(The least squares support vector machine tool design think its use toolbox guidance manual.)

说明：  一个用于液体受热蒸发的UDF。压缩包中包含fluent网格文件，可直接进行联系。(An UDF used for heated evaporation.)

说明：  相场法材料计算的model C-pure对应的基础相场计算代码，初学者可取(The phase field calculation code corresponding to the model C-pure calculated by the phase field method material is suitable for beginners.)

本程序针对内弹道的计算实现火炮内弹道计算(The procedure for the calculation of the interior ballistics Gun Interior Ballistic calculation)

说明：  自己编写的期望最大化（EM）算法的MATLAB实现，里面有较为运行方法和程序说明，对新手有很好的帮助( I have written the expectation-maximization (EM) algorithm in MATLAB, which has run more methods and procedures described, there is a good help for the novice)

说明：  相场基础书籍的配套计算代码，对于学习相场法的基础同学来说极其有用(The supporting calculation code of the phase field basic book is extremely useful for the students who are studying the basic method of the phase field method.)

自己编的5种调制信号，通过反复训练模板能有较高的识别率，DC-DC部分采用定功率单环控制。( Own five modulation signal, Through repeated training VxODOGFlate have higher recognition rate, DC-DC power single-part set-loop control.)

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