各类Huffman编码

这是Java上用于jpeg解码的开源代码，里面注释非常清晰，是学习的很好材料，里面的主要类有DCT.java HuffmainTable.java,JPEGComponent.java, JPEGDecoder... 希望跟大家分享，谢谢大家！！！！！！！！！！！！！

用于合成孔径雷达运动补偿的相位梯度自聚焦算法。。。很有用。。。分四步。。。。

C++编写高斯消去法求解线性方程组，将程序include到主程序，然后建立Guss对象，求解可得到最终解，奇异矩阵将会出错！

应用背景 合理使用降维方式降低时间消耗 ,, , , , , ,  , , ,, , , , , ,, , , , ,,  ,,,, . ,.,.. kl lk l , l kk sfjsfjwu skfjkjweifafuhfifqvyegjjkfjjkxcbvznv,a,  关键技术 pca  sjfksjfljijwlj2pjjqiwj12292887shkjfsjkfnvmnzkjjfkjkjakjgaga das aasf a fafgdgerfvbcbn,mm.m..

k-means 算法的工作过程说明如下：首先从n个数据对象任意选择 k 个对象作为初始聚类中心；而对于所剩下其它对象，则根据它们与这些聚类中心的相似度（距离），分别将它们分配给与其最相似的（聚类中心所代表的）聚类；然后再计算每个所获新聚类的聚类中心（该聚类中所有对象的均值）；不断重复这一过程直到标准测度函数开始收敛为止。-k-means algorithm process as follows: First of all, the object data from the n choose k object as initial cluster centers and the remaining for the other object, then according to their cluster center with those of the similarity (distance) respectively assigned to them with the most similar (represented by cluster center) clustering obtained and then calculated for each new cluster center clustering (all objects in the cluster mean) repeated this process until the standard measure of function until the beginning of convergence.

dft与fft运算时间比较-compared the computing time of DFT and FFT arithmetic

用mente－calo法算三维积分： 工作平台是：vs2002（7.0） MFC-with mente- calo 3D integral operator France : working platform is : vs2002 (7.0) MFC

移动驱动器6.1版本，支持MPU9250，MPU9150，MPU6050，STM32与MSP430平台上的MPU6500。

大约有10种排序方法，如堆排序、快速排序、归并排序、插入排序、外壳排序、选择排序、早泡排序、线性排序、地址选择排序和基排序。我自己提出了一种简化的快速排序。-about 10 species of sequencing methods, such as heap sort, quick sort, merge, in order to insert sequencing, shell sort, select, in order of ranking as foam, linear ordering, sequencing and address choice-based ranking. I propose a simplified Quick Sort.

stand alone header file implementing eigen value decomposition for a symmetric matrix-stand alone header file implementing eigen value decomposition for a symmetric matrix