psowugong

本例是研究断裂问题的ABAQUS 子程序代码，使用Fortran语言编辑，研究扩展有限元的同志们可以借鉴一下。(This example is the study of fracture problems ABAQUS subroutine code, Fortran language editing, extended finite element study comrades can learn it.)

利用SAR卫星在多个时刻的位置和速度信息，计算出任意象元成像时刻卫星的位置，拟合出SAR卫星的轨道模型。(Using SAR satellite in multiple time position and velocity information to calculate as the image element imaging time satellite position, fitting the SAR satellite orbital model.)

这是几篇关于粒计算在故障诊断中的应用，对学习粒计算的应用很有帮助。(This is a few on Granular Computing in Fault Diagnosis of learning the application of granular computing helpful.)

确定近似最优正则化参数，很好的解决不适用问题(To determine the approximate optimal regularization parameter, it is very good to solve the problem.)

SpaRSA算法作为解决凸优化问题的重要方法，在压缩感知等领域具有重要应用，这篇文章是SpaRSA算法的原始文章，学习这篇文章就可以进行SpaRSA算法程序的编写了。(SpaRSA algorithm to solve convex optimization problems as an important method in the field of compressed sensing and other important applications, this article is SpaRSA algorithm original articles, learning this article can be carried SpaRSA algorithm procedures for the preparation of.)

利用FDTD算法简单计算波导耦合环的M文件。( M-file of using FDTD approach simulation the waveguide coupling ring)

说明：  用fortran 70实现数值积分，并实例计算了三个函数，导出了积分值和误差(The numerical integration is realized by FORTRAN 70, and three functions are calculated with examples. The integral values and errors are derived.)

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

应用基本粒子群算法求解复杂连续函数优化问题(Application of Basic Particle Swarm Optimization to Complex Continuous Function Optimization)

这个帖子中我想讨论的是移动窗口多项式最小二乘拟和平滑方法，粗糙惩罚方法，以及kernel平滑方法。(Posts in this discussion I think are moving window least squares polynomial fitting smoothing method, crude methods of punishment, as well as the kernel smoothing method.)