Matlab-Simulink

精通MATLAB参考源码第八章，喜欢MATLAB和神经网络的可以好好学习下，绝对的好资源！(Chapter VIII proficient MATLAB reference source, like MATLAB and neural networks can learn, the absolute good resource!)

MATLAB数值计算经典教程MATLAB numerical classic tutorial(MATLAB numerical classic tutorial MATLAB numerical classic tutorial)

Boundary element method function [index,g,h,a,unb,x,u,un,uin]=bemlabecom(n,c,index,in,cin) [index,g,h,a,unb,x,u,un,uin]=bemlabecom(16,[0 0 0.25 0 0.5 0 0.75 0 1 0 1 0.25 1 0.5 1 0.75 1 1 0.75 1 0.5 1 0.25 1 0 1 0 0.75 0 0.5 0 0.25 0 0],[1 0 1 0 1 0 1 0 0 200 0 200 0 200 0 200 1 0 1 0 1 0 1 0 0 100 0 100 0 100 0 100],9,[0.25 0.25 0.50 0.25 0.75 0.25 0.25 0.50 0.50 0.50 0.75 0.50 0.25 0.75 0.50 0.75 0.75 0.75]) in bemlabecom2 we change a & unb to : a1 a2,unb1 unb2 n=number of nodes=number of element=number of point c=matrix that determine the coordinate of point m=coordinate of nodes in global coordinates index: determine u or un for boundary nodes in:number of internal nodes cin: coordinate of internal nodes

FILE BACK CONVERTER BY USING MATLAB

掌握Matlab视频采集方法。使用USB摄像头，编写程序实现基于Matlab的视频信号采集。(Master Matlab video capture method. The use of USB camera, the preparation of procedures based on Matlab video signal acquisition.)

这个程序用来对于神经网络负荷预测进行训练(This procedure is used for load forecasting neural network training)

随机信号简介和应用卡尔曼滤波器。罗伯特 布朗 和 帕特里克 黄 经典卡尔曼滤波器教材。包括matlab练习和答案。扫描版。(Robert Brown and Patrick Huang Jingdian Kalman filter materials. Including matlab exercises and answers. Scaned version.)

K-means algorithm developed in Matlab. Classify data.

For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).

quantization by matlab