用来检查文件之间的相似程度

混沌Chaos工具箱，计算Lyapunov指数非常准确。-Chaos Chaos toolbox for calculating Lyapunov index very accurate.

数据采样显示控制数据采样显示控制数据采样显示控制

VB网络连接的程序-VB network connectivity procedures

用matlab来实现的衍射模拟实验，便于教学中立体的观看实验结果，这是很好的-using Matlab to achieve the diffraction experiments to facilitate the teaching of stereo viewing the experimental results, This is a good

使用函数实现简单的八位处理器 软件开发环境：ISE 7.1i 仿真环境：ISE Simulator 1. 这个实例实现通过ISE Simulator工具实现一个可以进行两个八位操作数四种操作的简单处理器； 2. 工程在project文件夹中，双击mpc.ise文件打开工程； 3. 源文件在rtl文件夹中，mpc.v为设计文件，mpc_tb.tbw是仿真波形文件； 4. 打开工程后，在工程浏览器中选择mpc_tb.tbw，在Process View中双击“Simulation Behavioral Model”选项，进行行为仿真，即可得到仿真结果。-The use of a simple function to achieve the eight-processor software development environment: ISE 7.1i simulation environment: ISE Simulator 1. This example through the ISE Simulator tool to achieve the realization of a two operand four of eight simple processor operation 2. works in the project folder, double-click to open the project file mpc.ise 3. rtl source file in the folder, mpc.v documents for the design, mpc_tb.tbw is the simulation waveform files 4. to open a project, a browser in the works Select device mpc_tb.tbw, double-click in the Process View in the " Simulation Behavioral Model" option, to carry out acts of simulation, simulation results can be obtained.

此版本的 SmallStruct 5 为稳定版，可以用于商业开发，适合于C/S结构的功能复杂，业务多变的应用系统。 SmallStruct 5是一个基于配置的的应用程序框架，集成了应用程序大部分一般性功能，只要编写少量代码即可生成应用程序，并且框架本身也是可扩展的。 -this version of the five SmallStruct stable version can be used for commercial development, suited to the C/S structure and function of complex and changeable business applications. SmallStruct 5 is based on an allocation of the application framework. Integrated application of the majority of the general functions, as long as the preparation of a small amount of code can be generated applications, and the framework itself is extensible.

[输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include int number //队列类型 typedef struct{ int q[20] -[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then

c语言之函数篇，从基础学起，让你彻底精通c语言的应用。-function of c language,learn form base,lead you to be well up to application of c language

一个适合教学使用的小型角色扮演游戏，2D卷轴设计。适合编程初学者学习。-suitable for teaching use of a small role-playing games, 2D scroll design. Programming for beginners learning.

hdl demo of a program uploaded