TSPproblem

face database for face recognition

This chapter contains sample programs for determining capacity. The reader is advised to go through the coding. The file "capacity_water.m" is for measuring the waterfilling capacity. It should be made to work with a file similar to "capacity_plot_main.m". The latter file deals with all the other capacity plots given in the book in Chapter 2. All programs are verified with MATLAB versions 6.0 and above with signal processing and communications toolboxes.(This chapter contains sample programs for determining capacity. The reader is advised to go through the coding. The file " capacity_water.m" is for measuring the waterfilling capacity. It should be made to work with a file similar to " capacity_plot_main.m" . The latter file deals with all the other capacity plots given in the book in Chapter 2. All programs are verified with MATLAB versions 6.0 and above with signal processing and communications toolboxes.)

mpedance matrix by the method

SHIELDING EFFECTIVENESS OF DIFFERENT MATERIALS AT DIFFERENT FREQUENCY

Simulink of onduleur MLI

[自動控制]Time domain 2 norm 計算程式。輸入system function(由TF, ZPK, SS, FDS建立)，程式會自動計算2-norm.(NORM2(G) computes the 2-norm, i.e. the RMS value, of a strictly proper stable system G (created with either TF, ZPK, SS, or FRD). || [RMS_VALUE, AUG_ROUTH_TABLE]=NORM2(G) returns the RMS value and the augmented routh table of the given system. || Get the numerator and denominator of the system transfer function )

讲述在designer 6中差分布线的方法(About the difference in the designer 6 in the method of wiring)

简单电力系统的牛顿法潮流计算收敛初步分析程序(preliminary study a simple system’s convergent character of the Newton s law applied to calculate the flow.)

直升机的三个姿态角的pid控制算法，matlab中的simulink仿真程序，配合最优pid设计算法，得到很好的控制效果(Three attitude angle of the helicopter pid control algorithm matlab in simulink simulation program, with the optimal pid design algorithm, well controlled)

运用matlab语言，A*算法实现移动机器人路径规划(Path Planning: A* Algorithm Navigating a terrain and finding the shortest path to a Goal location is one of the fundamental problems in path planning. While there are many approaches to this problem, one of the most common and widely known is the A Star search.)