shuangxianxing

复杂网络中最经典的BA无标度网络模型matlab源程序并且有求解度的程序代码，非常的实用，是研究复杂网络必备的网络模型。(Complex network in the most classic of BA scale-free network model has to solve matlab source and degree of code, very useful, is to examine the complex network required network model.)

Following code converts given video (in.avi) to QVGA (320x240) resolution video (out.avi). This example shows how to use video related functions in MATLAB.

说明：  模拟蚂蚁和食蚁兽的生存规律。在20X20的网格世界里，每个生物每次可向四个方向移动（但不会移除网格边缘），食蚁兽会吃掉在他目标处的蚂蚁(The goal for this programming project is to create a simple 2D predator-prey simulation. In this simulation the prey are ants and the predators are doodlebugs. These critters live in a world composed of a 20x20 grid of cells. Only one critter may occupy a cell at a time. The grid is enclosed, so a critter is not allowed to move off the edges of the world. Time is simulated in time steps. Each critter performs some action every time step.)

小波包变换分析信号的MATLAB程序 小波分析信号去噪 小波分解与重构经典程序(Wavelet packet transform analysis of signals in MATLAB program Signal de-noising wavelet decomposition wavelet analysis and reconstruction classic program)

通过头传输函数的合成3D音效，matlab程序，还是相关的数据(Transfer function through the synthesis of the first 3D sound, matlab program, or related data)

matlab中gui的使用。word格式。(gui in matlab use. word format.)

通信系统中基于MATLAB的四相移相键控调制的仿真(MATLAB-based communication system of the four-phase phase shift keying modulation simulation)

说明：  一种构建BA无标度复杂网络模型的matlab代码，(Construction of a BA scale-free complex network models matlab code)

说明：  图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.(Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)

说明：  基于matlab的蚁群算法程序代码---自寻优(Ant colony algorithm based on matlab code--- self-optimizing)