-
DDE_tutorial
解决中立性微分方程的Matlab程序. 中立性微分方程即微分带时延的。(Matlab program to solve the differential equations of neutral. Use matlab to simulate.)
- 2013-12-14 10:16:47下载
- 积分：1
-
Proyecto1
Makes an histogram based on numbers written in a file.
- 2010-09-10 12:20:10下载
- 积分：1
-
PWM-dianji
基于PWM的直流电机的闭环调速控制系统设计(PWM based closed loop DC motor speed control system design)
- 2012-04-14 15:15:24下载
- 积分：1
-
hundunziliao
用龙格库塔法求得微分方程的数值解；用龙格库塔法求得微分方程的数值解(Obtained by using Runge-Kutta numerical solution of differential equations obtained by using Runge-Kutta numerical solution of differential equations)
- 2011-08-29 21:15:43下载
- 积分：1
-
K-NN
calssification algorithm66
- 2014-11-26 22:43:36下载
- 积分：1
-
12
案例为利用最有控制原理，实现对机械手转台的最优控制。运用matlab，以及simulink仿真实现。(Case for the use of the most control theory, to achieve optimal control of robotic turntable. Use matlab, simulink simulation, and implementation.)
- 2013-09-29 17:13:16下载
- 积分：1
-
mfcc
说明： 基于人耳识别听觉系统基础的梅尔频谱倒谱系数（MFCC），本次设计采用经过小波包阈值降噪处理的音频文件，提取出其相应的MFCC特征矩阵，以便做接下来的分析！(Based on the Mel spectrum cepstrum coefficient (MFCC) of human ear recognition and hearing system, this design uses the audio file processed by wavelet packet threshold denoising, and extracts its corresponding MFCC feature matrix for the next analysis!)
- 2020-12-23 16:08:48下载
- 积分：1
-
dipum_toolbox_pcode
matlab图像处理工具箱，是冈萨雷斯编著的DIPUm的辅助工具(Matlab Image Processing Toolbox is edited by Gonzalez DIPUm aids)
- 2007-07-10 09:37:37下载
- 积分：1
-
Neural-Networks-road-traffic
BP神经网络公路运量预测
实例讲述如何在matlab中使用BP神经网络(BP neural network prediction road traffic)
- 2013-08-21 17:11:17下载
- 积分：1
-
分支定界法
说明： 分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。
对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1]
通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems.
For integer programming problems with two variables, the grid method is sometimes simpler[ 1]
Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
- 2021-04-26 12:21:14下载
- 积分：1
