start

Modal analysis in Matlab to calculate all modal parameters from a structure

Hamming distance calculator Calculates the hamming distance between any two bit pattern. The bit pattern must be of same length.

基于MUSIC算法的矢量阵波达方向估计(MUSIC algorithm based on vector array Direction of Arrival Estimation)

作为一个功能强大的工具软件，Matlab具有很强的图形处理功能，提供了大量的二维、三维图形函数。由于系统采用面向对象的技术和丰富的矩阵运算，所以在图形处理方面即常方便又高效。(As a powerful software tool, Matlab has a strong graphics capabilities, providing a large number of two-dimensional, three-dimensional graphics functions. Since the system uses object-oriented technology and rich matrix computation, graphics processing, so that is often convenient and efficient.)

to find out the average histogram and then to detect the shot detection from vidio

刘金琨老师书上的滑模matlab模型程序，很具有代表性的例子，适合各阶段的滑模学习。(Liu Jinkun teacher book sliding mode matlab model program, it is a typical example.)

为了能结合Java和 Matlab两者的优点，构造功能更加强大的科学计算环境，对使用Java语言扩展Matlab 主开发环境 自身功能的关键技术进行了研究。首先介绍了使用 Java扩展 Matlab 的基本方法，在此基础上结合项目实践中对复杂图形用 户接口的需要，提出了一种在 Java 对象中通过 Matlab 接口对象访问当前Matlab会话的方法。给出了两个短小完整实例，可 用于进一步扩展与重用。(To be able to combine both Java and Matlab the advantages of structure more powerful scientific computing environment, the expansion of the use of Java language development environment Matlab master key technologies for its own function were studied. First introduced the use of Java to expand the basic method of Matlab, on the basis of the practice of combining items of complex graphical user interface needs, a Java object in Matlab interface object access through the current method of Matlab conversation. Given two examples of short integrity, can be used to further expand and reuse.)

Hi I am a student an best regard for you.

TSP的遗传算法实现。本案例是通过遗传算法实现旅行商问题(TSP genetic algorithm. Through genetic algorithm traveling salesman problem)

说明：  禁忌（Tabu Search）算法是一种亚启发式(meta-heuristic)随机搜索算法，它从一个初始可行解出发，选择一系列的特定搜索方向（移动）作为试探，选择实现让特定的目标函数值变化最多的移动。为了避免陷入局部最优解，TS搜索中采用了一种灵活的“记忆”技术，对已经进行的优化过程进行记录和选择，指导下一步的搜索方向，这就是Tabu表的建立。(Tabu Search algorithm is a meta-heuristic random search algorithm. It starts from an initial feasible solution, chooses a series of specific search directions (movement) as a trial, and chooses to achieve the movement that makes the most changes in the value of a specific objective function. To avoid falling into local optimum, TS search uses a flexible "memory" technology to record and select the optimization process that has been carried out, and to guide the next search direction, which is the establishment of Tabu table.)