归档

说明：  三维FDTD程序,一个Fortran写的三维FDTD程序(Three-dimensional FDTD procedure, a Fortran program written by three-dimensional FDTD)

说明：  CZT和FFT的C语言实现代码，能有效滤除谐波，噪声。获得信号的频率，是一种良好的频率测量算法。(CZT and FFT of the C language code, can effectively filter out harmonics and noise. Access to the signal frequency, is a good algorithm for frequency measurement.)

改程序是计算出金属表面等离子体直波导的有效折射率随波长和传输长度随波的两色散曲线，另外给定Drude-Lorentzia模型参数给定后，还可以求解介电常数以及画出相应实部和虚部的曲线(This programer is used to calculate Ag relative dielectric constant accroding to the Drude-Lorentzia and sovle the transcendental equation for even illumination. At the same time,it can draw the diagram of relationship between the dispersion curve and the Transmission with the length. )

将txt数据转换为LMS test.lab软件所能接受的格式(Change the txt format file to Unv file which can be read into the famous vibration test software LMS test.lab)

进行PQ分解，计算电力系统潮流的有效方法，应用广泛(PQ decomposition is an effective method for calculating power flow in power system.)

车间调度问题的遗传算法matlab源程序，供大家参考(shop scheduling GA Matlab source for reference)

说明：  一个用于液体受热蒸发的UDF。压缩包中包含fluent网格文件，可直接进行联系。(An UDF used for heated evaporation.)

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

二维涡流位置及流场分布计算程序，Vortex Panel Method (Two-dimensional eddy current distribution of the location and flow field calculation program, Vortex Panel Method)

说明：  GM（1，1）灰色模型，便于了解其混沌特性，程序很短，由matlab编译，(GM (1,1) gray model to facilitate understanding of their chaotic behavior, a very short procedure, Matlab Compiler,)