PVARRAY

OFDM中的关于快速傅立叶变换的个人设计的MATLAB的算法，比较经典的 ！(OFDM on the Fast Fourier Transform personal design MATLAB algorithm, more classic!)

原始snake matlab 源碼，簡單版( seg = localized_seg(I,init_mask,max_its,rad,alpha,method) Inputs: I 2D image init_mask Initialization (1 = foreground, 0 = bg) max_its Number of iterations to run segmentation for rad (optional) Localization Radius (in pixels) smaller = more local, bigger = more global alpha (optional) Weight of smoothing term higer = smoother method (optional) selects localized energy 1 = Chan-Vese Energy 2 = Yezzi Energy (usually works better))

基于聚类分析的蚁群算法，主要是应用于多目标选址问题(Ant colony algorithm based on cluster analysis is mainly used in multi-objective location problem)

This Matlab-code is a demo for real-time audio and image processing.

说明：  物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes (logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U.)

海伦方法分析偶极子天线的频率阻抗特性-电阻随频率的变化，电抗随频率的变化(Helen analyze the frequency dipole antenna impedance- resistance changes with frequency, the change of reactance with frequency)

惯性导航和GPS实现组合导航算法，应用卡尔曼滤波实现(navigation kalman filter)

THIS IS ABOUT JULIA SET COSTRUCTION

Contain Matlab files in digital steganography

关于ofdm的matlab仿真，包括绝大部分基于802.11a标准的程序。(about matlab simulate of ofdm system,including the most program base on 802.11a standar.)