517618256plot3d

如果G的边集E(G)中有个子集M，满足M中的任何两条边 都不邻接，则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配，最大匹配所包含的边数称为最大匹配数。当 G是二分图时，问题就比较特殊了，这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)

a simple but efficeint scheduling Algorithm in a context ofdma. The idea is to satisfy fairness and the QOS from 2 point of view the first part of sub carrier will be allotted in such way that the flow total of the system is guaranteed and the second part ensures fairness between the users

利用shearlet的各向异性尺度调节功能实现基于shearlet的图形去噪。(Graphical denoising based on shearlet)

佛洛伊德方法用二值模型来形成多灰度图像的真实效果，希望分享(Digital halftoning is the process of converting a continuous-tone images into strictly black and white images such that, when viewed by the human visual system, the pattern creates an illusion of being a continuous shade of gray. )

传统的解相干方法主要有空间平滑和子空间拟合两类,但这些方法或者阵列利用率低或者计算复杂度高,因此寻求计算量小且阵列利用率高的解相干测向方法有重要意义.该文基于前后向矢量重构理论,(The traditional decoherence methods spatial smoothing and subspace fitting into two categories, but these methods or array utilization rate is low or high computational complexity and therefore seek small amount of calculation and array of high utilization coherent finding method is important. This paper is based on the vector before and after Reconstruction,)

关于盲信号处理的毕业论文采用ICA算法，该盲信号处理主要针对语音信号号的混合和分离，用matlab进行仿真实现(About the treatment of the graduation thesis, trimmers by ICA algorithm )

FOR HELP AND DOCUMENT FOR POWER DCV S

Hog + LBP + svm 行人检测(Hog+ LBP+ svm pedestrian detection)

最长公共子序列的 c代码，可以直接运行获得结果。(C code for the longest common subsequence can be run directly.)

Pisarenko谐波分解算法,wolf 方法计算李雅普诺夫指数,本科毕设要求参见标准测试模型。( Pisarenko harmonic decomposition algorithm, wolf calculated Lyapunov exponent, Undergraduate complete set requirements refer to the standard test models.)