SPI+OLED显示屏用户资料

dkink 的 推箱子游戏~，初学者的最爱，够简单。-The Sokoban game dkink ~, beginners favorite, simple enough.

说明：  智能机械手控制系统项目代码，使用西门子s7-200 smart 。编程平台STEP 7-MicroWIN SMART，编程使用梯形图（LAD, LadderLogic Programming Language）。(Project code of intelligent manipulator control system, using Siemens S7-200 smart. Step 7-microwin smart programming platform, LAD (ladder logic programming language) is used for programming.)

虚拟机设计与实现源代码，很不错的源代码。至于书籍可到网上下载！-Virtual Machine Design and Implementation of source code, source code is pretty good. As for books can be purchased online at download!

关于uboot的移植及命令的一些介绍,查作为移植使用的参考-on uboot transplant and ordered to definitely check the use of transplantation as a reference

说明：  实现GPS信号的捕获（主要是实现ca码的对齐，即码跟踪）(Acquisition of GPS signal (mainly the alignment of Ca code, i.e. code tracking))

说明：  基于ADMM-Total-Variation算法的CT图像重建(CT image reconstruction based on ADMM-TV algorithm)

digital image processing aliasing -digital image processing aliasing

应用粒子群算法对IEEE33节点进行容量优化(Particle swarm optimization algorithm is used to optimize the capacity of IEEE33 nodes)

算法实现题 最长公共子序列问题 给定两个序列 X = { x1 , x2 , ... , xm } Y = { y1 , y2 , ... , yn } 求X和Y的一个最长公共子序列 举例 X = { a , b , c , b , d , a , b } Y = { b , d , c , a , b , a } 最长公共子序列为 LSC = { b , c , b , a }-Algorithm to achieve the longest common sub-title sequence of the problem given two sequences X = (x1, x2, ..., xm) Y = (y1, y2, ..., yn) for X and Y, a maximum common substructure sequence, for example X = (a, b, c, b, d, a, b) Y = (b, d, c, a, b, a) the longest common sub-sequence for LSC = (b, c, b, a )

说明：  FLUENT的UDF，实现钝体运动的模拟，适用于嵌套网格。(The UDF of FLUENT realizes the simulation of blunt body motion and is suitable for overset grids.)