- MAX6675 A chip that can sense temparature and convert it to digital form and send through SPI protocol
- qq27-panelstack 读pdf的类库
- Understanding.Optical.Communications Before using this information and the product it supports
- RamdomPasswordGenerator ramdom password generator
- linux-process-start-analysis 1
- Android-GPS-developent the development of GPS measurement based on Android
资源列表
print_format
- 各种int型的输出说明符的详细展示，避免因为格式说明符造成输出结果的异常-Int type the output specifier show, avoid caused the exception of the output format specifiers
CharWordLineCount
- 统计从键盘输入的数据的字符数、单词数、行数-Statistical data entered from the keyboard, the number of characters, number of words, the number of lines
fft
- Matlab程序，GUI窗口 用FFT程序计算有限长度正弦信号y=sin(2*pi*f*t) ,0<=t<=N*T-FFT program calculate the finite length of the sinusoidal signal y = sin (2* pi* f* t), 0 < = t < = N* T respectively the DFT results obtained and analyzed and discussed in the fol
MUSIC
- Music algorithm for DOA
fft
- 快速傅里叶变换源码。包括一维和二维快速傅里叶变换和反变换，以及复数运算。-FFT source code
snappy-1.1.0.tar
- one data compression algorithm
code
- 问题描述： 在一个操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次至少选2 堆最多选k堆石子合并成新的一堆，合并的费用为新的一堆的石子数。试设计一个算法，计算出将n堆石子合并成一堆的最大总费用和最小总费用。 编程任务： 对于给定n堆石子,编程计算合并成一堆的最大总费用和最小总费用。 Input 测试数据的第1 行有2个正整数n和k，表示有n堆石子，每次至少选2堆最多选k堆石子合并。第2行有n个数，分别表示每堆石子的个数。 O
9.2.2
- 最小二乘法拟合形如f(x)=(a+bx)/(1+cx)的函数（9.2.2(1))，并解决人口预测问题(9.2.2(2-Least squares fit of the form f (x) = (a+bx)/(1+cx) function (9.2.2 (1)), and to solve the population prediction problem (9.2.2 (2))
FFT
- Linux系统中进行快速傅里叶变换完整程序，包含测试数据，亲测通过-Linux system, the fast Fourier transform in the full program, including test data, measured by the pro-
FFTtransform
- 自编快速傅里叶变换C++类程序，亲测通过，实现频谱分析-Self fast Fourier transform C++ class program, pro-test by spectral analysis
tp1
- algorithme of cryptography mathematical
least-squares
- 最小二乘法快速计算软件（带qt源码）最小二乘法（又称最小平方法）是一种数学优化技术。它通过最小化误差的平方和寻找数据的最佳函数匹配。-The least squares method least squares method for rapid calculation software (with qt source) (also known as the least squares method) is a mathematical optimization techniques. Minim