polarmy

Neighborhood rough set based heterogeneous feature subset selection

我编写bposs的神经网络应用程序，第一次上传(of neural network applications, the first upload)

matlab for compression

如果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.)

the most chatoc attractors for encryption and other application

说明：  关于UMHexagonS方式的一些论文，使用CAJviewer阅读(UMHexagonS)

数字图像处理matlab7.x编程学习指南(Digital image processing matlab programming study guide)

基于混沌系统的用用加密解密方法及实现源程序代码(Image encryption and decryption)

matlab遗传算法工具箱GAOT的应用(Matlab application of genetic algorithm toolbox GAOT.)

不错的matlab电子书，不错的matlab电子书，(Matlab good books, good books matlab,)