A258

this is decision tree ID3 algorithm, this algorithm is one of decision tree algorithm like cart, chaid, c4.5, etc

detector de bordes de sobel

ISE一些常见错误的描述，以及相关的解决办法(ISE WARNING and ERROR common and its solutionISE for some typical mistakes in parsing)

均方根Kalman程序，包括说明与matlab源程序。(A demo of sqare root kalman, including specification and matlab program.)

Constructs a new {@code ServerSocket} instance which is not bound to any port. The default number of pending connections may be backlogged.

最优化算法中，单纯形表法+两步法的matlab实现，通过两个实例调用两个函数实现(Optimization algorithm, matlab tableau method+ two-step method of implementation, call the two functions by means of two examples of the realization)

说明：  将一个文件中的非标点符号字符查找出来，放入到一个新文件中(A file of non-punctuation characters to find out, put into a new file)

说明：  当目标径向速度存在模糊时，通过搜索速度模糊数可以完全校正目标回波的距离走动(An ambiguity number searching program for Keystone transform)

一本关于用谱方法求解偏微分方程的matlab实现。(a book on using spectral method solve partial differential equations )

说明：  图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.(Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)