chap2-10

画箭头用的一个matlab程序，箭头是二维度的，需要说如箭头大小的控制参量(draw an arrow,only the two dimmentional arow,and the arrow is composed of three lines,two short an one long,the results may not viry beatuiful but is very simple)

wireless communication relay technologies in LTE-Advanced

coding. Input QUALITY determines the amount of information that 3/20/06 by R.Woods to correct an eob coding problem, to check the quality input for <

Huffman tree:In computer science and information theory, a Huffman code is an optimal prefix code found using the algorithm developed by David A.

说明：  利用EM算法对状态空间模型中的参数进行辨识，效果良好(The EM algorithm is used to identify the parameters in the state space model, and the result is good.)

一种新型的智能控制器，分为定值控制和伺服控制两种情况，被控对象为超大纯滞后对象，通过与PID控制的比较可以发现此新型智能控制器的优点(A new type of intelligent controller is divided into fixed value control and servo control both cases, the plant pure time delay for the large, by comparison with the PID control can find the advantages of this new type of intelligent controller)

vc下如何使用matlab,各种不同方法的介绍 还算详细吧 加油啦大家一起努力(vc matlab)

说明：  在matlab仿真环境下，对直扩通信系统的同步算法及其流程进行说明(Matlab simulation in the environment, on the DS communication system synchronization algorithm and its process description)

kelly capital allocation algorithm in matlab. risk management

设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)