PUGUJI

Linear array acoustic phase delay beamformer including four plots: windowless, and Chebyshev, Gaussian and Tukey windows.

很简单易懂的卡尔曼滤波算法，希望能帮助到初学者(kalman filter)

control systems file, hope helps people

Ce fichier mdl permet de tracer la caractéristique pv

UPX GUI Compressor By Chuli

Google KML Contour Plot / Wind Arrows Plot

采用matlab编写的steffensen迭代法(Steffensen prepared by iteration matlab)

cdma系统matlab仿真，在两个用户的背景下采用了直接扩频码实现扩频解扩，bpsk调制解调，程序已经运行过，没有问题！(cdma system matlab simulation, in the context of two users using a direct spread spectrum spreading codes realize despreading, bpsk modem, the program has been run before, no problem!)

说明：  整个系统分为数据采集和数据分析两大部分，以友好的图形界面与用户进行交互沟通。 声音数据采集部分实现数据采集功能,根据用户选择的采样频率和预设的采样时间来从声卡获得用户需要的数据。并且将采集到的数据及其频谱图以图形方式很直观的呈现于用户面前。 图像采集分析部分，读入图像后，根据选择，对其进行Linear Conformal、Affine、Projective、Polynomial、Piecewise Linear、Sinusoidal、Barrel、Pin Cushion变换(The whole system is divided into data collection and data analysis of two parts, with a friendly graphical interface to communicate with the user interaction. Sound data collection part of the data collection function, according to user-selected sampling frequency and sampling time to the default user from the sound card to obtain the data needed. And the collected data and the spectrum is very intuitive graphically presented in front of the user. Image acquisition and analysis section, read the image, based on the choice of its Linear Conformal, Affine, Projective, Polynomial, Piecewise Linear, Sinusoidal, Barrel, Pin Cushion Transformation )

The Gauss-Seidel technique is intuitive and easy to use on large or small problems. However, you should beware that the convergence tolerance must be carefully selected. Because the convergence criterion is based on the error between iterations, the same convergence criteria may lead to very different results. The direct solution technique presented in Section 2.6.2 is generally preferred over an iterative technique like Gauss-Seidel iteration if a tool such as MATLAB that provides a computationally efficient means of solving sparse matrices is available.