通过添加该脚本可以很方便的改变特效或动画发生时间，便于制作工程中效果的确认，而无需打开粒子逐个更改时间

延迟相乘算法计算载波同步的matlab代码，希望可以给大家帮助

DHT22_AM2302_STM32F103驱动，保证可用，程序完整，内含精准delay

Allegro 软件Pin Delay 导入导出及校验方法介绍

使用GGOS对流层产品解决对流层延迟的C项目 该项目原始路径为：E：\ Thesis \ RTKLIB_Workspace \ WorkSpace \ For_Thesis \ For_Thesis项目名称为For_Thesis（即= $ ============程序主要功能==============本程序的主要功能是基于GGOS对流层产品进行对流层延迟解算，并使用rtklib开源项目的二次开发及改进。是方便其他使用rtklib开源项目的GNSS研究者，提高其科研效率。基于rtklib2.4.3 b33版本进行二次开发，采用C语言编写，并在Win10，Visual Studio 2017平台上完成开发及调试，项目路径为：E：\ Thesis \ RTKLIB_Workspace \ WorkSpace \ For_Thesis \ For_Thesis分数于原项目，主要目标点为：1.增加

switch_delay_interrupt.c

tm4c123x入门LED switch_delay代码

时滞系统稳定性必备书That every problem in NP can be polynomially reduced to an NP-hard problem suggests a proof for NP-hardness. It follows that if a problem ℘1 is NP-hard and polynomially reducible to some problem ℘2, then ℘2 must also be NP-hard. In other words, if one is to prove that ℘2 is NP- hard, one may attempt to reduce polynomially a known NP-hard problem ℘1 to ℘2. In particular, it suffices to polynomially reduce ℘1 to just one instance of ℘2, since that particular instance of ℘2 is as difficult as any instance of ℘1, and therefore in the worst case, ℘2 must be as difficult as ℘1. A vast number of NP-hard and NP-complete problems have been discovered in this manner, among them notably are such classical problems as the satisÞability problem and the traveling salesman problem. The same strategy is adopted in our proof of the NP-hardness of the stability problem

STM32F103ZET6的毫秒和微妙的实现（参考多个大牛的程序，上传只为记录）

基于STM32的DHT22温湿度采集，附件程序文件，也适用于DHT11、DHT21模块