资源列表
tunnelca
- 地铁计算程序，计算盾构开挖，fortran编程-MTR calcu shield excavation, fortran program
GHWPCA
- VC 6.0下的主成分分析代码，包括关系矩阵，协方差矩阵，以及因子分析的功能-VC 6.0 Principal Component Analysis code, including the relationship matrix, covariance matrix, and the function of factor analysis
rng
- 以前在网上搜到的一个随机数发生器，支持常用分布的随机数发生-found on the Web to a random number generator, used to support the distribution of random occurrence
phptoie
- php获取浏览器信息,使用php代码来获取客户的浏览器信息-php browser access to information, the use of php code to access customer information browser
marqfitp
- 二次最优化的C/C++源代码，适合研究数值计算、计算机视觉等方面的研究人员参考！-quadratic optimization of the C / C source code for the study of numerical calculation, Computer Vision and other aspects of reference!
fix_fft
- 定点基2FFT，并且具有将定点FFT与浮点FFT比对的功能-sentinel radix 2 FFT, and will be positioned with floating-point FFT and FFT functions to the
spectral
- The Spectral Toolkit is a C++ spectral transform library written by Rodney James and Chuck Panaccione while at the National Center for Atmospheric Research between 2002 and 2005. The library contains a functional subset of FFTPACK and SPHEREPACK, inc
FinancialNumericalRecipesinC++
- Numerical Recipes in C++的源代码-Numerical Recipes in C source code
Calculate_N!_Code_in_Delphi
- 用Delphi编写的计算n!的方法，是用字符串转换的，速度很慢，可以用来与常规方法比较，了解各自的优越性-prepared by the Delphi calculating n! The method is the use of the string conversion, the speed is very slow. can be used with conventional methods, the understanding of the superiority of their re
fft1111111
- FFT算法必须为2的整数次 -FFT algorithm for the two integer FFT algorithm for the integer 2
20070207
- (邮票问题) 设想一个国家发行n种不同面值的邮票，并假定每封信上至多只允许贴m张邮票。对于给定的m和n值，写一个算法求出从邮资1开始在增量为1的情况下可能获得的邮资值的最大连续区域以及获得此区域的各种可能面值的组合。例如：对于n=4和m=5，若有面值为（1，4，12，21）的四种邮票，则邮资最大连续区域为1到71。还有其他面值的四种邮票可组合成同样大小的区域吗-(Stamps) envisaged a national issue of n different denominations o
erjinzhibianmaGA
- 生成0到1之间的一个随机数，因为利用浮点型生成器，所以准确到小数点后6位-0-1 generated among a random number, because the use of floating-point type generator, so accurate to six decimal places