资源列表
ARMA
- matlab代码关于ＡＲＭＡ时间序列模型-matlab code for ARMA time series model
p
- 求二极法低阻球体上视电阻率值的程序，参见傅良魁的1983年版的二极法公式。在本书38页上-Diode method for low resistance ball on the apparent resistivity value of the procedure, see the 1983 FU Liang-kui diode version of the formula. 38 in this book on
chufa
- 化简分数到最简 目前只支持质数小于10000的情况-Simplification of scores to the most Jane prime number currently only supports the case of less than 10000
jm
- 口令加密器可以把口令进行加密处理!密码存诸更加安全-Password encryption can encrypt the password to deal with! Keep all passwords more secure
lcd
- LCD12864带字库的程序，有注释，还有一些注意事项-Font LCD12864 with the procedure, there are notes, some attention
fourStep
- This code is the implementation of 4 step EBMA in motion compensation.
calc
- 这个是培训用的简单计算器的程序，简单但是绝对会给你带来收获，从简单入手让你体会 编程的乐趣。- This is the program from testing, although it is simple,but you can study more by using it.
stacks-and-queues-in-CPP
- implementation of stacks and queues of structure student in C-implementation of stacks and queues of structure student in C++
shishishiz
- 新手学习资料51单片机实时时钟.hex-The novice learning materials 51 single-chip real-time clock. Hex
1515
- 求 最大公倍数 输入两个数 求他们的最大公倍数-The biggest common multiple input seeking their greatest common multiple of two numbers
JoseQuestion
- 约瑟夫环问题求解 约瑟夫环问题的具体描述是：设有编号为1，2，……，n的n(n>0)个人围成一个圈，从第1个人开始报数，报到m时停止报数，报m的人出圈，再从他的下一个人起重新报数，报到m时停止报数，报m的出圈，……，如此下去，直到所有人全部出圈为止。当任意给定n和m后，设计算法求n个人出圈的次序。-Josephus Josephus problem solving specific descr iption is: has numbered 1, 2, ...... n n (n