-
suggestion_for_hardware_engineer
硬件工程师必读攻略，提供了如何通过仿真有效提高数模混合设计性的有效建议(Hardware engineers must-read Raiders, provides a simulation of how to effectively improve the digital-analog hybrid design of effective proposals)
- 2010-03-12 17:15:51下载
- 积分：1
-
ganzhiqi
说明： 自己编写的感知器算法的程序，用于模式识别的，仅供参考。(The Perceptron algorithm have written procedures for reference purposes only.)
- 2010-03-21 16:11:15下载
- 积分：1
-
No_Speedsensor_vc
基于无速度传感器的异步电机调速系统，运用电流来合成磁链，控制方法是转子磁链定向。采用电流滞环控制，电网电压380V，转矩最大达30N.m。波形效果不错。(Based on speed sensorless induction motor speed control system, using current flux synthesis method for controlling the rotor flux orientation. Use current hysteresis control, grid voltage 380V, maximum torque of 30N.m. Waveform good results.)
- 2015-09-28 17:53:19下载
- 积分：1
-
MATLABzaidandaofangzhendeyingyong
分析了弹道仿真数学模型的特点、并以滑翔增程弹为例，详细研究了在M文件、simulink工具箱以及两者交互使用环境下建立外弹道质心运动系统仿真模型的方法和优缺点。
(Analysis of the ballistic characteristics of the mathematical model simulation and Gliding Range shells as an example, a detailed study of the M paper, simulink toolbox and use both interactive environment to establish external ballistics center of mass movement system simulation model and the advantages and disadvantages.)
- 2008-05-22 19:16:21下载
- 积分：1
-
tsp_nn
旅行商问题（TSP）的最近邻（NN）算法
近邻算法产生不同的结果，取决于选择哪个城市作为起点。此功能决定近邻路线为多个出发点，并返回这些航线的最佳。
(TSP_NN Traveling Salesman Problem (TSP) Nearest Neighbor (NN) Algorithm
The Nearest Neighbor algorithm produces different results depending on which city is selected as the starting point. This function determines the Nearest Neighbor routes for multiple starting points and returns the best of those routes)
- 2012-04-06 20:27:45下载
- 积分：1
-
zs-thinning
为非常经典的zs细化算法，带有测试图片和matlab程序，可对测试图片进行zs细化(is the classical zs thinning)
- 2014-12-05 11:03:28下载
- 积分：1
-
0-1programming
0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。另：胡运权所著的《运筹学基础及应用（第三版）》第97页的例3，我用本程序求解得到的结果是：最优解是x*=(1,0, 0, 0, 0)，最优值是f(x*)=8，但书求得最优解是x*=(1,0, 1, 0, 0)，最优值是f(x*)=4，是不是书中写错了，请大家验证。以下是源程序，大家可以任意使用无版权问题，另外，如果大家有大规模的0-1规划的问题也希望提供给我，谢谢。变量个数至少是3个(0-1 Integer Programming is a very broad background, such as assignment, bags and so on. actually TSP is a 0-1, of course, these problems are NP, for larger problem with the law is not exhaustive approach in an acceptable time frame to obtain the optimal solution. this procedure is only one practice, farewell tour is the method used recursive all of the solutions to show. Another : Hu Yun-author of "operational research, and application base (third edition)" Article 97 of the three cases, I use this procedure to solve the result is : is the optimal solution x = (1,0, 0, 0, 0), the optimal values of f (x*) = 8, but the book is to find the optimum solution x = (1,0, 1, 0, 0), the optimal values of f (x*) = 4, the book is not a mistake, please certification. Following is the source)
- 2006-07-01 10:33:18下载
- 积分：1
-
ImageRegistrationmodel
image affine transformation using linear an nonlinear methods
- 2013-04-05 12:02:03下载
- 积分：1
-
spatial_based-algorithms.m
Spatial based to remove dct artifacts
- 2013-10-20 21:01:56下载
- 积分：1
-
lsfdf
使用蟻群演算法來求解旅行推銷員問題於matlab上(Using ant colony algorithm to solve the traveling salesman problem in matlab)
- 2010-08-12 23:44:47下载
- 积分：1
