DSP-based

LINUX内核指导，操作系统课程设计时做的(LINUX kernel guidance, operating system, curriculum design, when done)

Bebra EPL、ZPL条码打印，可根据模板生成指令，可使用USB打印端口，ReadMe中给出了详细说明 (Bebra EPL ZPL Barcode Printing, can generate command by label template, can use USB port, it s detailed describe in readme.txt.)

局域网监控系统客户端程序，可以与服务器端的程序一起形成一个局域网监控系统。(juyuwang jiankong kehuduan)

MFC、数据库的简单运用，适合初学者 功能模块 1）管理员模块有密码保护和身份验证等功能，有超级管理员和普通管理员等。 2）用户(顾客)可操作性：标准统一的用户界面；方便快捷的数据查询、交互式信息渠道；安全可靠的用户档案、定单信息跟踪与管理。 3）提供最新商品介绍、价格等资料；方便快捷的后台商品维护、统计报表和用户定单管理；多用户实时数据库访问。 4）鲜花预定模块，实现在规定日期里能够预定鲜花。 5）零售鲜花和批发鲜花的功能要分清。(MFC, the database is simple to use, suitable for beginners Functional modules 1) The administrator module has password protection and authentication features such as super administrator and administrator. 2) users (customers) operability: the standard unified user interface convenient data queries, interactive information channel safe and reliable user files, order tracking and management. 3) to provide the latest products, the price information convenient background commodities maintenance, statistical reports and user order management multi-user real-time database access. 4) flowers scheduled modules, to achieve the specified date to pre-flowers. 5) the function of the retail flowers and wholesale flowers to distinguish.)

混沌控制经典书籍--混沌控制及其优化应用-作者邹恩(Chaos control of classic books- Chaos control and optimization applications- Author Zou En)

说明：  Euler 回路问题 .问题描述： 对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次 的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。 .编程任务： 对于给定的图G，编程计算图G 的一条Euler 回路。 .数据输入： 由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个 顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示 图G 的一条边(u,v) 。 .结果输出: 将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。(Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.)

演示了如何创建和删除一个应用程序的过程,使你深入了解windows系统中类似的操作过程是如何实现的(Demonstrated how to create and delete an application process, so that a deeper understanding of your windows operating system similar to the process of how to achieve the)

很好的能解决网络数据丢包处理的算法。特别是在带宽一定的情况下，解决网络数据传输和带宽、数据传输完整性的较优解决方案。(good solution processing network data packet loss algorithms. Especially in certain circumstances bandwidth, the solution to network bandwidth and data transmission, data transmission integrity of the optimum solution.)

有关三维插补的程序，自己做一个数据库，记录一些数据点的插补值，可通过补偿算法，算出其他点的插补值(The 3 d interpolation procedures, own a database, record the data point of some interpolation value, but through the compensation algorithm, work out the other points interpolation value)

GPS_SINS integrated navigation Calman filtering algorithm, loose coupling, VC++ programming, MFC interface.(Calman filter algorithm for GPS_SINS integrated navigation)