anfis_sample

曼彻斯特编码，纯属原创。所有参数开放，易于使用。大家发表意见。(Manchester encoding is purely original. All the parameters open, easy to use. Everyone to express their views.)

For inverting a matrix, Gauss-Jordan elimination is about as efficient as any other method. For solving sets of linear equations, Gauss-Jordan elimination produces both the solution of the equations for one or more right-hand side vectors b, and also the matrix inverse A(-1). However, its principal weaknesses are (i) that it requires all the right-hand sides to be stored and manipulated at the same time, and (ii) that when the inverse matrix is not desired, Gauss-Jordan is three times slower than the best alternative technique for solving a single linear set.

线性鲁棒系统的研究，关于记忆和无记忆时滞系统的matlab仿真(Linear robust system of research, on the memory and no memory delay system simulation matlab)

本书基于MATLAB 5.2版，提供了使用MATLAB的实践性指导。(Book based on MATLAB 5.2 version, provides a practical guide to using MATLAB.)

add menu in matlab tools

通过matlab编制程序，对非线性方程组迭代求解。(Through matlab programming, iterative solution of the nonlinear equations)

基于matlab的小波图像降噪，亲测调试成功，但需使用8位深度图片方能完美(Based on the matlab wavelet image noise reduction, pro-test debugging success, but need to use 8-bit depth images can only perfect)

一个非常好的UKF优化的例子，值得大家下载学习！(A good example of UKF, it is well worthing!)

实时数据的matlab仿真程序，可用于信号处理，机械控制等领域(Real-time data matlab simulation program can be used in the field of signal processing, machine control)

The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.