-
A2
说明： Matlab光学设计程序
给出了一种光学设计的程序,对光学薄膜设计的人很有用(Matlab source code for optical design)
- 2009-03-10 19:56:36下载
- 积分：1
-
bpprogramming
说明： 这个程序根据训练好的网络文件ANN.mat预测新的数据文件，得到均方误差，并画出预测数据和原数据的对比图。此程序运用到了很多Matlab编程中常用到的表达方式，还有一些神经网络编程的基本概念的表达，如归一化的表达。希望能对大家有所帮助(This program the trained network file ANN.mat predict new data file, get the mean square error, and forecast data and the original data to draw the comparison chart. This procedure applied to a lot of Matlab programming to the expression commonly used, there are some basic concepts of neural network programming expression, as normalized expression. Hope you can help)
- 2010-04-16 20:56:48下载
- 积分：1
-
one-dimensional-wave-equation
一维线性齐次波动方程，用matlab语言实现，利用边界值和边界条件进行求解(One-dimensional linear homogeneous wave equation, with the matlab language, use of boundary value and boundary conditions to solve)
- 2011-05-12 21:58:37下载
- 积分：1
-
gui_filter
Design of Filters using GUI (The code provides the user friendly GUI usage in filter design)
- 2009-09-21 19:24:43下载
- 积分：1
-
Modified_delta
It is a huge matlab document, kinematic represantation and control of Modified Delta Mechanism which consists all S-Function block diagrams.
- 2009-05-11 01:22:12下载
- 积分：1
-
Arnold000
说明： 这是一个混沌的Anrold变换 他是一次变换加密 是一个混沌加密入门程序(This is a chaotic Anrold transform He is a transformation encryption is a chaotic encryption entry procedures)
- 2021-03-03 15:39:33下载
- 积分：1
-
double_pendulum_documentation
double_pendulum_documentation paper about it
- 2014-01-25 15:47:59下载
- 积分：1
-
ga
本程序是作者在科研项目中，编写并亲测。该程序用来求解无约束单目标优化问题。对于约束优化问题，可做相应的修改，即可使用。(Genetic Algorithm coded in Matlab. We used the program to solve the unconstrained optimization problems.)
- 2014-09-26 17:07:38下载
- 积分：1
-
duhamel
杜哈梅积分的过程，适合初学者，详细程序，强烈推荐(Duhamel integral process, suitable for beginners, detailed procedures, it is strongly recommended)
- 2020-09-14 07:37:58下载
- 积分：1
-
ACO
TSP问题的人工蚁群算法中，假设m只蚂蚁在图的相邻节点间移动，从而协作异步地得到问题的解。每只蚂蚁的一步转移概率由图中的每条边上的两类参数决定：1、信息素质，也称信息素痕迹。2、可见度，即先验值。(Artificial ant colony algorithm TSP problem, assume that m ants move between adjacent nodes in the graph, which asynchronously collaborate get problem solution. Each ant transition probability is determined by the figure of two kinds of parameters for each edge: 1, the quality of information, also called pheromone trails. 2, visibility, ie priors.)
- 2016-10-10 20:51:31下载
- 积分：1
