myhist

多机电力系统仿真及其潮流计算，图像的光流法计算的matlab程序,与理论分析结果相比。( Multi-machine power system simulation and flow calculation, Image optical flow calculation matlab program, Compared with the results of theoretical analysis.)

TOCHNOG PROFESSIONAL，有限元开源源程序。c++语言(TOCHNOG PROFESSIONAL, finite element open source. c++ language)

基于AOA的室外雷达定位算法仿真，基于TDOA的室外雷达定位算法仿真，基于AOA doa的室外雷达定位算法仿真，三维(Simulation of outdoor radar location algorithm based on AOA, simulation of outdoor radar location algorithm based on TDOA, simulation of outdoor radar location algorithm based on AOA TDOA, 3d)

对于应用数学专业学习非线性混沌控制的学生非常有用，可以下载并尝试自己动手改变后半部分，就能应用于新系统中(For students applied mathematics learning nonlinear chaotic control is very useful, you can download and try yourself to change the second half, will be able to be applied to the new system)

ABAQUS的二次开发，道路厚度与温度对路基的影响，来自廖公云老师的《ABAQUS有限元软件在道路工程中的应用》(ABAQUS secondary development, the road thickness and temperature of the roadbed, from Liao Gongyun teacher "ABAQUS finite element software in road works)

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

高斯正算坐标程序计算高斯投影的正算问题克拉索夫斯基椭球(Gaussian count is calculated coordinates of the Gaussian projection is counting police used batons for dispersing ellipsoid)

说明：  谐波傅里叶分解，旨在把复杂多变的曲线方程分解成各次规律的正弦波(Harmonic Fourier Decomposition)

最小二乘法含有非线性线性拟合附有理论和实际的例子说明比较具有实际应用哟(PLS)

利用有限元法计算悬臂梁的实例，包含详细说明，适合用于课程设计。(Using the finite element method to calculate the cantilever instance, contains a detailed description, suitable for curriculum design.)