-
vcniniudun
用于c++计算拟牛顿法的实验,请参考，多谢请多指教(For c++ calculation of the experimental quasi-Newton method, please refer to, please advise Thank you)
- 2009-05-14 12:57:08下载
- 积分：1
-
fuzzysketch
Fuzzy Extractor Sketch
- 2014-01-08 05:18:00下载
- 积分：1
-
Prayer_Times
Prayer Times Calculator
Calculates Musilm Prayers Times and Sunrise for any location on the earth
- 2015-03-28 21:13:46下载
- 积分：1
-
mex
Mex库，支持Matlab中调用C++代码，实现综合运用(Matlab and Mex)
- 2012-05-20 13:14:23下载
- 积分：1
-
shuzixhcl
数字信号处理及其matlab实现，，希望对大家有帮助，谢谢，()
- 2008-04-04 18:13:28下载
- 积分：1
-
iu6djgtjer5y
X射线头影图象的自适应卡尔曼滤波方法研究_徐常胜.zip(Cephalometric X-ray image of the adaptive Kalman filtering method _ Xu Changsheng. Zip)
- 2013-08-08 20:13:57下载
- 积分：1
-
The_C_Programming_Language
C PROGRAMMING LANGUAGE(A BOOK OF C PROGRAMMING LANGUAGE)
- 2014-12-03 20:39:48下载
- 积分：1
-
Recursive_integer_division
递归法求解整数划分。
整数划分，是指把一个正整数n写成如下形式：
n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。
如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
- 2014-02-06 14:21:38下载
- 积分：1
-
tiaojian
编码是在MATLAB下编写的，可以在MATLAB上直接运行，我没有在分类中找到MATLAB，所以选择了c++，希望管理员能分下类。这款编码是计算水准测量中计算条件平差的。(The code is written in MATLAB, you can run directly in MATLAB, MATLAB, I did not find in the classification so chose c++, I hope that the administrators in the next class. This code is calculated in the calculation leveling adjustment of condition equations.)
- 2012-05-29 09:14:21下载
- 积分：1
-
moxingising
对ising模型的模拟，这是二维的情况，对于学物理的人很重要的。(Ising model for the simulation, which is two-dimensional case, for physics, it is very important.)
- 2013-12-28 17:33:42下载
- 积分：1
