shuiyin

有限元求解possion方程的matlab代码(Finite Element Analysis of Possion equation matlab code)

matlab的实例，是关于模糊c均值的一个小程序(Matlab example of the fuzzy c-means a small program)

焊接点热源温度场模拟，对于焊接温度场模拟很有用处(Weld heat source temperature field simulation)

Places information on a communications pipe. When two threads want to pass data back and forth, one creates a piped writer and the other creates a piped reader.

短时傅里叶变换函数，用以实现信号的短时傅里叶变换，观察时频图(Short-time Fourier transform functions to implement short-time Fourier transform signal, when observed frequency diagram)

二分搜索法 其中包含三个文件求其解析解太难 用二分法 快速搜索 并保证其一定的精度 (Binary search algorithm to find the optimal solution by dichotomy)

pwm半桥逆变,经典案列，经测试没问题，运行很好。PWM half bridge inverter, the classic case, tested no problem, the operation is very good.(PWM half bridge inverter, the classic case, tested no problem, the operation is very good.)

RRT 的思想是快速扩张一群像树一样的路径以探索（填充）空间的大部分区域，伺机找到可行的路径。(The idea of RRT is to rapidly expand a group of tree-like paths to explore (fill) most areas of space, waiting for the opportunity to find feasible paths.)

not bad ofdm simulation

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