feixianxing1ti

随机快速算法与确定性快速算法的比较,可设置数组大，小包含有实验报告(Fast Algorithm for Stochastic Fast Algorithms and certainty, you can set an array of big and small contain Experimental Report)

SFS_Survey_1_00.tar.gz源代码(SFS_Survey_1_00.tar.gz source code)

balanis antenna code part4

matlab关于时间序列分析的ma模型的有关程序(A matlab project about TIME SERIES ANALYSIS forecasting and control)

说明：  案例选题：1/4车辆悬架模型的建模与仿真 软件工具：matlab的simulink 内容简述：建立路面谱，建立1/4车辆悬架模型，运用simulink对1/4悬架进行路面行驶仿真分析。结果讨论。(Case topic: Modeling and Simulation of quarter vehicle suspension model Software tool: simulink of MATLAB Content Description: the road spectrum is established, the quarter vehicle suspension model is established, and the road driving simulation analysis of quarter suspension is carried out by using Simulink. The results were discussed.)

该资料详细说命了FHOFDM系统的matlab实现(The information in detail the fate FHOFDM system to achieve matlab)

hey i am uploading this code for modulation in matlab...check this out

基于兴趣点的对互信息度的图像匹配算法，介绍详细(Based on the mutual information of the image matching algorithm point of interest, Detailed)

Everything ROC and Precision-Recall curves.

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