搜索资源列表
MoShiPiPei
- 有一串10000位数的主串由1、2、3、4四位数随机获得,n位模式串是指有4的n次方个模式串,如2位模式串有:11、12、13、14、21、22、23、24、31、32、33、34、41、42、43、44等16个数组成。现在进行模式匹配,假设主串为:431324113122341324132等等,则第一次比较是43,第二次比较是31,第三次比较是13,依此类推,每比较一次则落得模式串中的一个,当所有模式串(有4的n次方个)都被找到时,记得所比较的次数,则这个次数就是这次匹配的结果。程序执行了
yibanmomi
- 几种模幂算法,有传统模幂,SMM模幂,基于2的K次方的模幂和最一般的模幂算法,还有为这些模幂算法建立的WINDOWS对话框。可以方便的运行。-algorithm, the traditional mode power, SMM Modular Power, Based on two of the K-th power module and the most common mode power algorithm, These modules also for the establishment
SMM
- 几种模幂算法,有传统模幂,SMM模幂,基于2的K次方的模幂和最一般的模幂算法,还有为这些模幂算法建立的WINDOWS对话框。可以方便的运行。-algorithm, the traditional mode power, SMM Modular Power, Based on two of the K-th power module and the most common mode power algorithm, These modules also for the establishment
gaijin
- 几种模幂算法,有传统模幂,SMM模幂,基于2的K次方的模幂和最一般的模幂算法,还有为这些模幂算法建立的WINDOWS对话框。可以方便的运行。-algorithm, the traditional mode power, SMM Modular Power, Based on two of the K-th power module and the most common mode power algorithm, These modules also for the establishment
chuantong
- 几种模幂算法,有传统模幂,SMM模幂,基于2的K次方的模幂和最一般的模幂算法,还有为这些模幂算法建立的WINDOWS对话框。可以方便的运行。-algorithm, the traditional mode power, SMM Modular Power, Based on two of the K-th power module and the most common mode power algorithm, These modules also for the establishment
TRIEIGE
- computes the eigenvalues of a symmetric tridiagonal * matrix T. The user may ask for all eigenvalues, all eigenvalues in the half-open interval (VL, VU], or the IL-th through IU-th eigenvalues.-computes the eigenvalues of a symmetric tr idiagona
tmmgain
- TRANSFER MATRIX FORMALISM FOR GRATINGS WITH DEFECTS AND GAIN -TRANSFER MATRIX FORMALISM FOR GRATINGS WI TH DEFECTS AND GAIN
Computer_NN
- 刚才没注意,上传的是.c文件,重新上传,忘谅解! 精确计算N的N次方,并完整显示结果!-just did not know, upload yes. C document, re-upload, forget understanding! N precise calculation of the N-th power and integrity of the result will be displayed!
th
- 弹簧隔振器的系数k0=4.5 hc=3.5 d=[3.15 3.23] a1=tan(pi*(d)./(2*hc)) a2=cot(pi*(d)./(2*hc)) % plot(d,a1) y=(a1+a2)*2*k0*hc*1e-3./pi y=y./9.8*8 % var=1+(tan(pi*(d+0.25)./(2*hc))).^2 k=2*k0*hc/pi*( var*pi./(2*hc)+var*pi./(2*hc)./
1002NA
- A polynomial of degree n has the common form as . Your task is to write a function to find a root of a given polynomial in a given interval. Format of function double Polynomial_Root(int n, double c[], double a, double b, double EPS) whe
newtonforNsqrt
- 牛顿法求N次方根,经典的数值分析方法,已测试运行无误-Newton' s Law of seeking N-th power roots, classical numerical analysis methods have been tested to run correctly
4de10000cifang
- 本程序实现了4的一万次方。欢迎大家来查看。-This procedure achieved a 4 th power of 10,000. Welcome you to see.
0071
- 在DELPHI中计算X的Y次方,使用指数函数实现。-DELPHI to calculate X in the Y-th power, the use of exponential function to achieve.
FFT_PIC
- 文件包含了FFT子程序及测试程序,其数据点数为2的n次方-Document contains FFT routines and testing procedures, the data points of the n-th power of 2
th
- 利用水力学基础理论,一个完整的调洪演算计算程序,压缩包包含所有需要的数据文件-The use of hydraulics basic theory, a complete calculation of flood routing process, compressed package that contains all the required data files
bigint
- 一个大整数计算的类!,支持2的256次方以上的数字的计算 -A large integer calculation of the class! In support of two of the 256-th power of more than a figure
199-199
- 199的199次方。-199 of the 199 th power.
FastKalmanAlgorthm
- 快速卡尔曼算法是递推最小二乘算法中的一种, 它的收敛速度比梯度算法快得多, 其计算量又比常规卡尔曼算法少得多, 特别适合于跟踪像电离层这样的快变化时变信道。 本文对 用于自适应均衡的快速卡尔曼算法进行了详细研究。-Fast Kalman algo r ithm is one of recursive least squares algo r ithm s . It has much faster equalizer convergence than the gradient algo
wccc
- (1)已知甲数的35 是36,甲数是( )。已知乙数的47 是12,乙数是( )。 (2)40分钟是1小时的( ),1小时的35 是( )分钟。 (3)铅笔的单价是钢笔的920 ,把( )看作单位“1”。 二、根据算式补充条件 (1)停车场有24辆大汽车,( ),有多少辆小汽车? 24÷23 (2)停车场有24辆大汽车,( ),有多少辆小汽车? 24×23 (3)停车场有24辆小汽车,( ),有多少辆大汽车? 24×
FindEigenvalue4thorderBVP
- 此程序用于求解四阶常微分边值问题的特征值问题,算例说明附在其中。-Finding the eigenvalues for 4-th order (BVP)ODE