PROGRAMSFolder

function exp85 clear all p=[0:0.1:1.1] t=[22.4570 26.6012 12.6416 5.9367 6.9265 28.2432 31.5068 37.0166 7.8947 1.0398 12.7095] net=newff([0 1],[5 1],{ tansig purelin }, traingdx , learngdm ) net.trainParam.epochs=2500 net.trainParam.goal=0.001 net.trainParam.show=50 net=train(net,p,t) r=sim(net,p) plot(p,t,p,r, * ) y=sim(net,[1.2])

induction motor servo drive

说明：  基于分形理论谱峰检测研究，分形算法。。。。。。。。。。。。。。。。(aaaaaaaaaaaaaaaaaaaaaaa)

基于bp神经网络的水质神经网络预测系统，matlab 源程序。(Bp neural network based on neural network prediction system of water quality, matlab source code.)

移动无线信道COS207模型MATLAB程序(Mobile radio channel model MATLAB program COS207)

利用蚁群算法通过matlab寻找旅行商问题的最优路径(The optimal path of ant colony algorithm for traveling salesman problem)

Tests for KeyManagerFactory</code> class constructors and methods.

说明：   提供一个锐利衰落衰落的信道模型 共同学习，共同提高，资源共享 (provide a sharp decline in the decline of common channel model for learning, enhancing and sharing resources)

Euclidean Distance Transform has been widely studied in computational geometry, image processing, computer graphics and pattern recognition. Euclidean distance has been computed through different algorithms like parallel, linear time algorithms etc. On the basis of efficiency, accuracy and numerical computations, existing and proposed techniques has been compared. This study proposed a new technique of finding Euclidian distance using sequential algorithm. An experimental evaluation has shown that proposed technique has reduced the drawbacks of existing techniques. And the use of sequential algorithm scans has reduced the computational cost.

prints the current YMDHMS date as a timestamp