Spartan 3E development board flashing LED lights cycle

桥梁电子杂志，内容较为丰富，希望对大家有所帮助-Bridges E-zine, the content is more rich in hope to help everyone

广州斯道的开发板手册，现在官方已经没有了。在网上基本上也没有了。用得着的朋友有福了-Canton Enso

本文档详细介绍了电机的pid算法，适合于新手-This document details the motor pid algorithm, suitable for novice

修改后的PCA进行人脸识别的Matlab代码 -Revised PCA for Face Recognition Matlab code

matlab应用实例。如：FIR、IIR数字滤波器设计等。-the example for degining FIR、IIR filter and so on.

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.

LabVIEW中利用ActiveX技术实现串行通信的电子书第四部分-LabVIEW use ActiveX technology to achieve serial communication eBook Part IV

此文件为RTF文件转换为TXT文件的解码程序。-RTF file for this file is converted to TXT file decoding process.

表达式二叉树的实现。输入任意一个前序中序或后序表达式，可生成对应的表达式二叉树并树状打印，之后用户可以选择以前序中序或后序将表达式再次输出。-expression of the realization of a binary tree. An arbitrary input before the order or sequence after sequence expressions, which will generate the corresponding binary tree and the tree expression Print, after users can choose before the order or sequence after sequence of expression of a recurrence.

数据结构C语言和Java描述单链表的基本操作-C language and Java data structures describing the basic operation of a single linked list