《Optimal State Estimation - Kalman, H Infinity, and Nonlinear Approaches》 一书的配套源码，包括了Kalman Filter、Hinf Filter、Particle Filter等的Matlab源码
标签： Estimation Approaches Nonlinear Infinity
上传时间： 2013-12-20
上传用户：caozhizhi
ISGCSSecure增强Client/Server系统安全的控件。(源代码，需注册）价格：$799。工作在：CB1 CB3 D3 D4 D5。作者：Infinity Software Group
标签： ISGCSSecure Client Server 系统安全
上传时间： 2013-12-14
上传用户：笨小孩
Mapack可用来做矩阵运算 Mapack is a .NET class library for basic linear algebra computations. It supports the following matrix operations and properties: Multiplication, Addition, Subtraction, Determinant, Norm1, Norm2, Frobenius Norm, Infinity Norm, Rank, Condition, Trace, Cholesky, LU, QR, Single Value decomposition, Least Squares solver, Eigenproblem solver, Equation System solver. The algorithms were adapted from Mapack for COM, Lapack and the Java Matrix Package.
标签： Mapack computations supports algebra
上传时间： 2017-01-26
上传用户：tb_6877751
We analyze, both analytically and numerically, the effectiveness of cloaking an infinite cylinder from observations by electromagnetic waves in three dimensions. We show that, as truncated approximations of the ideal permittivity and permeability tensors tend towards the singular ideal cloaking fields, so that the anisotropy ratio tends to Infinity, the D and B fields blow up near the cloaking surface. Since the metamaterials used to implement cloaking are based on effective medium theory, the resulting large variation in D and B will pose a challenge to the suitability of the field averaged characterization of " and 碌. We also consider cloaking with and without the SHS (softand- hard surface) lining, shown in [6] to be theoretically necessary for cloaking in the cylindrical geometry. We demonstrate numerically that cloaking is significantly improved by the SHS lining, with both the far field of the scattered wave significantly reduced and the blow up of D and B prevented.
标签： effectiveness analytically numerically cloaking
上传时间： 2017-03-30
上传用户：zxc23456789
void DFS(MGraph G, int i) { int j; visited[i] = TRUE; printf("%c ", G.vexs[i]); for (j=0; j<G.numVertexes; ++j) { if (G.arc[i][j]!=Infinity && !visited[j]) DFS(G, j); } }
上传时间： 2016-12-28
上传用户：chenyameng
