Python安装与基础

说明：  循环神经网络LSTM可以预测时间序列数据，根据历史时刻的信息预测未来时刻的信息(the recurrent neural network is very useful to predict data in the future)

说明：  该Simulink仿真模型基于锂电池的二阶RC模型，采用扩展卡尔曼滤波算法实现锂电池的SOC估计。(The Simulink simulation model is based on the second-order RC model of lithium batteries, and the extended Kalman filter algorithm is used to estimate the SOC of lithium batteries.)

TMS F2812SDSP281x_Spi头文件-TMS F2812SDSP281x_Spi header files

adc dma 定时器触发dac可以生成人任意波形(adc DMA TIMER CHUFASHIYONGSHUOMING)

利用谐波叠加法编写的matlab脉动风载荷程序，可以模拟高层建筑风载荷(The MATLAB pulsating wind load program written by the harmonic superposition method can simulate the wind load of the high-rise building.)

说明：  全搜索算法重构图。像顾名思义，穷尽法就是对搜索范围内的每个位置都进行计算并比较，从原图像块中找到与待匹配块最相似（误差最小）位置的方法。对于一个搜索范围为[-7,7]的区域来说，x，y两个方向全部搜索一遍需要进行 15X15 = 225 次计算。穷尽法的缺点很明显就是计算量太大，速度很慢，另一方面，由于全部范围都进行了计算，其匹配精度是最高的。(Reconstruction graph of full search algorithm. As the name implies, the exhaustive method is to calculate and compare each position within the search range, and find the most similar (least error) position with the block to be matched from the original image block. For an area with a search range of [- 7,7], 15x15 = 225 calculations are required for searching both directions X and Y once. The disadvantage of exhaustive method is that the calculation is too large and the speed is very slow. On the other hand, the matching accuracy is the highest because all the ranges are calculated.)

掌握内存管理的页面淘汰算法 输入可用内存页面数和一个作业访问逻辑页号的序列，分别给存FIFO、LRU算法的缺页中断率（注：算法原理实现，不要求实际页面）。-master memory management algorithm pages out of the importation of a few pages available memory and a logic operation visit pages of the sequence, kept FIFO, the LRU algorithm missing pages interrupt rate (Note : The principles of achieving algorithm that does not require the actual pages).

自做的时钟原码，看看吧-done clock since the original code, let"s see it

算法程序分Nelder0.m和Opt-Nelder.m其中子程序Nelder0.m用于二维空间上的多边形最优化逼近.对于大于2维的情形,可以通过若干次二维迭代计算求出最优值.Opt-Nelder.m可求解若干维变量的最优化问题(The algorithm of Nelder0.m procedure and Opt-Nelder.m which is used for subroutine Nelder0.m approximation polygon optimization of two-dimensional space. For more than 2 dimensional case, through several two-dimensional iterative calculation to derive the optimal value of.Opt-Nelder.m optimization problem solving some dimension)

说明：  FreeRTOS列表项的插入和删除实验(FreeRTOS Experiments on Insertion and Deletion of List Items)