petri

数学建模公交线路问题 该程序利用迪杰斯特拉算法经行求解，使用该代码前最好先阅读Readme.doc(Bus lines mathematical modeling problem using Dijkstra algorithm for the program through the line solution, a good idea to use the code to read Readme.doc)

坐标转换（四参数） [row col]=size(source) for i=1:row u(i)=source(i,2) v(i)=source(i,3) x(i)=source(i,4) y(i)=source(i,5) B(2*i-1,1)=1 B(2*i-1,2)=0 B(2*i-1,3)=u(i) B(2*i-1,4)=-v(i) B(2*i,1)=0 B(2*i,2)=1 B(2*i,3)=v(i) B(2*i,4)=u(i) L(2*i-1,1)=x(i) L(2*i,1)=y(i) end X=inv(B *B)*(B *L) Txy=[X(1) X(2)] xzjz(1,1)=X(3) xzjz(1,2)=-X(4) xzjz(2,1)=X(4) xzjz(2,2)=X(3) [row1 col1]=size(target) for i=1:row1 u1(i)=target(i,2) v1(i)=target(i,3) d=[u1(i) v1(i)] md=Txy+xzjz*d end end (Coordinate conversion： [row col]=size(source) for i=1:row u(i)=source(i,2) v(i)=source(i,3) x(i)=source(i,4) y(i)=source(i,5) B(2*i-1,1)=1 B(2*i-1,2)=0 B(2*i-1,3)=u(i) B(2*i-1,4)=-v(i) B(2*i,1)=0 B(2*i,2)=1 B(2*i,3)=v(i) B(2*i,4)=u(i) L(2*i-1,1)=x(i) L(2*i,1)=y(i) end X=inv(B *B)*(B *L) Txy=[X(1) X(2)] xzjz(1,1)=X(3) xzjz(1,2)=-X(4) xzjz(2,1)=X(4) xzjz(2,2)=X(3) [row1 col1]=size(target) for i=1:row1 u1(i)=target(i,2) v1(i)=target(i,3) d=[u1(i) v1(i)] md=Txy+xzjz*d end end )

关于小波包去噪和小波去噪的matlab程序，对理解小波和小波包两种算法很有帮助。(On wavelet packet denoising and wavelet denoising matlab program for understanding the two algorithms of wavelet and wavelet packet helpful.)

QPSK 编码 课程设计 matlab仿真 毕业设计 源代码 程序(QPSK encoded curriculum design the matlab simulation graduation design source code program)

DETECTING FEATURES OF AN IMAGE

光伏单项并网控制仿真，包括最大功率点跟踪MPPT(Simulation of single grid-connected photovoltaic control, including MPPT with maximum power point tracking)

灰色预测模型的matlab程序，用于对时间序列做预测。(Gray prediction model matlab procedure done for time series prediction.)

基于蚁群算法的机器人路径规划MATLAB源码(Ant colony algorithm based on MATLAB source code for robot path planning)

可以实现粒子群算法与盲源分离算法的结合，比较方便。源信号可以随便替换(PSO algorithm can be achieved with the combination of blind source separation algorithms, more convenient. Source signal can be easily replaced)

最优化方面的牛顿法算法，方便入门同学学习(Newton' s method algorithm optimized with respect to the most convenient entry students learning)