216663

数组排序,按照数组的某个元素进行排序,使用请查看(Sort the array, in accordance with a certain element of the array to sort, the use of please see)

windows小帮手,vc6 0开发的,有点小问题(Windows helper, developed by vc6 0, a little bit of a problem)

说明：  背包问题运用贪婪算法的matlab 程序实现(Use of greedy algorithm knapsack problem of matlab program)

说明：  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.)

说明：  将数据集转换为拉普拉斯矩阵，然后利用基于图论的谱聚类进行聚类。拉普拉斯矩阵采用高斯核函数，全连接方法计算。谱聚类擅长处理高维数据或非凸数据集。(The data set is transformed into Laplacian matrix, and then clustered by spectral clustering based on graph theory. The Laplacian matrix is calculated by using the Gauss kernel function and the full connection method. Spectral clustering is good at dealing with high-dimensional or non-convex data sets.)

这是基于em算法混合高斯模型参数的估计方法，用matlab开发的，看一遍程序就会明白了。(mixture Gauss estimation)

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

用R语言做dcc-garch 模型的全过程代码(Using the R language to do the dcc-garch model)

将数据集转换为拉普拉斯矩阵，然后利用基于图论的谱聚类进行聚类。拉普拉斯矩阵采用高斯核函数，全连接方法计算。谱聚类擅长处理高维数据或非凸数据集。(The data set is transformed into Laplacian matrix, and then clustered by spectral clustering based on graph theory. The Laplacian matrix is calculated by using the Gauss kernel function and the full connection method. Spectral clustering is good at dealing with high-dimensional or non-convex data sets.)

实现了先来先服务算法,可以作为大家学习的参考(First come first served algorithm is realized, which can be used as a reference for us to learn.)