thesesonpv

matlab地图工具箱的详细介绍，对需要绘制地图可以一看。(Map of the toolbox matlab detailed description of the need to draw the maps can have a look.)

power_transient.rar.功率电子领域matlab仿真文件，已经验证过，程序运行正常(power_transient.rar, Power electronics field matlab simulation file, has already been verified, the normal operating procedures)

matlab中大津法（otsu）的源代码程序，已经经过测试，可以在matlab中直接运行(matlab in Otsu (otsu) program source code, has been tested and can be run directly in matlab)

matlab 学习资料 第四章 matlab 绘图(Chapter IV of learning materials matlab mapping matlab)

new method to contrast enhancement

基于平均电流法设计的APFC高频开关电源MATLAB仿真模型(APFC MATLAB simulation model of high-frequency switching power supply design based on the average current law)

超宽带无线通信的NAKAGAMI信道的各种经典论文。对于该信道的uwb学习很有指导作用(UWB ，NAKAGAMI channel)

根据” J.S. Erkelens and R. Heusdens, "Tracking of nonstationary noise based on data-driven recursive noise power estimation”所开发的源码(noisetracker based on data-driven recursive noise power estimation)

说明：  光伏电池板模型，仿真p-u曲线等。自动将excel中的多条不同的温度、光照等数据读入，并连续运行输出保存每个工况数据(PV simulink model。it can read different input initial parameters from excel，then run the pv model and save the power data of each case automatically。)

DTW算法的程序，申请两个n*m的矩阵D、d,分别为累积距离和帧匹配距离。这里n和m为测试模版与参考模版的帧数。然后通过一个循环计算两个模版的帧匹配距离d。接下来进行动态规划，为每个格点 （i，j）都计算其三个可能的前续格点的累积距离D1，D2，D3。考虑到边界问题，有些前续格点可能不存在，因此加入一些判断条件最后利用最小值函数min()，找到三个前续格点的累积 距离作为累积距离，与当前帧的匹配距离d（i，j）相加，作为当前格点的累积距离。该计算过程一直达到格点（n，m），并将D（n，m）输出，作为模版匹配的结果。(DTW algorithm procedures, apply two n* m matrix D, d, respectively, accumulated distance and frame matching distance. Where n and m is a reference test pattern and the template frames. Then through a loop to calculate two frames template matching distance d. Next, dynamic programming, for each grid point (i, j) are calculated from the cumulative D1 before the renewal of its three possible lattice point, D2, D3. Taking into account the boundary problem, some former continued grid point may not exist, so add some conditions to determine the final use of the minimum function min (), found three former continued accumulation of grid points cumulative distance as the distance from the current frame to match the d (i, j) added, and a current cumulative distance grid. This calculation has reached the grid (n, m), and D (n, m) output, as a result of template matching.)