recognition of different characters

this program will give the functionality of bcd to seven segment display

该源码实现了各种EJB之间的调用，可以扩展功能。-achieved between the various EJB call can be expanded.

一个拉霸游戏的源码,界面不错的哦~是一个很好的VB游戏例子!-a widening tyrants game source code, the interface ~ Oh well is a good example of VB game!

东莞赛马场查询系统,可通用为其他查询系统-Dongguan racetrack inquiry system, common to other inquiries systems

说明:程序代码主要参考网上一个类似功能的Demo.出发点在于学习div+css布局技巧,学习窗口对象拖动的实现原理. 3.功能说明: ^.^! 基本类似于javaeye登入窗口的功能,支持窗口的拖动,窗口的关闭 登入表单的最小化,最大化 在IE浏览器中有滤镜功能 没有对div做圆角处理,看起有点楞楞的. 4.偶在IE6.0和Mozilla Firefox2.0.0.1_cn浏览器中跑过,可以正常使用.-Description: The program code similar to the main reference line features a Demo. The starting point is to learn div+ css layout techniques, learning the realization of principles of dragging the window object. 3. Function Description: ^. ^! Basically similar to the javaeye login window function, support a window dragging, the window closed login form to minimize, maximize in IE browser, there are filter functions div do not deal with rounded corners, looks a bit Leng Leng" s. 4. Even in the IE6.0 and Mozilla Firefox2.0.0.1_cn ran browsers can be used normally.

SIMULINK 入门教程,详细讲解了SIMULINK的具体操作,参数设置,并附有练习习题.-SIMULINK Tutorial, SIMULINK detailed account of the specific operation, parameter setting, together with practice exercises.

时间序列变异诊断，趋势分析

心电信号QRS波的检测，利用小波方法和其他方法-ECG QRS wave detection, the use of wavelet methods and other methods

[输入] 图的顶点个数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

使用JSTL编写注册用户管理系统，可以实现注册用户的增删改功能-used textbook prepared registered user management system, users can achieve additions, deletions and change function