imm

说明：  模拟退火算法是为了避免求解最优化出现局部极值的问题而提出的算法，保证最终的结果是全局最优的，该matlab源程序能在matlab环境中实现(simulated annealing method is the best solution in order to avoid a partial optimization of extreme concern raised by the algorithm to ensure that the final result is that the global optimum, the source Matlab can achieve Matlab environment)

用ABAQUS及其子程序解决热冲压热力耦合问题(Subroutine with ABAQUS and hot stamping coupled thermal problem solving)

计算fluent相变的udf模型，包括气相到液相，液相到气相的双向传递。(Calculate the udf model of fluent phase transition)

一个机器学习的python文件，里面拥有各种机器学习方法，可以供大家参考(A Python file for machine learning, which has various machine learning methods, can be used for your reference.)

通过C语言，实现龙格库塔法，用四阶龙格库塔法求解一阶微分方程组。(Through the C language, the realization of Runge-Kutta method with fourth-order Runge-Kutta method for solving first-order differential equations.)

fft小程序：可用于分析离散值采集数据的谐波含有率，谐波角度等(fft小程序：可用于分析离散值采集数据的谐波含有率，谐波角度等 FFT small program: can be used to analyze the discrete value of the data acquisition of the harmonic content, harmonic angle, etc. )

说明：  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.)

试试你的运气。随机输入0到9之间的四个数，看看你能得到多少公牛，多少母牛，嘿嘿。(Try your luck. Random input between 0 to 9 the number of four to see how much bull you can get, how many cows, hehe.)

matlab求解变系数双曲方程，使用迎风格式(matlab solves the hypolic equation using upwind method)

调试通过可以使用，已调制信号计算其普相关密度，空间目标识别，采用PM算法。( Debugging can be used, Modulated signals to calculate its density Pu-related, Space target recognition algorithm using PM.)