SVR

用VC编写的01背包问题,功能强大,是在老师的指导下完成的,大家可以用来参考(The 01 knapsack problem written with VC, powerful function, is completed under the guidance of the teacher, we can use for reference)

混合基FFT算法的C语言实现,采用了多层子函数调用()

说明：  GN算法是一种分裂型的社区结构发现算法。该算法根据网络中社区内部高内聚、社区之间低内聚的特点，逐步去除社区之间的边，取得相对内聚的社区结构。(GN algorithm is a divisive community structure discovery algorithm. According to the characteristics of high cohesion within the community and low cohesion between communities, the algorithm gradually removes the edges between the communities and achieves a relatively cohesive community structure.)

flume+kafka+storm整合，1.一个好的项目架构应该具备什么特点？ 2.本项目架构是如何保证数据准确性的？ 3.什么是Kafka？ 4.flume+kafka如何整合？ 5.使用什么脚本可以查看flume有没有往Kafka传输数据

本程序主要是针对超大整型数据的基础加、减、乘运算，运算位数可达10000位，同时也支持使用者进行修改扩展至更大位数

包含了很多ACM往届的赛题,对于ACM爱好者有很大的帮助(Contains a lot of previous ACM competition questions, for ACM enthusiasts have a lot of help)

通过贝叶斯信息准则确定高斯混合聚类方法的聚类簇数(Determining the Cluster Number of GMM Clusters by BIC)

模拟Photoshop中的磁力套索的算法，主要是先用Opencv做梯度相关处理，然后用Djisktra最短路径搜索找到边缘。(Magnetic Lasso implementation using Python)

克里金插值法实现二维和三位等高线的绘制功能,()

从数据库获取车辆在一段时间内的所有行驶记录的相关数据，确定所需数据为GPS经纬度坐标和驾驶时长等，QB模型采用MDF的思想,其基本思想为:通过平均直接翻转距离函数定义两条轨迹之间的距离，两条轨迹需要具有相同的经纬度点数，具有相同点数的轨迹最大的优点是对轨迹距离成对计算，且相同轨迹之间具有更高的分辨率，对于轨迹聚类的结果有一定的优化。(Retrieved from the database cars all over a period of time, record the related data, determine the required data for the GPS latitude and longitude coordinates, and the driving time, QB model by adopting the idea of MDF, its basic idea is: flip directly by the average distance function definition of the distance between two trajectories, two tracks will have the same latitude and longitude points, and has the biggest advantages of the same points of trajectory track distance calculation in pairs, and has higher resolution, between the same trajectory for trajectory clustering results have certain optimization.)