线索二叉树

Sick雷达数据的OpenGL显示，利用激光雷达实现路面探测和障碍物判断。(Sick OpenGL display of radar data, the use of laser radar obstacle detection and judgment to achieve the road.)

这是一个用C语言在ICCAVR平台上弄的一个秒表的源程序 整了很久 觉得还是有点问题。不过 我想里面的一些东西 还是有点用。-This a C language in the platform ICCAVR a stopwatch get the entire source for a long time think it is some problems. However, I think there is something a bit used.

OpenCV 2 Computer Vision Application Programming Cookbook 的源码，采用C++风格，非常适合学习2.0以后的openCV 版本。(OpenCV 2 Computer Vision Application Programming Cookbook source, using C++ style, very suitable for learning 2.0 later OpenCV version. )

ADS1100是全差分输入、16位分辨率、SOT23－6封装、有自校准功能的精密A/D转换器(The ADS1100 is a fully differential input, 16 bit resolution, SOT23 - 6 package, and a precision A/D converter with self calibration functions)

合成地震记录是用声波测井或垂直地震剖面资料经过人工合成转换成的地震记录（地震道） 合成记录的制作是一个简化的一维正演的过程，合成记录F(t)是地震子波S(t)与反射系数R(t)褶积的结果。(Synthetic seismogram is sonic or vertical seismic profile data after conversion into synthetic seismograms (seismic trace) the production of synthetic seismogram is a simplified one-dimensional forward modeling process, synthetic seismogram F (t) is the seismic wavelet S (t) and the reflection coefficient R (t) the convolution results.)

《单片机编程魔法师之高级裸编程思想》完整版(Single chip programming wizard of high-level naked programming ideas)

01背包问题 问题陈述：给定n种物品和一背包，物品i的重量是wi，其价值为vi，背包的容量为C。合理选择物品装入背包，使得装入背包中物品的总价值最大。在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。 问题分析：0 1背包问题是一个子集选取问题，适合于用子集树表示0 1背包问题的解空间。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入左子树，在右子树中有可能包含最优解时才进入右子树搜索；否则将右子树剪去。 (01 knapsack problem problem statement: given n kinds of items, and a backpack, the weight of the items i wi, the value of vi, backpack capacity C. Reasonable choice items into a backpack, making the total value of the items loaded backpack. Each item i select items loaded backpack, there are only two choices that loaded backpack or loaded backpack. Items i can not be loaded into a backpack many times not only loaded items i. The problem analysis: 01 knapsack problem is a selected subset of the problem and suitable for the tree represents a subset of the solution space of 01 knapsack problem. Search solution space tree, as long as its left son node is a feasible node, the search into the left subtree, right subtree may contain only into the right subtree search the optimal solution Otherwise, the right subtree cut.)

Rigol osciloscope tool

语音电子门锁C语言程序，STC89C51D+ISD4002应用(Voice electronic lock C language program, STC89C51D+ ISD4002 application)

Codigo de en c++ y microcontrolador PIC