基于熵的挖掘数据子空间聚类方法

一种混杂粒子群优化算法，通过单纯形加速优化过程-A hybrid particle swarm optimization algorithm, to accelerate the adoption of simplex optimization process

资源描述C语言下的可读写文件的图书管理系统                                                                                                                                                                                                                                                                                  

可以用来计算对称正定矩阵的逆矩阵，比通常的求逆程序的计算效率快很多，经过测试很好用，计算非常准确，使用方便，与大家共享。

This algorithm was developed by Professor Ronald L. Rivest of MIT and can be found presented in several languages. What I provide to you here is a C++ derivative of the original C implementation of Professor Rivets. The library code itself is platform-independant and has been tested in Redhat Linux. I ve included the sample code and makefile that I used for the Linux test. The demo, however, was written with Visual C++ 6 on a Windows 2000 platform.-This algorithm was developed by Professor Ronald L. Rivest of MIT and can be found presented in several languages. What I provide to you here is a C derivative of the original C implementation of Professor Rivets. The library code itself is platform-independant and has been tested in Redhat Linux. I ve included the sample code and makefile that I used for the Linux test. The demo, however, was written with Visual C 6 on a Windows 2,000 platform.

应用背景四旋翼控制源码传感器读取 学习stm32，时钟控制，中断控制，对四轴感兴趣的朋友看看有很大帮助关键技术对遥控器数据读取，控制，可自行修改程序进行悬停 mpu6050读取四轴飞行器四路PWM输出自稳

利用最小二乘法进行曲线的拟合,这是用多项式拟合曲线的源码!-using the least-squares method of curve fitting, which is the polynomial curve fitting source!

资源描述这个我自己编译的bp网络源代码  很好用的  

基本算法为：先将1填入第一行中间位置；再依次将2-n方按如下规律填写：//1，填入上个数上一行的右边位置，如果没有上一行则转到最后一行，如果右边没有方格//则转到最左边的方格。2，如果要填的位置上已经有数，则转填到它上一个数的下边方格//3，对于第一行的最后一个数的下一个数应填在该数下边的空格处-basic algorithm : a first Enter the middle of the first line; Another will be followed by 2-n-law filled out as follows :// 1, the number entered on the right side on his position, if not in his will to the last line, if not right box// then transferred to the most left while the box. 2, to fill the position of several, in turn, to fill it on a number of subordinate box// 3, the first trip to the final a few under a few should fill in the blank space of a few top candidate Department

数据挖掘经典k-means算法C源码实现-Data Mining the classical k-means algorithm C source code to achieve

以100、1000、2000、5000、10000个碎甲产生的序列随机数作为测试样本，通过时间复杂度以及比较次数详细比较了快速排 序、堆排序、冒泡排序、插入排序四种排序方法的性能，算法通过VC6.0实现，可以编译通过。同时更改源代码中的随机数产生函数值，可以更改测试性能比较的随机序列个数