-
Articulatedvehicle6freedomlinearmodel
建立了铰接车六自由度线性模型，用于分析半挂汽车等铰接列车的动力学分析(Six degrees of freedom to establish a linear model articulated truck, trailer and automobile for the analysis of the dynamics of articulated trains)
- 2010-10-08 11:00:20下载
- 积分：1
-
compute-lyapunov
说明： 用matlab实现计算李雅普诺夫指数算法(Algorithm for computing Lyapunov exponents)
- 2011-02-16 20:56:19下载
- 积分：1
-
1
说明： 基于小波包变换的电力系统谐波分析,对于从事该方面的研究很有帮助(Based on wavelet packet transform power system harmonic analysis, engaged in the research helpful)
- 2012-11-29 12:14:54下载
- 积分：1
-
基于GMM的说话人识别
语音识别是近年来发展非常迅速的一项计算机智能技术，广泛应用在语音控制、身份识别等多个领域。本次项目主要研究语音识别的预处理过程和特征参数的提取环节。通过对原始语音信号进行预加重和分帧、加窗，滤除低频干扰，提升对语音识别有用的部分，消除了部分噪音和失真。预处理之后进行信号的特征提取，主要选取了短时平均过零率和MFCC两个特征参数，应用matlab软件绘制波形图并提取特征参数矩阵，为之后的语音信号的识别打下了基础。(Speech recognition is a computer intelligent technology which has developed rapidly in recent years. It is widely used in speech control, identity recognition and other fields. This project mainly studies the pretreatment of speech recognition and the extraction of feature parameters. Through pre-emphasis, framing and windowing of the original speech signal, the low frequency interference is filtered out, the useful part of speech recognition is enhanced, and some noise and distortion are eliminated. After pretreatment, feature extraction of signal is carried out. Two feature parameters, short-term average zero-crossing rate and MFCC, are selected. Waveform diagram is drawn by MATLAB software and feature parameter matrix is extracted, which lays a foundation for speech signal recognition.)
- 2019-04-06 10:53:48下载
- 积分：1
-
nccmp
比较两个netcdf文件
1。通过添加内部ind2sub1函数remove函数依赖第三方
2。格式化文本(Description NCCMP compares two netcdf files and prints the differences. This function is useful for testing mathematical forecasting or prediction models.
USAGE:
NCCMP(ncfile1,ncfile2)
NCCMP(ncfile1,ncfile2,tolerance,forceCompare)
INPUT:
ncfile1- name of the NetCDF file to compare
ncfile2- name of the NetCDF file to compare
tolerance- Compare numeric data using a tolerance threshold
forceCompare- if false, exit when first difference is found
true: continues to process all variables
EXAMPLES:
nccmp( old.nc , new.nc ,0.000001)
nccmp( old.nc , new.nc ,[],true)
FEATURES:
1. Print the differences and their locations
2. Exits when first difference is found or optionally continues to process all variables
3. User defined tolerance threshold to compare the variables
TO DO:
1. Specific variable inclusion or exclusion
2. Specific attribute inclusion or exclusion
3. Option to ignore the history attribute
4. Ignore difference between v)
- 2014-09-16 13:34:49下载
- 积分：1
-
ant-colony-algorithm-
使用网格离散化的方法对带有障碍物的环境建模，使用邻接矩阵存储该环境，使得问题转化为蚁群算法寻找最短路径。(Using a grid discretization method modeling environment with obstacles, the environment, the adjacency matrix storage problem into the ant colony algorithm to find the shortest path.)
- 2013-03-06 11:18:28下载
- 积分：1
-
hanshubijin
利用matlab对常用算法的函数逼近这一类型进行计算(Using matlab to the commonly used algorithms to calculate this type of function approximation)
- 2010-09-27 16:19:15下载
- 积分：1
-
image3
Matlab source code related to jpeg. which is useful for the developers .. compression and decompression ..
- 2009-04-30 20:00:49下载
- 积分：1
-
Shop-scheduling-genetic-algorithm
说明： 遗传算法车间调度,车间作业调度问题遗传算法
--------------------------------------------------------------------------
输入参数列表
M 遗传进化迭代次数
N 种群规模(取偶数)
Pm 变异概率
T m×n的矩阵，存储m个工件n个工序的加工时间
P 1×n的向量，n个工序中，每一个工序所具有的机床数目
输出参数列表
Zp 最优的Makespan值
Y1p 最优方案中，各工件各工序的开始时刻，可根据它绘出甘特图
Y2p 最优方案中，各工件各工序的结束时刻，可根据它绘出甘特图
Y3p 最优方案中，各工件各工序使用的机器编号
Xp 最优决策变量的值，决策变量是一个实数编码的m×n矩阵
LC1 收敛曲线1，各代最优个体适应值的记录
LC2 收敛曲线2，各代群体平均适应值的记录
最后，程序还将绘出三副图片：两条收敛曲线图和甘特图（各工件的调度时序图）(Genetic algorithm scheduling, job shop scheduling problems with genetic algorithms -------------------------------------------------------------------------- genetic evolution of the input parameter list, the number of iterations M N population size (taken even) Pm mutation probability T m × n matrix, stored m one piece n a process of processing time 1 × n vector, n a process in which each machine processes the number of Zp with the best value Y1p Optimal Makespan programs, the start time of each process the workpiece can be drawn based on its optimal solution Gantt Y2p, each time the workpiece end of the process, according to its draw Gantt Y3p optimal solution, each piece of the processes using machine code Xp optimal decision variable, decision variable is a real m × n matrix encoded LC1 convergence curve 1, the generation of the best individual record of LC2 fitness convergence curve 2, the average fitness value on behalf of groups record Finally, the program will draw three pict)
- 2021-01-27 13:58:35下载
- 积分：1
-
Reconaissance-voyelle
Pattern recognition of vowels
- 2013-01-19 23:38:12下载
- 积分：1
