DDR走先得详细规则及注意事项，考虑的等长走线，数据线与地址线、控制线长度关系...

128位长双精度型数字运算包-128 long double precision numeral operation package

Kalman Optical Flow 算法的入门级例子-Kalman Optical Flow Algorithm for the entry-level example

aaaaa sdxswdwsdacdcwsaaasdxsdwsdadcwsaaasdxsdwsdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaasdxswasdacdcwsaaassdacdcwsaaaswawdwsdacdcwsaaaaaaasdxswasdcdcwsaaasdxswasdcwsaaasdxswasdcwsaaasdxswasdcwsaaasdxswasdcwsaaasdxswasdcwsaaasdxswasdcwsaaasdxswasdcwsaaasdxswasdcwsaaasdxswasdcwsaaasdxswasdcwsaaasdxswasdcwsaaasdxswasdcwsaaasdxswasdcwsaaasdxswasdcwsaaasdxswasdcwsaaasdxswasdcws

tetsdftetsdftetsdftetsdftetsdftetsdftetsdftetsdff公司

资源描述姿态结算源码：内含MPU6050、气压计、磁力计等驱动源码。

魔法世界的小明要乘传送阵到其目的地，传送阵有不同的规模大小，且只能由规模小的传送阵传送到规模大的传送阵。小明已经知道目的地的传送阵比他现在所在的传送阵规模大，且在这两个传送阵规模之间，有n-2个不同的传送阵。小明发挥起了聪明才智，将这些传送阵按规模大小标为1到n号，当然了1号就是起始地点，n号是目的地。 自然我们有，这n个标号的传送阵，号小的能去号大的，号大的不能去号小的。小明也测量了一些传送阵到另一些传送阵的时间，至于没有测量的时间的道路，小明不希望走(万一这条路传送阵失灵呢….)。 现在问题来了，小明最短需要多久才能到目的地呢？

ASN.1样例工程代码-ASN.1 type example project code

这是使用嵌入式零树小波的图像压缩算法。它用于在小波域中。这种算法是非常有效和有用在图像处理中。

应用光流法对目标进行检测和估计。亲测好用，效果很不错