LBL-TDOA-distance measuring error simulation

求解雷诺方程，只是个参考，把这个弄明白了其他的形式都可以求解(Solving the Reynolds equation is just a reference. It can be solved by solving other forms.)

非图形版的小巧玲珑的Hangman! 不一样的感觉！(non-graphic version of the small size of Hangman! Not the same feeling!)

在UCOSII里面创建3个任务：开始任务、LED0任务和LED1任务，开始任务用于创建其他（LED0和LED1）任务，之后挂起；LED0任务用于控制DS0的亮灭，DS0每秒钟亮80ms；LED1任务用于控制DS1的亮灭，DS1亮300ms，灭300ms，依次循环。(Create three tasks in UCOSII: start task, LED 0 task and LED 1 task, start task to create other tasks (LED 0 and LED 1), then hang up; LED 0 task to control the brightness of DS0, DS0 80 ms per second; LED 1 task to control the brightness of DS1, DS1 300 ms, 300 ms, in turn, cycle.)

解决三维装箱问题的一种自适应遗传算法//(Solve the problem of 3D packing)

说明：  基于51单片机的pwm音乐播放器，只有pwm播放和按键功能(PWM music player based on 51 single chip computer, only PWM play and key function)

UrbanChallenge，Cornell队技术报告，2007年-UrbanChallenge, Cornell team technical reports, 2007

有关于D2D通信中，信道仿真的编程是基于python语言的。(Programming for channel emulation in D2D communication)

18 Wheels game sources. Operational system: DOS. Compiles OK in Quickbasic.

python实现camshift的人物追踪(track to achieve camshift characters python)

本书示例丰富,图文并茂,以简明易懂的方式阐释了算法,旨在帮助程序员在日常项目中更好地利用 算法为软件开发助力。前三章介绍算法基础,包括二分查找、大 O 表示法、两种基本的数据结构以及递归 等。余下的篇幅将主要介绍应用广泛的算法,具体内容包括 :面对具体问题时的解决技巧,比如何时采用 贪婪算法或动态规划 ;散列表的应用 ;图算法 ;K 最近邻算法。 本书适合所有程序员、计算机专业相关师生以及对算法感兴趣的读者(This book is rich in examples and illustrates algorithms in a concise and easy-to-understand way. It aims to help programmers make better use of algorithms in daily projects to help software development. The first three chapters introduce the basic algorithms, including binary search, large O representation, two basic data structures and recursion. The rest of the paper will focus on the widely used algorithms, including: when to use greedy algorithm or dynamic programming, hash table application, graph algorithm, K nearest neighbor algorithm when facing specific problems. This book is suitable for all programmers, computer-related teachers and students, and readers interested in algorithms.)