flashi原码，网站首页引导上可以应用

用外积和法设计的权矩阵，不能保证p对模式全部正确的联想。若对记忆模式对加以限制（即要求p个记忆模式Xk是两两正交的），则用外积和法设计的BAM网具有较好的联想能力。 在难以保证要识别的样本（或记忆模式）是正交的情况下，如何求权矩阵，并保证具有较好的联想能力？这个问题在用BAM网络实现对字符的识别程序仿真中得到体现。我们做过尝试，用伪逆法求权矩阵，虽然能对未加干扰的字符全部进行识别，但对加有噪声的字符识别效果很差。至于采用改变结构和其他算法的方法来求权矩阵，将是下一步要做的工作。-foreign plot and the design of the power matrix, p is no guarantee that all the correct pattern association. If memory model, the limit (that is, p-memory model Xk is orthogonal to the February 2), then foreign plot and design of the BAM network has good ability to think. It is difficult to ensure the samples to identify (or memory mode) is orthogonal circumstances, the right to seek ways matrix, and to ensure that the association has good ability? The problem with the BAM network of characters identification procedures simulation can be manifested. We did try to use pseudo- inverse matrix for the right, although they would not increase the interference of the characters in the identification of all, However, a pair of noise increases the effects o

利用Visa接口与Keithley2000万用表通信，LabVIEW编程-Interface with the use of Visa communications Keithley2000 multimeter, LabVIEW Programming

character segmentation

字符集编码的存储结构及其算法描述-storage structure and algorithm description

Linux 上的socket嗅探器，请大家批正-A socket sniffer running on Linux，please give me some advice.

制作的第一款休闲类的手机游戏，适合初学者参考-production of the first leisure class of mobile phone games for beginners reference

OSCI组织最新lease出来的传输级建模指导实验，对初学者快速认识TLM中的一些基本概念很有用，本实验经作者修改并调试通过。-The tutorial1 of TLM-2.0 which is released frm OSCI group!

MALLOC调试工具(附源码-Malloc debugging tools (with source code

求数组最长递增子序列算法。输入一个数组，输出其最大递增子序列-Array for the longest increasing subsequence algorithm. An array of input and output its maximum incremental sequence