Example

VL53L0X英文原版操作手册，便于有一定编程基础的用户使用(VL53L0X English Original Manual)

TCP通信示例程序，很好用的网络通信例程(TCP communication sample program, the good network communication routines)

采用了射频识别的原理，在STM32编程的基础上，识别ID号(The principle of radio frequency identification is used to identify ID number on the basis of STM32 programming.)

说明：  基于vc6环境下开发，实现了打开文件操作，利用了fltk图形开发包(based vc6 environment in development and operation of open files using a graphical development kit fltk)

说明：  PMSM电机 双闭环例程 eg2开头命名； eg2集成了开环、有感（带编码器）双闭环、无感双闭环(The double closed-loop routine of PMSM motor is named at the beginning of eg2; eg2 integrates open-loop, inductive (with encoder) double closed-loop and non-inductive double closed-loop.)

用vc实现邮件传输功能，主要采用winsock实现传输过程。有利于熟悉网络编程。(achieved using vc mail functionality, mainly winsock achieve transfer process. Help familiar with network programming.)

1)随机输入平面上n个点的集合； 2)使用分治策略编制计算机程序求出这n个点的极大点。 3)编程实现2维极大点问题的求解，且在程序中体现分治策略。程序能处理任意的n个点。 (1) a collection of n points on a random input plane 2) using divide and conquer strategy computer program to calculate the maximum point of the n point. 3) programming for solving 2 dimensional maximal point problem, and reflect the divide and conquer strategy in the program. Program can handle arbitrary n points.)

C#+SQL Server 中小型信息系统开发实例精选中有五个实例： 学生信息管理系统 仓库管理系统 企业人事管理系统 超市管理系统 客户管理系统 这些系统都比较经典，希望对大家尤其在做实习的朋友有帮助！(There are five examples in C#+SQL Server, small and medium sized information systems development instance selection: Student Information Management System Warehouse Management System Personnel Management System supermarket management system customer management system, these systems are more classic, I hope everyone, especially to do internship friends help!)

说明：  通过51单片机的IO端口控制LED灯流星雨显示程序!(Through the IO port of 51 MCU to control the LED meteor shower display program!)

设p是素数，a是p的本原根，即a1,a2,a3,…,ap-1在mod p下产生1到p-1的所有值，所以对任何b属于{1,…,p-1},有唯一的i属于{1,…,p-1}使得ai mod p 等于p。称i为模p下以a为底b的离散对数。(P is a prime number based, a is the primitive root p, that is, a1, a2, a3, ..., ap-1 in the mod p under 1 to p-1 for all values, so for any b belongs to (1, ..., p-1), there are only i belong to (1, ..., p-1) makes ai mod p equivalent to p. Said i was under the modulus p to a for b at the end of the discrete logarithm.)