这是关于SLE4428卡的简介，有需要的可以看一下

Joseph环,哈希表,银行业务模拟系统为题目的数据结构课程设计。有详细的文字说明和源代码。-Joseph Wan, the hash table, banking simulation system for the subject data structure course design. A detailed written instructions and source code.

这是100个经典的C语言的程序设计，如果能认真看一边会有很大的收获-This is a 100 classic C language programming, if we can seriously look side will be a great harvest

CAD快捷键，不错 ，好东西 好东西-CAD keyboard, it is true is true that good things good things, good things

经典simple例子经典UML建模实例.mdl

Visual C++编程技巧之 1.如何获取应用程序的实例句柄? 2.如何通过代码获得应用程序主窗口的指针? 3.如何在程序中获得其他程序的 图标? 4.如何编程结束应用程序?如何编程控制windows的重新引导? 5.怎样加栽其他的应用程序? 6.确定应用程序的 路径 7.获得各种目录信息 8.如何自定义消息 -Visual C programming skills one. Application procedures for obtaining handle two examples. How the code was in the main application window to the three pointer. how the proceedings were other procedures icon 4. How to end application programming how to control windows programming guide the re-5. how to increase the planting of other applications 6. Application procedures for determining the Route 7. access to directory information 8. how to customize the news

介绍SOCKET在linux下的网络编程实现-SOCKET in the introduction of network programming under linux realize

海康产品测试过支持的备份设备:一些测试过的备份设备的型号.rar-Haikang Products tested to support the backup device: Some of the backup device tested models. Rar

数据结构实验4报告，实验内容或题目 l、随机产生n=100，200，300，1000，2000个整数并存于数组r[1..n]中。对主要查找算法（顺序查找、插入排序、冒泡排序、堆排序、快速排序）进行实验比较，计算出平均比较次数、平均移动次数及执行时间。由程序自动计算，由手工计时。 2、对实验结果数据进行对比分析。 主要内容是-4 reports the experimental data structure, content or subject of the experiment l, randomly generated integers n = 100,200,300,1000,2000 co-exist in the array r [1 .. n] in. On the main search algorithm (the order of search, Insertion Sort, Bubble Sort, Heap Sort, Quick Sort) for the comparison, the calculated average number of comparison, the average mobile number and execution time. Automatically calculated by the procedure by manual timing. 2, the experimental results the data were analyzed. Main content

离散Fourier变换（简称DFT）为离散信号的分析从理论上提供了变换工具，但由于计算时间较长而难以实现，快速Fourier变换（简称FFT）则是一种减少计算时间的有效算法。本文在对DFT计算量进行分析的基础上指出了FFT的实现途径与计算方法，针对FFT算法进行了程序设计并给出了应用实例。-Discrete Fourier transform (referred to as DFT) analysis for discrete signal theory provides a transform tool, but due to a computational time and difficult to realize, fast Fourier transform (the FFT) is a reduction in the effective algorithm to calculate time. In this paper, DFT calculation was carried out on the basis of the analysis points out the ways and realize the FFT calculation of FFT algorithm for program design and application examples are given.

The Sniffer s Guide to Raw Traffic