pantompkins code

可实现智能家居基本控制，灯、热水器、语音识别(It can realize basic control of smart home, lamp, water heater and speech recognition.)

说明：  这是一个Python编写的多孔介质代码，代码标记为英语，希望能够对学习的人有所帮助。(This is a porous media code written by python. The code is marked in English. I hope it can be helpful to the learners.)

说明：  前端加载视频，是一种很麻烦的事情，不管怎么查找都是一些无用的带吗，这里提供有用的代码参考。(Front-end loading video, is a very troublesome thing, anyway, search is some useless tape, here provides useful code reference.)

对直扩信号采用倒谱法进行功率谱分析，检测高端周期脉冲谱线(Cepstrum signal power spectrum analysis using cepstrum method, detection of high-end periodic pulse line)

说明：  实现一个模仿CAD画图的简单程序，直线，椭圆，矩形等(Implement a simple program to imitate CAD drawing, such as line, ellipse, rectangle, etc.)

简易ＢＭＩ转换日记纪录，可储存日记心得 纪录每日体重是减肥基础，帮助您快速纪录ＢＭＩ之余 也能记录每日心得

说明：  图着色局部搜索,图着色问题（Graph Coloring Problem, GCP） 又称着色问题，是最著名的NP-完全问题之一。道路着色问题（Road Coloring Problem）是图论中最著名的猜想之一。 数学定义：给定一个无向图G=（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。(Graph Coloring Problem (Graph Coloring Problem, GCP), also known as coloring problem, is one of the most famous NP-complete problems. The Road Coloring Problem is one of the most famous conjectures in graph theory. Mathematical definition: Given an undirected graph G=(V, E), where V is the set of vertices and E is the set of edges, the graph coloring problem is to divide V into K color groups, and each group forms an independent set. That is, there are no adjacent vertices. The optimized version is to get the smallest K value.)

说明：  stm32使用ra02模块的例程,点对点通讯(Stm32 USES ra02 module routines to communicate point-to-point)

说明：  连续波信号的模糊函数MATLAB代码，可直接运行。(The Fuzzy Function MATLAB code of CW signal can run directly.)

keil4 mdk 安装包，学习stm32的必备工具，非常好用，编程的好帮手(Keil4 MDK installation package, learning STM32 necessary tools, very easy to use, programming a good helper)