celiangzukang

说明：  在雷达上应用卡尔曼滤波算法对目标轨迹进行预测(The application of the radar Kalman filter algorithm to predict the target trajectory)

运用龙格库塔法-ode45求解一个多自由度的振动方程，得到振动的时域响应曲线(Using Runge Kutta method, -ode45 solved a multi degree of freedom vibration equation, and obtained the time domain response curve of vibration.)

点云曲面建模，基于距离函数，运用移动最小二乘法，拟合曲面，提取等值面，用于散乱点云的快速三角网格构建(Point cloud surface modeling, based on the distance function, the use of moving least squares method, fitting surface, isosurface extraction for fast scattered point cloud build triangular mesh)

改进的GM（1，1）程序，可实现时间序列的灰色等维新息预测，采用弃旧纳新的原则。(The improved GM (1, 1) program, can realize the time series prediction using grey information renewal, discarding the old and new principles.)

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

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

西安电子科技大学葛德彪教授书后所附fortran程序(Xidian University, Professor Ge Debiao book accompanying fortran program)

1、 写出此两点边值问题的积分形式； 2、 构造有限元方程； 3、 编程计算显示计算结果。(1, write the two-point boundary value of the integral form 2, structural finite element equation 3, programming calculations show the results.)

说明：  海浪模拟，基于PM谱，根据海浪频率波高等因素(Wave simulation, based on PM spectrum, according to wave frequency wave higher factor)

曲线的高斯拟合,去除趋势性,对于一般非平稳序列的分析.(Gaussian curve fitting and removal of the trend, and for most non-stationary sequence analysis.)