RF_TE

包含了通信系统方面调制解调的基本仿真代码，适合学生学习使用(Communication system includes a basic modem simulation code, suitable for students studying the use of)

ADVANCED MOUSE POINTER CONTROL USING TRAJECTORY

说明：  FIR滤波器的设计，刚开始用matlab的可以参考下，(FIR filter example,those who just begin to learn matlab can refer to these programs.)

dynamic econ toolbox

该程序是用L-Z复杂度算法检测VF信号的算法，并用的MIT-BIH数据库中的数据加以实现的。(The program is used LZ complexity algorithm to detect VF signal algorithm, and use the MIT-BIH data in the database to be achieved.)

最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下，此类问题的研究试图寻找出：流量从A到B，如何选择路径、分配经过路径的流量，可以达到所用的费用最小的要求。(Minimum cost maximum flow problem is economics and management in a class of typical problems. Each path in a network has the " capacity" and " costs" two limiting conditions, such problems of trying to find out: Flow from A to B, how to choose the path, the path of the flow through the distribution can be achieved The use of the minimum cost requirements.)

文件包括：1.计算平均最短路径；2.计算每个顶点相邻节点的平均度；3.计算每个节点的邻近中心度；4.计算节点的介数（slow）；5.计算节点的介数（faster）；6.计算每条边的介数值；7.快速迪杰斯特拉算法；8.经典迪杰斯特拉算法。(1.the average shortest path in the graph 2.the average degree of neighboring nodes for every vertex 3.computes the closeness centrality for all vertices 4.node betweenness, (number of shortest paths definition) 5.a faster node betweenness algorithm 6.edge betweenness, (number of shortest paths definition) 7.simple Dijkstra, does not remember the path 8.Dijkstra which also returns the shortest paths.)

generate random number (show how to generate random number in COmmunication)

本程序为GS算法，基于MATLAB编写，用于恢复光场中的相位信息，在信息光学，生物显微领域有广泛的应用(This procedure for the GS algorithm, based on MATLAB, is used to restore the phase information of the light field, in information optics, biological microscope fields have a wide range of application)

一种非线性传递函数 - Kohonen学习规则 (A nonlinear transfer function- Kohonen learning rule)