chens

可靠性-最小路集-编程 计算图的最小路集，是装备可靠性课程的一个作业。(Reliability- minimal path sets- programming calculation of minimal path sets, equipment reliability courses a job.)

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

点云曲面建模，基于距离函数，运用移动最小二乘法，拟合曲面，提取等值面，用于散乱点云的快速三角网格构建(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)

采用递推最小二乘法在时域范围内辨识传递函数(Recursive least squares method identification in the time domain transfer function)

The solver was mdae to solve the teat tansfrer fields with cooling and hot zone. The Gauss-seidial, ADI, Laasonnen, and Crank-Nicolson schemes are present in the code. You can handle the method you want, iteration and the level of tolerance. The code was made at the LINUX platform. Let me know if you need assistance.

这是宇航学报的关于　基于卡尔曼滤波的盲多用户检测的文章　希望对大家有所帮助(This is the space of Kalman filter based on blind multiuser detection of articles want to help you)

有限差分法，5阶WENO格式求解一维Euler方程组的双冲击波问题(fifth-order WENO scheme for 1-D Euler equation with two blast waves problem)

MDVRP_遗传算法 可以运行 希望对大家有帮助(a solution to MDVRP ,i hope it can help you)

homagrapy matrix to find the homagrapy matrix from two pictures, first you need to get a set of coorlation vector

DFP法求优化问题的C++源代码，经测试，该程序运行正常，得到了预期的结果。(DFP method for the optimization of C++ source code, tested, the program works correctly to get the desired results.)