CC2530驱动DHT11（简单易懂、自己编写）

说明：  可以判断数据的实时性，处理数据的格式，将gis、dat数据转换成xls或科傻in1数据，并且自动添加转点(It can judge the real-time of data, process the format of data, convert GIS and dat data into XLS or kesain1 data, and automatically add transfer points)

本源代码是用VC编制的克里金插值计算，请下载后解压(source code is compiled with VC of Kriging, after extracting Download)

y2.c LU分解-y2.c LU decomposition

基于STM32的isd1760语音芯片控制程序，已经测试通过，可直接使用，(based on chip STM32 isd1760 languague chip control have been tested can be used drictly)

ks0108驱动atmea16的；用于proteus仿真使用；可以加载调试其他程序进行显示观测；(ks0108 driver atmea16 for Proteus simulation use can load debugging other programs to display observation )

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

基于opencv的图像边缘检测,实现了图像的边缘检测(photo edge detect based on opencv)

C# Winform DataGridView 某一列中 呈现 树形控件 实例源码下载

说明：  基于MATLAB完成的神经网络源程序,可以利用该程序完成有关神经网络的应用。(MATLAB based on the completion of the neural network source code, you can use the program to complete the neural network applications.)

97提升小波变换的MATLAB程序源源码，对初学入门者有帮助。 (97 lifting wavelet transform MATLAB program source code, help for beginners beginners.)