Adaptive-Hierarchical-Isogeometri

建立的基于MATLAB的九点五态控制器的仿真模型，运行正确。(Establishment of a nine MATLAB-based simulation model of five-state controller, run correctly.)

jpeg image compression

擅 蔓：以人脸的表情识别为实验背景， 分析了在对人脸表情的识别过程中，单个独立分薰对识别率的影响，由此进一步总结了在表情识 别中如何更有效地选取独立子空间，以实现在不影响识别率的前提下，减少用于构成独立子空问所需的独立分量的个数。 独立成分分析；表情识别；独立子空间 (Good man: Face to face identification for the experimental background, the analysis of facial expressions in the identification process, a single smoked separate the impact of the recognition rate, thus further summarized in the expression recognition of how to more effectively select the independent sub-space in order to achieve the recognition rate does not affect the premise, for constituting a separate sub-reducing space required for the number of independent component. Independent component analysis expression recognition independent subspace)

machine learning algorithm

knn algorithm used to calcule K-nearest neightbourgh programmed on Matlab application

ofdm signal to noise ratio

基于蒙特卡洛仿真法的起伏数字信号的仿真 瑞丽衰落 原创(Monte Carlo simulation method based on the ups and downs of the digital signal the decline of the original simulation Ruili)

实现了Gardner算法的仿真，可以直观的分析其实现同步的过程(Realize the simulation of Gardner algorithm ,and the process of synchronization can be analyzed intuitively.)

yahoo股票历史数据下载器，matlab编写(yahoo stock historical data downloader, matlab write)

“基于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.)