old_winner

this project is my first project. this is simple game .

matlab读取dbf格式文件，使用成功可以。(matlab read dbf format file)

可以对比较复杂的微分方程进行求解，比如说是二阶系数微分方程。(More complex differential equations can be solved, for example, is a second-order differential equation coefficients.)

matlab程序语言，三自由度模型对象，主动控制，lqr算法，求解位移与速度(the matlab programming languages, three degrees of freedom model objects, active control, lqr algorithm solving the displacement and velocity)

基于牛顿拉夫逊法的潮流计算程序源代码，有例子(Newton Raphson method based on the trend of computer program source code, there are examples)

Contacts Settings Test extends Instrumentation Test Case.

基于子空间的盲信道估计算法，用的是奇异值的分解Subspace-based blind channel estimation algorithm, using a singular value decomposition (Subspace-based blind channel estimation algorithm, using a singular value decomposition )

自己实现的，模糊C均值聚类的代码，在K-mean上添加了隶属度矩阵。注释详细，方便理解算法步骤(my implementation, Fuzzy C-Means clustering code in the K-mean adding a membership matrix. Notes detailed, easy to understand algorithm steps)

说明：  梯度下降法是一個一階最佳化算法，通常也稱為最速下降法。 要使用梯度下降法找到一個函數的局部極小值，必須向函數上當前點對應梯度（或者是近似梯度）的反方向的規定步長距離點進行疊代搜索。如果相反地向梯度正方向疊代進行搜索，則會接近函數的局部極大值點；這個過程則被稱為梯度上升法。(The gradient descent method is a first-order optimization algorithm, also commonly referred to as the steepest descent method. To find the local minimum of a function using the gradient descent method, an iterative search must be performed to the specified step distance point in the opposite direction of the gradient (or approximate gradient) of the current point on the function. If the search is reversed in the opposite direction to the positive direction of the gradient, it will approach the local maximum point of the function; this process is called the gradient ascent method.)

说明：  网络函数逼近实例1.首先定义正弦函数，采样率为20Hz，频率为1Hz 2.生成BP网络。用newff函数生成前向型BP网络，设定隐层中神经元数目为10 3.对生成的网络进行仿真并做图显示。 4.训练。对网络进行训练，设定训练误差目标为 1e-5，最大迭代次数为300 5.再次对生成的网络进行仿真并做图显示。(Network function approximation example)