Spherical_Harmonic

matalab similink cuk斩波电路 仿真建模(matalab similink cukcircuit simiulation)

采用Matlab的圆柱周期结构的色散数值计算程序(dispersion )

Plot tutorial is using to calculate in Histogram Matlab

计算了半无限大压电铌酸锂半空间中Rayleigh波的传播速度(Calculate the semi-infinite half space piezoelectric lithium niobate Rayleigh wave propagation velocity)

对一个使用相关器或匹配滤波器的二进制通信系统，用Monte Carlo仿真估计Pe，并画出Pe对SNR的图。(A correlator or matched filter using a binary communication system with Monte Carlo simulation estimates Pe, and Pe draw the map of the SNR.)

基于禁忌搜索算法的配电网无功补偿优化规划的 禁忌搜索部分(Optimize the planning of reactive power compensation based on the tabu search algorithm with tabu search part)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

int compare(const char* a, const char* b, int size) { for (int i = 0 i < size i ++) { if (a[i] != b[i]) { return i } } return -1 } (int compare(const char* a, const char* b, int size) { for (int i = 0 i < size i++) { if (a[i] != b[i]) { return i } } return-1 } )

高斯过程的协方差函数 及其选着 列出多个协方差函数

7级级联H桥逆变器 多电平大功率电力电子 中高压无功补偿 变频器 matlab仿真模型(7 cascaded H-bridge inverter multi-level high-power electronic converter high voltage reactive power compensation)