ndn-cpp

各种优秀的毕业论文详细设计，内容广泛，很实用！(good papers)

gmsk的详细c语言编程过程，很适合初学者使用(the detailed c language gmsk programming process, it is suitable for beginners)

基于OPENGL的机械臂仿真模拟，描绘机械臂的动态效果(OPENGL-based simulation of the robot arm, described the dynamic effect of the robot arm)

说明：  基于WiFi的温湿度监测与显示，(1)主控芯片采用STM32系列单片机、数字温湿度度传感器DHT11、WiFi模块ATK-ESP8266； (2)通过数字温湿度度传感器DHT11采集数据； (3)将数据通过WiFi模块在电脑上进行显示。(Temperature and humidity acquisition)

用TMS320LF2407 实现空间矢量PWM（SVPWM）-with TMS320LF2407 space vector PWM (SVPWM)

Data Structures and Algorithms Using C#

它是在1978年由Merkel和Hellman提出的。它的主要思路是假定某人拥有大量物品，重量各不同。此人通过秘密地选择一部分物品并将它们放到背包中来加密消息。背包中的物品中重量是公开的，所有可能的物品也是公开的，但背包中的物品是保密的。附加一定的限制条件，给出重量，而要列出可能的物品，在计算上是不可实现的。背包问题是熟知的不可计算问题，背包体制以其加密，解密速度快而其人注目。但是，大多数一次背包体制均被破译了，因此现在很少有人使用它。 -It was in 1978, made by Merkel and Hellman. Its main idea is to assume that a person has a large number of items, weight, different. This person chose a secret portion of the goods by them into the backpack to encrypt the message. The weight of the items in the backpack was open, and all possible items that are open, but the backpack of the items are confidential. Additional restrictions on certain conditions, given the weight, but might want to list items in the calculation is not achieved. Knapsack problem is well-known non-computable problems, knapsack system, with its encryption and decryption speed and its a lot of attention. However, most systems were cracked a backpack, so now very few people use it.

设需要编码的字符集为{d1, d2, …, dn}，它们出现的频率为{w1, w2, …, wn}，应用哈夫曼树构造最短的不等长编码方案

基于c51的密码锁程序，可实现密码来按键解锁，重置密码 ，开锁 关锁等，基于C51单片机的程序，利用LCD显示当前密码的键入值，以及密码是否成功解锁或解锁失败。用继电器的闭合打开来作为锁开关。简单易学。共享之

说明：  旋转，利用双线性插值实现重采样，基于c++与opencv(Rotation, resampling by bilinear interpolation, based on C + + and opencv)