-
choicephase
故障突变量计算
12point滤序,需改为根据N自动确定滤序公式
设置故障突变量单相定值
设置故障突变量相间定值
设置故障突变量负序零序电流定值( Fault calculation 12point mutations order filter is required to determine the filter order based on the formula N automatically set the amount of single-phase fault mutation set fault value value mutation set the amount of white mutant the amount of negative sequence fault zero sequence current value)
- 2011-01-26 19:50:57下载
- 积分：1
-
RungeKutta_4
说明： 以lorenz吸引子为例说明四阶定步长Runge-Kutta算法 详情见程序说明(to attract son as an example to illustrate four bands will step Runge- Kutta algorithm detailed description of the procedures)
- 2006-04-10 12:20:56下载
- 积分：1
-
fftdemo
This example shows the use of the FFT function for spectral analysis. A common use of FFT s is to find the frequency components of a signal buried in a noisy time domain signal.
- 2010-06-01 04:02:25下载
- 积分：1
-
xmlphone.pdf
- Platform : Alcatel Lucent OmniPCX Enterprise
Alcatel Lucent OmniPCX Office
- Interface : XMLPhone Web Service
- Version : R5.1
- Revision : Edition 5.1.0 – August 2008
- Licenses : My Phone
- Abstract : This guide addresses application developers who want to learn
how to design an application which can control a phone set.
- 2014-11-07 14:57:22下载
- 积分：1
-
PMSM1
This is my simulation of PMSM. Hope you can edit and use it to your exercise. It is not actually correct but I think it will be useful for you.
- 2013-11-07 23:02:30下载
- 积分：1
-
defcon-16-pilosov-kapela
The 16th famous Defcon conference paper
- 2013-05-13 11:01:37下载
- 积分：1
-
mfcc
完整的MFCC程序，利用MATLAB编写，可直接使用移植使用(Complete MFCC procedure, the use of MATLAB can be used directly transplanted to use)
- 2012-04-11 17:45:08下载
- 积分：1
-
mls拟合
说明： 移动最小二乘的MATLAB程序 用于简单的散点曲线拟合(MATLAB Program of Moving Least Squares for Simple Spot Curve Fitting)
- 2019-04-02 11:59:03下载
- 积分：1
-
toolbox
说明： 这是自己编写的MATLAB的基于神经网络和遗传算法的翼型优化程序。有需要的可以下载，完全是自己编写的。 (matlab wing optimization)
- 2021-04-13 16:48:56下载
- 积分：1
-
TSP
旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)
- 2015-01-18 21:43:12下载
- 积分：1
