ellipse

说明：  《thinking_in_cpp》，计算机大师Bruce Eckel的著作，学习C++的顶级材料(&quot Thinking_in_cpp&quot , Master Bruce Eckel computer books, learning C++ of the top material)

一个关于十六进制数组动态创建的方法，对使用者在编写通信帧的时候很有用(An array of dynamically created on hexadecimal method, the users in the preparation of the communication frame is useful when)

粒子群算法在三维空间机器人路径规划中的应用(PSO at three-dimensional space robot path planning)

输入骰子个数和投掷的次数，程序将计算出一次投掷的点数和的概率分布(Enter the number of dice and throwing the number, the program will calculate the time throwing the probability distribution of points and)

Ackeman函数的递归方法，运用简洁的递归思想实验复杂数学表达式的计算(Ackeman function recursive method, the use of simple recursive thought experiment to calculate complex mathematical expressions)

说明：  示例软件包括:公共库、外围api和测试模块 的api。公共库包括启动文件、标准定义和 头文件，特定处理器设置模块，通用中断相关api， 计时器程序。外围目录包括:ADC, DAC, DMA, GPIO, PWM， 实时时钟，定时器，SPI, I2C，看门狗定时器，UART，外部 中断，CAN，以太网，USB HID等。 开发环境是Keil(The Example software includes, common library, peripheral APIs, and test modules for the APIs. The common library include startup file, standard definition and header files, processor specific setup module, generic interrupt related APIs, timer routine. The peripheral directories include, ADC, DAC, DMA, GPIO, PWM, Real-time clock, timer, SPI, I2C, Watchdog timer, UART, external interrupt, CAN, Ethernet, USB HID,etc. The development environment is Keil)

基于c++和|openGL三维动态库建立的三维可视化场景。(Based on c++, and | openGL libraries establishment of three-dimensional dynamic three-dimensional visualization of the scene.)

说明：  一个基于OpenGL和C++的轻型图形库(One based on OpenGL and C++ graphics library light)

ADC0832模数转换与LCD-LED显示，带Protues仿真，keil工程(ADC0832 analog to digital converter and the LCD-LED display, the band Protues simulation, c51 engineering)

本程序用两种算法对五个进程进行调度，每个进程可有三个状态，并假设初始状态为就绪状态。初始优先数60。为了便于处理，程序中的运行时间以时间片为单位计算，各进程的优先数或轮转时间数以及进程需要运行的时间片数的初值均由用户给定。3） 在优先数算法中，进程每执行一次，优先数减3，CPU时间片数加1，进程还需要的时间片数减1，在轮转算法中，采用固定时间片，时间片数为2，进程每执行1次，CPU时间片数加2，进程还需要的时间数减2，并排列到就绪队列的尾上。(This procedure using two algorithms for five scheduling process, each process can have three states, and assuming that the initial state to the ready state. The initial priority number 60. To facilitate processing, the program runs in time for the unit time slices, each time slice process priority number or rotation time and the number of processes that need to run the initial value by the number given by the user. 3) the priority number algorithm, the process Each time, priority number minus 3, CPU time slices plus one, the process needs time slices minus one, in the Round Robin, the fixed time slice, the time slice number 2 , each process is d once, CPU time slices plus 2, the process needs time minus 2, and arranged into the tail of the ready queue.)