Apocalyx游戏引擎

用外积和法设计的权矩阵，不能保证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

高频电子电路设计指导书-----课程设计说明-High-frequency electronic circuit design to guide curriculum design note book-----

...技术文章 程序源码 合作项目 在线教程 书籍下载 读书笔记 发布文章 综 合类编程 界面类编程 系统类编程 网络类编程 模板组件类 打印类... C/C+ +编程 XML/.NET 其它编程 欢迎光临VC在线 VC在线自创建以来,-procedures ... Technical Articles source cooperation projects online tutorial books downloaded articles published study notes Comprehensive Programming Interface Programming System category type programming network programming template type components category Print category ... C/C Programming XML/.NET other programming Welcome VC online VC online since its inception,

自己的扫雷程序源代码,结构灵巧-This is my source of the mine ,with flexible structor

哲学家进餐问题，进程是独立参与分配资源的最小单位，在有线程的OS中，线程是运行的最小单位， 课堂所述进程之间的同步与互斥，实际上是属于不同进程的线程间的同步与互斥，当 然，属于同一进程的不同线程一样存在同步与互斥，其控制同步与互斥的原理跟进程 是一样的-dining philosophers problem, the process is independent participation in the allocation of resources as the smallest unit, in the OS thread, thread is the smallest unit of operation, the process described in the classroom between the synchronization and mutual exclusion. actually belong to different threads in the process of synchronization and mutual exclusion, of course, the same process there is a different thread synchronization and mutual exclusion, control and coordinate the process with the principle of the same

资源描述一个关于单片机led灯的实验，有Isis图和编程代码，刚入门的初级人士可以看看

I2C Serial Data Interface Module for Silabs C8051F1-I2C Serial Data Interface Module for Silabs C8051F133

实现简单的MIMO-OFDM系统性能仿真-Realize a simple MIMO-OFDM system performance simulation

程序目的： 输入一个任意大小的迷宫，用栈求出一条走出迷宫的路径，并 显示在屏幕上。 程序实现： 可以实现载入迷宫和保存迷宫，附带文件中有4个测试迷宫路径的 文件test1~4.dd。请将这些文件拷贝到TC当前目录下，或者在载 入时写明完全路径。由于屏幕大小的限制，当用户自己输入迷宫 时一定要注意：迷宫大小是有限制的，不小于4*3,不大于30*20。 否则会出现错误信息。输入开始时全是墙，用上下左右键移动， 用Del键删除墙，形成通路，用Enter键添加墙。输入结束时可以 将迷宫保存下来，以dd为扩展名。输入完毕时用F9键来得到结果， 找到路径时，屏幕下方会出现Path found，否则出现Path not found。 程序经Turbo C 2.0编译调试成功。运行时不用添加任何运行库。 不可以在VC上编译。-procedures purpose : to bring in a maze of arbitrary size, with a stack get out of the maze of trails and on the screen. Program : can achieve and preserve the printed maze maze, the accompanying documents were four test maze of trails to document test1 4.dd. I would be grateful if those files are copied to the TC current directory, or in the state when fully contained path. Due to restrictions on the size of the screen when the user input labyrinth must pay attention to : the size of the maze is a restriction, not less than 4* 3, not more than 30* 20. Otherwise there will be a wrong message. At the beginning of the importation of a

塞班例子程序，完整的可以编译通过的代码，希望对初学塞班程序的朋友有所帮助，谢谢交流。！-Saipan example program, a complete code can be compiled by the hope that a friend of the beginner program Saipan help, thank you share. !