-
PF
说明: 此程序是计算电力系统潮流的通解,通过支路法不断更新参数(This procedure is the general solution of the power flow calculation, continuously updated through the branch method parameters)
- 2013-12-09 15:15:05下载
- 积分:1
-
matlabstudy
MATLAB学习资料,感兴趣的朋友可以下载(err)
- 2007-12-28 22:37:54下载
- 积分:1
-
imlook3dv12
work with 3d imagen on matlab
- 2010-11-16 12:51:05下载
- 积分:1
-
一个RBF神经网络的算法实现程序
一个RBF神经网络的算法实现程序,可用于实现RBF神经网络的函数逼近(A RBF neural network algorithm procedures, can be used to realize the function of the RBF neural network approximation)
- 2014-09-04 09:04:03下载
- 积分:1
-
PriorityQueue.tar
Priority Queue Data Struct
- 2014-11-09 02:17:13下载
- 积分: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
-
conjugate_gradient
说明: 共轭梯度法是介于最速下降法与牛顿法之间的一个方法,它仅需利用一阶导数信息,但克服了最速下降法收敛慢的缺点(Conjugate gradient method is between the steepest descent method and Newton method between a method that only use the first derivative information, but the steepest descent method to overcome the disadvantage of slow convergence)
- 2011-04-04 10:33:55下载
- 积分:1
-
src
虚拟声实现:对给定音源(.WAV)使用头相关函数进行变换,改变其距离及角度,含有静态及动态两种模式。(Virtual Sound generation, static and motion.)
- 2020-07-11 10:48:54下载
- 积分:1
-
kalman
本资料包含kalman滤波算法的基本原理,应用场合以及仿真效果(This information includes the basic principles kalman filtering algorithms, applications, and simulation results)
- 2011-11-18 15:29:05下载
- 积分:1
-
M
字典树的基本功能是用来查询某个单词(前缀)在所有单词中出现次数的一种数据结构,它的插入和查询复杂度都为O(len),Len为单词(前缀)长度,但是它的空间复杂度却非常高,如果字符集是26个字母,那每个节点的度就有26个,典型的以空间换时间结构。(The basic function of the dictionary tree data structure is used to query a number of times a word (prefix) appears in all the words, which insertion and query complexity are O (len), Len is a word (prefix) length, but its space complexity is very high, if the character set is 26 letters, and that the degree of each node will have 26, the typical structure of space for time.)
- 2013-11-29 14:28:52下载
- 积分:1