-
watermarking
说明： 实现抗各种攻击的matlab数字水印，尤其是几何攻击，包括剪切、旋转。有嵌入，提取，攻击，检测过程。(realized a new watermarking algorithm which can resist all kinds of attacks.)
- 2010-03-22 10:12:49下载
- 积分：1
-
matlab_example-easy-to-study
对matlab各函数的一个串讲，对学习过但很久没用的同学回忆功能非常有用。(some classic examples make matlab easy to study )
- 2012-08-18 10:40:26下载
- 积分：1
-
sanchongDC
三重化双向buck—boost电路 实现三重化dc dc双向buck—boost电路的功能(Triple bi-directional buck-boost circuit)
- 2020-10-16 21:47:28下载
- 积分：1
-
MATLAB-6.5-User-Guide
《Matlab 6.5 用户手册》详细讲解了Matlab 6.5的各种功能及使用，本书为英文版，对于英文较好的初学者帮助很大。(The Matlab 6.5 User' s Manual " explain in detail the various functions of Matlab 6.5 and use, for the English version of the book, a great help for English better beginners.)
- 2013-03-26 14:35:09下载
- 积分：1
-
UMHexagonS
说明： 关于UMHexagonS方式的一些论文，使用CAJviewer阅读(UMHexagonS)
- 2010-04-29 14:56:48下载
- 积分：1
-
Gaze-Estimation
一篇IEEE上的比较好的视觉估计的文章。(Appearance-Based Gaze Estimation Using Visual Saliency )
- 2013-03-02 20:18:23下载
- 积分：1
-
PMAC-Executive-Pro2-Suite_4_4_0_0
pmac应用软件 主要用于PMAC运动控制卡的开发(application of pmac)
- 2021-03-06 12:09:30下载
- 积分：1
-
fuzzy-PID-controller
Genetic multi-stage fuzzy PID controller with a fuzzy switch
- 2013-11-13 15:05:35下载
- 积分：1
-
Simulink.with.Engineering.Applications-
Simulink engineer orchard
- 2009-05-29 09:44:29下载
- 积分：1
-
danchunxingfa
单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。
(Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination.
)
- 2011-01-17 21:01:44下载
- 积分：1
