modified-burgers-model

说明：  二级转运站选址数学规划模型求解的lingo 程序(Lingo Program for Solving Mathematical Programming Model of Secondary Transfer Station Location)

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

说明：  利用GA遗传算法解决欺骗函数最优问题，具体问题描述如下，如有问题请与我联系(The deceptive functions are a family of functions in which there exists low-order building blocks that do not combine to form the higher-order building blocks. Here, a deceptive problem that consists of 25 copies of the order-4 fully deceptive function DF2 is constructed for this paper. DF2 can be described as follows: f(0000)=28 f(0001)=26 f(0010)=24 f(0011)=18 f(0100)=22 f(0101)=6 f(0110)=14 f(0111)=0 f(1000)=20 f(1001)=12 f(1010)=10 f(1011)=2 f(1100)=8 f(1101)=4 f(1110)=6 f(1111)=30 This problem has a maximal function value of 750.)

通过采集直流输电线路正负极故障电流信息，实行正负极解耦，用行波进行故障定位( U901A u8FC1 u91C0 u96C6 u76R4 u6D1 u8F93 u7535 u7EBF u8DEF u6B63 u8D1F u6781 u6545 u969C u7535 u6D41 u4D1 u606F uFF0C u5B9E u882C u6B63 u8D1F u6781 U89E3 u806 uFF0C u7528 u884C u6)

说明：  解大规模线性方程组的预条件Gmres方法.系数矩阵可以非对称正定.(Solution of large-scale linear equations of the preconditioned GMRES method. Coefficient matrix can be non-symmetric positive definite.)

一个柴油机模型，能计算柴油机的油耗率，扭矩(a diesel engine modle)

多孔介质污染物迁移动力学地下水一维渗流的数学模型 差分求解(Contaminant migration in porous media groundwater dynamics differential one-dimensional mathematical model for solving seepage)

3DFFT,对三维数据进行傅立叶变换，效果较好.可以用于三维的地震资料处理(3DFFT, three-dimensional Fourier transform of the data, the better can be used for three-dimensional seismic data processing)

说明：  任意边界结构正交曲线网格生成程序，使用方便简单(Arbitrary boundary structure of orthogonal curvilinear grid generation procedure, easy to use simple)

卡尔曼滤波的源程序，卡尔曼滤波是以最小均方误差为估计的最佳准则，来寻求一套递推估计的算法。它适合于实时处理和计算机运算。 (Kalman filtering of source code, Kalman filter based on minimum mean square error for estimating the best criteria to search for a recursive estimation algorithm. It is suitable for real-time processing and computing.)