资源列表
111
- function pi = solve2(count,m,cc) 借助布冯投针实验 仿真求pi的值 pi=0 frq=0 randNo = binornd(1,cc,1,m) pro=zeros(1,count) for j=1:count for i = 1:m if randNo(1,i) == 1 frq = frq + 1 end pro(i) = frq/i end pi = (2*m)/frq
PSO-algorithm
- 一本介绍粒子群算法的书籍。希望对您有帮助。-A introduction particle swarm algorithm of books. Hope of any help to you.
s_fun_CVT
- 主要是利用恒压方法实现光伏阵列的最大功率点跟踪-Method is to use constant pressure to achieve the main solar array maximum power point tracking
Mppt_sfunction
- 利用扰动观察法实现光伏电池的最大功率点的跟踪-Perturbation and observation method using photovoltaic cells to achieve maximum power point tracking
Mppt_sfunction
- 可实现光伏电池板最大功率点的跟踪，使其输出最大功率-PV panels can achieve maximum power point tracking, so that the maximum power output
SVD
- this file include a svd base watermarking method which is implemented in matlab
dwt_final
- this file include dwt watermarking method which is implemented in malab
water1
- In this file we implemented a dwt watermarking method in matlab
Job1
- 算法导论练习2.3-7：请给出一个运行时间为Θ(nlgn)的算法，使之能在给定一个由n个整数构成的集合S和另一个整数x时，判断出S中是否存在有两个其和等于x的元素。-Introduction to Algorithms Exercise 2.3-7: Please give a running time of Θ (nlgn) algorithm, so that it can in the given form by a set of n integers S and another inte
buck
- Buck降压转换电路的Simulink模型，可实现直流电压的降压-Buck buck converter circuit Simulink model can be achieved step-down DC voltage
Job2
- 算法导论 思考题2-4逆序对问题：设A[1..n]是一个包含n个不同数的数组。如果在i<j的情况下，有A[i]>A[j]，则称( i , j )就称为A中的一个逆序对(inversion)。给出一个算法，它能用Θ(nlgn)的最坏情况运行时间，确定n个元素的任何排列中逆序对的数目。（提示：修改合并算法）-Algorithm is graded 2-4 reverse introduction to question: set A [1.. n] is A contains n A d
xitongmoxing
- 光伏电池板和Boost电路的系统模型，自己仿真时变下步长即可-Boost circuit photovoltaic panels and the system model, its simulation can be time-varying step size under