-
bitplane
CONVERT THE IMAGE INTO BITPLANES FOR EXTRACTING USREFUL INFORMATION
- 2010-05-30 19:36:39下载
- 积分：1
-
Circuit-Analysis-with-MATLAB
用matlab做电路分析。介绍了matlab分析静态电路、动态电路、无源器、有源器件的方法，有众多例程。一共两本，上下册(Circuit analysis using matlab to do. Describes the methods matlab static circuit analysis, dynamic circuits, passive, active devices, there are many routines. A total of two, upper and lower volumes)
- 2014-08-12 22:02:51下载
- 积分：1
-
simdiscr
make descrite selection from a set of values with different probabilities and produce a sample array
- 2012-01-27 04:17:57下载
- 积分：1
-
fuzzy control
说明： 模糊自整定PID matlab程序(fuzzy PID control)
- 2019-04-26 15:39:50下载
- 积分：1
-
IFP_FCM
简介：IFP_FCM,改进型FCM(模糊C均值)聚类算法,由Frank Hoppner与Frank Klawonn于2003年提出,解决了FCM算法对初始值设定较为敏感、训练速度慢、在迭代时容易陷入局部极小的问题。并附带了Box和Jenkins煤气炉数据模型辨识实例。
文件清单：
IFP_FCM算法原始论文：
Improved fuzzy partitions for fuzzy regression models.pdf
程序清单：
IFP_FCM.m - IFP_FCM算法主函数
initifp_fcm.m - initifp_fcm子函数
stepifp_fcm.m - stepifp_fcm子函数
distifp_fcm.m - distifp_fcm子函数
IFP_FCM_T_S_box_test.m - IFP_FCM测试实例：Box和Jenkins煤气炉数据T-S模糊模型辨识
数据文件：
box_data.mat - Box和Jenkins煤气炉数据(IFP_FCM, modified FCM (Fuzzy C-Means) clustering algorithm, in 2003, proposed by Frank Hoppner and Frank Klawonn, FCM algorithm to solve the initial value setting is more sensitive, slow training, while iterating easy to fall into local minimum problem. And comes with Box and Jenkins gas furnace model identification data instance.)
- 2021-04-24 20:18:47下载
- 积分：1
-
基于粒子滤波进行电机的参数估计
说明： 探究粒子群算法对电机的估计，具有重要意义。(It is important to explore the estimation of the motor by particle swarm.)
- 2020-06-18 22:00:01下载
- 积分：1
-
fxlms_with_sine_input
FXLMS algorithm with sign wave as a input matlab program adaptive algo.
- 2013-04-26 19:20:33下载
- 积分：1
-
Privvy
NoConnectionPendingException extends IllegalStateException.
- 2014-02-19 12:05:22下载
- 积分：1
-
image-overview
In the previous chapters we have encountered a number of ways to process digital
images, to recognize objects therein and to
- 2014-11-14 08:43:23下载
- 积分：1
-
ppt
After identifying the best MNT− 1 nodes with the simplified branch metric and the accumulated branch metric at stage NT − 1, we then calculate the LLR of each coded bit utilizing the standard squared Euclidian distance metric.
The log-likelihood ratio (LLR) of a posteriori probability (APP) of each coded bit conditioned on the received signal y is normally calculated using the max-log approximation.
- 2013-11-26 13:25:03下载
- 积分：1
