An-improved-image-compression

设r是f(x) = 0的根，选取x0作为r初始近似值，过点（x0,f(x0)）做曲线y = f(x)的切线L，L的方程为y = f(x0)+f (x0)(x-x0)，求出L与x轴交点的横坐标 x1 = x0-f(x0)/f (x0)，称x1为r的一次近似值。过点（x1,f(x1)）做曲线y = f(x)的切线，并求该切线与x轴交点的横坐标 x2 = x1-f(x1)/f (x1)，称x2为r的二次近似值。重复以上过程，得r的近似值序列，其中x(n+1)=x(n)－f(x(n))/f (x(n))，称为r的n+1次近似值(Let r is f (x) = 0 root, select the initial approximation x0 as the r, over point (x0, f (x0)) to do the curve y = f (x) the tangent L, L the equation y = f ( x0)+ f ' (x0) (x-x0), find the intersection of L and the x-axis of abscissa x1 = x0-f (x0)/f' (x0), x1 is called an approximation r. Through points (x1, f (x1)) to do the curve y = f (x) the tangent, and find the intersection of the tangent with the x-axis of abscissa x2 = x1-f (x1)/f ' (x1), x2 is called r the second approximation. Repeat the process, get an approximation of the sequence r, where x (n+1) = x (n)-f (x (n))/f ' (x (n)), as an approximation of r n+1 times)

Matlab教训，PPT格式，从入门到精通。(Matlab lessons, PPT format, from entry to the master.)

一种基于AODV路由协议的分簇算法研究是无线传感网络现今发展的重要算法(AODV routing protocol based on clustering algorithm 搜索)

two path fading(qpsk) 这个是我写的关于qpsk的two path fading,站长帮帮忙,我现在很需要一篇<信道估计算法>(基于瑞利衰落信道的LS算法的Matlab程序),后天就要交了,救人一命胜造7级浮屠啊!(two path fading (qpsk) This is what I wrote on the two p qpsk ath fading, the station help out, I am now a need)

A program written for PSO

You can now convert the sentences in image to a text format

说明：  鲸鱼算法优化支持向量机，可用于类预测，测试可用(Whale optimization algorithm optimization support vector machine)

open source detection face with matlab

Introduction to Kalman Filter

本文详细介绍了matlab对txt文件数据的导入导出问题(This paper describes a txt file matlab for data import and export issues)