-
zuoye
此程序实现的是对一幅图像进行卡尔曼滤波实现多天线时变信道下基于卡尔曼滤波跟踪的数字图像通信系统仿真(Realize this procedure is the image of a Kalman filter to achieve multi-antenna time-varying channel tracking based on Kalman filtering of digital image communication system simulation)
- 2007-09-01 16:58:26下载
- 积分：1
-
KalmanTest
现代信号处理 卡尔曼滤波matlab仿真程序(Kalman algorithm ，Modern signal processing)
- 2010-08-17 23:20:41下载
- 积分：1
-
demarreur3
power system and machine modelling using matlab and simulink
- 2010-09-30 14:13:16下载
- 积分：1
-
zigbee
说明： zigbee三边测量法，简单实用，适合初学者(zigbee trilateration, simple and practical, suitable for beginners)
- 2011-04-15 19:30:20下载
- 积分：1
-
MatlabClassic-tutorial
加你如何快速的熟悉和掌握matlab语言，以及在矩阵运算和数据分析方面的应用(Plus you how to quickly become familiar with and master the matlab language, as well as matrix operations and data analysis applications)
- 2013-07-30 17:55:41下载
- 积分：1
-
ITDB02_Graph
gui file to serial communication
- 2013-03-05 15:25:08下载
- 积分：1
-
代码
copula中对边缘函数的说明copula的均匀分布的估计及Garch模型的拟合(The description of the edge function in copula)
- 2021-02-11 11:39:51下载
- 积分：1
-
EOF
eof主成分分析，供高校本科生研究生使用，气象海洋专业(eof principal component analysis for the use of university undergraduate students, professional marine meteorology)
- 2014-12-30 23:04:02下载
- 积分：1
-
danchunxingfa
用单纯形法解线性规划 根据单纯形法的原理，在线性规划问题中，决策变量（控制变量）x1，x2，…x n的值称为一个解,满足所有的约束条件的解称为可行解。使目标函数达到最大值（或最小值）的可行解称为最优解。这样，一个最优解能在整个由约束条件所确定的可行区域内使目标函数达到最大值（或最小值）。求解线性规划问题的目的就是要找出最优解。 (According to the principle of the simplex method, in linear programming problem, the decision variables (control variable) x1, x2,... X n value is called a solution, meet all of the constraint conditions of the solution of the called feasible solution. The objective function to achieve maximum (or minimum) feasible solution of the optimal solution is called. So, an optimal solution by constraint conditions throughout the feasible region determined the objective function to achieve maximum or minimum value). To solve the linear programming problem is to find out the purpose of the optimal solution.
)
- 2011-12-19 15:39:08下载
- 积分：1
-
bemlabecom
Boundary element method
function [index,g,h,a,unb,x,u,un,uin]=bemlabecom(n,c,index,in,cin)
[index,g,h,a,unb,x,u,un,uin]=bemlabecom(16,[0 0 0.25 0 0.5 0 0.75 0 1 0 1 0.25 1 0.5 1 0.75 1 1 0.75 1 0.5 1 0.25 1 0 1 0 0.75 0 0.5 0 0.25 0 0],[1 0 1 0 1 0 1 0 0 200 0 200 0 200 0 200 1 0 1 0 1 0 1 0 0 100 0 100 0 100 0 100],9,[0.25 0.25 0.50 0.25 0.75 0.25 0.25 0.50 0.50 0.50 0.75 0.50 0.25 0.75 0.50 0.75 0.75 0.75])
in bemlabecom2 we change a & unb to : a1 a2,unb1 unb2
n=number of nodes=number of element=number of point
c=matrix that determine the coordinate of point
m=coordinate of nodes in global coordinates
index: determine u or un for boundary nodes
in:number of internal nodes
cin: coordinate of internal nodes
- 2012-01-29 03:47:10下载
- 积分：1
