DBSCAN算法java实现

opencv 视频识别

求矩阵奇异分解svd算法，共计4种实现方式，-for SVD matrix decomposition algorithm, for a total of four kinds of achievement,

圆孔的夫琅和费衍射，以动画的形式表式衍射的过程，以及最后衍射的图样（来源于http://luobo.ycool.com/post.701424.html）-Round hole of Fraunhofer diffraction to the form of table-style animation of the process of diffraction, and the final diffraction pattern (from http://luobo.ycool.com/post.701424.html)

给出N口井的坐标，把距离小于给定值的分为一组。只要一口井与这一组中有一口井小于给定距离，则它属于这组-N wells given the coordinates, distance less than the given value is divided into one group. As long as a well and the group has a well less than a given distance, it belongs to this group

椭圆拟合的算法，简单实用，不用复杂的迭代，很容易看懂！-Ellipse fitting algorithm, is simple and practical and not complicated iteration, it is easy to understand!

MFC下实现加密算法MD5,可以对字符串跟文件进行加密.值得一看  Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All rights reserved. License to copy and use this software is granted provided that it is identified as the "RSA Data Security, Inc. MD5 Message-Digest Algorithm" in all material mentioning or referencing this software or this function. License is also granted to make and use derivative works provided that such works are identified as "derived from the RSA Data Security, Inc. MD5 Message-Digest Algorithm" in all material mentioning or referencing the derived work. RSA Data Security, Inc. makes no representations concerning either the merchantability of this software or the suitability of this software for any particular purpose. It is provided "as is" without express or implied warranty of any kind. These notices must be retained in any copies of any

复式河道水面线推求程序,开发平台Fortran。-penthouse river water line calculation procedures, Fortran development platform.

C语言冒泡法(起泡法)排序 思路：将相邻的两个数进行比较，将小的调到前头。 如果有n个数，那么要进行n-1次的比较。在第一次比较中要进行n-1次的两两比较，在第j次比较中要进行n-j次的两两比较。 过程：先通过动态赋值的方法，把用户输入的10个数字保存到数组中。 用两个for循环语句，外层循环是限制次数，内层循环限制某次要进行两两比较的次数。 如果a[n]>a[n+1]，那么将两个数进行交换。

这可以作为代码，以解释如何能与 arduino 接口声纳发现。它显示的代码来传递信息的部分的工作点到点的信息。这可以有助于获得正确的工作的 sd 链接和云

acm.zju.edu.cn第1234题（动态规划）-acm.zju.edu.cn that resolution 1234 (dynamic programming)