-
daolibai
倒立摆的仿真程序，作为模糊神经网络的入门程序很不错。(Inverted pendulum simulink simulation program as a fuzzy neural network entry procedure very well)
- 2010-02-20 16:13:05下载
- 积分：1
-
chapter-4-programs
最优阵列处理一书第四章的matlab程序，适合阵列处理初学者(matlab program of the fourth chapter of the bookOptimal array processing , suitable for array processing for beginners)
- 2012-05-02 16:11:16下载
- 积分：1
-
Julian-day-toGregorian-calendar
本程序实现的功能是将儒略日转化为公历年月日(The implementation of the program function is to convert a Julian day to the Gregorian calendar (date) (month) (year)
)
- 2013-08-22 12:36:48下载
- 积分：1
-
approximation
RBF for Approximation in matlab with GUI
- 2013-01-29 17:47:54下载
- 积分：1
-
matlab_ti
initiation to matlab in french langage
- 2012-06-02 05:53:07下载
- 积分：1
-
svm
支持向量机的回归拟合——混凝土抗压强度预测,介绍SVM回归拟合的基本思想和原理，并以实例的形式阐述其在混凝土抗压强度预测中的应用。(Support vector machine regression- concrete compressive strength prediction, SVM regression introduce the basic ideas and principles, and examples in the form set forth in the concrete compressive strength prediction.)
- 2013-08-16 09:28:23下载
- 积分：1
-
Kalman-filtering1
一个基于matlab的卡曼滤波程序，有说明，调试完毕，可以使用(Based on the matlab program Kalman filtering, a description of commissioning is completed, you can use)
- 2013-04-02 14:35:12下载
- 积分：1
-
tp8
qu elle que exemple de traitement d image pour s exercer
- 2011-12-14 03:54:19下载
- 积分：1
-
STF
matlab强跟踪滤波器STF源程序，附带论文说明(the matlab strong tracking filter STF source, with the paper demonstrates
)
- 2012-03-11 11:22:44下载
- 积分：1
-
maxcost
“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。
(" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
- 2010-12-22 17:27:32下载
- 积分：1
