搜索资源列表
UnitRootTest
- this function calculate unit root for vector Y by metods: ADF (Augmented Dickey-Fuller) and PP (Phillips-Perron) also this function determine max lag for Y aoutomaticaly[Hayashi(2000)]- this function calculate unit root for vector Y by metods
test
- /// /// /// /// /// /// /// /// /// /// /// /// /// /// /// //// /**//*利用随机函数产生N个随机整数（2000以上），对这些数进行多种方法进行排序。 要求： 至少采用三种方法实现（提示，可采用插入排序、希尔排序、起泡排序、快速排序、选择排序、堆排序、归并排序）。 并把排序后的结果保存在不同的文件中。 统计每一种排序方法的性能（以上机运行程序所花费的时间为准进行对比），找出其中两种
AspackDie141
- 这是一个小小的 PE 文件解压缩器 (EXE, DLL, ...) 她可以解压缩 自 Aspack 2000 以后的任何 Aspack 版本. 包括: - Aspack 2000 - Aspack 2001 - Aspack 2.1 - Aspack 2.11 - Aspack 2.11c/d - Aspack 2.12 - Aspack 2.12a/b - 一些未知的版本-This is a small decompressor PE files (E
ShortPath
- 2000年数学建模B题最短路径的算法，能把从工厂到所有铺设地点的单位钢管运费计算出来-2000 Mathematical modeling of the shortest path algorithm B title
V-type_Antenna
- 用MOM计算V型天线的电流分布、输入阻抗及辐射方向图。其中L=0.3λ，L/a=2000，激励用δ-gap模型。-MOM calculated using V-shaped antenna current distribution, input impedance and radiation pattern. Where L = 0.3λ, L/a = 2000, excitation δ-gap model.
IsomapR1
- 2000年SCI上发表的两片开创性的流行学习文章的仿真代码。-2000 SCI published two seminal study popular articles simulation code.
gaojingduchengfa
- 高精度乘法，使用STC90C516单片机，可以计算出1-2000的阶乘，串口9600波特率输出-Precision multiplication, use STC90C516 microcontroller, can calculate the factorial 1-2000, 9600 baud serial output
Precision-arithmetic
- 本程序可对无符号整数进行高精度加减乘除，阶乘，排列组合运算。可计算2000！以内的精确结果。-This procedure can be performed on an unsigned integer precision arithmetic, factorial, permutations and combinations of operations. Computable 2000! Less accurate results.
ETSI-GSM_EFR-C_code
- GSM 06.53_增强全速率话音处理C代码 GSM 06.54_增强全速率测试序列 GSM技术规范目录_GSM 06系列_话音编码规范.pdf-ETSI EN 300 724 V8.0.1 (2000-11) Digital cellular telecommunications system (Phase 2+) (GSM) ANSI-C code for the GSM Enhanced Full Rate (EFR) speech codec (GS
EXTPRINCIPLE
- The M-files that are in the folders "Operations," "Extension Principle," and "Plotting" are all keyed into a specific chapter of the book Uncertain Rule-Based Fuzzy Logic Systems: Introduction and New Directions, by Jerry M. Mendel, and publish
hw6_solution
- 使用matlab来比较4种不同的编码的性能。环境是BEC（删除信道）。 信号串的长度为2-Use matlab to compare the performance of four different codes. Environment is the BEC (binary erasure channel). Length of the signal sequence is 2000
function-approximation
- 基于神经网络的函数逼近源代码c++,函数为y=sin(x*pi/400)+2-Source code c++ function approximation based on neural networks, function y = sin (x* pi/400)+2000
From-the-string
- 问题描述： 设有字符串X，我们称在X的头尾及中间插入任意多个空格后构成的新字符串为X的扩展串，如字符串X为“abcbcd”，则字符串“abcb□cd”，“□a□bcbcd□”和“abcb□cd□”都是X的扩展串，这里“□”代表空格字符。 如果A1是字符串A的扩展串，B1是字符串B的扩展串，A1与B1具有相同的长度，那么我们定义字符串A1与B1的距离为相应位置上的字符的距离总和，而两个非空格字符的距离定义为它们的ASCII码的差的绝对值，而空格字符与其它任意字符之间的距离为已知的定值K
order
- a function that classifies a flow according to the values of its Reynolds (Re) and Mach (Ma) numbers, such that if Re < 2000, the flow is laminar if 2000 < Re < 5000, the flow is transitional if Re > 5000, the flow is turbulent if M
BP
- BP神经网络的非线性拟合题目，随机生成2000组数据进行拟合-Nonlinear fitting problem of BP neural network, a randomly generated 2000 groups of data fitting
LM5030_Push-Pull-12V-60W-2000
- 电力电子推挽变换器连续工作模式的计算文件-push-pull converterdesign
Butterworth_Lowpass_Filter
- The Butterworth low pass filter with parameters input from keyboard Example: Fpass = 250 Ap = 2 Fstop = 500 As = 70 Fs = 2000 FN = Fs/2 Nyquist frequency-The Butterworth low pass filter with parameters input from keyboard Example: Fp
pxsfbj
- 算法提供了快速排序、冒泡排序、堆排序、插入排序的性能比较，并以100、1000、2000、5000、10000个随机序列作为实验检测-Algorithm provides quick sort, bubble sort, heap sort, insertion sort of comparative performance, and 100,1000,2000,5000,10000 random sequence as the experimental detection
jpeg-et-jepg-2000-code-avec-matlab
- projet for jpg & jpg2000 with matlab code
use-matlab-get-excel-information
- 在科研中，大量时间花在统计年鉴的搜集上，例如找《中国城市统计年鉴》中2000多个市，要对分散的八个城市群找对应的数据，如果每次筛选会花费大量时间，如果做好excel表头，把对应的城市写上去会在多个文件多个工作组查找满足要求的数据，直接按需要保存成excel，进行后续分析。-In the research, the amount of time spent on the Statistical Yearbook of the collection, for example, to find &qu