-
closepole
[自動控制]CLOSED LOOP POLES計算工具，使用者輸入系統Function(由TF, ZPK, SS, FDS建立)，以及feedback controller，程式會計算出closed loop poles.
(CLOSED LOOP POLES calculation tools for automation control.
POLE=POLEPLACE(P,C) returns the closed loop system poles for a given plant P and a given controller C.
Input P is the given plant (created with either TF, ZPK, SS, or FRD).
Input C is the given controller.
Output POLE is a vector representing all desired closed loop poles.
)
- 2009-06-01 14:53:11下载
- 积分：1
-
paper2
Novel fast motion estimation algorithm based on optimizing predictive motion vector
- 2011-12-04 15:43:48下载
- 积分：1
-
wiener
维纳滤波器，用于在PSF已知情况下的反卷积(wiener filtering)
- 2021-04-20 00:18:51下载
- 积分：1
-
MATLAB-2009b
MATLAB 2009b 从入门到精通，关于matlab的相关操作。
(If you are viewing this topic in the MATLAB Help browser, you can run one of
the utilities provided here to create associations in the Windows environment
for common file types used by MATLAB.)
- 2014-12-05 10:47:34下载
- 积分：1
-
1
说明： 按照书本上教材编写的自适应中值滤波函数，很有参考价值(Materials prepared in accordance with the books adaptive median filtering function, a good reference)
- 2010-04-13 13:44:11下载
- 积分：1
-
dijikstra
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
- 2012-04-12 21:01:48下载
- 积分：1
-
DFS
深度优先搜索属于图算法的一种,英文缩写为DFS即Depth First Search.其过程简要来说是对每一个可能的分支路径深入到不能再深入为止,而且每个节点只能访问一次.(DFS Depth First Search is a kind of graph algorithm, English abbreviation for DFS is the Depth First Search. The process is briefly branch of every possible path can t go deep into the deep, and each node can only access at a time.)
- 2015-04-10 10:28:28下载
- 积分：1
-
Anh004
face to face through face-side down until the back face, the only
- 2010-11-03 22:00:51下载
- 积分：1
-
fingerprintconnect
能够将扫描得到的指纹图像连接并去噪,以便能够更好地与指纹库中的图片进行匹配(the program can improve the connectivity of some fingerprint pictures.)
- 2011-05-08 16:45:51下载
- 积分：1
-
OFDM_10G_transmiter
matlab 代码实现的ＯＦＤＭ发射机，matlab 代码实现的ＯＦＤＭ发射机(OFDM orthogonal frequency division multiplexing)
- 2011-05-24 20:35:24下载
- 积分：1
