yxyt0004

Given a stack of n disks arranged largest on the bottom to smallest on top placed on a rod, together with two empty rods, the towers of Hanoi puzzle asks for the minimum number of moves required to move the stack one rod to another, where moves are allowed only if they place smaller disks on top of larger disks

GUI示例,包括基本的GUI和右键弹出菜单的简单例子(GUI examples, including basic GUI and a simple example of the context menu)

mini projet matlab engineering

用于arduino的加速度传感器MPU788的库文件(library file of MPU788 for Arduino)

遗传算法求解TSP问题,MATLAB模拟实验,对采用遗传算法解优化问题很有帮助(Genetic Algorithm for TSP problem, MATLAB simulation experiments, using genetic algorithm optimization solutions helpful)

一个使用控制台实现的关于设置开机自启动的小demo。(A realization about using the console to set boot the start of a small demo.)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

用实例演示如何在matlab中调用c++，适用于初学者，很好的例子(With examples demonstrate how to call c++ in matlab for beginners, a good example)

阵列信号处理中的其中一个传统子空间方法仿真程序，二维music算法。(One of the traditional subspace method simulation program in array signal processing, the two-dimensional music algorithm.)

使用有限时域差分法，用matlab模拟三维光子晶体(the simulation of TM mode in three-dimensional photonic crystals)