CVPR2008行为识别文章

接收来自下位机的数据,然后进行数据处理和通讯(From under the machine to receive data bit, and then data processing and communications)

土质边坡极限平衡分析软件简介，陈组煜院士开发，功能强大(Limit equilibrium analysis of soil slope Software Introduction, Chen-yu Academy Development Group, a powerful)

用不同的颜色和颜色显示同一张图片计时器。取决于在时间轴上，对图片进行颜色更改，并确定哪个是更好。写吧颜色的RGB代码和代码的颜色计数器源要在项目中使用的代码。

8051 Bluetooth Interfacing

51单片机UCOS系统移植，包括全部源码，以及自己写的部分代码，编译通过(The 51 single-chip UCOS system transplantation, to including the the the all source code, as well as to write their own of the part of the code, the compiler through)

三维曲面（球面、圆柱面或按正弦函数起伏的曲面），设置合适的光源及材质，应用环境光、漫反射及镜面反射，显示有光照效果的曲面图形，可以改变光源的位置及材质，观察光照效果的变化。(Three dimensional surface (spherical and cylindrical surface or by the ups and downs of the sine function), light and suitable materials, application of ambient light, diffuse and specular surfaces, graphic display light effect, can change the location and material source, observe the change of illumination effect.)

对于vc++中经典的画线画图示例程序.对于类的控制和画线算法的实现.代码简洁明了(For vc++ in a classic example of procedures for drawing a line drawing. The type of control and painting line algorithm. Concise code)

绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行 定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解 决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每 个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone. Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a defined start-point, end-point)

功能简单，实现了加减乘除，取余等简单功能。适合初学者使用。(Features simple addition and subtraction multiplication and division achieved, take over other simple functions. Suitable for beginners.)

RoundDisk幸运大转盘 旋转，精选ios编程学习源码，很好的参考资料。(RoundDisk lucky big turntable rotation, selection of learning IOS programming source code, a good reference.)