multiuser

是Matlab图像处理的原程序代码，适合初学者使用。(Matlab image processing is the original code, suitable for beginners.)

我收藏的c語言900個例題，裡頭有控制dos-bios,memory,macros,math....的一些範例，原碼可能很簡單但是很實用，希望大家喜歡(language collections c 900 of excellence, he got control dos-bios, memory, macros, math .... some example, the original code may be very simple but very useful, hope you like)

GUI源程序，与21世纪电子论坛系列教程中10分钟学习GUI课程配套使用(GUI source code,the 21st Century electronic forum tutorial series of 10-minute learning GUI programs )

本代码给出了LTE 2天线,4天线发送分集以及接收端解分集的处理过程.(This Code give a way to process 2 and 4 antaners Transport Divation in LTE system.)

用matlab来仿真ofdm调制算法，ofdm技术用于4G无线通信系统。(Ofdm simulation using matlab to modulation algorithm, ofdm technology for 4G wireless communications systems.)

图像的平面微分平方和能够反映图像高频分 量的能量。用计算平面微分平方和的方法在空间域上计算相邻像素亮度差值的平方和，对应于在频率域上计算图像高频分量的能量和，此值越大，图像对焦越准确(Differential square image plane and the image can reflect the energy of high frequency. Computational method of Planar Differential squares calculated in the space domain to the square of the difference between the brightness of adjacent pixels and corresponds to the image in the frequency domain calculation of high frequency energy and, this value is larger, the more accurate the image focus)

to generate unimorm random numbers between 0 & 1 using lcm method

MATLAB 牛顿下山法的一个小程序，原理就不详细说了。因牛顿迭代法受初值选取的限制，为防止迭代发散，对迭代过程再附加一项要求:|f(x(k+1))|<|f(x(k))|,将牛顿法迭代的结果:x(k+1) =x(k)-f(x(k))/f (x(k))和前一近似值x(k)适当加权平均做为新的改进值:x(k+1)=u*x(k+1) +(1-u)*x(k),其中u(0<> 迭代时u取1开始，逐次减半计算，直至附加要求符合为止。实例计算中x(k)=x(0)不变，只更新u和x(k+1)，直至:|f(x(k+1))|<|f(x(k))|（即|f(x(1))|<|f(x(0))|)，然后更新下山因子为u=1,继续以牛顿法迭代。(MATLAB Newton-down a small program, the principle is not explained in detail. Newton iteration by the initial value of the selected limit, in order to prevent additional iterative divergence, the iterative process a request: | f (x (k+1)) | < | f (x (k)) | Newton iteration Results: x (k+1) ' = X (k)-f (x (k))/f' (x (k)) and a previous approximation x (k), appropriately weighted average as a new improved value: x (k+1 ) = u* x (k+1) ' + (1-u)* x (k), where u (0 < u> iteration take successive calculated at 50 until the additional requirements found so far. examples of calculation of X ( k) = x (0) unchanged profile u and x (k+1, hungry) until: | f (x (k+1)) | < | f (x (k)) | (i.e. | f (x (1)) | < | f (x (0)) |), then profile downhill factor for u = 1, to continue to Newton iteration.)

travel guide to bergen

PICTURE SEGMENTATION Using a RECURSIVE CLUSTERING SPLITTING METHOD