-
matpower4.1
基于MATLAB的电力系统分析工具箱Matpower 4.1版本(MATLAB based Power system analysis toolbox--- Matpower version:4.1)
- 2012-01-19 23:31:35下载
- 积分：1
-
IEEE-802.11
给出SISO信道的室内模型，IEEE802.11传播过程、机制，matlab实现代码及仿真(802.11 MODEL)
- 2015-10-28 11:48:57下载
- 积分：1
-
psobp
matlab粒子群神经网络的预测编程实现，电力负荷预测已实现(Matlab particle group neural network prediction programming implementation, power load forecasting has been achieved)
- 2017-04-27 18:35:55下载
- 积分：1
-
mfcc
mfcc.m matlab frquency an d formant method
- 2011-01-07 22:24:24下载
- 积分：1
-
Reviux
RAKE接收机直接序列扩频系统
一个简单的Simulink的直接序列扩频频谱与RAKE接收系统模型。
(For DS- SS systems RAKE receiver RAKE receiver direct sequence spread spectrum system with a simple Simulink spectrum and direct sequence spread spectrum RAKE receiver model.)
- 2011-01-09 16:52:37下载
- 积分：1
-
newton
用牛顿迭代法解非线性方程组的源程序，在MATLAB中可用(Newton iteration method for nonlinear equations of the source, available in MATLAB)
- 2010-07-10 18:59:49下载
- 积分：1
-
ngx-markdown-module
Nginx Markdown module
一个nginx模块，可以将网页中的markdown语法自动转义为html,无需引入其他支持库，执行效率高。
使用--add-module编译Tengine可用dso_install动态加载。
设置实例(http块)
location ~ /*.md {
mdfilter on
mdfilter_utf8 on
}
// Use Handler module
location ~ /*.mkd {
mdhandler
mdhandler_output html
}(Nginx Markdown module a nginx module can be a Web page markdown syntax is automatically escaped as html, without introducing additional support libraries, and high efficiency. Use- add-module compiled Tengine available dso_install dynamic loading. Set the instance (http block) location ~ /* md {mdfilter on mdfilter_utf8 on }.// Use Handler module location ~ /* mkd {mdhandler mdhandler_output html }.)
- 2014-02-06 11:50:09下载
- 积分：1
-
lagrange
说明： lagrange插值
快捷计算插值，挺好的.(lagrange interpolation quick calculation of interpolation, quite good.)
- 2008-11-19 10:55:26下载
- 积分：1
-
gradient_gui
gradient demo file for comparison
- 2009-11-20 00:56:13下载
- 积分：1
-
cebk_tsp
用离散数学或图论的术语来说，假设有一个图g=(v,e)，其中v是顶点集，e是边集，设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵，旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。
(Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)
- 2011-05-22 08:12:37下载
- 积分：1
