msp430红外编解码

静态路由算法，也就是大家熟知的Dijkstra算法，对大家学习非常有用！(Static routing algorithm, which is well-known Dijkstra algorithm, learning is very useful for all of us!)

这个例程主要实现的功能是无线温度测量，无线模块用的是NRF905，温度采集用的是TLC1543(The main functions of this routine is a wireless temperature measurement, the wireless module is NRF905, temperature acquisition using TLC1543)

Particle image segmentation and matching subroutines themselves are prepared, Verification is available, Computing time and two-dimensional histogram.

数据由DMA送到内存中,主程序中把每个通道的数据分检出来经过"去极值取平均值滤波"后送给LCD显示,在万利的开发板上显示的值比万利的例子稳定多了(Data sent by the DMA memory, the main program data for each channel after sorting out "to the extreme averaging filter" to the LCD display, the value of the development board Manley displayed stable than Manley examples more)

说明：  SIFT，即尺度不变特征变换（Scale-invariant feature transform，SIFT），是用于图像处理领域的一种描述。这种描述具有尺度不变性，可在图像中检测出关键点，是一种局部特征描述子。 该方法于 1999 年由 David Lowe 首先发表于计算机视觉国际会议（International Conference on Computer Vision，ICCV），2004 年再次经 David Lowe 整理完善后发表于 International journal of computer vision（IJCV） 。截止 2014 年 8 月，该论文单篇被引次数达 25000 余次。(来自百度)(SIFT, namely Scale-invariant feature transform (SIFT), is a description used in the field of image processing. This description has scale invariance and can detect key points in images. It is a local feature descriptor. This method was first published by David Lowe at the International Conference on Computer Vision (ICCV) in 1999 and published in the International Journal of Computer Vision (IJCV) in 2004 after it was sorted out and perfected by David Lowe again. As of August 2014, more than 25,000 citations have been cited. (From Baidu))

电极系测井曲线 用matlab编写的用于学测井同学用(Electrode system logs using matlab for students with learning logs)

粉尘浓度检测，利用单片机处理采集光电传感器采集的数据，并转换成空气中粉尘浓度的数值。(Dust concentration detection, the use of single-chip processors to collect data collected by photoelectric sensors, and converted into the value of dust concentration in the air.)

显示不颜色的RGB值，由不同的RGB值显示颜色。-Display of RGB color values, RGB values by different display colors.

编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)

这是一份关于MSP430的C程序和课件，虽然不是很全面，但是对于新手还是够用的。(This is a report on the MSP430 C program and courseware, though not very comprehensive, but still enough for the novice.)