-
Di
说明: semestrovoe PowerSupplySystem of industry plant is model in matlab
- 2010-11-12 01:42:29下载
- 积分:1
-
ART1
this program writes for data classification using Adaptive Resonance Theory 1(ART1)Network
- 2013-10-10 18:49:54下载
- 积分:1
-
FFT
FFT sample matlab code
- 2013-12-11 14:21:57下载
- 积分:1
-
Optimal dispatching of microgrid Cplex
Matlab+YALMIP+CPLEX解决带储能的微电网优化调度问题,以微电网运行成本最小为目标函数,约束条件包含蓄电池SOC约束、交换功率约束、功率平衡等约束,本程序已在Matlab 2015b平台,yalmip version:20171121 CPLEX version:12.8教育版 验证成功(Matlab+YALMIP+CPLEX solves the optimization scheduling problem of microgrid with storage energy, taking the minimum operating cost of microgrid as the objective function. The constraints include the constraints of the battery SOC constraint, the switching power constraint, the power balance and so on. This program has been verified on the Matlab 2015b platform, yalmip version: 20171121 CPLEX version:12.8 Education edition.)
- 2021-03-11 15:49:26下载
- 积分:1
-
Bayesian-Vector-Autoregression-using-Bayesian-est
Bayesian Vector Autoregression using Bayesian estimation method
- 2015-02-16 10:02:18下载
- 积分:1
-
matlab
matlab 程序 实现序列 的求和 相乘 反折 移位(matlab program to achieve the sequence fold shift by multiplying the sum)
- 2009-12-04 16:40:01下载
- 积分:1
-
Solving-optimal-control-problems-with-MATLAB
a good book for optimal control in MATLAB tm
- 2015-01-12 07:36:21下载
- 积分:1
-
warp-kmeans
传统的kmeans聚类算法不能保证时间序列聚类结果的时序性;基于warp-kmeans聚类算法可以有效处理时间序列的聚类问题,而且复杂度低,迭代次数少。
,输出有目标函数在每次迭代后的值,聚类中心以及聚类区间。内有测试数据和相关文献,点击 test.m 可以完美运行(The traditional kmeans clustering algorithm can not guarantee the time series of the time series clustering results. The warp-kmeans clustering algorithm can effectively deal with the clustering problem of time series, and the complexity is low, and the number of iterations is less.
The output has the value of the target function after each iteration, the clustering center and the clustering interval. There are test data and related documents, click test.m can be perfect operation.)
- 2021-03-29 02:39:11下载
- 积分:1
-
CA
说明: CA算法可以将数量型属性划分成若干个优化的区间,它综合了分层聚类于划分聚类的优点,对于给定的不同的初始类个数,CA算法能随着迭代过程的不断进展改变类的数目,一些竞争力差的类即类的基数小于给定阙值的类将在迭代过程中不断消失,最终得到能够有效体现数据实际分布情况的优化聚类个数。(CA algorithm for quantitative attributes can be divided into a number of the interval optimization, hierarchical clustering which combines the advantages of clustering in the division, for a given number of different types of initial, CA algorithm as the iterative process the continuous progress of change in the number of categories, some categories of poor competitiveness of the base type that is less than the value of a given category Que iterative process will continue to disappear and eventually be able to effectively reflect the actual distribution of data to optimize the number of clustering.)
- 2009-05-17 11:02:13下载
- 积分:1
-
ex_kaiser
kaiser窗函数的用法,这是一个资料上的,经过验证了,希望帮得到你。(usage of the kaiser window function, which is an information, after the verification, and hope to help get you.)
- 2012-06-15 10:51:40下载
- 积分:1