数据挖掘中，判别树算法的应用例子。属于分类中的算法 很好。...

算法基本思想是：以循环的方式随机选择簇头节点，将整个网络的能量负载平均分配到每个传感器节点中，从而达到降低网络能源消耗、提高网络整体生存时间的目的。仿真表明，与一般的平面多跳路由协议和静态分层算法相比，LEACH分簇协议可以将网络生命周期延长15%。

自动谱分析：可用于丢失/采样/子束光谱分析；矢量自动迭代，可用于建模，故障诊断；-The applications of this additional toolbox are: - Automatic spectral analysis for Irregular sampling/Missing data, analysis of spectral subbands, - Vector Autoregressive modeling and Detection [uses ARMASA] - Reduced statistics ARMAsel: A compact yet accurate ARMA model is obtained based on a given power spectrum. Can be used for generation of colored noise with a prescribed spectrum. - ARfil algorithm: The analysis of missing data/irregularly sampled signals - Subband analysis: Accurate analysis of a part of the power spectrum - Detection: Generally applicable test statistic to determine whether two signals have been generated by the same process or not. Based on the Kullback-Leibler index or Likelihood Ratio. - Analysis of segments of data, possibly of unequal length.

指数平滑法预测数据-exponential smoothing forecast data

我们的一个非线性振动课的作业，希望大家能用上啊！-Of our non-linear vibration of a homework assignment, hope everyone can be on the ah!

 LSR2D - Build projection matrix L for straight rays in 2D. % Input %    Tx: transmitter coordinates, nTx by 2 %          1st column contains X coordinates, 2nd contains Z coordinates %    Rx: receiver coordinates, nRx by 2 %          1st column contains X coordinates, 2nd contains Z coordinates %    grx: vector of X coordinates of cell boundaries (sorted increasing) %    grz: vector of Z coordinates of cell boundaries (sorted increasing) 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

所有相关的数据挖掘算法和理论，都有详细的说明，有兴趣的可以下一步做

1.限幅滤波 2.中位值滤波 3.算术平均值滤波 4.递推平均滤波-1. Limiter filter 2. 3 median filter. Arithmetic mean filtering 4. Recursive average filter

约瑟夫环-Josephus

OpenGL中认为合法的多边形必须是凸多边形，凹多边形、自交多边形、带孔的多边形等非凸的多边形在OpenGL中绘制会出现出乎意料的结果。例如，在大多数系统中，只有多边形的凸包被填充，而在有些系统中，并非所有的凸包都被填充。OpenGL之所以对合法多边形类型做出限制，是为了更方便地提供能够对符合条件的多边形进行快速渲染的硬件。简单多边形可被快速地渲染，而复杂多边形难以快速检测出来。为了最大限度的提高性能，OpenGL假定多边形是简单的。

QR ALGORITHM To obtain the eigenvalues of a symmetric, tridiagonal n by n matrix