基于RRT及其改进型的路径规划算法

资源描述【摘要】蓝牙(IEEE 802．15．I)、ZigBee(IEEES02．15．4)．Wi-Fi(IEEE 802．11)是当前流行的三种短距离无线通信 协议标准，从应用的角度来看蓝牙技术是为取代个人的电子设备间的有线连接。ZigBee技术是为了建立一个可靠的无线监控 网络，w卜Fi技术的目的取代个人电脑的网线。现将对这三种流行的通信协议的主要特征比较，包括传输速度，功耗、安全． 【关键词】蓝牙；ZigBee；Wi-Fi；无线通信协议

常用的C程序数值算法-common procedures C Numerical Algorithms

"""

YUV文件读取源程序，可实现CIF、Qcif 等格式YUV数据的读取、播放、暂停等功能。

多维傅里叶变换，二维DFT快速算法，共分五部--四：三维复序列3D-DFT快速算法-Multi-dimensional Fourier transform, fast algorithm for two-dimensional DFT is divided into 5- 4: Three-dimensional complex sequence of 3D-DFT Fast Algorithm

有限长单位取样响应(FIR)数字滤波器的设计方法，很有用噢-Finite sampling unit response (FIR) digital filter design method is useful Oh

111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111

录音库采集，经常采用高采样率，如44.1k或16k, 但实际应用场合，录音采样率可能只有8k，因此需要降采样。本源码实现录音wav文件降采样，从16K转8K. 采用连续两点求平均，转完时域波形几乎不影响，听不出差别，但如用于语音识别，则可能有影响。

这几天学VC界面编程，在VC在线上狂看教程，觉得有所长进，于是把以前的Java代码用VC改写了一下。问题还是那个老掉牙的问题，八皇后问题，老归老，但我很喜欢-VC these days learn programming interface, the VC frenzy see online tutorial, some feel that complacency. So, before the Java code with VC rewritten a bit. Problems or those long-standing problems, 8 Queen"s problems and old to the old, but I like

平均因子分解法，适用于正定矩阵First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies: (1) U U = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition. -Average factor decomposition method applied to positive definite matrix First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X = UU, where U is the square root matrix of X, and satisfies: (1) UU = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is positive