-
nelder-mead
nelder_mead优化算法，求多维函数极值的一种算法，不利用任何求导。利用多面体逼近。(nelder_mead optimization algorithm, and a multi-dimensional function extremum algorithm, do not use any derivation. The use of polyhedral approximation.)
- 2009-03-31 18:39:13下载
- 积分：1
-
matlab拓扑优化STL模型
拓扑优化
一种开源框架，适用于增材制造和基于水平集的拓扑优化(Topology Optimization)
- 2020-07-04 04:40:01下载
- 积分：1
-
D3DXMatrixRotationAxis_analysis
D3DXMatrixRotationAxis 数学原理解析
Axis To Axis 的矩阵生成
介绍广告版的复杂搭建 原理
附录 Matlab 和 C++ 代码
(D3DXMatrixRotationAxis mathematical theory of matrix analysis Axis To Axis generate complex structures introduced principles of billboards Appendix Matlab and C++ code)
- 2010-05-23 15:38:38下载
- 积分：1
-
1
说明： matlab基础教程,叫你怎么样使用MATLAB，对MATLAB有所了解(it s the use of MATLAB,help you unstand matlab)
- 2010-05-29 10:39:50下载
- 积分：1
-
filter_gaussian
很有用的源代码，实现的效果很好，很值得收藏，不错平(Useful source code, to achieve good results, it is worth collecting, good level)
- 2010-11-26 21:43:59下载
- 积分：1
-
Ex-07
MATLAB小程序:关于MATLAB中字符串的操作的程序(small MATLAB : MATLAB string on the operating procedures)
- 2007-01-25 09:47:51下载
- 积分：1
-
liufun
有小波分析的盲信号处理，包含优化类的几个简单示例程序，相控阵天线的方向图（切比雪夫加权）。( There Wavelet Analysis Blind Signal Processing, Optimization class contains several simple sample programs, Phased array antenna pattern (Chebyshev weights).)
- 2016-09-22 17:41:45下载
- 积分：1
-
Fuzzy
模糊控制课程作业，针对给定的系统（传递函数）搭建了Simulink平台，对比了模糊控制与PID控制的效果，可通过选取不同的模糊逻辑规则与参数调节仿真结果。(In the course assignment of fuzzy control, a Simulink platform is built for a given system (transfer function). The effects of fuzzy control and PID control are compared. The simulation results can be adjusted by choosing different fuzzy logic rules and parameters.)
- 2018-12-03 17:29:36下载
- 积分：1
-
CDMA_PN_MUD
基于PN扩展序列的CDMA多用户检测三种算法仿真：CDMA multiuser detection algorithms based on PN sequencce
- 2021-04-04 12:29:04下载
- 积分：1
-
Centrality-measures
文件包括：1.计算平均最短路径；2.计算每个顶点相邻节点的平均度；3.计算每个节点的邻近中心度；4.计算节点的介数（slow）；5.计算节点的介数（faster）；6.计算每条边的介数值；7.快速迪杰斯特拉算法；8.经典迪杰斯特拉算法。(1.the average shortest path in the graph 2.the average degree of neighboring nodes for every vertex 3.computes the closeness centrality for all vertices 4.node betweenness, (number of shortest paths definition) 5.a faster node betweenness algorithm 6.edge betweenness, (number of shortest paths definition) 7.simple Dijkstra, does not remember the path 8.Dijkstra which also returns the shortest paths.)
- 2021-04-23 19:38:47下载
- 积分：1
