很容易确定该 BP 网络的输入为 64维。当数字数据混入噪声时，可以看作是对 0、1 数据进行简单的。比如说，要加入 7%的噪声，那就可以对 4 个 0或者 1...

匿名通信代码，用C++编写，特别与大家一起分享，如有不足，还望给出指导意见-Anonymous communication code, using C++ Prepared, especially with the U.S. share, if insufficient, but also gives guidance on Point

指针链表操作源码-source operating indicators Chain

Java Web 开发：Spring,Hibernate,strut Ajax。PPT-Java Web Development: Spring, Hibernate, strut Ajax. PPT

关于boost graph library的文档，值得好好研究一下-Boost graph library on the document, it is worth a good look

局域网聊天程序.rar-LAN chat program. Rar

UML for Java Programmers中文版part2.pdf-UML for Java Programmers Chinese version part2.pdf

还有一些在这个代码基础上升级的几个APK，感兴趣的可以看看，或许你们也可以做出更好的效果。 里面加了广告的一些代码，大家可以看，也可以忽略。

光接入网技术(电信新技术实用丛书), 光接入网技术(电信新技术实用丛书)-Optical access network technologies (telecommunications series of new technologies and practical), optical access network technologies (telecommunications utility of new technologies series)

Java 国际化基础.doc-Java international basis. Doc

用堆栈实现迷宫求解问题 基本思想: 若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。 求解迷宫问题的简单方法是：从入口出发，沿某一方向进行探索，若能走通，则继续向前走；否则沿原路返回，换一方向再进行探索，直到所有可能的通路都探索到为止。 为避免走回到已经进入的点（包括已在当前路径上的点和曾经在当前路径上的点），凡是进入过的点都应做上记号。-Maze with the stack to achieve the basic idea for solving the problem: If the current position can be adopted, in pressure, otherwise the next location to explore, if a dead end, then back to New Moon, the size of the maze: M* N. maze set up a custom. A simple maze to solve the problem is: starting from the entrance, along a certain direction to explore, can walk, then continue to move forward otherwise return along the same route, a direction for further exploration, until all possible pathways are exploring to date. In order to avoid going back to have access points (including the current path and current path in the point), all the points should be entered mark.