这是一个模式是别里的关于fisher算法实现的广义线性分类器

快速FFT变换,C语言的,比较好用,我没试过-Fast FFT transform, C language, comparative ease of use, I have not tried

屏幕图片抓图，功能简单，但有写思想值得学习。-screen images, functions simple, but it was thought worth learning.

GIS软件，普通的地图设置操作和查看器，还能设置用户操作-GIS software, set up a map of the general operation and viewer, the user can set up

一氧化碳检测电路的设计，原理与应用电路。-Carbon monoxide detector circuit design, principle and application of the circuit.

扫雷游戏 java编写， 速度很快 界面很好-mine prepared, very fast very good interface

check and alarm system

c++priemer第三版，中文完美翻译，超好，希望对大家有用-c++ priemer third edition, Chinese perfect translation, super good, I hope useful for everyone

此为本人期末的课程设计VC设计:浏览器程序设计。注：本源码用Word文档存放。 简介内容:随着互联网在世界范围的广泛应用，WWW（World Wide Web,万维网）也日益成为互联网上信息交流不可缺少的工具。它是一种以HTTP（HyperText Tranfer Protocol,超文本传输协议）为基础，使用HTML（HypeText Markup Language,超文本标记语言）编写的有若干Web网页构筑而成的世界。 本课程设计要求设计类似于微软的IE浏览器，具备一个浏览器的基本功能，可以完成网上冲浪的任务。 设计 Visual C++为我们提供了一个ChtmlView类，有了它。可以很方便地设计浏览器。-this as the end of the course design VC Design : browser program design. Note : This source used Word documents stored. Introduction : As the Internet in a wide range of applications worldwide, WWW (World Wide Web, the World Wide Web) has increasingly become the exchange of information on the Internet an indispensable tool. It is a form HTTP (HyperText Tranfer Protocol, Hypertext Transfer Protocol) based on the use of HTML (HypeText Markup Language, HTML) prepared in a number of Web pages built by the world. The curriculum design requirements similar to the design of Microsoft"s Internet Explorer, a browser with the basic functions can be completed online surfing tasks. Design

对于网络安全知识的浅析，对做网络安全方面的同学有帮助。-for network security knowledge of the job of network security is to help the students.

1 编写采用二叉链表形式存储的二叉树的创建、先序、中序、后序和按层遍历的算法。 2 编写将一棵二叉树的所有左右子树进行交换的算法。 提示：验证是否交换可以调用二叉树的遍历算法，比较输出结点序列。 3 编写一个主函数，将上面函数连在一起，构成一个完整的程序。 4 调试并运行实验源程序。 -Prepared using a binary list stored in binary form of the creation, the first sequence, the sequence, after the order and by level traversal algorithms. 2 the preparation of a binary tree will be all about the exchange of sub-tree algorithms. Tip: Verify that the exchange can be called binary tree traversal algorithm to compare the output node sequence. 3 write a main function, the above functions together to form a complete program. 4 debug and run experiments source.