fir-filter

“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)

此函数为在matlab软件编写的图像合并函数。(this is a m function for two image merging.)

the binary knapsack problem in matlab

Control systems files1, hope it helps people

子载波数128位数/ 符号 2符号数/ 载波 1000训练符号数 0循环前缀长度8 调制方式 64-QAM多径信道数3 IFFT Size128 信道最大时延 2(The number of sub-carriers 128 digits/Symbol 2 Symbol/Carrier 1000 training symbols 0 cyclic prefix length 8 modulation mode, multi-path channel, 64-QAM 3 IFFT Size128 channel maximum delay)

说明：  数据快照的特征提取，获得基模态、特征值和模态系数，以及数据的后处理。(Feature extraction of data snapshot, obtaining basic modes, eigenvalues and modal coefficients, and post-processing of data.)

基于matlab编程，仿真。matlab编程百例有助于熟悉matlab基本编程命令，最好成为编程高手。小数据量法求lyapunov指数源程序，可以减轻做混沌控制与同步研究的编程苦恼。(Matlab-based programming, simulation. 100 cases of familiar programming matlab help matlab command of basic programming, preferably as a programming expert. Method of small amount of data source lyapunov index can be done to alleviate study of chaos control and synchronization of programming distress.)

关于改进设计的状态反馈控制器的网络控制系统，详细的对参数的改变进行了设计。(Improvement of State Feedback Controller Design for Networked Control Systems)

关于电力系统暂态稳定短路计算的一些源程序同时是有关matlab优化的源程序(Short circuit on the power system transient stability calculation of some of the source code is also optimized for matlab source code)

用有限差分法编程求解拉普拉斯方程在网格结点处的值并统计迭代次数(Solving the value of the Laplace equation in a grid junction with the finite difference method and statistical programming iterations)